Abstract
In this paper a Convergecast Scheduling Problem on a unit square grid, in each node of which there is a sensor with transmission distance d which is not less than 3, is considered. For the cases \(d=1\) and \(d=2\), polynomial algorithms, which construct the optimal solution to the problem, are known. For an arbitrary d, an approximate algorithm is proposed, the application of which gives an upper bound on the length of the conflict-free data aggregation schedule, depending on d. We conducted a priori and a posteriori analysis of the accuracy of this algorithm for various d comparing either with the optimal length of the schedule, or with a lower bound, the value of which we improved.
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
Aldyn-ool, T.A., Erzin, A.I., Zalyubovskiy, V.V.: The coverage of a planar region by randomly deployed sensors. Vestn. Novosib. Gos. Univ. Ser. Mat. Mekh. Inform. 10(4), 7–25 (2010)
De Souza, E., Nikolaidis, I.: An exploration of aggregation convergecast scheduling. Ad Hoc Netw. 11, 2391–2407 (2013)
Erzin, A., Pyatkin, A.: Convergecast scheduling problem in case of given aggregation tree. The complexity status and some special cases. In: 10th International Symposium on Communication Systems, Networks and Digital Signal Processing, article 16, 6 p. IEEE-Xplore, Prague (2016)
Erzin, A.: Solution of the convergecast scheduling problem on a square unit grid when the transmission range is 2. In: Battiti, R., Kvasov, D.E., Sergeyev, Y.D. (eds.) LION 2017. LNCS, vol. 10556, pp. 50–63. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-69404-7_4
Gagnon, J., Narayanan, L.: Minimum latency aggregation scheduling in wireless sensor networks. In: Gao, J., Efrat, A., Fekete, S.P., Zhang, Y. (eds.) ALGOSENSORS 2014. LNCS, vol. 8847, pp. 152–168. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-46018-4_10
Incel, O.D., Ghosh, A., Krishnamachari, B., Chintalapudi, K.: Fast data collection in tree-based wireless sensor networks. IEEE Trans. Mob. Comput. 11(1), 86–99 (2012)
Malhotra, B., Nikolaidis, I., Nascimento, M.A.: Aggregation convergecast scheduling in wireless sensor networks. Wirel. Netw. 17, 319–335 (2011)
Tian, C.: Neither shortest path nor dominating set: aggregation scheduling by greedy growing tree in multihop wireless sensor networks. IEEE Trans. Veh. Technol. 60(7), 3462–3472 (2011)
Zalyubovskiy, V., Erzin, A., Astrakov, S., Choo, H.: Energy-efficient area coverage by sensors with adjustable ranges. Sensors 9(4), 2446–2460 (2009)
Acknowledgments
The research of A. Erzin is partly supported by the Russian Foundation for Basic Research (grants 16-07-00552 and 17-51-45125) and by the Ministry of Science and Education of the Russian Federation under the 5–100 Excellence Programme. The research of R. Plotnikov is partly supported by the Russian Foundation for Basic Research (grant 16-37-60006).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix
Appendix
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Erzin, A., Plotnikov, R. (2017). Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3. In: Fernández Anta, A., Jurdzinski, T., Mosteiro, M., Zhang, Y. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2017. Lecture Notes in Computer Science(), vol 10718. Springer, Cham. https://doi.org/10.1007/978-3-319-72751-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-72751-6_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-72750-9
Online ISBN: 978-3-319-72751-6
eBook Packages: Computer ScienceComputer Science (R0)