Energy-efficient capacity-constrained routing in wireless sensor networks (original) (raw)

A constrained shortest-path energy-aware routing algorithm for wireless sensor networks

2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609), 2002

While traditional routing protocols try to minimize the end-to-end delay or maximize the throughput, most energyaware routing protocols for wireless sensor networks try to extend the life time of the network by minimizing the energy consumption sacrificing other performance metrics. In this paper, we introduce a new energy-aware routing protocol that tries to minimize the energy consumption and, at the same time, maintain good end-to-end delay and throughput performance. The new algorithm is based on a constrained shortest-path algorithm. We compare the new algorithm with some traditional routing and energy-aware routing algorithms. The results show that the new algorithm performance is acceptable under all performance metrics and presents a performance balance between the traditional routing algorithms and the energy-aware routing algorithms. The constraint value can be chosen to achieve different performance objectives for different sensor network missions.

Energy aware routing for wireless sensor networks

… 2005. Proceedings of the IEEE Symposium …, 2005

Self organizing, wireless sensors networks are an emergent and challenging technology that is attracting large attention in the sensing and monitoring community. Impressive progress has been done in recent years even if we need to assume that an optimal protocol for every kind of sensor network applications cannot exist. The energy constraint sensor nodes in sensors networks operate on limited batteries, so it is a very important issue to use energy efficiently and reduce power consumption. Many routing protocols have been proposed among these protocols, the adaptive routing protocols are very attractive because they have low routing overhead. As a result, the routes tend to have the shortest hop count and contain weak links, which usually provide low performance and are susceptible to breaks. In this paper we introduce an adaptive routing protocol called energy aware routing that is intended to provide a reliable transmission environment with low energy consumption. This protocol efficiently utilizes the energy availability and the received signal strength of the nodes to identify the best possible route to the destination. Simulation results show that the energy aware routing scheme achieves much higher performance than the classical routing protocols, even in the presence of high node density and overcomes simultaneous packet forwarding.

Energy Efficient Routing Protocol for Increasing Lifetime of Wireless Sensor Network

International Journal of Engineering Technologies and Management Research, 2020

In the recent years, an efficient design of a Wireless Sensor Network has become important in the area of research. The major challenges in the design of Wireless Sensor Network is to improve the network lifetime. The main difficulty for sensor node is to survive in that monitoring area for the longer time that means there is a need to increase the lifetime of the sensor nodes by optimizing the energy and distance. There are various existing routing protocols in which optimal routing can be achieved like Data-Centric, Hierarchical and Location-based routing protocols. In this paper, new power efficient routing protocol is being proposed that not only select the shortest path between the source node and sink node for data transmission but also maximizes the lifetime of the participating nodes by selecting the best path for sending the data packet across the network. The main objective of this research is to develop a faster algorithm to find the energy efficient route for Wireless Se...

On energy efficient routing for wireless sensor networks

2008 International Conference on Innovations in Information Technology, 2008

The design of energy-efficient protocols for Wireless Sensor Networks (WSNs) is a crucial problem as energy is a stringent resource in these networks. In this paper, we propose an energy-aware routing protocol using a new approach. To be more specific, we present a protocol called High Power Short Distance protocol (HPSD). HPSD is a node-based protocol that selects the route to the base station (BS) based on the closest node that has the highest battery power relative to its surrounding neighbors. Thus, the energy load can be distributed among all sensor nodes instead of using certain path each time. As such, HPSD can increase the life time of the network. We simulate the performance of HPSD and compare it to other routing protocols for WSNs. Our results show that albeit being simple, HPSD proved to be a very efficient routing protocol in terms of increasing the life time of the network. Moreover, simulation results show that HPSD can efficiently adapt routes to the nodes available power.

An energy efficient routing mechanism for wireless sensor networks

2006

