Joint relay assignment and bandwidth allocation for all-to-one communication in cooperative networks. (2015)

• Record Type: Journal Article
• Authors: Xu, Hongli; Huang, Liusheng; Wang, Xinglong
• Is Part Of: International journal of ad hoc and ubiquitous computing. Volume 20:Number 2(2015)
• Page Start: 123
• Page End: 133
• Publication Date: 2015
• Subjects: cooperative communication -- relay assignment -- bandwidth allocation -- network throughput -- max-min fairness -- all-to-one communication -- cooperative networks -- throughput optimisation -- wireless mesh networks -- WMNs -- simulation; Ubiquitous computing -- Periodicals; Embedded computer systems -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Wireless communication systems -- Periodicals; Computer architecture -- Periodicals; 004.2
• Languages: English
• ISSNs: 1743-8225

Abstract

Bandwidth allocation and cooperative communication are two efficient ways for throughput optimisation in wireless mesh networks (WMNs). Accordingly, this paper pursues the throughput maximisation under all-to-one communication scene through cooperative communication and bandwidth allocation. As relay assignment plays an important role for cooperative communication, we first define the joint relay assignment and bandwidth allocation (JRB) problem, which is formulated into the integer program. As NP-Hardness, this paper then presents a distributed algorithm TRBA to solve the JRB problem. The analyses show that the proposed algorithm can reach the approximate performance of O(1) for the JRB problem. Moreover, another algorithm, called ITRBA, is proposed to improve the average throughput of all mesh nodes while still preserving the max-min fairness. Our simulation results demonstrate that the proposed algorithms can almost reach the same throughput as the optimal method, and improves the network throughputs about 20.0% more than that of the traditional method.