Paper
3 May 2007 History-based route selection for reactive ad hoc routing protocols
Sirisha Medidi, Peter Cappetto
Author Affiliations +
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.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Sirisha Medidi and Peter Cappetto "History-based route selection for reactive ad hoc routing protocols", Proc. SPIE 6577, Wireless Sensing and Processing II, 657706 (3 May 2007); https://doi.org/10.1117/12.719820
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Information security

Reliability

Computer simulations

Manufacturing

Computer science

Cryptography

Electrical engineering

RELATED CONTENT


Back to Top