Energy-Efficient Movements for Enhancing Barrier Coverage in Mobile WSNs
碩士 === 淡江大學 === 資訊工程學系碩士在職專班 === 98 === The k-barrier coverage problem is known as the problem of detecting the intruders by at least k sensors when the intruder moves along the crossing paths from one boundary to another. This paper considers a mobile WSN with demand of k-barrier coverage. To incre...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/98202761731686551489 |
| Summary: | 碩士 === 淡江大學 === 資訊工程學系碩士在職專班 === 98 === The k-barrier coverage problem is known as the problem of detecting the intruders by at least k sensors when the intruder moves along the crossing paths from one boundary to another. This paper considers a mobile WSN with demand of k-barrier coverage. To increase the monitoring quality and reduces and balances the energy consumption for each mobile sensor, this paper designs a distributed algorithm aiming at moving fewer mobile sensors with shorter distance for increasing the monitoring quality from (k-1)-barrier coverage to k-barrier coverage. Performance study reveals that the proposed algorithm can efficiently improve the monitoring quality and extend the network lifetime.
|
|---|