Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Analysis and design of a k-Anycast communication model in IPv6
Computer Communications
WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks
A distributed k-anycast routing protocol based on mobile agents
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
k-anycast routing schemes for mobile ad hoc networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In k-anycasting, a sensor wants to report event information to any k sinks in the network. This is important to gain in reliability and efficiency in wireless sensor and actor networks. In this paper, we describe KanGuRou, the first position-based energy efficient k-anycast routing which guarantees the packet delivery to k sinks as long as the connected component that contains s also contains sufficient number of sinks. A node s running KanGuRou first computes a tree including k sinks among the M available ones, with weight as low as possible. If this tree has m≥1 edges originated at node s, s duplicates the message m times and runs m times KanGuRou over a subset of defined sinks. Simulation results show that KanGuRou allows up to 62% of energy saving compared to plain anycasting.