Computing the k-coverage of a wireless network

Coverage is one of the main quality of service of a wireless network. k-coverage, that is to be covered simultaneously by k network nodes, is synonym of reliability and numerous applications such as multiple site MIMO features, or handovers. We introduce here a new algorithm for computing the k-coverage of a wireless network. Our method is based on the observation that k-coverage can be interpreted as k layers of 1-coverage, or simply coverage. We use simplicial homology to compute the network's topology and a reduction algorithm to indentify the layers of 1-coverage. We provide figures and simulation results to illustrate our algorithm.

[1]  Afra Zomorodian,et al.  Computing Persistent Homology , 2004, SCG '04.

[2]  A. Jadbabaie,et al.  Decentralized Computation of Homology Groups in Networks by Gossip , 2007, 2007 American Control Conference.

[3]  Li-Hsing Yen,et al.  Expected k-coverage in wireless sensor networks , 2006, Ad Hoc Networks.

[4]  Wei Chen,et al.  A Case Study on Regularity in Cellular Network Deployment , 2015, IEEE Wireless Communications Letters.

[5]  Gunnar E. Carlsson,et al.  Topological estimation using witness complexes , 2004, PBG.

[6]  Philippe Martins,et al.  Accuracy of homology based approaches for coverage hole detection in wireless sensor networks , 2012, 2012 IEEE International Conference on Communications (ICC).

[7]  M. Mrozek,et al.  Homology Computation by Reduction of Chain Complexes , 1998 .

[8]  Vin de Silva,et al.  Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology , 2006, Int. J. Robotics Res..

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

[10]  Philippe Martins,et al.  Homology-Based Distributed Coverage Hole Detection in Wireless Sensor Networks , 2013, IEEE/ACM Transactions on Networking.

[11]  Salah-Eddine Elayoubi,et al.  Evaluating the capacity gains from Coordinated MultiPoint transmission and reception , 2010, 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.

[12]  Philippe Martins,et al.  Reduction algorithm for simplicial complexes , 2013, 2013 Proceedings IEEE INFOCOM.

[13]  Philippe Martins,et al.  Simplicial Homology for Future Cellular Networks , 2015, IEEE Transactions on Mobile Computing.

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

[15]  Steeve Zozor,et al.  Ensuring k-coverage in Low-Power Wide Area Networks for Internet of Things , 2017, 2017 International Conference on Computing, Networking and Communications (ICNC).