Optimize routing and reduce latency when sending information among Internet of Things (IoT) nodes
سال انتشار: 1403
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 61
فایل این مقاله در 11 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJNAA-15-11_018
تاریخ نمایه سازی: 17 تیر 1403
چکیده مقاله:
The existing nodes of IoT networks are very small in size, deployed for long periods, and have very limited resources, which means that an IoT network must be very energy efficient to survive for a long time. Therefore, finding optimal routing techniques that lead to better data sharing without wasting energy can lead to more energy savings. This is an optimization problem, which means that we need to use optimization algorithms to find the optimal path in an IoT network. Some of the optimization algorithms are called meta-heuristic algorithms, these algorithms are inspired by nature, such as Artificial Neural Networks (ANN), which are Gradient methods to find the most suitable solution for a given problem. Our next algorithm is Particle Swarm Optimization (PSO). If the search combination of both algorithms is used in parallel, the search power will increase and better answers will be found in less time. For this reason, we suggest using a combination of the above algorithms. This idea is a combination of two optimization algorithms, PSO (Particle Swarm Optimization) and ANN (Neural Network) to optimize routing and reduce latency when sending information between IoT nodes in an IoT system. The proposed protocol is focused on optimizing energy consumption and execution time with the help of the GA-PSO algorithm based on routing-based clustering. Finally, to evaluate the proposed protocol, it was simulated using C++ software and compared with the method presented in the reference article based on the enhanced Ant Colony Algorithm, and the results show the efficiency of the proposed method in terms of energy consumption and execution time. The results show that in the presented algorithm, the execution time has been reduced to almost a quarter of the execution time in the algorithm of the reference article. Also, the results showed that our proposed method consumed ۲۰ kJ less energy.
کلیدواژه ها:
نویسندگان
Shahram Khoshnavaz
Department of Computer Engineering, Faculty of Technology and Engineering, Lorestan, Iran
Mostafa Abbasi Kia
Department of Computer Science, University of Lorestan, Khorramabad, Lorestan, Iran
مراجع و منابع این مقاله:
لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :