Highly Influenced

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

@article{Meghanathan2008OnTS, 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}, year={2008}, volume={6}, pages={744-769} }

- Published 2008 in Ad Hoc Networks
DOI:10.1016/j.adhoc.2007.06.005

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