具有传输成功率保证的概率路由算法的TTL预测模型

概率路由算法是机会网络中一种常用的路由算法,其TTL的设置将直接影响路由的性能.本文首先利用马尔可夫链对概率路由的转发过程进行建模,并从消息的传输成功率和传输延时方面进行性能评估,不仅可以计算出一个消息从源节点到目的节点所需的传输延时,还可以预测出在给定传输成功率下所需要的最短消息生存周期TTL,这对于TTL的设置具有理论上的指导作用.其次,本文建立的预测模型还可以使一些无法到达目的节点的消息及时被删除,从而减少不必要的转发,达到节约网络资源的目的.最后,在两个真实数据集中的实验结果表明,本文提出的模型能够为概率路由中TTL值的准确设置提供有效参考.     

机会网络中基于节点暂态社区的消息转发策略

当前机会网络中消息转发策略大多是基于节点间的历史相遇消息选取与其他节点累积相遇能力强的节点作为中继节点。此类策略对节点能力的估计默认采用均匀量化的方式,但经观察发现节点中继能力并非均匀的,主要体现在节点移动模式在时间和地理位置上呈现出极强的聚集性,我们称之为节点的暂态特性。针对上述问题,本文提出了一种基于节点暂态特性的消息转发策略,将具有相似暂态特性的节点聚合成暂态社区,利用暂态社区内节点间的强连通性和不同暂态社区的时序特性来改善机会网络性能。仿真结果表明本文提出的策略能够有效提升消息的投递率,降低投递延时和网络开销。     

基于信誉值维护的机会网络自私节点检测机制

机会网络中自私节点的存在严重影响路由转发的性能。为在路由时避开此类节点、消除其对网络性能的影响,提出了一种基于信誉值维护的自私节点检测机制,通过两跳ACK消息来监测节点行为,利用监测信息计算节点的信誉值,并将其作为判断节点是否自私的依据。在多种路由算法上加载该检测机制进行仿真实验,结果表明该检测机制可准确识别机会网络中的自私节点,提高消息投递的成功率,并能有效控制消息副本数和网络开销。     

基于机会转发的飞行自组网集群路由算法

针对飞行自组织网络(Flying Ad Hoc Network, FANET)中高动态拓扑变化导致数据丢包率较高的问题，提出一种基于节点移动机会转发的集群路由算法CROF(Cluster Routing-Opportunity Forward)。该算法通过考虑节点相对移动趋势度和剩余能量的综合权值来统一对集群头节点以及集群间机会转发节点进行选择。仿真实验结果表明，CROF算法在高动态自组织网络中可以有效提高消息投递率以及网络生命周期。     

社区模型机会网络路由研究

当前,基于社区的机会网络研究在模型上还有待完善,在社区间的路由算法没有考虑消息的传输效率,只采用简单的分发等待路由算法,使得路由效率较低。为此,对社区模型进行了改进,加入节点回归因素,并在此模型下提出了新的路由算法NBR。在社区内采用混合路由算法,并加入了正反馈思想重新计算节点活跃度。在社区间采用查询路由表和判断节点回归相结合的方法,利用节点回归的特性提高转发效率。仿真结果表明,在改进后的社区模型下,NBR算法使得社区间和社区内的消息传输成功率得到了提升,有效的降低了网络资源的消耗。     

基于连接质量和节点相关度的机会网络路由

提出利用连接质量估计节点间消息成功转发的概率,并证明了节点间相关度越高,消息转发率越高。在此基础上,提出基于连接质量和节点相关度的机会网络路由机制。路由计算节点转发效用值时,综合了连接质量和节点相关度;消息转发时,不断向相对于目的节点转发效用值高的节点转发消息。仿真结果表明,与传统路由相比,在消息送达率相同的前提下,该路由消息延迟更小、消耗的总能量更少。     

一种控制消息广播与合并策略的低开销路由算法

针对现有基于社区的机会社会网络多副本消息传输机制中网络控制开销较大和网络资源浪费的问题,提出了一种基于广播策略的机会社会网络低开销路由算法.该算法采用了"ACK消息快速产生机制"和"控制消息合并机制"两种新机制,能够有效减少网络中数据消息副本不必要的转发次数和降低网络控制开销.理论分析和仿真验证表明,相较于现有的基于社区的消息机会传输路由算法和基于重叠社区的消息机会转发路由算法,所提算法能有效减少网络控制开销和节省网络资源.     

