稳健性(进化)
计算机科学
测地线
无线传感器网络
贪婪算法
信仰传播
最短路径问题
集合(抽象数据类型)
路径(计算)
算法
图形
数学
理论计算机科学
计算机网络
数学分析
生物化学
化学
解码方法
基因
程序设计语言
作者
Zhen Wang,Dongpeng Hou,Chao Gao,Jiajin Huang,Qi Xuan
标识
DOI:10.1145/3485447.3512184
摘要
Recently, the rapid diffusion of malicious information in online social networks causes great harm to our society. Therefore, it is of great significance to localize diffusion sources as early as possible to stem the spread of malicious information. This paper proposes a novel sensor-based method, called greedy full-order neighbor localization (denoted as GFNL), to solve this problem under a low infection propagation in line with the real world. More specifically, GFNL includes two main components, i.e., the greedy-based sensor deployment strategy (DS) and direction-path-based source estimation strategy (ES). In more detail, to ensure sensors can observe a propagation information as early as possible, a set of sensors is deployed in a network to minimize the geodesic distance (i.e., the distance of the shortest path) between the candidate set and the sensor set based on DS. Then when a fraction of sensors observe a propagation, ES infers the source based on the idea that the distance of the actual propagation path is proportional to the observed time. Compared with some state-of-the-art methods, comprehensive experiments have proved the superiority and robustness of our proposed GFNL.
科研通智能强力驱动
Strongly Powered by AbleSci AI