FREE Registration is required
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.
(Is this item miscategorized? Does it need more tags? Let us know.)
| Format: | Size: | 304 KB | |
| Pages: | 11 |
People who downloaded this item also downloaded
Top results from Mobile - Wireless Communications
White Papers, Webcasts, and Resources
- Live Event - Increasing Energy Efficiency with x86 Servers IBMLooking to save on data center operations? Maximize energy efficiency by consolidating your distributed x86-based computers onto fewer machines.
- SIP Trunking is Key to Accelerating Unified Communications Deployments SprintConsidering unified communications (UC) for your business? Discover the key to simplifying deployment, maximizing value and raising adoption company-wide.
- Windows Phones and Unified Communications MicrosoftGain a more solid understanding of UC, why its essential for your business today, and what makes Windows phones ideal for secure UC environments.
Premier Vendor Content Whitepapers, webcasts & resources from our Power Center Sponsors
Featured Training Courses
-
-
Smart Tech
Expert advice on innovations in healthcare and the green technologies that make it happen.
Find out more
-
Smart Business
Discussion and advice on management issues that revolve around making your world smarter and more useful.
More Smart Advice
-
Smart People
The best and worst moves in the management and strategy trenches.
Learn More




