Dynamic Sensors Assignment to Improving Lifetime Wireless Sensor Networks | ||
| Journal of AI and Data Mining | ||
| دوره 13، شماره 2، تیر 2025، صفحه 135-144 اصل مقاله (1.34 M) | ||
| نوع مقاله: Original/Review Paper | ||
| شناسه دیجیتال (DOI): 10.22044/jadm.2025.15440.2655 | ||
| نویسنده | ||
| Ali Abdi Seyedkolaei* | ||
| Department of Computer Engineering, University of Mazandaran, Babolsar, Iran. | ||
| چکیده | ||
| Deploying multiple sinks instead of a single sink is one possible solution to improve the lifetime and durability of wireless sensor networks. Using multiple sinks leads to the definition of a problem known as the sink placement problem. In this context, the goal is to determine the optimal locations and number of sink nodes in the network to maximize the network's lifetime. In this paper, we propose a dynamic sensor assignment algorithm to address the sink placement problem and evaluate its performance against existing solution methods on a diverse set of instances. We conducted experiments in two stages. In the first stage, based on random instances and compared to the exact computational method using the CPLEX solver, and in the second stage, based on real-world instances compared to MC-JMSP (Model-Based Clustering- Joint Multiple Sink Placement) method. The results obtained in the first stage of the experiments indicate the superiority of the dynamic sensor assignment algorithm in runtime for all instances. Furthermore, the solution obtained by the dynamic sensor assignment algorithm is very close to the solution obtained by the CPLEX solver. In particular, the percentage error of the solution found by the proposed method compared to CPLEX in all experimented instances is less than 0.15%, indicating the effectiveness of the proposed method in finding the appropriate solution for assigning sensors to sinks. Also, the results of the second stage experiments show the superiority of the proposed method in both execution time and energy efficiency compared to the MC-JMSP method. | ||
| کلیدواژهها | ||
| Wireless Sensor Network؛ Sink Placement؛ Dynamic Assignment | ||
| مراجع | ||
|
[1] K. Jaiswal and V. Anand, "EOMR: An energy-efficient optimal multi-path routing protocol to improve QoS in wireless sensor network for IoT applications." Wireless Personal Communications, Vol. 111, No. 4, pp. 2493-2515, 2020.
[2] L. Sitanayah, N. B. Kenneth, and J. S. Cormac, "Multiple sink and relay placement in wireless sensor networks." In Proceedings of the 1st Workshop Artificial Intelligence for Telecommunications and Sensor Networks (WAITS’12), 20th European Conference on Artificial Intelligence (ECAI’12), 2012, pp. 18-23.
[3] S. T. Chandel, and S. Sharma, "Deployment of Multiple Sink in Different Monitoring Areas Based on the Optimization Technique." International Journal of Sensors Wireless Communications and Control, Vol. 10, No. 6, pp. 915-928, 2020.
[4] A. Jari and A. Avokh, "PSO-based sink placement and load-balanced anycast routing in multi-sink WSNs considering compressive sensing theory." Engineering Applications of Artificial Intelligence, Vol. 100, p. 104164, 2021.
[5] S. Bouarourou, A.Zannou,H. Nfaoui, and A. Boulaalam, "An efficient model-based clustering via joint multiple sink placement for WSNs." Future Internet, Vol. 15, No. 2, p 75, 2023.
[6] A. Singh and A. Nagaraju, "Low latency and energy efficient routing-aware network coding-based data transmission in multi-hop and multi-sink WSN." Ad Hoc Networks, Vol. 107, p 102182, 2020.
[7] E. H. Houssein, M. R. Saad, K. Hussain, W. Zhu, H. Shaban, and M. Hassaballah, "Optimal Sink Node Placement in Large Scale Wireless Sensor Networks Based on Harris' Hawk Optimization Algorithm." IEEE Access, Vol. 8, No. 99, pp. 19381-19397, 2020.
[8] Q. Yu, C. Yang, G. Dai, L. Peng, and X. Chen. "Synchronous wireless sensor and sink placement method using dual-population co-evolutionary constrained multiobjective optimization algorithm." IEEE Transactions on Industrial Informatics, Vol. 19, No. 6, pp. 7561-7571, 2022.
[9] N. T. Hanh, P. L. Nguyen, P. T. Tuyen, H. T. Thanh Binh, E. Kurniawan, and Y. Ji. "Node placement for target coverage and network connectivity in WSNs with multiple sinks." In 2018 15th IEEE Annual Consumer Communications & Networking Conference (CCNC), pp. 1-6. IEEE, 2018.
[10] F. Al-Salti, K. Day, N. Alzeidi, and A. Touzene. "Multiple sink placement strategy for underwater wireless sensor networks." In 2018 International Symposium on Networks, Computers and Communications (ISNCC), pp. 1-6. IEEE, 2018.
[11] Y. S. Chen, S. Y. Chang, T. W. Chang, and M. J. Tsai. "Multiple sink placement with latency and reliability guarantee in lossy wireless sensor networks." In 2018 IEEE Global Communications Conference (GLOBECOM), pp. 1-7. IEEE, 2018.
[12] E. Tuba, D. Simian, E. Dolicanin, R. Jovanovic, and M. Tuba. "Energy efficient sink placement in wireless sensor networks by brain storm optimization algorithm." In 2018 14th International Wireless Communications & Mobile Computing Conference (IWCMC), pp. 718-723. IEEE, 2018.
[13] M. S. Sarwar and P. Chatterjee. Optimal Sink Placement in Wireless Sensor Networks to Increase Network Performance. Ind Interact Innov Sci Eng Technol [Internet]. Vol. 11, pp. 423-434, 2018.
[14] P. Bose and M. Gurusamy. "Bacteria foraging algorithm based optimal multi sink placement in wireless sensor networks." Journal of Intelligent Systems, Vol. 27, No. 4, pp. 609-618., 2018.
[15] CPLEX: IBM's Linear Programming Solver.
[16] A. Moradi, A. Abdi Seyedkolaei, and Seyed A. Hosseini. "Controller placement in software defined network using iterated local search." Journal of AI and Data Mining, Vol 8, No. 1, pp. 55-65, 2020.
[17] B. Kabakulak, "Sensor and sink placement, scheduling and routing algorithms for connected coverage of wireless sensor networks." Ad Hoc Networks, Vol. 86, pp. 83-102, 2019.
[18] S. Knight, H. X. Nguyen, N. Falkner, R. Bowden, and Matthew Roughan. "The internet topology zoo." IEEE Journal on Selected Areas in Communications, Vol. 29, No. 9, pp. 1765-1775, 2011.
| ||
|
آمار تعداد مشاهده مقاله: 285 تعداد دریافت فایل اصل مقاله: 251 |
||