EGGR: Energy-aware and delivery Guarantee Geographic Routing protocol

Boulaiche, Mehdi; Bouallouche-Medjkoune, Louiza

doi:10.1007/s11276-014-0880-1

Cited by 8 publications

(6 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Greedy Perimeter Stateless Routing GPSR is an example of geographic routing protocols GPSR [27]. Geographic routing has become an attractive solution [28][29][30][31][32][33][34] for wireless sensor networks where nodes keep only information about local one-h o p neighbors. In geographic routing, a node selects a next forwarding node based only on the location of itself, its neighbors and the base station.…”

Section: Related Workmentioning

confidence: 99%

IEGGR: Improved Energy-aware and Delivery Guarantee Geographic Routing

Redjimi

Boulaiche

Redjimi

2021

JCOMSS

View full text Add to dashboard Cite

Wireless Sensor Networks are a set of sensor nodes that probe their surroundings and send their data over multi-hop routes to a base-station (BS) for processing. Many routing protocols have been developed for WSNs. A great attention has been given to geographic routing protocols, which rely only on local knowledge of nodes to disseminate data towards the BS. In this paper, we propose a new energy efficient geographic routing protocol called Improved Energy-aware and delivery Guarantee Geographic Routing protocol (IEGGR). The proposed protocol exploits the positions of neighboring nodes, which are closest to the BS to forward packets through the shortest path in terms of energy consumption. IEGGR introduces a mechanism in order to forward packets efficiently around voids. IEGGR algorithm considers the WSN as a connected-graph and to route a packet from a source node to the BS, IEGGR tries making the locally optimal choice at each intermediate node with the hope of finding a global optimum path, which ai ms to minimize energy consumption. To find greedily the optimal path, each forwarding node exploits its neighbor positions that are closest to the BS in order to iteratively building the end-to-end optimal path. Simulation results show that IEGGR is efficient in energy management during packet forwarding.

show abstract

Section: Related Workmentioning

confidence: 99%

IEGGR: Improved Energy-aware and Delivery Guarantee Geographic Routing

Redjimi

Boulaiche

Redjimi

2021

JCOMSS

View full text Add to dashboard Cite

show abstract

“…Since sensor nodes do not employ any addressing system (e.g. IP) [1] and because sensors are randomly deployed in the environment, location information can be used to route data packets. Location-free routing protocols, on the other hand, employ other information such as hop count or link quality.…”

Section: Recent Routing Protocols For Uwsnsmentioning

confidence: 99%

“…This kind of networks consists of a collection of sensors deployed in an environment to perform a collaborative task. A sensor node is a micro-electronic device having the capability to detect, measure and transmit a variety of parameters such as temperature, salinity and pressure [1]. UWSNs are envisioned to enable various applications including scientific, military and commercial applications.…”

Section: Introductionmentioning

confidence: 99%

An Overview Survey of Recent Routing Protocols for Underwater Wireless Sensor Networks

Faiza

Nasser

Day

et al. 2018

SQU Journal for Science

View full text Add to dashboard Cite

With the recent advances in underwater sensor devices and technologies, underwater wireless sensor networks (UWSNs) enable a variety of applications such as underwater exploration and monitoring, disaster prevention, and military surveillance and reconnaissance. However, these kinds of networks faces a number of challenges induced by the nature of the underwater environment and its influence on the physical media. Therefore, new routing protocols are proposed specifically for such networks to mitigate these challenges. This paper surveys some of the recent routing protocols for UWSNs. Specifically, the idea of each protocol is presented as well as its advantages and disadvantages. Furthermore, the presented protocols are classified into different categories. The paper is concluded with some open research issues.

show abstract

“…We set d to the limit 6 / r in order to minimize the number of routing hops. Each grid cell is identified by a triple of cell coordinates (x, y, z) as illustrated in figure 1.…”

Section: Assumptions and Preliminariesmentioning

confidence: 99%

“…They may contain hundreds or even thousands of sensor nodes. Many related research problems have attracted attention including deployment strategies [2], reliable communication, routing [3], medium access [4], localization [5] and energy conservation [6].…”

Section: Introductionmentioning

confidence: 99%