Design and analysis of wireless ad hoc routing algorithms.
Item
-
Title
-
Design and analysis of wireless ad hoc routing algorithms.
-
Identifier
-
AAI3187416
-
identifier
-
3187416
-
Creator
-
Liu, Yong.
-
Contributor
-
Adviser: Myung J. Lee
-
Date
-
2005
-
Language
-
English
-
Publisher
-
City University of New York.
-
Subject
-
Engineering, Electronics and Electrical
-
Abstract
-
Wireless ad hoc networks are a class of instant self-organizing networks without depending on any fixed infrastructure. Devices working in a wireless ad hoc network tend to have short transmission ranges, and communicate with remote terminals through multihop relays. This research work concentrates on the design and analysis of routing algorithms for wireless ad hoc networks.;Reactive routing algorithms are typically used in mobile ad hoc networks to prevent the waste of network resources on network maintenances. Most reactive routing algorithms are designed based on common channel connectionless network models. How to apply the reactive routing mechanism in connection-oriented multi-channel networks, like Bluetooth scatternet, is a novel and challenging topic. A scattroute structure is proposed in this work to combine scatternet formation with reactive routing. Scattroute is a route type scatternet, which is built on-demand to connect each active source-destination pair. A connectionless broadcast scheme is designed to expedite on-demand route discovery in Bluetooth networks. A route-wide synchronization method and a scattroute scheduling algorithm are also developed to improve network throughput and fairness.;Routing among memory-scarce devices is another research topic of this work. Reactive routing schemes like AODV are much more memory efficient than proactive approaches. However, they are still "expensive" to memory-scarce devices. Tree routing, by virtue of the tree hierarchical structure, is a memory-conserving method. Nevertheless, tree routes are usually not optimal. An integrated routing algorithm is developed in this work to combine the merits of tree routing and AODV, and to permit highly flexible network designs: an active source can directly use tree routes to deliver short or urgent messages, or it can search shortcuts through a reactive routing process; the relay nodes, depending on their memory conditions, either create routing entries to guide data forwarding, or simply relay all packets following tree routes.;A region based routing algorithm is also proposed to optimize reactive route discovery mechanisms. Most reactive approaches employ flooding-based route discovery methods, which cause substantial control overhead. Some efficient broadcast schemes can help suppress redundant packet relays, but they often suppress the discovery of optimal routes, too. In order to reduce control overhead, but without sacrificing route optimality, a region based routing algorithm is developed in this work to concentrate route discovery efforts in a local region between each source-destination pair. The algorithm consists of a network-wide sketchy scan to locate the destination and a local level meticulous scan to find the optimal route. The new algorithm is shown to be much more efficient than full-flooding approaches especially in large, dense, and dynamic networks.
-
Type
-
dissertation
-
Source
-
PQT Legacy Restricted.xlsx
-
degree
-
Ph.D.