Switching White Papers

Online Power-Aware Routing in Wireless Ad-hoc Networks

Overview This paper discusses online power-aware routing in large wireless ad-hoc networks for applications where the message sequence is not known. The paper seeks to optimize the lifetime of the network. The paper shows that online power-aware routing does not have a constant competitive ratio to the off-line optimal algorithm. This paper develops an approximation algorithm called max-min zPmin that has a good empirical competitive ratio. To ensure scalability, the paper introduces a second online algorithm for power-aware routing. This hierarchical algorithm is called zone-based routing.

Further White Paper Details
PublisherDartmouth College File FormatPDF
Date PublishedAugust 2007
FormatWhite Papers   
Topics

Quick Sitemap Links: