TY - JOUR
T1 - UAV-assisted Emergency Communications in Social IoT: A Dynamic Hypergraph Coloring Approach
AU - Wang, Bowen
AU - Sun, Yanjing
AU - Sun, Zhi
AU - Duong, Trung Q.
AU - Nguyen, Long D.
PY - 2020/4/17
Y1 - 2020/4/17
N2 - In this paper, we address social-awareness property and unmanned aerial vehicle (UAV) assisted information diffusion in emergency scenarios, where the UAVs can disseminate alert messages to a set of terrestrial users within their coverage, and then these users can continuously disseminate the received data packets to their socially connected users in a device-to-device (D2D) multicast manner. In this regard, we have to solve both the dynamic cluster formation and spectrum sharing problems in stochastic environments, since both the UAVs and terrestrial users may arrive or depart suddenly. For the cluster formation problem, considering that the data rate of a multicast cluster is determined by the member with worst link condition, we formulate it as a many-to-one matching game and adopt the rotation-swap algorithm to maximize the expected number of users receiving the alerting messages in each time slot. For the dynamic spectrum sharing problem, aiming at eliminating the interference while minimizing the channel switching cost, we propose a dynamic hypergraph coloring approach to model the cumulative interference and maintain the mutual interference at a low level by exploring a small number of vertexes, when the graph is dynamically updated, i.e., the insertion/deletion of vertex/edge. Moreover, we prove some crucial properties including global stability, convergence, and complexity. Finally, simulation results shows that our proposed approach can achieve a better trade-off among the information diffusion speed, channel switch cost, and complexity.
AB - In this paper, we address social-awareness property and unmanned aerial vehicle (UAV) assisted information diffusion in emergency scenarios, where the UAVs can disseminate alert messages to a set of terrestrial users within their coverage, and then these users can continuously disseminate the received data packets to their socially connected users in a device-to-device (D2D) multicast manner. In this regard, we have to solve both the dynamic cluster formation and spectrum sharing problems in stochastic environments, since both the UAVs and terrestrial users may arrive or depart suddenly. For the cluster formation problem, considering that the data rate of a multicast cluster is determined by the member with worst link condition, we formulate it as a many-to-one matching game and adopt the rotation-swap algorithm to maximize the expected number of users receiving the alerting messages in each time slot. For the dynamic spectrum sharing problem, aiming at eliminating the interference while minimizing the channel switching cost, we propose a dynamic hypergraph coloring approach to model the cumulative interference and maintain the mutual interference at a low level by exploring a small number of vertexes, when the graph is dynamically updated, i.e., the insertion/deletion of vertex/edge. Moreover, we prove some crucial properties including global stability, convergence, and complexity. Finally, simulation results shows that our proposed approach can achieve a better trade-off among the information diffusion speed, channel switch cost, and complexity.
U2 - 10.1109/JIOT.2020.2988445
DO - 10.1109/JIOT.2020.2988445
M3 - Article
SN - 2327-4662
JO - IEEE Internet of Things Journal
JF - IEEE Internet of Things Journal
ER -