Modeling and Simulation of a Novel Relay Node Based Secure Routing Protocol Using Multiple Mobile Sink for Wireless Sensor Networks

Abstract EN

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.