Energy Efficient Distributed Unequal Clustering Algorithm with Relay Node Selection for Underwater Wireless Sensor Networks

2019 ◽  
pp. 1526-1536
Author(s):  
M. Priyanga ◽  
S. Leones Sherwin Vimalraj ◽  
J. Lydia
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Relay Node ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Unequal Clustering ◽  
Relay Node Selection ◽  
Selection For

LUCA: An Energy-efficient Unequal Clustering Algorithm Using Location Information for Wireless Sensor Networks

2009 ◽  
Vol 56 (4) ◽  
pp. 715-731 ◽  
Author(s):  
Sungryoul Lee ◽  
Han Choe ◽  
Byoungchang Park ◽  
Yukyoung Song ◽  
Chong-kwon Kim
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Wireless Sensor ◽  
Location Information ◽  
Unequal Clustering

Distributed Energy-Efficient Unequal Clustering Mechanism for Wireless Sensor Networks

2011 ◽  
Vol 186 ◽  
pp. 225-229
Author(s):  
Chang Jiang Jiang ◽  
Wei Ren Shi ◽  
Min Xiang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Base Station ◽  
Wireless Sensor ◽  
Distributed Energy ◽  
Unequal Clustering ◽  
Multihop Routing ◽  
Cluster Heads

Unequal clustering mechanism, in combination with inter-cluster multihop routing, provides a new effective way to balance the energy dissipation among nodes and prolong the lifetime of wireless sensor networks. In this paper, a distributed energy-efficient unequal clustering mechanism (DEEUC) is proposed and evaluated. By a time based competitive clustering algorithm, DEEUC partitions all nodes into clusters of unequal size, in which the clusters closer to the base station have smaller size. The cluster heads of these clusters can preserve some more energy for the inter-cluster relay traffic and the “hot-spots” problem can be avoided. For inter-cluster communication, DEEUC adopts an energy-aware multihop routing to reduce the energy consumption of the cluster heads. Simulation results demonstrate that the protocol can efficiently decrease the dead speed of the nodes and prolong the network lifetime

An Energy-Efficient Unequal Clustering Algorithm in Wireless Sensor Networks

2012 ◽  
Vol 629 ◽  
pp. 801-807 ◽  
Author(s):  
Run Ze Wan ◽  
Jian Jun Lei ◽  
Qing Wei Xu ◽  
Xi Mei Gou
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Life Time ◽  
Base Station ◽  
Energy Utilization ◽  
Wireless Sensor ◽  
Unequal Clustering ◽  
Cluster Heads

For wireless sensor networks, clustering algori-thms provides an effective way to prolong the life time using the multi-hop forwarding model. Nevertheless, they rarely consider the hot spots problem and the problem of unbalanced energy consumption among cluster heads. To solve the problems, we proposed an energy-efficient unequal clustering algorithm with the ideal of unequal clustering in the circle area where the cluster heads are in charge of different geographical scope according to different distance to the base station. Considering the cluster heads closer to the BS be burdened with heavy relay traffic, the cluster in inner layers, which is closer to the base station, is smaller than the outer layer. It could reduce the number of cluster members and lead to the proportional energy dissipation in each layer. Simulation results show that our algorithm improve energy utilization and prolonged the life of the entire Wireless Sensor Networks effectively.

Sign in / Sign up

Export Citation Format

Share Document