Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
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
Trading Latency for Energy in Wireless Ad Hoc Networks Using Message Ferrying
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Building a reference combinatorial model for MANETs
IEEE Network: The Magazine of Global Internetworking
Towards distributed network classification for mobile ad hoc networks
Proceedings of the 4th Annual International Conference on Wireless Internet
SIMPS: using sociology for personal mobility
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 4th ACM workshop on Challenged networks
DOME: a diverse outdoor mobile testbed
Proceedings of the 1st ACM International Workshop on Hot Topics of Planet-Scale Mobility Measurements
Message ferries as generalized dominating sets in intermittently connected mobile networks
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
Efficient social-aware content placement in opportunistic networks
WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
Globs in the primordial soup: the emergence of connected crowds in mobile wireless networks
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
A framework for characterizing the wireless and mobile network continuum
ACM SIGCOMM Computer Communication Review
Pervasive and Mobile Computing
A retrospective look at the UMass DOME mobile testbed
ACM SIGMOBILE Mobile Computing and Communications Review
Hi-index | 0.00 |
Research into wireless data networks with mobile nodes has mostly considered Mobile Ad Hoc Networks (or MANETs). In such networks, it is generally assumed that end-to-end, possibly multi-hop paths between node pairs exist most of the time. Routing protocols designed to operate in MANETs assume that these paths are formed by a set of wireless links that exist contemporaneously. Disruption or delay tolerant networks (DTNs) have received significant attention recently. Their primary distinction from MANETs is that in DTNs links on an end-to-end path may not exist contemporaneously and intermediate nodes may need to store data waiting for opportunities to transfer data towards its destination. We call such DTN paths space-time paths to distinguish them from contemporaneous space paths used in MANETs. We argue in this paper that MANETs are actually a special case of DTNs. Furthermore, DTNs are, in turn, a special case of disconnected networks where even space-time paths do not exist. In this paper we consider the question of how to classify mobile and wireless networks with the goal of understanding what form of routing is most suitable for which network. We first develop a formal graph-theoretic classification of networks based on the theory of evolving graphs. We next develop a routing-aware classification that recognizes that the boundaries between network classes are not hard and are dependent on routing protocol parameters. This is followed by the development of algorithms that can be used to classify a network based on information regarding node contacts. Lastly, we apply these algorithms to a selected set of mobility models in order to illustrate how our classification approach can be used to provide insight into wireless and mobile network design and operation.