Proposing a Algorithm for Optimizing Energy Consumption
سال انتشار: 1402
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 53
فایل این مقاله در 12 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJSET-1-1_003
تاریخ نمایه سازی: 23 خرداد 1403
چکیده مقاله:
The purpose of this paper is to use the social spider algorithm to improve energy consumption in wireless sensor networks. In this regard, finding a suitable place for routers was done with a social spider algorithm in the system by selecting and optimally placing elements in the network and revising the Objective function. To use it, the initial number was ۱۲, and the maximum number of loop iterations in the algorithm was ۱۰۰ replications. We achieved these values with several runs and errors. Besides, to achieve the best results, to solve the problem, they can be considered as the default algorithm. In this research, the MATLAB implementation language was used to implement the spider algorithm, and then NS ۲.۳۵ tool was used to simulate the network environment and use the algorithm. In this study, three standard gate placement algorithms were used for comparisons, including BRP, RDP, and RGP. The results showed that the proposed method could have the lowest energy consumption. It can cause fair and uniform energy consumption between all nodes. It will also increase the lifetime of the network. Optimization of routing algorithms for such networks by using the spider algorithm also reduced the number of errors (failures) in the system and increased the life of the network with the help of the mentioned method. The proposed method, compared to the techniques presented before this study, is acceptable and, while creating the desired capabilities in terms of security, does not impose much time overhead on the systemThe purpose of this paper is to use the social spider algorithm to improve energy consumption in wireless sensor networks. In this regard, finding a suitable place for routers was done with a social spider algorithm in the system by selecting and optimally placing elements in the network and revising the Objective function. To use it, the initial number was ۱۲, and the maximum number of loop iterations in the algorithm was ۱۰۰ replications. We achieved these values with several runs and errors. Besides, to achieve the best results, to solve the problem, they can be considered as the default algorithm. In this research, the MATLAB implementation language was used to implement the spider algorithm, and then NS ۲.۳۵ tool was used to simulate the network environment and use the algorithm. In this study, three standard gate placement algorithms were used for comparisons, including BRP, RDP, and RGP. The results showed that the proposed method could have the lowest energy consumption. It can cause fair and uniform energy consumption between all nodes. It will also increase the lifetime of the network. Optimization of routing algorithms for such networks by using the spider algorithm also reduced the number of errors (failures) in the system and increased the life of the network with the help of the mentioned method. The proposed method, compared to the techniques presented before this study, is acceptable and, while creating the desired capabilities in terms of security, does not impose much time overhead on the system
کلیدواژه ها:
نویسندگان
Amir Hossein Derakhshanfard
۱.Department of Mechanic, Hamedan Branch, Islamic Azad University, Hamedan, Iran
مراجع و منابع این مقاله:
لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :