Skip to main navigation Skip to search Skip to main content

A maximum degree and negotiation strategy based clustering algorithm for wireless sensor networks

  • Harbin Institute of Technology

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

Abstract

Clustering algorithm is one of the hotspots for studying routing protocol in wireless sensor networks, which can help to enlarge the network topology and utilize the capacity of channel efficiently. In this paper, we present a maximum degree and negotiation strategy based clustering algorithm to solve the cluster overlapping problem. It selects candidate according to maximum degree and determines the Cluster-Head according to the negotiation strategy. The negotiation strategy can also be applied to the weighted clustering algorithm. The simulation results demonstrate that the proposed algorithms can remove the cluster overlapping phenomenon of the original algorithms and prolong the lifetime of the wireless sensor networks.

Original languageEnglish
Title of host publication2011 IEEE International Instrumentation and Measurement Technology Conference, I2MTC 2011 - Proceedings
Pages1493-1497
Number of pages5
DOIs
StatePublished - 2011
Event2011 IEEE International Instrumentation and Measurement Technology Conference, I2MTC 2011 - Binjiang, Hangzhou, China
Duration: 10 May 201112 May 2011

Publication series

NameConference Record - IEEE Instrumentation and Measurement Technology Conference
ISSN (Print)1091-5281

Conference

Conference2011 IEEE International Instrumentation and Measurement Technology Conference, I2MTC 2011
Country/TerritoryChina
CityBinjiang, Hangzhou
Period10/05/1112/05/11

Keywords

  • clustering algorithm
  • clustering overlapping
  • negotiation strategy
  • wireless sensor networks

Fingerprint

Dive into the research topics of 'A maximum degree and negotiation strategy based clustering algorithm for wireless sensor networks'. Together they form a unique fingerprint.

Cite this