تعیین بهینه گره‌های همکار در شبکه‌های بی‌سیم چند گامی بر اساس نظریه بازی‌ها

رشیدجعفری, فهیمه; درخشان فرد, ناهید; شاهرخ‌زاده, بهروز; غفاری, علی

تعیین بهینه گره‌های همکار در شبکه‌های بی‌سیم چند گامی بر اساس نظریه بازی‌ها

نوع مقاله : مقاله پژوهشی

نویسندگان

فهیمه رشیدجعفری ¹

ناهید درخشان فرد ²

بهروز شاهرخ‌زاده ³

علی غفاری ⁴

¹ دانشجوی دکتری، گروه کامپیوتر و فناوری اطلاعات، دانشکده برق، کامپیوتر و مهندسی پزشکی، دانشگاه آزاد اسلامی، واحد قزوین، قزوین ، ایران

² استادیار،مهندسی کامپیوتر، دانشکده مهندسی، دانشگاه آزاد اسلامی، تبریز، ایران

³ استادیار، گروه کامپیوتر و فناوری اطلاعات، واحد قزوین، دانشگاه آزاد اسلامی ، قزوین، ایران

⁴ دانشیار،گروه مهندسی کامپیوتر، واحد تبریز، دانشگاه آزاد اسلامی، تبریز، ایران

چکیده

شبکه‌های بی‌سیم چند گامی شبکه‌هایی هستند که ارتباطات در آن‌ها دائمی نبوده و تحویل بسته‌ها به‌صورت گام‌به‌گام از طریق مجموعه‌ای از گره‌های بازپخش انجام می‌شود. یکی از چالش‌های اصلی این شبکه‌ها، مسیریابی و اطمینان از همکاری میان گره‌های بازپخش در فواصل طولانی با برد انتقال کوتاه است. روش‌های قبلی برای حل مشکلات مسیریابی از گره‌های همکار استفاده کرده‌اند. بیشتر این روش‌ها گره‌های همکار را یا به‌صورت گروهی برای کل شبکه در نظر می‌گیرند یا برای هر مبدأ بر اساس ویژگی‌های خاص آن، مانند همسایگی گره‌ها یا تاریخچه حرکتی و غیره تعیین می‌کردند. بااین‌وجود، به دلیل ماهیت پویای شبکه‌های بی‌سیم چند گامی و ارتباطات متناوب، مشکلاتی نظیر تأخیر زیاد و نسبت تحویل پایین بسته‌ها همچنان باقی‌مانده است که کارایی شبکه را کاهش می‌دهد. در این مقاله، روشی پیشنهاد می‌شود که در آن گروهی از گره‌ها به‌عنوان گره‌های همکار نسبت به یک گره مقصد خاص انتخاب می‌شوند. درروش پیشنهادی، برای تعیین گره‌های همکار هر گره مقصد، از الگوریتم ژنتیک استفاده می‌شود. در گام اول، از بازی چانه‌زنی برای تولید جمعیت اولیه بهره گرفته می‌شود. سپس، گروهی از گره‌ها به‌عنوان گره‌های همکار با استفاده از الگوریتم ژنتیک تعیین می‌شوند و مسیریابی بر اساس این گره‌ها انجام می‌گیرد. نتایج شبیه‌سازی و مقایسه با روش‌های قبلی نشان می‌دهد که روش پیشنهادی با کاهش میانگین تأخیر در حدود 15% ، افزایش نسبت تحویل بسته‌ها حدود 16% و کاهش سربار شبکه در حدود 12% عملکرد بهتری دارد.

کلیدواژه‌ها

نظریه بازی‌ها

الگوریتم ژنتیک

شبکه‌های بی‌سیم چند گامی

گره بازپخش

گره همکار

20.1001.1.23224347.1404.13.3.5.4

موضوعات

مباحث دکترین، راهبردها و آینده پژوهی حوزه های مرتبط

عنوان مقاله English

