CONTROLLING EPIDEMICS IN WIRELESS NETWORKS. Ranjan Pal 1 Ayan Nandy 2 Satya Ardhy Wardana 3 Neeli Rashmi Prasad 3 Ramjee Prasad 3 1 University of Southern California, USA 2 Indian Institute of Technology, Kharagpur, India 3 Center for TeleInfrastruktur (CTIF), Aalborg University, Denmark.
Satya Ardhy Wardana3
Neeli Rashmi Prasad3
1University of Southern California, USA
2Indian Institute of Technology, Kharagpur, India
3Center for TeleInfrastruktur (CTIF), Aalborg University, Denmark
Wireless Sensor Network
causing an EPIDEMIC
for a wireless network from a pool of strategies.
in static multihop wireless networks.
Spectral function of the network graph
the eigenvalues of the Laplacian of a graph
Centrality of its vertices
We term thisgraph as a parent graph.
- Initial configuration :
a group of independent nodes in 2-D space.
- a compromised node spreads its virus to its neighboring
nodes after k time units of it being infected.
to model the spreading of the virus (evolution)
- Monitor the spread graph at certain pre-specified time
intervals, then apply our control strategy to the graph
at each interval.
We assume that it is not possible to monitor the network all the time
1) graphs with low values of F (below the threshold)
2) graphs with high values of F (above the threshold)
to prevent an epidemic outbreak in a given parent network.
Treatment of edges whose end vertices result in maximum sum of degrees.
Treatment of edges whose end vertices result in maximum product of degrees.
Treatment of vertices whose degree is the Maximum.
Treatment of edges whose end vertices result in maximum harmonic product of degrees