Greedy Routing with Guaranteed Delivery in Wireless Sensor Networks
Guoqing Zhang · Chuangan jishu xuebao · 2009
This paper presents a scalable point-to-point routing scheme for wireless sensor networks.The scheme assigns a coordinate to each node of the network so that the nodes are embedded into a metric space induced by a small size of spanning trees of the network graph,and thus according to the coordinate space a greedy routing algorithm can be used for every pair of nodes.i.e.,nodes always forward packets to the neighbor which is closest to the destination.In the scheme,each node only needs to maintain the coordinates of its neighbors in its routing table,and the overhead of each packet heads is bounded by O(log2n)2 bits.Compared with many position-based greedy routing algorithms,the scheme ensures that greedy routing is always successful in finding a route to the destination,if such a route exists,and the route is not longer than the routes to the destination in the spanning trees.Simulations show the routing scheme can achieve remarkable performance in both path stretch and node load.