DocumentCode :
1939148
Title :
Multiple task scheduling for low-duty-cycled wireless sensor networks
Author :
Xiong, Shuguang ; Li, Jianzhong ; Li, Mo ; Wang, Jiliang ; Liu, Yunhao
Author_Institution :
Schoole of Comput. Sci. & Technol., Harbin Inst. of Technol., Harbin, China
fYear :
2011
fDate :
10-15 April 2011
Firstpage :
1323
Lastpage :
1331
Abstract :
For energy conservation, a wireless sensor network is usually designed to work in a low-duty-cycle mode, in which a sensor node keeps active for a small percentage of time during its working period. In applications where there are multiple data delivery tasks with high data rates and time constraints, low-duty-cycle working mode may cause severe transmission congestion and data loss. In order to alleviate congestion and reduce data loss, the tasks need to be carefully scheduled to balance the workloads among the sensor nodes in both spatial and temporal dimensions. This paper studies the load balancing problem, and proves it is NP-Complete in general network graphs. Two efficient scheduling algorithms to achieve load balance are proposed and analyzed. Furthermore, a task scheduling protocol is designed relying on the proposed algorithms. To the best of our knowledge, this paper is the first one to tackle multiple task scheduling for low-duty-cycled sensor networks. The simulation results show that the proposed algorithms greatly improve the network performance in most scenarios.
Keywords :
energy conservation; graph theory; optimisation; protocols; resource allocation; scheduling; wireless sensor networks; NP-complete; energy conservation; low-duty-cycle mode; network graphs; scheduling algorithms; task scheduling protocol; transmission congestion; wireless sensor networks; workload balancing; Algorithm design and analysis; Delay; Optimal scheduling; Schedules; Scheduling; Time factors; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
INFOCOM, 2011 Proceedings IEEE
Conference_Location :
Shanghai
ISSN :
0743-166X
Print_ISBN :
978-1-4244-9919-9
Type :
conf
DOI :
10.1109/INFCOM.2011.5934916
Filename :
5934916
Link To Document :
بازگشت