GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
RAP: A Real-Time Communication Architecture for Large-Scale Wireless Sensor Networks
RTAS '02 Proceedings of the Eighth IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'02)
A Spatiotemporal Communication Protocol for Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Mobile Computing
A Real-time Routing Protocol with Constrained Equivalent Delay in Sensor Networks
ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
An Adaptive Real-Time Routing Scheme for Wireless Sensor Networks
AINAW '07 Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02
Optimal route selection for highly dynamic wireless sensor and actor networks environment
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
A novel approach for void avoidance in wireless sensor networks
International Journal of Communication Systems
| Hi-index | 0.00 |
We propose two simple mechanisms that aim at improving the energy efficiency of SPEED; the well-known real-time routing protocol dedicated for wireless sensor networks WSNs. The first mechanism calculates the expected end-to-end delay on the basis of previous hops' delay and drops a packet if such expected delay is greater than the packet deadline. By dropping the useless delayed packets, the mechanism increases fluidity of links and economises energy of nodes. The second mechanism extends the component stateless non-deterministic geographic forwarding SNGF of the SPEED protocol. While the original SNGF performs energy balancing by randomly selecting the next hop from the forwarding candidate neighbours set FS, the proposed mechanism makes use of a decision parameter which takes into account both the relay speed and the residual energy of the candidates. Thus, it prolong the network lifetime without degrading the real-time packet delivery performance. Also, it uses a low-cost algorithm updating continually the residual energy of neighbours in a node by exploiting both the overhearing mechanism and the location beaconing which are implemented in the SPEED protocol. Associated with SPEED, the proposed mechanisms achieved good performance in terms of node energy balancing and network energy consumption without degrading the packet delivery ratio.