Abstract
We consider minimizing the delay during an interference-conflict-free aggregation session in wireless sensor networks when the network elements can use various frequency channels for the data transmission. In general, this problem is known to be NP-hard. We focus on a particular case when sensors are positioned at the square grid nodes and have the same transmission ranges equal to their interference ranges. We propose an approximation algorithm with guaranteed estimates. The algorithm consists of two stages. At the first stage, the nodes transmit the data upwards or downwards until all data are collected at the nodes of the first row. At the second stage, all the nodes of the first row transmit the data to the sink. Also, we present a new ILP formulation of the problem on the arbitrary network topology and provide the experiment results. We use the GUROBI solver to get the optimal solutions on the small-size instances and compare the results yielded by the proposed algorithm with optimal solutions. We also compare the proposed algorithm with the known approach in a two-channel case and show how the number of channels affects the schedule length depending on the instances sizes.
The Russian Science Foundation supports this research (Grant No. 19-71-10012. Project “Multi-agent systems development for automatic remote control of traffic flows in congested urban road 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
References
Bagaa, M., et al.: Data aggregation scheduling algorithms in wireless sensor networks: solutions and challenges. IEE Commun. Surv. Tutor. 16(3), 1339–1368 (2014)
Bagaa, M., Younis, M. and Badache, N.: Efficient data aggregation scheduling in wireless sensor networks with multi-channel links. In: MSWiM 2013, 3–8 November 2013, Barcelona, Spain (2014). https://doi.org/10.1145/2507924.2507995
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). https://doi.org/10.1007/11599463_14
Demirkol, I., Ersoy, C., Alagoz, F.: MAC protocols for wireless sensor networks: a survey. IEEE Commun. Mag 44, 115–121 (2006)
Erzin, A., Pyatkin, A.: Convergecast scheduling problem in case of given aggregation tree. The complexity status and some special cases. In: 10-th 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
Erzin, A., Plotnikov, R.: 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.A., Zhang, Y. (eds.) ALGOSENSORS 2017. LNCS, vol. 10718, pp. 141–154. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-72751-6_11
Erzin, A., Plotnikov, R.: Two-channel conflict-free square grid aggregation. In: Kotsireas, I.S., Pardalos, P.M. (eds.) LION 2020. LNCS, vol. 12096, pp. 168–183. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-53552-0_18
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
Ghods, F., et al.: MC-MLAS: Multi-channel minimum latency aggregation scheduling in wireless sensor networks. Comput. Netw. 57, 3812–3825 (2013)
Guo, L., Li, Y., Cai, Z.: Minimum-latency aggregation scheduling in wireless sensor network. J. Combinat. Optim. 31(1), 279–310 (2014). https://doi.org/10.1007/s10878-014-9748-7
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)
Li, J., et al.: Approximate holistic aggregation in wireless sensor networks. ACM Trans. Sensor Netw. 13(2), 1–24 (2017)
Malhotra, B., Nikolaidis, I., Nascimento, M.A.: Aggregation convergecast scheduling in wireless sensor networks. Wirel. Netw. 17, 319–335 (2011)
Plotnikov, R., Erzin, A., Zalyubovskiy, V.: Convergecast with unbounded number of channels. MATEC Web Conf. 125, 03001 (2017). https://doi.org/10.1051/matecconf/20171250
de Souza, E., Nikolaidis, I.: An exploration of aggregation convergecast scheduling. Ad Hoc Netw. 11, 2391–2407 (2013)
Wan, P.-J. et al.: Minimum-latency aggregation scheduling in multihop wireless networks. In Proceedings of the ACM MOBIHOC, May 2009, pp. 185–194 (2009)
Wang, P., He, Y., Huang, L.: Near optimal scheduling of data aggregation in wireless sensor networks. Ad Hoc Netw. 11, 1287–1296 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Plotnikov, R., Erzin, A. (2021). Multi-channel Conflict-Free Square Grid Aggregation. In: Simos, D.E., Pardalos, P.M., Kotsireas, I.S. (eds) Learning and Intelligent Optimization. LION 2021. Lecture Notes in Computer Science(), vol 12931. Springer, Cham. https://doi.org/10.1007/978-3-030-92121-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-030-92121-7_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-92120-0
Online ISBN: 978-3-030-92121-7
eBook Packages: Computer ScienceComputer Science (R0)