Crash Resilient Communication in Dynamic Networks
IEEE Transactions on Computers
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
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
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
An algebraic theory of dynamic network routing
IEEE/ACM Transactions on Networking (TON)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Prioritized epidemic routing for opportunistic networks
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Performance modeling of epidemic routing
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
IEEE Communications Surveys & Tutorials
Delay-tolerant networking: an approach to interplanetary Internet
IEEE Communications Magazine
Towards distributed network classification for mobile ad hoc networks
Proceedings of the 4th Annual International Conference on Wireless Internet
Proceedings of the 4th ACM workshop on Challenged networks
Understanding stateful vs stateless communication strategies for ad hoc networks
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
Time-varying graphs and dynamic networks
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
| Hi-index | 0.00 |
Research on challenged or delay/disruption-tolerant networks has exploded in the past few years with a plethora of algorithms targeted at different versions of the problem. Yet, there have been few formal studies on the fundamental nature of the routing problem in challenged networks. As a step toward closing this gap, we introduce a formal framework relating the problem and solution spaces in challenged networks. We define three fundamental types of challenged networks and several classes of routing mechanisms. We then prove a number of results on the power of each class of routing mechanism in terms of the network types that it can solve. We show that simple variants of MANET protocols can solve two but not all three network types. However, either complete schedule awareness or maximal replication is sufficient to solve even the most general type of challenged network. We extend these results to the bounded-storage and bounded-bandwidth cases. Finally, we briefly discuss a number of avenues in which the core formalism may be extended, including an infinite opportunity model and graph theoretic extensions.