Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks

By Douglas M. Blough, Paolo Santi. ACM/IEEE International Conference on Mobile Computing and Networking, 2002

296 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

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

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

HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks (2004, methodology): “Thus, we can conduct a similar analysis to [26], [27] to select Rt.”
On deriving the upper bound of α-lifetime for large sensor networks (2004, background): “Blough and Santi [ 5 ] dened the lifetime of sensor networks as minft1 ;t 2 ;t 3g ,w heret1 is the time it takes for the cardinality of the largest connected components to drop below c1 n(t), where n(t) is the number of alive nodes at time t, t2 is the time it takes for n(t )t o drop belowc2n(0), an”
Distributed Energy-Efficient Hierarchical Clustering for Wireless Sensor Networks (2005, background): “Energy consumption reduces network lifetime, which is defined as the time elapsed until the first node (or a certain percentage of nodes [1]) use up their energy.”
MobiRoute: Routing Towards a Mobile Sink for Improving Lifetime in Sensor Networks (2006, background): “The network lifetime can be defined in various ways; these definitions focus on either individual [2] or collective [14] behaviors of nodes.”
Joint mobility and routing for lifetime elongation in wireless sensor networks (2005, background): “We also evaluate the network lifetime defined as the time for the first node to die [1], [36], which is often pessimistic [22].”
Topology control in wireless ad hoc and sensor networks (2005, methodology): “The occupancy theory has been used in the context of wireless ad hoc/sensor networks to characterize the critical transmitting range for connectivity (Santi and Blough 2002, 2003), to derive bounds to the network lifetime (Blough and Santi 2002), and to study clustering algorithm properties (Younis ”
Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach (2004, unknown): “Since a similar theorem was proved in [35], the proof is omitted.”
On the lifetime of wireless sensor networks (2009, background): “1) the time until the first sensor is drained of its energy [11]–[13], [15], [36], [42]–[44] 2) the time until the first cluster head is drained of its energy [18], [19] 3) the time there is at least a certain fraction β of surviving nodes in the network [16], [17], [42], [45]–[47] 4) the time until”
Analytical modeling and mitigation techniques for the energy hole problem in sensor networks (2007, background): “Blough et al investigated this technique’s performance on energy conservation and lifetime extension [6].”