Minimum-Energy Broadcast and disk cover in grid wireless networks

The Minimum Energy Broadcast problem consists in finding the minimum-energy range assignment for a given set S of n stations of an ad hoc wireless network that allows a source station to perform broadcast operations over S We prove a nearly tight asymptotical bound on the optimal cost for the Minimum Energy Broadcast problem on square grids. We emphasize that finding tight bounds for this problem restriction is far to be easy: it involves the Gauss's Circle problem and the Apollonian Circle Packing. We also derive near-tight bounds for the Bounded-Hop version of this problem. Our results imply that the best-known heuristic, the MST-based one, for the Minimum Energy Broadcast problem is far to achieve optimal solutions (even) on very regular, well-spread instances: its worst-case approximation ratio is about π and it yields $\Omega(\sqrt{n})$ hops As a by product, we get nearly tight bounds for the Minimum Disk Cover problem and for its restriction in which the allowed disks must have non-constant radius Finally, we emphasize that our upper bounds are obtained via polynomial time constructions

[1]  Andrea E. F. Clementi,et al.  On the Power Assignment Problem in Radio Networks , 2004, Mob. Networks Appl..

[2]  Bo Ss Oderberg,et al.  Apollonian Tiling, the Lorentz Group and Regular Trees , 1992 .

[3]  Jack M. Holtzman,et al.  Wireless information networks , 2010, 2010 International Conference on Wireless Information Networks and Systems (WINSYS).

[4]  Justin Zobel,et al.  Cache-efficient string sorting using copying , 2007, ACM J. Exp. Algorithmics.

[5]  S. Voß,et al.  The Steiner tree problem with hop constraints , 1999, Ann. Oper. Res..

[6]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[7]  C. L. Mallows,et al.  Apollonian circle packings:number theory , 2000 .

[8]  Andrea E. F. Clementi,et al.  On the approximation ratio of the MST based heuristic for the energy-efficient broadcast problem in static ad-hoc radio networks , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[9]  M. Huxley.  Exponential sums and lattice points III , 2003 .

[10]  Andrea E. F. Clementi,et al.  On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs , 2001, STACS.

[11]  Andrzej Pelc,et al.  Power consumption in packet radio networks , 2000, Theor. Comput. Sci..

[12]  Xiang-Yang Li,et al.  Minimum-energy broadcast routing in static ad hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[13]  Andrzej Pelc,et al.  Fault-Tolerant Broadcasting in Radio Networks , 2001, J. Algorithms.

[14]  Anthony Ephremides,et al.  On the construction of energy-efficient broadcast and multicast trees in wireless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[15]  Stéphane Pérennes,et al.  The “real” approximation factor of the MST heuristic for the minimum energy broadcasting , 2007, ACM J. Exp. Algorithmics.

[16]  Kemal Altinkemer,et al.  Using a Hop-Constrained Model to Generate Alternative Communication Network Design , 2015, INFORMS J. Comput..

[17]  Xiang-Yang Li,et al.  Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[18]  Andrea E. F. Clementi,et al.  Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks , 2006, SIROCCO.

[19]  Pierluigi Crescenzi,et al.  A compendium of NP optimization problems , 1994, WWW Spring 1994.

[20]  D. Hilbert,et al.  Geometry and the Imagination , 1953 .

[21]  Christoph Ambühl,et al.  An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks , 2005, ICALP.

[22]  Klaus Jansen,et al.  Experimental and Efficient Algorithms , 2003, Lecture Notes in Computer Science.

[23]  M. Haenggi.  Twelve reasons not to route over many short hops , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[24]  Luís Gouveia,et al.  Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints , 1995, Comput. Oper. Res..

[25]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.