The performance of machine learning (ML)-based path loss models relies heavily on the data they use at their inputs. Feature engineering is, therefore, essential for the model's success. In this letter, at hand, we extract a new set of input features, based on image texture. The image that we use represents the footprint of the urban built-up area, where the gray scale values of the building blocks are analogue to their heights. We extract texture information by applying the segmentation-based fractal texture analysis algorithm on the orthogonal area that is bounded between the transmitter and the receiver. To the best of our knowledge this is the first time that such a technique is applied to a path loss modeling problem in electromagnetics. The algorithm, thus, delivers a new set of features, based on the image's texture, which eventually reveal the built-up profile of the area. These new features are injected to an already existing feature set. Comparative analysis shows that the addition of texture-based features leads to enhanced predictions, for a diverse set of transmitter heights, ML algorithms, and performance metrics.

Cooperative edge offloading to nearby end devices via Device-to-Device (D2D) links in edge networks with sliced computing resources has mainly been studied for end devices (helper nodes) that are stationary (or follow predetermined mobility paths) and for independent computation tasks. However, end devices are often mobile, and a given application request commonly requires a set of dependent computation tasks. We formulate a novel model for the cooperative edge offloading of dependent computation tasks to mobile helper nodes. We model the task dependencies with a general task dependency graph. Our model employs the state-of-the-art deep-learning-based PECNet mobility model and offloads a task only when the sojourn time in the coverage area of a helper node or Multi-access Edge Computing (MEC) server is sufficiently long. We formulate the minimization problem for the consumed battery energy for task execution, task data transmission, and waiting for offloaded task results on end devices. We convert the resulting non-convex mixed integer nonlinear programming problem into an equivalent quadratically constrained quadratic programming (QCQP) problem, which we solve via a novel Energy-Efficient Task Offloading (EETO) algorithm. The numerical evaluations indicate that the EETO approach consistently reduces the battery energy consumption across a wide range of task complexities and task completion deadlines and can thus extend the battery lifetimes of mobile devices operating with sliced edge computing resources.

Dynamic spectrum sharing can provide many benefits to wireless networks operators. However, its efficiency requires sophisticated control mechanisms. The more context information is used by it, the higher performance of networks is expected. A facility for collecting this information, processing it, and controlling base stations managed by various network operators is a so‐called Radio Environment Map (REM) subsystem. This paper proposes REM‐based schemes for the allocation of base stations power levels in 4G/5G networks, while considering interference generated to a licensed network. It is assumed that both networks have different profiles of served users, e.g., area of their positions and movement, which opens opportunities for spectrum sharing. The proposed schemes have been evaluated by means of extensive system‐level simulations and compared with two widely adopted policy‐based spectrum sharing reference schemes. Simulation results show that dynamic schemes utilizing rich context information outperforms static, policy‐based spectrum sharing schemes.

Next generation 5G cellular networks are envisioned to accommodate an unprecedented massive amount of Internet of things (IoT) and user devices while providing high aggregate multi-user sum rates and low latencies. To this end, cloud radio access networks (CRAN), which operate at short radio frames and coordinate dense sets of spatially distributed radio heads, have been proposed. However, coordination of spatially and temporally denser resources for larger sets of user population implies considerable resource allocation complexity and significant system signalling overhead when associated with channel state information (CSI)-based resource allocation (RA) schemes. In this paper, we propose a novel solution that utilizes random forests as supervised machine learning approach to determine the resource allocation in multi-antenna CRAN systems based primarily on the position information of user terminals. Our simulation studies show that the proposed learning based RA scheme performs comparably to a CSI-based scheme in terms of spectral efficiency and is a promising approach to master the complexity in future cellular networks. When taking the system overhead into account, the proposed learning-based RA scheme, which utilizes position information, outperforms legacy CSI-based scheme by up to 100%. The most important factor influencing the performance of the proposed learning-based RA scheme is antenna orientation randomness and position inaccuracies. While the proposed random forests scheme is robust against position inaccuracies and changes in the propagation scenario, we complement our scheme with three approaches that restore most of the original performance when facing random antenna orientations of the user terminal.