DMCA
On the Complexity of Power-Constrained Multiple Routing in Static Ad Hoc Networks*
BibTeX
@MISC{Sheu_onthe,
author = {Pi-rong Sheu and Yu-ting Li},
title = {On the Complexity of Power-Constrained Multiple Routing in Static Ad Hoc Networks*},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Since nowadays the operations of most hosts in ad hoc networks mainly rely on battery power, power consumption becomes an important issue. To extend the network lifetime, many power-aware routing protocols have been designed to evenly distribute packet-relaying loads among nodes to prevent the overuse and abuse of battery power of any node. In this paper, we will consider the problem of searching for multiple paths between multiple pairs of sources and destinations in a static ad hoc network such that the maximum power consumption of node is minimized. We will prove that the problem is NP-hard.
