Power-Efficient Gathering In Sensor Information Systems Research Articles

Wireless Sensor Network Energy Model and Its Use in the Optimization of Routing Protocols

In this study, a Wireless Sensor Network (WSN) energy model is proposed by defining the energy consumption at each node. Such a model calculates the energy at each node by estimating the energy of the main functions developed at sensing and transmitting data when running the routing protocol. These functions are related to wireless communications and measured and compared to the most relevant impact on an energy standpoint and performance metrics. The energy model is validated using a Texas Instruments CC2530 system-on-chip (SoC), as a proof-of-concept. The proposed energy model is then used to calculate the energy consumption of a Multi-Parent Hierarchical (MPH) routing protocol and five widely known network sensors routing protocols: Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR), ZigBee Tree Routing (ZTR), Low Energy Adaptive Clustering Hierarchy (LEACH), and Power Efficient Gathering in Sensor Information Systems (PEGASIS). Experimental test-bed simulations were performed on a random layout topology with two collector nodes. Each node was running under different wireless technologies: Zigbee, Bluetooth Low Energy, and LoRa by WiFi. The objective of this work is to analyze the performance of the proposed energy model in routing protocols of diverse nature: reactive, proactive, hybrid and energy-aware. Experimental results show that the MPH routing protocol consumes 16%, 13%, and 5% less energy when compared to AODV, DSR, and ZTR, respectively; and it presents only 2% and 3% of greater energy consumption with respect to the energy-aware PEGASIS and LEACH protocols, respectively. The proposed model achieves a 97% accuracy compared to the actual performance of a network. Tests are performed to analyze the consumption of the main tasks of a node in a network.

Minimizing the Energy Hole Problem in Wireless Sensor Networks: A Wedge Merging Approach.

The Energy hole problem, a common phenomenon in wireless sensor networks, significantly decreases the lifetime of any deployed network. Some of the popular techniques to minimize such problems are using mobile sinks instead of static sinks, extending the transmission range dynamically, and deploying redundant sensor nodes near the base station/sink. The major drawback to these techniques are that energy holes may still be created at some point due to their static nature of deployment, despite having the overall residual energy very high. In this research work, we adopt a new approach by dividing the whole network into equiangular wedges and merging a wedge with its neighboring wedge dynamically whenever individual residual energy of all member nodes of a wedge fall below a threshold value. We also propose an efficient Head Node (HN) selection scheme to reduce the transmission energy needed for forwarding data packets among Head Nodes. Simulation results show that WEMER, our proposed WEdge MERging based scheme, provides significantly higher lifetime and better energy efficiency compared to state-of-the-art Power-Efficient Gathering in Sensor Information Systems (PEGASIS) and contemporary Concentric Clustering Scheme (CCS), and Multilayer Cluster Designing Algorithm (MCDA).

Comparison by simulation of PEGASIS and IEEPB routing protocols

<span>As the applications of wireless sensor networks (WSNs) became widely used throughout the years the importance of advanced sensor networks techniques increased as well. One of the main techniques used in WSNs is hierarchical routing which mainly aims to reduce the consumption of sensor nodes energy by assigning different roles to the sensor nodes to create multi-layer scheme for data transmission. This paper embraces a simulation for two known hierarchical routing protocols: Power-Efficient Gathering in Sensor Information Systems (PEGASIS) protocol and an Improved Energy-Efficient PEGASIS-Based (IEEPB) protocol. Both protocols aim to reduce the transmission distance in order to save the nodes energy by performing chain-based clustering. For evaluation, we measured the residual energy and control overhead throughout the network operation time and the results showed major flaws in both protocols such as long link problem and poor leader selection method in PEGASIS. Moreover, high nodes density problem in IEEPB.</span>

ENERGY EFFICIENT LEACH AND IMPROVED LEACH: A REVIEW

