Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Exploiting mobility for energy efficient data collection in wireless sensor networks
Mobile Networks and Applications
Hierarchical power management in disruption tolerant networks with traffic-aware optimization
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
Delay- and Disruption-Tolerant Networking
Delay- and Disruption-Tolerant Networking
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
Practical Routing in Delay-Tolerant Networks
IEEE Transactions on Mobile Computing
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Adaptive contact probing mechanisms for delay tolerant applications
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Diversity of forwarding paths in pocket switched networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
A Bidding Algorithm for Optimized Utility-Based Resource Allocation in Ad Hoc Networks
IEEE Transactions on Mobile Computing
IEEE Communications Surveys & Tutorials
Delay-tolerant networking: an approach to interplanetary Internet
IEEE Communications Magazine
Evaluating the impact of an acknowledgment strategy for APRP
Proceedings of the 5th International Latin American Networking Conference
Fuzzy-spray: efficient routing in delay tolerant ad-hoc network based on fuzzy decision mechanism
FUZZ-IEEE'09 Proceedings of the 18th international conference on Fuzzy Systems
Routing for disruption tolerant networks: taxonomy and design
Wireless Networks
TTL based routing in opportunistic networks
Journal of Network and Computer Applications
On the impact of a road-side infrastructure for a DTN deployed on a public transportation system
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Fair content dissemination in participatory DTNs
Ad Hoc Networks
An analysis of evaluation practices for DTN routing protocols
Proceedings of the seventh ACM international workshop on Challenged networks
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
Evaluating contact volume in DTN networks
Proceedings of the 3rd Extreme Conference on Communication: The Amazon Expedition
Shaping opportunistic networks
Computer Communications
| Hi-index | 0.01 |
This paper presents ORWAR, a resource-efficient protocol for opportunistic routing in delay-tolerant networks. Our approach exploits the context of mobile nodes (speed, direction of movement and radio range) to estimate the size of a contact window. This knowledge is exploited to make better forwarding decisions and to minimize the probability of partially transmitted messages. As well as optimizing the use of bandwidth during overloads it helps to reduce energy consumption since partially transmitted messages are useless and waste transmission power. Another feature of the algorithm is the use of a differentiation mechanism based on message utility. This allows allocating more resources for high utility messages. More precisely, messages are replicated in the order of highest utility first, and removed from the buffers in the reverse order. To illustrate the benefit of such a scheme the global accumulated utility is used as a system-wide performance metric. Simulations illustrate the benefit of our model and show that ORWAR provides lower overhead and higher delivery rate, as well as higher accumulated utility compared to a number of well-known algorithms (including Maxprop and SprayAndWait).