基于社会关系的低时延机会网络路由算法
首发时间:2017-01-23
摘要:针对现有的基于历史信息预测预测的机会网络路由算法(HBPR)在归属位置单元表更新阶段存在的开销冗余和消息转发阶段存在中继节点选择不合理等问题,提出了一种基于社会关系的低时延机会网络路由算法-LDSR(an Low Delay Routing Algorithm for Opportunistic Networks based on Social Relations)。LDSR算法通过简化交换的归属位置单元表信息来减少通信开销,并且采用以考虑节点的社会关系为主,以不断缩短源节点归属位置和目的节点归属位置之间距离为辅的路由选择策略,缩短了消息的传输时延。仿真结果表明:LDSR算法在消息投递成功率、平均端到端时延和更新单元表所耗的开销等方面性能均优于HBPR路由算法。
For information in English, please click here
An Low Delay Routing Algorithm for Opportunistic Networks Based on Social Relations
Abstract:In this paper, based on the problems that history based prediction for routing in frastructure-less opportunistic networks(HBPR) exists that the exchange of control information has redundant overhead and forwarding nodes' selection is unsuitable, the article proposes a social relations based routing algorithm for low time delay in opportunistic networks(LDSR). LDSR algorithm through simplifies some control information of home location cell to reduce the communication cost, selecting some nodes closely related to destination node as relay nodes is main routing strategy, and selecting some nodes shortening distance between node carrying message and destination nodes' home location cell as relay nodes is assistant routing strategy to reduce the transmission delay of message. Simulation results show that LDSR outperforms the HBPR algorithm in terms of message delivery success ratio, average end-to-end delay, cost of update cell table.
Keywords: Opportunistic network Social relations Home location cell History table
基金:
论文图表:
引用
No.4717015117953314****
同行评议
共计0人参与
勘误表
基于社会关系的低时延机会网络路由算法
评论
全部评论0/1000