A self-adaptive clustering algorithm for wireless sensor network

Huan Yan*, Zun Wen He, N. Guang Jia

*Corresponding author for this work

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

2 Citations (Scopus)

Abstract

The network routing could be simplified by clustering algorithm in wireless sensor network (WSN). Aimed at the occasion with a large amount of nodes but without whole-network time synchronization mechanism, a self-adaptive clustering algorithm for network topology control is proposed. In this algorithm, the cluster structure can be adjusted automatically according to the nodes distribution and network traffic. By adopting loop-avoidance mechanism, the correctness of routing selection is ensured when adjusting the cluster structure. The simulation results demonstrate that the proposed algorithm can reach the expected effect of self-adjustment.

Original languageEnglish
Title of host publicationProceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009
DOIs
Publication statusPublished - 2009
Event5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009 - Beijing, China
Duration: 24 Sept 200926 Sept 2009

Publication series

NameProceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009

Conference

Conference5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009
Country/TerritoryChina
CityBeijing
Period24/09/0926/09/09

Keywords

  • Clustering
  • Loop-avoidance
  • Self-adaptive
  • Wireless sensor network

Fingerprint

Dive into the research topics of 'A self-adaptive clustering algorithm for wireless sensor network'. Together they form a unique fingerprint.

Cite this