By Topic

Analysis of Multiple Trees on Path Discovery for Beacon-Based Routing Protocols

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Baruch Awerbuch ; Johns Hopkins University, Department of Computer Science, Baltimore, MD, USA 20723-6099. Email: ; David Holmer ; Herbert Rubens ; Robert G. Cole

Routing in Mobile Ad-hoc Networks (MANETS) has proved to be an extremely challenging research problem due to the high frequency of link changes in wireless mobile environments. Most known routing protocols struggle to maintain complex routing structures, e.g., N spanning trees, or use expensive (from the perspective of communications cost) methods for path discovery. These methods incur extreme communications costs in most MANET deployments. In this paper, we investigate the performance of a relatively unstudied class of routing protocols which we refer to as Beacon-Based Routing Protocols. This class of protocols maintain minimum routing structures and use these structures to boot strap path discovery. In a well defined sense, this class of routing protocols achieves optimal performance with respect to minimizing the communications costs associated with on-demand routing. We specifically investigate the impact of multiple tree implementations for path discovery and analyze their impact on the effectiveness of optimal path discovery.

Published in:

2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing

Date of Conference:

22-24 Aug. 2007