Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPS-Free Positioning in Mobile ad-hoc Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Using GPS to learn significant locations and predict movement across multiple users
Personal and Ubiquitous Computing
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
The changing usage of a mature campus-wide wireless network
Proceedings of the 10th annual international conference on Mobile computing and networking
Extracting places from traces of locations
Proceedings of the 2nd ACM international workshop on Wireless mobile applications and services on WLAN hotspots
Characterizing mobility and network usage in a corporate wireless local-area network
Proceedings of the 1st international conference on Mobile systems, applications and services
Practical routing in delay-tolerant networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
IEEE Transactions on Mobile Computing
An optimal probabilistic forwarding protocolin delay tolerant networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Replication routing in DTNs: a resource allocation approach
IEEE/ACM Transactions on Networking (TON)
Efficient adaptive routing in delay tolerant networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Clustering and cluster-based routing protocol for delay-tolerant mobile networks
IEEE Transactions on Wireless Communications
Routing in socially selfish delay tolerant networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
| Hi-index | 0.00 |
Similarity-based techniques relying on contact patterns among nodes have shown to provide high delivery success rate when performing routing in delay-tolerant networks (DTN). Nevertheless, such approaches work well only when nodes exhibit high similarity values. In this paper, we propose Price (Periodicity-based Routing in Intermittently-Connected Environments), an agenda-based greedy forwarding scheme for DTNs that combines geographic-oriented forwarding with contact-based forwarding by relying packets according to predictable patterns of locations and contacts. We define the operation of Price and evaluate the performance of geographic forwarding under the framework of graph navigation to unveil a small-world phenomenon. We then gauge the performance of Price using a real-life mobility data set according to various well-known routing solutions such as Flooding, Prophet, Bubble Rap, and Wait. Simulation results show that Price largely outperforms other solutions, especially in terms of combined cost/delivery ratio.