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

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

scholarly journals A Novel Framework to Secure CBWSNS Against the Selfishness Problem

2019 ◽  
Vol 7 (2) ◽  
pp. 7-16
Author(s):  
Poonam Mittal ◽  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Defense Mechanism ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Security Level ◽  
Stochastic Algorithm ◽  
Worst Case ◽  
Cluster Heads

Dynamic and cooperative nature of sensor nodes in Wireless Sensor Networks raises question on security. Various researchers work in this direction to spot malicious, selfish and compromised nodes. Various mechanisms followed are uniqueness of clustering, reputation system and an operation at specific nodes. LEACH is a hierarchical protocol in which most nodes transmit to cluster heads, and the cluster heads aggregate and compress the data and forward it to the base station (sink). Each node uses a stochastic algorithm at each round to determine whether it will become a cluster head in this round. Clustering process carried out in two stages takes the role of the reputation scheme and reveals specific operation at CH, IN and MNs beside their usual activities in cluster based wireless sensor networks. This paper mentioned the final structure of the security framework, corresponding attacks and defense mechanism of the model. It also discusses various security level processes of wireless sensor networks. Results implies that in a cluster-based protocol such as LEACH in which optimally 5% of the nodes are cluster heads it is likely that a significant portion of the network can be paralyzed or the entire network disabled, in the worst-case scenario, if these cluster heads are compromised. Our main contribution in this paper is our novel approach in maintaining trusted clusters through a trust-based decision-making cluster head election algorithm.

scholarly journals A PSO-Based Uneven Dynamic Clustering Multi-Hop Routing Protocol for Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1835 ◽  
Author(s):  
Ruan ◽  
Huang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Dynamic Clustering ◽  
Energy Efficient Routing

Since wireless sensor networks (WSNs) are powered by energy-constrained batteries, many energy-efficient routing protocols have been proposed to extend the network lifetime. However, most of the protocols do not well balance the energy consumption of the WSNs. The hotspot problem caused by unbalanced energy consumption in the WSNs reduces the network lifetime. To solve the problem, this paper proposes a PSO (Particle Swarm Optimization)-based uneven dynamic clustering multi-hop routing protocol (PUDCRP). In the PUDCRP protocol, the distribution of the clusters will change dynamically when some nodes fail. The PSO algorithm is used to determine the area where the candidate CH (cluster head) nodes are located. The adaptive clustering method based on node distribution makes the cluster distribution more reasonable, which balances the energy consumption of the network more effectively. In order to improve the energy efficiency of multi-hop transmission between the BS (Base Station) and CH nodes, we also propose a connecting line aided route construction method to determine the most appropriate next hop. Compared with UCCGRA, multi-hop EEBCDA, EEMRP, CAMP, PSO-ECHS and PSO-SD, PUDCRP prolongs the network lifetime by between 7.36% and 74.21%. The protocol significantly balances the energy consumption of the network and has better scalability for various sizes of network.

scholarly journals A New Centralized Clustering Algorithm for Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (20) ◽  
pp. 4391 ◽  
Author(s):  
Juan-Carlos Cuevas-Martinez ◽  
Antonio-Jesus Yuste-Delgado ◽  
Antonio-Jose Leon-Sanchez ◽  
Antonio-Jose Saez-Castillo ◽  
Alicia Triviño-Cabrera
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Fuzzy System ◽  
Clustering Algorithm ◽  
Base Station ◽  
Wireless Sensor ◽  
Clustering Methods ◽  
Cluster Heads ◽  
Control Message ◽  
Message Exchange

Clustering is presently one of the main routing techniques employed in randomly deployed wireless sensor networks. This paper describes a novel centralized unequal clustering method for wireless sensor networks. The goals of the algorithm are to prolong the network lifetime and increase the reliability of the network while not compromising the data transmission. In the proposed method, the Base Station decides on the cluster heads according to the best scores obtained from a Type-2 Fuzzy system. The input parameters of the fuzzy system are estimated by the base station or gathered from the network with a careful design that reduces the control message exchange. The whole network is controlled by the base station in a rounds-based schedule that alternates rounds when the base station elects cluster heads, with other rounds in which the cluster heads previously elected, gather data from their contributing nodes and forward them to the base station. The setting of the number of rounds in which the Base Station keeps the same set of cluster heads is another contribution of the present paper. The results show significant improvements achieved by the proposal when compared to other current clustering methods.

scholarly journals An Energy-Aware Method for Selecting Cluster Heads in Wireless Sensor Networks

2020 ◽  
Vol 10 (21) ◽  
pp. 7886
Author(s):  
Atefeh Rahiminasab ◽  
Peyman Tirandazi ◽  
M. J. Ebadi ◽  
Ali Ahmadian ◽  
Mehdi Salimi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Cluster Head ◽  
Base Station ◽  
Energy Resources ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Dynamic Clustering ◽  
Clustering Protocol

Wireless sensor networks (WSNs) include several sensor nodes that have limited capabilities. The most critical restriction in WSNs is energy resources. Moreover, since each sensor node’s energy resources cannot be recharged or replaced, it is inevitable to propose various methods for managing the energy resources. Furthermore, this procedure increases the network lifetime. In wireless sensor networks, the cluster head has a significant impact on system global scalability, energy efficiency, and lifetime. Furthermore, the cluster head is most important in combining, aggregating, and transferring data that are received from other cluster nodes. One of the substantial challenges in a cluster-based network is to choose a suitable cluster head. In this paper, to select an appropriate cluster head, we first model this problem by using multi-factor decision-making according to the four factors, including energy, mobility, distance to centre, and the length of data queues. Then, we use the Cluster Splitting Process (CSP) algorithm and the Analytical Hierarchy Process (AHP) method in order to provide a new method to solve this problem. These four factors are examined in our proposed approach, and our method is compared with the Base station Controlled Dynamic Clustering Protocol (BCDCP) algorithm. The simulation results show the proposed method in improving the network lifetime has better performance than the base station controlled dynamic clustering protocol algorithm. In our proposed method, the energy reduction is almost 5% more than the BCDCP method, and the packet loss rate in our proposed method is almost 25% lower than in the BCDCP method.

scholarly journals Hierarchical Agglomerative Clustering Schemes for Energy-Efficiency in Wireless Sensor Networks

2017 ◽  
Vol 18 (2) ◽  
pp. 128-138 ◽  
Author(s):  
Tariq Taleb ◽  
Mejdi Kaddour
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Agglomerative Clustering ◽  
Efficient Communication ◽  
Hierarchical Agglomerative Clustering ◽  
Primary Means ◽  
Topic Clustering

Abstract Extending the lifetime of wireless sensor networks (WSNs) while delivering the expected level of service remains a hot research topic. Clustering has been identified in the literature as one of the primary means to save communication energy. In this paper, we argue that hierarchical agglomerative clustering (HAC) provides a suitable foundation for designing highly energy efficient communication protocols for WSNs. To this end, we study a new mechanism for selecting cluster heads (CHs) based both on the physical location of the sensors and their residual energy. Furthermore, we study different patterns of communications between the CHs and the base station depending on the possible transmission ranges and the ability of the sensors to act as traffic relays. Simulation results show that our proposed clustering and communication schemes outperform well-knows existing approaches by comfortable margins. In particular, networks lifetime is increased by more than 60% compared to LEACH and HEED, and by more than 30% compared to K-means clustering.

scholarly journals A Cluster-Head Rotating Election Routing Protocol for Energy Consumption Optimization in Wireless Sensor Networks

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Jun Wang ◽  
Zhuangzhuang Du ◽  
Zhengkun He ◽  
Xunyang Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Cluster Head Election

Balancing energy consumption using the clustering routing algorithms is one of the most practical solutions for prolonging the lifetime of resource-limited wireless sensor networks (WSNs). However, existing protocols cannot adequately minimize and balance the total network energy dissipation due to the additional tasks of data acquisition and transmission of cluster heads. In this paper, a cluster-head rotating election routing protocol is proposed to alleviate the problem. We discovered that the regular hierarchical clustering method and the scheme of cluster-head election area division had positive effects on reducing the energy consumption of cluster head election and intracluster communication. The election criterion composed of location and residual energy factor was proved to lower the probability of premature death of cluster heads. The chain multihop path of intercluster communication was performed to save the energy of data aggregation to the base station. The simulation results showed that the network lifetime can be efficiently extended by regulating the adjustment parameters of the protocol. Compared with LEACH, I-LEACH, EEUC, and DDEEC, the algorithm demonstrated significant performance advantages by using the number of active nodes and residual energy of nodes as the evaluation indicators. On the basis of these results, the proposed routing protocols can be utilized to increase the capability of WSNs against energy constraints.

scholarly journals A DISTRIBUTED ENERGY EFFICIENT CLUSTERING ALGORITHM FOR DATA AGGREGATION IN WIRELESS SENSOR NETWORKS

2018 ◽  
Vol 19 (1) ◽  
pp. 72-90
Author(s):  
Seyed Mohammad Bagher Musavi Shirazi ◽  
Maryam Sabet ◽  
Mohammad Reza Pajoohan
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Clustering Algorithm ◽  
Base Station ◽  
Wireless Sensor ◽  
Relay Nodes ◽  
Cluster Heads ◽  
Energy Efficient Clustering

Wireless sensor networks (WSNs) are a new generation of networks typically consisting of a large number of inexpensive nodes with wireless communications. The main purpose of these networks is to collect information from the environment for further processing. Nodes in the network have been equipped with limited battery lifetime, so energy saving is one of the major issues in WSNs. If we balance the load among cluster heads and prevent having an extra load on just a few nodes in the network, we can reach longer network lifetime. One solution to control energy consumption and balance the load among nodes is to use clustering techniques. In this paper, we propose a new distributed energy-efficient clustering algorithm for data aggregation in wireless sensor networks, called Distributed Clustering for Data Aggregation (DCDA). In our new approach, an optimal transmission tree is constructed among sensor nodes with a new greedy method. Base station (BS) is the root, cluster heads (CHs) and relay nodes are intermediate nodes, and other nodes (cluster member nodes) are the leaves of this transmission tree. DCDA balances load among CHs in intra-cluster and inter-cluster data communications using different cluster sizes. For efficient inter-cluster communications, some relay nodes will transfer data between CHs. Energy consumption, distance to the base station, and cluster heads’ centric metric are three main adjustment parameters for the cluster heads election. Simulation results show that the proposed protocol leads to the reduction of individual sensor nodes’ energy consumption and prolongs network lifetime, in comparison with other known methods. ABSTRAK: Rangkaian sensor wayarles (WSN) adalah rangkaian generasi baru yang terdiri daripada nod-nod murah komunikasi wayarles. Tujuan rangkaian-rangkaian ini adalah bagi mengumpul maklumat sekeliling untuk proses seterusnya. Nod dalam rangkaian ini dilengkapi bateri kurang jangka hayat, jadi simpanan tenaga adalah satu isu besar dalam WSN. Jika beban diimbang antara induk kelompok dan lebihan beban dihalang pada setiap rangkaian iaitu hanya sebilangan kecil nod pada tiap-tiap kelompok,  jangka hayat dapat dipanjangkan pada sesebuah rangkaian. Satu penyelesaian adalah dengan mengawal penggunaan tenaga dan mengimbangi beban antara nod menggunakan teknik berkelompok. Kajian ini mencadangkan kaedah baru pembahagian tenaga berkesan secara algoritma berkelompok bagi pembahagian data dalam WSN, dikenali sebagai Pembahagian Kelompok Kumpulan Data (DCDA). Melalui pendekatan baru ini, pokok transmisi optimum dibina antara nod sensor melalui kaedah baru. Stesen utama (BS) ialah akar, induk kelompok-kelompok (CHs) dan nod penyiar ialah nod perantara, dan nod-nod lain (nod-nod ahli kelompok) ialah daun bagi pokok trasmisi. DCDA mengimbangi beban CHs antara-kelompok dan dalam-kelompok komunikasi data daripada kelompok berbeza saiz. Bagi komunikasi berkesan dalam-kelompok, sebahagian nod penyampai akan memindahkan data antara CHs. Penggunaan tenaga, jarak ke stesen utama dan induk kelompok metrik sentrik adalah tiga parameter pelaras bagi pemilihan induk kelompok. Keputusan simulasi protokol yang dicadang menunjukkan pengurangan penggunaan tenaga pada nod-nod sensor individu dan memanjangkan jangka hayat rangkaian, berbanding kaedah-kaedah lain yang diketahui.

Sign in / Sign up

Export Citation Format

Share Document