Share Email Print

Proceedings Paper

History-based route selection for reactive ad hoc routing protocols
Author(s): Sirisha Medidi; Peter Cappetto
Format Member Price Non-Member Price
PDF $17.00 $21.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Ad hoc networks rely on cooperation in order to operate, but in a resource constrained environment not all nodes behave altruistically. Selfish nodes preserve their own resources and do not forward packets not in their own self interest. These nodes degrade the performance of the network, but judicious route selection can help maintain performance despite this behavior. Many route selection algorithms place importance on shortness of the route rather than its reliability. We introduce a light-weight route selection algorithm that uses past behavior to judge the quality of a route rather than solely on the length of the route. It draws information from the underlying routing layer at no extra cost and selects routes with a simple algorithm. This technique maintains this data in a small table, which does not place a high cost on memory. History-based route selection's minimalism suits the needs the portable wireless devices and is easy to implement. We implemented our algorithm and tested it in the ns2 environment. Our simulation results show that history-based route selection achieves higher packet delivery and improved stability than its length-based counterpart.

Paper Details

Date Published: 3 May 2007
PDF: 10 pages
Proc. SPIE 6577, Wireless Sensing and Processing II, 657706 (3 May 2007); doi: 10.1117/12.719820
Show Author Affiliations
Sirisha Medidi, Washington State Univ. (United States)
Peter Cappetto, Washington State Univ. (United States)

Published in SPIE Proceedings Vol. 6577:
Wireless Sensing and Processing II
Raghuveer M. Rao; Sohail A. Dianat; Michael D. Zoltowski, Editor(s)

© SPIE. Terms of Use
Back to Top