The integration of artificial intelligence and edge computing has given rise to edge intelligence. Federated Learning (FL), as a key technology of edge intelligence, utilizes data and computation power on edge devices to achieve decentralized edge intelligence. The problem of incentive mechanism design and resource allocation in FL has been two key issues that hinder the smooth progress of the learning process. We study an edge intelligence network that supports multiple simultaneous FL services, and there are multiple task publishers seeking FL services and mobile device alliances providing services for them. We address these two key issues. First, how task publishers can incentivize device alliances to contribute resources to facilitate the execution of FL services. Second, how the device alliances allocate resources across multiple FL services that are in progress to enable bounded rational decision-making. In order to solve the former, we transform the incentive design under information asymmetry into a contract game problem. For the latter, we propose an evolutionary game model to adjust their resource allocation strategies, while considering the influence of bounded rationality and external factors on the decision-making of device alliances. The simulation results show that our incentive mechanism shows excellent performance in the case of information asymmetry. Additionally, We experimentally simulated the dynamic evolution of device alliance strategies.

Unmanned aerial vehicles (UAVs) equipped with high definition (HD) cameras, intelligent sensors, computing, and communication modules can be deployed to execute crowdsensing tasks by leveraging federated learning (FL), e.g., air quality perception and ground target detection. FL can reduce transmission stress and protect data privacy when training models, which is suitable for resource constrained Internet of UAVs. Nevertheless, the incentive issues about information asymmetry and bounded rationality impede the applications of FL-enabled Internet of UAVs. The existing FL incentive approaches focus on the risk-free condition, where task publishers are capable of making decisions with complete rationality by utilizing expected utility theory. In fact, task publishers under risk conditions are often bounded rational, whose risk-awareness makes the utility models more sophisticated. To overcome the above problems, we present a prospect theory (PT)-based incentive mechanism for FL-enabled Internet of UAVs. We first leverage PT to model the task publisher’s risk-awareness behavior and construct the subjective utility model. Thereafter, we utilize the framing effect of PT to design the optimal contract to maximize the subjective utility. Simulation results demonstrate that, compared with the baseline method, the proposed incentive mechanism has better performance.

Recent research has demonstrated that the heat induced by high data rate transmission could cause low-temperature burns. As a promising application for future wireless networks, unmanned aerial vehicle (UAV) communication is capable of providing high data rate transmission for ground users. Inspired by this progress, this article focuses on the resource allocation for the UAV scenario and proposes a novel framework to consider the newly mentioned phenomenon named by power-consumption outage (PCO). Specifically, we give the analysis of heat transfer model in the smartphone based on which we initially integrate the influence of PCO into the optimization problem of the UAV scenario. Furthermore, to solve the problem with joint optimization of bandwidth allocation and trajectory design, we propose a machine learning model consisting of the position prediction based on echo state network and the joint optimization based on deep reinforcement learning (DRL). Due to the continuity in action space, DRL optimization is specifically implemented by the normalized advantage function algorithm. Besides, considering the restriction for the implementation of machine learning, we propose a digital twin-enabled architecture to provide a virtual environment for the training. Simulation results show the advantage of the proposed scheme in total throughput and the adaptability for trajectory design in the presence of PCO.

This paper explores the joint optimization problem for trajectory planning and radio resource allocation in unmanned aerial vehicle (UAV) communications with the aim of maximizing data collection. Rather than decomposing the problem into subproblems, as most current approaches do, we express the quantity of data gathered by a UAV-assisted network as a function of both the size of the resource block allocated to all ground devices and their average upload rate. Based on this formula, it can be concluded that the problem of maximizing the average data collection can be reduced to minimizing the flight trajectory if each device communicates with the UAV within the maximum allowable coverage of the UAV. To address this issue, we propose an advanced hierarchical clustering algorithm that divides larger network-scale scenarios into many disjoint subregions to determine the initial hovering positions of the UAV. The non-convex minimization trajectory problem is decomposed into a series of convex optimizations to minimize path segments along the trajectory, based on the traveling salesman problem (TSP). Subsequently, the communication optimization process is modified to assign specific upload times for each device. The effectiveness of the optimization algorithm is demonstrated through extensive simulations, which show its superior performance in terms of average rates of data collection and upload failures.

