DocumentCode :
3284165
Title :
Optimal QoS-aware Sleep/Wake Scheduling for Time-Synchronized Sensor Networks
Author :
Wu, Yan ; Fahmy, Sonia ; Shroff, Ness B.
Author_Institution :
Center for Wireless Syst. & Applications, Purdue Univ., West Lafayette, IN
fYear :
2006
fDate :
22-24 March 2006
Firstpage :
924
Lastpage :
930
Abstract :
We study the sleep/wake scheduling problem in the context of clustered sensor networks. We conclude that the design of any sleep/wake scheduling algorithm must take into account the impact of the synchronization error. Our work includes two parts. In the first part, we show that there is an inherent tradeoff between energy consumption and message delivery performance (defined as the message capture probability in this work). We formulate an optimization problem to minimize the expected energy consumption, with the constraint that the message capture probability should be no less than a threshold. In the first part, we assume the threshold is already given. However, by investigating the unique structure of the problem, we transform the non-convex problem into a convex equivalent, and solve it using an efficient search method. In the second part, we remove the assumption that the capture probability threshold is already given, and study how to decide it to meet the quality of services (QoS) requirement of the application. We observe that in many sensor network applications, a group of sensors collaborate to perform common task(s). Therefore, the QoS is usually not decided by the performance of any individual node, but by the collective performance of all the related nodes. To achieve the collective performance with minimum energy consumption, intuitively we should provide differentiated services for the nodes and favor more important ones. We thus formulate an optimization problem, which aims to set the capture probability threshold for messages from each individual node such that the expected energy consumption is minimized, while the collective performance is guaranteed. The problem turns out to be non-convex and hard to solve exactly. Therefore, we use approximation techniques to obtain a suboptimal solution that approximates the optimum. Simulations show that our approximate solution significantly outperforms a scheme without differentiated treatment of the nodes.
Keywords :
DiffServ networks; approximation theory; message passing; probability; quality of service; scheduling; synchronisation; wireless sensor networks; approximation technique; differentiated services; energy consumption; message capture probability threshold; message delivery performance; optimal QoS-aware sleep-wake scheduling; quality-of-service; synchronization error; time-synchronized sensor network; Application software; Clocks; Energy capture; Energy consumption; Monitoring; Sensor systems and applications; Sleep; Synchronization; Upper bound; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Sciences and Systems, 2006 40th Annual Conference on
Conference_Location :
Princeton, NJ
Print_ISBN :
1-4244-0349-9
Electronic_ISBN :
1-4244-0350-2
Type :
conf
DOI :
10.1109/CISS.2006.286599
Filename :
4067940
Link To Document :
بازگشت