On deriving the upper bound of α-lifetime for large sensor networks
By Honghai Zhang, Jennifer C. Hou. ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2004
295 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/fe563cbebc0e75d5320a9ec012cd9993696c9795
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
- Bang Wang
- Jun Luo
- Jean-Pierre Hubaux
- Jozsef Balogh
- Anish Arora
- Ten-Hwang Lai
- Santosh Kumar
- Levente Buttyán
In Electrical and Electronic Engineering
- Jean-Pierre Hubaux
- Jun Luo
- Jozsef Balogh
- Bang Wang
- Ten-Hwang Lai
- Santosh Kumar
- Maxim Raya
- Mani B. Srivastava
Citations in the corpus
- Coverage problems in sensor networks: A survey (2011, methodology): “One is to exploit the property of the sensing disk model [Hall 1988; Zhang and Hou 2004, 2005b]; The other is based on a grid approach [Kumar et al. 2004, 2008].”
- Non-commercial Research and Educational Use including without Limitation Use in Instruction at Your Institution, Sending It to Specific Colleagues That You Know, and Providing a Copy to Your Institution's Administrator. All Other Uses, Reproduction and Distribution, including without Limitation Comm (2005, unknown): “Hopefully, a fitting procedure in which only the order parameters and the chemical shielding parameters are varied leads to a correspondence between calculated and experimental spectra close enough to recognize a sufficient number of common features.”
- Barrier coverage with wireless sensors (2005, background): “Therefore, the traditional work on coverage [9, 12, 25] are not directly applicable to barrier coverage.”
- On k-coverage in a mostly sleeping sensor network (2004, methodology): “Although our condition (57) may appear to be better than the sufficient condition of [21] and appear contradictory to the sufficient condition for non k-coverage of [21], our sufficient condition for k-coverage is the same as the one derived in [21] (after careful scaling).”
- Joint mobility and routing for lifetime elongation in wireless sensor networks (2005, background): “Although the network lifetime definition based on the concept of loss of coverage is more comprehensive than other definitions [22], the lifetime defined as such is hard to quantify; existing proposals have investigated only its upper bound [20], [23], [24].”