Abstract
We study algorithmic and complexity issues originating from the problem of data gathering in wireless networks. We give an algorithm to construct minimum makespan transmission schedules for data gathering when the communication graph G is a tree network, the interference range is any integer m ≥ 2, and no buffering is allowed at intermediate nodes. In the interesting case in which all nodes in the network have to deliver an arbitrary non-zero number of packets, we provide a closed formula for the makespan of the optimal gathering schedule. Additionally, we consider the problem of determining the computational complexity of data gathering in general graphs and show that the problem is NP–complete. On the positive side, we design a simple (1 + 2/m) factor approximation algorithm for general networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bermond, J.-C., Galtier, J., Klasing, R., Morales, N., Pérennes, S.: Hardness and approximation of gathering in static radio networks. PPL 16(2), 165–183 (2006)
Bermond, J.-C., Gargano, L., Rescigno, A.: Gathering with Minimum Delay in Sensor Networks. In: Shvartsman, A.A., Felber, P. (eds.) SIROCCO 2008. LNCS, vol. 5058, pp. 262–276. Springer, Heidelberg (2008)
Bermond, J.-C., Correa, R., Yu, M.-L.: Optimal Gathering Protocols on Paths under Interference Constraints. Discrete Mathematics 309(18), 5574–5587 (2009)
Bermond, J.-C., Peters, J.: Efficient gathering in radio grids with interference. In: Proc. AlgoTel 2005, Presqu’île de Giens, pp. 103–106 (2005)
Bermond, J.-C., Yu, M.-L.: Optimal gathering algorithms in multi-hop radio tree networks with interferences. Ad Hoc and S.W.N. 9(1-2), 109–128 (2010)
Bertin, P., Bresse, J.-F., Le Sage, B.: Accès haut débit en zone rurale: une solution “ad hoc”. France Telecom R&D 22, 16–18 (2005)
Bonifaci, V., Korteweg, P., Marchetti-Spaccamela, A., Stougie, L.: An Approximation Algorithm for the Wireless Gathering Problem. Op. Res. Lett. 36(5), 605–608 (2008)
Bonifaci, V., Klasing, R., Korteweg, P., Marchetti-Spaccamela, A., Stougie, L.: Data Gathering in Wireless Networks. Graphs and Algorithms in Communication Networks. In: Koster, A., Munoz, X. (eds.) Springer Monograph, pp. 357–377. Springer, Heidelberg (2010)
Choi, H., Wang, J., Hughes, E.A.: Scheduling for information gathering on sensor network. Wireless Network 15, 127–140 (2009)
Florens, C., Franceschetti, M., McEliece, R.J.: Lower Bounds on Data Collection Time in Sensory Networks. IEEE J. on SAC 22(6), 1110–1120 (2004)
Gargano, L.: Time Optimal Gathering in Sensor Networks. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol. 4474, pp. 7–10. Springer, Heidelberg (2007)
Gargano, L., Rescigno, A.A.: Optimally Fast Data Gathering in Sensor Networks. Discrete Applied Mathematics 157, 1858–1872 (2009)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
Gasieniec, L., Potapov, I.: Gossiping with Unit Messages in Known Radio Networks. IFIP TCS, pp. 193–205 (2002)
Pelc, A.: Broadcasting in radio networks. In: Stojmenovic, I. (ed.) Handbook of Wireless Networks and Mobile Computing, pp. 509–528. John Wiley and Sons, Inc, Chichester (2002)
Revah, Y., Segal, M.: Improved bounds for data-gathering time in sensor networks. Computer Communications 31(17), 4026–4034 (2008)
Schmid, S., Wattenhofer, R.: Algorithmic models for sensor networks. IPDPS (2006)
Zhu, X., Tang, B., Gupta, H.: Delay efficient data gathering in sensor networks. In: Jia, X., Wu, J., He, Y. (eds.) MSN 2005. LNCS, vol. 3794, pp. 380–389. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bermond, JC., Gargano, L., Perénnes, S., Rescigno, A.A., Vaccaro, U. (2011). Optimal Time Data Gathering in Wireless Networks with Omni–Directional Antennas. In: Kosowski, A., Yamashita, M. (eds) Structural Information and Communication Complexity. SIROCCO 2011. Lecture Notes in Computer Science, vol 6796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22212-2_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-22212-2_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22211-5
Online ISBN: 978-3-642-22212-2
eBook Packages: Computer ScienceComputer Science (R0)