2010
DOI: 10.7125/apan.30.8
|View full text |Cite
|
Sign up to set email alerts
|

A New Energy Efficient Routing Algorithm Based on a New Cost Function in Wireless Ad hoc Networks

Abstract: Abstract-Wireless ad hoc networks are power constrained since nodes operate with limited battery energy. Thus, energy consumption is crucial in the design of new ad hoc routing protocols. In order to maximize the lifetime of ad hoc networks, traffic should be sent via a route that can be avoid nodes with low energy. In addition, considering that the nodes of ad hoc networks are mobile, it is possible that a created path is broken because of nodes mobility and establishment of a new path would be done again. Th… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 8 publications
(9 reference statements)
0
5
0
Order By: Relevance
“…Lotfi et al [28] proposed a methodology where traffic could be sent through a route that does not choose nodes with low energy. Node stability has been defined according to the rate of change of its neighbors in specific time.…”
Section: Imparting Link Stability Using Residual Energy Of the Nodesmentioning
confidence: 99%
“…Lotfi et al [28] proposed a methodology where traffic could be sent through a route that does not choose nodes with low energy. Node stability has been defined according to the rate of change of its neighbors in specific time.…”
Section: Imparting Link Stability Using Residual Energy Of the Nodesmentioning
confidence: 99%
“…The node has OPEN and closed list, which produces a structure of sensor nodes. The OPEN list is a priority queue and maintains the track of those nodes while the CLOSED list maintain track of nodes which may be already examined [10]. It is used a distance plus cost heuristic node n, f(n) to calculate the some nodes in the tree.…”
Section: B Proposed Energy-efficient Routing Algorithmmentioning
confidence: 99%
“…The remaining lifetime of the node i is computed based on residual energy of the node i (E i ) and energy drain rate of the node i (DR i ) [12,21]. Eq.…”
Section: Degree Of Future Contact Evaluationmentioning
confidence: 99%