首页 | 官方网站   微博 | 高级检索  
     

基于混沌交换与自毁裁决优化机制的机会网络链路优化算法
引用本文:郑健江,陈长清,刘艳.基于混沌交换与自毁裁决优化机制的机会网络链路优化算法[J].计算机应用研究,2017,34(4).
作者姓名:郑健江  陈长清  刘艳
作者单位:重庆旅游职业学院,华中科技大学,重庆旅游职业学院 公共基础部,重庆黔江
基金项目:重庆市自然科学(CSTC2012jjA70007)
摘    要:针对当前机会网络链路优化过程中存在的冗余开销严重,数据交换困难及自毁成本代价高昂的问题,本文设计了一种基于混沌交换与自毁裁决优化机制的机会网络链路优化算法。首先通过混沌交换的方式对链路初始化过程中的数据索引传递过程引入第三方节点,在数据交换前计算其自毁阈值,优化数据自毁采集流程。随后对网络中全部低于自毁阈值的数据索引进行优化,同时以广播形式告知全网节点,然后利用索引中记录的数据产生时间字段来通告网络中已到达目的节点的数据,从而充分利用交换机会,达到提高网络吞吐量和降低时延的效果。仿真结果表明,与传统的DT算法、Barter算法相比,本文算法能的网络吞吐量最高,其机会网络中数据在链路中的端到端时延最低。

关 键 词:机会网络  链路优化  混沌交换  数据索引  自毁阈值  
收稿时间:2016/2/24 0:00:00
修稿时间:2017/3/1 0:00:00

The Research and Simulation of link optimization algorithm with chaotic switching and self destruct mechanism optimization decision based on opportunistic network
Zheng Jianjiang,Chen Changqing and Liu Yan.The Research and Simulation of link optimization algorithm with chaotic switching and self destruct mechanism optimization decision based on opportunistic network[J].Application Research of Computers,2017,34(4).
Authors:Zheng Jianjiang  Chen Changqing and Liu Yan
Affiliation:Chongqing Vocational Institute of Tourism, Department of Public Basic, Chongqing Qianjiang, 409000, China,HuaZhong University of Science and Technology,Chongqing Jiaotong University
Abstract:In order to solve the problems that current opportunity network link optimization process in the presence of redundancy overhead severely, data exchange difficulty and self destruct cost costly problems, this paper designs a chaotic switching and self destructive decisions based on optimization mechanism for opportunistic networks link optimization algorithm. First through the chaotic switching to link initialization data indexing transfer process introduction of third-party nodes, before the exchange data calculation to self destruct threshold, self destructing data acquisition process optimization. Subsequently on network are lower than the self destruct threshold data index optimization, also in the form of broadcast told the network nodes, and then use the data recorded in the index field in time to notice network has arrived at the destination node of the data, so as to make full use of trading opportunities, to improve network throughput and reduce delay effect. 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, has obvious advantages.
Keywords:Opportunistic network  Link optimization  chaotic transaction  data index  self destruct threshold  
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号