Greedy Anti-Void Forwarding Strategies for Wireless Sensor Networks
Wen-Jiunn Liu, Kai‐Ten Feng · InTech eBooks · 2008
Advances in Greedy Algorithms 274 topologies, such as GPSR (Karp & Kung, 2000), GFG (Bose et al., 2001), Compass Routing II (Kranakis at al., 1999), GOAFR+ (Kuhn at al., 2003), GOAFR++ (Kuhn at al., 2003), and GPVFR (Leong at al., 2005).Nevertheless, the usage of the planar graphs has significant pitfalls due to the removal of communication links leading to the sparse network link distribution; while the adoption of the unit disk graph (UDG) for modeling the underlying network is suggested.A representative UDG-based greedy routing scheme, i.e. the BOUNDHOLE algorithm (Fang at al., 2004), forwards the packets around the network holes by identifying the locations of the holes.However, the delivery of packets cannot be guaranteed in the BOUNDHOLE scheme even if a route exists from the source to the destination node. How to referenceIn order to correctly reference this scholarly work, feel free to copy and paste the following: