[Back]

H. Stratil:
"An efficient implementation of the greedy forwarding strategy";
Talk: 34. Jahrestagung der Gesellschaft für Informatik (GI), Ulm; 2004-09-20 - 2004-09-24; in: "GI-Edition Informatik 2004- Informatik verbindet", Köllen Druck+Verlag, Band 2, Ulm (2004), ISSN: 1617-5468; 365 - 369.

A wireless sensor network needs a suitable multihop routing protocol to facilitate the communication between arbitrary sensor nodes. Position-based routing protocols are attractive for large-scale sensor networks due to their location awareness and scalability. A large number of position-based routing protocols use the greedy forwarding strategy. This paper presents an efficient implementation of the greedy forwarding algorithm. The nodes of the sensor network are viewed as points in the plane. Each node uses a Voronoi Diagram to generate a subdivision of the plane, which is solely based upon its local neighborhood. Every node forwards incoming messages to that Voronoi Cell the destination node belongs to, according to its position information. The complexity of our solution is O(n log n) for computing the Voronoi Diagram, which is typically done only once, but only O(log n) for finding the next-hop node. Interestingly, n is not the total number of nodes in the network here, but only the number of single hop neighbors.

http://aleph.ub.tuwien.ac.at/F?base=tuw01&func=find-c&ccl_term=AC04968485