机会网络中自私行为影响的分析与调节

以往针对机会网络中节点自私性影响评估的研究,建立了多种分析模型,然而并未考虑如何应用这些理论模型.本文分别在网络无TTL限制和有TTL限制两种情况下,利用评估模型对自私节点的影响进行分析,并提出一种基于消息分类的自私模型,评估了自私节点对延迟和消息投递率的影响.分析表明,机会网络受自私节点的影响不仅与自私节点的数目有关,而且与节点的移动速度,消息传输范围有关.因此,可以通过调节这些参数提高网络的性能,减少自私节点的影响.首先,通过理论推导分别得出了2-hop路由和传染病路由在延迟保证下的合作节点数目和消息传输范围以及传染病路由在消息投递率保证下消息的TTL.随后,通过ONE仿真平台对自私节点影响的评估,证明自私行为影响下网络性能的理论值与实验值近似,并且证明了通过理论分析获得的参数值也与实验值近似.     

一种基于节点能量的机会网络概率路由算法

在机会网络中,节点之间可能不存在端到端的路径.为了节省网络中节点消耗的能量,在概率路由算法的基础上提出了一种基于节点能量的概率路由算法(Energy-based Probabilistic Routing Protocol using History of Encounters and Transitivity,EBPROPHET).首先,计算两个节点相遇时节点的通信开销,然后相遇节点的剩余能量作为一个参量引入算法,选择节点剩余能量多的节点作为转发节点,最后,进行消息的转发.仿真表明,EB-PROPHET算法具有良好的路由性能,降低了整个网络的能量消耗,延长了网络的生存周期.     

社区结构感知的间断连接无线网络路由机制

针对间断连接无线网络中消息投递成功率低的问题1依据网络中节点社会关系的差异性,提出了一种社区结构感知的路由机制.该机制根据节点在各个运动周期内的状态信息建立马尔可夫模型,以描述节点运动状态转换过程,进而以分布式的方式感知节点中心度,并以社区中心度为参数,采用社区标签交换方法对网络结构进行动态检测,最终利用社区内中心节点为中继辅助完成消息的转发.仿真结果表明,所提出的路由机制在投递率方面的性能改善程度接近90％,极大地优化了网络性能.     

基于社会属性的PSN消息路由算法

在PSN（pocket switched network）中实现数据传输成功率与传输延迟的有效平衡是当前有待解决的问题。提出一种基于社会属性的PSN路由算法——BridgingCom算法,该算法使用带有衰退机制的局部社区识别方法,引入桥接中心度（bridging centrality）作为中继节点的选择依据,将社会网络中节点重要性与移动社会网络的特征相结合,考虑了节点社区关系和节点活跃度对路由算法的影响。实验表明,该算法与现有经典算法相比能够获得较高的传输效率和较低的传输延迟。     

Egocentric network focused community aware multicast routing for DTNs

Multicasting for delay-tolerant networks (DTNs) in sparse social network scenarios is a challenge due to the deficiency of end-to-end paths. In social network scenarios, the behaviors of their nodes are controlled by human beings, and node mobility is the same as that of humans. To design the multicasting algorithms for DTNs, therefore, it would be promising to capture the intrinsic characteristics of relationships among these nodes. In this paper, multicasting in DTNs is regarded as a message dissemination issue in social networks, and an egocentric network focused community aware multicast routing algorithm (ENCAR) is proposed. As distinct from some social-based routing algorithms which only focus on centrality analysis, ENCAR is an utility based and hierarchical routing algorithm, its utility function is constructed on the basis of centrality analysis and destination-oriented contact probability. We take notice of clustering phenomenon in social networks, and present the community aware forwarding schemes. In addition, to simulate the mobility of individuals in social networks, a novel community based random way point mobility model is also presented. In this paper, the performance of ENCAR is theoretically analyzed and further evaluated on simulator ONE. Simulation results show that ENCAR outperforms most of the existing multicast routing algorithms in routing overhead, on condition that delivery ratio is relatively high, with other significant parameters guaranteed to perform well.     

Analysing social behaviour and message dissemination in human based delay tolerant network

Recent advances in mobile communication shows proliferation in networks formed by human carried devices known as the pocket switched network (PSN). Human beings are social animals. They tend to form groups and communities, and have repetitive mobility pattern which can be used to disseminate information in PSNs. In this paper, we give a deeper insight to the nature of community formation and how such information can be used to help opportunistic forwarding in mobile opportunistic networks. Using real world mobility traces, we first derive the adjacency list for each node and form the contact graph. Using tools from social network analysis we then determine various node properties like centrality and clustering coefficient and graph properties like average path length and modularity. Based on the derived graph properties, node encounter process and nature of message dissemination in PSNs, we propose two social based routing, known as the contact based routing and community aware two-hop routing. We compare the proposed routing techniques with generic epidemic and prophet routing and Bubble-Rap, a social based routing. Results show that the proposed algorithms is able to achieve better delivery ratio and lower delay than Bubble Rap, while reducing the high overhead ratio of epidemic and prophet routing.     

一种具有能量感知的多路径Ad hoc路由算法

该文针对无线移动Ad hoc网络的动态变化拓扑逻辑,存在单向链路,节点能量有限等特点,提出了一种具有能量感知的多路径路由算法。该算法是一种反应式的基于路径池的多路径路由算法,数据和应答消息的路由根据路由池中路径的性能尺度,即跳数、可靠性和剩余能量以一定的概率分布随机选择。路径的可靠性和剩余能量在数据传输过程中动态更新。仿真结果表明该算法能有效地延长网络的生存时间。     

Node centrality metric based caching mechanism in content-centric network

In order to reduce the cache redundancy as well as increase the cache hit ratios in content-centric networks,the node centrality metric based caching mechanism (CMC) was proposed.CMC utilized controllers to obtain the topology of the whole network and the idle rate of cache space.According to the connection relation of the topology,the degree centrality,closeness centrality and betweenness centrality of nodes were calculated.When CMC choose the caching nodes,it took the three metrics and the idle rate of cache space into account.Simulation results show that CMC can effectively increase the cache hit ratios and reduce the content fetching hops and average request delay compared with the traditional routing algorithms in CCN.     

Extension of Delay Tolerant Network’s Routing Protocols for Preventing Excessive Utilization of Resources

The routing algorithms of DTN have the inbuilt storage management scheme such as Hop based TTL (Spray and Wait) or passive cure (Potential-based Entropy Adaptive Routing PEAR). There has been a significant amount of work in the past regarding buffer management policies. In this paper, we have proposed a new message deletion policy for multi-copy routing schemes. In this scheme, message delivery information is communicated to the other nodes in the network for removing useless bundles from the network, which prevents the nodes from the buffer overflow problem and avoid transfer of useless message replicas thus relaxing the resources of the nodes. We evaluate our proposed method by simulating network, on four major DTNs routing algorithms: Epidemic, Spray and Wait, ProPHET and MaxProp. The simulation results clearly show significant improvement in the value of delivery probability and the overhead ratio for an Epidemic, Spray and Wait, and Prophet routing protocols.     

Interference Aware Route Discovery in Wireless Mobile Ad Hoc Networks

In this paper, we propose an interference aware expanding region search algorithm to locate a destination in mobile ad hoc networks. In the proposed approach, signal to interference plus noise ration (SINR) is used in place of TTL field of a route request packet. The source node initializes the search query with a threshold value of SINR. Each relay node forwards the packet if its SINR satisfies the threshold criteria provided by the source node in RREQ packet. As a result, the low SINR nodes are removed in route discovery phase prior to the establishment of routes. The simulation results show that proposed algorithm provides significant improvement in performance of reactive routing protocol in terms of reduced routing overhead, reduced energy consumption, and increased network throughput.

     

DTN中蔓延路由协议拥塞控制方案研究

针对在DTN中使用蔓延路由协议,受转发节点的缓存限制,导致递交率因网络拥塞而下降的问题,在分析比较几种报文丢弃策略的基础上,提出一种改进的拥塞控制方案。当拥塞发生时,对节点缓存中超过某个TTL门限的报文进行丢弃。将改善递交率作为主要参数,使用ONE仿真器对改进方案的性能进行仿真和比较。结果显示,这种方案很好地实现了拥塞控制。