skip to main content

Title: Risk-Aware Resource Management in Public Safety Networks
Modern Public Safety Networks (PSNs) are assisted by Unmanned Aerial Vehicles (UAVs) to provide a resilient communication paradigm during catastrophic events. In this context, we propose a distributed user-centric risk-aware resource management framework in UAV-assisted PSNs supported by both a static UAV and a mobile UAV. The mobile UAV is entitled to a larger portion of the available spectrum due to its capability and flexibility to re-position itself, and therefore establish better communication channel conditions to the users, compared to the static UAV. However, the potential over-exploitation of the mobile UAV-based communication by the users may lead to the mobile UAV’s failure to serve the users due to the increased levels of interference, consequently introducing risk in the user decisions. To capture this uncertainty, we follow the principles of Prospect Theory and design a user’s prospect-theoretic utility function that reflects user’s risk-aware behavior regarding its transmission power investment to the static and/or mobile UAV-based communication option. A non-cooperative game among the users is formulated, where each user determines its power investment strategy to the two available communication choices in order to maximize its expected prospect-theoretic utility. The existence and uniqueness of a Pure Nash Equilibrium (PNE) is proven and the more » convergence of the users’ strategies to it is shown. An iterative distributed and low-complexity algorithm is introduced to determine the PNE. The performance of the proposed user-centric risk-aware resource management framework in terms of users’ achievable data rate and spectrum utilization, is achieved via modeling and simulation. Furthermore, its superiority and benefits are demonstrated, by comparing its performance against other existing approaches with regards to UAV selection and spectrum utilization. « less
Authors:
; ;
Award ID(s):
1849739
Publication Date:
NSF-PAR ID:
10228428
Journal Name:
Sensors
Volume:
19
Issue:
18
Page Range or eLocation-ID:
3853
ISSN:
1424-8220
Sponsoring Org:
National Science Foundation
More Like this
  1. Unmanned Aerial Vehicle (UAV)-assisted Multi-access Edge Computing (MEC) systems have emerged recently as a flexible and dynamic computing environment, providing task offloading service to the users. In order for such a paradigm to be viable, the operator of a UAV-mounted MEC server should enjoy some form of profit by offering its computing capabilities to the end users. To deal with this issue in this paper, we apply a usage-based pricing policy for allowing the exploitation of the servers’ computing resources. The proposed pricing mechanism implicitly introduces a more social behavior to the users with respect to competing for the UAV-mounted MEC servers’ computation resources. In order to properly model the users’ risk-aware behavior within the overall data offloading decision-making process the principles of Prospect Theory are adopted, while the exploitation of the available computation resources is considered based on the theory of the Tragedy of the Commons. Initially, the user’s prospect-theoretic utility function is formulated by quantifying the user’s risk seeking and loss aversion behavior, while taking into account the pricing mechanism. Accordingly, the users’ pricing and risk-aware data offloading problem is formulated as a distributed maximization problem of each user’s expected prospect-theoretic utility function and addressed as a non-cooperativemore »game among the users. The existence of a Pure Nash Equilibrium (PNE) for the formulated non-cooperative game is shown based on the theory of submodular games. An iterative and distributed algorithm is introduced which converges to the PNE, following the learning rule of the best response dynamics. The performance evaluation of the proposed approach is achieved via modeling and simulation, and detailed numerical results are presented highlighting its key operation features and benefits.« less
  2. In this paper, a flexible resource sharing paradigm is introduced, to enable the allocation of users’ computing tasks in a social cloud computing system offering both Virtual Machines (VMs) and Serverless Computing (SC) functions. VMs are treated as a safe computing resource, while SC due to the uncertainty introduced by its shared nature, is treated as a common pool resource, being susceptible to potential over-exploitation. These computing options are differentiated based on the potential satisfaction perceived by the user, as well as their corresponding pricing, while taking into account the social interactions among the users. Considering the inherent uncertainty of the considered computing environment, Prospect Theory and the theory of the Tragedy of the Commons are adopted to properly reflect the users’ behavioral characteristics, i.e., gain-seeking or loss-averse behavior, as well as to formulate appropriate prospect-theoretic utility functions, embodying the social-aware and risk-aware user’s perceived satisfaction. A distributed maximization problem of each user’s expected prospect-theoretic utility is formulated as a non-cooperative game among the users and the corresponding Pure Nash Equilibrium (PNE), i.e., optimal computing jobs offloading to the VMs and the SC, is determined, while a distributed low-complexity algorithm that converges to the PNE is introduced. The performance andmore »key principles of the proposed framework are demonstrated through modeling and simulation.« less
  3. In this paper, a novel data offloading decision-making framework is proposed, where users have the option to partially offload their data to a complex Multi-access Edge Computing (MEC) environment, consisting of both ground and UAV-mounted MEC servers. The problem is treated under the perspective of risk-aware user behavior as captured via prospect-theoretic utility functions, while accounting for the inherent computing environment uncertainties. The UAV-mounted MEC servers act as a common pool of resources with potentially superior but uncertain payoff for the users, while the local computation and ground server alternatives constitute safe and guaranteed options, respectively. The optimal user task offloading to the available computing choices is formulated as a maximization problem of each user's satisfaction, and confronted as a non-cooperative game. The existence and uniqueness of a Pure Nash Equilibrium (PNE) are proven, and convergence to the PNE is shown. Detailed numerical results highlight the convergence of the system to the PNE in few only iterations, while the impact of user behavior heterogeneity is evaluated. The introduced framework's consideration of the user risk-aware characteristics and computing uncertainties, results to a sophisticated exploitation of the system resources, which in turn leads to superior users' experienced performance compared to alternative approaches.
  4. A major challenge in mobile crowdsensing applications is the generation of false (or spam) contributions resulting from selfish and malicious behaviors of users, or wrong perception of an event. Such false contributions induce loss of revenue owing to undue incentivization, and also affect the operational reliability of the applications. To counter these problems, we propose an event-trust and user-reputation model, called QnQ, to segregate different user classes such as honest, selfish, or malicious. The resultant user reputation scores, are based on both `quality' (accuracy of contribution) and `quantity' (degree of participation) of their contributions. Specifically, QnQ exploits a rating feedback mechanism for evaluating an event-specific expected truthfulness, which is then transformed into a robust quality of information (QoI) metric to weaken various effects of selfish and malicious user behaviors. Eventually, the QoIs of various events in which a user has participated are aggregated to compute his reputation score, which in turn is used to judiciously disburse user incentives with a goal to reduce the incentive losses of the CS application provider. Subsequently, inspired by cumulative prospect theory (CPT), we propose a risk tolerance and reputation aware trustworthy decision making scheme to determine whether an event should be published or not,more »thus improving the operational reliability of the application. To evaluate QnQ experimentally, we consider a vehicular crowdsensing application as a proof-of-concept. We compare QoI performance achieved by our model with Jøsang's belief model, reputation scoring with Dempster-Shafer based reputation model, and operational (decision) accuracy with expected utility theory. Experimental results demonstrate that QnQ is able to better capture subtle differences in user behaviors based on both quality and quantity, reduces incentive losses, and significantly improves operational accuracy in presence of rogue contributions« less
  5. This paper introduces a Multi-Agency DisAster Management (MADAM) framework for Unmanned Aerial Vehicle (UAV)-assisted public safety systems, based on the principles of game theory and reinforcement learning. Initially, the information quality and criticality (IQC) provided by each agency to an UAV-assisted public safety network is introduced and quantified, and the concept of Value of Information (VoI) that measures each agency’s positive contribution to the overall disaster management process is defined. Based on these, a holistic cost function is adopted by each agency, reflecting its relative abstention from the information provisioning process. Each agency aims at minimizing its personal cost function in order to better contribute to the disaster management. This optimization problem is formulated as a non-cooperative game among the agencies and it is proven to be an exact potential game, thus guaranteeing the existence of at least one Pure Nash Equilibrium (PNE). We propose a binary log-linear reinforcement learning algorithm that converges to the optimal PNE. The performance of the proposed approach is evaluated through modeling and simulation under several scenarios, and its superiority compared to other approaches is demonstrated.