Wireless Mesh Network (WMN) has been a field of active research in the recent years. Lot of research has focused various routing mechanism but very little effort has been made towards attack detection or intrusion detection. In this paper, we propose an attack detection approach for wireless mesh network using Honeypot technique. A Honeypot is a security resource whose value lies in being probed, attacked or compromised. A honeypot is designed to interact with attackers to collect their attack techniques and behaviors. A collection of such Honeypots laid to effectively trap the attacker is called a Honeynet. In our paper, we propose a honeynet, that is able to trap the attackers by analyzing their attacking techniques and thereby sending the logs to a centralized repository to analyze those logs so as to better understand the technique used for attacking.

Floyd Warshall's Algorithm is a simple and widely used algorithm to compute shortest path between all pairs of vertices in an edge weighted directed graph. It can also be used to detect the presence of negative cycles. Many researchers have given many other approaches for finding all pair shortest path but they reduced the complexity by using complex data structures. In this paper, we suggests a technique for finding shortest path based on Floyd Warshall's algorithm with reduced time complexity and also by not using complex data structures. We present an O(n ) 3 (   ) time algorithm for finding all pair shortest paths. Our proposed algorithm is an improvement on the previous algorithm whose best result was O(n 3 )

No abstract

No abstract