Abstract
We introduce group-to-group anycast (g2g-anycast), a network design problem of substantial practical importance and considerable generality. Given a collection of groups and requirements for directed connectivity from source groups to destination groups, the solution network must contain, for each requirement, an omni-directional down-link broadcast, centered at any node of the source group, called the ball; the ball must contain some node from the destination group in the requirement and all such destination nodes in the ball must aggregate into a tree directed towards the source, called the funnel-tree. The solution network is a collection of balls along with the funnel-trees they contain. g2g-anycast models DBS (Digital Broadcast Satellite), Cable TV systems and drone swarms. It generalizes several well known network design problems including minimum energy unicast, multicast, broadcast, Steiner-tree, Steiner-forest and Group-Steiner tree. Our main achievement is an \(O(\log ^4 n)\) approximation, counterbalanced by an \(\log ^{(2-\epsilon )}n\) hardness of approximation, for general weights. Given the applicability to wireless communication, we present a scalable and easily implemented \(O(\log n)\) approximation algorithm, Cover-and-Grow for fixed-dimensional Euclidean space with path-loss exponent at least 2.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aichholzer, O., Allen, S., Aloupis, G., Barba, L., Bose, P., de Varufel, J.L., Iacono, J., Langerman, S., Souvaine, D., Taslakian, P., Yagnatinsky, M.: Sum of squared edges for MST of a point set in a unit square. In: Japanese Conference on Discrete and Computational Geometry (JCDCG) (2013)
Chekuri, C., Even, G., Gupta, A., Segev, D.: Set connectivity problems in undirected graphs and the directed Steiner network problem. ACM Trans. Algorithms 7(2), 18:1–18:17 (2011)
Garg, N.: Saving an epsilon: a 2-approximation for the k-MST problem in graphs. In: ACM Theory of Computing, pp. 396–402 (2005)
Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms 37(1), 66–84 (2000)
Halperin, E., Kortsarz, G., Krauthgamer, R., Srinivasan, A., Wang, N.: Integrality ratio for group Steiner trees and directed Steiner trees. SIAM J. Comput. 36(5), 1494–1511 (2007)
Halperin, E., Krauthgamer, R.: Polylogarithmic inapproximability. In: ACM Theory of Computing, pp. 585–594 (2003)
Iglesias, J., Rajaraman, R., Ravi, R., Sundaram, R.: Balls and funnels: energy efficient group-to-group anycasts. In: Dinh, T.N., Thai, M.T. (eds.) COCOON 2016. LNCS, vol. 558, pp. 235–246. Springer, Heidelberg (2016). CoRR http://arxiv.org/abs/1605.07196
Lapowsky, I.: Facebook lays out its roadmap for creating internet-connected drones. Wired (2014). http://www.wired.com/2014/09/facebook-drones-2/
Li, D., Liu, Q., Hu, X., Jia, X.: Energy efficient multicast routing in ad hoc wireless networks. Comput. Commun. 30(18), 3746–3756 (2007)
McNeal, G.: Google wants Internet broadcasting drones, plans to run tests in New Mexico. Forbes (2014). http://www.forbes.com/sites/gregorymcneal/2014/09/19/google-wants-internet-broadcasting-drones-plans-to-run-tests-in-new-mexico/
Milyeykovski, V., Segal, M., Shpungin, H.: Location, location, location: using central nodes for efficient data collection in WSNs. In: WiOpt, pp. 333–340, May 2013
Olsson, P.M.: Positioning algorithms for surveillance using unmanned aerial vehicles. Licentiate thesis, Linköpings universitet (2011)
Path Loss Wikipedia. http://en.wikipedia.org/wiki/Path_loss
Rappaport, T.: Wireless Communications: Principles and Practice, 2nd edn. Prentice Hall PTR, Upper Saddle River (2001)
Ravi, R., Sundaram, R., Marathe, M.V., Rosenkrantz, D.J., Ravi, S.S.: Spanning trees short or small. In: ACM-SIAM Discrete Algorithms, SODA 1994, pp. 546–555. SIAM (1994)
Wan, P.J., Călinescu, G., Li, X.Y., Frieder, O.: Minimum-energy broadcasting in static ad hoc wireless networks. Wirel. Netw. 8(6), 607–617 (2002)
Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: On the construction of energy-efficient broadcast and multicast trees in wireless networks. In: INFOCOM, pp. 585–594 (2000)
Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: Algorithms for energy-efficient multicasting in static ad hoc wireless networks. MONET 6(3), 251–263 (2001)
Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms, 1st edn. Cambridge University Press, New York (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Iglesias, J., Rajaraman, R., Ravi, R., Sundaram, R. (2016). Balls and Funnels: Energy Efficient Group-to-Group Anycasts. In: Dinh, T., Thai, M. (eds) Computing and Combinatorics . COCOON 2016. Lecture Notes in Computer Science(), vol 9797. Springer, Cham. https://doi.org/10.1007/978-3-319-42634-1_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-42634-1_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42633-4
Online ISBN: 978-3-319-42634-1
eBook Packages: Computer ScienceComputer Science (R0)