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.

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.

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.

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.

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.

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.

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.

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.

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).

NPBMT: A Novel and Proficient Buffer Management Technique for Internet of Vehicle-Based DTNs

Delay Tolerant Networks(DTNs)have the major problem of message delay in the network due to a lack of endto-end connectivity between the nodes,especially when the nodes are mobile.The nodes in DTNs have limited buffer storage for storing delayed messages.This instantaneous sharing of data creates a low buffer/shortage problem.Consequently,buffer congestion would occur and there would be no more space available in the buffer for the upcoming messages.To address this problem a buffer management policy is proposed named“A Novel and Proficient Buffer Management Technique(NPBMT)for the Internet of Vehicle-Based DTNs”.NPBMT combines appropriate-size messages with the lowest Time-to-Live(TTL)and then drops a combination of the appropriate messages to accommodate the newly arrived messages.To evaluate the performance of the proposed technique comparison is done with Drop Oldest(DOL),Size Aware Drop(SAD),and Drop Larges(DLA).The proposed technique is implemented in the Opportunistic Network Environment(ONE)simulator.The shortest path mapbased movement model has been used as the movement path model for the nodes with the epidemic routing protocol.From the simulation results,a significant change has been observed in the delivery probability as the proposed policy delivered 380 messages,DOL delivered 186 messages,SAD delivered 190 messages,and DLA delivered only 95 messages.A significant decrease has been observed in the overhead ratio,as the SAD overhead ratio is 324.37,DLA overhead ratio is 266.74,and DOL and NPBMT overhead ratios are 141.89 and 52.85,respectively,which reveals a significant reduction of overhead ratio in NPBMT as compared to existing policies.The network latency average of DOL is 7785.5,DLA is 5898.42,and SAD is 5789.43 whereas the NPBMT latency average is 3909.4.This reveals that the proposed policy keeps the messages for a short time in the network,which reduces the overhead ratio.

基于DTN的空间网络互联服务研究综述

空间通信需求的迅猛增长促使空间通信向网络化和天地一体化的方向不断发展.空间网络具有子网异构、网络拓扑不断变化、链路传输延迟大、链路误码率高等特点.TCP/IP网络协议族需要连续稳定的网络连接和较短的传输时延,空间网络不能满足这些条件,因此相关协议不能直接应用于空间网络.延迟/中断容忍网络(delay/disruption tolerant network,DTN)是一种通用的面向消息的覆盖层网络体系结构,能够适应空间网络的特点,是实现空间网络互联的有效连接方式.首先阐述了DTN应用于空间网络互联服务(space internetworking service,SIS)的体系结构,分析了组成要素和工作模式,包含协议栈构成、消息转发机制、命名与寻址机制等,介绍了支撑空间DTN应用的LTP(licklider transmissionprotocol)协议,并给出了火星探测场景实例;然后针对路由机制、安全机制和服务质量控制3个重点研究方向,阐述了关键技术和进展情况,分析了存在的问题和下一步的研究方向;然后介绍了相关的开发、实践和飞行验证项目;最后分析了在中国开展基于DTN的SIS研究及应用前景.

DTN中依据报文质量的拥塞控制策略

为了解决受限网络环境所带来的低的递交率的问题,DTN(Delay Tolerant Networks)通常采用多拷贝路由(multiple-copy routing)机制来实现报文的有效递交。但在实际情况下,网络中节点的缓存是受限的,当网络中的总报文数大于所有节点的缓存容量和时,网络就发生了拥塞。针对网络拥塞,通过计算节点缓存中的报文质量(Quality of Message)以确定报文丢弃的优先级,合理地丢弃报文控制拥塞。仿真结果显示与其他拥塞控制策略相比,该路由策略能得到更好的网络性能。

基于历史信息预测转发概率的DTN路由算法

为了尽量减少网络先验知识的使用,提高消息转发成功率,提出了一种基于历史链接信息预测转发概率的算法,综合运用了冗余复制和相遇预测的转发策略,将消息逐步向到达目标节点传输预测概率较高的节点转发,通过二分法复制策略来增加消息转发成功的可能性,并采用了主动冗余消息删除机制.仿真实验表明,随着缓冲区的增大和节点规模的增大,该路由算法的性能明显优于Epidemic,PRoPHET和BSW算法,并且具有很好的网络适应性能.

一种新的效用冗余混合DTN路由算法

针对容迟网络(DTN)的高延迟、间歇性连接和资源受限等特点,提出一种新的效用冗余混合DTN路由算法NHRA。根据节点的相遇频率和连通时长等信息估算消息转发效用,指定消息在网络中的最大拷贝数,根据消息转发效用结合基于二叉树的方法来分配消息拷贝任务,实现消息的多路径并行传输,在提高传输性能的同时,有效地控制了网络开销。仿真实验结果表明,与现有相关算法相比,该算法可获得更高的消息传达率,并且花费的通信开销更低。

带有节点编码能力感知的DTN数据转发机制

网络编码方法能够有效地改善延迟容忍网络的数据传输效率,其关键问题在于合理地选择编码节点。提出了一种带有节点编码能力感知的延迟容忍网络数据转发机制。根据网络中节点运行的历史相遇信息,建立时间图模型以感知节点之间的连接态势,并根据平均相遇时间间隔、最短路径长度及可达率等3方面因素综合确定节点转发能力,进而以动态的方式选择编码节点。结果表明,所提出的策略能够有效地提高网络资源利用率,改善网络的性能。

基于概率延迟的DTN路由算法的设计

为了提高容迟(DTN)的传输效率,同时减小网络延迟和网络开销,借鉴链路状态算法,使用Dijkstra计算路由,并充分考虑了传输延迟、节点之间的连接性和历史因素,提出了一种基于概率延迟的DTN路由算法PD.模拟实验结果表明,PD在传输延迟较大的网络环境下,性能优于其它同类算法.

SA-DTN:基于节点社会活跃度的DTN路由研究

针对社会网络中每个节点移动区域的多少和在某个区域中停留时间的长短,给出了节点的社会活跃度(SA)概念,从而提出了在DTN网络中基于节点社会活跃度的路由。这种路由根据网络中节点的社会活跃度大小对下一跳节点进行限制。仿真结果表明,提出的路由在提高了递交率的同时,大大降低了网络开销。