کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
459456 | 696248 | 2015 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A collaborative multi-hop routing algorithm for maximum achievable rate
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Network and Computer Applications - Volume 57, November 2015, Pages 182–191
Journal: Journal of Network and Computer Applications - Volume 57, November 2015, Pages 182–191
نویسندگان
Dingde Jiang, Zhengzheng Xu, Wenqin Wang, Yuanting Wang, Yang Han,