Reasonable routing in delay/disruption tolerant networks

Delay/disruption tolerant networking （DTN） is an approach to networking where intermittent connectivity exists： it is often afforded by a store and forward technique. Depending on the capability of intermediary nodes to carry and forward messages, messages can be eventually delivered to their destination by mobile nodes with an appropriate routing protocol. To have achieved a successful delivery, most DTN routing protocols use message duplication methods. Although messages are rapidly transferred to the destination, the redundancy in the number of message copies increases rapidly. This paper presents a new routing scheme based on a stochastic process for epidemic routing. Message redundancy is efficiently reduced and the number of message copies is controlled reasonably. During the contact process of nodes in the network, the number of message copies changes, and according to the variability in the number of copies, we construct a special Markov chain, birth and death process, on the number of message copies then calculate and obtain a stationary distribution of the birth and death process. Comparing the theoretical model with the simulation we have performed we see similar results. Our method improves on time-to-live （TTL） and antipacket methods, in both redundancy and delivery success efficiency.

Energy Based Random Repeat Trust Computation in Delay Tolerant Network

As the use of mobile devices continues to rise,trust administration will significantly improve security in routing the guaranteed quality of service(QoS)supply in Mobile Ad Hoc Networks(MANET)due to the mobility of the nodes.There is no continuance of network communication between nodes in a delay-tolerant network(DTN).DTN is designed to complete recurring connections between nodes.This approach proposes a dynamic source routing protocol(DSR)based on a feed-forward neural network(FFNN)and energybased random repetition trust calculation in DTN.If another node is looking for a node that swerved off of its path in this situation,routing will fail since it won’t recognize it.However,in the suggested strategy,nodes do not stray from their pathways for routing.It is only likely that the message will reach the destination node if the nodes encounter their destination or an appropriate transitional node on their default mobility route,based on their pattern of mobility.The EBRRTC-DTN algorithm(Energy based random repeat trust computation)is based on the time that has passed since nodes last encountered the destination node.Compared to other existing techniques,simulation results show that this process makes the best decision and expertly determines the best and most appropriate route to send messages to the destination node,which improves routing performance,increases the number of delivered messages,and decreases delivery delay.Therefore,the suggested method is better at providing better QoS(Quality of Service)and increasing network lifetime,tolerating network system latency.

Application of Contact Graph Routing in Satellite Delay Tolerant Networks

Satellite networks have many inherent advantages over terrestrial networks and have become an important part of the global network infrastructure.Routing aimed at satellite networks has become a hot and challenging research topic.Satellite networks,which are special kind of Delay Tolerant Networks(DTN),can also adopt the routing solutions of DTN.Among the many routing proposals,Contact Graph Routing(CGR) is an excellent candidate,since it is designed particularly for use in highly deterministic space networks.The applicability of CGR in satellite networks is evaluated by utilizing the space oriented DTN gateway model based on OPNET(Optimized Network Engineering Tool).Link failures are solved with neighbor discovery mechanism and route recomputation.Earth observation scenario is used in the simulations to investigate CGR's performance.The results show that the CGR performances are better in terms of effectively utilizing satellite networks resources to calculate continuous route path and alternative route can be successfully calculated under link failures by utilizing fault tolerance scheme.

A Routing Strategy with Link Disruption Tolerance for Multilayered Satellite Networks

Link disruption has a considerable impact on routing in multilayered satellite networks, which includes predictable disruption from the periodic satellite motion and unpredictable disruption from communication faults. Based on the analysis on the predictability of satellite links, a link disruption routing strategy is proposed for multilayered satellite networks, where, a topology period is divided into non-uniform slots, and a routing table in each slot is calculated by the topology predictability of satellite networks, and a congestion control mechanism is proposed to ensure the reliable transmission of packets, and a flooding mechanism is given to deal with the routes selection in the case of unpredictable link disruption. This routing strategy is implemented on the satellite network simulation platform, the simulation results show that the strategy has less delay and higher link utilization, and can meet the routing requirements of multilayered satellite networks.

