Broadcasting in multi-radio multi-channel wireless networks using simplicial complexes

Wireless Networks

Volumn 19, Issue 6, 2013, Pages 1121-1133

  Ren, Wei ^a   Zhao, Qing ^b   Ramanathan, Ram ^c   Gao, Jianhang ^b   Swami, Ananthram ^d   Bar Noy, Amotz ^e   Johnson, Matthew P ^f   Basu, Prithwish ^c  

^a MICROSOFT   (United States)

^b University of California Davis   (United States)

^c BBN TECHNOLOGIES   (United States)

^d U S ARMY RESEARCH LABORATORY   (United States)

^e City College of New York   (United States)

^f PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Ad hoc network; Broadcast; Minimum connected set cover; Minimum spanning; Multi radio multi channel; Simplicial complex

Indexed keywords

CONNECTED SET COVER; MINIMUM SPANNING; MULTI RADIO MULTI CHANNELS; NP-COMPLETENESS; PERFORMANCE GUARANTEES; SIMPLICAL COMPLEX; SIMPLICIAL COMPLEX; STEINER TREE PROBLEM;

AD HOC NETWORKS; APPROXIMATION ALGORITHMS; BROADCASTING; COMPLEX NETWORKS; COSTS; GRAPH THEORY;

RADIO BROADCASTING;

EID: 84880260952     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11276-012-0522-4     Document Type: Article

References (24)

1. Bazlamacci, C. F., & Hindi, K. S. (2001). Minimum-weight spanning tree algorithms: A survey and empirical study. Computers & Operations Research, 28(8), 767-785.
2. Čagalj, M., Hubaux, J., Enz, C. (2002). Minimum-energy broadcast in all-wireless networks: Np-completeness and distribution issues. In Proceedings of the ACM MobiCom, pp. 172-182.
3. Chiu, H. S., Wu, B., Yeung, K. L., & Lui, K. S. (2008). Widest spanning tree for multi-channel multi-interface wireless mesh networks. In Proceedings of the IEEE WCNC, pp. 2194-2199.
4. Chou, C. T., Misra, A., & Qadir, J. (2006). Low-latency broadcast in multirate wireless mesh networks. IEEE Journal on Selected Areas in Communications (JSAC), 24(11), 2081-2091.
5. Erdos, P., & Rényi, A. (1960). On the evolution of random graphs. In Publication of the Mathematical Institute of the Hungarian Academy of Sciences, pp. 17-61.
6. Feige, U. (1998). A threshold of ln n for approximating set cover. Journal of the ACM, 45(4), 634-652.
7. Guha, S., & Khuller, S. (1998). Approximation algorithms for connected dominating sets. Algorithmica, 20(4), 374-387.
8. Guha, S., & Khuller, S. (1999). Improved methods for approximating node weighted steiner trees and connected dominating sets. Information and Computation, 150(1), 57-74.
9. Klein, P. N. & Ravi, R. (1995). A nearly best-possible approximation algorithm for node-weighted steiner trees. Journal of Algorithms, 19(1), 104-115.
10. Kleinberg, J. & Tardos, E. (2005). Algorithm design. Boston, MA: Addison Wesley.
11. Kyasanur, P., & Vaidya, N. H. (2006). Routing and link-layer protocols for multi-channel multi-interface ad hoc wireless networks. ACM SIGMOBILE Mobile Computing and Communications Review, 10(1), 31-43.
12. Kyasanur, P., So, J., Chereddi, C., Vaidya, N. H. (2006). Multichannel mesh networks: Challenges and protocols. IEEE Wireless Communications, 13(2), 30-36.
13. Li, L., Qin, B., Zhang, C., & Li, H. (2007). Efficient broadcasting in multi-radio multi-channel and multi-hop wireless networks based on self-pruning. In Proceedings of the HPCC, pp. 484-495.
14. Liang, W. F. (2006). Approximate minimum-energy multicasting in wireless ad hoc networks. IEEE Transactions on Mobile Computing 5(4), 377-387.
15. Mannucci, M. A., Sparks, L., & Struppa, D. C. (2006). Simplicial models of social aggregation I. URL: http://arxiv.org/abs/cs/0604090.
16. Munkres, J. R. (1984). Elements of algebraic topology. Menlo Park, CA: Addison-Wesley.
17. Nguyen, H. L., & Nguyen, U. T. (2009). Channel assignment for multicast in multi-channel multi-radio wireless mesh networks. Wireless Communications and Mobile Computing, 9(4), 557-571.
18. Ramanathan, R., Bar-Noy, A., Basu, P., Johnson, M., Ren, W., Swami, A., et al. (2011). Beyond graphs: Capturing groups in networks. In Proceedings of the IEEE NetSciCom.
19. Raniwala, A., & Chiueh, T. (2005). Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network. In Proceedings of the IEEE INFOCOM, pp. 2223-2234.
20. Redi, J., & Ramanathan, R. (2011). The DARPA WNaN network architecture. In Proceedings of the IEEE MILCOM, Baltimore.
21. Ren, W., & Zhao, Q. (2011). A note on: 'Algorithms for connected set cover problem and fault-tolerant connected set cover problem'. Theoretical Computer Science, 412(45), 6451-6454.
22. Tang, J., Xue, G., & Zhang, W. (2005). Interference-aware topology control and QoS routing in multi-channel wireless mesh networks. In Proceedings of the ACM MobiHoc, pp. 68-77.
23. Wieselthier, J. E., Nguyen, G. D., & Ephremides, A. (2002). Energy-efficient broadcast and multicast trees in wireless networks. Mobile Networks and Applications, 7(6), 481-492.
24. Zhang, Z., Gao, X. F., & Wu, W. L. (2009). Algorithms for connected set cover problem and fault-tolerant connected set cover problem. Theoretical Computer Science, 410(8-10), 812-817.