As an emerging technology, federated learning (FL) plays a critical role for information sharing in industrial Internet of Things (IIoT). FL integrates information from multiple devices to collaboratively train a joint machine learning model locally without sharing the individual training data. Most existing incentive mechanism schemes for FL assume that the task publisher is completely rational and capable of making decisions based on expected utility theory (EUT). However, in reality, the task publisher is characterized as bounded rationality under risks and uncertainties, whose risk-awareness makes EUT inapplicable when making decisions. To tackle the above challenge, a novel incentive mechanism for IIoT-FL based on contract theory and prospect theory is proposed in this paper. We leverage prospect theory to model the task publisher’s risk-awareness behavior. To guarantee high model accuracy while avoiding serious time delay, we take the global model quality and time satisfactory into account when designing the optimal contract. Simulation results demonstrate that our incentive mechanism is effective under asymmetric information and risk.

Cross-silo federated learning is a new type of machine learning, where organizations, as model owners, collaborating to train global models with local data. Nevertheless, the heterogeneity caused by differences in training costs within the organization leads to different views on training rounds among different organizations. At the same time, the organizations’ communication resources are non-excludable public goods, resulting in free-rider problems. To address the aforementioned concerns, we propose a cross-silo federated learning incentive mechanism based on a consortium blockchain. The consortium blockchain coordinates the training rounds and currency transfers, as well as determines the processing capabilities of each organization’s local training, and helps organizations record the training models during the training process. The mechanism models the game between organizations as non-cooperative games. We conducted a theoretical analysis of the mechanism using the MNIST dataset and demonstrated the existence of Nash equilibrium. A distributed algorithm has been proposed to maximize social welfare for organizations under information asymmetry conditions. The simulation results show that the algorithm has fast convergence.

Federated edge learning (FEEL) is gaining increasing attention due to its characteristics of privacy protection, low latency, and low communication overhead. However, it still faces challenges such as a single point of failure and the imbalance between communication efficiency and training efficiency caused by heterogeneous clients. To address the above issues, we investigate a semi-decentralized FEEL (SD-FEEL) architecture, where edge servers train their local models with the associated clients in a centralized manner and exchange models with their one-hop neighbors distributively. For the upper-layer edge servers, a fully asynchronous aggregation mechanism is proposed to accelerate the model diffusion, while for the lower-layer clients, the proximal policy optimization (PPO) algorithm is employed to dynamically select the aggregation time based on currently available resources. Simulation results show that the proposed algorithm can effectively balance training efficiency and communication efficiency. Besides, the model accuracy of the proposed algorithm is improved by around 4.5% and 11% compared to asynchronous FL and synchronous FL, respectively.

When scheduling a set of real-time tasks, researchers can choose between preemptive and non-preemptive algorithms. However, these algorithms each have their own advantages and drawbacks, necessitating specific analysis in different contexts. In contrast to these two extremes, researchers have proposed the concept of limited-preemption algorithms. Such limited-preemption algorithms serve as feasible alternatives to the former two approaches. Currently, research on this algorithm is based on a homogenous computing environment.In this paper, we investigate the fixed-preemption point method in limited-preemption algorithms. We compare the impact of limited-preemption EDF algorithm on the performance of homogenous multiprocessors under different fixed-preemption strategies. We introduce a preemptive strategy where high-priority tasks can only be preempted at the most suitable fixed-preemption points, and we provide an effective schedulability analysis for this strategy. The EDF scheduling algorithm based on the best-fit fixed preemption strategy is called the Best Preemptive EDF(BP-EDF). We have introduced an effective schedulability analysis for BP-EDF. Experimental results indicate that the strategy with the most suitable fixed-preemption points demonstrates superior schedulability compared to the other two strategies. Furthermore, its performance in terms of task preemption frequency closely approaches that of the strategy employing fixed-preemption at the lowest priority points.

Live traffic video is vitally important for vehicles in future intelligent transport systems (ITSs). Due to the limitation of onboard sensors, vehicles may not be able to obtain a full view of the traffic situations which endangers safety for autonomous driving vehicles. In this article, we propose a traffic video multicasting scheme by using video splitting and group splitting techniques for unmanned aerial vehicles (UAVs)-assisted ITS, in which UAVs are considered as the eyes in the sky to capture real-time traffic videos. We aim to maximize the long-term video quality received by vehicles by jointly optimizing vehicle grouping and spectrum allocation. Considering the interactions among UAVs, the above optimization problem is formulated as a multiagent coordination problem in the form of a Markov game (MG). The MG is subsequently solved by leveraging a state-of-the-art multiagent deep reinforcement learning (MADRL) algorithm, namely, multiactor attention critic (MAAC), in which an attention mechanism is utilized to pay attention to other agents to make the learning process more effective and scalable. Extensive simulation results show that the MAAC-based algorithm has better performance in terms of video quality and spectrum efficiency compared with the baseline methods.

