延迟容忍网络中利用热点和熵进行数据转发的研究
On Exploiting Hotspot and Entropy for Data Forwarding in Delay Tolerant Networks
摘要:
延迟容忍网络(DTNs)中的数据转发性能的好处相当大,如果一个人可以利用人类的社会结构方面的移动性。然而,传统社交网络的解决方案计算节点的中心度和相似度是困难和耗时的,这主要是由于节点的瞬时接触和间歇连接的环境。在这项工作中,我们感兴趣的问题是:我们是否可以探索一些其他的稳定的社会属性来量化节点的中心性和相似性?从现实世界的GPS轨迹中,我们发现存在两个已知的现象。一个是公共热点,另一个是个人热点。出于这种观察,我们提出Hoten(热点和熵),一种新的路由度量,以提高DTNs的路由性能。首先,我们使用公共热点和个人热点之间的相对熵来计算节点的中心度。然后利用两个节点之间的个人热点的逆对称熵来计算它们之间的相似度。第三,我们利用节点的个人热点的熵来估计其个性。此外,我们提出了一种方法来确定热点的最佳大小。最后,我们通过大量的跟踪驱动的模拟比较我们的路由策略与其他国家的最先进的路由方案,结果表明,Hoten大大优于其他解决方案,特别是在组合开销/分组投递率和每消息的平均跳数。
英文摘要:
Performance of data forwarding in Delay Tolerant Networks (DTNs) benefits considerably if one can make use of human mobility in terms of social structures. However, it is difficult and time-consuming to calculate the centrality and similarity of nodes by using solutions for traditional social networks, this is mainly because of the transient node contact and the intermittently connected environment. In this work, we are interested in the following question: Can we explore some other stable social attributes to quantify the centrality and similarity of nodes? Taking GPS traces of human walks from the real world, we find that there exist two known phenomena. One is public hotspot, the other is personal hotspot. Motivated by this observation, we present Hoten (hotspot and entropy), a novel routing metric to improve routing performance in DTNs. First, we use the relative entropy between the public hotspots and the personal hotspots to compute the centrality of nodes. Then we utilize the inverse symmetrized entropy of the personal hotspots between two nodes to compute the similarity between them. Third, we exploit the entropy of personal hotspots of a node to estimate its personality. Besides, we propose a method to ascertain the optimized size of hotspot. Finally, we compare our routing strategy with other state-of-the-art routing schemes through extensive trace-driven simulations, the results show that Hoten largely outperforms other solutions, especially in terms of combined overhead/packet delivery ratio and the average number of hops per message.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。