Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Distributed Load Balancing Algorithm for Wireless Sensor Network


Affiliations
1 Department of Computer Science and Engineering, Annamacharya Institute of Technology and Sciences, Tirupati, India
2 Department of Computer Science and Engineering, Universal College of Engineering and Technology, Vallioor, India
3 Department of Computer Science, The Madurai Diraviyam Thayumanavar Hindu College, India
     

   Subscribe/Renew Journal


A Wireless Sensor Network (WSN) comprises of spatially scattered autonomous sensors to screen physical or natural conditions and to amiably go their information through the system to a Base Station. Grouping is a basic assignment in Wireless Sensor Networks for vitality effectiveness and system quality. Grouping through Central Processing Unit in remote sensor systems is outstanding and being used for quite a while. In this paper, we propose a few procedures that balance the vitality utilization of these hubs and guarantee greatest system lifetime by adjusting the activity stack as similarly as could be expected under the circumstances. Directly grouping through dispersed strategies is being produced for conveying with the issues like system lifetime and vitality. In our work, we connected both concentrated and conveyed k-means clustering calculation in system test system. K-means is a model based algorithm that surrogates between two noteworthy advances, passing on perceptions to groups and processing cluster focuses until the point when a ceasing standard is satisfied. Improved results are accomplished and related which demonstrate that conveyed clustering is compelling than brought together grouping.

Keywords

Wireless Sensor Network, Clustering, K-Means, Network Stability.
Subscription Login to verify subscription
User
Notifications
Font Size


  • Distributed Load Balancing Algorithm for Wireless Sensor Network

Abstract Views: 850  |  PDF Views: 1

Authors

K. Navaz
Department of Computer Science and Engineering, Annamacharya Institute of Technology and Sciences, Tirupati, India
S. Athinarayanan
Department of Computer Science and Engineering, Annamacharya Institute of Technology and Sciences, Tirupati, India
S. Sameena
Department of Computer Science and Engineering, Universal College of Engineering and Technology, Vallioor, India
R. Kavitha
Department of Computer Science, The Madurai Diraviyam Thayumanavar Hindu College, India

Abstract


A Wireless Sensor Network (WSN) comprises of spatially scattered autonomous sensors to screen physical or natural conditions and to amiably go their information through the system to a Base Station. Grouping is a basic assignment in Wireless Sensor Networks for vitality effectiveness and system quality. Grouping through Central Processing Unit in remote sensor systems is outstanding and being used for quite a while. In this paper, we propose a few procedures that balance the vitality utilization of these hubs and guarantee greatest system lifetime by adjusting the activity stack as similarly as could be expected under the circumstances. Directly grouping through dispersed strategies is being produced for conveying with the issues like system lifetime and vitality. In our work, we connected both concentrated and conveyed k-means clustering calculation in system test system. K-means is a model based algorithm that surrogates between two noteworthy advances, passing on perceptions to groups and processing cluster focuses until the point when a ceasing standard is satisfied. Improved results are accomplished and related which demonstrate that conveyed clustering is compelling than brought together grouping.

Keywords


Wireless Sensor Network, Clustering, K-Means, Network Stability.

References