scholarly journals A Decentralized Fuzzy C-Means-Based Energy-Efficient Routing Protocol for Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Osama Moh’d Alia
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Data Transmission ◽  
Energy Efficient ◽  
Base Station ◽  
Wireless Sensor ◽  
Fuzzy C Means ◽  
Cluster Heads ◽  
Transmission Phase

Energy conservation in wireless sensor networks (WSNs) is a vital consideration when designing wireless networking protocols. In this paper, we propose a Decentralized Fuzzy Clustering Protocol, named DCFP, which minimizes total network energy dissipation to promote maximum network lifetime. The process of constructing the infrastructure for a given WSN is performed only once at the beginning of the protocol at a base station, which remains unchanged throughout the network’s lifetime. In this initial construction step, a fuzzy C-means algorithm is adopted to allocate sensor nodes into their most appropriate clusters. Subsequently, the protocol runs its rounds where each round is divided into a CH-Election phase and a Data Transmission phase. In the CH-Election phase, the election of new cluster heads is done locally in each cluster where a new multicriteria objective function is proposed to enhance the quality of elected cluster heads. In the Data Transmission phase, the sensing and data transmission from each sensor node to their respective cluster head is performed and cluster heads in turn aggregate and send the sensed data to the base station. Simulation results demonstrate that the proposed protocol improves network lifetime, data delivery, and energy consumption compared to other well-known energy-efficient protocols.

scholarly journals Hybrid Swarm Intelligence Energy Efficient Clustered Routing Algorithm for Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-19 ◽  
Author(s):  
Rajeev Kumar ◽  
Dilip Kumar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Data Transmission ◽  
Energy Efficient ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Abc Algorithm ◽  
Cluster Heads

Currently, wireless sensor networks (WSNs) are used in many applications, namely, environment monitoring, disaster management, industrial automation, and medical electronics. Sensor nodes carry many limitations like low battery life, small memory space, and limited computing capability. To create a wireless sensor network more energy efficient, swarm intelligence technique has been applied to resolve many optimization issues in WSNs. In many existing clustering techniques an artificial bee colony (ABC) algorithm is utilized to collect information from the field periodically. Nevertheless, in the event based applications, an ant colony optimization (ACO) is a good solution to enhance the network lifespan. In this paper, we combine both algorithms (i.e., ABC and ACO) and propose a new hybrid ABCACO algorithm to solve a Nondeterministic Polynomial (NP) hard and finite problem of WSNs. ABCACO algorithm is divided into three main parts: (i) selection of optimal number of subregions and further subregion parts, (ii) cluster head selection using ABC algorithm, and (iii) efficient data transmission using ACO algorithm. We use a hierarchical clustering technique for data transmission; the data is transmitted from member nodes to the subcluster heads and then from subcluster heads to the elected cluster heads based on some threshold value. Cluster heads use an ACO algorithm to discover the best route for data transmission to the base station (BS). The proposed approach is very useful in designing the framework for forest fire detection and monitoring. The simulation results show that the ABCACO algorithm enhances the stability period by 60% and also improves the goodput by 31% against LEACH and WSNCABC, respectively.

scholarly journals AR-RBFS: Aware-Routing Protocol Based on Recursive Best-First Search Algorithm for Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Farzad Kiani
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Data Transmission ◽  
Search Algorithm ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Second Phase

Energy issue is one of the most important problems in wireless sensor networks. They consist of low-power sensor nodes and a few base station nodes. They must be adaptive and efficient in data transmission to sink in various areas. This paper proposes an aware-routing protocol based on clustering and recursive search approaches. The paper focuses on the energy efficiency issue with various measures such as prolonging network lifetime along with reducing energy consumption in the sensor nodes and increasing the system reliability. Our proposed protocol consists of two phases. In the first phase (network development phase), the sensors are placed into virtual layers. The second phase (data transmission) is related to routes discovery and data transferring so it is based on virtual-based Classic-RBFS algorithm in the lake of energy problem environments but, in the nonchargeable environments, all nodes in each layer can be modeled as a random graph and then begin to be managed by the duty cycle method. Additionally, the protocol uses new topology control, data aggregation, and sleep/wake-up schemas for energy saving in the network. The simulation results show that the proposed protocol is optimal in the network lifetime and packet delivery parameters according to the present protocols.

