Abstract
Mobile servers are established to provide services for mobile nodes in an anticipated area. If the distribution of mobile nodes can be foreseen, the location of mobile servers becomes critical to the QoS of wireless systems. Under resource and topology constraints, it is very difficult to figure out a solution, or unable to cover all given mobile nodes within limited number of mobile servers. In this paper, we study the issue of the partial covering problem such that part of mobile nodes to be covered. Several approximation algorithms are proposed to cover the maximum number of elements. For real time systems, such as the battle-field communication system, the proposed algorithms with polynomial-time complexity can be efficiently applied. The algorithm complexity analysis illustrates the improvement made by our algorithms. The experimental results show that the performance of our algorithms is much better than other existing 3-approximation algorithm for the robust k-center problem.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN |
| Pages | 104-109 |
| Number of pages | 6 |
| Publication status | Published - 16 Aug 2004 |
| Event | Proceedings on the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN - Hong Kong, Hong Kong Duration: 10 May 2004 → 12 May 2004 |
Conference
| Conference | Proceedings on the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN |
|---|---|
| Country/Territory | Hong Kong |
| City | Hong Kong |
| Period | 10/05/04 → 12/05/04 |
ASJC Scopus subject areas
- General Computer Science