Optimal Determination of Cooperative Nodes in Multi-hop Wireless Networks Based on Game Theory

نویسندگان English

Fahimeh Rashid Jafari ¹

Nahideh Derakhshanfard ²

Behrooz Shahrokhzadeh ³

Ali Ghaffari ⁴

¹ PhD student Department of Computer and Information Technology, Faculty of Electrical, Computer and Medical Engineering, Islamic Azad University, Qazvin Branch, Qazvin, Iran

² Assistant Professor, Computer Engineering, Faculty of Engineering, Islamic Azad University, Tabriz, Iran

³ Assistant Professor, Department of Computer and Information Technology, Qazvin Branch, Islamic Azad University, Qazvin, Iran

⁴ Associate Professor, Department of Computer Engineering, Tabriz Branch, Islamic Azad University, Tabriz, Iran

چکیده English

Wireless multi-hop networks are networks in which communications are not constant, and packets delivery occurs hop-by-hop through a group of relay nodes. One of the primary challenges in these networks is routing and ensuring cooperation among relay nodes over long distances with short transmission range. Previous methods have tackled routing issues by utilizing cooperative nodes. Most of these methods consider cooperative nodes either as a group for the entire network or determine them for each source node based on specific characteristics, Such as node neighborhood or movement history, etc. However, due to the dynamic nature of wireless multi-hop networks and intermittent communications, issues such as high delay and low packet delivery ratio remain, which reduce network performance. This paper proposes a method in which a group of nodes is selected as cooperative nodes relative to a specific destination node. In the proposed method, a genetic algorithm is used to determine the cooperative nodes for each destination node. In the first step, a bargaining game is employed to generate the initial population. Then, a group of nodes is selected as cooperative nodes using the genetic algorithm, and routing is performed based on these nodes. Simulation results and comparison with previous methods indicate that the proposed method improves performance by reducing average delay by approximately 15%, increasing the packet delivery ratio by around 16%, and reducing network overhead by about 12%.

کلیدواژه‌ها English

game theory genetic algorithm multi

hop wireless networks relay node cooperative node

[1] G. Khanna and S. K. Chaturvedi, "A Comprehensive Survey on Multi-hop Wireless Networks: Milestones, Changing Trends and Concomitant Challenges," WIRELESS PERS COMMUN, vol. 101, no. 2, pp. 677-722, 2018. https://doi.org/10.1007/s11277-018-5711-8

[2] G. U. Rehman, M. I. U. Haq, M. Zubair, Z. Mahmood, M. Singh and D. Singh, "Misbehavior of nodes in IoT based vehicular delay tolerant networks VDTNs," MULTIMED TOOLS APPL, vol. 82, no. 5, pp. 7841-7859, 2023. DOI :10.1007/s11042-022-13624-2

[3] A. Bhardwaj and H. El-Ocla, "Multipath routing protocol using genetic algorithm in mobile ad hoc networks," IEEE Access, vol. 8, pp. 177534-177548, 2020. DOI: 10.1109/ACCESS.2020.3027043

[4] N. Subramani, P. Mohan, Y. Alotaibi, S. Alghamdi and O. I. Khalaf, "An efficient metaheuristic-based clustering with routing protocol for underwater wireless sensor networks," Sensors, vol. 22, no. 2, p. 415, 2022. https://doi.org/10.3390/s22020415

[5] R. A. Khan, Q. Xin and N. Roshan, "RK-energy efficient routing protocol for wireless body area sensor networks," WIRELESS PERS COMMUN, vol. 116, no. 1, pp. 709-721, 2021. https://doi.org/10.1007/s11277-020-07734-z

[6] S. Nobahary, H. Gharaee Garakani and A. Khademzadeh, "Detecting Noncooperation Nodes Mechanisms in Wireless Networks: A Survey," SECUR COMMUN NETW, 2022. https://doi.org/10.1155/2022/6486816

