| Summary: | 碩士 === 淡江大學 === 資訊工程學系碩士班 === 102 === In wireless sensors, trap coverage has recently been proposed as a tradeoff between the availability of sensor nodes and sensing performance. A d-trap coverage is referred to the network where the diameter of each existing hole should be smaller than d. The d-trap offers an efficient framework to tackle the challenge of limited resources in large scale sensor networks. Currently, existing works only studied the network formation for the desired trap coverage. However, how to efficiently schedule sensor nodes between active and sleep modes to satisfy the constraint of trap coverage and prolong the network lifetime is still an open issue. This paper presents an efficient working schedule for d-trap coverage, aiming to satisfy the constraint of trap coverage and prolong the network lifetime. In simulation, the proposed algorithm outperforms the existing works in terms of the number of working sensors, reaming energy ratio, and network lifetime.
|
|---|