Energy Efficiency is the most crucial requirement of sensor nodes in WSN networks. Sensor nodes are the communicating nodes of wireless network which lost their energies with package of time due to having small battery life. So, for sustaining the wireless network to work for longer period of time there requires the need of energy efficient routing protocols [1]. Here in this paper we are presenting LEACH (Low Energy Adaptive Clustering Hierarchy) and PEGASIS (Power Efficient Gathering in Sensor Information System) protocols [2] as most energy efficient protocols to prolong the higher lifetime and small delay time of WSN network .

Enhanced PEGASIS using Dynamic Programming for Data Gathering in Wireless Sensor Network

A number of routing protocol algorithms such as Low-Energy Adaptive Clustering Hierarchy (LEACH) and Power-Efficient Gathering in Sensor Information Systems (PEGASIS) have been proposed to overcome the problem of energy consumption in Wireless Sensor Network (WSN) technology. PEGASIS is a development of the LEACH protocol, where within PEGASIS all nodes are active during data transfer rounds thus limiting the lifetime of the WSN. This study aims to propose improvements from the previous PEGASIS version by giving the name Enhanced PEGASIS using Dynamic Programming (EPDP). EPDP uses the Dominating Set (DS) concept in selecting a subset of nodes to be activated and using dynamic programming based optimization in forming chains from each node. There are 2 topology nodes that we use, namely random and static. Then for the Base Station (BS), it will also be divided into several scenarios, namely the BS is placed outside the network, in the corner of the network, and in the middle of the network. Whereas to determine the performance between EPDP, PEGASIS and LEACH, an analysis of the number of die nodes, number of alive nodes, and remaining of energy were analyzed. From the experiment result, it was found that the EPDP protocol had better performance compared to the LEACH and PEGASIS protocols in terms of number of die nodes, number of alive nodes, and remaining of energy. Whereas the best BS placement is in the middle of the network and uses static node distribution topologies to save more energy.

A Cluster-Driven Energy Routing Protocol for Optimal Network Lifetime in Ad Hoc Networks

Mobile Ad hoc Network (MANET) is a group of networked mobile devices working in a cooperative manner. Due to usage, these devices quickly run out of battery power in critical situations and consequently fail in packet transmission. Power-Efficient Gathering in Sensor Information Systems (PEGASIS) and Dynamic State algorithm are two research works with unique energy efficiency concepts that, if harmonized and refined, will deliver a better optimized energy-efficient routing protocol for MANETs. This study, therefore, proposes PEGADyn – a hybrid version of PEGASIS and Dynamic State algorithm for a new energy-efficient routing protocol in ad hoc networks. PEGADyn creates a virtual grid classification of nodes based on current location, followed by a cluster formation of nodes in each virtual grid created. In each cluster and virtual grid formed, cluster heads (CHs) and designated cluster heads (dCH) are selected based on their energy levels. CHs and dCHs are used for communication between clusters and virtual grids. The use of CHs and dCHs limits communication overheads among nodes, reducing the energy expended and increasing the network lifetime. A simulation comparison of PEGADyn with PEGASIS and Dynamic State shows PEGADyn to be better in extending network lifetime and maintaining network throughput.

Efficient energy utilization in wireless sensor networks: an algorithm

In the era of latest technologies, wireless sensor network (WSN) is becoming more popular in many applications: e-health, e-commerce, banking, farming and many others. However, WSNs have limitations in the sense of processing power, life time and data gathering. Among the above said issues, energy efficiency is the main hindrance of WSN deployment. Different data gathering schemes such as low energy adaptive clustering hierarchy (LEACH) and power efficient gathering in sensor information systems (PEGASIS) have been proposed. However, LEACH and PEGASIS do not provide optimal results for the energy consumption problem and are not feasible to implement. In this research paper, energy efficiency in terms of data gathering in WSN is presented. In this research work, a combined flavor of particle swarm optimization (PSO) with simulated annealing (SA) is given. A novel algorithm is proposed in which best chain formation procedure is adopted. Using the proposed algorithm, a balance energy utilization occurred between nodes, which results in increasing the network performance. Simulation results are obtained and compared with other schemes, which shows better performance as compared to LEACH and PEGASIS.

Effect of multiple sink on the lifetime of multiple chain PEGASIS

