PxGa3kZMUZUBKLUOGeVl9hEoQcWYr70Ktj5iXBRAUedsILz808zGanjTQ07X
Current position: Home >> Scientific Research >> Paper Publications

Compromising Ad-hoc Networks by Attacking Weakly Connected Dominating Set

Release Time:2019-03-11  Hits:

Indexed by: Conference Paper

Date of Publication: 2015-07-08

Included Journals: Scopus、SCIE、CPCI-S、EI

Page Number: 213-220

Abstract: As a special kind of attack, the node compromise attack destroy security, reliability and confidentiality of ad-hoc networks. However, previous research paid little attention on developing general attacking models, which are fundamentals for designing network security mechanisms. In this paper, we approach node compromise attack formalizing problem from an adversarial view and present a general attacking model based on invading virtual backbones of network, which is constructed based on Weakly Connected Dominating Set (WCDS). To investigate the features of our scheme, simulations are conducted to illustrate the influences of infection ratio to network performance. Analysis and simulations results showed that bigger infection ratio can reduce set of compromised nodes, enhance attacking efficiency, save resource expenditure and shorten attacking time.

Prev One:Maximizing destructiveness of node capture attack in wireless sensor networks

Next One:A Multi-node Renewable Algorithm Based on Charging Range in Large-scale Wireless Sensor Network