Upper bounds on the lifetime of sensor networks

By Manish Bhardwaj, Timothy Garnett, Anantha P. Chandrakasan. ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240), 2001

736 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/c619c20f85cbda6b5f092adf3f6bd0abbd8e9a7f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

MAXIMUM LIFETIME DATA GATHERING AND AGGREGATION IN WIRELESS SENSOR NETWORKS (2002, methodology): “Thus, the energy consumed by a sensor i in receiving a k-bit data packet is given by, Rxi = elec k ( 1 )”
A Survey of Network Lifetime Maximization Techniques in Wireless Sensor Networks (2017, background): “…the optimal node placement solution subject to striking a trade-off between the total power dissipation and the NL. Additionally, Bhardwaj et al. [23], [24] focused their attention on the fundamental constraints of the information gathering and transmission to a base station, while deriving the…”
On the lifetime of wireless sensor networks (2009, background): “…(a) the time each target is covered by at least one node [Cardei et al. 2005; Liu et al. 2005b]; (b) the time the whole area is covered by at least one node [Bhardwaj et al. 2001; Bhardwaj and Chandrakasan 2002]; (7) a-coverage (a) the accumulated time during which at least a portion of the…”
Analytical modeling and mitigation techniques for the energy hole problem in sensor networks (2007, background): “Some efforts have been directed to the fundamental lifetime limits in sensor networks [4], [5], [6], [7].”
Power scheduling of universal decentralized estimation in sensor networks (2006, background): “861898 Since sensors have only small-size batteries whose replacement can be costly if not impossible, sensor network operations must be energy efficient in order to maximize network lifespan [4].”
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks (2003, background): “[2] derive upper bounds on the lifetime of a sensor network that collects data from a specified region using some energy-constrained nodes.”
Survey on wireless sensor network devices (2003, background): “TABLE 3, based on [1] and [6], compares some batteries types.”
Topology control for wireless sensor networks (2003, background): “[22] derived the lifetime upper bound of information harvest sensor networks that convey probabilistic data from a point, a line, or an area source.”
An efficient clustering-based heuristic for data gathering and aggregation in sensor networks (2003, background): “In related work, Bhardwaj et al [1] derive upper bounds on the lifetime of a sensor network that collects data from a specified region using some energy–constrained nodes.”
Power efficient data gathering and aggregation in wireless sensor networks (2003, background): “[7], the upper bounds on the lifetime of sensor networks are derived.”
Design guidelines for wireless sensor networks: communication, clustering and aggregation (2004, background): “In [ 3 ], Bhardwaj et al. study a multi-hop sensor network.”
A minimum cost heterogeneous sensor network with a lifetime constraint (2005, background): “It has been noted in [7] and [12] that, for very short range communication (up to 10m), l is often comparable to r.”
Power management in energy harvesting sensor networks (2007, neutral): “Methods have also been suggested to evaluate the maximum data throughput from .xed energy resources [Bhardwaj and Chandrakasan 2002; Bhardwaj et al. 2001; Giridhar and Kumar 2005; Kansal et al. 2005].”
On the lifetime of wireless sensor networks (2005, background): “Upper bounds on lifetime are thus derived for various WSNs (see [1]–[4] and references therein).”