35 search results - page 2 / 7 » Greedy Hop Distance Routing Using Tree Recovery on Wireless ... |
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...
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...
ESAS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In this paper, we propose a framework for the security analysis of on-demand, distance vector routing protocols for ad hoc networks, such as AODV, SAODV, and ARAN. The pr...
ITIIS
2010
12 years 11 months ago
2010
Greedy forwarding is the key mechanism of geographic routing and is one of the protocols used most commonly in wireless sensor networks. Greedy forwarding uses 1-hop local informa...
ADHOCNOW
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we outline a simple approach, called ROAR, that enables the Ad-Hoc On-Demand Distance Vector (AODV) routing protocol to strengthen its routes by recruiting neighbors...