A wireless sensor network (WSN) is a wireless network consisting of spatially distributed autonomous devices using sensors to monitor physical or environmental conditions. Gathering sensed information in an energy efficient manner is critical to operate the sensor network for a long period of time. In a data collection problem is defined where, in a round of communication, each sensor node has a packet to be sent to the distant base station. If each node transmits its sensed data directly to the base station then it will deplete its power quickly. The lifetime of the network depend how much energy spent in each transmission. PEGASIS is a Chain Based hierarchial routing protocol. The PEGASIS (Power-Efficient Gathering in Sensor Information Systems) protocol forms a chain of the sensor nodes and the chain is formed using a greedy approach, starting from the node farthest to the sink node. The nearest node is send the data to the neighbour node and takes turns transmitting to the base station, thus reducing the amount of energy spent per round. In wireless sensor network, sensor nodes have limited power and processing capability. The multichain concept in PEGASIS and sink mobility increases the network lifetime in wireless sensor network. In this project, we are showing a revised multi-chain PEGASIS protocol by using the multiple sinks to maximize the network lifetime. The simulation is done in MATLAB. We have considered different different areas and different no. of nodes for simulation and Multiple sinks and multiple nodes are placed using pegasis protocol.

Analisis Perbandingan Konsumsi Energi dan Masa Hidup Jaringan pada Protokol LEACH, HEED, dan PEGASIS di Wireless Sensor Network

Wireless Sensor Network or WSN is a collection of nodes in the form of sensors which establish a network wirelessly. The function of WSN is to collect scattered data that is obtained from sensors which will be transmitted via Ad-Hoc communication to Base Station for further processing. In implementing it, WSN has several problems that occur. One of the problems is the energy consumption and lifetime of the sensor node which the sensor node uses energy only from the battery for its operation. In fact, on its application, the data is not taken once. Thus, it needs energy savings to reduce energy consumption, and the amount of enough energy to make the sensor nodes has a longer lifetime. One of the solutions to overcome the problem is to design a protocol from WSN so that sensor nodes can transmit data to Base Station effectively. In this final project, the simulation was done using three protocols, namely Low Energy Adaptive Clustering Hierarchy (LEACH), Hybrid Energy Efficient Distribute (HEED), and Power-Efficient Gathering in Sensor Information Systems (PEGASIS). The LEACH and HEED protocols used clustering method while PEGASIS used chain method. The analysis performed on these three protocols was energy consumption and network lifespan using the same parameters of Zigbee Xbee Pro and simulated on Matlab R2013a.

A novel review on various energy efficient routing algorithms in wireless sensor networks

In the past few decades, Wireless sensor networks have exhibited a significant amount of growth and have been used in various applications like traffic control, environment monitoring etc. It comprises an accumulation of sensor nodes that sense the data from their surroundings and relay it to the base station. The network suffers from the limited energy constraints since the sensor nodes are mobile nodes and they run out of battery after a considerable amount of time. To overcome this, a certain level of heterogeneity is introduced among the nodes in terms of energy consumption to sustain the overall network lifetime. Various protocols are developed to prolong the network longevity. Among those, PEGASIS (Power-Efficient Gathering in Sensor Information Systems) and LEACH (Low- Energy Adaptive Clustering Hierarchy) are the significant ones, which ensures power-efficient gathering of the data in the sensor networks. This paper attempts to discuss the different aspects of PEGASIS and LEACH and their advantages and disadvantages in detail.

CIRCLES ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORK

