A collaborative multi-hop routing algorithm for maximum achievable rate. (November 2015)

• Record Type: Journal Article
• Authors: Jiang, Dingde; Xu, Zhengzheng; Wang, Wenqin; Wang, Yuanting; Han, Yang
• Is Part Of: Journal of network and computer applications. Volume 57(2015)
• Page Start: 182
• Page End: 191
• Publication Date: 2015-11
• Subjects: Achievable rate -- Collaborative routing -- Optimal path -- Multi-hop networks -- Collaborative communication; Microcomputers -- Periodicals; Computer networks -- Periodicals; Application software -- Periodicals; Micro-ordinateurs -- Périodiques; Réseaux d'ordinateurs -- Périodiques; Logiciels d'application -- Périodiques; Application software; Computer networks; Microcomputers; Periodicals; 004.05; 004
• DOI: 10.1016/j.jnca.2015.06.010
• Languages: English
• ISSNs: 1084-8045

Abstract

Abstract: 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.