Energy efficient geographic routing for wireless sensor networks.

A wireless sensor network consists of a large number of low-power nodes equipped with wireless radio. For two nodes not in mutual transmission range, message exchanges need to be relayed through a series of intermediate nodes, which is a process known as multi-hop routing. The design of efficient routing protocols for dynamic network topologies is a crucial for scalable sensor networks. Geographic routing is a recently developed technique that uses locally available position information of nodes to make packet forwarding decisions. This dissertation develops a framework for energy efficient geographic routing. This framework includes a path pruning strategy by exploiting the channel listening capability, an anchor-based routing protocol using anchors to act as relay nodes between source and destination, a geographic multicast algorithm clustering destinations that can share the same next hop, and a lifetime-aware routing algorithm to prolong the lifetime of wireless sensor networks by considering four important factors: PRR (Packet Reception Rate), forwarding history, progress and remaining energy. This dissertation discusses the system design, theoretic analysis, simulation and testbed implementation involved in the aforementioned framework. It is shown that the proposed design significantly improves the routing efficiency in sensor networks over existing geographic routing protocols. The routing methods developed in this dissertation are also applicable to other location-based wireless networks

Energy-Aware Weight Assignment Framework for Circuit Oriented GMPLS Networks

A branch of green networking research is consolidating. It aims at routing traffic with the goal of reducing the network energy consumption. It is usually referred to as Energy- Aware Routing. Previous works in this branch only focused on pure IP networks, e.g., assuming an Open Shortest Path First (OSPF) control plane, and best effort packet forwarding on the data plane. In this work, we consider instead Generalized Multi-Protocol Label Switching (GMPLS) backbone networks, where optical technologies allow to design "circuit switching" network management policies with strict bandwidth reservation policies. We define a simple and generic framework which generates a family of routing algorithms, based on an energy-aware weight assignment. In particular, routing weights are functions of both the energy consumption and the actual load of network devices. Using such weights, a simple minimum-cost routing allows finding the current least expensive circuit, minimising the additional energy cost. Results obtained on realistic case studies show that our weight assignment policy favours a consistent reduction of the network power consumption, without significantly affecting the network performance. Furthermore, the framework allows to trade energy efficiently and network performance, a desirable property at which ISPs are looking for. Simple and robust parameter settings allow reaching a win-win situation, with excellent performance in terms of both energy efficiency and network resource utilization

Minimal Energy Routing for Deep Space Satellite Networks

The purpose of this research is to find out a packet routing algorithm for link error rate aware satellite networks, achieving minimal network energy utilization. The existing energy aware routing protocols typically select routes that minimize the total transmission power over the satellites of the path, but do not consider the retransmissions that may be needed. A new protocol considering the link error rates in route selections for satellite networks is required. In our approach of data routing, the effective total transmissions and the energy required for these transmissions is considered. The simulator developed in C#.NET was designed and programmed to simulate and analyze the proposed link error rate aware routing protocol performance. Satellite network models for the simulation were developed using BRITE, a topology generator framework. Simulations are performed and the algorithm performance is analyzed in terms of energy load balance and schedule lengths.Computer Science Departmen

Routing in WSNs Powered by a Hybrid Energy Storage System through a CEAR Protocol Based on Cost Welfare and Route Score Metric

Implementing a low cost, power efficient and high performance routing protocol in wireless sensor networks (WSNs) is an important requirement for transmitting a packet through network. In this paper we propose, a new cost and energy aware routing protocol (CEAR) that works based on the two metrics such as cost welfare metric and route score metric.A hybrid electrical energy storage (HEES) framework which holds numerous banks of heterogeneous electrical energy storage (EES) components to be specific battery and a ultra-capacitor is used for providing energy to the network exhibit in the WSN for routing. The simulation results shows that our proposed routing protocol routes the packet efficiently by choosing the best path that also reduces the cost and routes the packet with reduced power consumption. The quantitative metrics in terms of packet delivery ratio of 0.93, average end to end delay of 110 secs, packet loss ratio of 0.75, average throughput attained of 250 bits/sec and efficiency of 98-99.9% overpowers the performance of our proposed work

Energy-aware peering routing protocol for indoor hospital body area network communication

The recent research in Body Area Networks (BAN) is focused on making its communication more reliable, energy efficient, secure, and to better utilize system resources. In this paper we propose a novel BAN network architecture for indoor hospital environments, and a new mechanism of peer discovery with routing table construction that helps to reduce network traffic load, energy consumption, and improves BAN reliability. We have performed extensive simulations in the Castalia simulation environment to show that our proposed protocol has better performance in terms of reduced BAN traffic load, increased number of successful packets received by nodes, reduced number of packets forwarded by intermediate nodes, and overall lower energy consumption compared to other protocols

Two-Hop Routing with Traffic-Differentiation for QoS Guarantee in Wireless Sensor Networks

This paper proposes a Traffic-Differentiated Two-Hop Routing protocol for Quality of Service (QoS) in Wireless Sensor Networks (WSNs). It targets WSN applications having different types of data traffic with several priorities. The protocol achieves to increase Packet Reception Ratio (PRR) and reduce end-to-end delay while considering multi-queue priority policy, two-hop neighborhood information, link reliability and power efficiency. The protocol is modular and utilizes effective methods for estimating the link metrics. Numerical results show that the proposed protocol is a feasible solution to addresses QoS service differenti- ation for traffic with different priorities.Comment: 13 page