Janakiraman T N

Work place: Department of Mathematics, National Institute of Technology, Tiruchirappalli, 620015, INDIA

E-mail: janaki@nitt.edu


Research Interests: Image Processing, Data Structures and Algorithms, Analysis of Algorithms, Models of Computation


Dr. Janakiraman T N is currently working as a Professor in the Department of Mathematics, National Institute of Technology, Tiruchirappalli, India. He has completed his Post graduation at National College, Tiruchirappalli, India in 1983. He did his PhD in Mathematics (Graph Theory and its applications) at Madras University. He was a Postdoctoral Research associate for 1 year (1993-1994) in Madras University. He has two sponsored research projects to his credit and published around 70 papers in refereed National/International journals. His research interests include Pure Graph Theory, Applications of Graph Theory to Fault tolerant networks, Central location problems, Clustering of wired & wireless ad hoc networks, Clustering of cellular and flexible manufacturing models, Image processing, Graph coding and Graph Algorithms.

Author Articles
Self-Load Balanced Clustering Algorithm for Routing in Wireless Sensor Networks

By Sivaraj Chinnasamy Alphonse P J A Janakiraman T N

DOI: https://doi.org/10.5815/ijisa.2017.09.06, Pub. Date: 8 Sep. 2017

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 ļ¬tness 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.

[...] Read more.
Energy-efficient and Load Distributed Clustering Algorithm for Dense Wireless Sensor Networks

By Sivaraj C Alphonse P J A Janakiraman T N

DOI: https://doi.org/10.5815/ijisa.2017.05.05, Pub. Date: 8 May 2017

Wireless sensor networks (WSNs) consist of a large number of tiny sensors with sensing, processing and transmission capabilities. Reducing energy consumption of nodes is one of the major objectives in the design of wireless sensor networks, as sensors have low power batteries. As data collection is the primary objective of WSNs and it consumes more energy, energy-efficient routing is a prominent solution to reduce the sensors energy consumption. This paper proposes an Energy-efficient and Load Distributed Clustering Algorithm (ELDCA) for routing in dense wireless sensor networks to reduce and distribute the sensors’ energy consumption. The network is divided into number of virtual congruent square grids of defined sizes. The algorithm constructs optimal and load balanced clusters at every inner crossing point of grid cells using defined cluster fitness value. As early energy depletion is a major design issue in clustering protocols, the proposed algorithm provides a local substitution for energy suffering clusterheads (CHs). To prove the excellence of the proposed algorithm, extensive simulation experiments are performed under different network scenario. The results are compared with latest routing algorithms in terms of network lifetime, energy dissemination, and energy utilization.

[...] Read more.
Other Articles