Searcharxiv⌕ Search

arXiv subjects

Dusit Niyato

Publications and source records attributed to Dusit Niyato.

At least 739 records · Page 41Linked to original sources

Reconfigurable Intelligent Surface for MISO Systems with Proportional Rate Constraints

This paper investigates the system spectral efficiency (SE) in reconfigurable intelligent surface (RIS)-aided multiuser multiple-input single-output (MISO) systems, where RIS can reconfigure the propagation environment via a large number of controllable and intelligent phase shifters. In order to explore the system SE performance behavior with user proportional fairness for such a system, an optimization problem is formulated to maximize the SE by jointly considering the power allocation at the base station (BS) and phase shift at the RIS, under nonlinear proportional rate fairness constraints. To solve the nonconvex optimization problem, an effective solution is developed, which capitalizes on an iterative algorithm with closed-form expressions, i.e., alternatively optimizing the transmit power at the BS and the reflecting phase shift at the RIS. Numerical simulations are provided to validate the theoretical analysis and assess the performance of the proposed alternative algorithm.

cs.IT↗

Intelligent Reflecting Surface Aided Network: Power Control for Physical-Layer Broadcasting

As a recently proposed idea for future wireless systems, intelligent reflecting surface (IRS) can assist communications between entities which do not have high-quality direct channels in between. Specifically, an IRS comprises many low-cost passive elements, each of which reflects the incident signal by incurring a phase change so that the reflected signals add coherently at the receiver. In this paper, for an IRS-aided wireless network, we study the problem of power control at the base station (BS) for physical-layer broadcasting under quality of service (QoS) constraints at mobile users, by jointly designing the transmit beamforming at the BS and the phase shifts of the IRS units. Furthermore, we derive a lower bound of the minimum transmit power at the BS to present the performance bound for optimization methods. Simulation results show that, the transmit power at the BS approaches the lower bound with the increase of the number of IRS units, and is much lower than that of the communication system without IRS.

cs.IT↗

Intelligent Reflecting Surface Meets Mobile Edge Computing: Enhancing Wireless Communications for Computation Offloading

We consider computation offloading for edge computing in a wireless network equipped with intelligent reflecting surfaces (IRSs). IRS is an emerging technology and has recently received great attention since they can improve the wireless propagation environment in a configurable manner and enhance the connections between mobile devices (MDs) and access points (APs). At this point not many papers consider edge computing in the novel context of wireless communications aided by IRS. In our studied setting, each MD offloads computation tasks to the edge server located at the AP to reduce the associated comprehensive cost, which is a weighted sum of time and energy. The edge server adjusts the IRS to maximize its earning while maintaining MDs' incentives for offloading and guaranteeing each MD a customized information rate. This problem can be formulated into a difficult optimization problem, which has a sum-of-ratio objective function as well as a bunch of nonconvex constraints. To solve this problem, we first develop an iterative evaluation procedure to identify the feasibility of the problem when confronting an arbitrary set of information rate requirement. This method serves as a sufficient condition for the problem being feasible and provides a feasible solution. Based on that we develop an algorithm to optimize the objective function. Our numerical results show that the presence of IRS enables the AP to guarantee higher information rate to all MDs and at the same time improve the earning of the edge server.

eess.SP↗

Capitalizing Backscatter-Aided Hybrid Relay Communications with Wireless Energy Harvesting

In this work, we employ multiple energy harvesting relays to assist information transmission from a multi-antenna hybrid access point (HAP) to a receiver. All the relays are wirelessly powered by the HAP in the power-splitting (PS) protocol. We introduce the novel concept of hybrid relay communications, which allows each relay to switch between two radio modes, i.e., the active RF communications and the passive backscatter communications, according to its channel and energy conditions. We envision that the complement transmissions in two radio modes can be exploited to improve the overall relay performance. As such, we aim to jointly optimize the HAP's beamforming, individual relays' radio mode, the PS ratio, and the relays' collaborative beamforming to enhance the throughput performance at the receiver. The resulting formulation becomes a combinatorial and non-convex problem. Thus, we firstly propose a convex approximation to the original problem, which serves as a lower bound of the relay performance. Then, we design an iterative algorithm that decomposes the binary relay mode optimization from the other operating parameters. In the inner loop of the algorithm, we exploit the structural properties to optimize the relay performance with the fixed relay mode in the alternating optimization framework. In the outer loop, different performance metrics are derived to guide the search for a set of passive relays to further improve the relay performance. Simulation results verify that the hybrid relaying communications can achieve 20% performance improvement compared to the conventional relay communications with all active relays.

