Browsing by Author "Krishnan, A"

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    An Improved Hybrid Routing Protocol for Mobile Ad Hoc Networks
    (INFLIBNET Centre, 2005-02-02) Kamalakkannan, V; Karthikeyani, V; Krishnan, A
    A novel routing scheme for mobile ad hoc networks (MANETs), which combines the ondemand routing capability of Ad Hoc On-Demand Distance Vector (AODV) routing protocol with a distributed topology discovery mechanism using ant-like mobile agents is proposed in this paper. The proposed hybrid protocol reduces route discovery latency and the end-toend delay by providing high connectivity without requiring much of the scarce network capacity. On the one side the proactive routing protocols in MANETs like Destination Sequenced Distance Vector (DSDV) require to know, the topology of the entire network. Hence they are not suitable for highly dynamic networks such as MANETs, since the topology update information needs to be propagated frequently throughout the network. These frequent broadcasts limit the available network capacity for actual data communication. On the other hand, on-demand, reactive routing schemes like AODV and Dynamic Source Routing (DSR), require the actual transmission of the data to be delayed until the route is discovered. Due to this long delay a pure reactive routing protocol may not be applicable for real-time data and multimedia communication. Through extensive simulations in this paper it is proved that the proposed Ant-AODV hybrid routing technique, is able to achieve reduced end-to-end delay compared to conventional ant-based and AODV routing protocols.
  • Thumbnail Image
    Item
    Mining Frequent Item Sets More Efficiently Using ITL Mining
    (INFLIBNET Centre, 2005-02-02) Hemalatha, R; Krishnan, A; Hemamathi, R
    Correlated The discovery of association rules is an important problem in data mining. It is a two-step process consisting of finding the frequent itemsets and generating association rules from them. Most of the research attention is focused on efficient methods of finding frequent itemsets because it is computationally the most expensive step. This paper presents a new data structure and a more efficient algorithm for mining frequent itemsets from typical data sets. The improvement is achieved by scanning the database just once and by reducing item traversals within transactions. The performance comparisons of the algorithm against the fastest Apriori implementation and the recently developed H-Mine algorithm are given here. These results show that the algorithm outperforms both Apriori and H-mine on several widely used test data sets.
  • Thumbnail Image
    Item
    Mining of Confidence-Closed Correlated Patterns Efficiently
    (INFLIBNET Centre, 2005-02-02) Hemalatha, R; Krishnan, A; Senthamarai, C; Hemamalini, R
    Correlated pattern mining has become increasingly important recently as an alternative or an augmentation of association rule mining. Though correlated pattern mining discloses the correlation relationships among data objects and reduces significantly the number of patterns produced by the association mining, it still generates quite a large number of patterns. This paper proposes closed correlated pattern mining to reduce the number of the correlated patterns produced without information loss. A new notion of the confidenceclosed correlated patterns is proposed first, and then an efficient algorithm is present, called CCMine, for mining those patterns. Confidence closed pattern mining reduces the number of patterns by at least an order of magnitude. It also shows that CCMine outperforms a simple method making use of the traditional closed pattern miner. Confidence-closed pattern mining is a valuable approach to condensing correlated patterns.