Abstract In recent years, there has been a growing interest in wireless sensor networks. One of the major issues in wireless sensor network is developing an energy-efficient routing protocol. Since the sensor nodes have limited available power, energy conservation is a critical issue in wireless sensor network for nodes and network life. Most of the existing routing protocols for sensor networks don't turn off the radio frequency completely. They speed up the energy consumption.

An Energy-Aware Routing Protocol in Wireless Sensor Networks

Sensors, 2009

The most important issue that must be solved in designing a data gathering algorithm for wireless sensor networks (WSNS) is how to save sensor node energy while meeting the needs of applications/users. In this paper, we propose a novel energy-aware routing protocol (EAP) for a long-lived sensor network. EAP achieves a good performance in terms of lifetime by minimizing energy consumption for in-network communications and balancing the energy load among all the nodes. EAP introduces a new clustering parameter for cluster head election, which can better handle the heterogeneous energy capacities. Furthermore, it also introduces a simple but efficient approach, namely, intra-cluster coverage to cope with the area coverage problem. We use a simple temperature sensing application to evaluate the performance of EAP and results show that our protocol significantly outperforms LEACH and HEED in terms of network lifetime and the amount of data gathered.

Energy-Efficient Routing Protocols for Wireless Sensor Network : A Survey

2012

179 Abstract— Wireless sensor networks have recently received tremendous attention from both academia and industry because of their promise of numerous potential applications in both civilian and military areas. A wireless sensor network consists of a large number of small sensor nodes with sensing, data processing, and communication capabilities, which are deployed in a region of interest and collaborate to accomplish a common task, a sensor network has many unique characteristics, such as denser node deployment, higher unreliability of sensor nodes, asymmetric data transmission, and severe power, computation, and memory constraints, which present many new challenges for the development and eventual application of wireless sensor networks. In particular, sensor nodes are usually battery-powered and should operate without attendance for a relatively long period of time. In most cases, it is very difficult and even impossible to change or recharge batteries for these sensor nodes. Th...

Energy Efficient Routing Protocols for Wireless Sensor Networks

Designing An Energy Efficient Routing Protocol For Wireless Sensor Network (WSN) Has For Decades, Been An Elusive Goal To Network Developers And Enthusiasts. This Is Due To The Distributed And Dynamic Topology Of WSN Which Introduces Unique Requirements In Routing Protocols That Should Be Met. To Be Classified As Efficient, Wsns Must Maintain Efficient Energy Consumption And An Extended Network Lifetime.TheSynchronization Of Peer Nodes Incurs Some Overhead For Installing The Communication Network. In This Paper, We Study The Various Routing Protocols And Compare Among Them. We Also Study The Trade-Offs Between Energy And Communication Overheads, Highlighting The Advantages And Demerits Of Each Routing Protocol With The Purpose Of Discovering New Research Directions. Based On The Identified ResearchGap,WeProposeAnOptimum Energy Efficient Routing Protocol For Today's Wsns.

An Energy Efficient Routing Protocol in Wireless Sensor Networks

2009 International Conference on Computational Science and Engineering, 2009

Wireless sensor networks are used in a wide variety of applications in our day to day life, these networks consists of small electronic devices called node or motes. These nodes will be deployed in large numbers, which are self powered, gather information or detect the required events and communicate it to the base station in a wireless mode. Sensor networks provide more number of opportunities, but at the same time pose challenge like scarcity of energy, as they have non-rechargeable batteries. As the nodes are deployed in the random fashion, due to high density of nodes, more than one node may fall in a very close proximity or in other words, two or more nodes which are very closely situated will be sensing a similar data. In this paper, we present an energy efficient routing protocol based on the closeness factor. In this approach, as soon as the deployment of the nodes is made, the base station will be grouping the set of nodes deployed in to two disjoint sets based on the closeness factor of the nodes and keep one set of nodes inactive till the other node's energy gets depleted. Simulation results prove that lifetime of the entire network can be improved by the proposed method.

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

International Journal of Engineering & Technology

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