摘要 : In this paper, we consider the following problem in the wireless ad hoc network: Given a set of paths between source and destination, how to divide the data flow among the paths and how to control the transmission rates, times, an... 展开 In this paper, we consider the following problem in the wireless ad hoc network: Given a set of paths between source and destination, how to divide the data flow among the paths and how to control the transmission rates, times, and powers of the individual links in order to maximize the operation time of the worst network node. If all nodes are of equal importance, the operation time of the worst node is also the lifetime of the network. By solving the problem, our aim is to investigate how the network lifetime is affected by link conditions such as the maximum transmission power of a node and the peak data rate of a link. For the purpose, we start from a system model that incorporates the carrier to interference ratio (CIR) into a variable data rate of a link. With this, we can develop an iterative algorithm for the lifetime maximization, which resembles to the distributed power control in cellular systems. Numerical examples on the iterative algorithm are included to illustrate the network lifetime as a function of the maximum transmission power and the peak data rate. 收起