Compromising Ad-Hoc Networks by Attacking Weakly Connected Dominating Set

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.