Energy aware efficient geographic routing in lossy wireless sensor networks with environmental energy supply (original) (raw)

IMPROVING GEOGRAPHICAL ENERGY AWARE ROUTING PROTOCOL TO ENHANCE LIFETIME OF WSNs

IJCSMC, 2018

Wireless sensor networks (WSNs) are composed of small battery-powered devices with limited energy resources which are called wireless sensor nodes. Once the sensor node is deployed, the battery of the wireless sensor node cannot be charged. Clustering algorithms are one of the main techniques used to minimize the energy consumption of sensor nodes in wireless sensor networks. However, how to choose a cluster head in a clustering algorithm is a major challenge. In this work, we studied the expected transmission count for wireless sensor networks and Modified geographical energy-aware routing protocol. We divide the wireless sensor node into four logical regions based on the location area in the sensing field. We installed a gateway node at the center of the sensing field and installed a base station away from the sensing field. If the distance of the wireless sensor node from the gateway or base station is less than a predetermined distance threshold, the wireless sensor node communicates directly. The remaining two areas are far from the gateway or base station, and choose the cluster head independent of each area. These cluster heads are selected based on the same probability as LEACH, remaining energy and expected transmission counts (ETX). We compare the performance of our proposed protocol with the Modified geographical energy-aware routing protocol for wireless sensor networks. Performance analysis and comparison of statistical results show that our proposed protocol performs well in terms of throughput, packet transmission rate, energy consumption, and network lifetime by considering Residual energy and ETX while selecting Cluster Head (CH).

Energy consumption of Geographic Routing Mechanisms in Wireless Sensor Networks – a Survey

2018

Geographic routing algorithms have received an increasing interest as a routing solution for WSN over the past years. These algorithms refer to nodes by their location, rather than their address and use this coordinates to route greedily when possible toward the destination. These tasks are executed for a better scalability, successful data transmission and lower energy consumption. Most geographic routing mechanisms tend to have a limitation regarding routing toward dead ends and obstacles. Some algorithms were developed for packet radio and wired networks as a greedy strategy, based on the relative direction of the source and destination. Instead of selection the next hop by the minimum criteria, two hops information and heuristic model are used to avoid congested areas and void regions. To increase the delivery rate, multipath strategy algorithms were introduced to broadcast a message through di erent nodes that are within a cone or a rectangle determined by the source and destin...

Efficient geographic routing over lossy links in wireless sensor networks

2008

Abstract Recent experimental studies have shown that wireless links in real sensor networks can be extremely unreliable, deviating to a large extent from the idealized perfect-reception-within-range models used in common network simulation tools. Previously proposed geographic routing protocols commonly employ a maximum-distance greedy forwarding technique that works well in ideal conditions. However, such a forwarding technique performs poorly in realistic conditions as it tends to forward packets on lossy links.