8 search results - page 1 / 2 » Greedy geographic routing in large-scale sensor networks: a ... |
MOBIHOC
2010
ACM
13 years 2 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—In wireless ad-hoc sensor networks, an important issue often faced in geographic greedy forwarding routing is the “local minimum phenomenon” which is caused by deployment ho...
APNOMS
2009
Springer
13 years 11 months ago
2009
Springer
Applications in wireless sensor networks (WSNs) experience the routing hole problem. That is, the current node cannot forward to the destination, although it is the closest node, b...
TPDS
2010
13 years 3 months ago
2010
—Geographic routing is an attractive localized routing scheme for wireless sensor networks (WSNs) due to its desirable scalability and efficiency. Maintaining neighborhood inform...
COMCOM
2007
13 years 4 months ago
2007
In this paper, we focus on the challenge of demand-scalable multicast routing in wireless sensor networks. Due to the ad-hoc nature of the placement of the sensor nodes as well as...