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

Power Aware Routing for Sensor Databases

Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensor network databases like TinyDB are the dominant architectures to extract and manage data in such networks. Since sensors have significant power constraints (battery life), and high communication costs, design of energy efficient communication algorithms is of great importance. The data flow in a sensor database is very different from data flow in an ordinary network and poses novel challenges in designing efficient routing algorithms. In this work we explore the problem of energy efficient routing for various different types of database queries and show that in general, this problem is NP-complete. We give a constant factor approximation algorithm for one class of query, and for other queries give heuristic algorithms. We evaluate the efficiency of the proposed algorithms by simulation and demonstrate their near optimal performance for various network sizes

A Trust Based Congestion Aware Hybrid Ant Colony Optimization Algorithm for Energy Efficient Routing in Wireless Sensor Networks (TC-ACO)

Congestion is a problem of paramount 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 misbehavior 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. Unfortunately most of the researchers have tried to make the routing schemes energy efficient without considering congestion factor and the effect of the faulty nodes. In this paper we have proposed a congestion aware, energy efficient, routing approach that utilizes Ant Colony Optimization algorithm, in which faulty nodes are isolated by means of the concept of trust. The merits of the proposed scheme are verified through simulations where they are compared with other protocols.Comment: 6 pages, 5 figures and 2 tables (Conference Paper

Wireless Sensor Network Infrastructure: Construction and Evaluation

International audienceLarge area wireless sensor deployments rely on multi-hop communications. Efficient packet transmissions and virtual topologies, which structure sensor networks, are two main features for efficient energy management in wireless sensor networks. This paper aims to present a distributed and low-cost topology construction algorithm for wireless sensor networks, addressing the following issues: large-scale, random network deployment, energy efficiency and small overhead. We propose structuring nodes in zones, meant to reduce the global view of the network to a local one. This zone-based architecture is the infrastructure used by our hierarchical routing protocol. The experimental results show that the proposed algorithm has low overhead and is scalable

Object Tracking Using Wireless Sensor Network

Wireless sensor network consists of spatially distributed autonomous sensors to monitor physical or environmental conditions, where each sensors have the ability to collect, process and store information. These characteristics allow WSN (Wireless Sensor Network) to be used in wide range of application such as area monitoring, environmental sensing, battlefield surveillance, NBC (Nuclear Biological Chemical) attack detection and so on. In certain applications where the sensor field is large and the available budget cannot provide enough sensors to fully cover the entire sensor field. This provides the motivation to deploy minimum number of sensors by connecting which the entire sensor field can be fully covered. In this paper we propose an approximation algorithm for grid coverage and a technique namely regular energy efficient monitoring to make the sensors in the minimum size wireless sensor network energy efficient in order to increase the network life time while tracking the object in the network. Simulation shows that the proposed algorithm provides a good solution for grid coverage and energy consumption

Analysis and Improvement of Pegasis using Sink Mobility

WSN is a distributed network to sense diverse physical conditions of the environment using sensors. Sensor nodes could be static or moving. Wireless routing protocols try to ensure efficient transmission of data in WSN. Many routing protocols have been proposed such as LEACH (low energy adaptive clustering hierarchy), PEGASIS (power efficient gathering in sensor information system), TEEN (threshold sensitive energy efficient sensor network protocol). The new algorithm is proposed on the basis of mobility of sink. Using multi-chain, multi-head and sink mobility algorithm, the network can achieve better lifetime. The PEGASIS protocol presented here is a chain-based routing protocol where sensor uses greedy algorithm to form a chain data. In the proposed technique, mobile sink moves along its path and stays at a sojourn location for a sojourn time and guarantees complete collection of data. In this proposed algorithm a path has been developed of mobile sink and then wide range of experiments have been performed to access the performance of the proposed model

An Enhanced Cluster-Based Routing Model for Energy-Efficient Wireless Sensor Networks

Energy efficiency is a crucial consideration in wireless sensor networks since the sensor nodes are resource-constrained, and this limited resource, if not optimally utilized, may disrupt the entire network's operations. The network must ensure that the limited energy resources are used as effectively as possible to allow for longer-term operation. The study designed and simulated an improved Genetic Algorithm-Based Energy-Efficient Routing (GABEER) algorithm to combat the issue of energy depletion in wireless sensor networks. The GABEER algorithm was designed using the Free Space Path Loss Model to determine each node's location in the sensor field according to its proximity to the base station (sink) and the First-Order Radio Energy Model to measure the energy depletion of each node to obtain the residual energy. The GABEER algorithm was coded in the C++ programming language, and the wireless sensor network was simulated using Network Simulator 3 (NS-3). The outcomes of the simulation revealed that the GABEER algorithm has the capability of increasing the performance of sensor network operations with respect to lifetime and stability period