To make a network last beyond the lifetime of an individual sensor node, redundant nodes must be deployed. What sleep-wake-up schedule can then be used for individual nodes so that the redundancy is… (More)
This paper considers the problem of scheduling jobs with release dates on a single machine to minimize the total weighted completion time. A branch and bound algorithm is proposed which incorporates… (More)
2007 Fourth International Conference on Broadband…
2007
The problem of sleep wakeup has been extensively studied for the full coverage model, where every point in the deployment region is covered by some sensor. Since the sleep-wakeup problem is NP-Hard… (More)