Single-copy routing in intermittently connected mobile networks
- 6 April 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from source to destination, or such a path is highly unstable and may break soon after it has been discovered. In this context, conventional routing schemes would fail. To deal with such networks we propose the use of an opportunistic hop-by-hop routing model. According to the model, a series of independent, local forwarding decisions are made, based on current connectivity and predictions of future connectivity information diffused through nodes' mobility. The important issue here is how to choose an appropriate next hop. To this end, we propose and analyze via theory and simulations a number of routing algorithms. The champion algorithm turns out to be one that combines the simplicity of a simple random policy, which is efficient in finding good leads towards the destination, with the sophistication of utility-based policies that efficiently follow good leads. We also state and analyze the performance of an oracle-based optimal algorithm, and compare it to the online approaches. The metrics used in the comparison are the average message delivery delay and the number of transmissions per message delivered. I. INTRODUCTIONKeywords
This publication has 17 references indexed in Scilit:
- Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy CaseIEEE/ACM Transactions on Networking, 2008
- Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networksAd Hoc Networks, 2003
- Probabilistic routing in intermittently connected networksACM SIGMOBILE Mobile Computing and Communications Review, 2003
- Age mattersPublished by Association for Computing Machinery (ACM) ,2003
- Communication in disconnected ad hoc networks using message relayJournal of Parallel and Distributed Computing, 2003
- The shared wireless infostation modelPublished by Association for Computing Machinery (ACM) ,2003
- Smart-tag based data disseminationPublished by Association for Computing Machinery (ACM) ,2002
- The Broadcast Storm Problem in a Mobile Ad Hoc NetworkWireless Networks, 2002
- Stochastic properties of the random waypoint mobility modelPublished by Association for Computing Machinery (ACM) ,2002
- Pollen: using people as a communication mediumComputer Networks, 2001