Abstract: Wireless Sensor Network (WSN) is an emerging technology for monitoring physical world.WSN consists of large number of sensor nodes operated by battery mostly in harsh environment. These wireless nodes are very limited in battery power and communication processes. Gathering sensed information in an efficient manner is critical to operate the sensor network for a long period time. In this paper, a new Routing Protocol CRP (Circles Routing Protocol) is proposed. The CRP is developed for achieving QoS (Quality of Service) in terms of network life time, power consumption, packet delivery, and network throughput by distributing the energy load among all sensor nodes. The dynamic behavior of the proposed CRP depends on executing the following steps.Firstly, CRP cutting down the playground into many clusters by using the advantage of the grid construction to physically partition the playground into many small individual clusters. Secondly, CRP electing one node in each cluster, as a Cluster Head (CH), form a circular chain within each cluster to collect and fuse data from the other nodes. Thirdly, CRP collecting every four adjacent clusters in one group called inter four clusters. Then, CRP constructing a circular chain within these four clusters containing the four CH nodes. Fourthly, CRP electing one of these CH nodes as an inter CH node to collect and fuse data from the other CH nodes. Finally, CRP constructing a circular chain containing the four inter CH nodes. Then CRP electing one of inter CH nodes to be the outer CH node which collects and fuses the datafrom the other nodes and subsequently transmit this data to the Base Station (BS). In the performanceanalysis, we use the NS-2 Simulator as a simulation technique to study and analysis the performance ofCRP protocol. To verify from the correctness of the obtained performance results, we compare the CRPresults with those obtained from LEACH (Low-Energy Adaptive Clustering Hierarchy) and PEGASIS(Power-Efficient Gathering in Sensor Information System) protocols.

Cluster-chain mobile agent routing algorithm for efficient data aggregation in wireless sensor network

The sensor nodes have limited sensing, computation, communication capabilities and are mostly operated by batteries in a harsh environment with non-replenishable power sources. These restrictions make the sensor network prone to failures because most of the energy is spent on data transmission, sensing, and computing. Many applications such as habitat monitoring, military surveillance and forest fire detection expect the sensor nodes to last for a long time because they operate human unattended. Therefore, the major challenges in designing a wireless sensor network (WSN) are energy conservation, reducing data transmission delay and improving the network lifetime. In this context, data aggregation is an intelligent technique used in WSN, wherein the data from disparate sources are accumulated at intermediate nodes, thereby reducing the number of packets to be sent to the sink. Literature study shows that various routing algorithms are used to perform data aggregation based on the network topology. In order to provide an improved performance amongst the existing, a routing algorithm called cluster-chain mobile agent routing (CCMAR) is proposed in this work. It makes full use of the advantages of both low energy adaptive clustering hierarchy (LEACH) and power-efficient gathering in sensor information systems (PEGASIS). CCMAR divides the WSN into a few clusters and runs in two phases.The proposed system is simulated and evaluated for the performance metrics such as energy consumption, transmission delay and network lifetime. The results demonstrate that the proposed CCMAR outperforms LEACH, PEGASIS and other similar routing algorithm, energy efficient cluster-chain based protocol.

Effective Chain-Based Routing Algorithm for Wireless Sensor Networks

Wireless sensor networks (WSNs) are composed of many low cost, low power devices with sensing, local processing and wireless communication capabilities. Recent advances in wireless networks have led to many new protocols specifically designed for WSNs where energy awareness is an essential consideration. In this paper, we propose a new routing algorithm for WSNs called Chain-based Routing (CRA). CRA solves the main problems in Power Efficient Gathering in Sensor Information Systems (PEGASIS) algorithm. CRA minimizes the energy dissipation and maximizes the network lifetime of WSNs by introducing new chain construction method and new chain leader election algorithm. The simulation results show that our proposed algorithm outperforms the existing algorithms LEACH, PEGASIS, COSEN, and IECBSN in terms of network lifetime and energy consumption minimization.

Comparison of Wireless Sensor Network Routing Protocols under Gamma Radiation for Nuclear and Space Applications

