Energy Management in Wireless Sensor Network Using PEGASIS

AbstractThe 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

New energy efficient routing algorithm for Wireless Sensor Network

Energy efficiency is the most challenging topic in Wireless Sensor Networks (WSN). Because of the increasing demands of various applications, and the constraints of energy, memory and computational power of the WSN nodes, many studies have focused on these areas in recent years. Researchers have proposed a variety of protocols such as LEACH, PEGASIS, HEED, TEEN, etc. In this paper, we will discuss how energy efficiency is affected by scaling, i.e. different network sizes, and by different routing algorithms. With the increasing applications of large scale WSNs, such as smart grid and environmental monitoring. We will propose a new routing algorithm to optimize the energy efficiency by reducing the number and total transmissions distance in order to save energy. Simulations suggest that the proposed algorithm will be more energy efficient in medium to large scale wireless sensor networks

Performance Comparison of LEACH and LEACH-C Protocols in Wireless Sensor Networks

Wireless Sensor Networks (WSNs) draw the attention of researchers due to the diversity of applications that use them. Basically, a WSN comprises many sensor nodes that are supplied with power by means of a small battery installed in the node itself; the node can also be self-charged by a solar cell. Sometimes it is impossible to change the power supply of battery-operated nodes. This dictates that sensor nodes must utilize the energy they have in an optimal manner. Data communication is the main cause of energy dissipation. In this context, designing protocols for WSNs demands more attention to the design of energy-efficient routing protocols that allow communications between sensor nodes and their base station (BS) with the least cost. LEACH is a prominent hierarchical cluster-based routing protocol. It groups sensor nodes into clusters to reduce energy dissipation. On the other hand, LEACH-C is a protocol based on LEACH that claims to improve energy dissipation over LEACH. In this paper, a successful attempt was made to compare these two protocols using MATLAB. The results show that LEACH-C has better performance than LEACH in terms of power dissipation

Optimization of Energy Efficient Advance Leach Protocol

In WSNs, the only source to save life for the node is the battery consumption. During communication with other area nodes or sensing activities consumes a lot of power energy in processing the data and transmitting the collected/selected data to the sink. In wireless sensor networks, energy conservation is directly to the network lifetime and energy plays an important role in the cluster head selection. A new threshold has been formulated for cluster head selection, which is based on remaining energy of the sensor node and the distance from the base station. Proposed approach selects the cluster head nearer to base station having maximum remaining energy than any other sensor node in multi-hop communication. The multi hop approach minimizing the inter cluster communication without effecting the data reliability

Energy Efficient Scheme for Wireless Sensor Networks

Recent advances in wireless sensor networks have commanded many new protocols specifically designed for sensor networks where energy awareness is an important concern. This routing protocols might differ from depending on the application and the network architecture. To extend the lifetime of Wireless sensor network (WSN), an energy efficient scheme can be designed and developed via an algorithm to provide reasonable energy consumption and network for WSN. To maintain high scalability and better data aggregation, sensor nodes are often grouped into disjoint, non-overlapping subsets called clusters. Clusters create hierarchical WSNs which incorporate efficient utilization of limited resources of sensor nodes to reduce energy consumption, thus extend the lifetime of WSN. The objective of this paper is to present a state of the art survey and classification of energy efficient schemes for WSNs. Keywords: Wireless Sensor Network, clustering, energy efficient clustering, network lifetime, energy efficient algorithms, energy efficient routing, and sensor networks. DOI: 10.17762/ijritcc2321-8169.15024

Dynamic Interface to Enhance Network Efficiency Using Channel Allocation

Abstract--Wireless Sensor Networks (WSN) is a group of spatially dispersed and dedicated sensors for monitoring and recording the physical conditions of the environment and organizing the collected data at a central location. The sensor nodes are extraordinarily limited in resources, so the important aim of designing routing protocol of WSN is to improve the routing efficiency and maximize the lifetime of networks. In the recent past, the routing efficiency and its issues can be solved by various protocols. In this paper we enhanced many to one transmission with AODV protocol and efficient channel allocation. We have implemented flat multi-hop routing algorithms which enable routing of data in a fashion that minimizes the power consumption of the WSN they fail to exploit the data aggregation opportunities by virtue of data collected from the WSN. In many WSN applications with the relatively high node density, the data collected by individual nodes are highly redundant, thus making data aggregation a very attractive scheme in WSNs. Hybrid multi-hop routing algorithms aim to capitalize on the highly correlated nature of WSN's collected data. It can improve the routing efficiency and channel allocation in cluster networks. The cluster head selection is obtained based on energy level and routing efficiency of the network

Energy efficient chain based routing protocol for deterministic node deployment in wireless sensor networks

Wireless Sensor Network (WSN) consists of small sensor devices, which are connected wirelessly for sensing and delivering specific data to Base Station (BS). Routing protocols in WSN becomes an active area for both researchers and industrial, due to its responsibility for delivering data, extending network lifetime, reducing the delay and saving the node’s energy. According to hierarchical approach, chain base routing protocol is a promising type that can prolong the network lifetime and decrease the energy consumption. However, it is still suffering from long/single chain impacts such as delay, data redundancy, distance between the neighbors, chain head (CH) energy consumption and bottleneck. This research proposes a Deterministic Chain-Based Routing Protocol (DCBRP) for uniform nodes deployment, which consists of Backbone Construction Mechanism (BCM), Chain Heads Selection mechanism (CHS) and Next Hop Connection mechanism (NHC). BCM is responsible for chain construction by using multi chain concept, so it will divide the network to specific number of clusters depending on the number of columns. While, CHS is answerable on the number of chain heads and CH nodes selection based on their ability for data delivery. On the other hand, NHC is responsible for next hop connection in each row based on the energy and distance between the nodes to eliminate the weak nodes to be in the main chain. Network Simulator 3 (ns-3) is used to simulate DCBRP and it is evaluated with the closest routing protocols in the deterministic deployment in WSN, which are Chain-Cluster Mixed protocol (CCM) and Two Stage Chain based Protocol (TSCP). The results show that DCBRP outperforms CCM and TSCP in terms of end to end delay, CH energy consumption, overall energy consumption, network lifetime and energy*delay metrics. DCBRP or one of its mechanisms helps WSN applications by extending the sensor nodes lifetime and saving the energy for sensing purposes as long as possible

Development of a Robust Wireless Sensor Mesh and Multi-hop Network

Wireless networking has evolved rapidly since the first wireless device was invented. Throughout those years, researchers and engineers are struggling to apply the knowledge of wireless networking in useful ways in real life. Wireless Sensor Network (WSN) has been used in many applications, from habitat surveying to critical monitoring. Reliability of the WSN plays a major role in deciding whether it should be used or not in critical applications instead of using traditional wireless technology or wired networking. This project is solely a research and development of routing algorithm for WSN by using an existing source and straight away finding its weak point in order to apply further improvisation. The existing routing algorithms used are the XMESH and Ad-Hoc On-Demand Vector Routing (AODV)