In this paper, we propose effective channel assignment algorithms for network utility maximization in a cellular network with underlaying device-to-device (D2D) communications. A major innovation is the consideration of partial channel state information (CSI), i.e., the base station (BS) is assumed to be able to acquire partial' instantaneous CSI of the cellular and D2D links, as well as, the interference links. In contrast to existing works, multiple D2D links are allowed to share the same channel, and the quality of service (QoS) requirements for both the cellular and D2D links are enforced. We first develop an optimal channel assignment algorithm based on dynamic programming (DP), which enjoys a much lower complexity compared to exhaustive search and will serve as a performance benchmark. To further reduce complexity, we propose a cluster-based sub-optimal channel assignment algorithm. New closed-form expressions for the expected weighted sum-rate and the successful transmission probabilities are also derived. Simulation results verify the effectiveness of the proposed algorithms. Moreover, by comparing different partial CSI scenarios, we observe that the CSI of the D2D communication links and the interference links from the D2D transmitters to the BS significantly affects the network performance, while the CSI of the interference links from the BS to the D2D receivers only has a negligible impact.
In device-to-device (D2D) communications, channel state information (CSI) is exploited to manage the interference between D2D users and regular cellular users (CUs) and improve system performance. However, obtaining the accurate CSI is usually difficult and causes high overhead, particularly when the links are not connected to the base station (BS), such as the links between regular CUs and D2D receivers (CU-D links). In this paper, we investigate the signaling overhead and performance tradeoff in D2D communications with channel uncertainty. To limit interference to regular CUs, we only allow the resource of a CU to be reused by, at most, one D2D pair. We also assume that only partial CSI of the CU-D links is available at the BS and develop two different strategies to deal with the channel uncertainty, namely, probabilistic and partial feedback schemes. We first derive a probability-based resource-allocation scheme by utilizing channel statistical characteristics to maximize the overall throughput of the CUs and admissible D2D pairs while guaranteeing their quality of service (QoS) in terms of signal-to-interference-plus-noise ratio (SINR) and outage probability, respectively. Then, we propose an efficient feedback scheme to reduce the overhead of CSI feedback while providing near-optimal performance. In addition, we propose a combined scheme to take advantages of both probabilistic and partial feedback schemes. It is shown by simulation that there exists an optimal threshold of the outage probability for probabilistic scheme while the partial feedback scheme is robust to the channel models. Furthermore, the combined scheme outperforms the probabilistic and the partial feedback schemes in terms of overall throughput. The basic idea of device-to-device (D2D) communication is that pairs of suitably selected wireless devices reuse the cellular spectrum to establish direct communication links, provided that the adverse effects of D2D communication on cellular users are minimized and that cellular users are given higher priority in using limited wireless resources. Despite its great potential in terms of coverage and capacity performance, implementing this new concept poses some challenges, particularly with respect to radio resource management. The main challenges arise from a strong need for distributed D2D solutions that operate in the absence of precise channel and network knowledge. To address this challenge, this paper studies a resource allocation problem in a single-cell wireless network with multiple D2D users sharing the available radio frequency channels with cellular users. We consider a realistic scenario where the base station (BS) is provided with strictly limited channel knowledge, whereas D2D and cellular users have no information. We prove a lower bound for the cellular aggregate utility in the downlink with fixed BS power, which allows for decoupling the channel allocation and D2D power control problems. An efficient graph-theoretical approach is proposed to perform channel allocation, which offers flexibility with respect to allocation criteria (aggregate utility maximization, fairness, and quality-of-service (QoS) guarantee). We model the power control problem as a multiagent learning game. We show that the game is an exact potential game with noisy rewards, which is defined on a discrete strategy set, and characterize the set of Nash equilibria. Q-learning better-reply dynamics is then used to achieve equilibrium.