Game of Life Based Congestion Control Strategy in Delay Tolerant Networks
-
摘要: 为了应对容迟网络中拓扑结构剧烈变化、节点间连接频繁中断等问题，报文通常采用“存储—携带—转发”的方式进行传输：节点将报文存储在缓存中，携带报文直到遇到合适的机会才将报文转发给其他节点.因为缓存有限，这样的传输方式会使节点缓存溢出，导致拥塞的发生.在容迟网络环境下提出一种基于生命游戏的拥塞控制策略(game of life based congestion control strategy in delay tolerant networks, GLCCS)，并将其应用于Epidemic路由方式.GLCCS借鉴生命游戏的演化思想，依据邻居节点中持有特定报文的节点比例来决定节点本地缓存中相应报文的操作.同时还提出了基于全网信息的报文排队机制和丢弃策略，依据传递或者丢弃一个报文对整个网络投递成功率的影响，计算出报文的效用值，按照效用值对缓存中报文进行排队和丢弃.在机会网络模拟器ONE中对仿真移动模型和真实运动轨迹进行模拟，实验结果表明，GLCCS与其他拥塞控制策略相比提高了投递成功率，减小了网络时延、丢包率以及负载比率.Abstract: In delay tolerant networks, to deal with the problems that the topology of the network changes dramatically and the disconnections between nodes are prevalent, researchers propose the store-carry-forward protocols: nodes store the messages in buffers and may carry them for a long time until they encounter the proper next hops or the destination nodes. Because of the limited buffer capacity of nodes, this way of message transmission is bound to bring buffer overflows and then lead to network congestion. A congestion control strategy based on the game of life is proposed for delay tolerant networks in this paper and it is applied to classic Epidemic routing protocol. This strategy determines the specific operations of a message stored in the local buffer of node according to the proportion of the holders of this message in all the nodes’ neighbors. Furthermore, the policies of message queuing and dropping are designed. The utility value of a certain message is calculated based on the influence of delivering or dropping this message on the delivery ratio of the whole network, and the messages stored in the buffers are queued by the utility value. The messages with large utility values have high priority to send and the messages with small utility values are dropped. Experiments under movement model (which is the build-in model in the ONE) and real trajectories are carried out in the ONE. Simulation results show that the congestion control strategy based on the game of life significantly improves the delivery ratio compared with other congestion control strategies, while the delivery latency, packet loss rate and overhead ratio are reduced at the same time.
-
Keywords:
- delay tolerant networks (DTN) /
- game of life /
- Epidemic /
- queuing mechanism /
- dropping policy
-
-
期刊类型引用(7)
1. 姜磊，章小卫. 基于模糊隶属度邻域覆盖的三支分类决策. 计算机应用与软件. 2024(02): 271-278 . 
百度学术
2. 骆公志，张尚蕾. 基于正区域和投票式属性重要度的特征提取算法. 南京邮电大学学报(自然科学版). 2024(01): 79-89 . 百度学术
3. 王笑笑，巴婧，陈建军，宋晶晶，杨习贝. 超约简求解：效率与性能的提升. 计算机科学. 2023(02): 166-172 . 百度学术
4. 刘长顺，刘炎，宋晶晶，徐泰华. 基于论域离散度的属性约简算法. 山东大学学报(理学版). 2023(05): 26-35+52 . 百度学术
5. 张清华，艾志华，张金镇. 融合密度与邻域覆盖约简的分类方法. 陕西师范大学学报(自然科学版). 2022(03): 33-42 . 百度学术
6. 沈毅波. RBF神经网络在关联数据一致性挖掘中的应用. 福建电脑. 2022(08): 5-9 . 百度学术
7. 周长顺，徐久成，瞿康林，申凯丽，章磊. 一种基于改进邻域粗糙集中属性重要度的快速属性约简方法. 西北大学学报(自然科学版). 2022(05): 745-752 . 百度学术
其他类型引用(7)
计量
- 文章访问数: 945
- HTML全文浏览量: 0
- PDF下载量: 614
- 被引次数: 14
下载:
