TY - GEN
T1 - PRIDE
T2 - 15th International Conference on Information and Communications Security, ICICS 2013
AU - Hassanzadeh, Amin
AU - Xu, Zhaoyan
AU - Stoleru, Radu
AU - Gu, Guofei
AU - Polychronakis, Michalis
PY - 2013
Y1 - 2013
N2 - As interest in wireless mesh networks grows, security challenges, e.g., intrusion detection, become of paramount importance. Traditional solutions for intrusion detection assign full IDS responsibilities to a few selected nodes. Recent results, however, have shown that a mesh router cannot reliably perform full IDS functions because of limited resources (i.e., processing power and memory). Cooperative IDS solutions, targeting resource constrained wireless networks impose high communication overhead and detection latency. To address these challenges, we propose PRIDE (PRactical Intrusion DEtection in resource constrained wireless mesh networks), a non-cooperative real-time intrusion detection scheme that optimally distributes IDS functions to nodes along traffic paths, such that detection rate is maximized, while resource consumption is below a given threshold. We formulate the optimal IDS function distribution as an integer linear program and propose algorithms for solving it accurately and fast (i.e., practical). We evaluate the performance of our proposed solution in a real-world, department-wide, mesh network.
AB - As interest in wireless mesh networks grows, security challenges, e.g., intrusion detection, become of paramount importance. Traditional solutions for intrusion detection assign full IDS responsibilities to a few selected nodes. Recent results, however, have shown that a mesh router cannot reliably perform full IDS functions because of limited resources (i.e., processing power and memory). Cooperative IDS solutions, targeting resource constrained wireless networks impose high communication overhead and detection latency. To address these challenges, we propose PRIDE (PRactical Intrusion DEtection in resource constrained wireless mesh networks), a non-cooperative real-time intrusion detection scheme that optimally distributes IDS functions to nodes along traffic paths, such that detection rate is maximized, while resource consumption is below a given threshold. We formulate the optimal IDS function distribution as an integer linear program and propose algorithms for solving it accurately and fast (i.e., practical). We evaluate the performance of our proposed solution in a real-world, department-wide, mesh network.
KW - Integer linear programming
KW - Intrusion detection
KW - Real-world implementation
KW - Resource constraints
KW - Wireless mesh network
UR - https://www.scopus.com/pages/publications/84893717040
U2 - 10.1007/978-3-319-02726-5_16
DO - 10.1007/978-3-319-02726-5_16
M3 - Conference contribution
SN - 9783319027258
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 213
EP - 228
BT - Information and Communications Security - 15th International Conference, ICICS 2013, Proceedings
Y2 - 20 November 2013 through 22 November 2013
ER -