Connectivity Guaranteed Cluster Header Selection Scheme Based on Spectra Analysis of Graph
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.
Cluster Header Selection Algebraic Graph Theory Spectra of Graph.
Fenglin Xie Zhiyong Feng Zhiqing Wei
Key Laboratory of Universal Wireless Communications, Ministry of EducationWireless Technology Innova Key Laboratory of Universal Wireless Communications, Ministry of Education Wireless Technology Innov
国际会议
南京
英文
1-5
2011-11-09（万方平台首次上网日期，不代表论文的发表时间）