Abstract
This paper investigates the challenges involve in designing a dynamic channel assignment (DCA) scheme for wireless mesh networks, particularly for multi-radio systems.
It motivates the need for fast switching and process coordination modules to be incorporated in DCA algorithm for multi-radio systems. The design strategy is based on a reinterpretation of an adaptive priority mechanism as an iterative algorithm that recursively allocate a set of channels to radios in a fair and efficient manner in order to minimise interference and maximise throughputs. The algorithm, called Adaptive Priority Multi-Radio Channel Assignment (APMCA) is tested for overall performance to assess the effectiveness by determining its overall computational complexity.
The combined advantages of fast switching time and process coordination modules make the APMCA a useful candidate towards automating the channel assignment method in multi-radio wireless mesh network planning and design.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kyasanur, P.N.: Multi-Channel Wireless Networks: Capacity and Protocols, PhD Dissertation, Graduate College of the University of Illiois at Urbana-Champaign (2006)
Strix System, The business cases for wireless mesh networks, http://www.strixsystems.com/case-studies/WiFi-Mesh-business-case.asp
Ramachandran, K.N., et al.: Interference–Aware Channel Assignment in Multi-Radio Wireless Mesh Networks. In proc. of IEEE Infocom (2006), http://www.cs.ucsb.edu/~ebelding/txt/infocom06.pdf
Skalli, H., et al.: Traffic and Interference aware channel assignment for multi-radio Mesh Wireless Mesh Networks. In: Proc. of IEEE of the 13th annual ACM International conference on mobile computing and networking, Quebec, pp. 15–26 (2007)
Raniwala, A., Chiueh, T.: Architecture and Algorithms for IEEE 802.11 Based Multi-Channel Wireless Mesh Network. In: Proc. of IEEE INFOCOM 2005, vol. 3, pp. 223–234 (2005)
Katta, A.-K., et al.: A solution to the random assignment problem on full preference domain. Journal of Economic theory 131(1), 231–250 (2006)
De Couto, D., Aguayo, D., Bicket, J., Morris, R.: High –throughput path metric for multi-hop wireless routing. In: MOBICOM 2003 (2003)
Draves, R., Padhye, J., Zill, B.: Routing in multi-Radio, multi-hop wireless mesh network. In: MOBICOM (2004)
Kodiaalm, M., Nandagopal, T.: Characterising achievable rates in mult-hop wireless networks: The joint routing and scheduling problem. In: MOBICOM (2001)
Agha, K.A., et al.: Spatial Reuse. In: Wireless LAN Networks, http://www.gang.inra.fr/~viennot/postscript/ifip2001.ps.gz
Goodman, S.E., Hedetniemi, S.T.: Introduction to the design and analysis of Algorithm. McGraw-Hill, New York (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kareem, T.R., Matthee, K., Chan, H.A., Ntlatlapa, N. (2008). Adaptive Priority Based Distributed Dynamic Channel Assignment for Multi-radio Wireless Mesh Networks. In: Coudert, D., Simplot-Ryl, D., Stojmenovic, I. (eds) Ad-hoc, Mobile and Wireless Networks. ADHOC-NOW 2008. Lecture Notes in Computer Science, vol 5198. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85209-4_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-85209-4_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85208-7
Online ISBN: 978-3-540-85209-4
eBook Packages: Computer ScienceComputer Science (R0)