.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Achievable rate
Collaborative routing
Optimal path
Multi-hop networks
Collaborative communication
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8
Papers:
3.7K
Citations:
1.1W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSaveShareSave
View more