A Distributed Clustering Algorithm for Wireless Sensor Networks

被引:0
作者
Lv, T. [1 ]
Cai, Z. B. [1 ]
机构
[1] Southwest Univ Sci & Technol, Sch Natl Def Sci & Technol, Mianyang, Sichuan, Peoples R China
来源
INTERNATIONAL CONFERENCE ON ADVANCED MANAGEMENT SCIENCE AND INFORMATION ENGINEERING (AMSIE 2015) | 2015年
关键词
LEACH; DCOS; wireless sensor networks; distributed clustering algorithm;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
A Clustering algorithm is designed to balance the network energy consumption, thereby maximizing network lifetime. In the clustering algorithm, the cluster head is generated in the comprehensive consideration of the minimum number of nodes in the overlay network, and the node residual energy and the number of neighboring nodes, during the operation of the network, setting the maximum wait time for cluster heads may avoid the their energy consumption. Analysis and simulation results show that, compared to several important clustering algorithms, the performance of DCOS is proven to be superior in balancing node energy consumption and prolonging the network lifetime.
引用
收藏
页码:818 / 824
页数:7
相关论文
共 5 条
  • [1] Chamam A., 2009, CONS COMM NETW C 200, P1
  • [2] Heiniger R. W., 2000, Proceedings of the 5th International Conference on Precision Agriculture, Bloomington, Minnesota, USA, 16-19 July, 2000, P1
  • [3] Data gathering algorithms in sensor networks using energy metrics
    Lindsey, S
    Raghavendra, C
    Sivalingam, KM
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2002, 13 (09) : 924 - 935
  • [4] A distributed energy-efficient clustering algorithm with improved coverage in wireless sensor networks
    Liu, Zhixin
    Zheng, Qingchao
    Xue, Liang
    Guan, Xinping
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2012, 28 (05): : 780 - 790
  • [5] HEED: A hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks
    Younis, O
    Fahmy, S
    [J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2004, 3 (04) : 366 - 379