Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Message Ferrying: Proactive Routing in Highly-Partitioned Wireless Ad Hoc Networks
FTDCS '03 Proceedings of the The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems
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
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
Stochastic properties of the random waypoint mobility model
Wireless Networks
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
Erasure-coding based routing for opportunistic networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Network coding for efficient communication in extreme networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Message ferry route design for sparse ad hoc networks with mobile nodes
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
A hybrid routing approach for opportunistic networks
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel
IEEE Transactions on Information Theory
Automatic consistency assessment for query results in dynamic environments
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
A framework for evaluating DTN mobility models
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Analysis of multiple-unicast throughput in finite-buffer delay-tolerant networks
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
DMRC: dissemination of multimedia in vehicular networks using rateless codes
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Semantic self-assessment of query results in dynamic environments
ACM Transactions on Software Engineering and Methodology (TOSEM)
A random obstacle-based mobility model for delay-tolerant networking
International Journal of Network Management
Network coded routing in delay tolerant networks: an experience report
Proceedings of the 3rd Extreme Conference on Communication: The Amazon Expedition
Performance modeling of DTN routing with heterogeneous and selfish nodes
Wireless Networks
| Hi-index | 0.00 |
In this paper, we consider the problem of multiple unicast message delivery in Delay Tolerant Networks (DTNs). Long delays, mobility of nodes, and lack of connectivity that are characteristics of such network make this problem very challenging. Additionally, expiry of packets in a network, considered a useful means of regulating resource consumption, reduces reliability and increases the latency of message delivery. Traditional approaches to message delivery in such networks was based on transmitting multiple copies of entire message blocks. Recently, the application of simple erasure-based codes to messages were considered. This option opened up an interesting area of research. In this paper, we effect reliable message delivery with improved latency even in the presence of packet expiry and intermittent connectivity by applying rateless codes at the source where a message is generated. We perform extensive simulations on a variety of trace data from mobility models such as the UMassDieselNet testbed, an area-based random waypoint model, and a simple campus bus model. Results reveal the superiority of our scheme in comparison to other present schemes.