اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDynamic Power Control for Delay-Aware Device-to-Device Communications
218
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we consider the dynamic power control for delay-aware D2D communications. The stochastic optimization problem is formulated as an infinite horizon average cost Markov decision process. To deal with the curse of dimensionality, we utilize the interference filtering property of the CSMA-like MAC protocol and derive a closed-form approximate priority function and the associated error bound using perturbation analysis. Based on the closed-form approximate priority function, we propose a low-complexity power control algorithm solving the per-stage optimization problem. The proposed solution is further shown to be asymptotically optimal for a sufficiently large carrier sensing distance. Finally, the proposed power control scheme is compared with various baselines through simulations, and it is shown that significant performance gain can be achieved.
قيم البحث
اقرأ أيضاً
Emerging applications involving device-to-device communication among wearable electronics require Gbps throughput, which can be achieved by utilizing millimeter wave (mmWave) frequency bands. When many such communicating devices are indoors in close
proximity, like in a train car or airplane cabin, interference can be a serious impairment. This paper uses stochastic geometry to analyze the performance of mmWave networks with a finite number of interferers in a finite network region. Prior work considered either lower carrier frequencies with different antenna and channel assumptions, or a network with an infinite spatial extent. In this paper, human users not only carry potentially interfering devices, but also act to block interfering signals. Using a sequence of simplifying assumptions, accurate expressions for coverage and rate are developed that capture the effects of key antenna characteristics like directivity and gain, and are a function of the finite area and number of users. The assumptions are validated through a combination of analysis and simulation. The main conclusions are that mmWave frequencies can provide Gbps throughput even with omni-directional transceiver antennas, and larger, more directive antenna arrays give better system performance.
In this paper, we investigate the coexistence of two technologies that have been put forward for the fifth generation (5G) of cellular networks, namely, network-assisted device-to-device (D2D) communications and massive MIMO (multiple-input multiple-
output). Potential benefits of both technologies are known individually, but the tradeoffs resulting from their coexistence have not been adequately addressed. To this end, we assume that D2D users reuse the downlink resources of cellular networks in an underlay fashion. In addition, multiple antennas at the BS are used in order to obtain precoding gains and simultaneously support multiple cellular users using multiuser or massive MIMO technique. Two metrics are considered, namely the average sum rate (ASR) and energy efficiency (EE). We derive tractable and directly computable expressions and study the tradeoffs between the ASR and EE as functions of the number of BS antennas, the number of cellular users and the density of D2D users within a given coverage area. Our results show that both the ASR and EE behave differently in scenarios with low and high density of D2D users, and that coexistence of underlay D2D communications and massive MIMO is mainly beneficial in low densities of D2D users.
This paper studies device to device (D2D) coded-caching with information theoretic security guarantees. A broadcast network consisting of a server, which has a library of files, and end users equipped with cache memories, is considered. Information t
heoretic security guarantees for confidentiality are imposed upon the files. The server populates the end user caches, after which D2D communications enable the delivery of the requested files. Accordingly, we require that a user must not have access to files it did not request, i.e., secure caching. First, a centralized coded caching scheme is provided by jointly optimizing the cache placement and delivery policies. Next, a decentralized coded caching scheme is developed that does not require the knowledge of the number of active users during the caching phase. Both schemes utilize non-perfect secret sharing and one-time pad keying, to guarantee secure caching. Furthermore, the proposed schemes provide secure delivery as a side benefit, i.e., any external entity which overhears the transmitted signals during the delivery phase cannot obtain any information about the database files. The proposed schemes provide the achievable upper bound on the minimum delivery sum rate. Lower bounds on the required transmission sum rate are also derived using cut-set arguments indicating the multiplicative gap between the lower and upper bounds. Numerical results indicate that the gap vanishes with increasing memory size. Overall, the work demonstrates the effectiveness of D2D communications in cache-aided systems even when confidentiality constraints are imposed at the participating nodes and against external eavesdroppers.
This paper proposes to deploy multiple reconfigurable intelligent surfaces (RISs) in device-to-device (D2D)-underlaid cellular systems. The uplink sum-rate of the system is maximized by jointly optimizing the transmit powers of the users, the pairing
of the cellular users (CUs) and D2D links, the receive beamforming of the base station (BS), and the configuration of the RISs, subject to the power limits and quality-of-service (QoS) of the users. To address the non-convexity of this problem, we develop a new block coordinate descent (BCD) framework which decouples the D2D-CU pairing, power allocation and receive beamforming, from the configuration of the RISs. Specifically, we derive closed-form expressions for the power allocation and receive beamforming under any D2D-CU pairing, which facilitates interpreting the D2D-CU pairing as a bipartite graph matching solved using the Hungarian algorithm. We transform the configuration of the RISs into a quadratically constrained quadratic program (QCQP) with multiple quadratic constraints. A low-complexity algorithm, named Riemannian manifold-based alternating direction method of multipliers (RM-ADMM), is developed to decompose the QCQP into simpler QCQPs with a single constraint each, and solve them efficiently in a decentralized manner. Simulations show that the proposed algorithm can significantly improve the sum-rate of the D2D-underlaid system with a reduced complexity, as compared to its alternative based on semidefinite relaxation (SDR).
This paper considers a cache-aided device-to-device (D2D) system where the users are equipped with cache memories of different size. During low traffic hours, a server places content in the users cache memories, knowing that the files requested by th
e users during peak traffic hours will have to be delivered by D2D transmissions only. The worst-case D2D delivery load is minimized by jointly designing the uncoded cache placement and linear coded D2D delivery. Next, a novel lower bound on the D2D delivery load with uncoded placement is proposed and used in explicitly characterizing the minimum D2D delivery load (MD2DDL) with uncoded placement for several cases of interest. In particular, having characterized the MD2DDL for equal cache sizes, it is shown that the same delivery load can be achieved in the network with users of unequal cache sizes, provided that the smallest cache size is greater than a certain threshold. The MD2DDL is also characterized in the small cache size regime, the large cache size regime, and the three-user case. Comparisons of the server-based delivery load with the D2D delivery load are provided. Finally, connections and mathematical parallels between cache-aided D2D systems and coded distributed computing (CDC) systems are discussed.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
