A distributed routing algorithm for mobile wireless networks
Wireless Networks
Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Mobility prediction and routing in ad hoc wireless networks
International Journal of Network Management
Introduction to Algorithms
Associativity-Based Routing for Ad Hoc Mobile Networks
Wireless Personal Communications: An International Journal
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
MERIT: a scalable approach for protocol assessment
Mobile Networks and Applications
Stochastic properties of the random waypoint mobility model
Wireless Networks
Proceedings of the 47th Annual Southeast Regional Conference
Maximum stability data gathering trees for mobile sensor networks
International Journal of Mobile Network Design and Innovation
International Journal of Interdisciplinary Telecommunications and Networking
International Journal of Interdisciplinary Telecommunications and Networking
Network topology models for multihop wireless networks
ISRN Communications and Networking
Hi-index | 0.00 |
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 longest-living s-d path from time t. The above strategy when repeated over the duration of the s-d session yields a sequence of long-lived stable paths such that number of path transitions is the global minimum. We then propose algorithms to determine the sequence of stable Steiner trees and the sequence of stable connected dominating sets to illustrate that the principle behind OptPathTrans is very general and can be used to find the stable sequence of any communication structure as long as there is a heuristic or algorithm to determine that particular communication structure in a given network graph. We study the performance of the three algorithms in the presence of complete knowledge of future topology changes as well as using models that predict the future locations of nodes. Performance results indicate that the stability of the communication structures could be considerably improved by making use of the knowledge about locations of nodes in the near future.