Node Placement in a Wireless Sensor Networks with Genetic Algorithm

Please enable javascript in your browser.

Hosseiny Khamseh Motlagh, Atena | 2008

569 Viewed

Type of Document: M.Sc. Thesis
Language: English
Document No: 39279 (52)
University: Sharif University of Technology, International Campus, Kish Island
Department: Science and Engineering
Advisor(s): Seifipour, Navid
Abstract:
Coverage rate is a critical criterion in all of communication networks. In this regard, there are many different methods for distribution of network particles duo to attain the most efficient region of coverage. This emerges from the limited ability of each networks particle both in range of communicate and power consumption. In this thesis an evolutionary method is introduced to how Wireless Sensor Networks (WSN) particles can be dispensed to have more reliable coverage rate. Using both static and mobile sensor packages to cover the desired area and used a cost function, coverage rate, the authors tried to maximize it to have an excellent performance of network. Then proposed algorithm is compared with "Bidding Protocol" and "Coven’s Algorithm", two of important methods in this field and it will be shown that our algorithm has a superb performance against them. Simulation of the algorithm has been done in three statuses, using static sensors only, with constant number of mobile sensor and also with change in the number of mobile sensors
Keywords:
Coverage ; Wireless Sensor Network ; Genetic Algorithm ; Static Node ; Moveable Sensor ; Coven Algorithm

No TOC