2009 International Conference on Networks Security, Wireless Communications and Trusted Computing 2009
DOI: 10.1109/nswctc.2009.66
|View full text |Cite
|
Sign up to set email alerts
|

Energy-aware AODV Routing for Ad Hoc Networks

Abstract: Routing in Ad hoc Networks has received significant attention with a number of different routing protocols proposed in recent years. DSR, DSDV and AODV are the shortest path protocols for Ad Hoc networks. According to energy, the shortest path may be not the best path. A new mechanism of energy-aware named EAODV for ad hoc is proposed in this paper, which is based on the classical AODV (the routing protocol on demand). In EAODV, The route which spends less energy and owns larger capacity is selected by synthet… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0
1

Year Published

2012
2012
2017
2017

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 7 publications
0
2
0
1
Order By: Relevance
“…The key to achieve these objectives resides in the development of optimized routing protocols. Indeed, the traditional routing is based on the intuitive goal choosing as the shortest ways [5]. The main objective is to balance energy consumption among all participating nodes.…”
Section: Our Proposed Protocol Lea-aodvmentioning
confidence: 99%
See 1 more Smart Citation
“…The key to achieve these objectives resides in the development of optimized routing protocols. Indeed, the traditional routing is based on the intuitive goal choosing as the shortest ways [5]. The main objective is to balance energy consumption among all participating nodes.…”
Section: Our Proposed Protocol Lea-aodvmentioning
confidence: 99%
“…An ad-hoc wireless network is a collection of nodes that come together to dynamically create a network, with no fixed infrastructure or centralized administration [1], [5], for a source to send data packets to a destination that is not in its direct range of transmission, the packets must be relayed through one or more intermediate nodes.…”
Section: Introductionmentioning
confidence: 99%
“…Τα συστήματα Nuglet[34] και[35], καθώς και SPRITE[36], προτείνουν μια μέθοδο ανταμοιβής, όπου κάθε κόμβος χρειάζεται πίστωση για να μεταδώσει ένα πακέτο που δημιούργησε ο ίδιος. Μπορεί όμως να κερδίσει την απαιτούμενη πίστωση, μέσω της προώθησης πακέτων που Στην εργασία[25] όπως και στην[65], επιλέγεται ο AODV(Ad hoc On Demand distance Vector), ο οποίος επεκτείνεται προκειμένου η αναζήτηση διαδρομής να γίνεται με χρήση ενεργειακών κριτηρίων. Η επιλογή βασίστηκε στο γεγονός ότι πρόκειται για έναν αποδοτικό αλγόριθμο δρομολόγησης που δεν δημιουργεί κίνηση παρά μόνο αν είναι απολύτως αναγκαίο και αφαιρεί γρήγορα οποιαδήποτε πληροφορία θεωρείται παρωχημένη και δεν είναι χρήσιμη.…”
unclassified