The Internet of Things (IoT) has already emerged as one of the most popular directions in today’s information and communication technology (ICT) domain. With its advancement over different application areas, such as smart home, smart healthcare, industry 4.0, etc., a huge amount of data has been generated by billions of IoT devices, which aggravates the shortcomings of the network layer (IP)-based networks, such as limited expressiveness of IP addressing, inefficient support for mobility, and in-network caching. Building IoT on top of information-centric networking (ICN) is believed to be a promising solution to tackle the above challenge, especially the in-network caching of ICN can significantly benefit IoT in terms of reducing data and saving IoT devices’ energy. However, caching IoT data is more challenging than caching traditional Internet content, e.g., video, because IoT data are usually valid within a certain period of time, and IoT devices are typically constrained with battery. Hence, in this survey, we first review the current implementation proposals of ICN-based IoT (ICN-IoT). Next, we present the conventional caching decision policies and replacement policies which could be adopted to mitigate the aforementioned challenges, e.g., reducing IoT traffic, saving energy, and reducing data retrieval latency. Further, since leveraging machine learning (ML) techniques have the potential to further improve the caching efficiency by dealing with uncertainties, e.g., predicting unknown information, adaptively interacting with the environment, we also demonstrate the recently proposed ML-based caching schemes for ICN-IoT. In addition, we outline the open research issues and point out the future opportunities of caching in ICN-IoT.

With the rapid development of automotive industry and telecommunication technologies, live streaming services in the Internet of Vehicles (IoV) play an even more crucial role in vehicular infotainment systems. However, it is a big challenge to provide a high quality, low latency, and low bitrate variance live streaming service for vehicles due to the dynamic properties of wireless resources and channels of IoV. To solve this challenge, we propose a novel live video transcoding and streaming scheme that maximizes the video bitrate and decreases time-delays and bitrate variations in vehicular fog-computing (VFC)-enabled IoV, by jointly optimizing vehicle scheduling, bitrate selection, and computational/spectrum resource allocation. This joint optimization problem is modeled as a Markov decision process (MDP), considering time-varying characteristics of the available resources and wireless channels of IoV. A soft actor–critic deep reinforcement learning (DRL) algorithm that is based on the maximum entropy framework, is subsequently utilized to solve the above MDP. Extensive simulation results based on the data set of the real world show that compared to other baseline algorithms, the proposed scheme can effectively improve video quality while decreasing latency and bitrate variations, and access excellent performance in terms of learning speed and stability.

Unmanned aerial vehicles (UAVs) are anticipated to be integrated into the next generation wireless networks as new aerial mobile users, which can provide various live streaming applications such as surveillance, reconnaissance, etc. For such applications, due to the dynamic characteristics of traffic and wireless channels, how to guarantee the quality of service (QoS) is a challenging task. In this paper, with recent advances in scalable video coding (SVC), we study secure video streaming in wireless networks with UAVs. By jointly optimizing video levels selection and power allocation, the research tries to maximize the energy efficiency, which is the ratio of video quality to power consumption, while satisfying the secrecy timeout probability (STP) requirement. The aforementioned problem is modeled as a constrained Markov decision process (CMDP). And then, the study employs a state-of-the-art reinforcement learning algorithm, namely safe deep Q-learning network (safe-DQN), to solve the CMDP problem, in which a safety policies set is induced by constructing a Lyapunov function. Extensive simulation results with different system parameters show the effectiveness of the proposed algorithm compared with other existing reinforcement learning algorithms.

Both mobile edge cloud (MEC) and software-defined networking (SDN) are technologies for next generation mobile networks. In this paper, we simultaneously optimize energy consumption and quality of experience (QoE) in video streaming over software-defined mobile networks (SDMN) with MEC. Specifically, we propose to jointly consider buffer dynamics, video quality adaption, edge caching, video transcoding and transmission. We formulate two optimization problems which can be depicted as a constrained Markov decision process (CMDP) and a Markov decision process (MDP). Then we transform the CMDP problem into regular MDP by deploying Lyapunov technique. We utilize asynchronous advantage actor-critic (A3C) algorithm, one of the deep reinforcement learning (DRL) methods, to solve the corresponding MDP problems. Simulation results are presented to show that the proposed scheme can achieve the goal of energy saving and QoE enhancement with the corresponding constraints satisfied.

