Wireless Sensor Network

Volume 2, Issue 9 (September 2010)

ISSN Print: 1945-3078   ISSN Online: 1945-3086

Google-based Impact Factor: 2.53  Citations  h5-index & Ranking

Weak Greedy Routing over Graph Embedding for Wireless Sensor Networks

HTML  Download Download as PDF (Size: 213KB)  PP. 683-688  
DOI: 10.4236/wsn.2010.29082    5,786 Downloads   9,354 Views   Citations


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.

Cite this paper

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.

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.