Adaptive routing for intermittently connected mobile ad hoc networks

The vast majority of mobile ad hoc networking research makes a very large assumption - that communication can only take place between nodes that are simultaneously accessible within the same connected cloud (i.e., that communication is synchronous). In reality, this assumption is likely to be a poor one, particularly for sparsely or irregularly populated environments. We present the context-aware routing (CAR) algorithm. CAR is a novel approach to the provision of asynchronous communication in partially-connected mobile ad hoc networks, based on the intelligent placement of messages. We discuss the details of the algorithm, and then present simulation results demonstrating that it is possible for nodes to exploit context information in making local decisions that lead to good delivery ratios and latencies with small overheads.

[1]  Xiangchuan Chen,et al.  Enabling Disconnected Transitive Communication in Mobile Ad Hoc Networks , 2001 .

[2]  Scott Shenker,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

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

[4]  Cecilia Mascolo,et al.  An ad hoc mobility model founded on social network theory , 2004, MSWiM '04.

[5]  G. Debreu.  Topological Methods in Cardinal Utility Theory , 1959 .

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

[7]  Hamdy A. Taha,et al.  Operations Research an Introduction , 2007 .

[8]  Cecilia Mascolo,et al.  Prediction of Context Information Using Kalman Filter Theory , 2004 .

[9]  Xiaoyan Hong,et al.  A group mobility model for ad hoc wireless networks , 1999, MSWiM '99.

[10]  André Schiper,et al.  Probabilistic broadcast for flooding in wireless mobile ad hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

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

[12]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

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

[14]  Christian Becker,et al.  An epidemic model for information diffusion in MANETs , 2002, MSWiM '02.

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

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

[17]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

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

[19]  Maria Udén,et al.  Providing connectivity to the Saami nomadic community , 2002 .

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

[21]  Zygmunt J. Haas,et al.  The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way) , 2003, MobiHoc '03.

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

[23]  Peter Norvig,et al.  Artificial intelligence - a modern approach, 2nd Edition , 2003, Prentice Hall series in artificial intelligence.

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

[25]  Juan-Carlos Cano,et al.  Evaluating the impact of group mobility on the performance of mobile ad hoc networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

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

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