Analyzing wireless communication network vulnerability with homological invariants

This article explains how homology theory can be applied to simplicial complex models of wireless communication networks to study their vulnerability to jamming. It develops two classes of invariants (one local and one global) for studying which nodes and links present more of a liability to the network's performance when under attack.

[1]  R. Ho.  Algebraic Topology , 2022 .

[2]  Guevara Noubir,et al.  On Connectivity in Ad Hoc Networks under Jamming Using Directional Antennas and Mobility , 2004, WWIC.

[3]  L. Tian,et al.  Percolation of partially interdependent networks under targeted attack. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  A. Robert Calderbank,et al.  Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures , 2007, Proceedings of the IEEE.

[5]  Yasuaki Hiraoka,et al.  Applications of Sheaf Cohomology and Exact Sequences on Network Codings , 2011 .

[6]  A. Robert Calderbank,et al.  Utility-optimal random-access control , 2007, IEEE Transactions on Wireless Communications.

[7]  Panos M. Pardalos,et al.  On New Approaches of Assessing Network Vulnerability: Hardness and Approximation , 2012, IEEE/ACM Transactions on Networking.

[8]  Vaduvur Bharghavan,et al.  Achieving MAC layer fairness in wireless packet networks , 2000, MobiCom '00.

[9]  Konstantin Mischaikow,et al.  Morse Theory for Filtrations and Efficient Computation of Persistent Homology , 2013, Discret. Comput. Geom..

[10]  Abubakr Muhammad,et al.  Blind Swarms for Coverage in 2-D , 2005, Robotics: Science and Systems.

[11]  Marco Di Summa,et al.  Complexity of the critical node problem over trees , 2011, Comput. Oper. Res..

[12]  Vin de Silva,et al.  Coverage in sensor networks via persistent homology , 2007 .

[13]  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..

[14]  Wenyuan Xu,et al.  The feasibility of launching and detecting jamming attacks in wireless networks , 2005, MobiHoc '05.

[15]  Harry Eugene Stanley,et al.  Robustness of a Network of Networks , 2010, Physical review letters.

[16]  R. Ghrist.  Barcodes: The persistent topology of data , 2007 .

[17]  David Cohen-Steiner,et al.  Stability of Persistence Diagrams , 2005, Discret. Comput. Geom..

[18]  Rastko R. Selmic,et al.  Decentralized detection and patching of coverage holes in wireless sensor networks , 2009, Defense + Commercial Sensing.

[19]  Lili Qiu,et al.  Impact of Interference on Multi-Hop Wireless Network Performance , 2003, MobiCom '03.

[20]  S. Havlin,et al.  The extreme vulnerability of interdependent spatially embedded networks , 2012, Nature Physics.

[21]  Harry Eugene Stanley,et al.  Robustness of onion-like correlated networks against targeted attacks , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Panos M. Pardalos,et al.  Detecting critical nodes in sparse graphs , 2009, Comput. Oper. Res..

[23]  Jean C. Walrand,et al.  Design of Network Topology in an Adversarial Environment , 2010, GameSec.

[24]  Herbert Edelsbrunner,et al.  Topological Persistence and Simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[25]  Panos M. Pardalos,et al.  The wireless network jamming problem , 2007, J. Comb. Optim..

[26]  Sanjay Jha,et al.  The holes problem in wireless sensor networks: a survey , 2005, MOCO.

[27]  Wenyuan Xu,et al.  Jamming sensor networks: attack and defense strategies , 2006, IEEE Network.

[28]  R. Selmic,et al.  Detecting coverage holes in wireless sensor networks , 2009, 2009 17th Mediterranean Conference on Control and Automation.

[29]  Nitin H. Vaidya,et al.  Priority Scheduling in Wireless Ad Hoc Networks , 2002, MobiHoc '02.