Optimization of energy-efficient dynamic task assignment for wireless sensor networks based on particle swarm algorithm

2021 ◽  
pp. 1-11
Author(s):  
Shu Zhang ◽  
Jianhua Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Path Planning ◽  
Data Transmission ◽  
Energy Efficient ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Dynamic Task

This paper provides an in-depth analysis of the optimization of energy-efficient dynamic task allocation in wireless sensor networks through an improved particle swarm optimization algorithm, and introduces the idea of software-defined networking into wireless sensor network to propose a software-defined wireless sensor network non-uniform cluster routing protocol. The protocol decouples the data layer from the control layer, and the base station performs the cluster head election, network clustering, and routing control operations. The base station optimizes the cluster head election process by electing cluster head nodes using an improved particle cluster algorithm. Based on the elected cluster head nodes, the base station calculates their corresponding contention radius and plans the data transmission path. The results of the calculation are sent to the corresponding nodes for cluster creation and data transmission. The simulation results fully show that the use of this protocol can achieve the purpose of significantly extending the service life of the network. This paper comprehensively analyses the whole process of mobile charging of UAVs under improved conditions and proposes a path planning algorithm. The multi-level weighted charging path planning proposed in this paper considers both fairness and timeliness. Finally, the paper verifies the effectiveness of the algorithm.

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

scholarly journals Energy-Efficient Secure Path Algorithm for Wireless Sensor Networks

2012 ◽  
Vol 8 (4) ◽  
pp. 751784 ◽  
Author(s):  
Imanishimwe Jean de Dieu ◽  
Nyirabahizi Assouma ◽  
Maniraguha Muhamad ◽  
Wang Jin ◽  
Sungyoung Lee
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Data Integrity ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Network Backbone ◽  
Energy Network

To collect the data and transmit them on the base station is the main task of the sensor nodes in wireless sensor networks (WSNs). This transmission requires a specific routing algorithm. To prolong the network lifetime, sensor nodes need a secure load-balancing route. In this paper, we investigate the facts of ensuring secure sensed data in a balanced energy network backbone, and propose energy-efficient secure path algorithm (ESPA) for WSNs. It is a process of ensuring sensed data authenticity and integrity under a well-structured energy-efficient routing. To overcome the limitation caused by the symmetric key cryptography algorithms for securing data in WSNs, we proposed a mechanism for checking data integrity in a balanced energy network backbone. On this basis, we use the combined version of distance energy aware routing and a checking data integrity method for WSNs. ESPA provides a better performance in maximizing the network lifetime.

scholarly journals Cluster Head Selection in Wireless Sensor Networks under Fuzzy Environment

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Puneet Azad ◽  
Vidushi Sharma
Keyword(s):  
Decision Making ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Base Station ◽  
Wireless Sensor ◽  
Fuzzy Decision Making ◽  
Agglomerative Clustering ◽  
Cluster Heads ◽  
Multiple Attribute

Clustering is one of the important methods for prolonging the network lifetime in wireless sensor networks (WSNs). It involves grouping of sensor nodes into clusters and electing cluster heads (CHs) for all the clusters. CHs collect the data from respective cluster’s nodes and forward the aggregated data to base station. A major challenge in WSNs is to select appropriate cluster heads. In this paper, we present a fuzzy decision-making approach for the selection of cluster heads. Fuzzy multiple attribute decision-making (MADM) approach is used to select CHs using three criteria including residual energy, number of neighbors, and the distance from the base station of the nodes. The simulation results demonstrate that this approach is more effective in prolonging the network lifetime than the distributed hierarchical agglomerative clustering (DHAC) protocol in homogeneous environments.

scholarly journals An Efficient Routing Approach to Maximize the Lifetime of IoT-Based Wireless Sensor Networks in 5G and Beyond

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
C. Jothikumar ◽  
Kadiyala Ramana ◽  
V. Deeban Chakravarthy ◽  
Saurabh Singh ◽  
In-Ho Ra
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Internet Of Things ◽  
Network Lifetime ◽  
Data Transmission ◽  
Base Station ◽  
Wireless Sensor ◽  
The Internet ◽  
The Internet Of Things