[7] S. Sharma, Y. Shi, Y. T. Hou, H. D. Sherali and S. Kompella, "Cooperative communications in multi-hop wireless networks: Joint flow routing and relay node assignment," in 2010 Proceedings IEEE INFOCOM, San Diego, 2010. DOI: 10.1109/INFCOM.2010.5462024

[8] A. Unnikrishnan and V. Das, "Cooperative routing for improving the lifetime of wireless ad-hoc networks," (IJASIS), vol. 8, no. 1, pp. 17-24, Jun 2022. https://doi.org/10.29284/ijasis.8.1.2022.17-24

[9] T. Wang, G. Zhang, X. Yang and A. Vajdi, "Genetic algorithm for energy-efficient clustering and routing in wireless sensor networks," J SYST SOFTWARE, vol. 146, pp. 196-214, 2018. https://doi.org/10.1016/j.jss.2018.09.067

[10] N. Samian, Z. A. Zukarnain, W. K. Seah, A. Abdullah and Z. M. Hanapi, "Cooperation stimulation mechanisms for wireless multihop networks: A survey," J NETW COMPUT APPL, vol. 54, pp. 88-106, 2015. https://doi.org/10.1016/j.jnca.2015.04.012

[11] A. Shan, X. Fan, X. Chen, Y. Ji and C. Wu, "A Reinforcement Learning Based Incentive Scheme for Multi-Hop Communications in Vehicular Networks," IEEE T Cogn Commun Netw, vol. 10, no. 1, pp. 335-347, 18 September 2023. DOI: 10.1109/TCCN.2023.3316644

[12] S. Nobahary, H. G. Garakani, A. Khademzadeh and A. M. Rahmani, "Selfish node detection based on hierarchical game theory in IoT," EURASIP J WIREL COMM, vol. 2019, pp. 1-19, 2019. https://doi.org/10.1186/s13638-019-1564-4

[13] S. Al-Otaibi, A. Al-Rasheed, R. F. Mansour, E. Yang, G. P. Joshi and W. Cho, "Hybridization of metaheuristic algorithm for dynamic cluster-based routing protocol in wireless sensor Networksx," IEEE Access, vol. 9, pp. 83751 - 83761, 2021. DOI: 10.1109/ACCESS.2021.3087602

[14] A. B. Gavali, V. M. Vaze and S. A. Ubale, "HOCOR: Hybrid Optimization-Based Cooperative Opportunistic Routing for Underwater Wireless Sensor Networks," WIRELESS PERS COMMUN, vol. 135, no. 3, pp. 1449-1472, 2024. https://doi.org/10.1007/s11277-024-11106-2

[15] P. Mohan, N. Subramani, Y. Alotaibi, S. Alghamdi, O. I. Khalaf and S. Ulaganathan, "Improved metaheuristics-based clustering with multihop routing protocol for underwater wireless sensor networks," Sensors, vol. 22, no. 4, p. 1618, 2022. https://doi.org/10.3390/s22041618

[16] T. Aouam, M. Oudani and M. Ghogho, "Efficient Meta-Heuristic Approach for the Multi-Objective Green p-Hub Centre Routing Problem," IEEE T EVOLUT COMPUT, 06 June 2024. DOI: 10.1109/TEVC.2024.3410517

[17] R. Ganesan, "Meta-Heuristic Solution for Route Optimization in Underwater Wireless Sensor Networks for Marine Applications: GREY-WOLF OPTIMIZATION FOR UWSN PATH FINDING," J. SCI. IND. RES. (JSIR), vol. 83, no. 4, pp. 405-413, 2024. https://doi.org/10.56042/jsir.v83i4.2936

[18] N. Subramani, S. K. Perumal, J. S. Kallimani, S. Ulaganathan, S. Bhargava and S. Meckanizi, "Controlling energy aware clustering and multihop routing protocol for IoT assisted wireless sensor networks," CONCURR COMP-PRACT E, vol. 34, no. 21, p. e7106, 2022. https://doi.org/10.1002/cpe.7106

