Leveraging node centrality and regularity for efficient routing in mobile peer-to-peer networks

Authors:
Jingwei Miao;Omar Hasan;Lionel Brunie
Affiliations:
University of Lyon, CNRS, INSA-Lyon, LIRIS, UMR, France;University of Lyon, CNRS, INSA-Lyon, LIRIS, UMR, France;University of Lyon, CNRS, INSA-Lyon, LIRIS, UMR, France
Venue:
Globe'11 Proceedings of the 4th international conference on Data management in grid and peer-to-peer systems
Year:
2011

Citing 7
Cited 0

A delay-tolerant network architecture for challenged internets

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Routing in a delay tolerant network

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A community based mobility model for ad hoc network research

REALMAN '06 Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality
Efficient routing in intermittently connected mobile networks: the multiple-copy case

IEEE/ACM Transactions on Networking (TON)
HCMM: Modelling spatial and temporal properties of human mobility driven by users' social relationships

Computer 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
Characterizing and leveraging people movement for content distribution in mobile peer-to-peer networks

Characterizing and leveraging people movement for content distribution in mobile peer-to-peer networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Solutions for data dissemination in traditional peer-to-peer networks are not suitable for mobile peer-to-peer networks due to the special characteristics of mobile environments, particularly highly variable connectivity, and disconnection. Mobile peer-to-peer data dissemination over Delay Tolerant Networks (DTNs) is a promising paradigm since they can tolerate frequent and long network partitions. DTNs exploit collaborative data storage and node mobility to bridge disconnected nodes and enable communication between them. Recent studies based on real world traces reveal that node mobility exhibits certain patterns influenced by the centrality and the regularity of nodes in the network. Many existing routing algorithms for DTNs exploit only one of the mobility properties, e.g., only node centrality, or only node regularity to route messages from a source node to a destination node. In this paper, we present an adaptive routing algorithm that exploits either centrality or regularity according to the situation to achieve the best possible routing performance in delay tolerant networks. Simulations performed on real mobility traces show that our algorithm outperforms the existing routing algorithms that utilize only one mobility property.