Abstract
In wireless sensor networks, sensor nodes are used to collect data from the environment and send it to a data collection point or a sink node using a converge cast tree. Considerable savings in energy can be obtained by aggregating data at intermediate nodes along the way to the sink.
We study the problem of finding a minimum latency aggregation tree and transmission schedule in wireless sensor networks. This problem is referred to as Minimum Latency Aggregation Scheduling (MLAS) in the literature and has been proven to be NP-Complete even for unit disk graphs. For sensor networks deployed in a linear domain, that are represented as unit interval graphs, we give a 2-approximation algorithm for the problem. For \(k\)-regular unit interval graphs, we give an optimal algorithm: it is guaranteed to have a latency that is within one time slot of the optimal latency. We also give tight bounds for the latency of aggregation convergecast for grids and tori.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Bermond, J.-C., Nisse, N., Reyes, P., Herve, R.: Minimum delay data gathering in radio networks. In: Proceedings of Ad Hoc-Now Conference (2009)
Bermond, J.-C., Peters, J.G.: Optimal gathering in radio grids with interference. Theor. Comput. Sci. 457, 10–26 (2012)
Chen, X., Hu, X., Zhu, J.: Minimum data aggregation time problem in wireless sensor networks. In: Jia, X., Wu, J., He, Y. (eds.) MSN 2005. LNCS, vol. 3794, pp. 133–142. Springer, Heidelberg (2005)
Chlamtac, I., Kutten, S.: On broadcasting in radio networks-problem analysis and protocol design. IEEE Trans. Commun. 33(12), 1240–1246 (1985)
Demirkol, I., Ersoy, C., Alagoz, F.: MAC protocols for wireless sensor networks: a survey. IEEE Commun. Mag. 44(4), 115–121 (2006)
Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. Networks 18(4), 319–349 (1988)
Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: Energy-efficient communication protocol for wireless microsensor networks. In: Proceedings of the 33rd Annual Hawaii International Conference, p. 10. IEEE (2000)
Huang, S.C.-H., Wan, P.-J., Vu, C.T., Li, Y., Yao, F.: Nearly constant approximation for data aggregation scheduling in wireless sensor networks. In: Proceedings of the 26th IEEE International Conference on Computer Communications (INFOCOM), pp. 366–372. IEEE (2007)
Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed diffusion: a scalable and robust communication paradigm for sensor networks. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, pp. 56–67. ACM (2000)
Kesselman, A., Kowalski, D.R.: Fast distributed algorithm for convergecast in ad hoc geometric radio networks. J. Parallel Distrib. Comput. 66(4), 578–585 (2006)
Klasing, R., Korteweg, L., Stougie, P., Marchetti-Spaccamela, A.: Data gathering in wireless networks. In: Koster, A., Muñoz, X. (eds.) Graphs and Algorithms in Communication Networks. Texts in Theoretical Computer Science: An EATCS Series, pp. 357–377. Springer, Heidelberg (2009)
Krishnamachari, B., Estrin, D., Wicker, S.: The impact of data aggregation in wireless sensor networks. In: Proceedings of the 22nd International Conference on Distributed Computing Systems, pp. 575–578. IEEE (2002)
Kulkarni, S.: TDMA service for sensor networks. In: Proceedings of the 24th International Conference on Distributed Computing Systems, pp. 604–609 (2004)
Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: a tiny aggregation service for ad-hoc sensor networks. ACM SIGOPS Oper. Syst. Rev. 36(SI), 131–146 (2002)
Malhotra, B., Nikolaidis, I., Nascimento, M.A.: Aggregation convergecast scheduling in wireless sensor networks. Wirel. Netw. 17(2), 319–335 (2011)
Onus, M., Richa, A., Kothapalli, K., Scheidler, C.: Efficient broadcasting and gathering in wireless ad hoc networks. In: Proceedings of ISPAN, pp. 346–351 (2005)
Slater, P.J., Cockayne, E.J., Hedetniemi, S.T.: Information dissemination in trees. SIAM J. Comput. 10(4), 692–701 (1981)
Bonifaci, V., Korteweg, P., Marchetti-Spaccamela, A., Stougie, L.: An approximation algorithm for the wireless gathering problem. Oper. Res. Lett. 36(5), 605–608 (2008)
Wan, P.-J., Huang, S.C.-H., Wang, L., Wan, Z., Jia, X.: Minimum-latency aggregation scheduling in multihop wireless networks. In: Proceedings of the 10th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 185–194. ACM (2009)
Minji, W., Xu, J.J., Tang, X.X., Lee, W.-C.: Top-k monitoring in wireless sensor networks. IEEE Trans. Knowl. Data Eng. 19(7), 962–976 (2007)
Xu, X., Wang, S., Mao, X., Tang, S., Li, X.Y.: An improved approximation algorithm for data aggregation in multi-hop wireless sensor networks. In: Proceedings of the 2nd ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing, FOWANC ’09, pp. 47–56. ACM, New York (2009)
Yu, B., Li, J., Li, Y.: Distributed data aggregation scheduling in wireless sensor networks. In: Proceedings of the 28th Conference on Computer Communications (INFOCOM), pp. 2159–2167. IEEE (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gagnon, J., Narayanan, L. (2015). Minimum Latency Aggregation Scheduling in Wireless Sensor Networks. In: Gao, J., Efrat, A., Fekete, S., Zhang, Y. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2014. Lecture Notes in Computer Science(), vol 8847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46018-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-662-46018-4_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-46017-7
Online ISBN: 978-3-662-46018-4
eBook Packages: Computer ScienceComputer Science (R0)