Deterministic Backbone Creation in an SINR Network without Knowledge of Location

For a given network, a backbone is an overlay network consisting of a connected dominating set with additional accessibility properties. Once a backbone is created for a network, it can be utilized for fast communication amongst the nodes of the network. The Signal-to-Interference-plus-Noise-Ratio (SINR) model has become the standard for modeling communication among devices in wireless networks. For this model, the community has pondered what the most realistic solutions for communication problems in wireless networks would look like. Such solutions would have the characteristic that they would make the least number of assumptions about the availability of information about the participating nodes. Solving problems when nothing at all is known about the network and having nodes just start participating would be ideal. However, this is quite challenging and most likely not feasible. The pragmatic approach is then to make meaningful assumptions about the available information and present efficient solutions based on this information. We present a solution for creation of backbone in the SINR model, when nodes do not have access to their physical coordinates or the coordinates of other nodes in the network. This restriction models the deployment of nodes in various situations for sensing hurricanes, cyclones, and so on, where only information about nodes prior to their deployment may be known but not their actual locations post deployment. We assume that nodes have access to knowledge of their label, the labels of nodes within their neighborhood, the range from which labels are taken $[N]$ and the total number of participating nodes $n$. We also assume that nodes wake up spontaneously. We present an efficient deterministic protocol to create a backbone with a round complexity of $O(\Delta \lg^2 N)$.

[1]  Andrzej Pelc,et al.  Broadcasting in UDG radio networks with unknown topology , 2007, PODC '07.

[2]  Nader H. Bshouty,et al.  Almost Optimal Cover-Free Families , 2015, CIAC.

[3]  Berthold Vöcking,et al.  Distributed Contention Resolution in Wireless Networks , 2010, DISC.

[4]  Shailesh Vaya,et al.  Deterministic Protocols in the SINR Model without Knowledge of Coordinates , 2021, J. Comput. Syst. Sci..

[5]  Shailesh Vaya,et al.  Achieving Dilution without Knowledge of Coordinates in the SINR Model , 2017, ArXiv.

[6]  Andrea E. F. Clementi,et al.  Selective families, superimposed codes, and broadcasting on unknown radio networks , 2001, SODA '01.

[7]  Bogdan S. Chlebus,et al.  Distributed communication in bare-bones wireless networks , 2016, ICDCN.

[8]  Calvin C. Newport,et al.  Broadcast in the Ad Hoc SINR Model , 2013, DISC.

[9]  Annalisa De Bonis,et al.  Generalized Framework for Selectors with Applications in Optimal Group Testing , 2003, ICALP.

[10]  Francis C. M. Lau,et al.  Distributed Multiple-Message Broadcast in Wireless Ad-Hoc Networks under the SINR Model , 2012, SIROCCO.

[11]  Dariusz R. Kowalski,et al.  Distributed Randomized Broadcasting in Wireless Networks under the SINR Model , 2013, DISC.

[12]  Dariusz R. Kowalski,et al.  Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices , 2012, ICALP.

[13]  Jiguo Yu,et al.  Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey , 2013, Comput. Commun..

[14]  Dariusz R. Kowalski,et al.  Distributed Deterministic Broadcasting in Wireless Networks under the SINR Model , 2012, ArXiv.

[15]  Dariusz R. Kowalski,et al.  Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks , 2012, DISC.

[16]  Dariusz R. Kowalski,et al.  On setting-up asynchronous ad hoc wireless networks , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[17]  Christian Scheideler,et al.  An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model , 2008, MobiHoc '08.

[18]  Dariusz R. Kowalski,et al.  Multi-Broadcasting under the SINR Model , 2015, ArXiv.

[19]  Andrzej Pelc,et al.  Broadcasting in geometric radio networks , 2007, J. Discrete Algorithms.