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
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Network coding for efficient communication in extreme networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Performance modeling of network coding in epidemic routing
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
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
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
Efficient broadcasting using network coding
IEEE/ACM Transactions on Networking (TON)
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks
IEEE Transactions on Mobile Computing
IEEE Transactions on Information Theory
Stochastic analysis of network coding in epidemic routing
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Employing Network Coding (NC) in routing protocols for Delay Tolerant Networks (DTNs) is a challenging issue during the last years due to its potential beneficial effect on improving relevant critical metrics. This paper proposes an effective NC scheme intended for sparse DTNs comprising nodes of limited storage capacity. The scheme employs a memory management algorithm that makes optimal use of the limited storage capacity and focuses on unicast sessions where source and intermediate nodes combine only packets belonging to the same generation and destined for the same destination node. Upon having received a sufficient number of linearly independent packets resulting in a matrix of full rank, the destination nodes can apply network decoding to retrieve the information intended for them. The proposed scheme is fully distributed since the network nodes make decisions based on information collected solely from their own buffers. Combined either with Epidemic or probabilistic routing protocols, the scheme manages to drastically reduce the overhead created per source packet.