With the advancement of computer and communication technologies, wireless sensor networks (WSNs) are increasingly used in nuclear and space applications, both of which may require operation in a high-intensity radiation environment. Gamma rays’ damaging mechanisms in semiconductor devices are described as, and specifically linked to, semiconductor property changes in detectors, transistors, and integrated circuits. Radiation damage is cumulative and can result in the premature failure of WSN nodes. Failed WSN nodes decrease the quality of service of the entire WSN and then delay immediate response to severe accidents. This paper focuses on evaluating the performance of WSN routing protocols in a gamma-ray radiation environment. The probability density function of a Weibull distribution was used to model failures of individual nodes in simulated WSNs. The distribution parameters are based on results of radiation damage tests performed on semiconductor devices in the Gamma-220 facility (60Co source) at the Canadian Nuclear Laboratories. Simulation of the routing protocols [LEACH (Low Energy Adaptive Clustering Hierarchy), LEACH-C (LEACH-Centralized), Stat-Clus (Static Clustering), MTE (Minimum Transmission Energy), and PEGASIS (Power-Efficient Gathering in Sensor Information Systems)] through NS2 (Network Simulator 2) and the resulting performance analyses could provide useful design insights and considerations for nuclear and space applications. The performance of WSN routing protocols is evaluated for the first time in a gamma-ray radiation environment for nuclear and space applications.

Prolonging the Network Lifetime using Fuzzy logic in Wireless Sensor Network

Wireless sensor networks include deployment of large number of sensor nodes to sense, process and communicate the data to the sink. The small sized sensor nodes are cheap and can be easily deployed in harsh physical environments but the low battery source for the nodes act as a major limitation for the sensor networks to operate efficiently. The protocols have been proposed in recent times to make optimum use of the energy. Power Efficient Gathering in Sensor Information System (PEGASIS) has been considered as an efficient approach as compared to the Low Energy Adaptive Clustering Hierarchy (LEACH). In this paper, a new approach for selecting the leader of the chain has been proposed using Fuzzy Logic in which residual energy and proximity to the base station has been taken as two parameters and combining these two parameters the leader is selected which aggregates and communicates the data further to the sink. The simulation results have shown that this proposed work has improved the performance metrics of the network and thus extended the lifetime of network. General Terms Prolonged Network lifetime in Wireless Sensor Network

Energy Management in Wireless Sensor Network Using PEGASIS

The area of Wireless Sensor Network is one of the fastest growing fields in the communication and engineering world. The main objective of WSN is to sense the crucial information from the environment depending on the type of application for which it is deployed and send this information to its Base Station(BS) so that it can take corrective action. These Sensor Nodes ommunicate with each other through various protocols. The problem of the conventional method is, during gathering of sensed data each node transmits its sensed data directly to the base station for which it will deplete its power quickly. In this project, we propose PEGASIS(Power-Efficient Gathering in Sensor Information System),a near optimal chain-based protocol for extending the lifetime of network. In PEGASIS, each node communicates only with a close neighbour, performing a chain, elect a leader from the chain who collects the data from the neighbours to be transmitted to the base station. As a result the average energy spend by each node per round is reduced and to lower the bandwidth requirement. By using certain algorithm we can propose the shortest path of transmission of data to the base station. As a result less power consumption can be achieved to increase efficiency and life time of the network.

Real Time Environmental Monitoring in Palm Oil Plantation Using Wireless Sensor Network

The production of the palm oil accounted for 10.15%of total palm oil production in Indonesia. Farmland monitoringsystem is designed to determine the condition of temperature andsoil moisture on oil palm plantation. In this study, we design andbuild a Wireless Sensor Network (WSN) with fitted temperatureand moisture sensors for monitoring soil quality. The process oftemperature and moisture data communication from sensor nodesto the sink using a routing protocol that named Power-EfficientGathering in Sensor Information Systems (PEGASIS). The routingprocess in the PEGASIS is the nodes will form a chain by selectinga leader node as a gateway. The development of WSN is composedof 3 nodes and 1 sink with three different scenarios. The firstscenario is placed moisture sensors on three nodes (single sensor),the second is placed the temperature sensors on three nodes (singlesensor) and the third is placed moisture sensor on two node and onenode equiped by temperature sensor (multi sensor). The evaluationof WSN communication using the PEGASIS routing protocolcompared to the direct transmission using delay, packet loss andenergy have done. The results obtained are the difference betweenthe lifetime sensor nodes between direct transmission and thepegasis is 7 minutes time difference. For the average delay ofPEGASIS and direct transmission is 31.23 and 30.92 msrespectively. All transmission in both scheme have packet loss 0%.Conclusion, the WSN has successfully implemented with longer lifetime energy using PEGASIS than direct transmission methods.

