Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Three Poweraware Routing Algorithms for Sensor Networks
 

Summary: Three Power­aware Routing Algorithms
for Sensor Networks
Javed Aslam, Qun Li, Daniela Rus
Department of Computer Science
Dartmouth College
Hanover, NH 03755
{jaa, liqun, rus}@cs.dartmouth.edu
July 16, 2002
Abstract
This paper discusses online power­aware routing in large wireless ad­hoc networks (es­
pecially sensor networks) for applications where the message sequence is not known. We
seek to optimize the lifetime of the network. We show that online power­aware routing
does not have a constant competitive ratio to the o#­line optimal algorithm. We develop
an approximation algorithm called max­min zPmin that has a good empirical competitive
ratio. To ensure scalability, we introduce a second online algorithm for power­aware rout­
ing. This hierarchical algorithm is called zone­based routing. Our experiments show that
its performance is quite good. Finally, we describe a distributed version of this algorithm
that does not depend on any centralization.
1 Introduction
The proliferation of low­power analog and digital electronics has created huge opportunities

  

Source: Aslam, Javed - College of Computer Science, Northeastern University

 

Collections: Computer Technologies and Information Sciences