SGO A New Approach for Energy Efficient Clustering in WSN

2020 ◽  
pp. 716-734
Author(s):  
Pritee Parwekar

In wireless sensor networks (WSNs), consumption of energy is the major challenging issue. If the data is transmitted directly from the node to the base station, it leads to more transmissions and energy consumed also increases if the communication distance is longer. In such cases, to reduce the longer communication distances and to reduce the number of transmissions, a clustering technique is employed. Another way to reduce the energy consumed is to reduce the transmission from node to CH or from CH to BS. Reducing the transmission distance is a NP-Hard problem. So, optimization techniques can be used effectively to solve such problems. In this article, is the implementation of a social group optimization (SGO) to reduce the transmission distance and to allow the nodes to consume less energy. The performance of SGO is compared with GA and PSO and the results show that SGO outperforms in terms of fitness and energy.

2018 ◽  
Vol 7 (3) ◽  
pp. 54-72 ◽  
Author(s):  
Pritee Parwekar

In wireless sensor networks (WSNs), consumption of energy is the major challenging issue. If the data is transmitted directly from the node to the base station, it leads to more transmissions and energy consumed also increases if the communication distance is longer. In such cases, to reduce the longer communication distances and to reduce the number of transmissions, a clustering technique is employed. Another way to reduce the energy consumed is to reduce the transmission from node to CH or from CH to BS. Reducing the transmission distance is a NP-Hard problem. So, optimization techniques can be used effectively to solve such problems. In this article, is the implementation of a social group optimization (SGO) to reduce the transmission distance and to allow the nodes to consume less energy. The performance of SGO is compared with GA and PSO and the results show that SGO outperforms in terms of fitness and energy.


2020 ◽  
Vol 13 (2) ◽  
pp. 168-172
Author(s):  
Ravi Kumar Poluru ◽  
M. Praveen Kumar Reddy ◽  
Syed Muzamil Basha ◽  
Rizwan Patan ◽  
Suresh Kallam

Background:Recently Wireless Sensor Network (WSN) is a composed of a full number of arbitrarily dispensed energy-constrained sensor nodes. The sensor nodes help in sensing the data and then it will transmit it to sink. The Base station will produce a significant amount of energy while accessing the sensing data and transmitting data. High energy is required to move towards base station when sensing and transmitting data. WSN possesses significant challenges like saving energy and extending network lifetime. In WSN the most research goals in routing protocols such as robustness, energy efficiency, high reliability, network lifetime, fault tolerance, deployment of nodes and latency. Most of the routing protocols are based upon clustering has been proposed using heterogeneity. For optimizing energy consumption in WSN, a vital technique referred to as clustering.Methods:To improve the lifetime of network and stability we have proposed an Enhanced Adaptive Distributed Energy-Efficient Clustering (EADEEC).Results:In simulation results describes the protocol performs better regarding network lifetime and packet delivery capacity compared to EEDEC and DEEC algorithm. Stability period and network lifetime are improved in EADEEC compare to DEEC and EDEEC.Conclusion:The EADEEC is overall Lifetime of a cluster is improved to perform the network operation: Data transfer, Node Lifetime and stability period of the cluster. EADEEC protocol evidently tells that it improved the throughput, extended the lifetime of network, longevity, and stability compared with DEEC and EDEEC.


2020 ◽  
Vol 11 (1) ◽  
pp. 36-48
Author(s):  
Amiya Bhusan Bagjadab ◽  
Sushree Bibhuprada B. Priyadarshini

Wireless sensor networks are commonly used to monitor certain regions and to collect data for several application domains. Generally, in wireless sensor networks, data are routed in a multi-hop fashion towards a static sink. In this scenario, the nodes closer to the sink become heavily involved in packet forwarding, and their battery power is exhausted rapidly. This article proposes that a special node (i.e., mobile sink) will move in the specified region and collect the data from the sensors and transmit it to the base station such that the communication distance of the sensors will be reduced. The aim is to provide a track for the sink such that it covers maximum sensor nodes. Here, the authors compared two tracks theoretically and in the future will try to simulate the two tracks for the sink movement so as to identify the better one.


2013 ◽  
Vol 579-580 ◽  
pp. 732-739
Author(s):  
Zhi Yan Ma ◽  
Guang You Yang ◽  
Jing Jing Zhou ◽  
Xiong Gan

An energy-efficient wireless sensor routing protocol (Energy-efficient clustering hierarchy routing protocol, EECH) for industrial field is proposed based on LEACH protocol according to the energy inefficiency of existing routing protocols and the characteristics of industrial field applications. The EECH protocol takes full advantages of the node clustering and time slot distribution in LEACH and implements the functions such as clustering, multi hop time slot distribution, node sleeping and data gathering. The cluster heads can be evenly distributed in the area with the geography location information of the wireless nodes, so that the optimal data gathering path can be established. Meanwhile, the EECH protocol can reduce the conflict in data receiving/transmitting and the energy consumption of the nodes, and extend the network lifetime through the multi hop time slot distribution and node sleep mechanism. The simulation results have shown that the death time of the first node in EECH protocol is extended double time than that of LEACH protocol. When most of the nodes dies, the amount of received data of the base station node is more than twice as much as the LEACH protocol, which has verified the energy efficiency characteristic of the EECH protocol.


2011 ◽  
Vol 121-126 ◽  
pp. 4213-4217
Author(s):  
Zheng Jie Wang ◽  
Xiao Guang Zhao ◽  
Xu Qian ◽  
Xue Zhen Cheng

Strip-based sensor networks consist of a large amount of sensor nodes, which is characterized by multihop communication patterns. The nodes closer to the base station are required to forward more data than the nodes farther from the base station, leading to the problem of the energy hole and leaving the the areas of the network unmonitored. This paper analyzes energy consumption model of the uniform deployment and the nonuniform deployment and proves that there is an optimal transmission distance for these deployment strategies. The analysis shows clearly that the nonuniform deployment is more energy effect and more energy balance, which extend the network lifetime compared with the uniform deployment strategy.


2018 ◽  
Vol 19 (1) ◽  
pp. 72-90
Author(s):  
Seyed Mohammad Bagher Musavi Shirazi ◽  
Maryam Sabet ◽  
Mohammad Reza Pajoohan

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.


2020 ◽  
Vol 17 (9) ◽  
pp. 4003-4006
Author(s):  
Ashwini ◽  
N. Guruprasad

The advances in the Internet and communication technology, has set the scene for a new era of inexpensive sensors and actuators which are capable of performing sensing and controlling tasks. A sensor network contains a group of sensors that perform sensing, computing, and communicating data to the sink or the base station (Arampatzis, T., et al., 2005. A Survey of Applications of Wireless Sensors and Wireless Sensor Networks. IEEE International Symposium on, Mediterrean Conference on Control and Automation Intelligent Control, Limassol, Cyprus. pp.27–29). The sensing elements (sensors) have limited battery power and thus pose a limitation with respect to energy consumption. To maintain the longevity of a sensor network there is a need to employ several optimization techniques in order to utilize battery power efficiently. This paper focuses on efficient game theory routing protocols to optimize power consumption in the sensor nodes.


2021 ◽  
Vol 11 (23) ◽  
pp. 11448
Author(s):  
Ahmed Mahdi Jubair ◽  
Rosilah Hassan ◽  
Azana Hafizah Mohd Aman ◽  
Hasimi Sallehudin ◽  
Zeyad Ghaleb Al-Mekhlafi ◽  
...  

Recently, Wireless Sensor Network (WSN) technology has emerged extensively. This began with the deployment of small-scale WSNs and progressed to that of larger-scale and Internet of Things-based WSNs, focusing more on energy conservation. Network clustering is one of the ways to improve the energy efficiency of WSNs. Network clustering is a process of partitioning nodes into several clusters before selecting some nodes, which are called the Cluster Heads (CHs). The role of the regular nodes in a clustered WSN is to sense the environment and transmit the sensed data to the selected head node; this CH gathers the data for onward forwarding to the Base Station. Advantages of clustering nodes in WSNs include high callability, reduced routing delay, and increased energy efficiency. This article presents a state-of-the-art review of the available optimization techniques, beginning with the fundamentals of clustering and followed by clustering process optimization, to classifying the existing clustering protocols in WSNs. The current clustering approaches are categorized into meta-heuristic, fuzzy logic, and hybrid based on the network organization and adopted clustering management techniques. To determine clustering protocols’ competency, we compared the features and parameters of the clustering and examined the objectives, benefits, and key features of various clustering optimization methods.


2019 ◽  
Vol 2 (3) ◽  
pp. 446-453
Author(s):  
Murat Karakoyun

The Travelling Salesman Problem (TSP), which is a combinatorial NP-hard problem, aims to find the shortest possible path while visiting all cities (only once) in a given list and returns to the starting point. In this paper, an approach, which is based on k-means clustering and Shuffled Frog Leaping Algorithm (SFLA), is used to solve the TSP. The proposed approach consists of three parts: separate the cities into k clusters, find the shortest path for each cluster and merge the clusters. Experimental results have shown that the algorithm get better results as the number of cluster increase for problems that have a large number of cities.


Sign in / Sign up

Export Citation Format

Share Document