Avatars, as promising digital representations and service assistants of users in Metaverses, can enable drivers and passengers to immerse themselves in 3D virtual services and spaces of UAV-assisted vehicular Metaverses. However, avatar tasks include a multitude of human-to-avatar and avatar-to-avatar interactive applications, e.g., augmented reality navigation, which consumes intensive computing resources. It is inefficient and impractical for vehicles to process avatar tasks locally. Fortunately, migrating avatar tasks to the nearest roadside units (RSU) or unmanned aerial vehicles (UAV) for execution is a promising solution to decrease computation overhead and reduce task processing latency, while the high mobility of vehicles brings challenges for vehicles to independently perform avatar migration decisions depending on current and future vehicle status. To address these challenges, in this paper, we propose a novel avatar task migration system based on multi-agent deep reinforcement learning (MADRL) to execute immersive vehicular avatar tasks dynamically. Specifically, we first formulate the problem of avatar task migration from vehicles to RSUs/UAVs as a partially observable Markov decision process that can be solved by MADRL algorithms. We then design the multi-agent proximal policy optimization (MAPPO) approach as the MADRL algorithm for the avatar task migration problem. To overcome slow convergence resulting from the curse of dimensionality and non-stationary issues caused by shared parameters in MAPPO, we further propose a transformer-based MAPPO approach via sequential decision-making models for the efficient representation of relationships among agents. Finally, to motivate terrestrial or non-terrestrial edge servers (e.g., RSUs or UAVs) to share computation resources and ensure traceability of the sharing records, we apply smart contracts and blockchain technologies to achieve secure sharing management. Numerical results demonstrate that the proposed approach outperforms the MAPPO approach by around 2% and effectively reduces approximately 20% of the latency of avatar task execution in UAV-assisted vehicular Metaverses.
Monitoring large scale infrastructures hosting an even larger number of applications in highly consolidated multi-tenant environments presents a wealth of problems. Dealing with these challenges is essential since monitoring is the cornerstone to make clouds responsive, failure-tolerant, automated and cost-efficient for operators. In this special issue, you will find the foundations together with cutting-edge developments in the state of the art of cloud monitoring systems. This special issue is targeted at a broad readership, ranging from newcomers wanting a smooth acquaintance with these technologies and experts aiming to dive deeper into the latest developments. 相似文献
We address the problem of spectrum pricing in a cognitive radio network where multiple primary service providers compete with each other to offer spectrum access opportunities to the secondary users. By using an equilibrium pricing scheme, each of the primary service providers aims to maximize its profit under quality of service (QoS) constraint for primary users. We formulate this situation as an oligopoly market consisting of a few firms and a consumer. The QoS degradation of the primary services is considered as the cost in offering spectrum access to the secondary users. For the secondary users, we adopt a utility function to obtain the demand function. With a Bertrand game model, we analyze the impacts of several system parameters such as spectrum substitutability and channel quality on the Nash equilibrium (i.e., equilibrium pricing adopted by the primary services). We present distributed algorithms to obtain the solution for this dynamic game. The stability of the proposed dynamic game algorithms in terms of convergence to the Nash equilibrium is studied. However, the Nash equilibrium is not efficient in the sense that the total profit of the primary service providers is not maximized. An optimal solution to gain the highest total profit can be obtained. A collusion can be established among the primary services so that they gain higher profit than that for the Nash equilibrium. However, since one or more of the primary service providers may deviate from the optimal solution, a punishment mechanism may be applied to the deviating primary service provider. A repeated game among primary service providers is formulated to show that the collusion can be maintained if all of the primary service providers are aware of this punishment mechanism, and therefore, properly weight their profits to be obtained in the future. 相似文献
In this article we investigate the application of IEEE 802.16-based broadband wireless access (BWA) technology to telemedicine services and the related protocol engineering issues. An overview of the different evolutions of the IEEE 802.16 standard is presented and some open research issues are identified. A survey on radio resource management, traffic scheduling, and admission control mechanisms proposed for IEEE 802.16/WiMAX systems is also provided. A qualitative comparison between third-generation wireless systems and the IEEE 802.16/WiMAX technology is given. A survey on telemedicine services using traditional wireless systems is presented. The advantages of using IEEE 802.16/WiMAX technology over traditional wireless systems, as well as the related design issues and approaches are discussed. To this end, we present a bandwidth allocation and admission control algorithm for IEEE 802.16-based BWA designed specifically for wireless telemedicine/e-health services. This algorithm aims at maximizing the utilization of the radio resources while considering the quality of service requirements for telemedicine traffic. Some performance evaluation results for this scheme are obtained by simulations 相似文献
A queuing analytical model is presented to investigate the performances of different sleep and wakeup strategies in a solar-powered wireless sensor/mesh network where a solar cell is used to charge the battery in a sensor/mesh node. While the solar radiation process (and, hence, the energy generation process in a solar cell) is modeled by a stochastic process (i.e., a Markov chain), a linear battery model with relaxation effect is used to model the battery capacity recovery process. Developed based on a multidimensional discrete-time Markov chain, the presented model is used to analyze the performances of different sleep and wakeup strategies in a sensor/mesh node. The packet dropping and packet blocking probabilities at a node are the major performance metrics. The numerical results obtained from the analytical model are validated by extensive simulations. In addition, using the queuing model, based on a game-theoretic formulation, we demonstrate how to obtain the optimal parameters for a particular sleep and wakeup strategy. In this case, we formulate a bargaining game by exploiting the trade-off between packet blocking and packet dropping probabilities due to the sleep and wakeup dynamics in a sensor/mesh node. The Nash solution is obtained for the equilibrium point of sleep and wakeup probabilities. The presented queuing model, along with the game-theoretic formulation, would be useful for the design and optimization of energy-efficient protocols for solar-powered wireless sensor/mesh networks under quality-of-service (QoS) constraints 相似文献
This paper presents a semi-analytical methodology for radio link level performance analysis in a multirate "orthogonal frequency-division multiple-access" (OFDMA) network with adaptive fair rate allocation. Multirate transmission is assumed to be achieved through adaptive modulation, and fair rate allocation is based on the principle of generalized processor sharing to allocate the subcarriers adaptively among the users. The fair rate allocation problem is formulated as an optimization problem with the objective of maximizing system throughput while maintaining fairness (in terms of transmission rate) among the users. The "optimal" fair rate allocation is obtained by using the "Hungarian method." A heuristic-based approach, namely the "iterative approach," that is more implementation friendly is also presented. The throughput performance of the iterative fair rate allocation is observed to be as good as that of optimal fair rate allocation and is better than that of the static subcarrier allocation scheme. Also, the iterative fair allocation provides better fairness compared to that for each of the optimal and the static subcarrier allocation schemes. To this end, a queuing model is formulated to analyze radio link level performance measures such as packet dropping probability and packet transmission delay under the above rate allocation schemes. In this formulation, packet arrivals are modeled by the discrete Markov modulated Poisson process, which is flexible to model different types of traffic arrival patterns. The proposed framework for radio link level performance analysis of multirate OFDMA networks is validated by extensive simulations. Also, examples on the application of the proposed model for connection admission control and quality-of-service provisioning are illustrated 相似文献
A queuing analytical model is presented to evaluate call-level and packet-level quality of service (QoS) metrics in the uplink of a voice/data cellular code division multiple access (CDMA) network. In this model, a threshold-based call admission control (CAC) is used to limit the number of admitted calls in a cell and also to prioritize handoff calls over new calls. The transmission rates for data calls can be adjusted to accommodate more voice and/or data calls while satisfying the minimum signal-to-interference ratio (SIR)/ transmission rate requirement. Also, automatic repeat request (ARQ)-based error control is used for improved reliability of data packets. Call-level performance measures for both voice and data calls and packet-level performance measures specifically for data calls can be obtained from the analytical model. The interdependencies among call-level and packet-level QoS metrics are investigated under different CAC, rate adaptation, and error control parameter settings. To this end, the level of users' satisfaction (or user utility) is formulated as a function of the QoS metrics and an optimization formulation is presented to obtain the local-optimal system parameters 相似文献