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
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
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Using redundancy to cope with failures in a delay tolerant network
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
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
Multicasting in delay tolerant networks: semantic models and routing algorithms
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Delay tolerant mobile networks (DTMNs): controlled flooding in sparse mobile networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
IEEE Communications Surveys & Tutorials
Delay-tolerant networking: an approach to interplanetary Internet
IEEE Communications Magazine
Towards a formalism for routing in challenged networks
Proceedings of the second ACM workshop on Challenged networks
A declarative perspective on adaptive manet routing
Proceedings of the ACM workshop on Programmable routers for extensible services of tomorrow
Forwarding in opportunistic networks with resource constraints
Proceedings of the third ACM workshop on Challenged networks
NECTAR: a DTN routing protocol based on neighborhood contact history
Proceedings of the 2009 ACM symposium on Applied Computing
On the implications of routing metric staleness in delay tolerant networks
Computer Communications
RapidMesh: declarative toolkit for rapid experimentation of wireless mesh networks
Proceedings of the 4th ACM international workshop on Experimental evaluation and characterization
An opportunistic authority evaluation scheme for data security in crisis management scenarios
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Probabilistic routing using contact sequencing in delay tolerant networks
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Max-contribution: on optimal resource allocation in delay tolerant networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
REDTIP: retrofitting disruption-tolerance into the internet protocol
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Using location based social networks for quality-aware participatory data transfer
Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Location Based Social Networks
Routing for disruption tolerant networks: taxonomy and design
Wireless Networks
Architectures for the future networks and the next generation Internet: A survey
Computer Communications
A case study of participatory data transfer for urban temperature monitoring
W2GIS'11 Proceedings of the 10th international conference on Web and wireless geographical information systems
Delay-tolerant delivery of quality information in ad hoc networks
Journal of Parallel and Distributed Computing
GSTAR: generalized storage-aware routing for mobilityfirst in the future mobile internet
MobiArch '11 Proceedings of the sixth international workshop on MobiArch
TTL based routing in opportunistic networks
Journal of Network and Computer Applications
R3: robust replication routing in wireless networks with diverse connectivity characteristics
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey of adaptive services to cope with dynamics in wireless self-organizing networks
ACM Computing Surveys (CSUR)
Fair content dissemination in participatory DTNs
Ad Hoc Networks
Declarative policy-based adaptive mobile ad hoc networking
IEEE/ACM Transactions on Networking (TON)
A transmission scheme for opportunistic networks with social selfish nodes
Proceedings of the 4th International Conference on Internet Multimedia Computing and Service
Dynamic DTN Routing Strategies Based on Knowledge
Wireless Personal Communications: An International Journal
On Modeling The Impact of Selfish Behaviors on Limited Epidemic Routing in Delay Tolerant Networks
Wireless Personal Communications: An International Journal
Proceedings of the 11th ACM international symposium on Mobility management and wireless access
A Comparison of Opportunistic Connection Datasets
International Journal of Distributed Systems and Technologies
Threshold based locking routing strategy for delay tolerant network
Wireless Networks
Wireless Personal Communications: An International Journal
ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal Routing Control in Delay Tolerant Networks with Time-Varying Fees
Wireless Personal Communications: An International Journal
Message Drop Control Buffer Management Policy for DTN Routing Protocols
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
We describe PRioritized EPidemic (PREP) for routing in opportunistic networks. PREP prioritizes bundles based on costs to destination, source, and expiry time. Costs are derived from per-link "average availability" information that is disseminated in an epidemic manner. PREP maintains a gradient of replication density that decreases with increasing distance from the destination. Simulation results show that PREP outperforms AODV and Epidemic Routing by a factor of about 4 and 1.4 respectively, with the gap widening with decreasing density and decreasing storage. We expect PREP to be of greater value than other proposed solutions in highly disconnected and mobile networks where no schedule information or repeatable patterns exist.