NDLI: Adaptive path accumulation for reactive routing protocols

Content Provider	IEEE Xplore Digital Library
Author	Westphal, C. Seada, K. Perkins, C.E. Wakikawa, R.
Copyright Year	2008
Abstract	We study the overhead of some mechanisms for information dissemination. We use reactive routing protocols in mobile ad hoc networks as our illustrative example. However, while reactive routing protocols are the main application for our results, they apply to different settings as well, which include publish/subscribe information dissemination mechanisms, information dissemination in sensor networks, and location services. We use a performance measure, defined in [8], which we call the efficiency xi of the information dissemination process, and use this efficiency to evaluate the overhead. The overhead is influenced by the use of a mechanism to increase the amount of information disseminated, at the cost of a higher overhead, called path accumulation. We compare the overhead of routing protocols with and without path accumulation. We observe that path accumulation is always more efficient at disseminating route information in the network, but the gain in efficiency decreases when it is normalized by the number of extra routes discovered, as more is known about the network. This means that the marginal return of path accumulation decreases over not using path accumulation. We propose a new route discovery mechanism which applies to most of the reactive protocols using a route request/route reply exchange. Our route discovery mechanism, denoted adaptive path accumulation adjusts the accumulated path in order to either: scale its bandwidth overhead down as more information is distributed in the network, or improve the network discovery by carefully selecting the routes to be propagated. We assess a range of adaptive path accumulation policies using numerical evaluation and show the effect of these policies on route discovery and packet overhead.
Starting Page	203
Ending Page	212
File Size	3441145
Page Count	10
File Format	PDF
ISBN	9781424425747
DOI	10.1109/MAHSS.2008.4660019
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-09-29
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Protocols Subspace constraints Wireless ad hoc networks route discovery Bandwidth Routing protocols Mathematical model path accumulation Equations Gain control overhead
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Reactive Routing Overhead in Mobile Ad-hoc Networks

Optimal path finding algorithm using neighbor position in a Wireless Ad Hoc Network

Adaptive route discovery for wireless sensor networks

Modeling routing overhead generated by wireless proactive routing protocols

Optimizing Cached Route Time-to-Live in Mobile Ad-Hoc Networks

Optimal Reactive Routing Protocol (ORRP): A New Reactive Routing Protocol for the Shortest Path in Ad Hoc Networks

Policy-Based Adaptive Routing in Mobile Ad Hoc Wireless Networks

Modeling routing overhead generated by wireless reactive routing protocols

Location aware sector-based routing in wireless ad hoc networks

Adaptive path accumulation for reactive routing protocols

Similar Documents

Reactive Routing Overhead in Mobile Ad-hoc Networks

Optimal path finding algorithm using neighbor position in a Wireless Ad Hoc Network

Adaptive route discovery for wireless sensor networks

Modeling routing overhead generated by wireless proactive routing protocols

Optimizing Cached Route Time-to-Live in Mobile Ad-Hoc Networks

Optimal Reactive Routing Protocol (ORRP): A New Reactive Routing Protocol for the Shortest Path in Ad Hoc Networks

Policy-Based Adaptive Routing in Mobile Ad Hoc Wireless Networks

Modeling routing overhead generated by wireless reactive routing protocols

Location aware sector-based routing in wireless ad hoc networks

Adaptive path accumulation for reactive routing protocols