cs.IT↗

Deep Reinforcement Learning for Backscatter-Aided Data Offloading in Mobile Edge Computing

Wireless network optimization has been becoming very challenging as the problem size and complexity increase tremendously, due to close couplings among network entities with heterogeneous service and resource requirements. By continuously interacting with the environment, deep reinforcement learning (DRL) provides a mechanism for different network entities to build knowledge and make autonomous decisions to improve network performance. In this article, we first review typical DRL approaches and recent enhancements. We then discuss the applications of DRL for mobile edge computing (MEC), which can be used for the low-power IoT devices, e.g., wireless sensors in healthcare monitoring, to offload computation workload to nearby MEC servers. To balance power consumption in offloading and computation, we propose a novel hybrid offloading model that exploits the complement operations of RF communications and low-power backscatter communications. The DRL framework is then customized to optimize the transmission scheduling and workload allocation in two communications technologies, which is shown to enhance the offloading performance significantly compared with existing schemes.

cs.IT↗

Convergence of Edge Computing and Deep Learning: A Comprehensive Survey

Ubiquitous sensors and smart devices from factories and communities are generating massive amounts of data, and ever-increasing computing power is driving the core of computation and services from the cloud to the edge of the network. As an important enabler broadly changing people's lives, from face recognition to ambitious smart factories and cities, developments of artificial intelligence (especially deep learning, DL) based applications and services are thriving. However, due to efficiency and latency issues, the current cloud computing service architecture hinders the vision of "providing artificial intelligence for every person and every organization at everywhere". Thus, unleashing DL services using resources at the network edge near the data sources has emerged as a desirable solution. Therefore, edge intelligence, aiming to facilitate the deployment of DL services by edge computing, has received significant attention. In addition, DL, as the representative technique of artificial intelligence, can be integrated into edge computing frameworks to build intelligent edge for dynamic, adaptive edge maintenance and management. With regard to mutually beneficial edge intelligence and intelligent edge, this paper introduces and discusses: 1) the application scenarios of both; 2) the practical implementation methods and enabling technologies, namely DL training and inference in the customized edge computing framework; 3) challenges and future trends of more pervasive and fine-grained intelligence. We believe that by consolidating information scattered across the communication, networking, and DL areas, this survey can help readers to understand the connections between enabling technologies while promoting further discussions on the fusion of edge intelligence and intelligent edge, i.e., Edge DL.

cs.NI↗

Joint Time Scheduling and Transaction Fee Selection in Blockchain-based RF-Powered Backscatter Cognitive Radio Network

In this paper, we develop a new framework called blockchain-based Radio Frequency (RF)-powered backscatter cognitive radio network. In the framework, IoT devices as secondary transmitters transmit their sensing data to a secondary gateway by using the RF-powered backscatter cognitive radio technology. The data collected at the gateway is then sent to a blockchain network for further verification, storage and processing. As such, the framework enables the IoT system to simultaneously optimize the spectrum usage and maximize the energy efficiency. Moreover, the framework ensures that the data collected from the IoT devices is verified, stored and processed in a decentralized but in a trusted manner. To achieve the goal, we formulate a stochastic optimization problem for the gateway under the dynamics of the primary channel, the uncertainty of the IoT devices, and the unpredictability of the blockchain environment. In the problem, the gateway jointly decides (i) the time scheduling, i.e., the energy harvesting time, backscatter time, and transmission time, among the IoT devices, (ii) the blockchain network, and (iii) the transaction fee rate to maximize the network throughput while minimizing the cost. To solve the stochastic optimization problem, we then propose to employ, evaluate, and assess the Deep Reinforcement Learning (DRL) with Dueling Double Deep Q-Networks (D3QN) to derive the optimal policy for the gateway. The simulation results clearly show that the proposed solution outperforms the conventional baseline approaches such as the conventional Q-Learning algorithm and non-learning algorithms in terms of network throughput and convergence speed. Furthermore, the proposed solution guarantees that the data is stored in the blockchain network at a reasonable cost.

