by Mirco Musolesi, Stephen Hailes, Cecilia Mascolo
in Proc. WOWMOM
http://www.cs.ucl.ac.uk/staff/m.musolesi/papers/wowmom05extended.pdf
Add To MetaCart
Abstract:
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 in 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. Moreover, asynchronous communication such as email, which is by far the preeminent form of networked person-to-person communication, has a natural fit to such partially-connected environments, but has been relatively little explored in the context of mobile ad-hoc networking. This is perhaps unsurprising, given the complexities involved. Indeed, the few approaches that have been described to date are simplistic or heavyweight, relying on brute force methods in order to achieve message delivery. In this paper, 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
Citations
|
1877
|
Artificial Intelligence: A Modern Approach
– Russell, Norvig
- 2002
|
|
851
|
Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers
– Perkins, Bhagwat
- 1994
|
|
797
|
A new approach to linear filtering and predictionn problems
– Kalman
- 1960
|
|
609
|
Decisions with Multiple Objectives: Preferences and Value Trade-offs
– Keeney, Raiffa
- 1976
|
|
417
|
Epidemic algorithms for replicated database maintenance
– Demers, Greene, et al.
- 1987
|
|
296
|
Ad Hoc Networking
– Perkins, Ed
- 2001
|
|
147
|
A delay-tolerant network architecture for challenged internets
– Fall
- 2003
|
|
130
|
Introduction to Time Series and Forecasting
– Brockwell, Davis
- 2003
|
|
127
|
A message ferrying approach for data delivery in sparse mobile ad hoc networks,” in MobiHoc
– Zhao, Ammar, et al.
- 2004
|
|
125
|
Epidemic routing for partially connected ad hoc networks
– Vahdat, Becker
- 2000
|
|
125
|
Routing in a Delay Tolerant Network
– Jain, Fall, et al.
- 2004
|
|
104
|
The OMNeT++ discrete event simulation system
– Varga
- 2001
|
|
93
|
The Analysis of Time Series An Introduction
– Chatfield
- 2004
|
|
77
|
Probabilistic routing in intermittently connected networks
– Lindgren, Doria, et al.
- 2003
|
|
62
|
The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way
– Small, Haas
- 2003
|
|
55
|
Probabilistic broadcast for flooding in wireless mobile ad hoc networks
– Sasson, Schiper
- 2003
|
|
51
|
Operations research – an Introduction
– Taha
- 1997
|
|
33
|
Topological methods in cardinal utility theory
– Debreu
- 1960
|
|
27
|
Enabling disconnected transitive communication in mobile ad hoc networks
– Chen, Murphy
- 2001
|
|
24
|
Providing connectivity to the saami nomadic community
– Doria, Udn, et al.
- 2002
|
|
19
|
An ad hoc mobility model founded on social network theory
– Musolesi, Hailes
- 2004
|
|
18
|
An epidemic model for information diffusion in manets
– Khelil, Becker, et al.
- 2002
|
|
11
|
Autonomic personal computing
– Bantz, Bisdikian, et al.
- 2003
|
|
2
|
Connecting remote communities
– Union
|
|
2
|
A group mobility model for ad hoc networks
– Hong, Gerla, et al.
- 1999
|
|
1
|
Prediction of Context Information Using Kalman Filter Theory,” http://www.cs.ucl.ac.uk/staff/m.musolesi/papers/kalman.pdf
– Musolesi, Hailes, et al.
|
|
1
|
Evaluating the impact of group mobility on the performance of mobile ad hoc networks
– Cano, Manzoni, et al.
- 2004
|