The Internet of Things grew rapidly, and many services, applications, sensor-embedded electronic devices, and related protocols were created and are still being developed. The Internet of Things (IoT) allows physically existing things to see, hear, think, and perform a significant task by allowing them to interact with one another and exchange valuable knowledge when making decisions and caring out their vital tasks. The fifth-generation (5G) communications require that the Internet of Things (IoT) is aided greatly by wireless sensor networks, which serve as a permanent layer for it. A wireless sensor network comprises a collection of sensor nodes to monitor and transmit data to the destination known as the sink. The sink (or base station) is the endpoint of data transmission in every round. The major concerns of IoT-based WSNs are improving the network lifetime and energy efficiency. In the proposed system, Optimal Cluster-Based Routing (Optimal-CBR), the energy efficiency, and network lifetime are improved using a hierarchical routing approach for applications on the IoT in the 5G environment and beyond. The Optimal-CBR protocol uses the k-means algorithm for clustering the nodes and the multihop approach for chain routing. The clustering phase is invoked until two-thirds of the nodes are dead and then the chaining phase is invoked for the rest of the data transmission. The nodes are clustered using the basic k-means algorithm during the cluster phase and the highest energy of the node nearest to the centroid is selected as the cluster head (CH). The CH collects the packets from its members and forwards them to the base station (BS). During the chaining phase, since two-thirds of the nodes are dead and the residual energy is insufficient for clustering, the remaining nodes perform multihop routing to create chaining until the data are transmitted to the BS. This enriches the energy efficiency and the network lifespan, as found in both the theoretical and simulation analyses.

scholarly journals Major Energy Efficient Routing Schemes in Wireless Sensor Networks: Survey and Idea

2013 ◽  
Vol 4 (2) ◽  
pp. 261-266 ◽  
Author(s):  
Jahangeer Ali ◽  
Gulshan Kumar ◽  
Dr. Mritunjay Kumar Rai
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Routing Schemes ◽  
Sensing Applications

Sensing the environment without human intervention is carried out with Wireless Sensor Networks. Thus WSNs have gained impetus in every field as applicable to various sensing applications. As the sensor nodes are very minute with limited power, memory and controlling mechanism. Thus it is necessary to implement energy efficient routing in sensor nodes such that network lifetime is enhanced. In this paper, we have discussed various existing energy efficient routing schemes and made comparison on various parameters in literature survey. Finally came to conclusion that there is a need of an energy efficient routing protocol which can further extend network lifetime. We propose an idea in which existing; Enhanced Energy Efficient Protocol with Static Clustering (EEEPSC) is modified by placing a fraction of nodes having more energy than normal nodes in the locations where Base Station is far away. And BS is placed within the area of deployed nodes.

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.

QoS Aware Multi-hop Multi-path Routing Approach in Wireless Sensor Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 43-52
Author(s):  
Omkar Singh ◽  
Vinay Rishiwal
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Life Time ◽  
Base Station ◽  
Environmental Data ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
End To End

Background & Objective: Wireless Sensor Network (WSN) consist of huge number of tiny senor nodes. WSN collects environmental data and sends to the base station through multi-hop wireless communication. QoS is the salient aspect in wireless sensor networks that satisfies end-to-end QoS requirement on different parameters such as energy, network lifetime, packets delivery ratio and delay. Among them Energy consumption is the most important and challenging factor in WSN, since the senor nodes are made by battery reserved that tends towards life time of sensor networks. Methods: In this work an Improve-Energy Aware Multi-hop Multi-path Hierarchy (I-EAMMH) QoS based routing approach has been proposed and evaluated that reduces energy consumption and delivers data packets within time by selecting optimum cost path among discovered routes which extends network life time. Results and Conclusion: Simulation has been done in MATLAB on varying number of rounds 400- 2000 to checked the performance of proposed approach. I-EAMMH is compared with existing routing protocols namely EAMMH and LEACH and performs better in terms of end-to-end-delay, packet delivery ratio, as well as reduces the energy consumption 13%-19% and prolongs network lifetime 9%- 14%.

Sign in / Sign up

Export Citation Format

Share Document