arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1605.07692cs.NI
收藏

GROUPS-NET:多跳D2D网络中的群组会议感知路由

GROUPS-NET: Group Meetings Aware Routing in Multi-Hop D2D Networks

Ivan O. Nunes, Clayson Celes, Pedro O. S. Vaz de Melo, Antonio A. F. Loureiro

摘要:

在下一代蜂窝网络中,设备到设备(D2 D)通信已经被认为是基本特征。多跳D2 D网络的问题在于如何定义同时实现高递送率和低网络开销的转发算法。在本文中,我们的目标是了解组会议的属性,通过查看它们的结构和规律性,最终目标是将这些知识应用于D2 D多跳网络的转发算法的设计中。我们引入了一个转发协议,即GROUPS-NET,它知道社会团体的会议和他们的演变随着时间的推移。我们的算法是参数校准自由,不需要任何知识的社会网络结构的系统。特别是,不同于最先进的算法,GROUPS-NET不需要社区检测,这是一个复杂和昂贵的任务。我们使用不同的公开数据源验证我们的算法。在实际的大规模场景中,我们的算法实现了与最先进的解决方案大致相同的交付率,网络开销减少了40%。

英文摘要:

In the next generation cellular networks, device-to-device (D2D) communication is already considered a fundamental feature. A problem of multi-hop D2D networks is on how to define forwarding algorithms that achieve, at the same time, high delivery ratio and low network overhead. In this paper we aim to understand group meetings' properties by looking at their structure and regularity with the final goal of applying such knowledge in the design of a forwarding algorithm for D2D multi-hop networks. We introduce a forwarding protocol, namely GROUPS-NET, which is aware of social group meetings and their evolution over time. Our algorithm is parameter-calibration free and does not require any knowledge about the social network structure of the system. In particular, different from the state of the art algorithms, GROUPS-NET does not need communities detection, which is a complex and expensive task. We validate our algorithm using different publicly available data-sources. In real large scale scenarios, our algorithm achieves approximately the same delivery ratio of the state-of-art solution with up to 40% less network overhead.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