Algorithm for the placement of nodes for effective coverage
| Autor: | Zhao Bao-hua, QU Yugui, Lin Zhi-ting, Zhai Yu-jia |
|---|---|
| Rok vydání: | 2006 |
| Předmět: |
business.industry
Computer science Electronic Optical and Magnetic Materials Scheduling (computing) Key distribution in wireless sensor networks Activity Status Mobile wireless sensor network Redundancy (engineering) Effective method Electrical and Electronic Engineering business Wireless sensor network Coverage configuration protocol Computer network |
| Zdroj: | Frontiers of Electrical and Electronic Engineering in China. 1:297-300 |
| ISSN: | 1673-3584 1673-3460 |
| DOI: | 10.1007/s11460-006-0030-3 |
| Popis: | An effective method for extending wireless sensor network lifetime is presented for redundancy nodes. Because most of the existing coverage protocols are based on the circular sensing model, this paper discusses how to combine consideration of coverage and connectivity maintenance in a single effective scheduling when the sensing model is not circular. The least redundancy coverage strategy (LRCS) strategy takes the smallest redundant coverage as the criterion whose goal is to maximize the lifetime of the sensor network. The sensor nodes are divided into five statuses: the judgment status, the waiting status, the activity status, the dormancy status and the exhausted status. Simulations show that LRCS outperforms the coverage configuration protocol and is suitable for various situations. It effectively reduces the number of active nodes and extends the lifetime of the sensor network. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink