Abstract

Wireless sensor networks produce a large amount of data that needs to be processed, delivered, and assessed according to the application objectives. Cluster-based is an effective architecture for data-gathering in wireless sensor networks. Clustering provides an effective way for prolonging the lifetime of a wireless sensor network. Current clustering algorithms usually utilize two techniques, selecting cluster heads with more residual energy and rotating cluster heads periodically, in order to distribute the energy consumption among nodes in each cluster and extend the network lifetime. Clustering sensors are divided into groups, so that sensors will communicate information only to cluster heads and then the cluster heads will communicate the aggregated information to the processing center, and this may save energy. In this paper we show Two Relay Sensor Algorithm (TRSA), which divide wireless Sensor Network (WSN) into unequaled clusters, showing that it can effectively save power for maximizing the life time of the network. Simulation results show that the proposed unequal clustering mechanism (TRSA) balances the energy consumption among all sensor nodes and achieves an obvious improvement on the network lifetime.

Highlights

  • A wireless sensor network is a collection of sensor nodes interconnected by wireless communication channels

  • In this paper we propose and evaluate a (TRSA) algorithm which will wisely organize the network into unequaled clustering depending on their unique ID's, where Clusters Head are selected competition which is unlike (LEACH) as in [3], and with no iteration which differs from (HEED) as in [4]

  • [13] Efficient Unequal Clustering (EEUC), the cluster head (CH) chooses a relay node (RN) from its adjacent cluster heads according to the nodes residual energy and its distance to the base station (BS), and the algorithm in [13] is used for selecting the RN

Read more

Summary

INTRODUCTION

A wireless sensor network is a collection of sensor nodes interconnected by wireless communication channels. Each sensor node is a small device that can collect data from its surrounding area, carry out simple computations, and communicate with other sensors or with the base station (BS). Such networks have been realized due to recent advances in micro electromechanical (MEMs) systems and are expected to be widely used for more applications such as environment monitoring, home security, and earthquake warning [1]. The algorithm forms a tree of clusters, rooted at the monitoring node, which initiates the topology discovery process This organization is used for efficient data dissemination and aggregation, duty cycle assignments and network state retrieval.

CLUSTERS IN SENSORS NETWORKS
CONCLUSIONS AND FUTURE WORK
OPTIMAL PARAMETERS FOR THE ALGORITHM
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.