106 search results - page 2 / 22 » An Information Model for Geographic Greedy Forwarding in Wir... |
ICC
2008
IEEE
13 years 11 months ago
2008
IEEE
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
MSWIM
2005
ACM
13 years 10 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...
ICDCIT
2007
Springer
13 years 11 months ago
2007
Springer
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the mess...
ICDCS
2008
IEEE
13 years 11 months ago
2008
IEEE
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
MOBIHOC
2006
ACM
14 years 4 months ago
2006
ACM
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...