NDLI: Lifetime and coverage guarantees through distributed coordinate-free sensor activation

Please wait, while we are loading the content...

Dynamic spectrum access in DTV whitespaces: design rules, architecture and algorithms

SAM: enabling practical spatial multiple access in wireless LAN

Capacity of large-scale CSMA wireless networks

Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links

Neighbor discovery in wireless networks and the coupon collector's problem

A scalable micro wireless interconnect structure for CMPs

SurroundSense: mobile phone localization via ambience fingerprinting

OpenLIDS: a lightweight intrusion detection system for wireless mesh networks

Mining spectrum usage data: a large-scale spectrum measurement study

Order matters: transmission reordering in wireless networks

Scheduling partition for order optimal capacity in large-scale wireless networks

Compressive data gathering for large-scale wireless sensor networks

Frequency-aware rate adaptation and MAC protocols

Glia: a practical solution for effective high datarate wifi-arrays

Fine-grained I/O access control of the mobile devices based on the Xen architecture

On the effectiveness of secret key extraction from wireless signal strength in real environments

A quorum-based framework for establishing control channels in dynamic spectrum access networks

Design, implementation and evaluation of an efficient opportunistic retransmission protocol

Mobility increases the connectivity of K-hop clustered wireless networks

Data fusion improves the coverage of wireless sensor networks

Optimal beam scheduling for multicasting in wireless networks

Link layer behavior of body area networks at 2.4 GHz

A fundamental scalability criterion for data aggregation in VANETs

Localization with snap-inducing shaped residuals (SISR): coping with errors in measurement

Throughput-efficient sequential channel sensing and probing in cognitive radio networks under sensing errors

Esense: communication through energy sensing

Lifetime and coverage guarantees through distributed coordinate-free sensor activation

Challenge: ultra-low-power energy-harvesting active networked tags (EnHANTs)

CENTAUR: realizing the full potential of centralized wlans through a hybrid data path

Hiding stars with fireworks: location privacy through camouflage

Lifetime and coverage guarantees through distributed coordinate-free sensor activation

Content Provider	ACM Digital Library
Author	Kasbekar, Gaurav S. Bejerano, Yigal Sarkar, Saswati
Abstract	Wireless Sensor Networks are emerging as a key sensing technology, with diverse military and civilian applications. In these networks, a large number of sensors perform distributed sensing of a target field. Each sensor is a small battery-operated device that can sense events of interest in its sensing range and can communicate with neighboring sensors. A sensor cover is a subset of the set of all sensors such that every point in the target field is in the interior of the sensing ranges of at least \$k\$ different sensors in the subset, where k is a given positive integer. The lifetime of the network is the time from the point the network starts operation until the set of all sensors with non-zero remaining energy does not constitute a sensor cover. An important goal in sensor networks is to design a schedule, that is, a sequence of sensor covers to activate in every time slot, so as to maximize the lifetime of the network. In this paper, we design a polynomial-time, distributed algorithm for maximizing the lifetime of the network and prove that its lifetime is at most a factor O(log n * log nB) lower than the maximum possible lifetime, where n is the number of sensors and B is an upper bound on the initial energy of each sensor. Our algorithm does not require knowledge of the locations of nodes or directional information, which is difficult to obtain in sensor networks. Each sensor only needs to know the distances between adjacent nodes in its transmission range and their sensing radii. In every slot, the algorithm first assigns a weight to each node that is exponential in the fraction of its initial energy that has been used up so far. Then, in a distributed manner, it finds a O(log n) approximate minimum weight sensor cover which it activates in the slot. Our simulations reveal that our algorithm substantially outperforms several existing lifetime maximization algorithms.
Starting Page	169
Ending Page	180
Page Count	12
File Format	PDF
ISBN	9781605587028
DOI	10.1145/1614320.1614339
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2009-09-20
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Wireless sensor networks Network lifetime Approximation algorithms Coordinate-free Coverage Distributed algorithms
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Lifetime and coverage guarantees through distributed coordinate-free sensor activation

Lifetime and Coverage Guarantees Through Distributed Coordinate-Free Sensor Activation

Lifetime and coverage guarantees through distributed coordinate-free sensor activation.

1 lifetime and coverage guarantees through distributed coordinate-free sensor activation.

Adaptive and distributed sensor activation in WSN

Maximizing Barrier Coverage Lifetime with Mobile Sensors

Fault-tolerant coverage with maximum lifetime in wireless sensor networks

Approximation algorithms for maximum target coverage in directional sensor networks

Coordinate-Free Distributed Algorithm for Boundary Detection in Wireless Sensor Networks

Lifetime and coverage guarantees through distributed coordinate-free sensor activation

Similar Documents

Lifetime and coverage guarantees through distributed coordinate-free sensor activation

Lifetime and Coverage Guarantees Through Distributed Coordinate-Free Sensor Activation

Lifetime and coverage guarantees through distributed coordinate-free sensor activation.

1 lifetime and coverage guarantees through distributed coordinate-free sensor activation.

Adaptive and distributed sensor activation in WSN

Maximizing Barrier Coverage Lifetime with Mobile Sensors

Fault-tolerant coverage with maximum lifetime in wireless sensor networks

Approximation algorithms for maximum target coverage in directional sensor networks

Coordinate-Free Distributed Algorithm for Boundary Detection in Wireless Sensor Networks

Lifetime and coverage guarantees through distributed coordinate-free sensor activation