P-AODV: A Priority Based Route Maintenance Process in Mobile Ad Hoc Networks

P-AODV: A Priority Based Route Maintenance Process in Mobile Ad Hoc Networks We present a route maintenance mechanism, P-AODV, which repairs a route by selecting a neighbor on the basis of the traffic being handled by it. A new parameter, priority, is introduced to segregate the nodes into high priority and low priority categories. The availability of a high priority neighbor is required for the success of P-AODV. A highly dense network—our focus—increases the probability of such neighbors in the vicinity of upstream nodes. The priorities are advertised through Hello Packets and stored in Neighbor Tables. Alternate paths are made available at neighbor nodes by overhearing the traffic. In dense networks, avoiding reroute discoveries by selecting neighbors averts the overhead caused by control packets, inherent congestion and delay. Further, we have introduced a Controlled Re-Route Discovery in P-AODV to reduce the control packets transmission. P-AODV substantially improves the overall performance of the network. In this paper we have implemented our algorithms in AODV code of network simulator, ns 2.34, and the results were compared with the existing route maintenance methods of AODV, and RLLR. Chain topologies, running constant bit rate, are created with some neighbors either common to the chains or standalones. The simulation results show significant improvement in routing overhead reduction, packet delivery ratio, and considerable improvement in throughput and end-to-end delay (reduction), comparing P-AODV and AODV. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Wireless Personal Communications Springer Journals

P-AODV: A Priority Based Route Maintenance Process in Mobile Ad Hoc Networks

Loading next page...
 
/lp/springer_journal/p-aodv-a-priority-based-route-maintenance-process-in-mobile-ad-hoc-U1ZBh23ato
Publisher
Springer US
Copyright
Copyright © 2017 by Springer Science+Business Media New York
Subject
Engineering; Communications Engineering, Networks; Signal,Image and Speech Processing; Computer Communication Networks
ISSN
0929-6212
eISSN
1572-834X
D.O.I.
10.1007/s11277-017-4085-7
Publisher site
See Article on Publisher Site

Abstract

We present a route maintenance mechanism, P-AODV, which repairs a route by selecting a neighbor on the basis of the traffic being handled by it. A new parameter, priority, is introduced to segregate the nodes into high priority and low priority categories. The availability of a high priority neighbor is required for the success of P-AODV. A highly dense network—our focus—increases the probability of such neighbors in the vicinity of upstream nodes. The priorities are advertised through Hello Packets and stored in Neighbor Tables. Alternate paths are made available at neighbor nodes by overhearing the traffic. In dense networks, avoiding reroute discoveries by selecting neighbors averts the overhead caused by control packets, inherent congestion and delay. Further, we have introduced a Controlled Re-Route Discovery in P-AODV to reduce the control packets transmission. P-AODV substantially improves the overall performance of the network. In this paper we have implemented our algorithms in AODV code of network simulator, ns 2.34, and the results were compared with the existing route maintenance methods of AODV, and RLLR. Chain topologies, running constant bit rate, are created with some neighbors either common to the chains or standalones. The simulation results show significant improvement in routing overhead reduction, packet delivery ratio, and considerable improvement in throughput and end-to-end delay (reduction), comparing P-AODV and AODV.

Journal

Wireless Personal CommunicationsSpringer Journals

Published: Mar 8, 2017

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off