scholarly journals Survey on Multi Agent Energy Efficient Clustering Algorithms in Wireless Sensor Networks

2014 ◽  
Vol 3 (3) ◽  
pp. 172-184
Author(s):  
Nazli Bagherzadeh karimi
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Clustering Algorithms ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Location Awareness ◽  
Multi Agent ◽  
Energy Efficient Clustering

In the last few years, there are many applications for Wireless Sensor Networks (WSNs). One of the main drawbacks of these networks is the limited battery power of sensor nodes. There are many cases to reduce energy consumption in WSNs. One of them is clustering. Sensor nodes partitioned into the clusters so that one is chosen as Cluster Head (CH). Clustering and selection of the proper node as CH is very significant in reducing energy consumption and increasing network lifetime. In this paper, we have surveyed a multi agent clustering algorithms and compared on various parameters like cluster size, cluster count, clusters equality, parameters used in CHs selection, algorithm complexity, types of algorithm used in clustering, nodes location awareness, inter-cluster and intra-cluster topologies, nodes homogeneity and MAC layer communications.

scholarly journals Energy Consumption Based Low Energy Aware Gateway (LEAG) Protocol in Wireless Sensor Networks

2019 ◽  
Vol 8 (5S3) ◽  
pp. 128-132 ◽  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Cluster Head ◽  
Base Station ◽  
Low Energy ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware

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).

A Cluster Algorithm for Wireless Sensor Networks Based on Energy Efficiency

2015 ◽  
Vol 785 ◽  
pp. 744-750
Author(s):  
Lei Gao ◽  
Qun Chen
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Selection Criterion ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Head Node

In order to solve the energy limited problem of sensor nodes in the wireless sensor networks (WSN), a fast clustering algorithm based on energy efficiency for wire1ess sensor networks is presented in this paper. In the system initialization phase, the deployment region is divided into several clusters rapidly. The energy consumption ratio and degree of the node are chosen as the selection criterion for the cluster head. Re-election of the cluster head node at this time became a local trigger behavior. Because of the range of the re-election is within the cluster, which greatly reduces the complexity and computational load to re-elect the cluster head node. Theoretical analysis indicates that the timing complexity of the clustering algorithm is O(1), which shows that the algorithm overhead is small and has nothing to do with the network size n. Simulation results show that clustering algorithm based on energy efficiency can provide better load balancing of cluster heads and less protocol overhead. Clustering algorithm based on energy efficiency can reduce energy consumption and prolong the network lifetime compared with LEACH protocol.

scholarly journals Energy-Efficient Clustering Routing Protocol for Wireless Sensor Networks Based on Yellow Saddle Goatfish Algorithm

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1515 ◽  
Author(s):  
Alma Rodríguez ◽  
Carolina Del-Valle-Soto ◽  
Ramiro Velázquez
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Cluster Structure ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Energy Efficient Clustering

The usage of wireless sensor devices in many applications, such as in the Internet of Things and monitoring in dangerous geographical spaces, has increased in recent years. However, sensor nodes have limited power, and battery replacement is not viable in most cases. Thus, energy savings in Wireless Sensor Networks (WSNs) is the primary concern in the design of efficient communication protocols. Therefore, a novel energy-efficient clustering routing protocol for WSNs based on Yellow Saddle Goatfish Algorithm (YSGA) is proposed. The protocol is intended to intensify the network lifetime by reducing energy consumption. The network considers a base station and a set of cluster heads in its cluster structure. The number of cluster heads and the selection of optimal cluster heads is determined by the YSGA algorithm, while sensor nodes are assigned to its nearest cluster head. The cluster structure of the network is reconfigured by YSGA to ensure an optimal distribution of cluster heads and reduce the transmission distance. Experiments show competitive results and demonstrate that the proposed routing protocol minimizes the energy consumption, improves the lifetime, and prolongs the stability period of the network in comparison with the stated of the art clustering routing protocols.

scholarly journals Game Theoretic Solution for Power Management in IoT-Based Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (18) ◽  
pp. 3835 ◽  
Author(s):  
Muhammad Sohail ◽  
Shafiullah Khan ◽  
Rashid Ahmad ◽  
Dhananjay Singh ◽  
Jaime Lloret
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Smart Cities ◽  
Level Density ◽  
Evolutionary Game ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Ch Selection

Internet of things (IoT) is a very important research area, having many applications such as smart cities, intelligent transportation system, tracing, and smart homes. The underlying technology for IoT are wireless sensor networks (WSN). The selection of cluster head (CH) is significant as a part of the WSN’s optimization in the context of energy consumption. In WSNs, the nodes operate on a very limited energy source, therefore, the routing protocols designed must meet the optimal utilization of energy consumption in such networks. Evolutionary games can be designed to meet this aspect by providing an adequately efficient CH selection mechanism. In such types of mechanisms, the network nodes are considered intelligent and independent to select their own strategies. However, the existing mechanisms do not consider a combination of many possible parameters associated with the smart nodes in WSNs, such as remaining energy, selfishness, hop-level, density, and degree of connectivity. In our work, we designed an evolutionary game-based approach for CH selection, combined with some vital parameters associated with sensor nodes and the entire networks. The nodes are assumed to be smart, therefore, the aspect of being selfish is also addressed in this work. The simulation results indicate that our work performs much better than typical evolutionary game-based approaches.

Minimizing Energy Consumption Based on Neural Network in Clustered Wireless Sensor Networks

2019 ◽  
Vol 16 (2) ◽  
pp. 496-502
Author(s):  
N. Vadivelan ◽  
A. Ramamurthy ◽  
P. Padmaja
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Physical Phenomenon ◽  
Geographical Area ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Head Node ◽  
Large Geographical Area

Wireless sensor networks were organized with the collections of sensor nodes for the purpose of monitoring physical phenomenon such as temperature, humidity and seismic events, etc., in the real world environments where the manual human access is not possible. The major tasks of this type of networks are to route the information to sink systems in the sensor network from sensor nodes. Sensors are deployed in a large geographical area where human cannot enter such as volcanic eruption or under the deep sea. Hence sensors are not rechargeable and limited with battery backup; it is very complicated to provide the continuous service of sending information to sink systems from sensor nodes. To overcome the drawback of limited battery power, this paper proposes the concept of minimizing energy consumption with the help of neural networks. The modified form of HRP protocol called energy efficient HRP protocol has been implemented in this paper. Based on this concept, the workload of cluster head is shared by the cluster isolation node in order to increase the lifetime of the cluster head node. Also cluster monitoring node is introduced to reduce the re-clustering process. The implementation procedure, algorithm, results and conclusions were proved that the proposed concept is better than the existing protocols.

scholarly journals A New Energy Efficient Multitier Deterministic Energy-Efficient Clustering Routing Protocol for Wireless Sensor Networks

Symmetry ◽  
2020 ◽  
Vol 12 (5) ◽  
pp. 837 ◽  
Author(s):  
Hakan Koyuncu ◽  
Geetam S. Tomar ◽  
Dinesh Sharma
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Life Span ◽  
Energy Efficient ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Primary Concern ◽  
Energy Efficient Clustering

Wireless Sensor Networks (WSNs) may be incorporated with thousands of small nodes. This gives them the capability to effectively sense, communicate, and compute parameters. However, the security and life span of a WSN node is a primary concern. This paper is focused on introducing a mathematical model of a modified Multitier Deterministic Energy-Efficient Clustering (DEC) based on novel election multi-tier random probability protocol for agricultural WSNs to enhance the life span of a WSN node along with a comparison of it with existing DEC protocol. In the proposed model, the selection of cluster heads, (CH), is done based on the energy drain pattern and location of the sensor nodes, which increased the lifespan of sensor nodes. In addition, several WSN probabilistic routing protocols to save energy throughout data transmissions like Low Energy Adaptive Clustering Hierarchy (LEACH), Power-Efficient Gathering in Sensor Information Systems (PEGASIS), DEC, and Stable Election Protocol (SEP) are explained. Moreover, it has been found that, after some mathematical modification in existing DEC routing, it will be capable to give a more positive result and reduce the energy drain in WSN nodes using a selective cluster head technique based on residual energy of sensor nodes. The DEC protocol is also compared with our proposed modified protocol for showing the energy-efficiency. The energy efficiency of clustering is associated with the field of energy sustainability of wireless sensor networks which is in the scope of Symmetry journal.

scholarly journals Efficient organization of nodes in wireless sensor networks (clustering location-based LEACH)

2022 ◽  
Vol 12 (1) ◽  
pp. 1011
Author(s):  
Mohammed Réda El Ouadi ◽  
Abderrahim Hasbi
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Rapid Development ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Main Element

