Research Area:  Wireless Sensor Networks
Heterogeneous wireless sensor network has the advantages of completing complex communication tasks and is widely applied to military, medical, environmental, industrial and commercial, family life and so on. But heterogeneous nodes are expensive, it is necessary to consider how to balance the energy consumption and prolong network lifetime by deploying minimum number of heterogeneous nodes. In this paper, a clustering routing algorithm for heterogeneous wireless sensor network (CHRA) is presented to balance energy and prolong the network lifetime. The proposed routing algorithm computes the optimal number of heterogeneous nodes and selects the cluster heads per round. In CHRA, all common nodes are divided into two kinds. The first kind includes the nodes which transmit data to Sink by heterogeneous node and the others belong to the second kind. Furthermore, the common nodes are clustered per round by LEACH-C. The performance analysis and numerical results show that the proposed routing algorithm can availably prolong network lifetime and stable period. And it also can balance the energy consumption significantly.
Author(s) Name:  Li Chunlin,Bai Jingpan,Gu Jinguang,Yan Xin and Luo Youlong
Journal name:  Ad Hoc Networks
Publisher name:  ELSEVIER
Volume Information:  Volume 72, April 2018, Pages 81-90
Paper Link:   https://www.sciencedirect.com/science/article/abs/pii/S1570870518300301