当前位置: X-MOL 学术Peer-to-Peer Netw. Appl. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Low energy consumption routing algorithm based on message importance in opportunistic social networks
Peer-to-Peer Networking and Applications ( IF 3.3 ) Pub Date : 2021-01-18 , DOI: 10.1007/s12083-021-01072-y
Sheng Yin , Jia Wu , Genghua Yu

With the advent of the 5G era, the number and complexity of messages on the network has exploded. Some important information needs to be forwarded first. However, in traditional opportunistic networks, the importance of messages is not paid attention to, and messages are only transmitted on key nodes. Excessive dependence on key nodes will shorten the life cycle of the network. Therefore, we propose a message importance based low energy consumption routing (MILECR) algorithm. When forwarding the message, we consider the energy of the node and the importance of the message. It solves the problems of priority forwarding of important messages and fast energy consumption of key nodes. When the cache space is insufficient, we adopt the cache replacement strategy to ensure the maximum cache space. In the simulation experiment, we analyzed the influence of the number of nodes and cache space on the algorithm. The results show that the algorithm has good performance in terms of message delivery rate, message delay, and energy consumption.



中文翻译:

机会社会网络中基于消息重要性的低能耗路由算法

随着5G时代的到来,网络上消息的数量和复杂性激增。一些重要的信息需要首先转发。但是,在传统的机会网络中,消息的重要性并未得到重视,而消息仅在关键节点上传输。对关键节点的过度依赖将缩短网络的生命周期。因此,我们提出了一种基于消息重要性的低能耗路由(MILECR)算法。在转发消息时,我们考虑节点的能量和消息的重要性。解决了重要消息的优先转发和关键节点能耗快速的问题。当缓存空间不足时,我们采用缓存替换策略来确保最大的缓存空间。在模拟实验中 我们分析了节点数和缓存空间对算法的影响。结果表明,该算法在消息传递速率,消息延迟和能耗方面均具有良好的性能。

更新日期:2021-01-18
down
wechat
bug