Microservices have exerted a profound impact on the development of internet applications. Meanwhile, the growing number of mobile terminal user requests has made the communication between microservices extremely complex, significantly impacting the quality of user service experience in mobile edge computing. Therefore, the joint optimization of microservice deployment and request routing is necessary to alleviate server pressure and enhance overall performance of large-scaled MEC applications. However, most existing work studies the micro service deployment and request routing as two isolated problems and neglects the dependencies between microservices. This paper focuses on the data dependency relationship of request and multi-instance processing problem, and then formulate the joint problem of microservice deployment and request routing as an integer nonlinear program and queuing optimization model under complex constraints. To address this problem, we propose a fine-grained reinforcement learning-based algorithm named Reward Memory Shaping Deep Deterministic Policy Gradient (RMS DDPG). Furthermore, we introduce the Long Short-Term Memory (LSTM) block into the actor network and critical network to make actions memorable. Finally, our experiments demonstrate that our algorithm is more superior in terms of delay target, load balancing and algorithm robustness compared with four baseline algorithms.
9 December 2021 in IEEE Transactions on Cognitive Communications and Networking
We focus on an intelligent reflecting surface (IRS)-assisted multiple-input single-output (MISO) system where the IRS sustains its operations by harvesting energy from the access point (AP) in the power splitting (PS) protocol. We aim to minimize the AP’s transmit power subject to the receivers’ signal-to-noise ratio (SNR) and the IRS’s energy budget constraints. A two-stage optimization framework is proposed to jointly optimize the AP’s active beamforming, the IRS’s passive beamforming, and the reflection amplitude. Given the reflection amplitude, we employ alternating optimization to update the beamforming strategies. Then, we determine the lower and upper bounds of the reflection amplitude in closed-form expressions, which help to update the reflection amplitude in a bisection method. We further extend our study to the robust case with uncertain channels. Our analysis reveals that the robust counterpart can be solved by the same optimization framework. Extensive simulations reveal that our algorithm is efficacy to balance the IRS’s energy budget and the receiver’s SNR performance. With uncertain channel information, a larger size of the IRS does not always ensure a higher performance improvement to information transmissions.
Driven by the fast growth of wireless communication, the trend of sharing spectrum among heterogeneous technologies becomes increasingly dominant. Identifying concurrent technologies is an important step towards efficient spectrum sharing. However, due to the complexity of recognition algorithms and the strict condition of sampling speed, communication systems capable of recognizing signals other than their own type are extremely rare. This work proves that multi-model distribution of the received signal strength indicator (RSSI) is related to the signals’ modulation schemes and medium access mechanisms, and RSSI from different technologies may exhibit highly distinctive features. A distinction is made between technologies with a streaming or a non-streaming property, and appropriate feature spaces can be established either by deriving parameters such as packet duration from RSSI or directly using RSSI’s probability distribution. An experimental study shows that even RSSI acquired at a sub-Nyquist sampling rate is able to provide sufficient features to differentiate technologies such as Wi-Fi, Long Term Evolution (LTE), Digital Video Broadcasting-Terrestrial (DVB-T) and Bluetooth. The usage of the RSSI distribution-based feature space is illustrated via a sample algorithm. Experimental evaluation indicates that more than 92% accuracy is achieved with the appropriate configuration. As the analysis of RSSI distribution is straightforward and less demanding in terms of system requirements, we believe it is highly valuable for recognition of wideband technologies on constrained devices in the context of dynamic spectrum access.
16 October 2023 in IEEE Internet of Things Journal
As one of the promising self-powered sensors on Internet of Things (IoT) platforms, unmanned aerial vehicles (UAVs) have attracted much attention for parcel delivery. Their high flexibility and low cost facilitate last-one-mile delivery. However, the limitations of battery capacity and payloads prevent drones from delivering independently over large scales. In this case, it is available to employ vehicles to assist the drones. The vehicles can be private-own trucks and vehicles in public transportation systems (PTSs). Compared to trucks, PTSs, such as buses and trains, do not require extra operating and fuel costs. Given these advantages, this article adopts PTSs to assist UAVs in parcel delivery. Nevertheless, the fixed routes and schedules of public vehicles pose new challenges to the routing and scheduling problem for PTS-assisted multidrone parcel delivery (RSPMD). To tackle the problem, we propose a novel routing and scheduling algorithm, referred to as the PTS-assisted multidrone parcel delivery (PDD) algorithm. Considering the schedules of the public vehicles, the algorithm jointly optimizes the distance and time cost of drones by iteratively combining parts of existing routes. To the best of our knowledge, we are the first to address RSPMD in which UAVs ride public vehicles to deliver parcels in a wide area. Simulation results are finally presented to demonstrate that PDD outperforms existing solutions in terms of effectiveness and efficiency.
8 May 2012 in IEEE Transactions on Mobile Computing
Channel allocation is a crucial concern in variable-width wireless local area networks. This work aims to obtain the stable and fair nonoverlapped variable-width channel allocation for selfish access points (APs). In the scenario of single collision domain, the channel allocation problem reduces to a channel-width allocation problem, which can be formulated as a noncooperative game. The Nash equilibrium (NE) of the game corresponds to a desired channel-width allocation. A distributed algorithm is developed to achieve the NE channel-width allocation that globally maximizes the network utility. A punishment-based cooperation self-enforcement mechanism is further proposed to ensure that the APs obey the proposed scheme. In the scenario of multiple collision domains, the channel allocation problem is formulated as a constrained game. Penalty functions are introduced to relax the constraints and the game is converted into a generalized ordinal potential game. Based on the best response and randomized escape, a distributed iterative algorithm is designed to achieve a desired NE channel allocation. Finally, computer simulations are conducted to validate the effectiveness and practicality of the proposed schemes.