Minimizing Energy Consumption in Wireless Sensor Networks by Partition

2016 ◽  
Vol 850 ◽  
pp. 23-29
Author(s):  
Wen Zhi Zhu ◽  
Feng Xu

In wireless sensor networks, clustering class routing protocol is an important protocol type. Different clustering methods, and cluster head selection method directly affects the energy consumption of the entire network communication. This paper studies the effect of different partition methods of the network energy consumption, and to study the partitioning methods under the conditions of uneven distribution of nodes. We believe that energy efficiency clustering method should adapt the distributed of sensor nodes in order to improve energy efficiency. And according to the partition method we propose a low-power adaptive clustering routing protocol based on node distribution to partition. The protocol can effectively extend the lifetime of a wireless sensor network. Simulation results show that the proposed protocol can effectively prolong the network lifetime.

2014 ◽  
Vol 666 ◽  
pp. 322-326
Author(s):  
Yu Yang Peng ◽  
Jae Ho Choi

Energy efficiency is one of the important hot issues in wireless sensor networks. In this paper, a multi-hop scheme based on a cooperative multi-input multi-outputspatial modulation technique is proposed in order to improve energy efficiency in WSN. In this scheme, the sensor nodes are grouped into clusters in order to achieve a multi-input multi-output system; and a simple forwarding transmission scenario is considered so that the intermediate clusters only forward packets originated from the source cluster down to the sink cluster. In order to verify the performance of the proposed system, the bit energy consumption formula is derived and the optimal number of hopsis determined. By qualitative experiments, the obtained results show that the proposed scheme can deliver the data over multiple hops consuming optimal energy consumption per bit.


2015 ◽  
Vol 785 ◽  
pp. 744-750
Author(s):  
Lei Gao ◽  
Qun Chen

In order to solve the energy limited problem of sensor nodes in the wireless sensor networks (WSN), a fast clustering algorithm based on energy efficiency for wire1ess sensor networks is presented in this paper. In the system initialization phase, the deployment region is divided into several clusters rapidly. The energy consumption ratio and degree of the node are chosen as the selection criterion for the cluster head. Re-election of the cluster head node at this time became a local trigger behavior. Because of the range of the re-election is within the cluster, which greatly reduces the complexity and computational load to re-elect the cluster head node. Theoretical analysis indicates that the timing complexity of the clustering algorithm is O(1), which shows that the algorithm overhead is small and has nothing to do with the network size n. Simulation results show that clustering algorithm based on energy efficiency can provide better load balancing of cluster heads and less protocol overhead. Clustering algorithm based on energy efficiency can reduce energy consumption and prolong the network lifetime compared with LEACH protocol.


2020 ◽  
Vol 39 (6) ◽  
pp. 8529-8542
Author(s):  
M. Martinaa ◽  
B. Santhi ◽  
A. Raghunathan

Wireless Sensor Networks (WSNs) is created, stemming from their applications in distinct areas. Huge sensor nodes are deployed in geographically isolated regions in WSN. As a result of uninterrupted transmission, the energy level of the nodes gets rapidly depleted. Sensor node batteries cannot be replaced or recharged often and maintaining the energy level is a crucial issue. Thus energy efficiency is the significant factor to be consider in WSN. This paper focuses to implement an efficient clustering and routing protocols for maximized network lifetime. Clustering has been confirmed as a successful approach in network organization. The fundamental responsibilities of the clustering mechanism include improved energy efficiency and extended network lifespan. In this work, energy efficiency is improved to maximize lifespan of the WSN by proposing a novel method known as the Populated Cluster aware Routing Protocol (PCRP). The proposed method comprises three different steps: cluster formation, cluster head selection, and multi-hop data transmission. All sensor nodes are joined to a Cluster Head in a single hop in the cluster formation phase. Node distance is calculated and from which cluster head is selected. Then, cluster head aggregates the data from sensor nodes and transfer to the Base Station (BS). The shortest pathway is estimated by the Energy Route Request Adhoc On-demand Distance Vector (ERRAODV) algorithm. The proposed method considers the residual energy involved to attain high energy efficiency and network stability. The experimental analysis is demonstrated to validate the proposed method with existing, which improves the network lifespan. Vital parameters are validated using Network Simulator (NS2).


2020 ◽  
Vol 30.8 (147) ◽  
pp. 14-21
Author(s):  
Thanh Huong Nguyen ◽  
◽  
Dang Toan Dao ◽  

Energy efficiency is one of the important factors when exploiting Wireless Sensor Networks, especially for increasing lifespan and performance. In the network nowadays, the number of sensor nodes can reach hundreds or thousands and can be arranged in complex hierarchical architecture. Besides, the current sensor nodes have a small size, limited battery source but are operated in vast areas. The clustered-based method has been an effective and potentially extensible means of boosting the management and operation of such large-scale networks and minimizing the overall energy consumption. In this paper, the issue of arranging and routing the nodes in the sensor network in a hierarchical manner is investigated, in which each lowest level sensor nodes are grouped in a cluster with a common cluster head, then the cluster-head plays an intermediate role transmit the information back and forth between the sensor nodes and the base station. In this way, the route to exchange information can not only be optimized with respect to the distance but also for energy spent on the communication. In order to do so, this paper proposed a novel method based on a Genetic Algorithm to establish a routing protocol to achieve energy optimization. The results demonstrate that this approach can decrease the energy consumption according to the optimized routing through clustering and increase the performance superior to the other clustering schemes.


