Author(s)

Zhigang Li, Nong Xiao

Computer School, National University of Defense Technology, Changsha, Hunan, China.

In this paper we classify the greedy routing in sensor networks into two categories, strong greedy routing and weak greedy routing. Most existing work mainly focuses on weak greedy routing over geographic location network or strong greedy routing over greedy embedding network. It is a difficult job and needs much cost to obtain geographic location or greedy embedding of the network. We propose a light-weight Tree-based graph embedding (TGE) for sensor networks. Over the TGE, we design a weak greedy routing protocol, TGR. TGR can archive good performance on path stretch factor and load balance factor.

WSN, Greedy routing, Graph embedding, TGR

Z. Li and N. Xiao, "Weak Greedy Routing over Graph Embedding for Wireless Sensor Networks," Wireless Sensor Network, Vol. 2 No. 9, 2010, pp. 683-688. doi: 10.4236/wsn.2010.29082.