June 18, 2021

Download Ebook Free Delay And Disruption Tolerant Networks

Delay- and Disruption-tolerant Networking

Delay- and Disruption-tolerant Networking
Author : Stephen Farrell,Vinny Cahill
Publisher : Artech House Publishers
Release Date : 2006
Category : Computers
Total pages :226
GET BOOK

Delay and disruption networking (DTN) is an up-and-coming technology that enables networking in extreme environments. This complete reference on DTN covers applications requirements, DTN protocols, and network implementation. Thoroughly examining the causes of delay and disruption, the book shows how to engineer a robust network that can survive the harshest conditions.

Delay and Disruption Tolerant Networks

Delay and Disruption Tolerant Networks
Author : Aloizio Pereira da Silva,Scott Burleigh,Katia Obraczka
Publisher : CRC Press
Release Date : 2018-09-04
Category : Technology & Engineering
Total pages :468
GET BOOK

Delay- and Disruption Tolerant Networks (DTNs) are networks subject to arbitrarily long-lived disruptions in connectivity and therefore cannot guarantee end-to-end connectivity at all times. Consequently DTNs called for novel core networking protocols since most existing Internet protocols rely on the network’s ability to maintain end-to-end communication between participating nodes. This book presents the fundamental principles that underline DTNs. It explains the state-of-the-art on DTNs, their architecture, protocols, and applications. It also explores DTN’s future technological trends and applications. Its main goal is to serve as a reference for researchers and practitioners.

Modeling and Analysis of Delay Tolerant Networks

Modeling and Analysis of Delay Tolerant Networks
Author : Rahul Sehgal
Publisher : Unknown
Release Date : 2016
Category : End-to-end delay (Computer networks)
Total pages :108
GET BOOK

Delay and Disruption Tolerant Networks (DTNs) refer to a range of networks with link intermittency which is mainly driven by mobility, predictable or unpredictable network environmental conditions. Examples of DTNs include interplanetary networks (satellite communication), Mobile Ad Hoc Networks (MANETs) without topology information, battlefield networks, mule networks, sensor networks, smart highways, remote environmental and animal-movement outposts. Unlike traditional networks in which connectivity, perhaps through alternate routing, always exists between a pair of nodes with deterministic topology, DTNs suer from this very important characteristic in two respects; probabilistic topology, and absence of continuous data forwarding. These characteristics make it difficult to model and analyze DTNs for various network performance analysis and ultimately applications support. From queuing theory perspective, link intermittency not only disrupt the packet arrival distribution, it also disrupt the service time (packet processing) distribution, and that significantly affect the end-to-end delay and jitter (delay variation) for applications. This dissertation intends to address the implication of link disruption on the end-to-end delay in DTNs by modeling the link behavior in the context of tandem open queuing systems. First, we employ the long-term probabilistic routing matrix associated with a disruptive network topology along with alternate paths to approximate the end-to-end (E2E) delay. Second, we incorporate the link disruption time into the service time for each output link to model the mean queuing delay for each node. Third, we model the delay as a function of first-contact-time between two disconnected components, given a link disruption can partition the underlying graph. These models assume that the traffic flows follow Jackson's theorem. In effect, we extend Jackson theorem to accommodate service disruption. In all, we tested our theoretical approximations with simulation models using well-known DTN traces obtained from human and vehicular mobility. We also generated synthetic contact time, inter-contact time, arrival and departure processes to verify these approximation models under various traffic loads and disruptive intensity.

Delay and Disruption Tolerant Network Implementation with Reconfigurable Hardware Support

Delay and Disruption Tolerant Network Implementation with Reconfigurable Hardware Support
Author : Donald G. Heyer,Albert A. Liddicoat
Publisher : Unknown
Release Date : 2007
Category : Adaptive computing systems
Total pages :164
GET BOOK

The need to share information in less friendly networking environments has motivated the study and development of new delay and disruption tolerant networking (DTN) protocols.

Protocol and Architectural Challenges in Delay and Disruption Tolerant Networks

Protocol and Architectural Challenges in Delay and Disruption Tolerant Networks
Author : Khaled A. Harras
Publisher : ProQuest
Release Date : 2007
Category :
Total pages :416
GET BOOK

The future of computer networks includes an Internet that encompasses numerous heterogeneous networks, reaches out to the most remote areas, and provides communication in the most extreme and unstable conditions. With such a vision, new problems with large complexities arise. Communication devices in the future will be required to remain connected despite the rise of new challenges such as network partitioning, intermittent connectivity, large delays, the high cost of infrastructure deployment, and the absence of an end-to-end path.

Delay Tolerant Networks

Delay Tolerant Networks
Author : Athanasios V. Vasilakos,Yan Zhang,Thrasyvoulos Spyropoulos
Publisher : CRC Press
Release Date : 2016-04-19
Category : Computers
Total pages :362
GET BOOK

