Hop-by-Hop Worm Propagation with Carryover Epidemic Model in Mobile Sensor Networks
AbstractIn the internet, a worm is usually propagated in a random multi-hop contact manner. However, the attacker will not likely select this random multi-hop propagation approach in a mobile sensor network. This is because multi-hop worm route paths to random vulnerable targets can be often breached due to node mobility, leading to failure of fast worm spread under this strategy. Therefore, an appropriate propagation strategy is needed for mobile sensor worms. To meet this need, we discuss a hop-by-hop worm propagation model in mobile sensor networks. In a hop-by-hop worm propagation model, benign nodes are infected by worm in neighbor-to-neighbor spread manner. Since worm infection occurs in hop-by-hop contact, it is not substantially affected by a route breach incurred by node mobility. We also propose the carryover epidemic model to deal with the worm infection quota deficiency that might occur when employing an epidemic model in a mobile sensor network. We analyze worm infection capability under the carryover epidemic model. Moreover, we simulate hop-by-hop worm propagation with carryover epidemic model by using an ns-2 simulator. The simulation results demonstrate that infection quota carryovers are seldom observed where a node’s maximum speed is no less than 20 m/s. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Ho, J.-W. Hop-by-Hop Worm Propagation with Carryover Epidemic Model in Mobile Sensor Networks. Computers 2015, 4, 283-292.
Ho J-W. Hop-by-Hop Worm Propagation with Carryover Epidemic Model in Mobile Sensor Networks. Computers. 2015; 4(4):283-292.Chicago/Turabian Style
Ho, Jun-Won. 2015. "Hop-by-Hop Worm Propagation with Carryover Epidemic Model in Mobile Sensor Networks." Computers 4, no. 4: 283-292.