Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks
- Title
- Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks
- Author
- 오희국
- Keywords
- Approximation algorithm; Graph theory; Wireless network clustering; Underwater sensor networks
- Issue Date
- 2010-08
- Publisher
- SPRINGER HEIDELBERG
- Citation
- OPTIMIZATION LETTERS, v. 4, NO. 3, Page. 383-392
- Abstract
- In this paper, we introduce a new clustering problem in underwater sensor networks, namely minimum average routing path clustering problem (MARPCP). To deal with the high complexity of MARPCP, we relax it to a special case of minimum weight dominating set problem (MWDSP). We show an existing algorithm for MWDSP can produce an approximate solution for MARPCP. Also, we design a constant factor approximation algorithm for MARPCP, which is much faster than the first method.
- URI
- https://link.springer.com/article/10.1007/s11590-009-0168-zhttps://repository.hanyang.ac.kr/handle/20.500.11754/185849
- ISSN
- 1862-4472;1862-4480
- DOI
- 10.1007/s11590-009-0168-z
- Appears in Collections:
- ETC[S] > ETC
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML