Mohammad Yousefvand

2papers

2 Papers

HCFeb 1, 2021
Tale of Seven Alerts: Enhancing Wireless Emergency Alerts (WEAs) to Reduce Cellular Network Usage During Disasters

Demetrios Lambropoulos, Mohammad Yousefvand, Narayan Mandayam

In weather disasters, first responders access dedicated communication channels different from civilian commercial channels to facilitate rescues. However, rescues in recent disasters have increasingly involved civilian and volunteer forces, requiring civilian channels not to be overloaded with traffic. We explore seven enhancements to the wording of Wireless Emergency Alerts (WEAs) and their effectiveness in getting smartphone users to comply, including reducing frivolous mobile data consumption during critical weather disasters. We conducted a between-subjects survey (N=898), in which participants were either assigned no alert (control) or an alert framed as Basic Information, Altruism, Multimedia, Negative Feedback, Positive Feedback, Reward, or Punishment. We find that Basic Information alerts resulted in the largest reduction of multimedia and video services usage; we also find that Punishment alerts have the lowest absolute compliance. This work has implications for creating more effective WEAs and providing a better understanding of how wording can affect emergency alert compliance.

NIMay 12, 2019
Learning-based Resource Optimization in Ultra Reliable Low Latency HetNets

Mohammad Yousefvand, Kenza Hamidouche, Narayan B. Mandayam

In this paper, the problems of user offloading and resource optimization are jointly addressed to support ultra-reliable and low latency communications (URLLC) in HetNets. In particular, a multi-tier network with a single macro base station (MBS) and multiple overlaid small cell base stations (SBSs) is considered that includes users with different latency and reliability constraints. Modeling the latency and reliability constraints of users with probabilistic guarantees, the joint problem of user offloading and resource allocation (JUR) in a URLLC setting is formulated as an optimization problem to minimize the cost of serving users for the MBS. In the considered scheme, SBSs bid to serve URLLC users under their coverage at a given price, and the MBS decides whether to serve each user locally or to offload it to one of the overlaid SBSs. Since the JUR optimization is NP-hard, we propose a low complexity learning-based heuristic method (LHM) which includes a support vector machine-based user association model and a convex resource optimization (CRO) algorithm. To further reduce the delay, we propose an alternating direction method of multipliers (ADMM)-based solution to the CRO problem. Simulation results show that using LHM, the MBS significantly decreases the spectrum access delay for users (by $\sim$ 93\%) as compared to JUR, while also reducing its bandwidth and power costs in serving users (by $\sim$ 33\%) as compared to directly serving users without offloading.