A Clusters Algorithm Based on the Threshold for Wireless Sensor Network

被引:0
作者
Ming-hua, Liao [1 ]
Hua, Zhang [1 ]
机构
[1] Hunan Univ Finance & Econ, Changsha 410205, Hunan, Peoples R China
来源
SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING: THEORY AND PRACTICE, VOL 1 | 2012年 / 114卷
关键词
Wireless sensor network; Hierarchical clustering; Threshold; State transition;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Nodes need constant detect channel of LEACH agreement in clusters processing. According to strength of the cluster head signal, it determines to join what clusters. This process also needs to consume more energy. On the basis of this agreement, a new algorithm uses CSMA mode in the process of grouping clusters. It introduces a signal intensity threshold to decide that nodes should join what clusters. The nodes still adopt the conversion of work and dormancy state. The new algorithm reduces the receiving nodes. And it processes the signals that cluster head nodes and other nodes send. The simulation shows that the new algorithm consumes lower energy than LEACH algorithm and prolongs the network life cycle.
引用
收藏
页码:1065 / 1071
页数:7
相关论文
共 7 条
  • [1] Routing techniques in wireless sensor networks: A survey
    Al-Karaki, JN
    Kamal, AE
    [J]. IEEE WIRELESS COMMUNICATIONS, 2004, 11 (06) : 6 - 28
  • [2] [Anonymous], 2002, IEEE COMMUNICATIONS, V40, P102
  • [3] Bo S., 2006, CLUSTER BASED ROUTIN, V17, P1588
  • [4] Heiniger R. W., 2000, Proceedings of the 5th International Conference on Precision Agriculture, Bloomington, Minnesota, USA, 16-19 July, 2000, P1
  • [5] An application-specific protocol architecture for wireless microsensor networks
    Heinzelman, WB
    Chandrakasan, AP
    Balakrishnan, H
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2002, 1 (04) : 660 - 670
  • [6] PEGASIS: Power-efficient GAthering in sensor information systems
    Lindsey, S
    Raghavendra, CS
    [J]. 2002 IEEE AEROSPACE CONFERENCE PROCEEDINGS, VOLS 1-7, 2002, : 1125 - 1130
  • [7] Manjeshwar A., 2001, P 1 INT WORKSHOP PAR, P2009, DOI DOI 10.1109/IPDPS.2001.925197