Using mobile relays to prolong the lifetime of wireless sensor networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Mirage: a microeconomic resource allocation system for sensornet testbeds
EmNets '05 Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Multiple controlled mobile elements (data mules) for data collection in sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks
Scalable routing protocols for mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Whirlpool Ad-hoc Routing Protocol (WARP) is a dynamic data collection protocol for wireless sensor networks. Compared to existing protocols, WARP offers order of magnitude improvements in reliability, efficiency, and routing stretch for a moving data sink. When the sink moves, nearby WARP nodes stop forwarding data directly towards the sink. Instead, they speculatively disseminate data packets along loops centered at the last location of the sink. The loop radius progressively increases searching more widely until the sink is found. Finally, WARP embeds a few bits of control information in data packets and aggressively suppresses control packets to further improve its efficiency. We have implementedWARP in TinyOS and evaluated it against the Collection Tree Protocol (CTP) [2], the state-of-art collection protocol for WSNs. For a mobile sink, WARP had significantly better reliability and efficiency, achieving over 90% reliability for a wide range of speeds and data rates, compared to below 10% reliability of CTP.