The rapid development of connected devices and wireless communication has enabled several researchers to study wireless sensor networks and propose methods and algorithms to improve their performance. Wireless sensor networks (WSN) are composed of several sensor nodes deployed to collect and transfer data to base station (BS). Sensor node is considered as the main element in this field, characterized by minimal capacities of storage, energy, and computing. In consequence of the important impact of the energy on network lifetime, several researches are interested to propose different mechanisms to minimize energy consumption. In this work, we propose a new enhancement of low-energy adaptive clustering hierarchy (LEACH) protocol, named clustering location-based LEACH (CLOC-LEACH), which represents a continuity of our previous published work location-based LEACH (LOC-LEACH). The proposed protocol organizes sensor nodes into four regions, using clustering mechanism. In addition, an efficient concept is adopted to choose cluster head. CLOC-LEACH considers the energy as the principal metric to choose cluster heads and uses a gateway node to ensure the inter-cluster communication. The simulation with MATLAB shows that our contribution offers better performance than LEACH and LOC-LEACH, in terms of stability, energy consumption and network lifetime.

scholarly journals Energy Optimization in Cluster-Based Routing Protocols for Large-Area Wireless Sensor Networks

Symmetry ◽  
2019 ◽  
Vol 11 (1) ◽  
pp. 37 ◽  
Author(s):  
Sang H. Kang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocols ◽  
Cluster Head ◽  
Hierarchical Cluster ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Large Area ◽  
Cluster Based Routing

In large-area wireless sensor networks with hierarchical cluster-based routing protocols, the average number of clusters, k, and the transmission range for the control messages, R, significantly affect the network lifespan. We analyze energy consumption in depth as a function of ( k , R ) , taking into account the energy dissipation of cluster head nodes and the member nodes, separately. To achieve joint optimization of ( k o p t , R o p t ) , we adopt derivative-free Nelder–Mead Simplex method. Computer simulations have shown that our approach effectively reduces energy consumption of sensor nodes in the process of clustering and data transmission in large-area sensor fields. Our optimization can be applied to existing cluster-based routing schemes to maximize their energy efficiency.

scholarly journals Tree-Based Multihop Routing Method for Energy Efficiency of Wireless Sensor Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Jin Yong ◽  
Zhou Lin ◽  
Wei Qian ◽  
Bai Ke ◽  
Wang Chen ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Network Resources ◽  
Multihop Routing

In wireless sensor networks (WSNs), due to the limited energy of sensor nodes, how to design efficient hierarchical routing algorithms to balance network resources and extend network life is an important problem to be solved. Aiming at the problems such as random selection of cluster head, redundancy of working node, and construction of cluster head transmission path, which affect network energy consumption, this paper proposes a multihop routing algorithm based on path tree (MHRA-PT) to optimize the network energy. Firstly, some nodes are those close to the base station and have large remaining energy which are selected to construct a cluster head set. Then, after clustering, each cluster is divided into different regions, and in each region, nodes with residual energy greater than the average residual energy of the cluster are selected as a working node. Finally, the cluster heads are sorted according to their distance from base station, and the next hop node is selected for each cluster head in turn until a path tree rooted at base station is formed completely, leading to data transmission from working node to base station. Simulation results show that the proposed algorithm can effectively reduce network energy consumption, balance network resources, and prolong network life cycle.

scholarly journals Monitoring square and circular fields with sensors using energy-efficient cluster-based routing for underwater wireless sensor networks

2017 ◽  
Vol 13 (7) ◽  
pp. 155014771771718 ◽  
Author(s):  
Arshad Sher ◽  
Nadeem Javaid ◽  
Irfan Azam ◽  
Hira Ahmad ◽  
Wadood Abdul ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Search Algorithm ◽  
Minimum Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Energy Efficient Clustering

In this article, to monitor the fields with square and circular geometries, three energy-efficient routing protocols are proposed for underwater wireless sensor networks. First one is sparsity-aware energy-efficient clustering, second one is circular sparsity-aware energy-efficient clustering, and the third one is circular depth–based sparsity-aware energy-efficient clustering routing protocol. All three protocols are proposed to minimize the energy consumption of sparse regions, whereas sparsity search algorithm is proposed to find sparse regions and density search algorithm is used to find dense regions of the network field. Moreover, clustering is performed in dense regions to minimize redundant transmissions of a data packet, while sink mobility is exploited to collect data from sensor nodes with an objective of minimum energy consumption. A depth threshold [Formula: see text] value is also used to minimize number of hops between source and destination for less energy consumption. Simulation results show that our schemes perform better than their counter-part schemes (depth-based routing and energy-efficient depth-based routing) in terms of energy efficiency.

Sign in / Sign up

Export Citation Format

Share Document