In vehicular networks, in-vehicle user equipment (UE) with limited battery capacity can achieve opportunistic energy saving by offloading energy-hungry workloads to vehicular edge computing nodes via ...vehicle-to-infrastructure links. However, how to determine the optimal portion of workload to be offloaded based on the dynamic states of energy consumption and latency in local computing, data transmission, workload execution and handover, is still an open issue. In this paper, we study the energy-efficient workload offloading problem and propose a low-complexity distributed solution based on consensus alternating direction method of multipliers. By incorporating a set of local variables for each UE, the original problem, in which the optimization variables of UEs are coupled together, is transformed into an equivalent general consensus problem with separable objectives and constraints. The consensus problem can be further decomposed into a bunch of subproblems, which are distributed across UEs and solved in parallel simultaneously. Finally, the proposed solution is validated based on a realistic road topology of Beijing, China. Simulation results have demonstrated that significant energy saving gain can be achieved by the proposed algorithm.
In the future 5G paradigm, billions of machinetype devices will be deployed to enable wide-area and ubiquitous data sensing, collection, and transmission. Considering the traffic characteristics of ...machine-to-machine (M2M) communications and the spectrum shortage dilemma, a cost-efficient solution is to share the underutilized spectrum allocated to human-to-human (H2H) users with M2M devices in an opportunistic manner. However, the implementation of large-scale spectrum sharing in 5G heterogeneous networks confronts many challenges, including lack of incentive mechanism, privacy leakage, security threats, and so on. This motivates us to develop a privacy-preserved, incentive-compatible, and spectrum-efficient framework based on blockchain, which is implemented in two stages. First, H2H users sign a contract with the base station for spectrum sharing, and receive dedicated payments based on their contributions. Next, the shared spectrum is allocated to M2M devices to maximize the total throughput. We elaborate the operation details of secure spectrum sharing, incentive mechanism design, and efficient spectrum allocation. A case study is presented to demonstrate the security and efficiency of the proposed framework. Finally, we outline several open issues and conclude this article.
The unprecedented growth of wireless data traffic not only challenges the design and evolution of the wireless network architecture, but also brings about profound opportunities to drive and improve ...future networks. Meanwhile, the evolution of communications and computing technologies can make the network edge, such as BSs or UEs, become intelligent and rich in terms of computing and communications capabilities, which intuitively enables big data analytics at the network edge. In this article, we propose to explore big data analytics to advance edge caching capability, which is considered as a promising approach to improve network efficiency and alleviate the high demand for the radio resource in future networks. The learning-based approaches for network edge caching are discussed, where a vast amount of data can be harnessed for content popularity estimation and proactive caching strategy design. An outlook of research directions, challenges, and opportunities is provided and discussed in depth. To validate the proposed solution, a case study and a performance evaluation are presented. Numerical studies show that several gains are achieved by employing learning- based schemes for edge caching.
Vehicular fog computing (VFC) has emerged as a promising solution to relieve the overload on the base station and reduce the processing delay during the peak time. The computation tasks can be ...offloaded from the base station to vehicular fog nodes by leveraging the under-utilized computation resources of nearby vehicles. However, the wide-area deployment of VFC still confronts several critical challenges, such as the lack of efficient incentive and task assignment mechanisms. In this paper, we address the above challenges and provide a solution to minimize the network delay from a contract-matching integration perspective. First, we propose an efficient incentive mechanism based on contract theoretical modeling. The contract is tailored for the unique characteristic of each vehicle type to maximize the expected utility of the base station. Next, we transform the task assignment problem into a two-sided matching problem between vehicles and user equipment. The formulated problem is solved by a pricing-based stable matching algorithm, which iteratively carries out the "propose" and "price-rising" procedures to derive a stable matching based on the dynamically updated preference lists. Finally, numerical results demonstrate that significant performance improvement can be achieved by the proposed scheme.
Blockchain has been regarded as a promising technology for IoT, since it provides significant solutions for decentralized networks that can address trust and security concerns, high maintenance cost ...problems, and so on. The decentralization provided by blockchain can be largely attributed to the use of a consensus mechanism, which enables peer-to-peer trading in a distributed manner without the involvement of any third party. This article starts by introducing the basic concept of blockchain and illustrating why a consensus mechanism plays an indispensable role in a blockchain enabled IoT system. Then we discuss the main ideas of two famous consensus mechanisms, PoW and PoS, and list their limitations in IoT. Next, two mainstream DAG based consensus mechanisms, the Tangle and Hashgraph, are reviewed to show why DAG consensus is more suitable for IoT system than PoW and PoS. Potential issues and challenges of DAG based consensus mechanisms to be addressed in the future are discussed in the last section.
Energy-efficiency (EE) is critical for device-to-device (D2D) enabled cellular networks due to limited battery capacity and severe cochannel interference. In this paper, we address the EE ...optimization problem by adopting a stable matching approach. The NP-hard joint resource allocation problem is formulated as a one-to-one matching problem under two-sided preferences, which vary dynamically with channel states and interference levels. A game-theoretic approach is employed to analyze the interactions and correlations among user equipments (UEs), and an iterative power allocation algorithm is developed to establish mutual preferences based on nonlinear fractional programing. We then employ the Gale-Shapley algorithm to match D2D pairs with cellular UEs, which is proved to be stable and weak Pareto optimal. We provide a theoretical analysis and description for implementation details and algorithmic complexity. We also extend the algorithm to address scalability issues in large-scale networks by developing tie-breaking and preference-deletion-based matching rules. Simulation results validate the theoretical analysis and demonstrate that significant performance gains of average EE and matching satisfactions can be achieved by the proposed algorithm.
By analogy with Internet of things, Internet of vehicles (IoV) that enables ubiquitous information exchange and content sharing among vehicles with little or no human intervention is a key enabler ...for the intelligent transportation industry. In this paper, we study how to combine both the physical and social layer information for realizing rapid content dissemination in device-to-device vehicle-to-vehicle (D2D-V2V)-based IoV networks. In the physical layer, headway distance of vehicles is modeled as a Wiener process, and the connection probability of D2D-V2V links is estimated by employing the Kolmogorov equation. In the social layer, the social relationship tightness that represents content selection similarities is obtained by Bayesian nonparametric learning based on real-world social big data, which are collected from the largest Chinese microblogging service Sina Weibo and the largest Chinese video-sharing site Youku. Then, a price-rising-based iterative matching algorithm is proposed to solve the formulated joint peer discovery, power control, and channel selection problem under various quality-of-service requirements. Finally, numerical results demonstrate the effectiveness and superiority of the proposed algorithm from the perspectives of weighted sum rate and matching satisfaction gains.
Vehicular fog computing has emerged as a complementary framework for edge computing by leveraging the under-utilized computational resources of vehicles. However, how to reduce task offloading delay, ...queuing delay, and handover cost with incomplete information while simultaneously ensuring privacy, fairness, and security remains an open issue. In this paper, we develop a secure and intelligent task offloading framework to address these challenges. We exploit blockchain and smart contract to facilitate fair task offloading and mitigate various security attacks. Then, we design a subjective logic-based trustfulness metric to quantify the possibility of task offloading success, and develop a trustfulness assessment mechanism. An online learning-based intelligent task offloading algorithm named QUeuing-delay aware, handOver-cost aware, and Trustfulness Aware Upper Confidence Bound (QUOTA-UCB) is proposed, which can learn the long-term optimal strategy and achieve a well-balanced tradeoff among task offloading delay, queuing delay, and handover cost. Finally, extensive theoretical analysis and simulations are carried out to demonstrate the reliability, feasibility, and efficiency of the proposed secure and intelligent task offloading scheme.
The non-regenerative massive multi-input-multioutput (MIMO) non-orthogonal multiple access (NOMA) relay systems are introduced in this paper. The NOMA is invoked with a superposition coding technique ...at the transmitter and successive interference cancellation (SIC) technique at the receiver. In addition, a maximum mean square error-SIC receiver design is adopted. With the aid of deterministic equivalent and matrix analysis tools, a closed-form expression of the signal to interference plus noise ratio (SINR) is derived. To characterize the performance of the considered systems, closed-form expressions of the capacity and sum rate are further obtained based on the derived SINR expression. Insights from the derived analytical results demonstrate that the ratio between the transmitter antenna number and the relay number is a dominate factor of the system performance. Afterward, the correctness of the derived expressions are verified by the Monte Carlo simulations with numerical results. Simulation results also illustrate that: 1) the transmitter antenna, averaged power value, and user number display the positive correlations on the capacity and sum rate performances, whereas the relay number displays a negative correlation on the performance and 2) the combined massive-MIMO-NOMA scheme is capable of achieving higher capacity performance compared with the conventional MIMONOMA, relay-assisted NOMA, and massive-MIMO orthogonal multiple access (OMA) scheme.
In the Internet of Health Things (IoHT)-based e-Health paradigm, a large number of computational-intensive tasks have to be offloaded from resource-limited IoHT devices to proximal powerful edge ...servers to reduce latency and improve energy efficiency. However, the lack of global state information (GSI), the adversarial competition among multiple IoHT devices, and the ultra reliable and low latency communication (URLLC) constraints have imposed new challenges for task offloading optimization. In this article, we formulate the task offloading problem as an adversarial multi-armed bandit (MAB) problem. In addition to the average-based performance metrics, bound violation probability, occurrence probability of extreme events, and statistical properties of excess values are employed to characterize URLLC constraints. Then, we propose a URLLC-aware Task Offloading scheme based on the exponential-weight algorithm for exploration and exploitation (EXP3) named UTO-EXP3. URLLC awareness is achieved by dynamically balancing the URLLC constraint deficits and energy consumption through online learning. We provide a rigorous theoretical analysis to show that guaranteed performance with a bounded deviation can be achieved by UTO-EXP3 based on only local information. Finally, the effectiveness and reliability of UTO-EXP3 are validated through simulation results.
PDF
