Exploiting Frequency Groups for Broadcasting in Multi-channel Multi-radio Networks

Network-wide broadcasting is a key requirement in military mobile ad hoc and sensor networks for supporting dissemination of routing control, situation reports, and other global traffic. Current methods for network-wide broadcasting are ill-suited for Multi-Channel Multi-Radio (MC-MR) networks because they do not exploit the presence of natural frequency groups for reducing the number of transmissions. We present Complex Activation Broadcasting (CAB) -- a decentralized algorithm for broadcasting in real-world MC-MR networks that captures naturally occurring groups and builds a tree that exploits them. Our approach is based on representing a network as a simplicial complex, which unlike a graph, allows higher-order aggregations necessary for natively capturing groups. Using a special kind of simplicial complex called a neighborhood sub complex, we present an algorithm for computing a broadcast tree. We have implemented our algorithm within the code base of a real-world military MANET, namely the DARPA WNaN network [1]. We compare the performance of our algorithm with the existing baseline. Results show that our algorithm uses 80 % less transmissions and 50% less receptions.

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

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

[3]  Calvin C. Newport,et al.  Maximal independent sets in multichannel radio networks , 2013, PODC '13.

[4]  László Lovász,et al.  Kneser's Conjecture, Chromatic Number, and Homotopy , 1978, J. Comb. Theory A.

[5]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[6]  E. Weisstein Kneser's Conjecture , 2002 .

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

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

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

[10]  Randeep Bhatia,et al.  Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks , 2006, IEEE J. Sel. Areas Commun..

[11]  Ram Ramanathan,et al.  Broadcasting in multi-radio multi-channel wireless networks using simplicial complexes , 2011, Wireless Networks.

[12]  Wei Peng,et al.  AHBP: An efficient broadcast protocol for mobile Ad hoc networks , 2001, Journal of Computer Science and Technology.

[13]  Wei Wang,et al.  Constructing minimum interference connected dominating set for multi-channel multi-radio multi-hop wireless network , 2012, Int. J. Sens. Networks.

[14]  Srinivasan Parthasarathy,et al.  Minimizing broadcast latency and redundancy in ad hoc networks , 2008, TNET.

[15]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

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

[17]  Anis Laouiti,et al.  Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks , 2000 .

[18]  Neil Genzlinger A. and Q , 2006 .

[19]  R. Ho Algebraic Topology , 2022 .

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

[21]  Alireza Keshavarz-Haddad,et al.  Broadcast capacity in multihop wireless networks , 2006, MobiCom '06.