Understanding the wireless and mobile network space: a routing-centered classification

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.

[1]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[2]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[3]  Ellen W. Zegura,et al.  Capacity Enhancement using Throwboxes in DTNs , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[4]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[5]  Joseph P. Macker,et al.  Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations , 1999, RFC.

[6]  Timur Friedman,et al.  Evaluating Mobility Pattern Space Routing for DTNs , 2005, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[7]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[8]  Mingyan Liu,et al.  Random waypoint considered harmful , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[9]  Ellen W. Zegura,et al.  A message ferrying approach for data delivery in sparse mobile ad hoc networks , 2004, MobiHoc '04.

[10]  Kevin C. Almeroth,et al.  Delay Tolerant Mobile Networks (DTMNs): Controlled Flooding in Sparse Mobile Networks , 2005, NETWORKING.

[11]  Jean-Yves Le Boudec,et al.  Perfect simulation and stationarity of a class of mobility models , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[12]  Afonso Ferreira,et al.  Building a reference combinatorial model for MANETs , 2004, IEEE Network.

[13]  Ellen W. Zegura,et al.  Trading latency for energy in wireless ad hoc networks using message ferrying , 2005, Third IEEE International Conference on Pervasive Computing and Communications Workshops.

[14]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[15]  David A. Maltz,et al.  DSR: the dynamic source routing protocol for multihop wireless ad hoc networks , 2001 .

[16]  Mostafa Ammar,et al.  Routing in Space and Time in Networks with Predictable Mobility , 2004 .

[17]  Marco Conti,et al.  Mobile Ad-hoc Networking - Minitrack Introduction , 2001, HICSS.

[18]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[19]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[20]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.