Age matters: efficient route discovery in mobile ad hoc networks using encounter ages

Authors:
Henri Dubois-Ferriere;Matthias Grossglauser;Martin Vetterli
Affiliations:
EPFL, Lausanne, Switzerland;EPFL, Lausanne, Switzerland;EPFL, Lausanne, Switzerland
Venue:
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Year:
2003

Citing 6
Cited 72

RDMAR: a bandwidth-efficient routing protocol for mobile ad hoc networks

WOWMOM '99 Proceedings of the 2nd ACM international workshop on Wireless mobile multimedia
Query localization techniques for on-demand routing protocols in ad hoc networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Comparison of broadcasting techniques for mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Scalability study of the ad hoc on-demand distance vector routing protocol

International Journal of Network Management
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution

Mobility helps security in ad hoc networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
SECTOR: secure tracking of node encounters in multi-hop wireless networks

Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
A message ferrying approach for data delivery in sparse mobile ad hoc networks

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Intelligent fluid infrastructure for embedded networks

Proceedings of the 2nd international conference on Mobile systems, applications, and services
Towards an Understanding of EASE and Its Properties

WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Spray and wait: an efficient routing scheme for intermittently connected mobile networks

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Information dissemination in highly dynamic graphs

DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Mobility Helps Peer-to-Peer Security

IEEE Transactions on Mobile Computing
Cluster Overlay Broadcast (COB): MANET Routing with Complexity Polynomial in Source-Destination Distance

IEEE Transactions on Mobile Computing
Locating mobile nodes with EASE: learning efficient routes from encounter histories alone

IEEE/ACM Transactions on Networking (TON)
Controllably Mobile Infrastructure for Low Energy Embedded Networks

IEEE Transactions on Mobile Computing
Impact of Human Mobility on Opportunistic Forwarding Algorithms

IEEE Transactions on Mobile Computing
Weak state routing for large scale dynamic networks

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Social network analysis for routing in disconnected delay-tolerant MANETs

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Scalable routing in delay tolerant networks

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
The polarized gossip protocol for path discovery in MANETs

Ad Hoc Networks
Diversity of forwarding paths in pocket switched networks

Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Efficient routing in intermittently connected mobile networks: the single-copy case

IEEE/ACM Transactions on Networking (TON)
Efficient routing in intermittently connected mobile networks: the multiple-copy case

IEEE/ACM Transactions on Networking (TON)
Delegation forwarding

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Routing in a cyclic mobispace

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Robust content dissemination in disrupted environments

Proceedings of the third ACM workshop on Challenged networks
DTN routing strategies using optimal search patterns

Proceedings of the third ACM workshop on Challenged networks
Forwarding in opportunistic networks with resource constraints

Proceedings of the third ACM workshop on Challenged networks
Phero-Trail: a bio-inspired location service for mobile underwater sensor networks

Proceedings of the third ACM international workshop on Underwater Networks
Combining on-demand and opportunistic routing for intermittently connected networks

Ad Hoc Networks
E-Scheme in Delay-Tolerant Networks

APNOMS '08 Proceedings of the 11th Asia-Pacific Symposium on Network Operations and Management: Challenges for Next Generation Network Operations and Service Management
Predict and relay: an efficient routing in disruption-tolerant networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
An optimal probabilistic forwarding protocolin delay tolerant networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Aging rules: what does the past tell about the future in mobile ad-hoc networks?

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
RENA: region-based routing in intermittently connected mobile network

Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
SimBetAge: utilizing temporal changes in social networks for pocket switched networks

Proceedings of the 1st ACM workshop on User-provided networking: challenges and opportunities
A low-energy, multi-copy inter-contact routing protocol for disaster response networks

SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Destination-assisted routing enhancement (DARE) protocol for ad-hoc mobile networks

SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
From contacts to graphs: pitfalls in using complex network analysis for DTN routing

INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
SARP - a novel multi-copy routing protocol for intermittently connected mobile networks

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Improving routing protocol performance in delay tolerant networks using extended information

Journal of Systems and Software
Phero-trail: a bio-inspired location service for mobile underwater sensor networks

