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

We consider the broadcasting problem in multi-radio multi-channel ad hoc networks. The objective is to minimize the total cost of the network-wide broadcast, where the cost can be of any form that is summable over all the transmissions (e.g., the transmission and reception energy, the price for accessing a specific channel). Our technical approach is based on a simplicial complex model that allows us to capture the broadcast nature of the wireless medium and the heterogeneity across radios and channels. Specifically, we show that broadcasting in multi-radio multi-channel ad hoc networks can be formulated as a minimum spanning problem in simplicial complexes. We establish the NP-completeness of the minimum spanning problem and propose two approximation algorithms with order-optimal performance guarantee. The first approximation algorithm converts the minimum spanning problem in simplical complexes to a minimum connected set cover (MCSC) problem. The second algorithm converts it to a node-weighted Steiner tree problem under the classic graph model. These two algorithms offer tradeoffs between performance and time-complexity. In a broader context, this work appears to be the first that studies the minimum spanning problem in simplicial complexes and weighted MCSC problem.

[1]  Kai Han,et al.  Broadcast Routing and Channel Selection in Multi-Radio Wireless Mesh Networks , 2008, 2008 IEEE Wireless Communications and Networking Conference.

[2]  Daniele C. Struppa,et al.  Simplicial models of social aggregation I , 2006, ArXiv.

[3]  Ram Ramanathan,et al.  The DARPA WNaN network architecture , 2011, 2011 - MILCOM 2011 Military Communications Conference.

[4]  Éva Tardos,et al.  Algorithm design , 2005 .

[5]  Nitin H. Vaidya,et al.  Routing and interface assignment in multi-channel multi-interface wireless networks , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[6]  Nguyen Hoang Lan,et al.  Channel assignment for multicast in multi-channel multi-radio wireless mesh networks , 2009 .

[7]  Abubakr Muhammad,et al.  Coverage and hole-detection in sensor networks via homology , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[8]  Jian Tang,et al.  Interference-aware topology control and QoS routing in multi-channel wireless mesh networks , 2005, MobiHoc '05.

[9]  Nitin H. Vaidya,et al.  Capacity of multi-channel wireless networks: impact of number of channels and interfaces , 2005, MobiCom '05.

[10]  Qing Zhao,et al.  A Note on: 'Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem' , 2011, ArXiv.

[11]  Hamid Krim,et al.  Divide and Conquer: Localizing Coverage Holes in Sensor Networks , 2010, 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON).

[12]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[13]  Weifa Liang Approximate minimum-energy multicasting in wireless ad hoc networks , 2006 .

[14]  Archan Misra,et al.  Low-Latency Broadcast in Multirate Wireless Mesh Networks , 2006, IEEE Journal on Selected Areas in Communications.

[15]  S. Guha,et al.  Approximation Algorithms for Connected Dominating Sets , 1998, Algorithmica.

[16]  R. Ravi,et al.  A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.

[17]  Weili Wu,et al.  Algorithms for connected set cover problem and fault-tolerant connected set cover problem , 2009, Theor. Comput. Sci..

[18]  James R. Munkres,et al.  Elements of algebraic topology , 1984 .

[19]  Jean-Pierre Hubaux,et al.  Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues , 2002, MobiCom '02.

[20]  Samir Khuller,et al.  Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets , 1998, FSTTCS.

[21]  Nguyen Hoang Lan,et al.  Channel assignment for multicast in multi-channel multi-radio wireless mesh networks , 2009, Wirel. Commun. Mob. Comput..

[22]  Vijay Kumar,et al.  Towards simplicial coverage repair for mobile robot teams , 2010, 2010 IEEE International Conference on Robotics and Automation.

[23]  Tzi-cker Chiueh,et al.  Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[24]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[25]  Khalil S. Hindi,et al.  Minimum-weight spanning tree algorithms A survey and empirical study , 2001, Comput. Oper. Res..

[26]  Jie Wu,et al.  On reducing broadcast redundancy in ad hoc wireless networks , 2002, 36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the.

[27]  Nitin H. Vaidya,et al.  Multichannel mesh networks: challenges and protocols , 2006, IEEE Wireless Communications.

[28]  Archan Misra,et al.  Minimum Latency Broadcasting in Multiradio, Multichannel, Multirate Wireless Meshes , 2009, IEEE Trans. Mob. Comput..

[29]  Jun Wang,et al.  Broadcasting Protocols for Multi-Radio Multi-Channel and Multi-Rate Mesh Networks , 2007, 2007 IEEE International Conference on Communications.

[30]  Nitin H. Vaidya,et al.  SHORT: A Static-Hybrid Approach for Routing Real Time Applications over Multichannel, Multihop Wireless Networks , 2010, WWIC.

[31]  W. Ren,et al.  Beyond graphs: Capturing groups in networks , 2011, 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[32]  Bin Wu,et al.  Widest Spanning Tree for Multi-Channel Multi-Interface Wireless Mesh Networks , 2008, 2008 IEEE Wireless Communications and Networking Conference.

[33]  Samir Ranjan Das,et al.  A multichannel CSMA MAC protocol with receiver-based channel selection for multihop wireless networks , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).

[34]  B. Bollobás The evolution of random graphs , 1984 .

[35]  Chunyuan Zhang,et al.  Efficient Broadcasting in Multi-radio Multi-channel and Multi-hop Wireless Networks Based on Self-pruning , 2007, HPCC.

[36]  A. Rbnyi ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[37]  Brenton D. Walker,et al.  Using persistent homology to recover spatial information from encounter traces , 2008, MobiHoc '08.

[38]  Anthony Ephremides,et al.  Energy-Efficient Broadcast and Multicast Trees in Wireless Networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[39]  Prasant Mohapatra,et al.  Scalable multicasting in mobile ad hoc networks , 2004, IEEE INFOCOM 2004.

[40]  Stefan Friedrich,et al.  Topology , 2019, Arch. Formal Proofs.

[41]  Nitin H. Vaidya,et al.  Routing and link-layer protocols for multi-channel multi-interface ad hoc wireless networks , 2006, MOCO.

[42]  Ananthram Swami,et al.  Broadcasting in Multi-Radio Multi-Channel Wireless Networks using Simplicial Complexes , 2011, MASS.