[19] B. M. Mohammed, M. Alsaadi, M. Khalaf and A. S. Awad, "Game Theory-Based Multi-Hop Routing Protocol with Metaheuristic Optimization-Based Clustering Process in WSN for Precision Agriculture," Journal Européen des Systèmes Automatisés (JESA), vol. 57, no. 3, 2024. DOI: 10.18280/jesa.570302

[20] H. Gunigari and S. Chitra, "Energy Efficient Networks Using Ant Colony Optimization with Game Theory Clustering," INTELL AUTOM SOFT CO, vol. 35, no. 3, 2023. DOI:10.32604/iasc.2023.029155

[21] M. Gupta, N. Singh Aulakh and I. Kaur Aulakh, "A game theory‐based clustering and multi‐hop routing scheme in wireless sensor networks for energy minimization," INT J COMMUN SYST, vol. 35, no. 10, p. e5176, 2022. https://doi.org/10.1002/dac.5176

[22] B. Karimzadeh and N. Deraxshanfard, "Routing and Buffer Management Based on Game Theory in Delay Tolerant Networks," Electronic and Cyber Defense, vol. 11, no. 4, pp. 35-43, 2024. In Persian. DOR:https://dor.isc.ac/dor/20.1001.1.23224347.1402.11.4.3.0

[23] M. Azizi and A. Naseri, "A Routing Method In IoT Networks Based On Fuzzy Logic And Clustering For Intelligent Transportation," Scientific Journal of Electronic & Cyber Defense, vol. 11, no. 4, 2024. In Persian. https://dorl.net/dor/20.1001.1.23224347.1402.11.4.11.8

[24] A. Sarabadani, S. M. Pournaghi and K. Rahsepar, "discovery of communities in social networks of a dynamic layer with the approach of maximizing the importance," Electronic and Cyber Defense, vol. 12, pp. 43-57, 2024.( In Persian )DOR:https://dorl.net/dor/20.1001.1.23224347.1403.12.1.5.3

[25] M. Mir, M. Yaghoobi and M. Kheirabadi, "Energy Aware Routing in the Internet of Things using improved Grasshopper Metaheuristic Algorithm," Electronic and Cyber Defense, vol. 11, no. 1, pp. 15-29, 2023. In Persian. DOR: https://dor.isc.ac/dor/20.1001.1.23224347.1402.11.1.2.3

[26] S. Z. Majidian and M. Shirmohammadi, "Clustering and Routing in Wireless Sensor Networks Using Multi-Objective Cuckoo Search and Game Theory," Electronic and Cyber Defense, vol. 10, no. 3, pp. 11-20, 2022. In Persian.)DOR:https://dor.isc.ac/dor/20.1001.1.23224347.1401.10.3.2.0

[27] Z. Zhang, J. Shi, H.-H. Chen, M. Guizani and P. Qiu, "A cooperation strategy based on Nash bargaining solution in cooperative relay networks," IEEE T VEH TECHNOL, vol. 57, no. 4, pp. 2570 - 2577, 2008. DOI: 10.1109/TVT.2007.912960

[28] M. Vaezi and M. J. Jamali, "A Novel Routing Protocol based on the Quality of Service in Wireless Sensor Networks with Hierarchical Analysis," Tabriz Journal of Electrical Eng, vol. 16, pp. 355-367, 2016.( in persian.)

[29] A. Abbasi and N. Derakhshanfard, "Determination of relay node based on fuzzy logic in delay tolerant network," WIRELESS PERS COMMUN, vol. 104, pp. 1023-1036, 2019. https://doi.org/10.1007/s11277-018-6065-y

[30] L. Xue, J. Liu and J. Peng, "An adaptive message ferry routing algorithm for delay tolerant networks," in 2012 IEEE 14th International Conference on Communication Technology, Chengdu, China, 2012. https:// doi.org/10.1109/ICCT.2012.6511295