Browsing by Author "Janakiraman, T.N."

Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    Image Segmentation using Euler Graphs
    (CCC Publications, 2010-09-01) Janakiraman, T.N.; Chandra Mouli, P.V.S.S.R.
    This paper presents a new algorithm for image segmentation problem using the concepts of Euler graphs in graph theory. By treating image as an undirected weighted non-planar finite graph (G), image segmentation is handled as graph partitioning problem. The proposed method locates region boundaries or clusters and runs in polynomial time. Subjective comparison and objective evaluation shows the efficacy of the proposed approach in different image domains. © 2006-2010 by CCC Publications.
  • No Thumbnail Available
    Item
    Self-Load balanced clustering algorithm for routing in wireless sensor networks
    (Modern Education and Computer Science Press, 2017-09-08) Chinnasamy, Sivaraj; Alphonse, P.J.A.; Janakiraman, T.N.
    Energy-efficient routing is an extremely critical issue in unattended, tiny and battery equipped Wireless Sensor Networks (WSNs). Clustering the network is a promising approach for energy aware routing in WSN, as it has a hierarchical structure. The Connected Dominating Set (CDS) is an appropriate and prominent approach for cluster formation. This paper proposes an Energy-efficient Self-load Balanced Clustering algorithm (SLBC) for routing in WSN. SLBC has two phases: The first phase clusters the network by constructing greedy connected dominating set and the nodes are evenly distributed among them, using the defined parent fitness cost. The second phase performs data manipulations and new on-demand re-clustering. The efficiency of the proposed algorithm is analysed through simulation study. The obtained results show that SLBC outperforms than the recent algorithms like GSTEB and DGA-EBCDS in terms of network lifetime, CDS size, load dissemination, and efficient energy utilization of the network.