earticle

논문검색

A Wireless Sensor Network Clustering Algorithm based on Hypergraph

초록

영어

The paper proposes a clustering algorithm for wireless sensor network based on hypergraph. Under the hypergraph model, a wireless sensor network is mapped to a hypergraph. Then a hierarchical iterative clustering algorithm is applied to the hypergraph, thus dividing the hypergraph into multiple parts. A cluster head is selected from each part. In order to improve the partitioning process, a new modularity function is proposed. Compared with the classic clustering algorithm LEACH, simulation shows that our algorithm performs better in energy consuming and network lifetime.

목차

Abstract
 1. Introduction 
 2. WSN Clustering Algorithm Based On Hypergraph 
  2.1. Hypergraph and Modularity
  2.2. Clustering Algorithm
  2.3. Network Running Mode
 3. Simulation Experiments
 4. Conclusion 
 Acknowledgements
 References

저자정보

  • Xu Qian State Key Lab of Software Engineering, Wuhan University, Wuhan, Hubei, China, School of Computer Science, Wuhan University, Wuhan, Hubei, China
  • Hu Ji-cheng State Key Lab of Software Engineering, Wuhan University, Wuhan, Hubei, China, School of Computer Science, Wuhan University, Wuhan, Hubei, China
  • Lin Hai International School of software, Wuhan University, Wuhan, Hubei, China
  • Kong Ruo-shan International School of software, Wuhan University, Wuhan, Hubei, China
  • Luo Yong-en State Key Lab of Software Engineering, Wuhan University, Wuhan, Hubei, China, School of Computer Science, Wuhan University, Wuhan, Hubei, China
  • Zhu Li Oujiang College, Wenzhou University, Chashan University Town, Wenzhou, Zhejiang, China
  • Mao Hua-qing Oujiang College, Wenzhou University, Chashan University Town, Wenzhou, Zhejiang, China

참고문헌

    ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

    0개의 논문이 장바구니에 담겼습니다.