Cache-Assign-Forward Architecture for Efficient Communication in Hybrid Delay-Tolerant Networks

Delay-Tolerant Networks (DTNs) are wireless networks that often experience temporary, even long-duration partitioning. Current DTN researches mainly focus on pure delay-tolerant networks that are extreme environments within a limited application scope. It motivates the identification of a more reasonable and valuable DTN architecture, which can be applied in a wider range of environments to achieve interoperability between some networks suffering from frequent network partitioning, and other networks provided with stable and high speed Internet access. Such hybrid delay-tolerant networks have a lot of applications in real world. A novel and practical Cache-Assign-Forward (CAF) architecture is proposed as an appropriate approach to tie together such hybrid networks to achieve an efficient and flexible data communication. Based on CAF, we enhance the existing DTN routing protocols and apply them to complex hybrid delay-tolerant networks. Simulations show that CAF can improve DTN routing performance significantly in hybrid DTN environments.

A Fault Tolerance Scheme for Reliable Transfer in Delay Tolerant Networks

Delay Tolerant Network （DTN） is a class of networks that experience frequent and long-duration partitions due to sparse distribution of nodes. It has a broad prospect to new network applications for a better sealability, fault-tolerant, and high performance. In DTNs, path failure occurs frequently, so message transfer is not reliable. Sometimes it is required to change routing even in a very short period, resulting in transmission delay and reception delay. However, some well-known assumptions of traditional networks are no longer true in DTNs. In this paper, we study the problem of path failures in DTNs. The path failure process in DTNs is described when the path appears completely normal, completely failed and partially failed. Traditional approaches based on using precisely known network dynamics have not accounted for message losses. A new fault tolerant scheme to generate redundancy is to use erasure coding and full replication. This can greatly decrease the path failure rate. At last, a traffic DTN model is analyzed. Results reveal the superiority of our scheme in comparison to other present schemes.

Graph-based single-copy routing in delay tolerant networks

This paper presents a new graph-based single-copy routmg method m delay tolerant networks （DTN）. With time goes on in the networks, a DTN connectivity graph is constituted with mobility of nodes and communication, and a corresponding greedy tree is obtained using a greedy algorithm in DTN connectivity graph. While there are some bad nodes such as disabled nodes or selfish nodes in delay tolerant networks, the nodes can choose the next p^oper intermediate node to transmit the mes- sage by comparing the location of neighboring nodes in the greedy tree. The single-copy routing method is very appropriate for energy-constrained, storage-constrained and bandwidth-constrained applications such as mobile wireless DTN networks. We show that delivery ratio is increased significantly by using the graph-based single-copy routing when bad nodes exist.

Spray and Dynamic: Advanced Routing in Delay Tolerant Networks

This paper addresses the problem of routing in delay tolerant networks (DTNs). Delay tolerant networks are wireless networks where disconnections occur frequently due to mobility of nodes, failures of energy, the low density of nodes, or when the network extends over long distances. In these cases, traditional routing protocols that have been developed for mobile ad hoc networks prove to be ineffective to the extent of transmitting messages between nodes. To resolve this problem and improve the performance of routing in delay tolerant networks we propose a new routing protocol called Spray and Dynamic;this approach represents an improvement of the spray and wait protocol by combining it with the two protocols: MaxProp and the model of “transfer by delegation” (Custody Transfer). To implement our approach Spray and Dynamic, we have developed a DTN simulator according to DTN network architecture.

Analysis on topology control boundary conditions in delay tolerant wireless sensor networks

In wireless sensor networks(WSNs),nodes are often scheduled to alternate between working mode and sleeping mode from energy efficiency point of view.When delay is tolerable,it is not necessary to preserve network connectivity during activity(working or sleeping) scheduling,enabling more sensors to be switched to sleeping mode and thus more energy savings.In this paper,the nodal behavior in such delay-tolerant WSNs(DT-WSNs) is modeled and analyzed.The maximum hop count with a routing path is derived in order not to violate a given sensor-to-sink delay constraint,along with extensive simulation results.

