Maximum Lifetime Routing In Wireless Sensor Networks ∗

@inproceedings{Park2005MaximumLR,
  title={Maximum Lifetime Routing In Wireless Sensor Networks ∗},
  author={Joongseok Park and Sartaj},
  year={2005}
}
We show that the problem of routing messages in a wireless sensor network so as to maximize network lifetime is NP-hard. In our model, the online model, each message has to be routed without knowledge of future route requests. We develop also an online heuristic to maximize network lifetime. Our heuristic, which performs two shortest path computations to route each message, is superior to previously published heuristics for lifetime maximization– our heuristic results in greater lifetime and… CONTINUE READING
Highly Influential
This paper has highly influenced 86 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 1,362 citations. REVIEW CITATIONS
851 Citations
21 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 851 extracted citations

1,362 Citations

050100'05'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 1,362 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Data structures

  • S. Sahni
  • algorithms, and applications in Java, 2nd Edition…
  • 2005
2 Excerpts

Energy threshold constrained geographic routing protocol for wireless sensor networks

  • R. Kannan, L. Ray, R. Kalidindi, S. Iyengar
  • Signal Processing Letters, 1, 1, 79-84
  • 2003
1 Excerpt

Similar Papers

Loading similar papers…