A Dynamic Route Optimization Mechanism for AODV in MANETs

Bilgin, Zeki; Khan, Bilal

doi:10.1109/icc.2010.5502381

Cited by 20 publications

(12 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While developing a routing algorithm for MANETs, one of the most challenging peculiarities which developers must consider is the behavior of the proposed algorithm in the presence of node movement. Mobility has a potential to result in dynamic changes to network topology, making the task of routing algorithms more difficult [4]. The routing protocols in MANETs should cope well with dynamically changing topology and nodes should exchange information on the topology of the network in order to establish routes.…”

Section: Introductionmentioning

confidence: 99%

Fuzzy-Based Routing Protocol to Increase Throughput in Mobile Ad Hoc Networks

Tabatabaei

Teshnehlab

Mirabedini

2015

Wireless Pers Commun

View full text Add to dashboard Cite

Mobile ad hoc networks (MANETs) are dynamically configurable wireless networks that have no fixed infrastructures and do not require predefined configurations. In MANETs, the high mobility of the mobile nodes is a major reason for link failure. Based on ad hoc on-demand distance vector (AODV), we propose a fuzzy-based on-demand routing protocol (FBORP) for MANETs. The proposed scheme uses the fuzzy logic system to select a stable route to enhance system performance. The fuzzy logic system is based on the remained energies of the nodes on the routes, the bandwidth and the node mobility. This study also compares the performance of the FBORP protocol with the well-known AODV protocol. Simulation results show that the proposed FBORP outperforms AODV, especially in a high mobility environment.

show abstract

Section: Introductionmentioning

confidence: 99%

Fuzzy-Based Routing Protocol to Increase Throughput in Mobile Ad Hoc Networks

Tabatabaei

Teshnehlab

Mirabedini

2015

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…This approach applies bonus gain, which is the ratio of the throughput increment to the routing overhead increment. Bilgin and Khan ( 2010) proposed the shrink procedure to dynamically optimize routing that does not require restarting the route discovery. The shrink procedure is activated at a certain probability by sending a message through the RSS to detect whether there is redundancy in the routing path and optimal path.…”

Section: Related Workmentioning

confidence: 99%

Improved AODV route recovery in mobile ad-hoc networks using a genetic algorithm

Ahmad¹,

Sadeghzadeh²

2014

10.5267/j.msl

View full text Add to dashboard Cite

An important issue in ad-hoc on-demand distance vector (AODV) routing protocols is route failure caused by node mobility in the MANETs. The AODV requires a new route discovery procedure whenever a route breaks and these frequent route discoveries increase transmission delays and routing overhead. The present study proposes a new method for AODVs using a genetic algorithm to improve the route recovery mechanism. When failure occurs in a route, the proposed method (GAAODV) makes decisions regarding the QOS parameter to select source or local repair. The task of the genetic algorithm is to find an appropriate combination of weights to optimize end-to-end delay. This paper evaluates the metrics of routing overhead, average end-to-end delay, and packet delivery ratio. Comparison of the new algorithm and AODV (RFC 3561) using a NS-2 simulator shows that GAAODV obtains better results for the QOS parameters.

show abstract

“…In the paper [10], author uses the distance between any two nodes as an estimate for the transmission power required to send a packet between the two nodes and the propagation delay between them. The transmission energy required to send a bit has been found to have a distance dependence which is well modelled by dn, where d is the distance between the transmitter and the receiver antennas and the exponent n is determined from field measurements and the particular system at hand.…”

Section: Related Studymentioning

confidence: 99%

Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Sensor Network

Tiwari¹,

Doohan²,

Tokekar³

2014

IOSRJCE

View full text Add to dashboard Cite

Abstract:The broad significance of Wireless Sensor Networks is in most emergency and disaster rescue domain. The routing process is the main challenges in the wireless sensor network due to lack of physical links. The objective of routing is to find optimum path which is used to transferring packets from source node to destination node. Routing should generate feasible routes between nodes and send traffic along the selected path and also achieve high performance. This paper presents a nearest adjacent node scheme based on shortest path routing algorithm. It is plays an important role in energy conservation. It finds the best location of nearest adjacent nodes by involving the least number of nodes in transmission of data and set large number of nodes to sleep in idle mode. Based on simulation result we shows the significant improvement in energy saving and enhance the life of the network.

show abstract

A Dynamic Route Optimization Mechanism for AODV in MANETs

Cited by 20 publications

References 4 publications

Fuzzy-Based Routing Protocol to Increase Throughput in Mobile Ad Hoc Networks

Fuzzy-Based Routing Protocol to Increase Throughput in Mobile Ad Hoc Networks

Improved AODV route recovery in mobile ad-hoc networks using a genetic algorithm

Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Sensor Network

Contact Info

Product

Resources

About