energy-aware routing algorithms in ad hoc networks

A CS395T Course Project Mobile Computing & Wireless Networks Spring 2001 C o u r s e w e b s i t e : h t t p : / / w w w . c s . u t e x a s . e d u / u s e r s / y g z / 3 9 5 T • I n s t r u c t o r : D r . Y o n g g u a n g Z h a n g ( y g z @ c s . u t e x a s . e d u ) Simulation Setup Single source-destination pair without node mobility Single source-destination pair with node mobility Multiple source-destination pairs without node mobility Multiple source-destination pairs with node mobility Introduction of energy balance factor which represents the heterogeneity of initial energy level at each node Routing Algorithms Maxmin routing algorithm – choose the path whose minimum energy level node has the maximum value among all paths. Maxmax routing algorithm – choose the path which has maximal residual energy on the path Maxavg routing algorithm – choose the path which has maximal average energy level Shortest path routing algorithm – no energy consideration Energy-aware routing algorithms in Ad Hoc Networks Results/Lesson Learned Overall our Maxmin algorithm performs well. One example of results: Project team: Jangwon Lee & Xiangying Yang URL: http://www.ece.utexas.edu/~yangxy/395T.htm Motivation Mobile nodes are battery-operated and one or several nodes’ energy exhaustion may cause the disruption of the entire network A number of approaches focus on minimizing the total consumed power. Several approaches’ goal was to maximize the life time of the system. However, these are based on static topology and given traffic demands in advance. Our goal is to propose energy-aware routing algorithms in dynamic ad hoc network environments to achieve max. system lifetime. Simulation techniques such as generating topology and random traffic etc. Obtain a research trend of energy- aware design in mobile computing environments

Upload: yeo-clayton

Post on 31-Dec-2015

25 views

Category:

Documents

0 download

Report

Download

Embed Size (px):

DESCRIPTION

Energy-aware routing algorithms in Ad Hoc Networks. Motivation Mobile nodes are battery-operated and one or several nodes’ energy exhaustion may cause the disruption of the entire network A number of approaches focus on minimizing the total consumed power. - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: Energy-aware routing algorithms in Ad Hoc Networks

A CS395T Course Project MobileComputing &

WirelessNetworks

Spring 2001C

ourse

b site

: http://w

.cs.ute

xas.e

/use

rs/ygz/39

• Instructo

r: Dr. Y

uan

g Z

(ygz@

cs.ute

xas.ed

Simulation Setup

Single source-destination pair without node mobility

Single source-destination pair with node mobility Multiple source-destination pairs without node

mobility Multiple source-destination pairs with node

mobility Introduction of energy balance factor which

represents the heterogeneity of initial energy level at each node

Routing Algorithms

Maxmin routing algorithm – choose the path whose minimum energy level node has the maximum value among all paths.

Maxmax routing algorithm – choose the path which has maximal residual energy on the path

Maxavg routing algorithm – choose the path which has maximal average energy level

Shortest path routing algorithm – no energy consideration

Energy-aware routing algorithms in Ad Hoc Networks

Results/Lesson Learned Overall our Maxmin algorithm performs well. One example of results:

Project team: Jangwon Lee & Xiangying YangURL: http://www.ece.utexas.edu/~yangxy/395T.htm

Motivation Mobile nodes are battery-operated and one or

several nodes’ energy exhaustion may cause the disruption of the entire network

A number of approaches focus on minimizing the total consumed power.

Several approaches’ goal was to maximize the life time of the system. However, these are based on static topology and given traffic demands in advance.

Our goal is to propose energy-aware routing algorithms in dynamic ad hoc network environments to achieve max. system lifetime.

Simulation techniques such as generating topology and random traffic etc.

Obtain a research trend of energy-aware design in mobile computing environments

Energy Aware Multipath Routing Scheme in Ad Hoc Network Using Fitness Function

Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks

Energy-aware routing algorithms for wireless ad hoc networks with

Ad Hoc Multicast Routing

QOS–AWARE MESH BASED MULTICAST ROUTING ...QOS–AWARE MESH BASED MULTICAST ROUTING PROTOCOLS IN AD-HOC NETWORKS 2 tion like audio/video conferencing, video lectures. Multicast Routing

Energy Issues and Energy aware Routing in Wireless Ad-hoc - InTech

Power Aware Routing in Ad Hoc Networks

Energy Issues and Energy aware Routing in Wireless Ad-hoc Networks

Trust Based Power Aware Secure Source Routing … fuzzy logic, malicious node, power aware, trust, vulnerabilities . I. I. NTRODUCTION. OBILE ad hoc networks (MANETs) are spontaneously