1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.NI2022★ 1 cited
More Effective Centrality-Based Attacks on Weighted Networks
Balume Mburano, Weisheng Si, Qing Cao +1
Only when understanding hackers' tactics, can we thwart their attacks. With this spirit, this paper studies how hackers can effectively launch the so-called 'targeted node attacks'…
cs.SI2020★ 1 cited
Measuring Network Robustness by Average Network Flow
Weisheng Si, Balume Mburano, Wei Xing Zheng +1
Infrastructure networks such as the Internet backbone and power grids are essential for our everyday lives. With the prevalence of cyber-attacks on them, measuring their robustness…
cs.NI2013
Are Yao Graph and Theta Graph Void Free?
Weisheng Si
Greedy Forwarding algorithm is a widely-used routing algorithm for wireless networks. However, it can fail if network topologies (usually modeled by geometric graphs) contain voids…