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

Proceedings - 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2011

Volumn , Issue , 2011, Pages 660-665

  Ren, W ^a   Zhao, Q ^a   Ramanathan, R ^b   Gao, J ^a   Swami, A ^c   Bar Noy, A ^d   Johnson, M ^e   Basu, P ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b BBN TECHNOLOGIES   (United States)

^c U S ARMY RESEARCH LABORATORY   (United States)

^d CITY UNIVERSITY OF NEW YORK   (United States)

^e PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

ad hoc network; Broadcast; minimum spanning; multi channel; multi radio; simplicial complex

Indexed keywords

BROADCAST; MINIMUM SPANNING; MULTI-CHANNEL; MULTI-RADIO; SIMPLICIAL COMPLEX;

AD HOC NETWORKS; APPROXIMATION ALGORITHMS; MOBILE AD HOC NETWORKS; MOBILE RADIO SYSTEMS; SENSORS; WIRELESS SENSOR NETWORKS;

RADIO BROADCASTING;

EID: 83355164592     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MASS.2011.70     Document Type: Conference Paper

References (21)

1. P. Kyasanur, J. So, C. Chereddi, and N. H. Vaidya, "Multichannel mesh networks: Challenges and protocols," IEEE Wireless Communications, vol. 13, no. 2, pp. 30-36, April 2006. (Pubitemid 43742766)
2. A. Raniwala and T. Chiueh, "Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network," in Proc. of IEEE INFOCOM, March 2005, pp. 2223-2234.
3. J. Tang, G. Xue, and W. Zhang, "Interference-aware topology control and qos routing in multi-channel wireless mesh networks," in Proc. of ACM MobiHoc, May 2005, pp. 68-77.
4. P. Kyasanur and N. H. Vaidya, "Routing and link-layer protocols for multi-channel multi-interface ad hoc wireless networks," ACM SIGMOBILE Mobile Computing and Communications Review, vol. 10, no. 1, pp. 31-43, January 2006.
5. H. L. Nguyen and U. T. Nguyen, "Channel assignment for multicast in multi-channel multi-radio wireless mesh networks," Wireless Communications and Mobile Computing, vol. 9, no. 4, pp. 557-571, April 2009.
6. M. Čagalj, J. Hubaux, and C. Enz, "Minimum-energy broadcast in all-wireless networks: NP-Completeness and distribution issues," in Proc. of ACM MobiCom, September 2002, pp. 172- 182.
7. J. Redi and R. Ramanathan, "The DARPA WNaN network architecture," in Proc. of IEEE MILCOM, Baltimore, April 2011.
8. J. Kleinberg and E. Tardos, Algorithm Design. Boston, MA: Addison Wesley, 2005.
9. C. T. Chou, A. Misra, and J. Qadir, "Low-latency broadcast in multirate wireless mesh networks," IEEE Journal on Selected Areas in Communications (JSAC), vol. 24, no. 11, pp. 2081-2091, November 2006. (Pubitemid 44711712)
10. L. Li, B. Qin, C. Zhang, and H. Li, "Efficient broadcasting in multi-radio multi-channel and multi-hop wireless networks based on self-pruning," in Proc. of HPCC, September 2007, pp. 484-495.
11. H. S. Chiu, B. Wu, K. L. Yeung, and K. S. Lui, "Widest spanning tree for multi-channel multi-interface wireless mesh networks," in Proc. of IEEE WCNC, March 2008, pp. 2194-2199.
12. R. Ramanathan, A. Bar-Noy, P. Basu, M. Johnson, W. Ren, A. Swami, and Q. Zhao, "Beyond graphs: Capturing groups in networks," in Proc. of IEEE NetSciCom, April 2011.
13. J. R. Munkres, Elements of Algebraic Topology. MenloPark, CA: Addison-Wesley, 1984.
14. W. Ren, Q. Zhao, R. Ramanathan, J. Gao, A. Swami, A. Bar-Noy, M. Johnson, and P. Basu, "Broadcasting in multi-radio multi-channel wireless networks using simplicial complexes," Technical Report (TR-11-01), July 2011. [Online]. Available: http://www.ece.ucdavis.edu/~qzhao/TR-11-01.pdf
15. U. Feige, "A threshold of ln n for approximating set cover," Journal of the ACM, vol. 45, no. 4, pp. 634-652, July 1998.
16. Z. Zhang, X. F. Gao, and W. L. Wu, "Algorithms for connected set cover problem and fault-tolerant connected set cover problem," Theoretical Computer Science, vol. 410, no. 8-10, pp. 812-817, March 2009.
17. W. Ren and Q. Zhao, "A note on: 'algorithms for connected set cover problem and fault-tolerant connected set cover problem'," Theoretical Computer Science (to appear), February 2011. [Online]. Available: http://arxiv.org/abs/1104.0733
18. P. N. Klein and R. Ravi, "A nearly best-possible approximation algorithm for node-weighted steiner trees," Journal of Algorithms, vol. 19, no. 1, pp. 104-115, July 1995.
19. S. Guha and S. Khuller, "Improved methods for approximating node weighted steiner trees and connected dominating sets," Information and Computation, vol. 150, no. 1, pp. 57-74, April 1999. (Pubitemid 129610435)
20. -, "Approximation algorithms for connected dominatingsets," Algorithmica, vol. 20, no. 4, pp. 374-387, April 1998.
21. M. A. Mannucci, L. Sparks, and D. C. Struppa, "Simplicial models of social aggregation i," April 2006. [Online]. Available: http://arxiv.org/abs/cs/0604090