Routing in large-scale ad hoc networks based on a self-organizing coordinate system

Date
2004
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract

In this thesis, I present the design and evaluation of new techniques to solve the routing problem in large-scale city-wide wireless ad hoc networks. With an upsurge of wireless technologies, many routing protocols have been proposed for wireless ad hoc networks, but none of them have been proven capable of handling the tasks in a large-scale network that is composed of thousands of nodes. We propose a new routing scheme that is a hybrid of the current proactive and reactive routing mechanisms. This scheme uses proactive beaconing messages to build a virtual hierarchical coordinate system in an ad hoc network and thereafter uses reactive routing maintenance techniques to bypass the stale information between beacons. I implemented this new hybrid scheme in the network simulator ns-2. The simulation results show that it performs well in a large-scale ad hoc network of one thousand of nodes with low overhead.

Description
Degree
Master of Science
Type
Thesis
Keywords
Computer science
Citation

Du, Shu. "Routing in large-scale ad hoc networks based on a self-organizing coordinate system." (2004) Master’s Thesis, Rice University. https://hdl.handle.net/1911/17669.

Has part(s)
Forms part of
Published Version
Rights
Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.
Link to license
Citable link to this page