Broadcasting in Conflict-Aware Multi-channel Networks
The broadcasting problem asks for the fastest way of transmitting a message to all nodes of a communication network. We consider the problem in conflict-aware multi-channel networks. These networks can be modeled as undirected graphs in which each edge is labeled with a set of available channels to transmit data between its endpoints. Each node can send and receive data through any channel on its incident edges, with the restriction that it cannot successfully receive through a channel when multiple neighbors send data via that channel simultaneously.
We present efficient algorithms as well as hardness results for the broadcasting problem on various network topologies. We propose polynomial time algorithms for optimal broadcasting in grids, and also for trees when there is only one channel on each edge. Nevertheless, we show that the problem is NP-hard for trees in general, as well as for complete graphs. In addition, we consider balanced complete graphs and propose a policy for assigning channels to these graphs. This policy, together with its embedded broadcasting schemes, result in fault-tolerant networks which have optimal broadcasting time.
KeywordsBipartite Graph Complete Graph Channel Assignment Wireless Mesh Network Complete Bipartite Graph
Unable to display preview. Download preview PDF.
- 1.Bloom, S., Korevaar, E., Schuster, J., Willebrand, H.: Understanding the performance of free-space optics. Journal of Optical Networking 2(6), 178–200 (2003)Google Scholar
- 2.Claude, F., Dorrigiv, R., Kamali, S., López-Ortiz, A., Prałat, P., Romero, J., Salinger, A., Seco, D.: Broadcasting in conflict-aware multi-channel networks. Tech. Rep. CS-2012-22, School of Computer Science, University of WaterlooGoogle Scholar
- 3.Farley, A.M., Hedetniemi, S.T.: Broadcasting in grid graphs. In: Proc. 9th S-E Conf. Combinatorics, Graph Theory, and Computing, pp. 275–288 (1978)Google Scholar
- 4.Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)Google Scholar
- 5.Kondareddy, Y., Agrawal, P.: Selective broadcasting in multi-hop cognitive radio networks. In: IEEE Sarnoff Symposium, pp. 1–5 (2008)Google Scholar
- 6.Li, L., Qin, B., Zhang, C., Li, H.: Efficient Broadcasting in Multi-radio Multi-channel and Multi-hop Wireless Networks Based on Self-pruning. In: Perrott, R., Chapman, B.M., Subhlok, J., de Mello, R.F., Yang, L.T. (eds.) HPCC 2007. LNCS, vol. 4782, pp. 484–495. Springer, Heidelberg (2007)CrossRefGoogle Scholar
- 7.Mahjourian, R., Chen, F., Tiwari, R., Thai, M., Zhai, H., Fang, Y.: An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks. In: Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, pp. 331–340 (2008)Google Scholar
- 8.Qadir, J., Chou, C.T., Misra, A., Lim, J.G.: Localized minimum-latency broadcasting in multi-radio multi-rate wireless mesh networks. In: WOWMOM 2008, pp. 1–12 (2008)Google Scholar
- 9.Ramachandran, K.N., Belding, E.M., Almeroth, K.C., Buddhikot, M.M.: Interference-aware channel assignment in multi-radio wireless mesh networks. In: INFOCOM 2006, pp. 1–12 (2006)Google Scholar
- 11.Soifer, A.: The Mathematical Coloring Book. Springer (2009)Google Scholar
- 12.Subramanian, A., Buddhikot, M., Miller, S.: Interference aware routing in multi-radio wireless mesh networks. In: WiMesh 2006, pp. 55–63 (2006)Google Scholar
- 13.Wilkinson, B., Allen, M.: Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers. Prentice Hall (2005)Google Scholar
- 14.Zagalj, M., Hubaux, J.P., Enz, C.C.: Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues. In: MOBICOM 2002, pp. 172–182 (2002)Google Scholar
- 15.Zhang, X., Shin, K.G.: Chorus: collision resolution for efficient wireless broadcast. In: Proceedings of the 29th Conference on Information Communications, INFOCOM 2010, pp. 1747–1755 (2010)Google Scholar