IEEE Journal on Selected Areas in Communications
Peoplerank: social opportunistic forwarding

INFOCOM'10 Proceedings of the 29th conference on Information communications
Know thy neighbor: towards optimal mapping of contacts to social graphs for DTN routing

INFOCOM'10 Proceedings of the 29th conference on Information communications
Max-contribution: on optimal resource allocation in delay tolerant networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
On utilizing speed in networks of mobile agents

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Routing for disruption tolerant networks: taxonomy and design

Wireless Networks
Heterogeneity of device contact process in pocket switched networks

WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Modeling on-body DTN packet routing delay in the presence of postural disconnections

EURASIP Journal on Wireless Communications and Networking - Special issue on opportunistic and delay tolerant networks
Weak state routing for large-scale dynamic networks

IEEE/ACM Transactions on Networking (TON)
Communication capacity-based message exchange mechanism for delay-tolerant networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey of routing protocols and simulations in delay-tolerant networks

WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Golay code clustering for mobility behavior similarity classification in pocket switched networks

WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Practical routing in a cyclic MobiSpace

IEEE/ACM Transactions on Networking (TON)
NARD: Neighbor-assisted route discovery in MANETs

Wireless Networks
Modeling and simulation of service composition in opportunistic networks

Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
SMOOTH: a simple way to model human mobility

Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Stability routing with constrained path length for improved routability in dynamic MANETs

Personal and Ubiquitous Computing
Multiple controlled mobile elements (data mules) for data collection in sensor networks

DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Putting contacts into context: mobility modeling beyond inter-contact times

MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
HLLS: A History information based Light Location Service for MANETs

Computer Networks: The International Journal of Computer and Telecommunications Networking
Utility-based forwarding: a comparison in different mobility scenarios

Proceedings of the third ACM international workshop on Mobile Opportunistic Networks
Concurrent face traversal for efficient geometric routing

Journal of Parallel and Distributed Computing
SLAW: self-similar least-action human walk

IEEE/ACM Transactions on Networking (TON)
A survey of adaptive services to cope with dynamics in wireless self-organizing networks

ACM Computing Surveys (CSUR)
Routing protocols for delay tolerant networks: a quantitative evaluation

Proceedings of the 7th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
A survey on in-network querying and tracking services for wireless sensor networks

Ad Hoc Networks
CAF: Community aware framework for large scale mobile opportunistic networks

Computer Communications
Period Size Self Tuning to Enhance Routing in MANETs

International Journal of Business Data Communications and Networking
Fairness-related challenges in mobile opportunistic networking

Computer Networks: The International Journal of Computer and Telecommunications Networking
Generic prediction assisted single-copy routing in underwater delay tolerant sensor networks

Ad Hoc Networks
Universal scheme improving probabilistic routing in delay-tolerant networks

Computer Communications
Popularity spray and utility-based forwarding scheme with message priority scheduling in delay tolerant networks

Proceedings of the 11th ACM international symposium on Mobility management and wireless access
Extension of Delay Tolerant Network's Routing Protocols for Preventing Excessive Utilization of Resources

Wireless Personal Communications: An International Journal
Routing with multi-level cross-community social groups in mobile opportunistic networks

Personal and Ubiquitous Computing
On the fly learning of mobility profiles for routing in pocket switched networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose FResher Encounter SearcH (FRESH), a simple algorithm for efficient route discovery in mobile ad hoc networks. Nodes keep a record of their most recent encounter times with all other nodes. Instead of searching for the destination, the source node searches for any intermediate node that encountered the destination more recently than did the source node itself. The intermediate node then searches for a node that encountered the destination yet more recently, and the procedure iterates until the destination is reached. Therefore, FRESH replaces the single network-wide search of current proposals with a succession of smaller searches, resulting in a cheaper route discovery. Routes obtained are loop-free.The performance of such a scheme will depend on the nodes' mobility processes. Under standard mobility processes our simulations show that route discovery cost can be decreased by an order of magnitude, a significant gain given that route discovery is a major source of routing overhead in ad hoc networks.