Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Query localization techniques for on-demand routing protocols in ad hoc networks
Wireless Networks - Selected Papers from Mobicom'99
A two-tier data dissemination model for large-scale wireless sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Associativity-Based Routing for Ad Hoc Mobile Networks
Wireless Personal Communications: An International Journal
IEEE Communications Magazine
International Journal of Autonomous and Adaptive Communications Systems
Hi-index | 0.00 |
In wireless sensor networks, mobility of targets and sinks, as well as power exhaustion of sensors often leads to breakage of existing routes. In this paper, we propose an efficient route update protocol (ERUP) to rebuild new routes in the neighborhood of broken ones. ERUP consists of two steps: firstly, nodes along the old problematic route define a packet propagation region; and then, route rediscovery packets are broadcast only within this region. ERUP not only achieves very low control overhead, but also provides much bigger freedom for the selection of new routes, which unnecessarily overlap the old ones. This virtue is especially important to the route-wide update cases, such as continuous movement of endpoints, and renovation of worn-out routes. Simulations verify the efficiency and scalability of ERUP.