Hierarchically-organized, multihop mobile wireless networks for quality-of-service support
Mobile Networks and Applications - Special issue: mobile multimedia communications
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 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
DTN routing in a mobility pattern space
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Logarithmic Store-Carry-Forward Routing in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Adaptive redundancy for data propagation exploiting dynamic sensory mobility
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
An optimal probabilistic forwarding protocolin delay tolerant networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Congestion management in delay tolerant networks
Proceedings of the 4th Annual International Conference on Wireless Internet
Adaptive, direction-aware data dissemination for diverse sensor mobility
Proceedings of the 7th ACM international symposium on Mobility management and wireless access
A low-energy, multi-copy inter-contact routing protocol for disaster response networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Optimal routing and scheduling for deterministic delay tolerant networks
WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
Delay-constrained energy-efficient routing in heterogeneous wireless sensor networks
International Journal of Sensor Networks
Improving routing protocol performance in delay tolerant networks using extended information
Journal of Systems and Software
Clustering and cluster-based routing protocol for delay-tolerant mobile networks
IEEE Transactions on Wireless Communications
Efficient public key certificate management for mobile ad hoc networks
EURASIP Journal on Wireless Communications and Networking - Special issue on security and resilience for smart devices and applications
Enabling vehicular visible light communication (V2LC) networks
VANET '11 Proceedings of the Eighth ACM international workshop on Vehicular inter-networking
Practical routing in a cyclic MobiSpace
IEEE/ACM Transactions on Networking (TON)
A dynamic multicast tree based routing scheme without replication in delay tolerant networks
Journal of Parallel and Distributed Computing
Direction-based adaptive data propagation for heterogeneous sensor mobility
Journal of Parallel and Distributed Computing
Journal of Network and Computer Applications
Hi-index | 0.00 |
The non-existence of an end-to-end path poses a challenge inadapting the traditional routing algorithms to delay tolerantnetworks (DTNs). Previous works include centralized rout-ing approaches based on deterministic mobility, ferry-basedrouting with deterministic or semi-deterministic mobility, flooding-based approaches for networks with general mobility, and probability-based routing for semi-deterministicmobility models. Unfortunately, none of these methods canguarantee both scalability and delivery. In this work, we investigate scalable deterministic routing in DTNs. Instead of routing with global contact knowledge, we propose a simplified DTN model and a routing algorithm which routes on contact information compressed by three combined methods. Analytical studies and simulation results show that the performance of our proposed routing algorithm, DTN Hierarchical Routing (DHR), approximates that of the optimal time-space Dijkstra's algorithm in terms of delay and hop-count. At the same time, the per node storage overhead is substantially reduced and becomes scalable. Although our work is based on a simplified DTN model, we believe this approach will lay a groundwork for the understanding of scalable routing in DTNs.