DocumentCode :
3006292
Title :
Efficient Scheduling of Sensor Activity for Information Coverage in Wireless Sensor Networks
Author :
Vashistha, S. ; Azad, A.P. ; Chockalingam, A.
Author_Institution :
Dept. of ECE, Indian Inst. of Sci., Bangalore
fYear :
2007
fDate :
7-12 Jan. 2007
Firstpage :
1
Lastpage :
8
Abstract :
In this paper, we are concerned with algorithms for scheduling the sensing activity of sensor nodes that are deployed to sense/measure point-targets in wireless sensor networks using information coverage. Defining a set of sensors which collectively can sense a target accurately as an information cover, we propose an algorithm to obtain disjoint set of information covers (DSIC), which achieves longer network life compared to the set of covers obtained using an exhaustive-greedy-equalized heuristic (EGEH) algorithm proposed in the literature. We also present a detailed complexity comparison between the DSIC and EGEH algorithms.
Keywords :
computational complexity; greedy algorithms; scheduling; wireless sensor networks; exhaustive-greedy-equalized heuristic algorithm; information coverage; sensor activity scheduling; wireless sensor networks; Area measurement; Batteries; Collaboration; Embedded system; Remote monitoring; Scheduling algorithm; Temperature sensors; Time measurement; Wireless communication; Wireless sensor networks; Sensor activity scheduling; information coverage; network lifetime; physical coverage;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication Systems Software and Middleware, 2007. COMSWARE 2007. 2nd International Conference on
Conference_Location :
Bangalore
Print_ISBN :
1-4244-0613-7
Electronic_ISBN :
1-4244-0614-5
Type :
conf
DOI :
10.1109/COMSWA.2007.382425
Filename :
4268068
Link To Document :
بازگشت