Skip to main content
Article thumbnail
Location of Repository

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

By Baruch Awerbuch, David Holmer and Herbert Rubens

Abstract

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. I

Year: 2007
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.25
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.jhu.edu/~rgcole/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.