Introduction to Linear Optimization
Introduction to Linear Optimization
Age matters: efficient route discovery in mobile ad hoc networks using encounter ages
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
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
Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks
WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
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
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
Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
State of the art in protocol research for underwater acoustic sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
A survey of practical issues in underwater networks
ACM SIGMOBILE Mobile Computing and Communications Review
Efficient routing in intermittently connected mobile networks: the single-copy case
IEEE/ACM Transactions on Networking (TON)
An analytical study of fundamental mobility properties for encounter-based protocols
International Journal of Autonomous and Adaptive Communications Systems
Utility-Based Opportunistic Routing in Multi-Hop Wireless Networks
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
DTN Routing with Probabilistic Trajectory Prediction
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Predict and relay: an efficient routing in disruption-tolerant networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
An optimal probabilistic forwarding protocolin delay tolerant networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Aging rules: what does the past tell about the future in mobile ad-hoc networks?
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Spray and Wait Routing Based on Average Delivery Probability in Delay Tolerant Network
NSWCTC '09 Proceedings of the 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing - Volume 02
Encounter: based routing in DTNs
ACM SIGMOBILE Mobile Computing and Communications Review
Regional Token Based Routing for DTNs
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
Replication routing in DTNs: a resource allocation approach
IEEE/ACM Transactions on Networking (TON)
Peoplerank: social opportunistic forwarding
INFOCOM'10 Proceedings of the 29th conference on Information communications
Know thy neighbor: towards optimal mapping of contacts to social graphs for DTN routing
INFOCOM'10 Proceedings of the 29th conference on Information communications
IEEE Communications Surveys & Tutorials
Delay-tolerant networking: an approach to interplanetary Internet
IEEE Communications Magazine
Hi-index | 0.00 |
One challenge in delay tolerant networks (DTNs) is efficient routing, as the lack of contemporaneous end-to-end paths makes conventional routing schemes inapplicable. Although many DTN routing protocols have been proposed, they often have two limitations: many protocols are not mobility cognizant, so they only suit specific mobility models and become inefficient when the environment changes; some protocols employ multi-copy replication to accommodate mobility diversity for increased delivery probability or reduced delay, but they usually do not perform well in resource constrained networks. Due to the unique characteristics of underwater sensor networks (UWSNs), efficient DTN routing becomes even more challenging. In this paper, we propose a generic prediction assisted single-copy routing (PASR) scheme that can be instantiated for different mobility models. PASR first collects a short-duration trace with network connectivity information and employs an effective off-line greedy algorithm to characterize the underlying network mobility patterns, depict the features of best routing paths and provide guidance on how to use historical information. Then it instantiates prediction assisted single-copy online routing protocols based on the guidance. As a result, the instantiated protocols are energy efficient and cognizant of the underlying mobility patterns. We demonstrate the advantages of PASR in underwater sensor networks with various mobility models.