On the feasibility of distributed link-based channel assignment in wireless mesh networks

  • Authors:

  • Felix Juraschek;Mesut Güneş;Matthias Philipp;Bastian Blywis

  • Affiliations:

  • Freie Universität Berlin & Humboldt University Berlin, Berlin, Germany;Freie Universität Berlin & Humboldt University Berlin, Berlin, Germany;Freie Universität Berlin & Humboldt University Berlin, Berlin, Germany;Freie Universität Berlin & Humboldt University Berlin, Berlin, Germany

  • Venue:
  • Proceedings of the 9th ACM international symposium on Mobility management and wireless access
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we 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. Our implementation is based on DES-Chan, a framework for the development of distributed channel assignment algorithms. We evaluate the performance in the DES-Testbed, a multi-radio wireless mesh network (WMN) with 98 nodes at the Freie Universität Berlin. We present a graph-theoretic analysis of the experiment results and measure the achieved throughput after the channel assignment. We discuss the feasibility of link-based channel assignment and show that the feature of the algorithm of being transparent to the routing layer is not always guaranteed. Additionally, we show the importance of using realistic interference models to fully exploit the performance gain by channel assignment in real network deployments.