Location-unaware coverage in wireless sensor networks

Ossama Younis, Marwan M Krunz, Srinivasan Ramasubramanian

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

In scenarios where sensors are placed randomly, redundant deployment is essential for ensuring adequate field coverage. This redundancy needs to be efficiently exploited by periodically selecting a subset of nodes (referred to as a "cover") that actively monitor the field, and putting the remaining nodes to sleep. We consider networks in which sensors are not aware of their locations or the relative directions of their neighbors. We develop several geometric and density-based tests that enable a location-unaware sensor to intelligently determine whether it should turn itself off without degrading the quality of field coverage. These tests rely on distance measurements and exchanged two-hop neighborhood information. We design an algorithm (LUC) that exploits these tests for computing covers. Based on this algorithm, we propose two distributed protocols (LUC-I and LUC-P) that periodically select covers and switch between them so as to extend the network lifetime and tolerate unexpected failures. Our protocols are highly efficient in terms of message overhead and processing complexity. We implement LUC-I in TinyOS and evaluate it using the TOSSIM simulator. Experimental results indicate that our approach significantly prolongs the network lifetime and achieves comparable performance to location-aware protocols.

Original languageEnglish (US)
Pages (from-to)1078-1097
Number of pages20
JournalAd Hoc Networks
Volume6
Issue number7
DOIs
StatePublished - Sep 2008

Fingerprint

Wireless sensor networks
Network protocols
Sensors
Distance measurement
Redundancy
Simulators
Switches
Processing
Sleep

Keywords

  • Distributed protocols
  • Field coverage
  • Implementation
  • Location-unawareness
  • Sensor networks

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Location-unaware coverage in wireless sensor networks. / Younis, Ossama; Krunz, Marwan M; Ramasubramanian, Srinivasan.

In: Ad Hoc Networks, Vol. 6, No. 7, 09.2008, p. 1078-1097.

Research output: Contribution to journalArticle

Younis, Ossama ; Krunz, Marwan M ; Ramasubramanian, Srinivasan. / Location-unaware coverage in wireless sensor networks. In: Ad Hoc Networks. 2008 ; Vol. 6, No. 7. pp. 1078-1097.
@article{aebc96a6e5d34b24ac1d75b70aef8815,
title = "Location-unaware coverage in wireless sensor networks",
abstract = "In scenarios where sensors are placed randomly, redundant deployment is essential for ensuring adequate field coverage. This redundancy needs to be efficiently exploited by periodically selecting a subset of nodes (referred to as a {"}cover{"}) that actively monitor the field, and putting the remaining nodes to sleep. We consider networks in which sensors are not aware of their locations or the relative directions of their neighbors. We develop several geometric and density-based tests that enable a location-unaware sensor to intelligently determine whether it should turn itself off without degrading the quality of field coverage. These tests rely on distance measurements and exchanged two-hop neighborhood information. We design an algorithm (LUC) that exploits these tests for computing covers. Based on this algorithm, we propose two distributed protocols (LUC-I and LUC-P) that periodically select covers and switch between them so as to extend the network lifetime and tolerate unexpected failures. Our protocols are highly efficient in terms of message overhead and processing complexity. We implement LUC-I in TinyOS and evaluate it using the TOSSIM simulator. Experimental results indicate that our approach significantly prolongs the network lifetime and achieves comparable performance to location-aware protocols.",
keywords = "Distributed protocols, Field coverage, Implementation, Location-unawareness, Sensor networks",
author = "Ossama Younis and Krunz, {Marwan M} and Srinivasan Ramasubramanian",
year = "2008",
month = "9",
doi = "10.1016/j.adhoc.2007.10.003",
language = "English (US)",
volume = "6",
pages = "1078--1097",
journal = "Ad Hoc Networks",
issn = "1570-8705",
publisher = "Elsevier",
number = "7",

}

TY - JOUR

T1 - Location-unaware coverage in wireless sensor networks

AU - Younis, Ossama

AU - Krunz, Marwan M

AU - Ramasubramanian, Srinivasan

PY - 2008/9

Y1 - 2008/9

N2 - In scenarios where sensors are placed randomly, redundant deployment is essential for ensuring adequate field coverage. This redundancy needs to be efficiently exploited by periodically selecting a subset of nodes (referred to as a "cover") that actively monitor the field, and putting the remaining nodes to sleep. We consider networks in which sensors are not aware of their locations or the relative directions of their neighbors. We develop several geometric and density-based tests that enable a location-unaware sensor to intelligently determine whether it should turn itself off without degrading the quality of field coverage. These tests rely on distance measurements and exchanged two-hop neighborhood information. We design an algorithm (LUC) that exploits these tests for computing covers. Based on this algorithm, we propose two distributed protocols (LUC-I and LUC-P) that periodically select covers and switch between them so as to extend the network lifetime and tolerate unexpected failures. Our protocols are highly efficient in terms of message overhead and processing complexity. We implement LUC-I in TinyOS and evaluate it using the TOSSIM simulator. Experimental results indicate that our approach significantly prolongs the network lifetime and achieves comparable performance to location-aware protocols.

AB - In scenarios where sensors are placed randomly, redundant deployment is essential for ensuring adequate field coverage. This redundancy needs to be efficiently exploited by periodically selecting a subset of nodes (referred to as a "cover") that actively monitor the field, and putting the remaining nodes to sleep. We consider networks in which sensors are not aware of their locations or the relative directions of their neighbors. We develop several geometric and density-based tests that enable a location-unaware sensor to intelligently determine whether it should turn itself off without degrading the quality of field coverage. These tests rely on distance measurements and exchanged two-hop neighborhood information. We design an algorithm (LUC) that exploits these tests for computing covers. Based on this algorithm, we propose two distributed protocols (LUC-I and LUC-P) that periodically select covers and switch between them so as to extend the network lifetime and tolerate unexpected failures. Our protocols are highly efficient in terms of message overhead and processing complexity. We implement LUC-I in TinyOS and evaluate it using the TOSSIM simulator. Experimental results indicate that our approach significantly prolongs the network lifetime and achieves comparable performance to location-aware protocols.

KW - Distributed protocols

KW - Field coverage

KW - Implementation

KW - Location-unawareness

KW - Sensor networks

UR - http://www.scopus.com/inward/record.url?scp=46449093149&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=46449093149&partnerID=8YFLogxK

U2 - 10.1016/j.adhoc.2007.10.003

DO - 10.1016/j.adhoc.2007.10.003

M3 - Article

AN - SCOPUS:46449093149

VL - 6

SP - 1078

EP - 1097

JO - Ad Hoc Networks

JF - Ad Hoc Networks

SN - 1570-8705

IS - 7

ER -