Abstract — Disruption-tolerant networks (DTNs) attempt to route network messages via intermittently connected nodes. Routing in such environments is difficult because peers have little information about the state of the partitioned network and transfer opportunities between peers are of limited

. An overview of basic concepts of information consensus in networks and methods of convergence and performance analysis for the algorithms are provided. Our analysis framework is based on tools from matrix theory, algebraic graph theory, and control theory. We discuss the connections between consensus problems

Whe origin of the RSVP protocol can be traced back to 1991, when a team of network researchers, including myself, started playing with a number of packet scheduling algorithms on the DARTNET (DARPA Testbed NETwork), a network testbed made of open source, workstation-based routers. Because

from disruption-tolerant networking to build a flexible/best-effort service that leverages the intermittent ad-hoc connectivity between users. We propose Sticker, a spatial dissemination protocol that aims to maximize delivery reliability without incurring significant storage/transmission overheads

In this article we study the data dissemination problem in which data items are flooded to all the moving objects in a mobile ad hoc network by peer-to-peer transfer. We show that if memory and bandwidth are bounded at moving objects, then the problem of determining whether a set of data items can

to connectivity. In this paper, we describe the SPINDLE Disruption-Tolerant Networking system and related technology being developed at BBN under the DTN program. Using an open-source, standardsbased core with a plugin architecture and well-specified interfaces, we enable independent development and insertion

Abstract:- Compact centre points in sure circumstances, as an example, a forefront or a hostile region area unit indebted to expertise the evil impacts of broken framework system and never-ending bundles. Intrusion tolerant framework (DTN) progressions have gotten the chance to be productive plans

not apply in such disruption-prone environments. Recently, the use of identity-based cryptography has been proposed as one way to help solve some of the security issues in disruption-tolerant networks (DTNs). In this paper we discuss the security issues of DTNs, survey proposed solutions, and identify some

The authors give an overview of current work on delay- and disruption-tolerant networking and review the overall architecture proposed by the Internet Research Task Force’s Delay Tolerant Networking Research Group.Their approach to networking makes no assumption that nodes will have end

Node mobility and end-to-end disconnections in disruption-tolerant networks (DTNs) greatly impair the effectiveness of data forwarding. Although social-based approaches can address the problem, most existing solutions only focus on forwarding data to a single destination. In this paper, we study