NDLI: On k-coverage in a mostly sleeping sensor network

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

MobiDesk: mobile virtual desktop computing

Localization for mobile sensor networks

Revisiting the TTL-based controlled flooding search: optimality and randomization

Power conservation and quality of surveillance in target tracking sensor networks

Performance optimizations for wireless wide-area networks: comparative study and experimental evaluation

Denial of service resilience in ad hoc networks

Truthful multicast routing in selfish wireless networks

End-to-end performance and fairness in multihop wireless backhaul networks

A scalable model for channel access protocols in multihop ad hoc networks

Using code collection to support large applications on mobile devices

VOR base stations for indoor 802.11 positioning

Network deformation: traffic-aware algorithms for dynamically reducing end-to-end delay in multi-hop wireless networks

On k-coverage in a mostly sleeping sensor network

Characterizing flows in large wireless data networks

SSCH: slotted seeded channel hopping for capacity improvement in IEEE 802.11 ad-hoc wireless networks

Initializing newly deployed ad hoc and sensor networks

Coordinated load balancing, handoff/cell-site selection, and scheduling in multi-cell packet data systems

Exploiting medium access diversity in rate adaptive wireless LANs

Architecture and techniques for diagnosing faults in IEEE 802.11 infrastructure networks

Practical robust localization over large-scale 802.11 wireless networks

Routing in multi-radio, multi-hop wireless mesh networks

The changing usage of a mature campus-wide wireless network

Improving TCP performance over mobile ad hoc networks by exploiting cross-layer information awareness

FLSS: a fault-tolerant topology control algorithm for wireless networks

Fairness and load balancing in wireless LANs using association control

On using battery state for medium access control in ad hoc wireless networks

On k-coverage in a mostly sleeping sensor network

Content Provider	ACM Digital Library
Author	Lai, Ten H. Kumar, Santosh Balogh, József
Abstract	Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their lifetime. On the other hand, surveillance kind of applications require guaranteed k-coverage of the protected region at all times. As a result, determining the appropriate number of sensors to deploy that achieves both goals simultaneously becomes a challenging problem. In this paper, we consider three kinds of deployments for a sensor network on a unit square - a √n x √n grid, random uniform (for all n points), and Poisson (with density n). In all three deployments, each sensor is active with probability p, independently from the others. Then, we claim that the critical value of the function $npπr^{2}/log(np)$ is 1 for the event of k-coverage of every point. We also provide an upper bound on the window of this phase transition. Although the conditions for the three deployments are similar, we obtain sharper bounds for the random deployments than the grid deployment, which occurs due to the boundary condition. In this paper, we also provide corrections to previously published results for the grid deployment model. Finally, we use simulation to show the usefulness of our analysis in real deployment scenarios.
Starting Page	144
Ending Page	158
Page Count	15
File Format	PDF
ISBN	1581138687
DOI	10.1145/1023720.1023735
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2004-09-26
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Deterministic deployment Power management Connectivity Coverage Sensor network Random deployment
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

On k−coverage in a mostly sleeping sensor network

On k-coverage in a mostly sleeping sensor network (2008).

On k-coverage in a mostly sleeping sensor network (2004)

Mostly-Sleeping Wireless Sensor Networks: Connectivity, k-Coverage, and -Lifetime

Is Deterministic Deployment Worse than Random Deployment for Wireless Sensor Networks?

Mostly-Sleeping Wireless Sensor Networks: Connectivity, k-Coverage, and α-Lifetime

On Efficient Deployment of Wireless Sensors for Coverage and Connectivity in Constrained 3D Space

Complete optimal deployment patterns for full-coverage and k-connectivity (k≤6) wireless sensor networks

A novel swarm intelligence algorithm and its application in solving wireless sensor networks coverage problems.

On k-coverage in a mostly sleeping sensor network

Similar Documents

On k−coverage in a mostly sleeping sensor network

On k-coverage in a mostly sleeping sensor network (2008).

On k-coverage in a mostly sleeping sensor network (2004)

Mostly-Sleeping Wireless Sensor Networks: Connectivity, k-Coverage, and -Lifetime

Is Deterministic Deployment Worse than Random Deployment for Wireless Sensor Networks?

Mostly-Sleeping Wireless Sensor Networks: Connectivity, k-Coverage, and α-Lifetime

On Efficient Deployment of Wireless Sensors for Coverage and Connectivity in Constrained 3D Space

Complete optimal deployment patterns for full-coverage and k-connectivity (k≤6) wireless sensor networks

A novel swarm intelligence algorithm and its application in solving wireless sensor networks coverage problems.

On k-coverage in a mostly sleeping sensor network