Mobility

On the Feasibility of Distributed Link-Based Channel Assignment in Wireless Mesh Networks

Free registration required

Executive Summary

In this paper, the authors present an experimental evaluation of the Distributed Greedy Algorithm (DGA) for distributed channel assignment in wireless mesh networks. The algorithm has the advantage of preserving the network topology by assigning channels to links instead of interfaces, thus being completely transparent to the routing layer. Their implementation is based on DES-Chan, a framework for the development of distributed channel assignment algorithms. They evaluate the performance in the DES-Testbed, a multi-radio Wireless Mesh Network (WMN) with 98 nodes at the Freie Universitat Berlin. They present a graph-theoretic analysis of the experiment results and measure the achieved throughput after the channel assignment.

  • Format: PDF
  • Size: 863.1 KB