Research on the Low-Energy Minimum Average Distance Algorithm for the Distribution of Cluster-Head Nodes in Wireless Sensor Networks

2012 ◽  
Vol 7 (16) ◽  
pp. 208-213
Author(s):  
YANG Lilin ◽  
Tao LIU

Wireless Sensor Networks (WSN) consists of a large amount of nodes connected in a self-directed manner. The most important problems in WSN are Energy, Routing, Security, etc., price of the sensor nodes and renovation of these networks is reasonable. The sensor node tools included a radio transceiver with an antenna and an energy source, usually a battery. WSN compute the environmental conditions such as temperature, sound, pollution levels, etc., WSN built the network with the help of nodes. A sensor community consists of many detection stations known as sensor nodes, every of which is small, light-weight and portable. Nodes are linked separately. Each node is linked into the sensors. In recent years WSN has grow to be an essential function in real world. The data’s are sent from end to end multiple nodes and gateways, the data’s are connected to other networks such as wireless Ethernet. MGEAR is the existing mechanism. It works with the routing and energy consumption. The principal problem of this work is choosing cluster head, and the selection is based on base station, so the manner is consumes energy. In this paper, develop the novel based hybrid protocol Low Energy Aware Gateway (LEAG). We used Zigbee techniques to reduce energy consumption and routing. Gateway is used to minimize the energy consumption and data is send to the base station. Nodes are used to transmit the data into the cluster head, it transmit the data into gateway and gateway compress and aggregate the data then sent to the base station. Simulation result shows our proposed mechanism consumes less energy, increased throughput, packet delivery ration and secure routing when compared to existing mechanism (MGEAR).


Author(s):  
Wassim Jerbi ◽  
Abderrahmen Guermazi ◽  
Hafedh Trabelsi

The optimum use of coverage in wireless sensor networks (WSNs) is very important. The hierarchical routing protocol LEACH (Low Energy Adaptive Clustering Hierarchy) is referred to as the basic algorithm of distributed clustering protocols. LEACH allows clusters formation. Each cluster has a leader called Cluster Head (CH). The selection of CHs is made with a probabilistic calculation. It is supposed that each non-CH node join a cluster and becomes a cluster member. Nevertheless, some CHs can be concentrated in a specific part of the network. Thus several sensor nodes cannot reach any CH. As a result, the remaining part of the controlled field will not be covered; some sensor nodes will be outside the network. To solve this problem, the authors propose O-LEACH (Orphan Low Energy Adaptive Clustering Hierarchy), a routing protocol that takes into account the orphan nodes. O-LEACH presents two scenarios, a gateway and sub cluster that allow the joining of orphan nodes.


Author(s):  
Bilal Muhammad Khan ◽  
Rabia Bilal

One of the critical and vital parameter of Wireless Sensor Networks (WSNs) is its lifetime. There are various methods to increase WSN lifetime, clustering technique is one of them. In clustering, selection of desired percentage of Cluster Head (CHs) is performed among the sensor nodes (SNs). Selected CHs are responsible to collect data from its member nodes, aggregates the data and finally send to the sink. In this chapter, Fuzzy-TOPSIS techniques based on multi criteria decision making to choose CH efficiently and effectively to maximize the WSN lifetime are presented. These five criteria includes; residual energy, node energy consumption rate, number of neighbor nodes, average distance between neighboring nodes and distance from sink. Threshold based intra-cluster and inter-cluster multi-hop communication mechanism is used to decrease energy consumption. Moreover impact of node density and different type mobility strategies are presented in order to investigate impact over WSN lifetime.


2014 ◽  
Vol 665 ◽  
pp. 745-750
Author(s):  
Qi Gong Chen ◽  
Yong Zhi Wang ◽  
Li Sheng Wei ◽  
Wen Gen Gao

Energy consumption is a hot issue in WSNs (Wireless Sensor Networks). In this paper, we present an improved clustering algorithm. By changing the order of traditional WSNs clustering algorithm, this algorithm uses k-means clustering firstly base on optimal number of cluster head is determined; Then selects cluster head by an improved LEACH (Low Energy Adaptive Clustering Hierarchy) algorithm; Finally, Our experimental results demonstrate that this approach can reduces energy consumption and increases the lifetime of the WSNs.


2020 ◽  
pp. 596-627
Author(s):  
Bilal Muhammad Khan ◽  
Rabia Bilal

One of the critical and vital parameter of Wireless Sensor Networks (WSNs) is its lifetime. There are various methods to increase WSN lifetime, clustering technique is one of them. In clustering, selection of desired percentage of Cluster Head (CHs) is performed among the sensor nodes (SNs). Selected CHs are responsible to collect data from its member nodes, aggregates the data and finally send to the sink. In this chapter, Fuzzy-TOPSIS techniques based on multi criteria decision making to choose CH efficiently and effectively to maximize the WSN lifetime are presented. These five criteria includes; residual energy, node energy consumption rate, number of neighbor nodes, average distance between neighboring nodes and distance from sink. Threshold based intra-cluster and inter-cluster multi-hop communication mechanism is used to decrease energy consumption. Moreover impact of node density and different type mobility strategies are presented in order to investigate impact over WSN lifetime.


Sign in / Sign up

Export Citation Format

Share Document