Hypercube-Based Multipath Social Feature Routing in Human Contact Networks
Hypercube-Based Multipath Social Feature Routing in Human Contact Networks
复制标题
DOI：
10.1109/tc.2012.209
复制
发表时间：
2014-02
影响因子：
3.7
通讯作者：
Jie Wu;Yunsheng Wang
中科院分区：
文献类型：
--
作者：
Jie Wu;Yunsheng Wang
大多数容迟网络的路由协议都依赖于足够的状态信息，包括轨迹信息和联系信息，以保证路由效率。然而，状态信息往往是动态的，如果没有全局和/或长期的收集过程，很难获得。在本文中，我们使用的内部社会功能的每个节点在网络中执行路由过程。通过这种方式，基于特征的布线将高度移动的和非结构化的接触空间中的布线问题转换为静态和结构化的特征空间。这种方法的动机来自几个人类接触网络，例如Infocom 2006跟踪和MIT现实挖掘数据，如果人们有更多的共同社交特征，他们会更频繁地相互联系。我们的方法包括两个独特的过程：社会特征提取和多路径路由。在社会特征提取中，我们使用熵来提取m个信息量最大的社会特征，以创建特征空间（F空间）：（F1，F2，...，Fm），其中Fi对应于特征。然后，路由方法变成基于超立方体的特征匹配过程，其中路由过程是逐步特征差异解决过程。我们提供了两种特殊的多路径路由方案：基于节点不相交的路由和基于委托的路由。与现有的几种方法，包括喷雾和等待路由，喷雾和焦点路由，和社会意识路由的基础上介数中心性和相似性进行了比较，在真实的和合成的痕迹进行了广泛的模拟。此外，多路径路由的有效性进行了评估和比较，单路径路由。
Most routing protocols for delay tolerant networks resort to the sufficient state information, including trajectory and contact information, to ensure routing efficiency. However, state information tends to be dynamic and hard to obtain without a global and/or long-term collection process. In this paper, we use the internal social features of each node in the network to perform the routing process. In this way, feature-based routing converts a routing problem in a highly mobile and unstructured contact space to a static and structured feature space. This approach is motivated from several human contact networks, such as the Infocom 2006 trace and MIT reality mining data, where people contact each other more frequently if they have more social features in common. Our approach includes two unique processes: social feature extraction and multipath routing. In social feature extraction, we use entropy to extract the m most informative social features to create a feature space (F-space): (F1, F2,..., Fm), where Fi corresponds to a feature. The routing method then becomes a hypercube-based feature matching process, where the routing process is a step-by-step feature difference resolving process. We offer two special multipath routing schemes: node-disjoint-based routing and delegation-based routing. Extensive simulations on both real and synthetic traces are conducted in comparison with several existing approaches, including spray-and-wait routing, spray-and-focus routing, and social-aware routing based on betweenness centrality and similarity. In addition, the effectiveness of multipath routing is evaluated and compared to that of single-path routing.