ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Efficient scheduling of sensor activity for information coverage in wireless sensor networks

Vashistha, S and Azad, AP and Chockalingam, A (2007) Efficient scheduling of sensor activity for information coverage in wireless sensor networks. In: 2nd International Conference on Communication Systems Software and Middleware, JAN 07-12, 2007, Bangalore.

[img] PDF
getPD.pdf - Published Version
Restricted to Registered users only

Download (769Kb) | Request a copy
Official URL: http://ieeexplore.ieee.org/search/srchabstract.jsp...

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 recently in the literature. We also present a detailed complexity comparison between the DSIC and EGEH algorithms.

Item Type: Conference Paper
Additional Information: Copyright 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 29 Mar 2010 10:58
Last Modified: 19 Sep 2010 05:57
URI: http://eprints.iisc.ernet.in/id/eprint/26372

Actions (login required)

View Item View Item