2015
DOI: 10.1016/j.procs.2015.07.380
|View full text |Cite
|
Sign up to set email alerts
|

Proficiency Analysis of AODV, DSR and TORA Ad-hoc Routing Protocols for Energy Holes Problem in Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 20 publications
(6 citation statements)
references
References 20 publications
0
5
0
Order By: Relevance
“…Parameters and their values used in the simulation have been shown in Table 1. In order to prove the efficiency of the protocol, the LEACH [4], the MGEAR [5] and the GSEP [6] protocols are used for comparison.…”
Section: Simulation and Results Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…Parameters and their values used in the simulation have been shown in Table 1. In order to prove the efficiency of the protocol, the LEACH [4], the MGEAR [5] and the GSEP [6] protocols are used for comparison.…”
Section: Simulation and Results Analysismentioning
confidence: 99%
“…Therefore, energy depletion of one node varies from another, i.e., nodes nearby the sink node have more energy depletion than other nodes. This gives rise to the creation of energy holes near the sink [3,4]. Due to the energy holes problem further data transmission towards the sink is not possible.…”
Section: Introductionmentioning
confidence: 99%
“…The average delivery delay 24 is defined as the time taken by the message to reach its destination. Energy consumption 55 of the individual nodes to energy consumption by the entire number of nodes is called average energy. SOS is compared with the following protocols: CAIS 24 and SSAR 34 .…”
Section: Performance Evaluationmentioning
confidence: 99%
“…For controlling the propagation of message between various routing algorithms, this algorithm provides highest degree of potential. The solution from the minimal path is not selected by the TORA which is not specific to other routing algorithms [13]. Directed Acyclic Graph (DAG) is managed by TORA to root (figure 4) the packet to its destination terminals.…”
Section: H Tora (Temporally-ordered Routing Algorithm)mentioning
confidence: 99%