Offloading computationally intensive tasks from user equipments (UEs) to mobile edge computing (MEC) servers is a promising technique to boost up the computational capacity of UEs. However, MEC will incur extra energy consumption and time delays, which motivates the deployment of energy harvesting (EH) small cell networks with MEC in mobile networks. Due to the complexity of such networks, it is challenging to effectively allocate resources for UEs. In this paper, we investigate the offloading decision, wireless and computational resources allocation problem in energy harvesting (EH) small cell networks with MEC. Different from existing literatures, our research focuses on improving mobile operators' revenue by maximizing the amount of the offloaded tasks while decreasing the energy expenditure and time-delays. Besides, queues are created at the MEC server side to store the un-executed tasks in a time slot, which is used as a punishment in our utility function to avoid serious delay. Considering the varying lengths of queues, the states of EH-batteries of small base stations (SBSs) and down-link channels, the above problem is modeled as a Markov decision process (MDP). Since the states and actions in the MDP are infinite, an online and on-policy actor-critic with eligibility traces algorithm is proposed to resolve the problem. Simulation results show the proposed algorithm has superior performances compared with the policy-gradient algorithm and Q-learning.

The explosive growth of mobile multimedia services has caused tremendous network traffic in wireless networks and a great part of the multimedia services are delay-sensitive. Therefore, it is important to design efficient radio resource allocation algorithms to increase network capacity and guarantee the delay QoS. In this paper, we study the power control problem in the downlink of two-tier femtocell networks with the consideration of the delay QoS provisioning. Specifically, we introduce the effective capacity (EC) as the network performance measure instead of the Shannon capacity to provide the statistical delay QoS provisioning. Then, the optimization problem is modeled as a non- cooperative game and the existence of Nash Equilibriums (NE) is investigated. However, in order to enhance the selforganization capacity of femtocells, based on non-cooperative game, we employ a Q-learning framework in which all of the femtocell base stations (FBSs) are considered as agents to achieve power allocation. Then a distributed Q- learning-based power control algorithm is proposed to make femtocell users (FUs) gain maximum EC. Numerical results show that the proposed algorithm can not only maintain the delay requirements of the delay-sensitive services, but also has a good convergence performance.

This paper addresses the energy-efficient power allocation problem of downlink transmission with delay quality of service (QoS) constraint in the femtocell networks. Particularly, in order to provide statistical delay guarantee, the effective capacity (EC) is employed as the network performance measure instead of the conventional Shannon capacity. As a result, the energy efficiency (EE) metric of the femtocell is defined to be the total-EC-to-the-overall-power-consumption ratio of the femtocell base station (FBS). The optimization problem is firstly modeled as a supermodular game. Then the existence and characteristics of the Nash Equilibrium (NE) are investigated. A distributed energy-efficient power allocation algorithm is also designed to implement the game. Simulation results demonstrate that, our proposed algorithm delivers substantial energy efficiency improvement while satisfying a wide range of delay requirements.

Femtocells have attracted growing attentions in academia, industry, and standardization forums in recent years. However, most of existing works on femtocell networks are focused on spectrum efficiency and interference mitigation, energy efficiency aspect is neglected. In this paper, we investigate the maximization of energy efficiency of downlink OFDMA dense femtocell networks by efficient resource allocation. To decrease the complexity, joint subchannel allocation and power control are decomposed into two steps. Power control has been modeled as a non-cooperative game, a closed-form best response of transmit power is obtained. Considering fairness and low complexity, a fair time-averaged subchannel allocation metric have been derived out. Based on that, we propose a distributed suboptimal subchannel allocation and optimal power control algorithm. Simulation results show that the proposed algorithm has a low complexity with slight loss of energy efficiency compared with Round-Robin Scheduling and a noncooperative energy-efficient power optimization algorithm.

In this paper, a novel joint resource allocation including sub-channel scheduling and power control is proposed for downlink multi-cell orthogonal frequency division multiple access (OFDMA) networks. We provide a utility function consisting of energy efficiency and interference pricing, in which power and sub-channel resources have been jointly considered. To reduce the complexity of the joint resource allocation, a novel iterative two-step algorithm is presented. First, we utilize a non-cooperative supermodular game in power control given the sub-channel scheduling. Then we schedule sub-channels to maximize the utility function given the power allocation. Because power control and sub-channel scheduling share the same utility function, the iterative algorithm can be proved to converge to the best response pair which achieves the higher throughput and better utility. The numerical results are provided to evaluate the performance of the proposed algorithm and show that both throughput and energy efficiency can be improved compared with traditional methods.