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

Perumal, Madhumathy; Dhandapani, Sivakumar

doi:10.1155/2015/495945

Cited by 10 publications

(4 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…7. Hexagonal crowns approach [14] Another controlled sink mechanism using a biased random walk path is presented in [15]. The sinks and the source nodes know their locations.…”

Section: Mobile Sink With Controlled Pathmentioning

confidence: 99%

Networking Protocols for Wireless Sensor Networks with Mobile Sink

Aranzazu-Suescun¹,

Cardei²

2018

Proceedings of the 16th LACCEI International Multi-Conference for Engineering, Education, and Technology: “Innovation in Educat

View full text Add to dashboard Cite

Wireless sensor networks (WSN) have been widely used in many applications, such as climate monitoring systems, fire detection, ocean activity monitoring, and smart cities. These networks can be homogeneous or heterogeneous, depending on the types of wireless devices used. WSNs play an important role monitoring and reporting environment information and collecting surrounding context to send it to a sink. The sink acts as a bridge between the WSN and the final user. The sink could be static, such as a base station or a gateway node or could be mobile such as a drone or an user carrying a smartphone. When the sink is mobile, the path to reach the sink from any node in the network becomes obsolete frequently. Then, the problem to address in this case is how to reach the sink, without drastically depleting the network energy resources. This paper focuses on networking protocols used to report events to a mobile sink and presents the state of the art in mechanisms used to report data and events to a mobile sink.

show abstract

“…7. Hexagonal crowns approach [14] Another controlled sink mechanism using a biased random walk path is presented in [15]. The sinks and the source nodes know their locations.…”

Section: Mobile Sink With Controlled Pathmentioning

confidence: 99%

Networking Protocols for Wireless Sensor Networks with Mobile Sink

Aranzazu-Suescun¹,

Cardei²

2018

Proceedings of the 16th LACCEI International Multi-Conference for Engineering, Education, and Technology: “Innovation in Educat

View full text Add to dashboard Cite

show abstract

“…In the OPNET environment, simulation of small link conventional routing is done in [7]. Comparison of the performance of single-hop and multihop routing followed by simulation is done in [8,9] for an ordinary ad hoc network. A routing protocol has been analyzed in [10,11], where distance, metric value, etc.…”

Section: Related Workmentioning

confidence: 99%

Fragment-based transmission using minimum power consumed routing (FBTMPCR) algorithm of a MIMO integrated MANET

Chowdhuri¹,

Banerjee²,

Chaudhury³

2018

Turk J Elec Eng & Comp Sci

View full text Add to dashboard Cite

Abstract:The establishment of an efficient broadcast routing technique in a multiple input multiple output (MIMO)-based mobile ad hoc network is a challenge in wireless communication. MIMO configuration provides enhancement of data throughput even under conditions of interference and multipath fading. Improvement of transmission efficiency by increasing saturation throughput, reducing transmission delay, and minimizing bit error rate is the main motivation of the present work. In this paper a hybrid routing algorithm, fragment-based transmission using minimum power consumed routing, has been developed. It is an integration of the cooperative transmission process and fragmentation of packet payload. The routing algorithm is developed on selecting the best suitable relay node considering effective received signal strength and probability of successful packet transmission. The broadcasting mechanism is done by using multiple fragment of packet transmission through MIMO channel by using a suitable relay node. The performance analysis of this proposed routing algorithm increases the signal to noise interference ratio, resulting in minimization of BER, improvement of saturation throughput, and reduced transmission delay.

show abstract

“…With respect to the discussion made in [ 22 , 23 ] for the design and implementation of self- pruning approach, every node in the network (e.g., node S ) piggybacks the set of its neighbors nodes N ( S ), before forwarding the broadcasted packet. The number of neighbor nodes of a corresponding node is calculated as 1-number of hops.…”

Section: A Dynamic Probabilistic Route Discovery Schemementioning

confidence: 99%

A Dynamic Probabilistic Based Broadcasting Scheme for MANETs

Shanmugam¹,

Subburathinam²,

Palanisamy³

2016

The Scientific World Journal

View full text Add to dashboard Cite

MANET is commonly known as Mobile Ad Hoc Network in which cluster of mobile nodes can communicate with each other without having any basic infrastructure. The basic characteristic of MANET is dynamic topology. Due to the dynamic behavior nature, the topology of the network changes very frequently, and this will lead to the failure of the valid route repeatedly. Thus, the process of finding the valid route leads to notable drop in the throughput of the network. To identify a new valid path to the targeted mobile node, available proactive routing protocols use simple broadcasting method known as simple flooding. The simple flooding method broadcasts the RREQ packet from the source to the rest of the nodes in mobile network. But the problem with this method is disproportionate repetitive retransmission of RREQ packet which could result in high contention on the available channel and packet collision due to extreme traffic in the network. A reasonable number of routing algorithms have been suggested for reducing the lethal impact of flooding the RREQ packets. However, most of the algorithms have resulted in considerable amount of complexity and deduce the throughput by depending on special hardware components and maintaining complex information which will be less frequently used. By considering routing complexity with the goal of increasing the throughput of the network, in this paper, we have introduced a new approach called Dynamic Probabilistic Route (DPR) discovery. The Node's Forwarding Probability (NFP) is dynamically calculated by the DPR mobile nodes using Probability Function (PF) which depends on density of local neighbor nodes and the cumulative number of its broadcast covered neighbors.

show abstract

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

Cited by 10 publications

References 26 publications

Networking Protocols for Wireless Sensor Networks with Mobile Sink

Networking Protocols for Wireless Sensor Networks with Mobile Sink

Fragment-based transmission using minimum power consumed routing (FBTMPCR) algorithm of a MIMO integrated MANET

A Dynamic Probabilistic Based Broadcasting Scheme for MANETs

Contact Info

Product

Resources

About