Efficient Broadcasting With Guaranteed Coverage in Mobile Ad Hoc Networks
In wireless networks comprised of numerous mobile stations, the routing problem of finding paths from a traffic source to a destination through a series of intermediate forwarding nodes is particularly challenging. Some of the current research works cannot fully resolve the void problem, while there exists other schemes that can guarantee the delivery of packets with the excessive consumption of control overhead. The un-reachability problem (i.e. the so called void problem) that exists in the greedy routing algorithm in wireless sensor networks.