۱٫ Introduction

۲٫ Related Research

۳٫ Propose Algorithm

۴٫ Simulation Results

۵٫ Conclusion

References

The energy of a node in Wireless Sensor Networks (WSNs) is limited, so WSNs need energy saving algorithms. We propose an unequal clustering algorithm based on spacing and RE for WSNs (USRE). URSE prolong the lifetime from the two aspects. One is to select some appropriate nodes to become cluster heads (CHs), the other is to ensure the proper distribution of CHs. To reduce the energy consumption, CHs are selected in the nodes closed to the around nodes (ANs). Besides the spacing among the ANs, the residual energy (RE) and number of ANs are the condition for CHs selection. A node with higher RE and more ANs is more likely to be a CH. USRE calculates the minimum distance between two CHs. If a node is close to a selected CH, it won’t be a CH. USRE is compared with other algorithms. The results show that the performance of USRE is better than other algorithms such as network lifetime.

Introduction

The network has a short survival time due to energy constraints, because each sensor node only relies on a battery that can’t be replaced. The limited energy should be used for data acquisition, information processing, data fusion, communication between nodes and communication between nodes and BS. For some WSNs, we can use the charging technology to supplement the energy or replace the batteries, which, of course, can be easily affected by the environment and the cost is high. When sensor nodes are deployed in a remote or dangerous position, they are often unable to be recharged. This will lead to a short network life. WSNs need relevant rules for information processing and communication, that is, to design energy-efficient and effective protocols and structures to use network energy rationally to save energy [3].