A class of Delay Tolerant Networks (DTN), which may violate one or more of the assumptions regarding the overall performance characteristics of the underlying links in order to achieve smooth operation, is rapidly growing in importance but may not be well served by the current end-to-end TCP/IP model. Delay Tolerant Networks: Protocols and Applicat

Geographic Routing (GR) in Delay/Disruption Tolerant Networks (DTNs).

Geographic Routing (GR) in Delay/Disruption Tolerant Networks (DTNs).
Author : Yue Cao
Publisher : Unknown
Release Date : 2013
Category :
Total pages :129
GET BOOK

Event-driven Software-architecture for Delay- and Disruption-tolerant Networking

Event-driven Software-architecture for Delay- and Disruption-tolerant Networking
Author : Anonim
Publisher : Unknown
Release Date : 2015
Category :
Total pages :245
GET BOOK

Delay Tolerant Network

Delay Tolerant Network
Author : Adriano Galati
Publisher : LAP Lambert Academic Publishing
Release Date : 2010-10
Category :
Total pages :104
GET BOOK

DTN - Routing Simulation Study: One of the most promising emerging approaches to providing reliable data communication in such environments is Delay/Disruption Tolerant Networkin (DTN). A delay tolerant network is a store and forward network where end-to-end connectivity is not assumed and where opportunistic links between nodes are used to transfer data. This master thesis analyses some routing algorithms applied on a Delay/Disruption Tolerant Network and highlights the main weak points and further parameters that should be taken into account for routing in DTN. We also draw the attention on an homomorphism between the equation of state for gas and our equation of state for mobile ad hoc networks.

Standardized Bundle Agent Discovery on Delay/disruption-tolerant Networks

Standardized Bundle Agent Discovery on Delay/disruption-tolerant Networks
Author : James Wyllie
Publisher : Unknown
Release Date : 2008
Category : Computer networks
Total pages :129
GET BOOK

Advances in Delay-Tolerant Networks (DTNs)

Advances in Delay-Tolerant Networks (DTNs)
Author : Joel J.P.C. Rodrigues
Publisher : Woodhead Publishing
Release Date : 2020-11-26
Category : Computers
Total pages :322
GET BOOK

Advances in Delay-Tolerant Networks: Architecture and Enhanced Performance, Second Edition provides an important overview of delay-tolerant networks (DTNs) for researchers in electronics, computer engineering, telecommunications and networking for those in academia and R&D in industrial sectors. Part I reviews the technology involved and the prospects for improving performance, including different types of DTN and their applications, such as satellite and deep-space communications and vehicular communications. Part II focuses on how the technology can be further improved, addressing topics, such as data bundling, opportunistic routing, reliable data streaming, and the potential for rapid selection and dissemination of urgent messages. Opportunistic, delay-tolerant networks address the problem of intermittent connectivity in a network where there are long delays between sending and receiving messages, or there are periods of disconnection. Reviews the different types of DTN and shows how they can be applied in satellite and deep-space communications, vehicular communications (including unmanned aerial), and during large-scale disasters Considers security concerns for DTN and potential for rapid selection and dissemination of urgent messages Reviews the breadth of areas in which DTN is already providing solutions Covers the prospects for DTN's wider adoption and development of standards

Mitigating Denial of Sevice (DoS) Attacks in Delay/disruption Tolerant Networks (DTNs).

Mitigating Denial of Sevice (DoS) Attacks in Delay/disruption Tolerant Networks (DTNs).
Author : Godwin Okon Ansa
Publisher : Unknown
Release Date : 2012
Category :
Total pages :129
GET BOOK

Efficient Routing Algorithm for Delay Tolerant Networks

Efficient Routing Algorithm for Delay Tolerant Networks
Author : Mehul Shah,Namita Mehta
Publisher : LAP Lambert Academic Publishing
Release Date : 2014-10-08
Category :
Total pages :76
GET BOOK

A Delay Tolerant Networks (DTNs), also known as intermittently connected wireless mobile networks, works effectively at the time of discontinuous network connectivity between two nodes. A communication network which is capable of storing packets momentarily in intermediate nodes and conveys the packets when end-to-end route is re-established or regenerated is known as a delay tolerant network/ disruption tolerant networks. Many routing protocols have been developed for DTN based on movement pattern of the nodes. In this book we presents a novel routing protocol which exploits mobility characteristics of human walk. We evaluate a novel Human Mobility based Spray & Wait Routing protocol (HMSaW) under human mobility as per Truncated Levy Walk (TLW) mobility model. HMSaW is more efficient compared to existing Spray and Wait routing protocol for mode movements as per human walk. The presented HMSaW protocol perform better in terms of delivery ratio and communication overhead compared to existing spray and wait Routing protocol with marginal reduction in delivery delay. MATLAB code of the presented simulation results are also provided in this book.

