Download Now Free registration required
The notion of probabilistic network has been used to characterize the unpredictable environment in wireless communication networks or other unstable networks. In this paper, the authors are interested in the problem of placing servers in probabilistic networks subject to budget constraint, so as to maximize the expected number of servable clients that can successfully connect to a server. They study this problem in both the single-hop model and the multi-hop model. The authors discuss the computational complexity of this problem and show that it is NP-hard under both models.
- Format: PDF
- Size: 796.7 KB