2nd International IEEE Conference on Communication System Software and Middleware

Research Article

Spanner Based Distributed Channel Assignment in Wireless Mesh Networks

  • @INPROCEEDINGS{10.1109/COMSWA.2007.382573,
        author={Kanthi C.N. and Bijendra N. Jain},
        title={Spanner Based Distributed Channel Assignment in Wireless Mesh Networks},
        proceedings={2nd International IEEE Conference on Communication System Software and Middleware},
        publisher={IEEE},
        proceedings_a={COMSWARE},
        year={2007},
        month={7},
        keywords={Bandwidth  Degradation  Hardware  IP networks  Interference  Mesh networks  Network topology  Routing  Throughput  Wireless mesh networks},
        doi={10.1109/COMSWA.2007.382573}
    }
    
  • Kanthi C.N.
    Bijendra N. Jain
    Year: 2007
    Spanner Based Distributed Channel Assignment in Wireless Mesh Networks
    COMSWARE
    IEEE
    DOI: 10.1109/COMSWA.2007.382573
Kanthi C.N.1,*, Bijendra N. Jain2,*
  • 1: Bell Labs Research India, Bangalore, India
  • 2: Department of Computer Science and Engineering, Indian Institute of Technology Delhi, New Delhi, India
*Contact email: kanthicn@lucent.com, bnj@cse.iitd.ac.in

Abstract

In this paper, we propose a distributed algorithm for channel assignment in multi-radio, multi-channel mesh networks. Channel assignment in multi-radio mesh networks is complicated because, in addition to affecting the interference between spatially closely located links, binding interfaces to channels affects the topology of the network. If the channel assignment is done without taking the topology into consideration, distance between any two nodes may increase arbitrarily. We propose a novel distributed channel assignment algorithm that reduces interference and at the same time provides bounds on the distance between any two nodes in the topology resulting from channel assignment. Our algorithm is based on the concept of spanners. We also develop and implement a modification of AODV, which uses the cumulative metric WCETT [4] as the routing metric. We use this routing algorithm to analyze the performance of our channel assignment algorithm. Through extensive simulations in NS-2, we show that the proposed channel assignment algorithm provides nearly 30% improvement in throughput over a simple, minimal-connectivity preserving channel assignment algorithm.