Multi-Channel and Time-Slot Scheduling for Barrier Coverage in WSNs
碩士 === 國立中央大學 === 資訊工程學系 === 101 === The optimal k-barrier coverage problem (OKBCP) deals with the selection of sensor nodes in wireless sensor network(WSN). The aim is to have any intruder who goes across monitoring area of the WSN detected by k or more detecting nodes. Based on the above scenario,...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/53230971945430510284 |