Distributed connectivity of wireless networks

We consider the problem of constructing a communication infrastructure from scratch, for a collection of identical wireless nodes. Combinatorially, this means a) finding a set of links that form a strongly connected spanning graph on a set of n points in the plane, and b) scheduling it efficiently in the SINR model of interference. The nodes must converge on a solution in a distributed manner, having no means of communication beyond the sole wireless channel. We give distributed connectivity algorithms that run in time O(poly(log δ, log n)), where δ is the ratio between the longest and shortest distances among nodes. Given that algorithm without prior knowledge of the instance are essentially limited to using uniform power, this is close to best possible. Our primary aim, however, is to find efficient structures, measured in the number of slots used in the final schedule of the links. Our main result is algorithms that match the efficiency of centralized solutions. Specifically, the networks can be scheduled in O(log n) slots using (arbitrary) power control, and in O(log n (log log δ + log n)) slots using a simple oblivious power scheme. Additionally, the networks have the desirable properties that the latency of a converge-cast and of any node-to-node communication is optimal O(log n) time.

[1]  Li Li,et al.  Distributed topology control for power efficient operation in multihop wireless ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[2]  Karl Henrik Johansson,et al.  Bounded control of network connectivity in multi-agent systems , 2010 .

[3]  Magnús M. Halldórsson.  Wireless scheduling with power control , 2012, TALG.

[4]  Christian Bettstetter,et al.  On the Connectivity of Ad Hoc Networks , 2004, Comput. J..

[5]  Thomas Kesselheim,et al.  A constant-factor approximation for wireless capacity maximization with power control in the SINR model , 2010, SODA '11.

[6]  Meng Ji,et al.  Connectedness preserving distributed coordination control over dynamic graphs , 2005, Proceedings of the 2005, American Control Conference, 2005..

[7]  Magnús M. Halldórsson,et al.  Nearly optimal bounds for distributed wireless scheduling in the SINR model , 2011, Distributed Computing.

[8]  Chuan Wu,et al.  Minimum-latency aggregation scheduling in wireless sensor networks under physical interference model , 2010, MSWIM '10.

[9]  Martin Hoefer,et al.  Convergence Time of Power-Control Dynamics , 2012, IEEE Journal on Selected Areas in Communications.

[10]  Roger Wattenhofer,et al.  Capacity of Arbitrary Wireless Networks , 2009, IEEE INFOCOM 2009.

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

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

[13]  Samir Ranjan Das,et al.  A measurement study of interference modeling and scheduling in low-power wireless networks , 2008, SenSys '08.

[14]  Teresa H. Meng,et al.  Minimum energy mobile wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[15]  Roger Wattenhofer,et al.  Local broadcasting in the physical interference model , 2008, DIALM-POMC '08.

[16]  Roger Wattenhofer,et al.  Topology control meets SINR: the scheduling complexity of arbitrary topologies , 2006, MobiHoc '06.

[17]  T. Moscibroda,et al.  The Worst-Case Capacity of Wireless Sensor Networks , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[18]  Berthold Vöcking,et al.  Oblivious interference scheduling , 2009, PODC '09.

[19]  George J. Pappas,et al.  Distributed connectivity control of mobile networks , 2007, 2007 46th IEEE Conference on Decision and Control.

[20]  Magnús M. Halldórsson,et al.  Wireless capacity with oblivious power in general metrics , 2011, SODA '11.

[21]  Yu-Chee Tseng,et al.  Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network , 2007, TOSN.

[22]  Roger Wattenhofer,et al.  Protocol Design Beyond Graph-Based Models , 2006, HotNets.

[23]  Ram Ramanathan,et al.  Topology control of multihop wireless networks using transmit power adjustment , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[24]  Roger Wattenhofer,et al.  Wireless Communication Is in APX , 2009, ICALP.

[25]  David Peleg,et al.  Distributed power control in the SINR model , 2011, 2011 Proceedings IEEE INFOCOM.

[26]  Roger Wattenhofer,et al.  The Complexity of Connectivity in Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[27]  Magnús M. Halldórsson,et al.  Wireless connectivity and capacity , 2012, SODA.

[28]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .