混沌交换与自毁裁决的机会网络链路优化算法  

Link optimization algorithm of opportunistic network based on chaotic switching and self destruct decision

作　　者：郑健江 陈长清[2] 刘艳 

机构地区：[1]重庆旅游职业学院公共基础部,重庆409000 [2]华中科技大学软件学院,武汉430074

出　　处：《计算机应用研究》2017年第4期1185-1188,共4页Application Research of Computers

基　　金：重庆市自然科学基金资助项目(CSTC2012jj A70007)

摘　　要：针对当前机会网络链路优化过程中存在的冗余开销严重与数据交换困难的问题,设计了基于混沌交换与自毁裁决优化机制的机会网络链路优化算法。首先,基于混沌交换,将第三方节点引入到链路初始化过程中的数据索引传递过程中,在数据交换前计算其自毁阈值,优化数据自毁采集流程;并对网络中全部低于自毁阈值的数据索引进行优化,同时以广播形式告知全网节点;然后利用索引中记录的数据产生时间字段来通告网络中已到达目的节点的数据,从而充分利用交换机会。仿真结果表明,与DT算法、Barter算法相比,所提算法的网络吞吐量最高,其机会网络中数据在链路中的端到端时延最低。In order to solve the problems such as redundancy overhead severely and data exchange difficulty in current opportunity network link optimization process, this paper proposed the link optimization algorithm of opportunistic network based on chaotic switching and se~ destruct decision. Firstly, it introduced the third-party nodes to link initialization data indexing transfer process through the chaotic switching. Before the exchange of data, it calculatied the self destruct threshold, optimized self destructing data acquisition process. Subsequently it optimized the dataindex which were lower than the self destruct threshold on network, also broadcasted the network nodes. And then it used the data recorded in the index field in time to notice network data which had arrived at the destination node, so as to make full use of trading opportunities. The simulation results show that compared with the traditional DT algorithm, Barter algorithm, this algorithm can effectively improve the network throughput, reduce the chance of data in the network link in the end-to-end delay, and it has obvious advantages.

关 键 词：机会网络 链路优化 混沌交换 数据索引 自毁阈值 

分 类 号：TP393.07[自动化与计算机技术—计算机应用技术]