研究目的
To develop a distributed algorithm for relay pairing in bandwidth exchange (BE) based cooperative forwarding scenarios that maximizes the overall network utility.
研究成果
The proposed distributed algorithm (MPA) for relay pairing in BE-based cooperative forwarding scenarios outperforms existing approaches, offering performance improvements up to 20%. It is suitable for practical deployment despite potential latency issues.
研究不足
The iterative message updates may incur latency issues, and the algorithm might not always converge within the given number of iterations due to the loopy nature of the associated graphical model.
1：Experimental Design and Method Selection:
The study uses a message-passing framework to develop an efficient distributed solution for relay pairing in BE-based cooperative forwarding scenarios.
2：Sample Selection and Data Sources:
A single-cell network with N nodes uniformly distributed within a 1 km circle around the BS is considered.
3：List of Experimental Equipment and Materials:
The bandwidth and power are set to Wi = 1 MHz and P = 20 dBm, respectively. For the path loss model, κ = 6 × 106 and ν = 3 are used.
4：Experimental Procedures and Operational Workflow:
The proposed algorithm (MPA) is compared with existing techniques (DMA and EPA) in terms of average utility gain and its cumulative distribution.
5：Data Analysis Methods:
The performance is evaluated with linear utility (U(R) = R) and log utility (U(R) = log R).
独家科研数据包，助您复现前沿成果，加速创新突破
获取完整内容
