NDLI: On deriving the upper bound of α-lifetime for large sensor networks

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

Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks

On greedy geographic routing algorithms in sensing-covered networks

Rate allocation in wireless sensor networks with network lifetime requirement

Localized algorithms for energy efficient topology in wireless ad hoc networks

Capacity bounds for three classes of wireless networks: asymmetric, cluster, and hybrid

Towards mobility as a network control primitive

Frequency rolling: a cooperative frequency hopping for mutually interfering wpans

Antenna orientation optimization for minimum-energy multicast tree construction in wireless ad hoc networks with directional antennas

Does topology control reduce interference?

Using labeled paths for loop-free on-demand routing in ad hoc networks

A scalable approach for reliable downstream data delivery in wireless sensor networks

Latency of wireless sensor networks with uncoordinated power saving mechanisms

On the behavior of communication links of a node in a multi-hop mobile environment

Locating cache proxies in manets

A single-channel solution for transmission power control in wireless ad hoc networks

A unified MAC layer framework for ad-hoc networks with smart antennas

Error characteristics of ad hoc positioning systems (aps)

Market sharing games applied to content distribution in ad-hoc networks

Internal synchronization of drift-constraint clocks in ad-hoc sensor networks

On deriving the upper bound of α-lifetime for large sensor networks

Geometry of information propagation in massively dense ad hoc networks

A message ferrying approach for data delivery in sparse mobile ad hoc networks

Multi-channel mac for ad hoc networks: handling multi-channel hidden terminals using a single transceiver

An adaptive strategy for maximizing throughput in MAC layer wireless multicast

On deriving the upper bound of α-lifetime for large sensor networks

Content Provider	ACM Digital Library
Author	Hou, Jennifer Zhang, Honghai
Abstract	In this paper, we explore the fundamental limits of sensor network lifetime that all algorithms can possibly achieve. Specifically, under the assumptions that nodes are deployed as a Poisson point process with density λ in a square region with side length l and each sensor can cover a unit-area disk, we first derive the necessary and sufficient condition of the node density in order to maintain complete k-coverage with probability approaching 1. With this result, we obtain that if #955; = log $l^{2}$ + (k+2)log log $l^{2}$ + c(l), c(l) → -∞, as l → +∞, the sensor network lifetime (for maintaining complete coverage) is upper bounded by kT with probability approaching 1 as l → +∞, where T is the lifetime of each sensor. Second, we derive, given a fixed node density in a finite (but reasonably large) region, the upper bounds of lifetime when only α-portion of the region is required to be covered at any time. We also carry out simulations to validate the derived results. Simulation results indicate that the derived upper bounds apply not only to networks of large areas but also to small-area networks.
Starting Page	121
Ending Page	132
Page Count	12
File Format	PDF
ISBN	1581138490
DOI	10.1145/989459.989475
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2004-05-24
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Lifetime Poisson point process Sensor networks Coverage Fundamental limits K-coverage
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 the upper bound of α-lifetime for large sensor networks

On deriving the upper bound of α-lifetime for large sensor networks (2004).

On the upper bound of α-lifetime for large sensor networks

Improving the Lifetime of Non-penetrable Barrier Coverage in Sensor Networks

Coverage by randomly deployed wireless sensor networks (2006)

Maximum lifetime scheduling for area coverage in wireless sensor networks

The generalized k-coverage under probabilistic sensing model in sensor networks

Upper Bounds on Network Lifetime for Clustered Wireless Sensor Networks

The Upper Bound of Coverage on Fixed Energy Budget in Wireless Sensor Networks

On deriving the upper bound of α-lifetime for large sensor networks

Similar Documents

On the upper bound of α-lifetime for large sensor networks

On deriving the upper bound of α-lifetime for large sensor networks (2004).

On the upper bound of α-lifetime for large sensor networks

Improving the Lifetime of Non-penetrable Barrier Coverage in Sensor Networks

Coverage by randomly deployed wireless sensor networks (2006)

Maximum lifetime scheduling for area coverage in wireless sensor networks

The generalized k-coverage under probabilistic sensing model in sensor networks

Upper Bounds on Network Lifetime for Clustered Wireless Sensor Networks

The Upper Bound of Coverage on Fixed Energy Budget in Wireless Sensor Networks

On deriving the upper bound of α-lifetime for large sensor networks