Grid-based cluster head selection algorithm in wireless sensor networks

Cun Xiang Chen, Zun Wen He, Jing Ming Kuang, Hong Mei Sun

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

Although low-energy adaptive clustering hierarchy (LEACH) protocol adopts distributed clustering algorithm and randomized rotation of Cluster Heads (CHs) mechanism to reduce energy consumption, election of CHs without residual energy and position information of each nodes brings about irregular distribution of CH, low network coverage and short lifecycle. In order to avoid these shortcomings, a Grid-based Cluster Head Selection (GCHS) is proposed. Referring to sensing distance, network is divided into several grids equivalent to independent clusters which can meet network coverage and connectivity. Furthermore, CH is selected ground on residual energy level of each node. Simulation taking full advantage of concept mentioned above manifests that it achieves a significant improvement in network coverage and lifecycle.

Original languageEnglish
Title of host publicationMechanical Engineering, Industrial Electronics and Information Technology Applications in Industry
Pages1497-1501
Number of pages5
DOIs
Publication statusPublished - 2013
Event2nd International Conference on Mechanical Engineering, Industrial Electronics and Informatization, MEIEI 2013 - Chongqing, China
Duration: 14 Sept 201315 Sept 2013

Publication series

NameApplied Mechanics and Materials
Volume427-429
ISSN (Print)1660-9336
ISSN (Electronic)1662-7482

Conference

Conference2nd International Conference on Mechanical Engineering, Industrial Electronics and Informatization, MEIEI 2013
Country/TerritoryChina
CityChongqing
Period14/09/1315/09/13

Keywords

  • Coverage
  • Grid
  • Network s lifecycle
  • Wireless sensor networks

Fingerprint

Dive into the research topics of 'Grid-based cluster head selection algorithm in wireless sensor networks'. Together they form a unique fingerprint.

Cite this