Informatics Publishing Limited

M. Rajesh Babu ¹, S. Selvan ²

Affiliations
1 Department of CSE, PSG College of Technology, Coimbatore, IN
2 Francis Xavier Engineering College, Tirunelveli, IN

Abstract

A mobile ad hoc Network (MANET) is a mobile mesh network in which the wireless nodes are both hosts and routers, so they can communicate without base stations. It relies on the cooperation of all the participating nodes. The cooperation requires detecting routes and forwarding packets. The proper functioning of mobile ad hoc networks depends on the hypothesis that each individual node is ready to forward packets to all other nodes. Due to the movement of nodes from various places, the nodes can become malicious by the intruders or by any other failures. Even though many secured routing protocols can be proposed for security issues, they can only detect the failures in the route discovery. Our mechanism provides the secured route discovery against the malicious nodes even the data transfer begins in the route path. If the malicious node has been found, it drops the packets from the node and informs the source and destination node to change the path of the data transfer from the node listing.

Keywords

AODV, ESRP, Intruders. Routing Protocol.

Full Text

     

M. Rajesh Babu ¹, S. Selvan ²

Affiliations
1 PSG College of Technology, Coimbatore, Tamil Nadu 641004, IN
2 St.Peters College of Engineering, Chennai, Tamil Nadu 600054, IN

Abstract

In mobile adhoc networks, an attacker can easily disrupt the functioning of the network by attacking the underlying routing protocol. Several secured routing protocols have been proposed so far, for adhoc networks. But all of them have certain disadvantages. Hence, security in ad hoc networks is still a debatable area. In this paper, we propose to develop a Secure Authenticated Routing Protocol (SARP) for mobile adhoc networks, that uses a lightweight, attack resistant authentication mechanism. Our protocol provides an efficient security against route discovery attacks in MANET routing protocols. It quickly detects the malicious nodes, thus assisting the nodes to drop the invalid packets, earlier. It prevents malicious or compromised nodes from attacking the routes with uncompromised nodes. It also prevents a variety of denial-ofservice (DoS) attacks. Detailed simulation studies have confirmed the efficiency and effectiveness of SARP.

Keywords

AODV, Mobile Ad Hoc Networks, Routing Protocols, SAODV, SARP, Security.

Full Text

     

C. Palanisamy ¹, S. Selvan ²

Affiliations
1 Department of Information Technology, Bannari Amman Institute of Technology, Tamil Nadu, IN
2 Alpha Engineering College, Chennai, Tamil Nadu, IN

Abstract

Most of the subspace clustering algorithms uses monotonicity property to generate higher dimensional subspaces. But this property is not applicable here since different subspace cardinalities have varying densities ie., if a k-dimensional unit is dense, any (k-1) dimensional projection of this unit may not be dense. So in DENCOS a mechanism to compute upper bounds of region densities to constrain the search of dense regions is devised, where the regions whose density upper bounds are lower than the density thresholds will be pruned away in identifying the dense regions. They compute the region density upper bounds by utilizing a data structure, DFP-tree to store the summarized information of the dense regions. DFP-Tree employs FP-Growth algorithm and builds an FP-Tree based on the prefix tree concept and uses it during the entire subspace identification process. This method performs repeated horizontal traversals of the data to generate relevant subspaces which is time consuming. To reduce the time complexity, we employ ITL data structure to build Density Conscious ITL (DITL) tree to be used in the entire subspace identification process. ITL reduces the cost by scanning the database only once, by significantly reducing the horizontal traversals of the database. The algorithm is evaluated through experiments on a collection of benchmark data sets datasets. Experimental results have shown favourable performance compared with other popular clustering algorithms.

Keywords

Subspace Clustering, ITL Tree, Recall, Precision.

Full Text

     

R. V. Nataraj ¹, S. Selvan ²

Affiliations
1 Department of Information Technology, PSG College of Technology, Tamil Nadu, IN
2 Department of Computer Science and Engineering, Alpha Engineering College, Tamil Nadu, IN

Abstract

In this paper, we propose a parallel algorithm for mining maximal itemsets. We propose POP-MAX (Parallel Order Preserving MAXimal itemset algorithm), a fast and memory efficient parallel algorithm which enumerates all the maximal patterns concurrently and independently across several nodes. Also, POP-MAX uses an efficient maximality checking technique which determines the maximality of an itemset using less number of items. To enhance the load sharing among different nodes, we have used round robin strategy which achieves load balancing as high as 90%. We have also incorporated bit-vectors and numerous optimizations to reduce the memory consumption and overall running time of the algorithm. Our comprehensive experimental analyses involving both real and synthetic datasets show that our algorithm takes less memory and less running time than other maximal itemset mining algorithms.

Keywords

Data Mining, Closed Itemsets, Maximal Itemsets, Mining Methods.

Full Text