Routing Approaches in Mobile AD HOC Networks

Basagni, Stefano; Conti, Marco; Giordano, Silvia; Stojmenović, Ivan

doi:10.1002/0471656895.ch10

Cited by 67 publications

(32 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The source node through the route discovery process usually initiates the route requested. Once a route has been established, it is maintained until either the destination becomes inaccessible (along every path from the source), or until the route is no longer used, or expired [5,6 ]. REACTIVE ROUTING PROTOCOLS:-These protocols depart from the legacy Internet approach.…”

Section: IIImentioning

confidence: 99%

Efficient Routing Protocol in the Mobile Ad-hoc Network (MANET) by using Genetic Algorithm (GA)

Lafta¹,

Al-Salih²

2014

IOSRJCE

View full text Add to dashboard Cite

show abstract

Section: IIImentioning

confidence: 99%

Efficient Routing Protocol in the Mobile Ad-hoc Network (MANET) by using Genetic Algorithm (GA)

Lafta¹,

Al-Salih²

2014

IOSRJCE

View full text Add to dashboard Cite

show abstract

“…The AODV routing protocol belongs to the class of on-demand routing strategies [26,27]: a route is created at the time a source needs to reach a destination. In order to locate the destination node, the source broadcasts a route request (RREQ) message all over the network.…”

Section: Simulation-based Analysismentioning

confidence: 99%

Cross-Layering between Physical Layer and Routing in Wireless Ad-Hoc Networks

Dricot

Ferrari

Doncker

2009

Communication and Networking

View full text Add to dashboard Cite

Abstract.Routing is a key issue in wireless ad-hoc networks. The goal of an efficient routing strategy is to set up routes so that the overall quality of communications will be the best possible. While the Open Systems Interconnection (OSI) reference model advocates for a clear separation of routing, access, and physical layers, in this paper we show that in scenarios with faded communications, cross-layer interactions have to be carefully considered. More precisely, we compare the performance of the Ad-hoc On-demand Distance Vector (AODV) routing algorithm with that of one of its physical layer-oriented variants, denoted as AODVϕ . It will be clearly shown that no single routing strategy is always optimal and that an intelligent adaptation should be performed.

show abstract

“…It adopts a so-called ''store-carry-forward'' paradigm -a node receives a packet buffers and carries that packet as it moves, passing the packet on to new nodes that it encounters. Being analogous to the spread of infectious diseases, each time a packet-carrying node encounters a node that does not have a copy of that packet, the carrier is said to infect this new node by passing on a packet copy; newly infected nodes, in turn, behave similarly [10] [11].…”

Section: Introductionmentioning

confidence: 99%