Coverage Optimization mechanism in Wireless Sensor Networks using Learning Automata and Greedy Algorithm
سال انتشار: 1399
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 503
فایل این مقاله در 9 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
DCBDP06_072
تاریخ نمایه سازی: 25 اسفند 1399
چکیده مقاله:
In wireless sensor networks (WSNs), the network coverage is one of the basic challenges and also it is one of the most important quality of service parameters. In most applications, sensor nodes are randomly deployed in the environment which causes the density of nodes become high in some areas and low in some other. In this case, some areas are not covered by none of sensor nodes which these areas are called coverage holes. Also, creating areas with high density leads to redundant overlapping and as a result the amount of energy consumption in the network increases and the network lifetimedecreases. In this paper, we proposed a new method for the coverage problem of WSNs using learning automata and greedy algorithm.The proposed scheme reduces energy consumption and increases the network lifetime by identifying and disabling the redundant nodes.The simulation results in MATLAB software show that the proposed method improves network performance metrics in term of the network coverage and the energy consumption of sensor nodes.
کلیدواژه ها:
نویسندگان
Seyyed Keyvan Mousavi
Department of computer engineering, Tabriz branch, Islamic azad university, Tabriz, Iran.
Ali Ghaffari
Department of computer engineering, Tabriz branch, Islamic azad university, Tabriz, Iran