skip to main content
10.1145/2069131.2069134acmconferencesArticle/Chapter ViewAbstractPublication PagesmobicomConference Proceedingsconference-collections
research-article

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

Authors Info & Claims
Published:31 October 2011Publication History

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.

References

  1. B. Blywis, M. Guenes, F. Juraschek, and J. Schiller. Trends, advances, and challenges in testbed-based wireless mesh network research. Mobile Networks and Applications, 15:315--329, 2010. 10.1007/s11036-010-0227-9. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. D. S. J. De Couto, D. Aguayo, J. Bicket, and R. Morris. A high-throughput path metric for multi-hop wireless routing. In MobiCom '03: Proceedings of the 9th annual international conference on Mobile computing and networking, pages 134--146, New York, NY, USA, 2003. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. P. Fuxjager, D. Valerio, and F. Ricciato. The myth of non-overlapping channels: interference measurements in ieee 802.11. In Proc. Fourth Annual Conference on Wireless on Demand Network Systems and Services WONS '07, pages 1--8, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  4. M. Günes, B. Blywis, F. Juraschek, and O. Watteroth. Experimentation Made Easy. In ICST, editor, Inproceedings of the First International Conference on Ad Hoc Networks, Ontario, Canada, September 2009.Google ScholarGoogle Scholar
  5. M. Günes, F. Juraschek, B. Blywis, Q. Mushtaq, and J. Schiller. A testbed for next generation wireless networks research. Special Issue PIK on Mobile Ad-hoc Networks, IV:208--212, Oktober-Dezember 2009.Google ScholarGoogle Scholar
  6. F. Juraschek, M. Günes, M. Philipp, and B. Blywis. State-of-the-art of distributed channel assignment. Technical Report TR-B-11-01, Freie Universität Berlin, FB Mathematik und Informatik, Jan 2011.Google ScholarGoogle Scholar
  7. B.-J. Ko, V. Misra, J. Padhye, and D. Rubenstein. Distributed channel assignment in multi-radio 802.11 mesh networks. pages 3978--3983, 2007.Google ScholarGoogle Scholar
  8. P. Kyasanur, J. So, C. Chereddi, and N. H. Vaidya. Multichannel mesh networks: challenges and protocols. Wireless Communications, IEEE {see also IEEE Personal Communications}, 13(2):30--36, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. P. Kyasanur and N. H. Vaidya. Routing and link-layer protocols for multi-channel multi-interface ad hoc wireless networks. SIGMOBILE Mob. Comput. Commun. Rev., 10(1):31--43, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J. Padhye, S. Agarwal, V. N. Padmanabhan, L. Qiu, A. Rao, and B. Zill. Estimation of link interference in static multi-hop wireless networks. In IMC ' 05: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement, pages 28--28, Berkeley, CA, USA, 2005. USENIX Association. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. C. Reis, R. Mahajan, M. Rodrig, D. Wetherall, and J. Zahorjan. Measurement-based models of delivery and interference in static wireless networks. SIGCOMM Comput. Commun. Rev., 36(4):51--62, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. M. Shin, S. Lee, and Y. ah Kim. Distributed channel assignment for multi-radio wireless networks. IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 0:417--426, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  13. W. Si, S. Selvakennedy, and A. Y. Zomaya. An overview of channel assignment methods for multi-radio multi-channel wireless mesh networks. Journal of Parallel and Distributed Computing, pages --, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. S. sridhar, J. Guo, and S. Jha. Channel assignment in multi-radio wireless mesh networks : A graph-theoretic approach. 2009.Google ScholarGoogle Scholar
  15. A. P. Subramanian, H. Gupta, S. R. Das, and J. Cao. Minimum interference channel assignment in multiradio wireless mesh networks. IEEE Transactions on Mobile Computing, 7(12):1459--1473, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

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

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          MobiWac '11: Proceedings of the 9th ACM international symposium on Mobility management and wireless access
          October 2011
          218 pages
          ISBN:9781450309011
          DOI:10.1145/2069131
          • General Chair:
          • Jose Rolim,
          • Program Chairs:
          • Jun Luo,
          • Sotiris Nikoletseas

          Copyright © 2011 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 31 October 2011

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate83of272submissions,31%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader