Merged Path: Distributed Data Dissemination in Mobile Sinks Sensor Networks
DOI:
https://doi.org/10.1109/TSUSC.2024.3410247الكلمات المفتاحية:
Costs , Wireless sensor networks , Bifurcation , Routing , Periodic structures , Floods , Structural ringsالملخص
This paper studies distributed data dissemination in multiple mobile sinks wireless sensor networks. Previous studies employed separated paths to disseminate data packets from a given source to a given set of mobile sinks independently, which exhausts the constrained resources of the network. In this paper, we explore how the merged paths mechanism could rationalize utilizing network resources. To do so, we propose a protocol named Merged Path, which is implemented in four steps in a distributed manner. First, the bifurcation points (i.e., where the path is branched into multiple sub-branches) are discovered. Second, we developed a Discrete Cumulative Clustering algorithm (DCC) to divide the sinks into disjoint clusters at each bifurcation point. Third, we propose a Diagonal Virtual Line (DVL) structure to delegate the communication between the high-tier and low-tier nodes. Last, on top of DVL and DCC, we propose an opportunistic metric that captures multiple network-layer attributes to disseminate the data packet to the sinks through multiple branches. The simulation results showed that about 50% of the network energy could be saved by merging the paths versus the separate paths, considering an area of interest application with 20 mobile nodes each carrying a sink
المراجع
[1] D. Xie, X. Wu, D. Li, and J. Sun, “Multiple mobile sinks data dissemination mechanism for large scale Wireless Sensor Network,” China Communications, vol. 11, no. 13, pp. 1–8, 2014.
[2] K. Kweon, “Grid-based energy-efficient routing from multiple sources to multiple mobile sinks in wireless sensor networks,” in Proceedings of the 4th International Symposium on Wireless Pervasive Computing, 2009, pp. 1–5.
[3] G. Chen, “Energy-efficient mobile targets detection in the presence of mobile sinks,” Computer Communications, vol. 78, pp. 97–114, 2016, doi: 10.1016/j.comcom.2015.08.015.
[4] S. Sharma and S. K. Jena, “Data dissemination protocol for mobile sink in wireless sensor networks,” Journal of Computer Engineering, vol. 2014, 2014, doi: 10.1155/2014/560675.
[5] Y. XunXin, “An energy-efficient mobile sink routing algorithm for wireless sensor networks,” in Proceedings of the 7th International Conference on Wireless Communications, Networking and Mobile Computing, 2011, pp. 1–4.
[6] X. Xu, “Data quality maximization in sensor networks with a mobile sink,” in Proceedings of the International Conference on Distributed Computing in Sensor Systems Workshops, 2011, pp. 1–8.
[7] C. Tunca, S. Isik, M. Y. Donmez, and C. Ersoy, “Ring routing: An energy-efficient routing protocol for wireless sensor networks with a mobile sink,” IEEE Transactions on Mobile Computing, vol. 14, no. 9, pp. 1947–1960, Sep. 2015.
[8] H. Kuhlani, X. Wang, A. Hawbani, and O. Busaileh, “Heuristic data dissemination for mobile sink networks,” Wireless Networks, vol. 26, no. 1, pp. 479–493, 2020.
[9] A. Hawbani, “Sink-oriented tree based data dissemination protocol for mobile sinks wireless sensor networks,” Wireless Networks, vol. 24, pp. 2723–2734, 2018, doi: 10.1007/s11276-017-1497-y.
[10] P. Ciciriello, L. Mottola, and G. P. Picco, “Efficient routing from multiple sources to multiple sinks in wireless sensor networks,” in Proceedings of the European Conference on Wireless Sensor Networks, Berlin, Heidelberg, 2007, pp. 34–50.
[11] F. Hüffner, C. Komusiewicz, and M. Sorge, “Finding highly connected subgraphs,” in Proceedings of the International Conference on Current Trends in Theory and Practice of Informatics, Berlin, Heidelberg, 2015, pp. 254–265.
[12] D. R. Karger and C. Stein, “A new approach to the minimum cut problem,” Journal of the ACM, vol. 43, no. 4, pp. 601–640, 1996.
[13] C. Tunca, S. Isik, M. Y. Donmez, and C. Ersoy, “Distributed mobile sink routing for wireless sensor networks: A survey,” IEEE Communications Surveys & Tutorials, vol. 16, no. 2, pp. 877–897, 2013.
[14] E. B. Hamida and G. Chelius, “A line-based data dissemination protocol for wireless sensor networks with mobile sink,” in Proceedings of the IEEE International Conference on Communications, 2008, pp. 2201–2205.
[15] A. Agrawal, V. Singh, S. Jain, and R. K. Gupta, “GCRP: Grid-cycle routing protocol for wireless sensor network with mobile sink,” AEU - International Journal of Electronics and Communications, vol. 94, pp. 1–11, 2018.
[16] J.-H. Shin and D. Park, “A virtual infrastructure for large-scale wireless sensor networks,” Computer Communications, vol. 30, no. 14/15, pp. 2853–2866, 2007.
[17] J. Wang, J. Cao, S. Ji, and J. H. Park, “Energy-efficient cluster-based dynamic routes adjustment approach for wireless sensor networks with mobile sinks,” The Journal of Supercomputing, vol. 73, no. 7, pp. 3277–3290, 2017.
[18] A. Hawbani, X. Wang, H. Kuhlani, A. Ghannami, M. U. Farooq, and Y. Al-sharabi, “Extracting the overlapped sub-regions in wireless sensor networks,” Wireless Networks, vol. 25, no. 8, pp. 4705–4726, 2019.
[19] A. Hawbani, “GLT: Grouping based location tracking for object tracking sensor networks,” Wireless Communications and Mobile Computing, vol. 2017, 2017, doi: 10.1155/2017/4509697.
[20] P. Liu, X. Wang, A. Hawbani, O. Busaileh, L. Zhao, and A. Y. Al-Dubai, “FRCA: A novel flexible routing computing approach for wireless sensor networks,” IEEE Transactions on Mobile Computing, vol. 19, no. 1, pp. 2623–2639, Nov. 2020, doi: 10.1109/TMC.2019.2928805.
[21] F. Yan, X. Zhang, L. Tao, and H. Zhang, “Network coding-based flooding with a mobile sink in low-duty-cycle wireless sensor networks,” IEEE Transactions on Mobile Computing, vol. 18, no. 8, pp. 1857–1869, Aug. 2019.
[22] R. Deng, S. He, and J. Chen, “An online algorithm for data collection by multiple sinks in wireless-sensor networks,” IEEE Transactions on Control of Network Systems, vol. 5, no. 1, pp. 93–104, Mar. 2018.
[23] R. Duan and S. Pettie, “Linear-time approximation for maximum weight matching,” Journal of the ACM, vol. 61, no. 1, pp. 1–23, 2014.
[24] F. Tashtarian, M. H. Y. Moghaddam, K. Sohraby, and S. Effati, “On maximizing the lifetime of wireless sensor networks in event-driven applications with mobile sinks,” IEEE Transactions on Vehicle Technology, vol. 64, no. 7, pp. 3177–3189, Jul. 2015.
[25] F. Hüffner, C. Komusiewicz, A. Liebtrau, and R. Niedermeier, “Partitioning biological networks into highly connected clusters with maximum edge coverage,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 11, no. 3, pp. 455–467, 2013.
[26] O. Busaileh, A. Hawbani, W. Xingfu, P. Liu, L. Zhao, and A. Al-Dubai, “Tuft: Tree based heuristic data dissemination for mobile sink wireless sensor networks,” IEEE Transactions on Mobile Computing, vol. 21, no. 4, pp. 1520–1536, Apr. 2022.
[27] T. Camp, J. Boleng, and V. Davies, “A survey of mobility models for ad hoc network research,” Wireless Communications and Mobile Computing, vol. 2, no. 5, pp. 483–502, 2002.
[28] D. Moss and P. Levis, “Box-Macs: Exploiting physical and link layer boundaries in low-power networking,” Computer Systems Laboratory, Stanford University, vol. 64, no. 66, 2008, Art. no. 120.
[29] F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction. New York, NY, USA: Springer, 1985.
[30] Y. Gerard, F. Feschet, and D. Coeurjolly, “Gift-wrapping based preimage computation algorithm,” in Proceedings of the International Conference on Discrete Geometry for Computer Imagery, 2008, pp. 310–321, doi: 10.1007/978-3-540-79126-3_28.
[31] J. Zhao, B. Cao, X. Liu, P. Yang, A. K. Singh, and Z. Lv, “Multiobjective multiple mobile sink scheduling via evolutionary fuzzy rough neural network for wireless sensor networks,” IEEE Transactions on Fuzzy Systems, vol. 30, no. 11, pp. 4630–4641, Nov. 2022, doi: 10.1109/TFUZZ.2022.3163909.
[32] S. Jain, K. K. Pattanaik, R. K. Verma, S. Bharti, and A. Shukla, “Delay-aware green routing for mobile-sink-based wireless sensor networks,” IEEE Internet of Things Journal, vol. 8, no. 6, pp. 4882–4892, Mar. 2021, doi: 10.1109/JIOT.2020.3030120.
[33] Preeti and V. K. Jain, “Efficient sink mobility based routing protocol for heterogeneous wireless sensor network with multiple mobile sinks,” in Proceedings of the IEEE 17th India Council International Conference, New Delhi, India, 2020, pp. 1–6, doi: 10.1109/INDICON49873.2020.9342440.
[34] H. S. Kim, T. F. Abdelzaher, and W. H. Kwon, “Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks Trimmed,” in Proceedings of the 1st International Conference on Embedded Networked Sensor Systems, New York, NY, USA, 2003, pp. 193–204, doi: 10.1145/958491.958515.
[35] R. Anwit, P. K. Jana, and M. S. Obaidat, “Obstacle adaptive smooth path planning for mobile data collector in the Internet of Things,” IEEE Transactions on Sustainable Computing, vol. 8, no. 4, pp. 727–738, 2023, doi: 10.1109/TSUSC.2023.3281886.
