Title page for ETD etd-06262006-091312

Type of Document Dissertation
Author Lee, Unghee
Author's Email Address ulee@vt.edu
URN etd-06262006-091312
Title A Proactive Routing Protocol for Multi-Channel Wireless Ad-hoc Networks
Degree PhD
Department Electrical and Computer Engineering
Advisory Committee
Advisor Name Title
Midkiff, Scott F. Committee Chair
Bostian, Charles W. Committee Member
Chen, Ing-Ray Committee Member
DaSilva, Luiz A. Committee Member
Hou, Yiwei Thomas Committee Member
  • Virtual Interface Module
  • Channel Selection Algorithm
  • Multiple Interfaces
  • Ad-hoc
  • Multiple-channel
Date of Defense 2006-06-14
Availability unrestricted
Wireless mobile ad-hoc networks consist of a collection of peer mobile nodes that form a network and are capable of communicating with each other without help from stationary infrastructure such as access points. The availability of low-cost, com-modity network interface cards (NICs) has made the IEEE 802.11 medium access control (MAC) protocol the de facto MAC protocol for wireless mobile ad-hoc net-works, even though it is not optimal. The IEEE 802.11 MAC protocol is designed to have stations share a single channel in a given network. However, many of the IEEE 802.11 physical (PHY) layer specifications define multiple channels and allow the simultaneous, non-interfering use of some of these channels. Therefore, multiple communications can occur at the same time, offering the opportunity to increase the effective network capacity.

We present an innovative routing protocol that utilizes multiple channels to im-prove the performance of wireless ad-hoc networks. The basic idea of the protocol is to use multiple channels so that multiple useful transmissions can occur simultane-ously, thus increasing network capacity. The proposed scheme requires minor changes to existing proactive ad-hoc routing protocols and no modifications to the current IEEE 802.11 MAC protocol. To reduce inefficiencies due to periodic updates in the proactive routing protocols, the proposed scheme divides the network layer into control and data planes. Nodes send routing updates using the control channel and user packets using the data channel.

To demonstrate the multi-channel routing scheme, we extend the Destination-Sequenced Distance-Vector (DSDV), Open Shortest Path First-Minimal Connected Dominating Set (OSPF-MCDS), and Optimized Link State Routing (OLSR) protocol to multiple channel (MC) versions, denoted as DSDV-MC, OSPF-MCDS-MC, and OLSR-MC, respectively. Simulation results for DSDV-MC, OSPF-MCDS-MC, and OLSR-MC are presented and experimental results for OLSR-MC are presented. Simulation results indicate that DSDV-MC and OSPF-MCDS-MC effectively exploit multiple channels to improve network capacity. Goodput, the throughput consider-ing only useful error-free packets, increases with an increased number of available channels as the number of nodes and network load increase in both single-hop and multiple-hop networks. Experimental results with OLSR-MC also support that the proposed scheme increases network capacity without modification to the MAC proto-col in a real implementation.

Although simulation and experimental results show that proposed scheme im-proves network capacity by exploiting multiple channels, problems exist with channel distribution. We introduce a new metric, the Channel Distribution Index (CDI) to in-vestigate these issues. The CDI indicates the fairness of the channel distribution. We identify the channel convergence problem, where a particular channel is over-utilized, and propose a channel reallocation scheme to mitigate the impact of the channel convergence problem using the CDI.

  Filename       Size       Approximate Download Time (Hours:Minutes:Seconds) 
 28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access 
  ungheeLEEdissertation.pdf 1.00 Mb 00:04:38 00:02:23 00:02:05 00:01:02 00:00:05

Browse All Available ETDs by ( Author | Department )

dla home
etds imagebase journals news ereserve special collections
virgnia tech home contact dla university libraries

If you have questions or technical problems, please Contact DLA.