1 citations · 2 across the 3 of their papers we have counts for
Showing cs.NIShow all
2 papers · 1 filter
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.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…