Research Repository

See what's under the surface

Congestion aware forwarding in delay tolerant and social opportunistic networks

Radenkovic, Milena; Grundy, Andrew

Authors

Milena Radenkovic

Andrew Grundy

Abstract

We propose an approach for opportunistic forwarding that supports optimization of multipoint high volume data flow transfer while maintaining high buffer availability and low delays. This paper explores a number of social, buffer and delay heuristics to offload the traffic from congested parts of the network and spread it over less congested parts of the network in order to keep low delays, high success ratios and high availability of nodes. We conduct an extensive set of experiments for assessing the performance of four newly proposed heuristics and compare them with Epidemic, Prophet, Spay and Wait and Spay and Focus protocols over real connectivity driven traces (RollerNet) and with a realistic publish subscribe filecasting application. We look into success ratio of answered queries, download times (delays) and availability of buffer across eight protocols for varying congestion levels in the face of increasing number of publishers and topic popularity. We show that all of our combined metrics perform better than Epidemic protocol, Prophet, Spray and Wait, Spray and Focus and our previous prototype across all the assessed criteria.

Publication Date Jan 26, 2011
Peer Reviewed Peer Reviewed
Book Title 2011 Eighth International Conference on Wireless On-Demand Network Systems and Services
Institution Citation Radenkovic, M., & Grundy, A. (2011). Congestion aware forwarding in delay tolerant and social opportunistic networks. In 2011 Eighth International Conference on Wireless On-Demand Network Systems and Servicesdoi:10.1109/WONS.2011.5720201
DOI https://doi.org/10.1109/WONS.2011.5720201
Publisher URL http://dx.doi.org/10.1109/WONS.2011.5720201
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingh.../end_user_agreement.pdf
Additional Information © 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Files

WONS-2011.pdf (758 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf




Downloadable Citations