2009
DOI: 10.1002/dac.991
|View full text |Cite
|
Sign up to set email alerts
|

EEAODR: An energy‐efficient ad hoc on‐demand routing protocol for mobile ad hoc networks

Abstract: SUMMARYMobile ad hoc networks (MANETs) are characterized by random, multi-hop topologies that do not have a centralized coordinating entity or a fixed infrastructure that may change rapidly over time. In addition, mobile nodes operate with portable and finite power sources. In this work, we propose an energy-efficient routing protocol for MANETs to minimize energy consumption and increase the network's consistency. Traditional works mainly focused on the shortest path-based schemes to minimize energy, which mi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
33
0

Year Published

2010
2010
2014
2014

Publication Types

Select...
7
2

Relationship

2
7

Authors

Journals

citations
Cited by 48 publications
(34 citation statements)
references
References 20 publications
0
33
0
Order By: Relevance
“…There exist other categories of protocols in the literature (Al- Karaki and Kamal, 2004;Akkaya and Younis, 2005), some of which include rumor routing (Braginsky and Estrin, 2002), minimum cost forwarding (MCF) (Ye et al, 2001), gradient-based routing (GBR) (Schurgers and Srivastava, 2001), information driven sensor querying (IDSQ) (Chu et al, 2002), energy-aware routing (Shah and Rabaey, 2002), COUGAR (Yao and Gehrke, 2002), ACQUIRE (Sadagopan et al, 2003). Apart from these protocols there are protocols designed for energy-efficient routing such as REEP (Zabin et al, 2008), EEAODR (Dhurandher et al, 2009c) and SPAN (Chen et al, 2002). Some of the other works on energy-efficient routing can be found in papers such as (Ganesan et al, 2001;Lindsey and Raghavendra, 2002;Rahul and Rabaey, 2002;Li and Halpern, 2001;Bandyopadhyay and Coyle, 2003;Dhurandher et al, 2009a,b,c;Misra et al, 2008).…”
Section: Introductionmentioning
confidence: 98%
“…There exist other categories of protocols in the literature (Al- Karaki and Kamal, 2004;Akkaya and Younis, 2005), some of which include rumor routing (Braginsky and Estrin, 2002), minimum cost forwarding (MCF) (Ye et al, 2001), gradient-based routing (GBR) (Schurgers and Srivastava, 2001), information driven sensor querying (IDSQ) (Chu et al, 2002), energy-aware routing (Shah and Rabaey, 2002), COUGAR (Yao and Gehrke, 2002), ACQUIRE (Sadagopan et al, 2003). Apart from these protocols there are protocols designed for energy-efficient routing such as REEP (Zabin et al, 2008), EEAODR (Dhurandher et al, 2009c) and SPAN (Chen et al, 2002). Some of the other works on energy-efficient routing can be found in papers such as (Ganesan et al, 2001;Lindsey and Raghavendra, 2002;Rahul and Rabaey, 2002;Li and Halpern, 2001;Bandyopadhyay and Coyle, 2003;Dhurandher et al, 2009a,b,c;Misra et al, 2008).…”
Section: Introductionmentioning
confidence: 98%
“…Hence, they suffer from extremely huge storage overhead because they store information about both active and inactive routes. Reactive or on demand routing protocols are designed to reduce this overhead [1], [2], [3], [4], [5], [6], [7]. Different cache replacement procedures that can be used with EXERP [8], are Least Recently Used (LRU), Least Frequently Used (LFU) and Maximum Record Size (MRS) [8].…”
Section: Introductionmentioning
confidence: 99%
“…However, such protocols does not give network administrators the required flexibility to use one single protocol and configure it to optimize any one of the routing goals mentioned. Some routing protocols [19,20] have been proposed where both the least delay and energy efficient routing have been taken into account. In these routing protocols, the routing selection is formulated as a bi-criteria decision making problem.…”
Section: Introductionmentioning
confidence: 99%