Introducing Connected Dominating Set as Selection Feature of Cluster Heads in Hierarchical Protocols of Wireless Sensor Networks

Introducing Connected Dominating Set as Selection Feature of Cluster Heads in Hierarchical Protocols of Wireless Sensor Networks

Chiranjib Patra

Contact

Introducing Connected Dominating Set as Selection Feature of Cluster Heads in Hierarchical Protocols of Wireless Sensor Networks

Article Fingerprint

ReserarchID

CSTNWSXC764

Introducing Connected Dominating Set as Selection Feature of Cluster Heads in Hierarchical Protocols of Wireless Sensor Networks Banner

AI TAKEAWAY

Connecting with the Eternal Ground

Abstract

It has been found that almost all routing protocols do suffer from efficiency of its operation regarding data transfer from one point to another. To overcome this process algorithm regarding the choice of nodes as cluster heads has to be done with utmost care. Failing of this leads to unnecessary dissipation of energy such as generating excess ‘Hello’ messages and less useful data transfer. In this communication we show that the introduction of connected dominating set as one of the metric regarding the choice of cluster head leads to better data transfer and energy consumption. Moreover we implemented this concept in LEACH protocol and found acceptable improvement in the performance parameters of the protocol.

References

18 Cites in Article

Reference Format

Mritunjay Rai,Shekhar Verma,Shashikala Tapaswi (2009). A Power Aware Minimum Connected Dominating Set for Wireless Sensor Networks.
Z Liu,B Wang,Q Tang (2010). Approximation Two Independent Sets Based Connected Dominating Set Construction Algorithm for Wireless Sensor Networks.
D Estrin,R Govindan,J Heidemann,S Kumar (1920). Next century challenges: scalable coordination in sensor networks.
I Akyildiz,W Su,Y Sankarasubramaniam,E Cayirci (2002). Wireless sensor networks: a survey.
S Lindsey,C Raghavendra (2002). Data gathering algorithms in sensor networks using energy metrics.
Ankit Thakkar,K Kotecha (2012). WALEACH: Weight Based Energy Efficient Advanced Leach Algorithm.
Mohammad Razzaque,Simon Dobson (2014). Energy-Efficient Sensing in Wireless Sensor Networks Using Compressed Sensing.
P Kumarawadu,D Dechene,M Luccini,A Sauer (2008). Algorithms for Node Clustering in Wireless Sensor Networks: A Survey.
Alan Amis,Ravi Prakash,T Vuong,D Huynh (2000). Max-min d-cluster formation in wireless ad hoc networks.
Maniak Chatterjee,K Sajal,Damlaturgut Das (2002). WCA: A Weighted Clustering Algorithm for wireless adhoc networks.
Liyang Yu,Neng Wang,Wei Zhang,Chunlei Zheng (2006). GROUP: a Grid-clustering Routing Protocol for. 12. Wireless Sensor Networks.
Wendi Rabiner,Anantha Heinzelman,Chandrakasan,Haribalakrishnan (2000). Energy-Efficient Communication Protocol for Wireless Microsensor Networks.
V Loscrì,G Morabito,S Marano (2005). A Two-Levels Hierarchy for Low-Energy Adaptive Clustering Hierarchy (TL-LEACH).
Ossama Younis,Sonia Fahmy (2004). HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks.
P Kumarawadu,D Dechene,M Luccini,A Sauer (2008). Algorithms for Node Clustering in Wireless Sensor Networks: A Survey.
Benjie Chen,Kyle Jamieson,Hari Balakrishnan,Robert Morris (2002). Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks.
Haowen Chan,Adrian Perrig (2004). ACE: An Emergent Algorithm for Highly Uniform Cluster Formation.
W Heinzelman,A Chandrakasan,H Balakrishnan (2000). An application-specific protocol architecture for wireless microsensor networks.

Download References

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Chiranjib Patra. 2020. \u201cIntroducing Connected Dominating Set as Selection Feature of Cluster Heads in Hierarchical Protocols of Wireless Sensor Networks\u201d. Global Journal of Computer Science and Technology - E: Network, Web & Security GJCST-E Volume 20 (GJCST Volume 20 Issue E1): .

More Citation Formats

Select Citation Style:

Download Citation

Download Article

GJCST Volume 20 Issue E1
Pg. 21- 26

Explore Journals Explore Volume Read This Issue

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords

Not Found

Classification

GJCST-E Classification: C.2.m

Submission ReceivedDecember 10, 2019
Peer Review Double Blind
Handling Editor
Accepted January 3, 2020
Published January 15, 2020

Version of record

v1.2

Issue date

May 12, 2020

Language

Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

View in VR

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

View in 3D

Article Matrices

Total Views: 4707

Total Downloads: 1152

2026 Trends

Published Article

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]