Vashistha, S. ; Azad, A. P. ; Chockalingam, A. (2007) Efficient scheduling of sensor activity for information coverage in wireless sensor networks In: 2007 2nd International Conference on Communication Systems Software and Middleware, 7-12 January 2007, Bangalore, India.
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/document/4268068/
Related URL: http://dx.doi.org/10.1109/COMSWA.2007.382425
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| Keywords: | Network Lifetime; Sensor Activity Scheduling; Physical Coverage; Information Coverage |
| ID Code: | 102386 |
| Deposited On: | 22 Mar 2017 09:04 |
| Last Modified: | 22 Mar 2017 09:04 |
Repository Staff Only: item control page
