78 research outputs found

    Device-to-Device Communications in the Millimeter Wave Band: A Novel Distributed Mechanism

    Full text link
    In spite of its potential advantages, the large-scale implementation of the device-to-device (D2D) communications has yet to be realized, mainly due to severe interference and lack of enough bandwidth in the microwave (μ\muW) band. Recently, exploiting the millimeter wave (mmW) band for D2D communications has attracted considerable attention as a potential solution to these challenges. However, its severe sensitivity to blockage along with its directional nature make the utilization of the mmW band a challenging task as it requires line-of-sight (LOS) link detection and careful beam alignment between the D2D transceivers. In this paper, we propose a novel distributed mechanism which enables the D2D devices to discover unblocked LOS links for the mmW band communication. Moreover, as such LOS links are not always available, the proposed mechanism allows the D2D devices to switch to the μ\muW band if necessary. In addition, the proposed mechanism detects the direction of the LOS links to perform the beam alignment. We have used tools from stochastic geometry to evaluate the performance of the proposed mechanism in terms of the signal-to-interference-plus-noise ratio (SINR) coverage probability. The performance of the proposed algorithm is then compared to the one of the single band (i.e., μ\muW/mmW) communication. The simulation results show that the proposed mechanism considerably outperforms the single band communication.Comment: 6 Pages, 6 Figures, Accepted for presentation in Wireless Telecommunication Symposium (WTS'18

    A Delay-Aware Caching Algorithm for Wireless D2D Caching Networks

    Full text link
    Recently, wireless caching techniques have been studied to satisfy lower delay requirements and offload traffic from peak periods. By storing parts of the popular files at the mobile users, users can locate some of their requested files in their own caches or the caches at their neighbors. In the latter case, when a user receives files from its neighbors, device-to-device (D2D) communication is enabled. D2D communication underlaid with cellular networks is also a new paradigm for the upcoming 5G wireless systems. By allowing a pair of adjacent D2D users to communicate directly, D2D communication can achieve higher throughput, better energy efficiency and lower traffic delay. In this work, we propose a very efficient caching algorithm for D2D-enabled cellular networks to minimize the average transmission delay. Instead of searching over all possible solutions, our algorithm finds out the best pairs, which provide the best delay improvement in each loop to form a caching policy with very low transmission delay and high throughput. This algorithm is also extended to address a more general scenario, in which the distributions of fading coefficients and values of system parameters potentially change over time. Via numerical results, the superiority of the proposed algorithm is verified by comparing it with a naive algorithm, in which all users simply cache their favorite files

    Spectral and Energy Efficient D2D Communication Underlay 5G Networks: A Mixed Strategy Approach

    Get PDF
    4G is now deployed all over the world, but requirements are about to change rapidly face to the exponential growth on devices number, local service applications and spectrum scarce. To deal with that, 5G networks integrated Device To Device (D2D) communication as a key technology in its evolving architecture. From 3GPP Rel-12 to Rel-16, D2D succeeded to improve network capacity by enhancing spectrum reuse, data rates and reducing end-to-end latency. However, despite all these advantages, it implies new challenges in 5G system design as interference, spectrum and energy consumption. As a contribution, we propose in this paper a joint spectrum and energy efficient resource allocation algorithm for D2D communications. This approach maximizes the total spectrum efficiency and reduces UEs power consumption. Contrarily to most of previous studies on resource allocation problems considering only centralized and pure strategies approaches, we propose a distributed algorithm based on new mathematical game theory model as an interpretation of mixed strategy non cooperative game. We extend our previous research, by focusing on power consumption issue. Our proposed solution enhances joint SE/EE tradeoff by minimizing interferences and power consumption via a smart RB allocation. This new approach allows users to adopt more accurate strategies and maximize their utilities according to the random network behavior

    Delay QoS Provisioning and Optimal Resource Allocation for Wireless Networks

    Get PDF
    Recent years have witnessed a significant growth in wireless communication and networking due to the exponential growth in mobile applications and smart devices, fueling unprecedented increase in both mobile data traffic and energy demand. Among such data traffic, real-time data transmissions in wireless systems require certain quality of service (QoS) constraints e.g., in terms of delay, buffer overflow or packet drop/loss probabilities, so that acceptable performance levels can be guaranteed for the end-users, especially in delay sensitive scenarios, such as live video transmission, interactive video (e.g., teleconferencing), and mobile online gaming. With this motivation, statistical queuing constraints are considered in this thesis, imposed as limitations on the decay rate of buffer overflow probabilities. In particular, the throughput and energy efficiency of different types of wireless network models are analyzed under QoS constraints, and optimal resource allocation algorithms are proposed to maximize the throughput or minimize the delay. In the first part of the thesis, the throughput and energy efficiency analysis for hybrid automatic repeat request (HARQ) protocols are conducted under QoS constraints. Approximations are employed for small QoS exponent values in order to obtain closed-form expressions for the throughput and energy efficiency metrics. Also, the impact of random arrivals, deadline constraints, outage probability and QoS constraints are studied. For the same system setting, the throughput of HARQ system is also analyzed using a recurrence approach, which provides more accurate results for any value of the QoS exponent. Similarly, random arrival models and deadline constraints are considered, and these results are further extended to the finite-blocklength coding regime. Next, cooperative relay networks are considered under QoS constraints. Specifically, the throughput performance in the two-hop relay channel, two-way relay channel, and multi-source multi-destination relay networks is analyzed. Finite-blocklength codes are considered for the two-hop relay channel, and optimization over the error probabilities is investigated. For the multi-source multi-destination relay network model, the throughput for both cases of with and without CSI at the transmitter sides is studied. When there is perfect CSI at the transmitter, transmission rates can be varied according to instantaneous channel conditions. When CSI is not available at the transmitter side, transmissions are performed at fixed rates, and decoding failures lead to retransmission requests via an ARQ protocol. Following the analysis of cooperative networks, the performance of both half-duplex and full-duplex operations is studied for the two-way multiple input multiple output (MIMO) system under QoS constraints. In full-duplex mode, the self-interference inflicted on the reception of a user due to simultaneous transmissions from the same user is taken into account. In this setting, the system throughput is formulated by considering the sum of the effective capacities of the users in both half-duplex and full-duplex modes. The low signal to noise ratio (SNR) regime is considered and the optimal transmission/power-allocation strategies are characterized by identifying the optimal input covariance matrices. Next, mode selection and resource allocation for device-to-device (D2D) cellular networks are studied. As the starting point, ransmission mode selection and resource allocation are analyzed for a time-division multiplexed (TDM) cellular network with one cellular user, one base station, and a pair of D2D users under rate and QoS constraints. For a more complicated setting with multiple cellular and D2D users, two joint mode selection and resource allocation algorithms are proposed. In the first algorithm, the channel allocation problem is formulated as a maximum-weight matching problem, which can be solved by employing the Hungarian algorithm. In the second algorithm, the problem is divided into three subproblems, namely user partition, power allocation and channel assignment, and a novel three-step method is proposed by combining the algorithms designed for the three subproblems. In the final part of the thesis, resource allocation algorithms are investigated for content delivery over wireless networks. Three different systems are considered. Initially, a caching algorithm is designed, which minimizes the average delay of a single-cell network. The proposed algorithm is applicable in settings with very general popularity models, with no assumptions on how file popularity varies among different users, and this algorithm is further extended to a more general setting, in which the system parameters and the distributions of channel fading change over time. Next, for D2D cellular networks operating under deadline constraints, a scheduling algorithm is designed, which manages mode selection, channel allocation and power maximization with acceptable complexity. This proposed scheduling algorithm is designed based on the convex delay cost method for a D2D cellular network with deadline constraints in an OFDMA setting. Power optimization algorithms are proposed for all possible modes, based on our utility definition. Finally, a two-step intercell interference (ICI)-aware scheduling algorithm is proposed for cloud radio access networks (C-RANs), which performs user grouping and resource allocation with the goal of minimizing delay violation probability. A novel user grouping algorithm is developed for the user grouping step, which controls the interference among the users in the same group, and the channel assignment problem is formulated as a maximum-weight matching problem in the second step, which can be solved using standard algorithms in graph theory

    Resource Allocation and Performance Analysis of Cellular-assisted OFDMA Device-to-Device Communications

    Get PDF
    Resource allocation of cellular-assisted device-todevice (D2D) communication is very challenging when frequency reuse is considered among multiple D2D pairs within a cell, as intense inter D2D interference is difficult to tackle and generally causes extremely large signaling overhead for channel state information (CSI) acquisition. In this paper, a novel resource allocation framework for cellular-assisted D2D communication is developed with low signaling overhead while maintaining high system capacity. By utilizing the spatial dispersion property of D2D pairs, a geography-based sub-cell division strategy is proposed to divide the cell into multiple sub-cells and D2D pairs within one sub-cell are formed into one group. Then, sub-cell resource allocation is performed independently among sub-cells without the need of any prior knowledge of inter D2D interference. Under the proposed resource allocation framework, a tractable approximation for the inter D2D interference modelling is obtained and a computationally efficient expression for the average ergodic sum capacity of the cell is derived. The expression further allows us to obtain the optimal number of sub-cells, which is an important parameter for maximizing the average ergodic sum capacity of the cell. It is shown that with small CSI feedback, system capacity can be improved significantly by adopting the proposed resource allocation framework, especially in dense D2D deployed systems

    Resource Management for Cellular-Assisted Device-to-Device (D2D) Communications

    Get PDF
    Device-to-Device (D2D) communication has become a promising candidate for future wireless communication systems to improve the system spectral efficiency, while reducing the latency and energy consumption of individual communication. With the assistance of cellular network, D2D communications can greatly reduce the transmit distance by utilizing the spatial dispersive nature of ever increasing user devices. Further, substantial spectrum reuse gain can be achieved due to the short transmit distance of D2D communication. It, however, significantly complicates the resource management and performance analysis of D2D communication underlaid cellular networks. Despite an increasing amount of academic attention and industrial interests, how to evaluate the system performance advantages of D2D communications with resource management remains largely unknown. On account of the proximity requirement of D2D communication, the resource management of D2D communication generally consists of admission access control and resource allocation. Resource allocation of cellular assisted D2D communications is very challenging when frequency reuse is considered among multiple D2D pairs within a cell, as intense inter D2D interference is difficult to tackle and generally causes extremely large amount of signaling overheads for channel state information (CSI) acquisition. Hence, the first part of this thesis is devoted to the resource allocation of cellular assisted D2D communication and the performance analysis. A novel resource allocation scheme for cellular assisted D2D communication is developed with low signaling overhead, while maintaining high spectral efficiency. By utilizing the spatial dispersive nature of D2D pairs, a geography-based sub-cell division strategy is proposed to group the D2D pairs into multiple disjoint clusters, and sub-cell resource allocation is performed independently for the D2D pairs within each sub-cell without the need of any prior knowledge of inter D2D interference. Under the proposed resource allocation scheme, tractable approximation for the inter D2D interference modeling is obtained and a computationally efficient expression for the average ergodic sum capacity of the cell is derived. The expression further allows us to obtain the optimal number of sub-cells that maximizes the average ergodic sum capacity of the cell. It is shown that with small CSI feedback, the system capacity/spectral efficiency can be improved significantly by adopting the proposed resource allocation scheme, especially in dense D2D deployment scenario. The investigation of use cases for cellular assisted D2D communication is another important topic which has direct effect on the performance evaluation of D2D communication. Thanks to the spatial dispersive nature of devices, D2D communication can be utilized to harvest the vast amount of the idle computation power and storage space distributed at the devices, which yields sufficient capacities for performing computation-intensive and latency-critical tasks. Therefore, the second part of this thesis focuses on the D2D communication assisted Mobile Edge Computing (MEC) network. The admission access control of D2D communication is determined by both disciplines of mobile computing and wireless communications. Specifically, the energy minimization problem in D2D assisted MEC networks is addressed with the latency constraint of each individual task and the computing resource constraint of each computing entity. The energy minimization problem is formed as a two-stage optimization problem. At the first stage, an initial feasibility problem is formed to maximize the number of executed tasks, and the global energy minimization problem is tackled in the second stage while maintaining the maximum number of executed tasks. Both of the optimization problems in two stages are NP-hard, therefore a low-complexity algorithm is developed for the initial feasibility problem with a supplementary algorithm further proposed for energy minimization. Simulation results demonstrate the near-optimal performance of the proposed algorithms and the fact that the number of executed tasks is greatly increased and the energy consumption per executed task is significantly reduced with the assistance of D2D communication in MEC networks, especially in dense user scenario

    Survey on the state-of-the-art in device-to-device communication: A resource allocation perspective

    Get PDF
    Device to Device (D2D) communication takes advantage of the proximity between the communicating devices in order to achieve efficient resource utilization, improved throughput and energy efficiency, simultaneous serviceability and reduced latency. One of the main characteristics of D2D communication is reuse of the frequency resource in order to improve spectral efficiency of the system. Nevertheless, frequency reuse introduces significantly high interference levels thus necessitating efficient resource allocation algorithms that can enable simultaneous communication sessions through effective channel and/or power allocation. This survey paper presents a comprehensive investigation of the state-of-the-art resource allocation algorithms in D2D communication underlaying cellular networks. The surveyed algorithms are evaluated based on heterogeneous parameters which constitute the elementary features of a resource allocation algorithm in D2D paradigm. Additionally, in order to familiarize the readers with the basic design of the surveyed resource allocation algorithms, brief description of the mode of operation of each algorithm is presented. The surveyed algorithms are divided into four categories based on their technical doctrine i.e., conventional optimization based, Non-Orthogonal-MultipleAccess (NOMA) based, game theory based and machine learning based techniques. Towards the end, several open challenges are remarked as the future research directions in resource allocation for D2D communication
    corecore