On the stability of paths, Steiner trees and connected dominating sets in mobile ad hoc networks

  title={On the stability of paths, Steiner trees and connected dominating sets in mobile ad hoc networks},
  author={Natarajan Meghanathan and Andr{\'a}s Farag{\'o}},
  journal={Ad Hoc Networks},
We propose algorithms that use the complete knowledge of future topology changes to set up benchmarks for the minimum number of times a communication structure (like paths, trees, connected dominating sets, etc.) should change in the presence of a dynamically changing topology. We first present an efficient algorithm called OptPathTrans that operates on a simple greedy principle: whenever a new source–destination (s–d) path is required at time instant t, choose the longestliving s–d path from… CONTINUE READING
Highly Cited
This paper has 33 citations. REVIEW CITATIONS


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


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

A new heuristic for the minimum connected dominating set problem on ad hoc wireless networks

  • S. Butenko, X. Cheng, C. Oliviera, P. M. Paradlos
  • Recent Developments in Co-operative Control and…
  • 2004
Highly Influential
7 Excerpts

Comparison of routing strategies for minimizing energy consumption in mobile ad hoc networks

  • N. Meghanathan, A. Farago
  • in: Proceedings of the 4th Asian International…
  • 2008
2 Excerpts

Extension of the algorithm for optimal number of path transitions to Steiner Trees and connected dominating sets

  • N. Meghanathan, A. Farago
  • Technical Report UTDCS-3-05, University of Texas…
  • 2005
2 Excerpts

Similar Papers

Loading similar papers…