Author(s):  
A. Radhika ◽  
D. Haritha

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.


Wireless Sensor Networks (WSN) consists of a large amount of nodes connected in a self-directed manner. The most important problems in WSN are Energy, Routing, Security, etc., price of the sensor nodes and renovation of these networks is reasonable. The sensor node tools included a radio transceiver with an antenna and an energy source, usually a battery. WSN compute the environmental conditions such as temperature, sound, pollution levels, etc., WSN built the network with the help of nodes. A sensor community consists of many detection stations known as sensor nodes, every of which is small, light-weight and portable. Nodes are linked separately. Each node is linked into the sensors. In recent years WSN has grow to be an essential function in real world. The data’s are sent from end to end multiple nodes and gateways, the data’s are connected to other networks such as wireless Ethernet. MGEAR is the existing mechanism. It works with the routing and energy consumption. The principal problem of this work is choosing cluster head, and the selection is based on base station, so the manner is consumes energy. In this paper, develop the novel based hybrid protocol Low Energy Aware Gateway (LEAG). We used Zigbee techniques to reduce energy consumption and routing. Gateway is used to minimize the energy consumption and data is send to the base station. Nodes are used to transmit the data into the cluster head, it transmit the data into gateway and gateway compress and aggregate the data then sent to the base station. Simulation result shows our proposed mechanism consumes less energy, increased throughput, packet delivery ration and secure routing when compared to existing mechanism (MGEAR).


2020 ◽  
Author(s):  
Ademola Abidoye ◽  
Boniface Kabaso

Abstract Wireless sensor networks (WSNs) have been recognized as one of the most essential technologies of the 21st century. The applications of WSNs are rapidly increasing in almost every sector because they can be deployed in areas where cable and power supply are difficult to use. In the literature, different methods have been proposed to minimize energy consumption of sensor nodes so as to prolong WSNs utilization. In this article, we propose an efficient routing protocol for data transmission in WSNs; it is called Energy-Efficient Hierarchical routing protocol for wireless sensor networks based on Fog Computing (EEHFC). Fog computing is integrated into the proposed scheme due to its capability to optimize the limited power source of WSNs and its ability to scale up to the requirements of the Internet of Things applications. In addition, we propose an improved ant colony optimization (ACO) algorithm that can be used to construct optimal path for efficient data transmission for sensor nodes. The performance of the proposed scheme is evaluated in comparison with P-SEP, EDCF, and RABACO schemes. The results of the simulations show that the proposed approach can minimize sensor nodes’ energy consumption, data packet losses and extends the network lifetime


Author(s):  
Nandoori Srikanth ◽  
Muktyala Sivaganga Prasad

<p>Wireless Sensor Networks (WSNs) can extant the individual profits and suppleness with regard to low-power and economical quick deployment for numerous applications. WSNs are widely utilized in medical health care, environmental monitoring, emergencies and remote control areas. Introducing of mobile nodes in clusters is a traditional approach, to assemble the data from sensor nodes and forward to the Base station. Energy efficiency and lifetime improvements are key research areas from past few decades. In this research, to solve the energy limitation to upsurge the network lifetime, Energy efficient trust node based routing protocol is proposed. An experimental validation of framework is focused on Packet Delivery Ratio, network lifetime, throughput, energy consumption and network loss among all other challenges. This protocol assigns some high energy nodes as trusted nodes, and it decides the mobility of data collector.  The energy of mobile nodes, and sensor nodes can save up to a great extent by collecting data from trusted nodes based on their trustworthiness and energy efficiency.  The simulation outcome of our evaluation shows an improvement in all these parameters than existing clustering and Routing algorithms.<strong></strong></p>


Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1835 ◽  
Author(s):  
Ruan ◽  
Huang

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.


Sensors ◽  
2019 ◽  
Vol 19 (9) ◽  
pp. 2126 ◽  
Author(s):  
Lijun Wang ◽  
Jia Yan ◽  
Tao Han ◽  
Dexiang Deng

Based on the connectivity and energy consumption problems in wireless sensor networks, this paper proposes a kind of new network algorithm called the connectivity and energy efficiency (CEE) algorithm to guarantee the connectivity and connectivity probability, and also to reduce the network energy consumption as much as possible. Under the premise that all sensors can communicate with each other in a specific communication radius, we obtained the relationship among the connectivity, the number of sensor nodes, and the communication radius because of the theory of probability and statistics. The innovation of the paper is to maximize the network connectivity and connectivity probability, by choosing which types of sleeping nodes to wake up. According to the node’s residual energy and the relative value of distance, the algorithm reduces the energy consumption of the whole network as much as possible, and wakes up the number of neighbor nodes as little as possible, to improve the service life of the whole network. Simulation results show that this algorithm combines the connectivity and the energy efficiency, provides a useful reference value for the normal operation of the sensors networks.


Sign in / Sign up

Export Citation Format

Share Document