Comparative Analysis of Opportunistic Routing Protocol Algorithms in Wireless Sensor Network
Ben Fradj Hajer, Ridha Bouallègue · 2018
Sensor arrays are made up of several tiny sensors or nodes having an essential characteristic residing in the absence of fixed infrastructure and having a changing topology due to the mobility of the sensors and raises the problem of the exhaustion of their batteries. A sensor is limited in energy. In most cases, battery replacement is not possible. This means that the lifetime of a sensor depends greatly on the lifetime of the battery. In a sensor network (multi-hop) each node collects data and sends / transmits values. The dysfunction of some nodes requires a changing the network topology and re- routing the packets. All of these operations are energy-intensive, and this is why current research focuses mainly on how to reduce this consumption. The main objective of most opportunistic routing protocols is to find efficient algorithms and techniques in terms of energy so that the lifetime of the network is maximized. There are several types of opportunistic routing protocol in the network of wireless sensors. These routing protocols are created in order to prevent collisions and save energy. This document tries to study and compare the performance of some opportunistic routing protocols with the aim and to show the performance of the ROR algorithm by contribution to others.