Journal ArticleDOI
Performance modeling of epidemic routing
TLDR
A rigorous, unified framework based on ordinary differential equations (ODEs) to study epidemic routing and its variations is developed, investigating how resources such as buffer space and the number of copies made for a packet can be traded for faster delivery.About:
This article is published in Computer Networks.The article was published on 2007-07-01. It has received 810 citations till now. The article focuses on the topics: Ode & Wireless ad hoc network.read more
Citations
More filters
Journal ArticleDOI
Efficient routing in intermittently connected mobile networks: the multiple-copy case
TL;DR: A detailed exploration of the single-copy routing space is performed in order to identify efficient single- copy solutions that can be employed when low resource usage is critical, and can help improve the design of general routing schemes that use multiple copies.
Proceedings ArticleDOI
DTN routing as a resource allocation problem
TL;DR: RAPID is presented, an intentional DTN routing protocol that can optimize a specific routing metric such as worst-case delivery latency or the fraction of packets that are delivered within a deadline and significantly outperforms existing routing protocols for several metrics.
Proceedings ArticleDOI
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility
TL;DR: Simulation results for traditional mobility models, as well as for a more realistic "community-based" model, indicate that the proposed scheme can reduce the delay of existing spraying techniques up to 20 times in some scenarios.
Proceedings ArticleDOI
Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing
TL;DR: The study of traces taken from UMass DieselNet, a Disruption-Tolerant Network consisting of WiFi nodes attached to buses, finds that the all-bus-pairs aggregated inter-contact times show no discernible pattern, and suggests the importance in choosing the right level of model granularity when modeling mobility-related measures such as inter- contact times in DTNs.
Journal ArticleDOI
Data Offloading Techniques in Cellular Networks: A Survey
Filippo Rebecchi,Marcelo Dias de Amorim,Vania Conan,Andrea Passarella,Raffaele Bruno,Marco Conti +5 more
TL;DR: This paper presents a comprehensive survey of data offloading techniques in cellular networks and extracts the main requirements needed to integrate data offload capabilities into today's mobile networks.
References
More filters
A Contribution to the Mathematical Theory of Epidemics.
TL;DR: The present communication discussion will be limited to the case in which all members of the community are initially equally susceptible to the disease, and it will be further assumed that complete immunity is conferred by a single infection.
Epidemic routing for partially-connected ad hoc networks
TL;DR: This work introduces Epidemic Routing, where random pair-wise exchanges of messages among mobile hosts ensure eventual message delivery and achieves eventual delivery of 100% of messages with reasonable aggregate resource consumption in a number of interesting scenarios.
Proceedings ArticleDOI
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
TL;DR: A new routing scheme, called Spray and Wait, that "sprays" a number of copies into the network, and then "waits" till one of these nodes meets the destination, which outperforms all existing schemes with respect to both average message delivery delay and number of transmissions per message delivered.
Journal ArticleDOI
Probabilistic routing in intermittently connected networks
TL;DR: A probabilistic routing protocol for intermittently connected networks where there is no guarantee that a fully connected path between source and destination exist at any time, rendering traditional routing protocols unable to deliver messages between hosts.
Proceedings ArticleDOI
Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet
TL;DR: The goal is to use the least energy, storage, and other resources necessary to maintain a reliable system with a very high `data homing' success rate and it is believed that the domain-centric protocols and energy tradeoffs presented here for ZebraNet will have general applicability in other wireless and sensor applications.