35 search results - page 4 / 7 » Greedy Hop Distance Routing Using Tree Recovery on Wireless ... |
NAS
2010
IEEE
13 years 6 months ago
2010
IEEE
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...
JUCS
2010
13 years 6 months ago
2010
: We present a table-less position based routing scheme for low power data centric wireless sensor networks. Our proposed scheme is localized, uses greedy forwarding approach, and ...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— In this paper we consider the problem of constructing a coordinate system in a sensor network where location information is not available. To this purpose we introduce the Virt...
VTC
2010
IEEE
13 years 6 months ago
2010
IEEE
—Most of geographic routing approaches in wireless ad hoc and sensor networks do not take into consideration the medium access control (MAC) and physical layers when designing a ...
MSWIM
2005
ACM
14 years 1 months ago
2005
ACM
We consider the problem of energy aware localized routing in ad hoc networks. In localized routing algorithms, each node forwards a message based on the position information about...