State Transition Analysis: A Rule-Based Intrusion Detection Approach
IEEE Transactions on Software Engineering
A cluster-based approach for routing in dynamic networks
ACM SIGCOMM Computer Communication Review
Intrusion detection with neural networks
NIPS '97 Proceedings of the 1997 conference on Advances in neural information processing systems 10
A large scale distributed intrusion detection framework based on attack strategy analysis
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Ad Hoc on-demand distance-vector protocol
Ad hoc networking
Challenges in Intrusion Detection for Wireless Ad-hoc Networks
SAINT-W '03 Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT'03 Workshops)
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
A cooperative intrusion detection system for ad hoc networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
A General Cooperative Intrusion Detection Architecture for MANETs
IWIA '05 Proceedings of the Third IEEE International Workshop on Information Assurance
Toward Secure Low Rate Wireless Personal Area Networks
IEEE Transactions on Mobile Computing
Securely Deliver Data by Multi-path Routing Scheme in Wireless Mesh Networks
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
Hi-index | 0.00 |
Wireless PAN Mesh Network (WMN) is currently going to be standardized and enhanced to take full advantages of the flexible and heterogeneous networks Although the standard (802.15.5) is under-construction, WMNs are expected to become popular as they have the ability to connect all kinds of current networks So far, there is no applied architecture which is efficient enough to completely solve routing and security problems in WMN To assist IEEE P805.15 in routing and security aspects, in this paper, we propose an adaptive algorithm for detecting bogus nodes when they attempt to intrude into the network by attacking routing protocol In addition, a procedure to find the most optimal path between two nodes is presented along with adaptive pre-conditions for WMNs We also show that our algorithm is robust according to the mobility of the nodes and it is easy to implement in currently proposed architectures It can work with many kinds of wireless networks as well as can reduce computational costs.