Guarantee Delivery of Packets Using Greedy Anti-Void Routing for Wireless Sensor Networks

@inproceedings{Babu2013GuaranteeDO,
  title={Guarantee Delivery of Packets Using Greedy Anti-Void Routing for Wireless Sensor Networks},
  author={Ch. Raja Kishore Babu and Lov Kumar and S. Siva Skandha},
  year={2013}
}
  • Ch. Raja Kishore Babu, Lov Kumar, S. Siva Skandha
  • Published 2013
The unreachability problem (i.e., void problem) that exists in the greedy routing algorithms has been studied for the wireless sensor networks. Some of the current research work cannot fully resolve the void problem, while there exist other schemes that can guarantee the delivery of packets with the excessive consumption of control overheads. Moreover, the hop count reduction (HCR) scheme is utilized as a short-cutting technique to reduce the routing hops by listening to the neighbor’s traffic… CONTINUE READING