cs.NI↗

Spectrum Intelligent Radio: Technology, Development, and Future Trends

The advent of Industry 4.0 with massive connectivity places significant strains on the current spectrum resources, and challenges the industry and regulators to respond promptly with new disruptive spectrum management strategies. The current radio development, with certain elements of intelligence, is nowhere near showing an agile response to the complex radio environments. Following the line of intelligence, we propose to classify spectrum intelligent radio into three streams: classical signal processing, machine learning (ML), and contextual adaptation. We focus on the ML approach, and propose a new intelligent radio architecture with three hierarchical forms: perception, understanding, and reasoning. The proposed perception method achieves fully blind multi-level spectrum sensing. The understanding method accurately predicts the primary users' coverage across a large area, and the reasoning method performs a near-optimal idle channel selection. Opportunities, challenges, and future visions are also discussed for the realization of a fully intelligent radio.

cs.IT↗

"Borrowing Arrows with Thatched Boats": The Art of Defeating Reactive Jammers in IoT Networks

In this article, we introduce a novel deception strategy which is inspired by the "Borrowing Arrows with Thatched Boats", one of the most famous military tactics in the history, in order to defeat reactive jamming attacks for low-power IoT networks. Our proposed strategy allows resource-constrained IoT devices to be able to defeat powerful reactive jammers by leveraging their own jamming signals. More specifically, by stimulating the jammer to attack the channel through transmitting fake transmissions, the IoT system can not only undermine the jammer's power, but also harvest energy or utilize jamming signals as a communication means to transmit data through using RF energy harvesting and ambient backscatter techniques, respectively. Furthermore, we develop a low-cost deep reinforcement learning framework that enables the hardware-constrained IoT device to quickly obtain an optimal defense policy without requiring any information about the jammer in advance. Simulation results reveal that our proposed framework can not only be very effective in defeating reactive jamming attacks, but also leverage jammer's power to enhance system performance for the IoT network.

eess.SP↗

Computation Offloading and Content Caching Delivery in Vehicular Edge Computing: A Survey

Autonomous Vehicles (AVs) generated a plethora of data prior to support various vehicle applications. Thus, a big storage and high computation platform is necessary, and this is possible with the presence of Cloud Computing (CC). However, the computation for vehicular networks at the cloud computing suffers from several drawbacks, such as latency and cost, due to the proximity issue. As a solution, the computing capability has been recently proposed at the edge of vehicular networks, which is known as Vehicle Edge Computing (VEC). This leads to other open problems for vehicles to offload and compute data at edge nodes, and also how data is cached in edge nodes and then disseminated to other vehicles. In this paper, we initially present an overview of VEC architectures including types of layers, fog nodes, communication technologies and also vehicle applications, which are used in data offloading and dissemination scenarios. Since the mobility is critical on the VEC performance, the mobility model used in the VEC scenario is also discussed. We extensively review the Computation Offloading (ComOf) techniques as well as Content Caching and Delivery (CachDel) approaches for VEC. We finally highlight some key research challenges, issues and future works in the paper

cs.NI↗

A Dynamic Reliability-Aware Service Placement for Network Function Virtualization (NFV)

Network softwarization is one of the major paradigm shifts in the next generation of networks. It enables programmable and flexible management and deployment of the network. Network function virtualization (NFV) is referred to the deployment of software functions running on commodity servers instead of traditional hardware-based middle-boxes. It is an example of network softwarization. In NFV, a service is defined as a chain of software functions named service chain function (SFC). The process of allocating the resources of servers to the services, called service placement, is the most challenging mission in NFV. Dynamic nature of the service arrivals and departures as well as meeting the service level agreement make the service placement problem even more challenging. In this paper, we propose a model for dynamic reliability-aware service placement based on the simultaneous allocation of the main and backup servers. Then, we formulate the dynamic reliability-aware service placement as an infinite horizon Markov decision process (MDP), which aims to minimize the placement cost and maximize the number of admitted services. In the proposed MDP, the number of active services in the network is considered to be the state of the system, and the state of the idle resources is estimated based on it. Also, the number of possible admitted services is considered as the action of the presented MDP. To evaluate each possible action in the proposed MDP, we use a sub-optimal method based on the Viterbi algorithm named Viterbi-based Reliable Static Service Placement (VRSSP) algorithm. We determine the optimal policy based on value iteration method using an algorithm named VRSSP-based Value Iteration (VVI) algorithm. Eventually, through the extensive simulations, the superiority of the proposed model for dynamic reliability-aware service placement compared to the static solutions is inferred.

