Abstract
Wireless Mesh Networks with multiple channels and multiple radios on the mesh routers, have a great potential to increase the overall capacity of the network. To obtain the complete benefit of the increased capacity of such networks, efficient Channel Assignment (CA) and Link Scheduling (LS) algorithms are extremely important. A static CA and LS may not be optimal, in terms of utilization of underlying network resources, for every traffic demand in the network. In this paper, we find the optimal CA and LS for the given traffic demand by formulating an MILP by considering the traffic demand for each source-destination pairs, with the objective of maximizing the total achieved throughput of the network. We also propose a simple, but effective Load aware Channel Assignment and Link Scheduling (LoCALS), a polynomially bound heuristic algorithm for CA and LS. We show that LoCALS performs on par with the optimal solution. Finally, we compare LoCALS with a distributed channel assignment algorithm which is unaware of the traffic demand, in order to demonstrate the importance of considering the traffic demand for CA and LS.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Raniwala, A., Gopalan, K., Chiueh, T.: Centralized Channel Assignment and Routing Algorithms for Multi-Channel Wireless Mesh Networks. ACM SIGMOBILE Mobile Computing and Communications Review 8(2), 50–65 (2004)
Bahl, P., Chandra, R., Dunagan, J.: SSCH: Slotted Seeded Channel Hopping for Capacity Improvement in IEEE 802.11 Ad Hoc Wireless Networks. In: Proceedings of the 10th Annual International Conference on Mobile Computing and Networking (MobiCom 2004), October 2004, pp. 216–230 (2004)
Tang, J., Xue, G., Zhang, W.: End-to-End Rate Allocation in Multi-Radio Wireless Mesh Networks: Cross-Layer Schemes. In: Proceedings of the ACM International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QShine, 2006) (2006)
Alicherry, M., Bhatia, R., Li, L.E.: Joint Channel Assignment and Routing for Throughput Optimization in Multi-Radio Wireless Mesh Networks. In: Proceedings of the ACM International Conference on Mobile Computing and Networking (MobiCom 2005), August 2005, pp. 58–72 (2005)
Ramachandran, K.N., Belding, E.M., Almeroth, K.C., Buddhikot, M.M.: Interference-Aware Channel Assignment in Multi-Radio Wireless Mesh Networks. In: Proceedings of the IEEE International Conference on Computer Communications (INFOCOM 2006), April 2006, pp. 1–12 (2006)
Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: End-to-End Packet-Scheduling in Wireless Ad Hoc Networks. In: Proceedings of the ACM-SIAM symposium on Discrete algorithms (SODA 2004), January 2004, pp. 1021–1030 (2004)
Das, A.K., Alazemi, H.M.K., Vijayakumar, R., Roy, S.: Optimization Models for Fixed Channel Assignment in Wireless Mesh Networks with Multiple Radios. In: Proceedings of the IEEE Communication Society Conference on Sensor and Ad Hoc Communications and Networks (SECON 2005), September 2005, pp. 463–474 (2005)
Gonzaga, C.C.: On the Complexity of Linear Programming. Resenhas - IME-USP Journal, special issue dedicated to Paul Erdos 2(2), 197–207 (1995)
Shin, M., Lee, S., Kim, Y.: Distributed Channel Assignment for Multi-Radio Wireless Networks. In: Proceedings of the IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS 2006), October 2006, pp. 417–426 (2006)
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
Kanagasabapathy, A.A., Franklin, A.A., Murthy, C.S.R. (2008). A Load Aware Channel Assignment and Link Scheduling Algorithm for Multi-channel Multi-radio Wireless Mesh Networks. In: Sadayappan, P., Parashar, M., Badrinath, R., Prasanna, V.K. (eds) High Performance Computing - HiPC 2008. HiPC 2008. Lecture Notes in Computer Science, vol 5374. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89894-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-89894-8_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89893-1
Online ISBN: 978-3-540-89894-8
eBook Packages: Computer ScienceComputer Science (R0)