An Energy-Efficient Hybrid Clustering Mechanism for Wireless Sensor Network

2015 ◽  
Vol 03 (02) ◽  
pp. 109-125
Author(s):  
K. Muni Venkateswarlu ◽  
A. Kandasamy ◽  
K. Chandrasekaran
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Energy Efficient ◽  
Hot Spot ◽  
Wireless Sensor ◽  
Unequal Clustering ◽  
Hop Count ◽  
Number Of Clusters ◽  
Hot Spot Problem

Valuable energy resources of sensor network should be utilized wisely to prolong network's lifetime. Clustering technique helps wireless sensor network (WSN) to enhance its lifetime by reducing energy consumption on every individual sensor node in the network. In multi-hop data forwarding model, difference in energy consumption among cluster heads (HS) causes hot-spot problem in the network. While data is being transferred, the CH close to base station are burdened with heavy relay traffic from several data routes and tend to die early. Unequal clustering avoids this hot-spot problem by establishing different sized clusters at various levels in the network. Since unequal clustering technique does not control number of CHs it creates, it forms huge number of clusters in the network. This increases hop count between source and destination, and leads to impose more over head on each data forwarding route in the network. Also, rapid variation in cluster size causes imbalance in energy dissipation among clustered nodes in the network. This uneven energy consumption influences network performance and lifetime. In this paper, we present an energy-efficient hybrid clustering mechanism for wireless sensor network using equal and unequal clustering techniques to create limited number of clusters in varied sizes at various level of the network. This avoids hot-spot problem with minimum hop count between the source and destination and achieves uniform energy dissipation between intra- and inter-cluster communication. Simulation results show that the proposed clustering mechanism balances the energy consumption among clusters with its hybrid cluster formation mechanism and elevates sensor network lifetime.

scholarly journals Zone-Based Routing Protocol for Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Muni Venkateswarlu Kumaramangalam ◽  
Kandasamy Adiyapatham ◽  
Chandrasekaran Kandasamy
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Hot Spot ◽  
Clustering Algorithms ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Unequal Clustering

Extensive research happening across the globe witnessed the importance of Wireless Sensor Network in the present day application world. In the recent past, various routing algorithms have been proposed to elevate WSN network lifetime. Clustering mechanism is highly successful in conserving energy resources for network activities and has become promising field for researches. However, the problem of unbalanced energy consumption is still open because the cluster head activities are tightly coupled with role and location of a particular node in the network. Several unequal clustering algorithms are proposed to solve this wireless sensor network multihop hot spot problem. Current unequal clustering mechanisms consider only intra- and intercluster communication cost. Proper organization of wireless sensor network into clusters enables efficient utilization of limited resources and enhances lifetime of deployed sensor nodes. This paper considers a novel network organization scheme, energy-efficient edge-based network partitioning scheme, to organize sensor nodes into clusters of equal size. Also, it proposes a cluster-based routing algorithm, called zone-based routing protocol (ZBRP), for elevating sensor network lifetime. Experimental results show that ZBRP out-performs interims of network lifetime and energy conservation with its uniform energy consumption among the cluster heads.

Energy Efficient Clustering and Routing Algorithm for WSN

2019 ◽  
Vol 12 ◽  
Author(s):  
Mohit Kumar ◽  
Sonu Mittal ◽  
Md. Amir Khusru Akhtar
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Hot Spot ◽  
Routing Algorithm ◽  
Relay Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Clustering ◽  
Hot Spot Problem

Background: This paper presents a novel Energy Efficient Clustering and Routing Algorithm (EECRA) for WSN. It is a clustering-based algorithm that minimizes energy dissipation in wireless sensor networks. The proposed algorithm takes into consideration energy conservation of the nodes through its inherent architecture and load balancing technique. In the proposed algorithm the role of inter-cluster transmission is not performed by gateways instead a chosen member node of respective cluster is responsible for data forwarding to another cluster or directly to the sink. Our algorithm eases out the load of the gateways by distributing the transmission load among chosen sensor node which acts as a relay node for inter-cluster communication for that round. Grievous simulations show that EECRA is better than PBCA and other algorithms in terms of energy consumption per round and network lifetime. Objective: The objective of this research lies in its inherent architecture and load balancing technique. The sole purpose of this clustering-based algorithm is that it minimizes energy dissipation in wireless sensor networks. Method: This algorithm is tested with 100 sensor nodes and 10 gateways deployed in the target area of 300m × 300m. The round assumed in this simulation is same as in LEACH. The performance metrics used for comparisons are (a) network lifetime of gateways and (b) energy consumption per round by gateways. Our algorithm gives superior result compared to LBC, EELBCA and PBCA. Fig 6 and Fig 7 shows the comparison between the algorithms. Results: The simulation was performed on MATLAB version R2012b. The performance of EECRA is compared with some existing algorithms like PBCA, EELBCA and LBCA. The comparative analysis shows that the proposed algorithm outperforms the other existing algorithms in terms of network lifetime and energy consumption. Conclusion: The novelty of this algorithm lies in the fact that the gateways are not responsible for inter-cluster forwarding, instead some sensor nodes are chosen in every cluster based on some cost function and they act as a relay node for data forwarding. Note the algorithm does not address the hot-spot problem. Our next endeavor will be to design an algorithm with consideration of hot-spot problem.

