Equal Spacing Grouping Network algorithm for chain WSN
Anbang Zhao, Cheng He, Bin Zhou, Tiansi An, Zhongcheng Ma · 2012
Limited by actual situation, WSN (Wireless Sensor Network) always possesses chain structure. This structure has been used in many engineering situations, so there is a practical significance and value to increase the lifetime of WSN in this structure. Survival time is a very important indicator of WSN. In order to extend life time and reduce power consumption of those WSNs, Equal Spacing Grouping Network (ESGN) algorithm is proposed. This algorithm divides a entire network into many sub-networks which interweaved with each other, data packets in those sub-networks are aggregated to coordinator through the nodes nearby. In this way, the burden of the node on the neighbor of coordinator is shared by several nodes. So the maximum power consumption of nodes in network is reduced, and the entire network life time is extended at the same time. In this paper, the conclusion that ESGN is able to extend network lifetime is proved by formula derivation, assumption calculus and MATLAB simulation. Compared with good-performance BCBRP algorithm, up to about 50% of energy consumption is saved at most.