Data gathering and optimal path selection for wireless sensor networks (WSN) using existing protocols result in collision. Increase in collision further increases the possibility of packet drop. Thus there is a necessity to eliminate collision during data aggregation. Increasing the efficiency is the need of the hour with maximum security. This paper is an effort to come up with a reliable and energy efficient WSN routing and secure protocol with minimum delay. This technique is named as relay node based secure routing protocol for multiple mobile sink (RSRPMS). This protocol finds the rendezvous point for optimal transmission of data using a “splitting tree” technique in tree-shaped network topology and then to determine all the subsequent positions of a sink the “Biased Random Walk” model is used. In case of an event, the sink gathers the data from all sources, when they are in the sensing range of rendezvous point. Otherwise relay node is selected from its neighbor to transfer packets from rendezvous point to sink. A symmetric key cryptography is used for secure transmission. The proposed relay node based secure routing protocol for multiple mobile sink (RSRPMS) is experimented and simulation results are compared with Intelligent Agent-Based Routing (IAR) protocol to prove that there is increase in the network lifetime compared with other routing protocols.
Wireless sensor network is self-organized, scattered, sensing, and data propagation network. Nodes are resource constrained tiny autonomous devices. They are used to sense the environmental conditions in their immediate surroundings and transmit the data to the sink [
Kim et al. [
Similarly, [
In one attempt, the mobile sink is a moving strategy based on remaining energy of the sensor nodes which balance the network workload and increase the network life time [
Reference [
Reference [
An alternative protocol to minimize the energy consumption and overhead during the data retrieval process is proposed in [
A new data gathering scheme named as Maximum Amount Shortest Path to increase the network throughput and to save energy by efficiently assigning the sensor nodes is discussed in [
In [
Based on the literature review of the mobile sinks, this paper proposes a protocol called relay node based secure routing protocol for multiple mobile sink, which is used for data gathering, and the simulation results are compared with IAR protocol. The results are demonstrated in such a way that the proposed protocol performs better in terms of performance metrics like delivery ratio and energy efficiency and reduces the delay and overhead in the WSN.
The reminder of the paper is prepared in such a way that Section
Reference [
This process can be enhanced for multiple numbers of sinks and designing an efficient routing protocol for data gathering. Here a relay node based secure routing protocol using multiple mobile sink for data gathering for WSN is proposed.
The source and sink know their location. It is also assumed that multiple sinks move in the network. The proposed architecture is shown in Figure
Proposed architecture of multiple mobile sink.
Let Let Let QP be query packet. Let Let Let Let Let RP_seq be the sequence number of relay path. Let RP_mes and R_CLR be the relay path setup and clear message with RP_seq.
If event occurs, initially, a rendezvous point ( Then sink has to transmit QP to The fields in the QP are represented as the following:
Sink ID. Hop count. Transmitter distance.
When the neighboring nodes receive the QP, they rebroadcast the packet by incrementing hop count counter by 1. Thus, as this query propagated, new hop node towards If next new hop node > 1,
Then
Two nodes compare the packets arrival time (Tpa) The new next hop node with earlier Tpa is chosen End if
Source transmits the path request message (P_REQ) to all its neighbors and the neighbor, node that sends the (P_REP) is chosen as next new hop node. If Then
Else
End if Here, the node, which is nearest to If an event occurs, Ni enclosing it collectively processes the signal. One among the nodes becomes When If the next new hop node is failed or its battery is exhausted
Then
End if.
When data packets are not received by
If Relay node request message (
Sink chooses the node which is nearer to it as immediate relay node. The relay path message is sent through IRN: When The following is noted: When If
When If
Then End if When old relay path exists, then When the relay path gets a new RP_mes, then it does not remove the
Flowchart of the proposed routing protocol.
Security protocol securely gathers the sensed data and transmits it to the sink. In this proposed model reactive type of data collection is used. This protocol provides high degree of security with minimum overhead. Symmetric key is used in WSN because of less computation as it uses same keys for encryption and decryption. The source and sink communication is showed in Figure Secret key of the sensor node is Secret key of the sink node is Shared key is Prime number is Code for sink authentication is CSA. Code for node authentication is CNA. Code for message authentication is CMA. Cipher text data is Hash function is
Source and sink communication.
Consider the following equations: CSA = Data =
At the sink node, the cipher text is decrypted to get the original message: When the sink comes into a range of rendezvous point it generates a large prime number. Sink calculates CSA (CSA = CSA is broadcasted among the neighbor nodes.
Cipher message is received and decrypted with its secret key (Data = Compare the decrypted data with CMA; if data is same, accept it; else reject the data. If the data is rejected, NAC is sent to the respective node. The process is repeated till all the data is transmitted within its time slot.
Consider the following equations: CNA = CSA ⊕
At the source node the plain text is encrypted with the secret key. Sensor node calculates its secret key when CSA is received (CNA = CSA ⊕ Sensor receives the The corresponding result is compared with the sink secret key; if it is same accept the message; else reject the message. Sensor encrypts its data with secret key and generates its cipher text CMA is added at the end of the packet for verification. The process is done till the end of the data packets.
NS2 simulation is employed to evaluate relay node based secure routing protocol for multiple mobile sink (RSRPMS). In this case randomly deployed sensor nodes covering the area of 600 × 600 m are varied from 50, 100, 150, and 200, to 250 kbps data rate and nodes are varied from 20 to 100 nodes. The time taken for simulation is 50 sec.
This section describes the simulation results when sinks are increased as 1, 2, and 5. All the performance parameters were evaluated for node as well as rate. From the simulation result the proposed protocol proves that it can work better when the number of sinks increases. This increases the availability of the network.
From Figure
Nodes versus delay in terms of sink.
Figure
Nodes versus drop in terms of sink.
Figure
Nodes versus energy in terms of sink.
Figure
Nodes versus overhead in terms of sink.
Figure
Rate versus delay in terms of sink.
Figure
Data rate versus drop in terms of sink.
Figure
Rate versus energy in terms of sink.
Figure
Rate versus overhead in terms of sink.
Table
Delivery ratio of the data gathering schemes.
Data gathering schemes | Delivery ratio (%) | |
---|---|---|
Node | Rate | |
Nodes: 80 | Rate: 200 kbps | |
BSMASD | 0.37426 | 0.13937 |
MSREEDG | 0.60471 | 0.31161 |
IAR | 0.55215 | 0.91863 |
RSRPMS | 0.78017 | 0.99556 |
Figure
Performance analysis of energy efficient schemes for varying data rate.
This paper proposes a reliable and energy efficient WSN routing protocol with minimum delay called relay node based secure routing protocol for multiple mobile sink (RSRPMS). The experimental simulations using the proposed protocol are carried out rigorously and the results are compared with Intelligent Agent-Based Routing (IAR) protocol to prove the superiority in delivery of transmitted data and increase in the network lifetime compared with other routing protocols. The proposed routing protocol performance was also additionally compared with traditional schemes like BSMASD and MSREEDG techniques. The parameters of comparison included packet drop, energy, delay, and overhead. The simulations were carried out using NS2 simulator under various conditions of operations like varying the nodes and data rate. The simulation result proves that the proposed relay node based secure routing protocol used for mobile sink increases the delivery ratio and energy efficiency. Thus the proposed routing protocol increases the network lifetime.
The authors declare that there is no conflict of interests regarding the publication of this paper.