Application-layer anycasting: a server selection architecture and use in a replicated Web service
IEEE/ACM Transactions on Networking (TON)
A unified framework for resource discovery and QoS-aware provider selection in ad hoc networks
ACM SIGMOBILE Mobile Computing and Communications Review
Associativity-Based Routing for Ad Hoc Mobile Networks
Wireless Personal Communications: An International Journal
A new scheme for traffic estimation and resource allocation for bandwidth brokers
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Distributed Formation of a Virtual Backbone in MANETs Using Adjustable Transmission Ranges
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Dynamic survivable resource pooling in mobile ad-hoc networks
ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
On Route Lifetime in Multihop Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
A new random walk model for PCS networks
IEEE Journal on Selected Areas in Communications
Evaluation of architectures for reliable server pooling in wired and wireless environments
IEEE Journal on Selected Areas in Communications
Mobility-Based Backbone Formation in Wireless Mobile Ad-hoc Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
Service discovery architectures and cluster-assisted routing protocols in mobile ad-hoc networks (MANETs) heavily use formation and maintenance of a virtual backbone (VB), where the most stable mobile nodes with higher node degree are dynamically selected as the backbone nodes. In this paper we present a novel analytic model for VB stability in MANETs. The model employs the dynamics of node movements, where link creation/failure is modeled via a random walk with probabilistic state-transition matrix. The backbone formation algorithm gives preference to the nodes with the smaller number of link changes and the higher degree. Therefore, the link arrivals and departures determine the probability (and thus the expected time) for a mobile node to leave, join, or remain in the backbone, i.e., the stability of a dynamic structure of VB.