On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Mobility modeling in wireless networks: categorization, smooth movement, and border effects
ACM SIGMOBILE Mobile Computing and Communications Review
Communication in disconnected ad hoc networks using message relay
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Performance analysis of mobility-assisted routing
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Towards a formalism for routing in challenged networks
Proceedings of the second ACM workshop on Challenged networks
Understanding the wireless and mobile network space: a routing-centered classification
Proceedings of the second ACM workshop on Challenged networks
Efficient routing in intermittently connected mobile networks: the single-copy case
IEEE/ACM Transactions on Networking (TON)
An analytical study of fundamental mobility properties for encounter-based protocols
International Journal of Autonomous and Adaptive Communications Systems
Plausible mobility: inferring movement from contacts
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
HYMAD: Hybrid DTN-MANET routing for dense and highly dynamic wireless networks
Computer Communications
A framework for characterizing the wireless and mobile network continuum
ACM SIGCOMM Computer Communication Review
Fast track article: From encounters to plausible mobility
Pervasive and Mobile Computing
Understanding stateful vs stateless communication strategies for ad hoc networks
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
| Hi-index | 0.00 |
Mobile ad hoc networks range from traditional MANETs where end-to-end paths exist from sources to destinations, to DTNs where no contemporaneous end-to-end paths exist and communication is achieved by the store, carry, and forward model of routing. Hence, nodes of these networks need to identify the level of connectivity of the network they belong to and classify it as a MANET or a DTN, in order to properly select appropriate protocols to achieve end-to-end communication. What is more, since mobile ad hoc networks change over time and space, nodes need to periodically re-access their network classification to adapt to the always changing environment. Recently, there has been an effort to classify the various types of mobile ad hoc networks assuming there is a centralized authority that has complete knowledge of the network and its dynamics. In this paper we design distributed mechanisms for nodes to perform the above classification on the fly, based only on local information that they collect as they move and encounter other nodes. The mechanisms take advantage of a combination of measurements and analytical techniques. We investigate the accuracy of our mechanisms by comparing the network classification of the centralized authority to that of a node using our schemes.