Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Online Poweraware Routing in Wireless Adhoc Networks Qun Li, Javed Aslam, Daniela Rus
 

Summary: Online Power­aware Routing in Wireless Ad­hoc Networks
Qun Li, Javed Aslam, Daniela Rus
Department of Computer Science
Dartmouth College
Hanover, NH 03755
{liqun, jaa, rus}@cs.dartmouth.edu
ABSTRACT
This paper discusses online power­aware routing in large
wireless ad­hoc 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 ra­
tio. To ensure scalability, we introduce a second online algo­
rithm for power­aware routing. This hierarchical algorithm
is called zone­based routing. Our experiments show that its
performance is quite good.
1. INTRODUCTION
The proliferation of low­power analog and digital electronics

  

Source: Aslam, Javed - College of Computer Science, Northeastern University
Dartmouth College, Transportable Agents for Wireless Networks Group
Li, Qun - Department of Computer Science, College of William and Mary

 

Collections: Computer Technologies and Information Sciences; Engineering