袁一凌同学论文《An Iterative Matching-Stackelberg Game Model for Channel-Power Allocation in D2D Underlaid Cellular Networks》被IEEE Transactions on Wireless Communications(TWC)录用

  复旦大学数字信号处理与传输实验室的袁一凌同学的论文"An Iterative Matching-Stackelberg Game Model for Channel-Power Allocation in D2D Underlaid Cellular Networks",被IEEE Transactions on Wireless Communications(TWC)2018录用。

  论文摘要:In device-to-device (D2D) underlaid cellular networks, several D2D pairs can share one channel to improve the system throughput. Most existing works allow D2D pairs to reuse all the channels, which may incur complicated interference management. Therefore, each D2D pair is limited to reuse at most one channel to reduce overhead. We aim to maximize the throughput of D2D pairs while suppressing the interference to cellular links. However, the optimization problem is an intractable mixed integer non-linear programming (MINLP) problem. Meanwhile, as network size increases, acquiring the global channel state information (CSI) is expensive even impossible in practice. Therefore, we propose a novel local CSI based distributed channel-power allocation scheme. The base station (BS) broadcasts a control signal to indicate its received interference from D2D pairs. Upon this signal, each D2D pair executes channel selection and power update independently and iteratively. Specifically, the channel allocation problem is formulated as a many-to-one matching game with externalities. The power control problem is modeled as a Stackelberg game. We prove the existence of two-sided swap-stable matching and show that the outcomes of the Stackelberg game are locally optimal under some mild conditions. Simulation results show that our scheme is efficient with low overhead.

  论文作者:Yiling Yuan, Tao Yang, Hui Feng and Bo Hu

发表评论