Implementation of Smart Sleep Mechanism and Hybrid Data Collection Technique for Maximizing Network Lifetime in WSN’s

Objectives: The main aim of this paper is to optimize energy of the wireless sensor nodes by applying hybrid data collection and smart sleep mechanism in the sensor network. Methods/Analysis: In energy-constrained wireless sensor networks, energy efficiency is critical for prolonging the network lifetime. The instable dissemination of communication loads often roots nodes in some region to be drained faster than the nodes in other regions. This will affect the network lifetime. Findings: When compared with Power-Efficient Gathering in Sensor Information Systems (PEGASIS), Low Energy Adaptive Clustering Hierarchy (LEACH) and Delay Aware Network Structure (DANS), the simulation outcomes show that proposed achieves its intention of less energy depletion, matching the energy depletion of all the nodes, alleviating the data gathering, and prolonging the network lifetime. Conclusion/Application: The hybrid technique prolongs the network lifetime and thus large amount of data can be easily collected by sensors and then routed to sink. In war fields or in conditions of natural disasters wireless senor networks could be deployed with this proposed technique for maximization of network life time.

Effect of using Mobile Sink on Chain-based Routing Protocols in Wireless Sensor Networks

In this paper, we examine some protocols related to WSNs. To evaluate the efficiency of different routing schemes, we compare six chain based routing protocols; Power Efficient Gathering in Sensor Information Systems (PEGASIS), Power Efficient Gathering in Sensor Information System Extended (PEGASIS-E), Chain Oriented SEnsor Network (COSEN), Energy Efficient Chain Based Sensor Network (ECBSN), Improved Energy Efficient Chain Based Sensor Network (IECBSN), and Energy-Aware PEGASIS-Based Hierarchal Routing Protocol for Wireless Sensor Networks (EAPHRN). Two scenarios are discussed to compare the performances of chain based routing protocols; in the first scenario static sink is used and in the second one mobile sink is used. We perform analytical simulations in terms of network lifetime and average energy consumption.

Comparison of Energy Efficient Data Transmission Approaches for Flat Wireless Sensor Networks

In this paper we have analyzed energy efficient neighbour selection algorithms for routing in wireless sensor networks. Since energy saving or consumption is an important aspect of wireless sensor networks, its precise usage is highly desirable both for the faithful performance of network and to increase the network life time. For this work, we have considered a flat network topology where every node has the same responsibility and capability. We have compared two energy efficient algorithms and analyzed their performances when all sensor nodes in a network have either homogeneous or heterogeneous energy with increase in number of nodes, time rounds and node failures. Wireless sensor networks consist of number of small nodes deployed in an area under supervision. Each node has limited storage, computational and sensing capability and limited energy resource, as nodes are battery operated. Since energy is the main concern in wireless sensor networks (WSN) to maximize the performance and to increase the lifetime of a network, various approaches are implemented to reduce energy consumption in a network. Most of the energy is consumed during idle period and during transmission of data from one node to another i.e. routing. An efficient media access control (MAC) and routing protocol should be designed to save energy. While MAC protocol targets at reduction of energy in scanning and accessing the channel, routing protocol helps to reduce the energy requirement for end-to-end transmission. In WSN, there are number of routing protocols that have been proposed for different network criteria. Based on the network topology WSN protocols have been categorized as - flat network protocols and hierarchical protocols as shown in Figure 1. Protocols that fall under hierarchical class select one head amongst all and form a hierarchy (1). This hierarchy may be a cluster, a chain or a grid. Cluster head or a leader collects the information from all the other nodes in its region and sends it to the sink node or gateway node. Some examples are low energy adaptive clustering hierarchy (LEACH), power efficient gathering in sensor information systems (PEGASIS), virtual grid architecture (VGA), etc. The work presented in this paper considers flat protocols and thus we are not including descriptions of hierarchical protocols and will only be