Connectivity guaranteed cluster header selection scheme based on spectra analysis of graph

Author

Xie, Fenglin ; Feng, Zhiyong ; Wei, Zhiqing

Author_Institution

Key Lab. of Universal Wireless Commun., Beijing Univ. of Posts & Telecommun., Beijing, China

fYear

2011

fDate

9-11 Nov. 2011

Firstpage

1

Lastpage

5

Abstract

A novel cluster header selection scheme in Wireless Sensor Network is proposed in this paper. Based on algebraic graph theory, the ranking of nodes is done by using the principal eigenvector of the connection matrix. The place of a node in the rank reveals the node´s capability to communicate with other nodes. Thus, the top node is definitely the cluster header. This rank-based mechanism can select the most appropriate cluster header. Therefore the energy consumption of data-gathering can be reduced and the network lifetime will be extended. In general, Matrix Iteration Approach (MIA) is used to find the eigenvalue and eigenvector of a matrix by most people. As the complexity of MIA is high and a single node can not meet the requirements of space and time for calculation, a parallel computing architecture is designed to find the principal eigenvector.

Keywords

energy consumption; graph theory; iterative methods; wireless sensor networks; connection matrix; connectivity guaranteed cluster header selection; energy consumption; graph theory; matrix iteration approach; parallel computing architecture; spectra analysis; wireless sensor network; Clustering algorithms; Delay; Equations; Mathematical model; Routing; Vectors; Wireless sensor networks; Algebraic Graph Theory; Cluster Header Selection; Spectra of Graph;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications and Signal Processing (WCSP), 2011 International Conference on

Conference_Location

Nanjing

Print_ISBN

978-1-4577-1009-4

Electronic_ISBN

978-1-4577-1008-7

Type

conf

DOI

10.1109/WCSP.2011.6096904

Filename

6096904