A New Algorithm for Sensor Placement in Wireless Sensor Networks Using Simulated Annealing
Publish place: 2nd Lahijan National Conference on Software Engeering
Publish Year: 1391
نوع سند: مقاله کنفرانسی
زبان: English
View: 1,728
This Paper With 5 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
LNCSE02_204
تاریخ نمایه سازی: 6 اسفند 1391
Abstract:
The sensor networks contain many sensors and each sensor has a limited and un-replaceable battery. As each node has a number of different duties, a node's wrong performance leads to energy wasteand its omission from the network structure. In this paper, thanks to sensors placement due to the increase of network lifetime, avigorous algorithm is introduced that is able to cover all areas of network with the lowest cost. This suggested algorithm runs basedon simulated annealing and it can work on networks in which sensors are organized randomly. Since this algorithm analysessensors' status regularly it can be taken as a dynamic algorithm. The simulation results indicate that our proposed algorithm canorganize the best areas of networks with numerous sensors by the lowest possible cost, and it significantly enhances the network's lifetime. It also guarantees that during execution procedure, all network areas are covered by the selected sensors
Keywords:
Authors
Meisam Mapar
Sama technical and vocational training college, Islamic Azad University
Mohsen Heidar Azad Zadeh
ICT Department, SPGC, NIGC
Nilufar Bayati Chaleshtory
Sama technical and vocational training college, Islamic Azad University, Ahwaz
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :