scholarly journals Optimum Number of Clusters in Randomly Distributed Wireless Sensor Networks

2018 ◽  
Vol 7 (2.16) ◽  
pp. 61 ◽  
Author(s):  
Veervrat Singh Chandrawanshi ◽  
Rajiv Kumar Tripathi ◽  
Rahul Pachauri
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Resource ◽  
Life Time ◽  
Base Station ◽  
Energy Resources ◽  
Wireless Sensor ◽  
Optimum Number ◽  
Number Of Clusters ◽  
Efficient Resource

The wireless sensor networks (WSN) are energy constraint because of finite batteries used as energy resources. The efficient utilization of these energy resources and prolonging lifetime are the most crucial research challenges in WSN. Clustering is considered one of the best suitable technique that carries out efficient resource allocation and higher scalability for sensor networks. The clustered networks have a big concern on the optimum number of clusters in a network. In a WSN, such a number of clusters significantly contribute in the betterment of network life time, energy resource utilization, system scalability and efficient data routing. In the proposed work, an analytical approach has been explored that provides optimum number of cluster in a WSN for various topologies. The proposed method takes both free space and multipath losses into consideration by assuming that the base station is located at the boundary of the sensing field. 

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

MAC chastised Dynamism Efficient in Wireless Device Lattice Spending Mistralapproach

2021 ◽  
Vol 10 (12) ◽  
pp. 25453-25458
Author(s):  
Mr. Dinesh Prabhu. M ◽  
Dr. Dinesh Senduraja
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Mac Protocol ◽  
Life Time ◽  
Base Station ◽  
Wireless Sensor ◽  
Consumption Energy ◽  
Cluster Based Routing

In Wireless sensor Network, several researchers have provided different routing protocol for sensor networks, particularly routing protocols depending on clusters protocols. Reliability of nodes is necessary parameter in effective sensor networks. We use MAC protocol for controlling the network packets. This is because the usage of cluster based routing has several merits like minimized control messages, re-usability of bandwidth and enhanced power control.  Different cluster based routing protocol is proposed by many researchers for the purpose of reducing the consumption energy in wireless sensor networks. Those techniques reduces the energy consumption but with several disadvantages like lack of QoS, inefficient transmission, etc., To overcome those problems, modified QoS enhanced base station controlled in Mistrial Approach (flooding Technique) for wireless sensor networks is proposed in this work.  Here we reduce the number of retransmission and detect the overlay packets in networks using proposed approach. Simulation results show the better energy consumption, Maximum Life time & Efficient Bandwidth is achieved by flooding management when compared to the conventional techniques

Clustering Algorithm to Reduce Power Consumptions for Wireless Sensor Networks

2012 ◽  
Vol 433-440 ◽  
pp. 5228-5232
Author(s):  
Mohammad Ahmadi ◽  
Hamid Faraji ◽  
Hossien Zohrevand
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Life Time ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Cluster Heads

A sensor network has many sensor nodes with limited energy. One of the important issues in these networks is the increase of the life time of the network. In this article, a clustering algorithm is introduced for wireless sensor networks that considering the parameters of distance and remaining energy of each node in the process of cluster head selection. The introduced algorithm is able to reduce the amount of consumed energy in the network. In this algorithm, the nodes that have more energy and less distance from the base station more probably will become cluster heads. Also, we use algorithm for finding the shortest path between cluster heads and base station. The results of simulation with the help of Matlab software show that the proposed algorithm increase the life time of the network compared with LEACH algorithm.

An Improvement Routing Protocol Based LEACH for Wireless Sensor Networks

2014 ◽  
Vol 614 ◽  
pp. 472-475 ◽  
Author(s):  
Jin Gang Cao
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Base Station ◽  
Optimal Number ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Number Of Clusters ◽  
Cluster Heads

Due to limited energy, computing ability, and memory of Wireless sensor Networks(WSN), routing issue is one of the key factors for WSN. LEACH is the first clustering routing protocol, which can efficiently reduce the energy consumption and prolong the lifetime of WSN, but it also has some disadvantage. This paper proposed an improvement based LEACH, called LEACH-T. According to different number of clusters, LEACH-T uses variable time slot for different clusters in steady-state phase, and single-hop or multi-hop to transmit data between cluster heads and Base Station. Also it considered residual energy of sensor nodes and the optimal number of clusters during selection of the cluster heads. The simulation results show that LEACH-T has better performance than LEACH for prolonging the lifetime and reducing the energy consumption.

Energy-Efficient and Degree-Distance Clustering Based Hierarchical Routing Protocol for WSNs

2019 ◽  
Vol 13 ◽  
Author(s):  
Abdelkrim Hadjadj ◽  
Bilal Aribi ◽  
Mourad Amad
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Resource ◽  
Base Station ◽  
Wireless Sensor ◽  
Intelligent Environment ◽  
Hierarchical Routing ◽  
Degree Distance ◽  
Save Energy ◽  
Energy Dissipated

Background: Wireless sensor networks (WSN) are of crucial importance in today's applications and very useful for creating an intelligent environment. The characteristics of WSN (The increasingly smaller size of the sensors, their lower cost, and wireless communication support ... etc.), allow the sensor networks to quickly invade several areas of application and becomes a very active field of research for an efficient technique that guarantees an optimization and a better distribution of the energy resource. The sensors collaborate to carry out specific tasks according to the objectives of the application. Objective: This paper uses degree distance clustering for optimizing routing process in wireless sensor networks Method: Our protocol aims to more equitably exploit the energy of the selected nodes cluster-heads, and to save energy dissipated during routing the captured data to the base station Results: The results of the simulations show that our proposed protocol allows a reduction of energy dissipation and a duration life of the larger network. Conclusion: Hierarchical routing in WSNs can be optimizing when clustering technique is efficiently established.

A Fuzzy Based Clustering Protocol for Energy-Efficient Wireless Sensor Networks

2013 ◽  
Vol 760-762 ◽  
pp. 685-690 ◽  
Author(s):  
Md Abdul AbdulAlim ◽  
Yu Cheng Wu ◽  
Wei Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Fuzzy Inference ◽  
Cluster Head ◽  
Life Time ◽  
Wireless Sensor ◽  
Optimum Number ◽  
Energy Aware ◽  
Inference System

Minimization of energy consumption is one of the most important research areas in Wireless Sensor Networks. Nowadays, the paradigms of computational intelligence (CI) are widely used in WSN, such as localization, clustering, energy aware routing, task scheduling, security, etc. Though many fuzzy based clustering techniques have been proposed earlier, many of them could not increase the total network life time in terms of LND (Last Node Dies) with comparing to LEACH. In this paper, a fuzzy logic based energy-aware dynamic clustering technique is proposed, which increases the network lifetime in terms of LND. Here, two inputs are given in the fuzzy inference system and a node is selected as a cluster head according to the fuzzy cost (output). The main advantage of this protocol is that the optimum number of cluster is formed in every round, which is almost impossible in LEACH (low-energy adaptive clustering hierarchy). Moreover, this protocol has less computational load and complexity. The simulation result demonstrates that this approach performs better than LEACH in terms of energy saving as well as network lifetime.

scholarly journals Differential Evolution Algorithm with Diversified Vicinity Operator for Optimal Routing and Clustering of Energy Efficient Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Subramaniam Sumithra ◽  
T. Aruldoss Albert Victoire
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Differential Evolution ◽  
Differential Evolution Algorithm ◽  
Life Time ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Routing Problem

Due to large dimension of clusters and increasing size of sensor nodes, finding the optimal route and cluster for large wireless sensor networks (WSN) seems to be highly complex and cumbersome. This paper proposes a new method to determine a reasonably better solution of the clustering and routing problem with the highest concern of efficient energy consumption of the sensor nodes for extending network life time. The proposed method is based on the Differential Evolution (DE) algorithm with an improvised search operator called Diversified Vicinity Procedure (DVP), which models a trade-off between energy consumption of the cluster heads and delay in forwarding the data packets. The obtained route using the proposed method from all the gateways to the base station is comparatively lesser in overall distance with less number of data forwards. Extensive numerical experiments demonstrate the superiority of the proposed method in managing energy consumption of the WSN and the results are compared with the other algorithms reported in the literature.

scholarly journals An energy consumption minimization approach in wireless sensor networks

2021 ◽  
Vol 22 (3) ◽  
pp. 1485
Author(s):  
Muhsin J. Al-Amery ◽  
Mohammed H. Ghadban
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
General System ◽  
Life Time ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
System Life ◽  
Time Division

There is no doubt that the most challenging aspect in the wireless sensor networks (WSN) is the lifetime, due to limitations in their energy. WSN depends on a specific group of sensor nodes to gather the data from other nodes and forward it to the base station (BS). These nodes are called cluster heads. Having reliable cluster head’s (CH) means longer life to the network. In this paper, a versatile calculation has been acquainted and analyzed for selecting the CH that maintains the least vitality utilization in the network with appropriate life time during every correspondence round. The altered methodology depends on the improved calendar of the time division multiple access (TDMA) plans. This methodology is created to decide the next CH based on lifetime, expended vitality, number of CH’s, and the frequent contact to the BS. A comparative analysis is introduced, the proposed algorithm assistant cluster heads (ACHS) shows energizing outcomes in vitality utilization in WSNs just as expanding the general system dependability with reasonable viability and productivity in terms of lifetime. The ACHS strategy shows a decrease in the WSN vitality utilization up to about 25% and shows an expansion in the system life time by 30% than the upgraded timetable of time TDMA plan approach.

DATA GATHERING AND COMMUNICATION FOR WIRELESS SENSOR NETWORKS — A CENTRALIZED APPROACH

2005 ◽  
Vol 02 (04) ◽  
pp. 267-278 ◽  
Author(s):  
PETER X. LIU ◽  
NANCY DING
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Gathering ◽  
Life Time ◽  
Optimization Method ◽  
Chain Structure ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
The Social

This paper introduces a centralized approach to data gathering and communication for wireless sensor networks. Inspired by the social behaviors of natural ants, we clearly partition the task for the base station and sensor nodes in a wireless sensor network according to their different functions and capabilities. An ant colony optimization method is employed at the base station to form a near-optimal chain for sensor nodes to transmit collected data. Sensor nodes in the network then form a bi-direction chain structure, which is self-adaptive to any minor changes of the network topology. The simulation results show that the developed algorithm, which we call AntChain algorithm, performs much better than many other protocols in terms of energy efficiency, data integrity and life time when the base station is near where the sensor nodes are deployed.

Sign in / Sign up

Export Citation Format

Share Document