2011 International Conference on Computational Intelligence and Communication Networks 2011
DOI: 10.1109/cicn.2011.70
|View full text |Cite
|
Sign up to set email alerts
|

Energy Efficient Shortest Path Routing Protocol for Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
11
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 12 publications
(11 citation statements)
references
References 14 publications
0
11
0
Order By: Relevance
“…Shortest path routing protocol [23] has been one of the easiest algorithm used for finding the best possible route which is shorter in terms of number of hops. A slight modification in the existing algorithm is done to find the energy efficient routes [14]. In EESP [14] route computation is based not only on the distance but also on the residual energy in the nodes.…”
Section: 4energy Efficient Shortest Path Routing Protocolmentioning
confidence: 99%
See 1 more Smart Citation
“…Shortest path routing protocol [23] has been one of the easiest algorithm used for finding the best possible route which is shorter in terms of number of hops. A slight modification in the existing algorithm is done to find the energy efficient routes [14]. In EESP [14] route computation is based not only on the distance but also on the residual energy in the nodes.…”
Section: 4energy Efficient Shortest Path Routing Protocolmentioning
confidence: 99%
“…A slight modification in the existing algorithm is done to find the energy efficient routes [14]. In EESP [14] route computation is based not only on the distance but also on the residual energy in the nodes.…”
Section: 4energy Efficient Shortest Path Routing Protocolmentioning
confidence: 99%
“…Both ETX and node energy is used to select between parent nodes of equal hop-count in [9]. The residual-energy is included as a denominator in the additive distance metric in [10]. Using it as in the denominator makes the cost of a node increase toward infinity as energy approaches zero.…”
Section: Related Workmentioning
confidence: 99%
“…CH selects the members for the cluster based on the energy and the distance from itself. Although EEAODV [18] was proved to perform better, it has been still improved by assigning the job of route establishment to the BS in Optimal Path Energy Efficient Routing (OPEER) [35]. As the BS is not energy constrained, it can be over burdened without affecting the network performance.…”
Section: Related Workmentioning
confidence: 99%
“…Also some of the papers [25,31,35,37,38] have considered a centralized approach where BS does the job of CH selection. However most of the algorithms do not consider dynamic thresholds.…”
Section: Related Workmentioning
confidence: 99%