An Energy Efficient Estimation Algorithm for Wireless Sensor Network

2011 ◽  
Vol 216 ◽  
pp. 176-180
Author(s):  
Yong Ding ◽  
Yue Mei Su
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Estimation Algorithm ◽  
Efficient Estimation ◽  
Wireless Sensor ◽  
Estimation Algorithms ◽  
Current Energy

Wireless Sensor Networks functionality is closely related to network lifetime which depends on the energy consumption, so require energy- efficient protocols to improve the network lifetime. According to the analysis and summary of the current energy efficient estimation algorithms in wireless sensor network An energy-efficient algorithm is proposed,. Then this optimization algorithm proposed in the paper is adopted to improve the traditional diffusion routing protocol. Simulation results show that this algorithm is to effectively balance the network energy consumption, improve the network life-cycle and ensure the communication quality.

Type 2 Fuzzy Logic based Unequal Clustering algorithm for multi-hop wireless sensor networks

2020 ◽  
pp. 33-46
Author(s):  
A. Sariga ◽  
◽  
◽  
J. Uthayakumar
Keyword(s):  
Fuzzy Logic ◽  
Energy Consumption ◽  
Network Lifetime ◽  
Clustering Algorithm ◽  
Hot Spot ◽  
Wireless Sensor ◽  
Unequal Clustering ◽  
Clustering Protocols ◽  
Hot Spot Problem

Wireless sensor network (WSN) is an integral part of IoT and Maximizing the network lifetime is a challenging task. Clustering is the most popular energy efficient technique which leads to increased lifetime stability and reduced energy consumption. Though clustering offers several advantages, it eventually raises the burden of CHs located in proximity to the Base Station (BS) in multi-hop data transmission which makes the CHs near BS die earlier than other CHs. This issue is termed as hot spot problem and unequal clustering protocols were introduced to handle it. Presently, some of the clustering protocols are developed using Type-2 Fuzzy Logic (T2FL) but none of them addresses hot spot problem. This paper presents a Type-2 Fuzzy Logic based Unequal Clustering Algorithm (T2FLUCA) for the elimination of hot spot problem and also for lifetime maximization of WSN. The proposed algorithm uses residual energy, distance to BS and node degree as input to T2FL to determine the probability of becoming CHs (PCH) and cluster size. For experimentation, T2FLUCA is tested on three different scenarios and the obtained results are compared with LEACH, TEEN, DEEC and EAUCF in terms of network lifetime, throughput and average energy consumption. The experimental results ensure that T2FLUCA outperforms state of art methods in a significant way.

Energy-Efficient Technique for Monitoring of Agricultural Areas with Terrestrial Wireless Sensor Networks

2019 ◽  
Vol 29 (09) ◽  
pp. 2050141 ◽  
Author(s):  
Muhammed Enes Bayrakdar
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Fading Channels ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Efficient Manner

In this paper, a monitoring technique based on the wireless sensor network is investigated. The sensor nodes used for monitoring are developed in a simulation environment. Accordingly, the structure and workflow of wireless sensor network nodes are designed. Time-division multiple access (TDMA) protocol has been chosen as the medium access technique to ensure that the designed technique operates in an energy-efficient manner and packet collisions are not experienced. Fading channels, i.e., no interference, Ricean and Rayleigh, are taken into consideration. Energy consumption is decreased with the help of ad-hoc communication of sensor nodes. Throughput performance for different wireless fading channels and energy consumption are evaluated. The simulation results show that the sensor network can quickly collect medium information and transmit data to the processing center in real time. Besides, the proposed technique suggests the usefulness of wireless sensor networks in the terrestrial areas.

scholarly journals A Cross Unequal Clustering Routing Algorithm for Sensor Network

2013 ◽  
Vol 13 (4) ◽  
pp. 200-205 ◽  
Author(s):  
Wang Tong ◽  
Wu Jiyi ◽  
Xu He ◽  
Zhu Jinghua ◽  
Charles Munyabugingo
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Energy Loss ◽  
Sensor Network ◽  
Routing Algorithm ◽  
High Energy ◽  
Wireless Sensor ◽  
Unequal Clustering ◽  
Long Distance ◽  
Cluster Heads

