Article citationsMore>>

J. Newsome and D. Song, “Gem: Graph Embedding for Routing and Datacentric Storage in Sensor Networks without Geographic Information,” The 1st International Conference on Embedded Networked Sensor Systems, Los Angeles, 2003, pp. 76-88.

has been cited by the following article:

• TITLE: Weak Greedy Routing over Graph Embedding for Wireless Sensor Networks

  AUTHORS: Zhigang Li, Nong Xiao

  KEYWORDS: WSN, Greedy routing, Graph embedding, TGR

  JOURNAL NAME: Wireless Sensor Network, Vol.2 No.9, September 30, 2010

  ABSTRACT: 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.