Files
Overview Search Downloads Up
Download details
ENERGY EFFICIENT COVERAGE AND CONNECTIVITY PROBLEM IN WIRELESS SENSOR NETWORKS

Abstract

The development of distributed networks that are capable of sensing, computation, and wireless communication has emerged from recent advances in processor, memory and radio technology. Today wireless sensor networks (WSN) have a wide variety of applications such as battlefield surveillance, biological detection, home security and inventory tracking. Conserving the energy resource and prolonging the system lifetime with a good coverage of the points of interests is important in these applications. This paper studies the energy efficient coverage and connectivity problem in wireless sensor networks. We try to locate different type of sensors (heterogeneous) 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 (channel) 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.

 

Keywords: Wireless sensor networks, Energy efficiency, Network cost, Connectivity, Coverage, Location, Network routing, Genetic algorithm, Multiobjective optimization.




Data

Size 740.98 KB
Downloads 1555
Language English
License
Author
Website
Price
Created 2011-10-21 10:12:58
Created by admin
Changed at 2012-12-21 18:42:28
Modified by admin

Download

Copyright © 2014 mustafa gokce baydogan

LinkedIn
Twitter
last.fm