CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks

Most of the existing research work in mobile ad hoc networking is based on the assumption that a path exists between the sender and the receiver. On the other hand, applications of decentralised mobile systems are often characterised by network partitions. As a consequence delay tolerant networking research has received considerable attention in the recent years as a means to obviate to the gap between ad hoc network research and real applications. In this paper we present the design, implementation and evaluation of the context-aware adaptive routing (CAR) protocol for delay tolerant unicast communication in intermittently connected mobile ad hoc networks. The protocol is based on the idea of exploiting nodes as carriers of messages among network partitions to achieve delivery. The choice of the best carrier is made using Kalman filter based prediction techniques and utility theory. We discuss the implementation of CAR over an opportunistic networking framework, outlining possible applications of the general principles at the basis of the proposed approach. The large scale performance of the CAR protocol are evaluated using simulations based on a social network founded mobility model, a purely random one and real traces from Dartmouth College.

[1]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[2]  Melvin J. Hinich,et al.  Time Series Analysis by State Space Methods , 2001 .

[3]  Chunming Qiao,et al.  Sociological orbit aware location approximation and routing (SOLAR) in MANET , 2007, Ad Hoc Networks.

[4]  P. A. Blight The Analysis of Time Series: An Introduction , 1991 .

[5]  Dennis G. Shea,et al.  Autonomic personal computing , 2003, IBM Syst. J..

[6]  Ivan Stojmenovic,et al.  Ad hoc Networking , 2004 .

[7]  Cecilia Mascolo,et al.  Designing mobility models based on social network theory , 2007, MOCO.

[8]  Vinton G. Cerf,et al.  Delay-tolerant networking: an approach to interplanetary Internet , 2003, IEEE Commun. Mag..

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

[10]  R. L. Keeney,et al.  Decisions with Multiple Objectives: Preferences and Value Trade-Offs , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[11]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

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

[13]  T. Başar,et al.  A New Approach to Linear Filtering and Prediction Problems , 2001 .

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

[15]  Jie Wu,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2003 .

[16]  Matthias Grossglauser,et al.  Island Hopping: Efficient Mobility-Assisted Forwarding in Partitioned Networks , 2006, 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks.

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

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

[19]  Christophe Diot,et al.  CRAWDAD dataset cambridge/haggle (v.2006-01-31) , 2006 .

[20]  John B. Kidd,et al.  Decisions with Multiple Objectives—Preferences and Value Tradeoffs , 1977 .

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

[22]  Qun Li,et al.  Sending messages to mobile users in disconnected ad-hoc wireless networks , 2000, MobiCom '00.

[23]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[24]  Cecilia Mascolo,et al.  A community based mobility model for ad hoc network research , 2006, REALMAN '06.

[25]  Cecilia Mascolo,et al.  CAR: Context-Aware Adaptive Routing for , 2009 .

[26]  Richard A. Davis,et al.  Introduction to time series and forecasting , 1998 .

[27]  Cecilia Mascolo,et al.  Evaluating context information predictability for autonomic communication , 2006, 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks(WoWMoM'06).

[28]  Cecilia Mascolo,et al.  Adaptive routing for intermittently connected mobile ad hoc networks , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[29]  A. Varga,et al.  THE OMNET++ DISCRETE EVENT SIMULATION SYSTEM , 2003 .

[30]  Cecilia Mascolo,et al.  Opportunistic Mobile Sensor Data Collection with SCAR , 2007, 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems.

[31]  Zhensheng Zhang,et al.  Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges , 2006, IEEE Communications Surveys & Tutorials.

[32]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

[33]  Hamdy A. Taha,et al.  Operations research: an introduction / Hamdy A. Taha , 1982 .

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

[35]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.

[36]  D. Watts,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .