摘要
由于移动节点间的相遇机会的不确定性,容迟网络采用机会转发机制完成分组的转发。这一机制要求节点以自愿合作的方式来完成消息转发。然而,在现实中,绝大多数的节点表现出自私行为。针对节点的自私行为,提出了基于信任蚁群的自组织路由算法TrACO(Trust Ant Clone Optimization)。该算法利用蚁群算法基于群空间的搜索能力和快速的自适应学习特性,能够适应容迟网络动态复杂多变的网络环境。最后对TrACO进行性能仿真分析,仿真结果表明TrACO能够在较低的消息冗余度和丢弃数下获得较高的分组转发率和较低的消息传输时延,表现出较强的挫败节点自私行为的能力。
Due to the uncertainty of encounter opportunities between mobile nodes, delay tolerant net- works exploit the opportunistic forwarding mechanism to forward messages, thus it requires nodes to for- ward messages in a voluntary cooperation way. However, most of the nodes exhibit the character of self- ish. A trust ant colony self-organization routing algorithm , called the trust ant clone optimization （TrA- CO） is proposed. The algorithm with the characteristics of ant colony algorithm ability of fast space search and adaptive learning can be used in the complex and dynamic environment of delay tolerant net- work. The TrACO performance analysis is evaluated in the simulations. Simulation results show that the TrACO can achieve acceptable delivery ratio with low end-to-end delay and low redundancy of messages. It can effectively frustrate selfish behaviors of nodes.
出处
《南京邮电大学学报（自然科学版）》
北大核心
2014年第2期57-64,共8页
Journal of Nanjing University of Posts and Telecommunications：Natural Science Edition
基金
国家自然科学基金(61071092)
东南大学移动通信重点实验室开放基金(2011D04)
中国博士后科学基金(2012M511309)
江苏省博士后科研资助计划(1101125C)
教育部重点实验室开放研究基金(NYKL201102)资助项目
关键词
容迟网络
蚁群算法
信任路由
节点连通性
delay tolerant network
ant colony algorithm
trust routing
node connection