In the routing protocol for wireless sensor network, the cluster size is generally fixed in clustering routing algorithm for wireless sensor network, which can easily lead to the “hot spot” problem. Furthermore, the majority of routing algorithms barely consider the problem of long distance communication between adjacent cluster heads that brings high energy consumption. Therefore, this paper proposes a new cross unequal clustering routing algorithm based on the EEUC algorithm. In order to solve the defects of EEUC algorithm, this algorithm calculating of competition radius takes the node’s position and node’s remaining energy into account to make the load of cluster heads more balanced. At the same time, cluster adjacent node is applied to transport data and reduce the energy-loss of cluster heads. Simulation experiments show that, compared with LEACH and EEUC, the proposed algorithm can effectively reduce the energy-loss of cluster heads and balance the energy consumption among all nodes in the network and improve the network lifetime

Parallel Ant Colony Algorithm Based on Award-Punishment Mechanism and its Application on Wireless Sensor Network Routing

2013 ◽  
Vol 397-400 ◽  
pp. 1117-1120
Author(s):  
Hai Yang
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Energy Efficient ◽  
Ant Colony Algorithm ◽  
Network Routing ◽  
Ant Colony ◽  
Wireless Sensor ◽  
Energy Consumption Model ◽  
Punishment Mechanism

As a new method of obtaining information and disposal pattern, wireless sensor network has been a hot issue nowadays. In this paper the network model and energy consumption model of wireless sensor network are introduced firstly. The improved inspiring factor takes energy into account. Then a parallel ant colony algorithm based on award-punishment mechanism is proposed. The experimental results show that the energy consumption and time delay of the improved algorithm are superior to energy efficient ant based routing and basic ant colony algorithm.

scholarly journals An Efficient and Secure Session Key Management Scheme in Wireless Sensor Network

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Gulzar Mehmood ◽  
Muhammad Sohail Khan ◽  
Abdul Waheed ◽  
Mahdi Zareei ◽  
Muhammad Fayaz ◽  
...  
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Key Management ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Session Key ◽  
Management Scheme ◽  
Key Management Scheme

Wireless Sensor Network (WSN) is a particular network built from small sensor nodes. These sensor nodes have unique features. That is, it can sense and process data in WSN. WSN has tremendous applications in many fields. Despite the significance of WSN, this kind of network faced several issues. The biggest problems rising in WSN are energy consumption and security. Robust security development is needed to cope with WSN applications. For security purposes in WSN, cryptography techniques are very favorable. However, WSN has resource limitations, which is the main problem in applying any security scheme. Hence, if we are using the cryptography scheme in WSN, we must first guarantee that it must be energy-efficient. Thus, we proposed a secure hybrid session key management scheme for WSN. In this scheme, the major steps of public key cryptography are minimized, and much of the operations are based on symmetric key cryptography. This strategy extensively reduces the energy consumption of WSN and ensures optimum security. The proposed scheme is implemented, and their analysis is performed using different parameters with benchmark schemes. We concluded that the proposed scheme is energy-efficient and outperforms the available benchmark schemes. Furthermore, it provides an effective platform for secure key agreements and management in the WSN environment.

scholarly journals An Election Energy Threshold Based Multi-Hop Routing Protocol in a Grid-Clustered Wireless Sensor Network

2018 ◽  
pp. 327-336 ◽  
Author(s):  
Funom Samuel Dadah ◽  
Ajayi Ore-Ofe ◽  
Aliyu D Usman ◽  
Y A Mshelia ◽  
M O Babatunde
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Routing Algorithm ◽  
Base Station ◽  
Energy Threshold ◽  
Wireless Sensor ◽  
Data Packets

Owing to the limited energy of sensor nodes (SNs) in a wireless sensor network (WSN), it is important to reduce and balance the energy consumption of the SNs in order to extend the WSN lifetime. Clustering mechanism is a highly efficient and effective mechanism for minimizing the amount of energy that SNs consume during the transmission of data packets. In this paper, an election energy threshold based multi-hop routing protocol (mEEMRP) is presented. In order to minimize energy consumption, this routing protocol uses grid clustering, where the network field is divided into grid clusters. SNs in each grid cluster select a cluster head (CH) based on a weight factor that takes the node location, node’s residual energy (RE) as well as the node’s distance from the base station into consideration. An energy efficient multi-hop routing algorithm is adopted during the transmission of data packets from the cluster heads (CHs) to the base station (BS). This multi-hop routing algorithm uses an election energy threshold value, T­nhCH that takes into consideration the RE of CHs as well as the distance between CHs. Simulation results show a 1.77% and 10.65% improvement in terms of network lifetime for two network field scenarios over Energy Efficient Multi-hop Routing Protocol (EEMRP).

Sign in / Sign up

Export Citation Format

Share Document