Dynamic DTN Routing Strategies Based on Knowledge

Authors:
Xian-Wei Zhou;Zhi-Mi Cheng;Yan Ding;Joo-Ghee Lim;Qian Liu
Affiliations:
Department of Communication Engineering, School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, People's Republic of China 100083;Department of Communication Engineering, School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, People's Republic of China 100083;Department of Communication Engineering, School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, People's Republic of China 100083;School of Electrical and Electronic Engineering, Singapore Polytechnic, Singapore, Singapore;Department of Communication Engineering, School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, People's Republic of China 100083
Venue:
Wireless Personal Communications: An International Journal
Year:
2013

Citing 16
Cited 0

The broadcast storm problem in a mobile ad hoc network

Wireless Networks - Selected Papers from Mobicom'99
A delay-tolerant network architecture for challenged internets

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Routing in a delay tolerant network

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Erasure-coding based routing for opportunistic networks

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
A hybrid routing approach for opportunistic networks

Proceedings of the 2006 SIGCOMM workshop on Challenged networks
Prioritized epidemic routing for opportunistic networks

Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Practical Routing in Delay-Tolerant Networks

IEEE Transactions on Mobile Computing
Efficient routing in intermittently connected mobile networks: the multiple-copy case

IEEE/ACM Transactions on Networking (TON)
CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks

IEEE Transactions on Mobile Computing
NECTAR: a DTN routing protocol based on neighborhood contact history

Proceedings of the 2009 ACM symposium on Applied Computing
Predict and relay: an efficient routing in disruption-tolerant networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Adaptive Randomized Epidemic Routing for Disruption Tolerant Networks

MSN '09 Proceedings of the 2009 Fifth International Conference on Mobile Ad-hoc and Sensor Networks
An Energy-Efficient n-Epidemic Routing Protocol for Delay Tolerant Networks

NAS '10 Proceedings of the 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage
Epidemic-Based Controlled Flooding and Adaptive Multicast for Delay Tolerant Networks

UIC-ATC '10 Proceedings of the 2010 Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing
Density-Aware Routing in Highly Dynamic DTNs: The RollerNet Case

IEEE Transactions on Mobile Computing
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a novel based-knowledge dynamic routing model with rate allocation for delay-tolerant networks (DTNs). The objectives are how to embody knowledge about destination offered by joint nodes and how to apply knowledge about destination to transfer data when the instantaneous end-to-end paths do not exist in DTNs. The first problem is addressed through a rate allocation model. For rate allocation, taking into account the dynamic feature of rate control as well as the selfish nature of joint nodes, we design a non-cooperative differential game model to offer efficient rate allocation scheme with the constraint of limited bandwidth, and obtain a feedback Nash equilibrium solution of the game. In this study, knowledge is valued information and provides advisable solutions to problems. For the second problem, assuming that the obtained value function in rate allocation model is the available knowledge about destination of joint node; with this assumption, a polynomial time routing algorithm is proposed to describe the procedure of the routing model.