.png){kind=icon}
返回
A collaborative multi-hop routing algorithm for maximum achievable rate
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jnca.2015.06.010.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper studies collaborative multi-hop communication technology in next generation wireless communications. We propose a collaborative multi-hop routing algorithm combined with clustering to improve network performance. To build the multi-hop routing with maximum achievable rate, a relation matrix is exploited to describe the possible coverage of network nodes. A clustering-based path strategy is presented to create the effective next-hop link. A collaboration strategy is proposed to construct collaborative matrix. And then by clustering and collaboration, a multi-hop routing with maximum achievable rate is successfully built. The effectiveness and the feasibility of the proposed methods are verified by simulation results. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Achievable rate
Collaborative routing
Optimal path
Multi-hop networks
Collaborative communication
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8
论文数:
3.7K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容