Routing in Delay Tolerant Networks (DTN)<br>—Improved Routing with MaxProp and the Model of “Transfer by Delegation” (Custody Transfer)

In this paper, we address the problem of routing in delay tolerant networks (DTN). In such networks there is no guarantee of finding a complete communication path connecting the source and destination at any time, especially when the destination is not in the same region as the source, which makes traditional routing protocols inefficient in that transmission of the messages between nodes. We propose to combine the routing protocol MaxProp and the model of “transfer by delegation” (custody transfer) to improve the routing in DTN networks and to exploit nodes as common carriers of messages between the network partitioned. To implement this approach and assess those improvements and changes we developed a DTN simulator. Simulation examples are illustrated in the article.

A Location-Based Content Search Approach in Hybrid Delay Tolerant Networks

In Delay Tolerant Networks （DTNs）, the offiine users can, through the encountering nodes, use the specific peer-to-peer message routing approach to deliver messages to the destination. Thus, it solves the problem that users have the demands to deliver messages while they are temporarily not able to connect to the Internet. Therefore, by the characteristics of DTNs, people who are not online can still query some location based information, with the help of users using the same service in the nearby area. In this paper, we proposed a location-based content search approach. Based on the concept of three-tier area and hybrid node types, we presented four strategies to solve the query problem, namely, Data Replication, Query Replication, Data Reply, and Data Synchronization strategies. Especially we proposed a Message Queue Selection algorithm for message transferring. The priority concept is set associated with every message such that the most ＂important＂ one could be sent first. In this way, it can increase the query success ratio and reduce the query delay time. Finally, we evaluated our approach, and compared with other routing schemes. The simulation results showed that our proposed approach had better query efficiency and shorter delay.

On Exploiting Temporal, Social, and Geographical Relationships for Data Forwarding in Delay Tolerant Networks

Because of unpredictable node mobility and absence of global information in Delay Tolerant Networks (DTNs), effective data forwarding has become a significant challenge in such network. Currently, most of existing data forwarding mechanisms select nodes with high cumulative contact capability as forwarders. However, for the heterogeneity of the transient node contact patterns, these selection approaches may not be the best relay choices within a short time period. This paper proposes an appropriate data forwarding mechanism, which combines time, location, and social characteristics into one coordinate system, to improve the performance of data forwarding in DTNs. The Temporal-Social Relationship and the Temporal-Geographical Relationship reveal the implied connection information among these three factors. This mechanism is formulated and verified in the experimental studies of realistic DTN traces. The empirical results show that our proposed mechanism can achieve better performance compared to the existing schemes with similar forwarding costs (e.g. end-to-end delay and delivery success ratio).

Node Sociability Based Intelligent Routing for Post-Disaster Emergency Networks

In a post-disaster environment characterized by frequent interruptions in communication links,traditional wireless communication networks are ineffective.Although the“store-carry-forward”mechanism characteristic of Delay Tolerant Networks(DTNs)can transmit data from Internet of things devices to more reliable base stations or data centres,it also suffers from inefficient data transmission and excessive transmission delays.To address these challenges,we propose an intelligent routing strategy based on node sociability for post-disaster emergency network scenarios.First,we introduce an intelligent routing strategy based on node intimacy,which selects more suitable relay nodes and assigns the corresponding number of message copies based on comprehensive utility values.Second,we present an intelligent routing strategy based on geographical location of nodes to forward message replicas secondarily based on transmission utility values.Finally,experiments demonstrate the effectiveness of our proposed algorithm in terms of message delivery rate,network cost ratio and average transmission delay.

Fault Tolerant Control for Networked Control Systems with Packet Loss and Time Delay

In this paper,a fault tolerant control with the consideration of actuator fault for a networked control system （NCS） with packet loss is addressed.The NCS with data packet loss can be described as a switched system model.Packet loss dependent Lyapunov function is used and a fault tolerant controller is proposed respectively for arbitrary packet loss process and Markovian packet loss process.Considering a controlled plant with external energy-bounded disturbance,a robust H ∞ fault tolerant controller is designed for the NCS.These results are also expanded to the NCS with packet loss and networked-induced delay.Numerical examples are given to illustrate the effectiveness of the proposed design method.