cs.NI↗

Dynamic Model for Network Selection in Next Generation HetNets with Memory-affecting Rational Users

Recently, due to the staggering growth of wireless data traffic, heterogeneous networks have drawn tremendous attention due to the capabilities of enhancing the capacity/coverage and to save energy consumption for the next generation wireless networks. In this paper, we study a long-run user-centric network selection problem in the 5G heterogeneous network, where the network selection strategies of the users can be investigated dynamically. Unlike the conventional studies on the long-run model, we incorporate the memory effect and consider the fact that the decision-making of the users is affected by their memory, i.e., their past service experience. Namely, the users select the network based on not only their instantaneous achievable service experience but also their past service experience within their memory. Specifically, we model and study the interaction among the users in the framework of fractional evolutionary game based on the classical evolutionary game theory and the concept of the power-law memory. We analytically prove that the equilibrium of the fractional evolutionary game exists, is unique and uniformly stable. We also numerically demonstrate the stability of the fractional evolutionary equilibrium. Extensive numerical results have been conducted to evaluate the performance of the fractional evolutionary game. The numerical results have revealed some insightful findings. For example, the user in the fractional evolutionary game with positive memory effect can achieve a higher cumulative utility compared with the user in the fractional evolutionary game with negative memory effect. Moreover, the fractional evolutionary game with positive memory effect can reduce the loss in the user's cumulative utility caused by the small-scale fading.

cs.NI↗

Incentive Design for Efficient Federated Learning in Mobile Networks: A Contract Theory Approach

To strengthen data privacy and security, federated learning as an emerging machine learning technique is proposed to enable large-scale nodes, e.g., mobile devices, to distributedly train and globally share models without revealing their local data. This technique can not only significantly improve privacy protection for mobile devices, but also ensure good performance of the trained results collectively. Currently, most the existing studies focus on optimizing federated learning algorithms to improve model training performance. However, incentive mechanisms to motivate the mobile devices to join model training have been largely overlooked. The mobile devices suffer from considerable overhead in terms of computation and communication during the federated model training process. Without well-designed incentive, self-interested mobile devices will be unwilling to join federated learning tasks, which hinders the adoption of federated learning. To bridge this gap, in this paper, we adopt the contract theory to design an effective incentive mechanism for simulating the mobile devices with high-quality (i.e., high-accuracy) data to participate in federated learning. Numerical results demonstrate that the proposed mechanism is efficient for federated learning with improved learning accuracy.

cs.LG↗

Resource Allocation in Mobility-Aware Federated Learning Networks: A Deep Reinforcement Learning Approach

Federated learning allows mobile devices, i.e., workers, to use their local data to collaboratively train a global model required by the model owner. Federated learning thus addresses the privacy issues of traditional machine learning. However, federated learning faces the energy constraints of the workers and the high network resource cost due to the fact that a number of global model transmissions may be required to achieve the target accuracy. To address the energy constraint, a power beacon can be used that recharges energy to the workers. However, the model owner may need to pay an energy cost to the power beacon for the energy recharge. To address the high network resource cost, the model owner can use a WiFi channel, called default channel, for the global model transmissions. However, communication interruptions may occur due to the instability of the default channel quality. For this, special channels such as LTE channels can be used, but this incurs channel cost. As such, the problem of the model owner is to decide amounts of energy recharged to the workers and to choose channels used to transmit its global model to the workers to maximize the number of global model transmissions while minimizing the energy and channel costs. This is challenging for the model owner under the uncertainty of the channel, energy and mobility states of the workers. In this paper, we thus propose to employ the Deep Q-Network (DQN) that enables the model owner to find the optimal decisions on the energy and the channels without any a priori network knowledge. Simulation results show that the proposed DQN always achieves better performance compared to the conventional algorithms.

