Polynomial time approximation scheme for t-latency bounded information propagation problem in wireless networks
- Authors
- Zhang, Wei; Zhang, Zhao; Wang, Wei; Zou, Feng; Lee, Wonjun
- Issue Date
- 5월-2012
- Publisher
- SPRINGER
- Keywords
- Wireless network; Information propagation; Unit disk graph; Polynomial time approximation scheme
- Citation
- JOURNAL OF COMBINATORIAL OPTIMIZATION, v.23, no.4, pp.451 - 461
- Indexed
- SCIE
SCOPUS
- Journal Title
- JOURNAL OF COMBINATORIAL OPTIMIZATION
- Volume
- 23
- Number
- 4
- Start Page
- 451
- End Page
- 461
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/108537
- DOI
- 10.1007/s10878-010-9359-x
- ISSN
- 1382-6905
- Abstract
- Latency of information propagating in wireless network is gaining more and more attention recently. This paper studies the problem of t-Latency Bounded Information Propagation (t-LBIP) problem in wireless networks which are represented by unit-disk graphs. So far, no guaranteed approximation algorithm has been achieved for t-LBIP when ta parts per thousand yen2. In this paper, we propose a Polynomial Time Approximation Scheme for t-LBIP under the condition that the maximum degree is bounded by a constant.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - School of Cyber Security > Department of Information Security > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.