Cooperative transmission in delay tolerant network

The delay tolerant network(DTN) is an emerging concept, which is used to describe the network, where the communication link may disrupt frequently. To cope with this problem, the DTN uses the store-carry-forward(SCF) transmission mode. With this policy, the messages in the DTN are transmitted based on the nodes' cooperation. However, the nodes may be selfish, so the source has to pay certain rewards for others to get their help. This paper studies the optimal incentive policy to maximize the source's final utility. First, it models the message spreading process as several ordinary differential equations(ODEs) based on the meanfield approximation. Then, it mathematically gets the optimal policy and explores the structure of the policy. Finally, it checks the accuracy of the ODEs model and shows the advantages of the optimal policy through simulation and theoretical results respectively.

Adaptive clustering hierarchy routing for delay tolerant network

Adaptive clustering hierarchy routing(ACHR) establishes a clusters-based hierarchical hybrid routing algorithm with two-hop local visibility for delay tolerant network(DTN).The major contribution of ACHR is the combination of single copy scheme and multi-copy scheme and the combination of hop-by-hop and multi-hop mechanism ACHR,which has the advantages in simplicity,availability and well-expansibility.The result shows that it can take advantage of the random communication opportunities and local network connectivity,and achieves 1.6 times delivery ratio and 60% overhead compared with its counterpart.

Considerations and Open Issues in Delay Tolerant Network’S (DTNs) Security

Delay Tolerant Network (DTN) addresses challenges of providing end-to-end service where end-to-end data forwarding paths may not exist. Security and privacy are crucial to the wide deployments of DTN. Without security and privacy guarantees, people are reluctant to accept such a new network paradigm. To address the security and privacy issues in DTNs, we in this paper have discussed the various open issues and challenges which need to be addressed to evolve the secure DTNs.

Fault Tolerant Synchronization for a General Complex DynamicalNetwork with Random Delay

A fault tolerant synchronization strategy is proposed to synchronize a complex network with random time delays and sensor faults. Random time delays over the network transmission are described by using Markov chains. Based on the Lyapunov stability theory and stochastic analysis, several passive fault tolerant synchronization criteria are derived,which can be described in the form of linear matrix inequalities. Finally,a numerical simulation example is carried out and the results show the validity of the proposed fault tolerant synchronization controller.

Offloading Mobile Data from Cellular Networks Through Peer-to-Peer WiFi Communication:A Subscribe-and-Send Architecture

Currently cellular networks do not have sufficient capacity to accommodate the exponential growth of mobile data requirements.Data can be delivered between mobile terminals through peer-to-peer WiFi communications(e.g.WiFi direct),but contacts between mobile terminals are frequently disrupted because of the user mobility.In this paper,we propose a Subscribe-and-Send architecture and an opportunistic forwarding protocol for it called HPRO.Under Subscribe-and-Send,a user subscribes contents on the Content Service Provider(CSP) but does not download the subscribed contents.Some users who have these contents deliver them to the subscribers through WiFi opportunistic peer-to-peer communications.Numerical simulations provide a robust evaluation of the forwarding performance and the traffic offloading performance of Subscribe-and-Send and HPRO.

Resource-constrained maximum network throughput on space networks

This paper investigates the maximum network through- put for resource-constrained space networks based on the delay and disruption-tolerant networking （DTN） architecture. Specifically, this paper proposes a methodology for calculating the maximum network throughput of multiple transmission tasks under storage and delay constraints over a space network. A mixed-integer linear programming （MILP） is formulated to solve this problem. Simula- tions results show that the proposed methodology can successfully calculate the optimal throughput of a space network under storage and delay constraints, as well as a clear, monotonic relationship between end-to-end delay and the maximum network throughput under storage constraints. At the same time, the optimization re- sults shine light on the routing and transport protocol design in space communication, which can be used to obtain the optimal network throughput.