Maximum lifetime routing in wireless sensor networks
By Jae-Hwan Chang, Leandros Tassiulas. IEEE/ACM Transactions on Networking, 2004
558 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/a89183d70a01bb36824fed66a0ded8d3cd678598
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
- Koustuv Dasgupta
- Konstantinos Kalpakis
- Parag Namjoshi
- Falko Dressler
- Isabel Dietrich
- Mohamed F. Younis
- Kemal Akkaya
- Prasant Mohapatra
Citations in the corpus
- On the lifetime of wireless sensor networks (2009, background): “[Wang et al. 2005; Chang and Tassiulas 2000; 2004 ], adapt this metric without further consideration.”
- Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks (2003, background): “Chang and Tassiulas [3, 4] describe data routing algorithms that maximize the time until the energies of the wireless nodes drain out.”