In this thesis, we study the energy efficient coverage and connectivity problem in wireless sensor networks (WSNs). We try to locate heterogeneous sensors and route data generated to a base station under two conflicting objectives: minimization of network cost and maximization of network lifetime. We aim at satisfying connectivity and coverage requirements as well as sensor node and link capacity constraints. We propose mathematical formulations and use an exact solution approach to find Pareto optimal solutions for the problem. We also develop a multiobjective genetic algorithm to approximate the efficient frontier, as the exact solution approach requires long computation times. We experiment with our genetic algorithm on randomly generated problems to test how well the heuristic procedure approximates the efficient frontier. Our results show that our genetic algorithm approximates the efficient frontier well in reasonable computation times.
| Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12609688/index.pdf |
| Date | 01 July 2008 |
| Creators | Baydogan, Mustafa Gokce |
| Contributors | Ozdemirel, Nur Evin |
| Publisher | METU |
| Source Sets | Middle East Technical Univ. |
| Language | English |
| Detected Language | English |
| Type | M.S. Thesis |
| Format | text/pdf |
| Rights | To liberate the content for public access |
Page generated in 0.0023 seconds