Towards Efficient Content Dissemination Over Disruption Tolerant Networks

Towards Efficient Content Dissemination Over Disruption Tolerant Networks
Author : Amir Krifa
Publisher : Unknown
Release Date : 2012
Category :
Total pages :246
GET BOOK

The rapid proliferation of advanced mobile devices has created a growing demand for data content. Existing approaches cannot keep up with the large volume of content generated and requested, without the deployment of new expensive infrastructure. Exchanging content of interest opportunistically, when two nodes are in range, presents a low cost and high bandwidth alternative for popular, bulky content? Yet, efficiently collecting, storing, and sharing the content while preventing selfish users from impairing collaborative ones, poses major challenges. In this thesis, we start by discussing the state of the art in terms of proposed solutions for both point-to-point content routing and point-to-multipoint content sharing solutions in DTN(s) (Delay Tolerant Network). Our main observations were i) despite a large amount of effort invested in the design of efficient routing protocols for DTN, there has not been a similar focus on storage management and scheduling policies, and (ii) in addition to dealing with the resources management challenges, distributed (or peer-to-peer) content sharing systems over non-altruistic mobile devices have one more important issue to deal with : to ensure enough nodes collaborate to make the system interesting to participants. This latter goal is often conflicting with optimal resources management policies. Following this preliminary study, we try to solve the highlighted problems in their foundations. We focus furst on the problem of optimal resource management in the context point-to-point content routing through a DTN. This problem was first studied in scenarios related to environment and habitat monitoring based on sensor networks, in project willing to connect rural villages, and even in scenarios related to space technologies based on DTN protocols. We propose a practical and efficient joint scheduling and drop policy that can optimize different performance metrics, such as average delay and delivery probability. We first use the theory of encounter-based message dissemination to derive the optimal policy based on global knowledge about the network (GBSD, Global knowledge Based Scheduling and Drop). Then, we introduce a method that estimates all necessary parameters using locally collected statistics. Based on this, we derive a distributed scheduling and drop policy that can approximate the performance of the optimal policy in practice (HBSD, History Based Scheduling and Drop). Finally, we study how sample statistics can reduce the signaling overhead of our algorithm and examine its behavior under different congestion regimes. In a second effort, we revisit the problem of optimal resource management in the context of large scale interests-driven content sharing over non-altruistic mobile devices. Our ultimate goal is to enable people, through channel based architecture to express their interests, head out in the real world and wait to get notified whenever a content that matches their interests is retrieved. To achieve this, we propose Mobi'Trade as candidate architecture. Mobi'Trade is a utility driven trading system for efficient content sharing on top of a DTN. It does not only take care of the network and device resources, but also carefully considers : (i) the propagation of interests of participating users, (ii) the matching of these interests to individual node mobility patterns, and (iii) the willingness of involved users to collaborate. While simple tit-for-tat (TFT) mechanisms can force nodes to give one to get one, dealing with the inherent tendency of peers to take much but give back little, they can quickly lead to deadlocks when some (or most) of interesting content must be somehow fetched across the network. To resolve this, Mobi'Trade relies on a trading mechanism that allows a node merchant to buy, store and carry content for other nodes (its clients) so that it can later trade it for content it is personally interested in. To exploit this extra degree of freedom, Mobi'Trade nodes continuously profile the type of content requested and the collaboration level of encountered devices. An appropriate utilily function is then used to collect n optimal inventory that maximizes the expected value of stored content for future encounters, matched to the observed mobility patterns, interest patterns, and collaboration levels of encountered nodes. Both of resources management solutions for point-to-point DTN routing (HBSD) and our channel base content sharing architecture (Mobi'Trade) have been validated respectively through extensive NS-2 and NS-3 simulations along with a multitude of synthetic mobility models and real mobility traces. Furthermore, in order to ensure the feasibility of our protocols and offer them to users, we implemented respectively HBSD and Mobi'Trade for the DTN2 reference architecture and on real Android powered mobile devices and did further experiment in real environments.

Cost Efficient Predictive Routing in Disruption Tolerant Networks

Cost Efficient Predictive Routing in Disruption Tolerant Networks
Author : Satyajeet Deshpande
Publisher : Unknown
Release Date : 2011
Category :
Total pages :57
GET BOOK

We compare our protocol with some past replication routing protocols and some forwarding protocols who use average metrics. We show that our protocol outperforms the replication protocols almost three times in terms of cost and outperforms the forwarding protocols almost two times. We also show that it achieves equivalent throughput and delay compared to replication protocols who have the best delay and throughput and it has better throughput and delay compared to the forwarding protocols. We also show how our protocol can be refined to suit to different delay requirements of a network.