Detailed Information

Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads

Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks

Authors
Ding, LingWu, WeiliWillson, JamesDu, HongjieLee, WonjunDu, Ding-Zhu
Issue Date
10월-2011
Publisher
IEEE COMPUTER SOC
Keywords
Connected dominating set; routing path; wireless network; obstacle; general graph; NP-hard; topology control
Citation
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, v.22, no.10, pp.1601 - 1609
Indexed
SCIE
SCOPUS
Journal Title
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
Volume
22
Number
10
Start Page
1601
End Page
1609
URI
https://scholar.korea.ac.kr/handle/2021.sw.korea/111527
DOI
10.1109/TPDS.2011.30
ISSN
1045-9219
Abstract
Topology control is one vital factor to a wireless network's efficiency. A Connected Dominating Set (CDS) can be a useful basis of a backbone topology construction. In this paper, a special CDS, named alpha Minimum rOuting Cost CDS (alpha-MOC-CDS), will be studied to improve the performance of CDS based broadcasting and routing. In this paper, we prove that construction of a minimum alpha MOC-CDS is NP-hard in a general graph and we propose a heuristic algorithm for construction of alpha-MOC-CDS.
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

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher Lee, Won jun photo

Lee, Won jun
정보보호학과
Read more

Altmetrics

Total Views & Downloads

BROWSE