Recently, wireless sensor networks have attracted a lot of attention. Such environments may consist of many inexpensive nodes, each capable of collecting, storing, and processing environmental information, and communicating with base station nodes through wireless links. In this paper, we survey a fundamental problem in wireless sensor networks, the energy consumption problem, which reflects how well a sensor field is deployed. Therefore, a critical aspect of applications with wireless sensor networks is network lifetime. Furthermore, one of the fundamental issues in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. We formulate this problem as a decision problem, whose goal is to determine whether every point in the service area of the sensor network is covered by at least k sensors, where k is a given parameter. In this paper, we propose an energy-efficient method based on Genetic Algorithms to deal with the deployment problem of wireless sensor networks such that it provides target-location and surveillance services.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0911106-145117 |
| Date | 11 September 2006 |
| Creators | Liu, Mao-Tsung |
| Contributors | Tzung-Pei Hong, Hsien-Liang Tsai, Chih-Hung Wu, Tsung-Chuan Huang, Shie-Jue Lee |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0911106-145117 |
| Rights | not_available, Copyright information available at source archive |
Page generated in 0.002 seconds