New link estimation for reliability in wireless sensor networks
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Distributed multi-hop cooperative communication in dense wireless sensor networks
The Journal of Supercomputing
Compressed sensing for efficient random routing in multi-hop wireless sensor networks
International Journal of Communication Networks and Distributed Systems
Close-packing-based sensor node deployment schemes for AOFSN
International Journal of Communication Networks and Distributed Systems
Performance evaluation of MINTRoute protocol at different scenarios
ICHIT'11 Proceedings of the 5th international conference on Convergence and hybrid information technology
On multipath balancing and expanding for wireless multimedia sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
Energy Efficiency Routing with Node Compromised Resistance in Wireless Sensor Networks
Mobile Networks and Applications
Energy-Efficient Resource Allocation in Mobile Networks with Distributed Antenna Transmission
Mobile Networks and Applications
Energy equilibrium based on corona structure for wireless sensor networks
Wireless Communications & Mobile Computing
Hi-index | 0.00 |
Routing protocols in wireless sensor networks (WSNs) typically employ a transmitter-oriented approach in which the next hop node is selected based on neighbor or network information. This approach incurs a large overhead when the accurate neighbor information is needed for efficient and reliable routing. In this paper, a novel receiver-oriented load-balancing and reliable routing (RLRR) protocol is proposed. In RLRR, an intermediate node solicits next hop candidates, each of which is to respond with its own backoff time dubbed a temporal gradient (TG). In this way, the next hop is selected without any central coordination on a packet-by-packet basis. Thus, each node needs not maintain any neighbor information. The remaining energy level used to determine the TG is always accurate and up-to-date. Furthermore, neighbor nodes whose hop count is less than the soliciting node participate in the next-hop selection process with loop-free operation guarantee. Comprehensive simulations are carried out to show that RLRR achieves relatively longer network lifetime and higher reliability than other existing schemes. Copyright © 2007 John Wiley & Sons, Ltd.