TY - GEN
T1 - Constructing an efficient mobility profile of ad-hoc node for mobility-pattern-based anomaly detection in MANET
AU - Chaoli, Cai
AU - Guizani, Sghaier
AU - Song, Ci
AU - Al-Fuqaha, Ala
PY - 2006
Y1 - 2006
N2 - Numerous approaches have been proposed for intrusion detection, especially for anomaly detection, in ad hoc networks. However, little research work has been done in actually implementing such a scheme based on statistical methods. In this paper, we present an efficient anomaly detection algorithm based on a statistical method originated from pattern recognition, which can effectively identify abnormal behavior such as mobility pattern of MANETs. In the proposed algorithm, the mobility pattern of a specific node is characterized by a multi-leaf tree structure, second-level nodes stands for the possible starting points and leaf nodes stand for the destination node of each possible path. Since our algorithm is using statistical method, a normal profile for each node is generated through extensive experiments, where the specific tree generated may have several starting points and ending with several destination points. For each path between any two nodes (parent and children), we can get the distribution of every different mobility pattern. By comparing the mobility patterns with the training data, we can distinguish abnormal nodes from normal behavior nodes in mobile Ad Hoc networks. Simulation results demonstrate that our proposed detection algorithm can achieve good performance in terms of false alarm rate and detection rate for nodes with regular mobility patterns.
AB - Numerous approaches have been proposed for intrusion detection, especially for anomaly detection, in ad hoc networks. However, little research work has been done in actually implementing such a scheme based on statistical methods. In this paper, we present an efficient anomaly detection algorithm based on a statistical method originated from pattern recognition, which can effectively identify abnormal behavior such as mobility pattern of MANETs. In the proposed algorithm, the mobility pattern of a specific node is characterized by a multi-leaf tree structure, second-level nodes stands for the possible starting points and leaf nodes stand for the destination node of each possible path. Since our algorithm is using statistical method, a normal profile for each node is generated through extensive experiments, where the specific tree generated may have several starting points and ending with several destination points. For each path between any two nodes (parent and children), we can get the distribution of every different mobility pattern. By comparing the mobility patterns with the training data, we can distinguish abnormal nodes from normal behavior nodes in mobile Ad Hoc networks. Simulation results demonstrate that our proposed detection algorithm can achieve good performance in terms of false alarm rate and detection rate for nodes with regular mobility patterns.
UR - https://www.scopus.com/pages/publications/50949095724
U2 - 10.1109/GLOCOM.2006.271
DO - 10.1109/GLOCOM.2006.271
M3 - Conference contribution
AN - SCOPUS:50949095724
SN - 142440357X
SN - 9781424403578
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
T2 - IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
Y2 - 27 November 2006 through 1 December 2006
ER -