Sleep/wake scheduling for multi-hop sensor networks: Non-convexity and approximation algorithm

We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronization error in the design of the sleep/wake scheduling algorithm. In our previous work, we studied sleep/wake scheduling for single hop communication, e.g., intra-cluster communication between a cluster head and cluster members. We showed that there is an inherent trade-off between energy consumption and message delivery performance (defined as the message capture probability). We proposed an optimal sleep/wake scheduling algorithm, which satisfies a given message capture probability threshold with minimum energy consumption. In this work, we consider multi-hop communication. We remove the previous assumption that the capture probability threshold is already given, and study how to decide the per-hop capture probability thresholds to meet the Quality of Services (QoS) requirements of the application. In many sen...

• Type: Journal
• Year: 2010
• Where: ADHOC
• Authors: Yan Wu, Sonia Fahmy, Ness B. Shroff
• Keywords: ADHOC 2010, Capture Probability, Capture Probability Threshold, Message Capture Probability