DMCA
Rate Allocation in Wireless Sensor Networks with Network Lifetime Requirement (2004)
| Citations: | 47 - 5 self |
BibTeX
@MISC{Hou04rateallocation,
author = {Y. Thomas Hou and Shi and Hanif D. Sherali},
title = {Rate Allocation in Wireless Sensor Networks with Network Lifetime Requirement },
year = {2004}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Since the objective of maximizing the sum of rates of all the nodes in the network can lead to a severe bias in rate allocation among the nodes, we advocate the use of lexicographical max-min (LMM) rate allocation for the nodes. To calculate the LMM rate allocation vector, we develop a polynomial-time algorithm by exploiting the parametric analysis (PA) technique from linear programming (LP), which we call serial LP with Parametric Analysis (SLP-PA). We show that the SLP-PA can be also employed to address the so-called LMM node lifetime problem much more efficiently than an existing technique proposed in the literature. More important, we show that there exists an elegant duality relationship between the LMM rate allocation problem and the LMM node lifetime problem. Therefore, it is sufficient to solve any one of the two problems and important insights can be obtained by inferring duality results for the other problem.
Keyphrases
rate allocation wireless sensor network network lifetime requirement parametric analysis serial lp linear programming lmm node lifetime problem lmm rate allocation problem lmm rate allocation vector polynomial-time algorithm important insight important performance consideration duality result severe bias so-called lmm node lifetime problem lexicographical max-min network lifetime elegant duality relationship
