A Biased Random Walk Routing Protocol for Wireless Sensor Networks: The Lukewarm Potato Protocol

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN. Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.

Download Full-text

A geographical-based secure routing protocol with lifetime optimization for wireless sensor networks

Information Science and Management Engineering ◽

10.2495/isme130891 ◽

2013 ◽

Author(s):

H.C. Zhang ◽

X. Wen ◽

D.H. Mo

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Routing Protocol ◽

Secure Routing ◽

Wireless Sensor ◽

Secure Routing Protocol ◽

Lifetime Optimization

Download Full-text

Node sleeping algorithm for wireless sensor networks based on minimal hop routing protocol

Journal of Computer Applications ◽

10.3724/sp.j.1087.2011.00194 ◽

2011 ◽

Vol 31 (1) ◽

pp. 194-197 ◽

Cited By ~ 1

Author(s):

Zhi REN ◽

Qing-ming WANG ◽

Xiao-jin GUO

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Routing Protocol ◽

Wireless Sensor

Download Full-text

SPREAD - A Routing Protocol to Meet End-to-end Adjusted Deadline in Real Time Wireless Sensor Networks

International Journal of Sensors Wireless Communications and Control ◽

10.2174/2210327909666190207164153 ◽

2020 ◽

Vol 10 (1) ◽

pp. 63-78

Author(s):

Neetika Jain ◽

Sangeeta Mittal

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Real Time ◽

Routing Protocol ◽

Resource Constraints ◽

Wireless Sensor ◽

Network Simulator ◽

Packet Delivery ◽

High Data ◽

Hard Real Time

Background: Real Time Wireless Sensor Networks (RT-WSN) have hard real time packet delivery requirements. Due to resource constraints of sensors, these networks need to trade-off energy and latency. Objective: In this paper, a routing protocol for RT-WSN named “SPREAD” has been proposed. The underlying idea is to reserve laxity by assuming tighter packet deadline than actual. This reserved laxity is used when no deadline-meeting next hop is available. Objective: As a result, if due to repeated transmissions, energy of nodes on shortest path is drained out, then time is still left to route the packet dynamically through other path without missing the deadline. Results: Congestion scenarios have been addressed by dynamically assessing 1-hop delays and avoiding traffic on congested paths. Conclusion: Through extensive simulations in Network Simulator NS2, it has been observed that SPREAD algorithm not only significantly reduces miss ratio as compared to other similar protocols but also keeps energy consumption under control. It also shows more resilience towards high data rate and tight deadlines than existing popular protocols.

Download Full-text