cs.NI↗

Reliable Federated Learning for Mobile Networks

Federated learning, as a promising machine learning approach, has emerged to leverage a distributed personalized dataset from a number of nodes, e.g., mobile devices, to improve performance while simultaneously providing privacy preservation for mobile users. In the federated learning, training data is widely distributed and maintained on the mobile devices as workers. A central aggregator updates a global model by collecting local updates from mobile devices using their local training data to train the global model in each iteration. However, unreliable data may be uploaded by the mobile devices (i.e., workers), leading to frauds in tasks of federated learning. The workers may perform unreliable updates intentionally, e.g., the data poisoning attack, or unintentionally, e.g., low-quality data caused by energy constraints or high-speed mobility. Therefore, finding out trusted and reliable workers in federated learning tasks becomes critical. In this article, the concept of reputation is introduced as a metric. Based on this metric, a reliable worker selection scheme is proposed for federated learning tasks. Consortium blockchain is leveraged as a decentralized approach for achieving efficient reputation management of the workers without repudiation and tampering. By numerical analysis, the proposed approach is demonstrated to improve the reliability of federated learning tasks in mobile networks.

cs.CR↗

Coverage Analysis of Integrated Sub-6GHz-mmWave Cellular Networks with Hotspots

Deploying Sub-6GHz networks together with millimeter wave (mmWave) is a promising solution to achieve high data rates in traffic hotspots while guaranteeing sufficient coverage, where mmWave small cells are densely deployed to provide high quality of service. In this paper, we propose an analytical framework to investigate the integrated Sub-6GHz-mmWave cellular networks, in which the Sub-6GHz base stations (BSs) are modeled as a Poisson point process, and the mmWave BSs are clustered following a Poisson cluster process in traffic hotspots. We conduct stochastic geometry-based analysis and derive the performance metrics including the association probability, signal-to-interference-plus-noise ratio coverage probability and average achievable rate, which are validated to be accurate by Monte Carlo simulations. We analyze the impact of various deployment parameters on the network performance to give insights on the network design. In particular, it is shown that deploying mmWave small cells in traffic hotspots will outperform both traditional Sub-6GHz heterogeneous network and isolated mmWave system in terms of the coverage probability. It can also be shown that extremely high and extremely small association weight for mmWave BSs will deteriorate the performance for cell edge users and cell interior users, respectively. Moreover, there exists an optimal pre-decided dispersion parameter of mmWave BSs that contributes to the maximum coverage probability.

cs.IT↗

Blockchain Technologies for Smart Energy Systems: Fundamentals, Challenges and Solutions

In this paper, we discuss the integration of blockchain in smart energy systems. We present various blockchain technology solutions, review important blockchain platforms, and several blockchain based smart energy projects in different smart energy domains. The majority of blockchain platforms with embedded combination of blockchain technology solutions are computing- and resource- intensive, and hence not entirely suitable for smart energy applications. We consider the requirements of smart energy systems and accordingly identify appropriate blockchain technology solutions for smart energy applications. Our analysis can help in the development of flexible blockchain platforms for smart energy systems.

cs.CY↗

Multi-Objective Optimization for Drone Delivery

Recently, an unmanned aerial vehicle (UAV), as known as drone, has become an alternative means of package delivery. Although the drone delivery scheduling has been studied in recent years, most existing models are formulated as a single objective optimization problem. However, in practice, the drone delivery scheduling has multiple objectives that the shipper has to achieve. Moreover, drone delivery typically faces with unexpected events, e.g., breakdown or unable to takeoff, that can significantly affect the scheduling problem. Therefore, in this paper, we propose a multi-objective and three-stage stochastic optimization model for the drone delivery scheduling, called multi-objective optimization for drone delivery (MODD) system. To handle the the multi-objective optimization in the MODD system, we apply $\varepsilon$-constraint method. The performance evaluation is performed by using a real dataset from Singapore delivery services.

eess.SP↗