Adaptive Routing Mechanism for Real-Time Wireless Sensor Networks Based on Two-Hop Information

2016 ◽  
pp. 59-68 ◽  
Author(s):  
Sandhya Rachamalla ◽  
Anitha Sheela Kancherla
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Adaptive Routing ◽  
Wireless Sensor ◽  
Routing Mechanism

Applying Cooperative MIMO Technique in an Adaptive Routing Mechanism for Wireless Sensor Networks

2013 ◽  
Author(s):  
Marco A. M. Marinho ◽  
Edison Pignaton de Freitas ◽  
Joao Paulo C. L. da Costa ◽  
Rafael T. de Sousa
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Adaptive Routing ◽  
Wireless Sensor ◽  
Cooperative Mimo ◽  
Routing Mechanism

Real-Time Routing Based on On-Demand Multi-Hop Lookahead in Wireless Sensor Networks

2011 ◽  
Vol E94-B (2) ◽  
pp. 569-572
Author(s):  
Soochang PARK ◽  
Euisin LEE ◽  
Juhyun JUNG ◽  
Sang-Ha KIM
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Wireless Sensor ◽  
On Demand

Real-Time MAC Protocol Based on Coding-Black-Burst in Wireless Sensor Networks

2014 ◽  
Vol E97.A (11) ◽  
pp. 2279-2282 ◽  
Author(s):  
Feng YU ◽  
Lei WANG ◽  
Dan GAO ◽  
Yingguan WANG ◽  
Xiaolin ZHANG
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Mac Protocol ◽  
Wireless Sensor

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

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.

Sign in / Sign up

Export Citation Format

Share Document