1,217 research outputs found
D2D Data Offloading in Vehicular Environments with Optimal Delivery Time Selection
Within the framework of a Device-to-Device (D2D) data offloading system for
cellular networks, we propose a Content Delivery Management System (CDMS) in
which the instant for transmitting a content to a requesting node, through a
D2D communication, is selected to minimize the energy consumption required for
transmission. The proposed system is particularly fit to highly dynamic
scenarios, such as vehicular networks, where the network topology changes at a
rate which is comparable with the order of magnitude of the delay tolerance. We
present an analytical framework able to predict the system performance, in
terms of energy consumption, using tools from the theory of point processes,
validating it through simulations, and provide a thorough performance
evaluation of the proposed CDMS, in terms of energy consumption and spectrum
use. Our performance analysis compares the energy consumption and spectrum use
obtained with the proposed scheme with the performance of two benchmark
systems. The first one is a plain classic cellular scheme, the second is a D2D
data offloading scheme (that we proposed in previous works) in which the D2D
transmissions are performed as soon as there is a device with the required
content within the maximum D2D transmission range..
Game-theoretic Resource Allocation Methods for Device-to-Device (D2D) Communication
Device-to-device (D2D) communication underlaying cellular networks allows
mobile devices such as smartphones and tablets to use the licensed spectrum
allocated to cellular services for direct peer-to-peer transmission. D2D
communication can use either one-hop transmission (i.e., in D2D direct
communication) or multi-hop cluster-based transmission (i.e., in D2D local area
networks). The D2D devices can compete or cooperate with each other to reuse
the radio resources in D2D networks. Therefore, resource allocation and access
for D2D communication can be treated as games. The theories behind these games
provide a variety of mathematical tools to effectively model and analyze the
individual or group behaviors of D2D users. In addition, game models can
provide distributed solutions to the resource allocation problems for D2D
communication. The aim of this article is to demonstrate the applications of
game-theoretic models to study the radio resource allocation issues in D2D
communication. The article also outlines several key open research directions.Comment: Accepted. IEEE Wireless Comms Mag. 201
A Delay-Aware Caching Algorithm for Wireless D2D Caching Networks
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
- …