Super Strongly Perfect Graphs in the Selection of Cluster Heads in Wireless Sensor Networks

R. Mary Jeya Jothi; S. Emalda Roslin; N.M. Nandhitha

doi:10.4028/www.scientific.net/AMM.591.206

Paper Titles

Controlling of Faulty Vehicles Using GSM and GPS Technology
p.180

A New GT Heuristic for Solving Multi Objective Job Shop Scheduling Problems
p.184

Improved TCP Congestion Control Mechanism for Multihop Wireless Networks
p.189

Powered Two-Wheeler with Integrated Safety Using Recurdyn Multi-Body Dynamics
p.193

Comparative Analysis of AHP and ANP Model for Lean Production System Justification
p.197

Multi Camera Image Capturing for Robot Soccer
p.202

Super Strongly Perfect Graphs in the Selection of Cluster Heads in Wireless Sensor Networks
p.206

Pulmonary Acoustic Signal Classification Using Autoregressive Coefficients and k-Nearest Neighbor
p.211

Effective Performance of an User Friendly Dynamic Tool Design in Small and Medium Scale Enterprises
p.215

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 591Super Strongly Perfect Graphs in the Selection of...

Super Strongly Perfect Graphs in the Selection of Cluster Heads in Wireless Sensor Networks

Abstract:

Wireless sensor network comprises of dense sensor nodes which are randomly deployed. Major challenges in WSN are limited battery source and computation capacity. Considerable research has been carried out in the area of maximizing battery lifetime by reducing the energy consumption. Once such proposed technique involves hierarchical topology control. Conventionally proposed algorithm for hierarchical topology control involves computationally intensive soft computing tools. It leads to higher energy consumption in the sink node. Hence it necessitates computationally less intensive technique for cluster head selection. In this paper, an efficient cluster head selection is proposed using minimal dominating set in Super Strongly Perfect (SSP) graph.

You might also be interested in these eBooks

Advanced Manufacturing Research and Intelligent Applications

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 591)

Pages:

206-210

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.591.206

Citation:

Cite this paper

Online since:

July 2014

Authors:

R. Mary Jeya Jothi*, S. Emalda Roslin, N.M. Nandhitha

Keywords:

Cluster Head Selection, Energy Efficiency, Minimal Dominating Set, Super Strongly Perfect Graph, Wireless Sensor Network (WSN)

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] A. Amutha, R. Mary Jeya Jothi, Characterization of Super Strongly Perfect Graphs in Bipartite Graphs, International Conference in Engineering and Business Management (ICMEB 2012), 1 (2012), pp.183-185.

DOI: 10.12723/mjs.23.10

Google Scholar

[2] S. Emalda Roslin, C. Gomathy, IBPN: Intelligent Back Propagation Network Based Cluster Head Selection for Energy Efficient Topology Control in Wireless Sensor Network, European Journal of Scientific Research, 79, 4, (2012), pp.541-550.

Google Scholar

[3] M.A. Labrador, P.M. Wightman, Topology Control in Wireless Sensor Networks with a Companion Simulation Tool for Teaching and Research, Springer, (2009).

Google Scholar

[4] R. Mary Jeya Jothi, A Note on the Super Strongly Perfect Structure of Cartesian product of Path Graphs, International conference on Computational Inteligence and Advanced Manufacturing Research( ICCIAMR 2014), 1 (2014) pp.139-143.

Google Scholar

[5] Rekha chakravarthi, C. Gomathy, IPD: Intelligent Packet Dropping Algorithm for Congestion Control in Wireless Sensor Network, IEEE International conference on Trends in Information Science and computing (TISC 2010), 2010, pp.246-249.

DOI: 10.1109/tisc.2010.5714644

Google Scholar