Efficient Virtual Backbone Construction with Routing Cost Constraint in Wireless Networks Using Directional Antennas
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ding, Ling | - |
dc.contributor.author | Wu, Weili | - |
dc.contributor.author | Willson, James | - |
dc.contributor.author | Du, Hongjie | - |
dc.contributor.author | Lee, Wonjun | - |
dc.date.accessioned | 2021-09-06T18:10:41Z | - |
dc.date.available | 2021-09-06T18:10:41Z | - |
dc.date.created | 2021-06-18 | - |
dc.date.issued | 2012-07 | - |
dc.identifier.issn | 1536-1233 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/108060 | - |
dc.description.abstract | Directional antennas can divide the transmission range into several sectors. Thus, through switching off sectors in unnecessary directions in wireless networks, we can save bandwidth and energy consumption. In this paper, we will study a directional virtual backbone (VB) in the network where directional antennas are used. When constructing a VB, we will take routing and broadcasting into account since they are two common operations in wireless networks. Hence, we will study a VB with guaranteed routing costs, named alpha Minimum rOuting Cost Directional VB (alpha-MOC-DVB). Besides the properties of regular VBs, alpha-MOC-DVB also has a special constraint-for any pair of nodes, there exists at least one path all intermediate directions on which must belong to alpha-MOC-DVB and the number of intermediate directions on the path is smaller than alpha times that on the shortest path. We prove that construction of a minimum alpha-MOC-DVB is an NP-hard problem in a general directed graph. A heuristic algorithm is proposed and theoretical analysis is also discussed in the paper. Extensive simulations demonstrate that our alpha-MOC-DVB is much more efficient in the sense of VB size and routing costs compared to other VBs. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE COMPUTER SOC | - |
dc.subject | CONNECTED DOMINATING SETS | - |
dc.subject | APPROXIMATION | - |
dc.title | Efficient Virtual Backbone Construction with Routing Cost Constraint in Wireless Networks Using Directional Antennas | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Wonjun | - |
dc.identifier.doi | 10.1109/TMC.2011.129 | - |
dc.identifier.scopusid | 2-s2.0-84861441534 | - |
dc.identifier.wosid | 000304148900003 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON MOBILE COMPUTING, v.11, no.7, pp.1102 - 1112 | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON MOBILE COMPUTING | - |
dc.citation.title | IEEE TRANSACTIONS ON MOBILE COMPUTING | - |
dc.citation.volume | 11 | - |
dc.citation.number | 7 | - |
dc.citation.startPage | 1102 | - |
dc.citation.endPage | 1112 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | CONNECTED DOMINATING SETS | - |
dc.subject.keywordPlus | APPROXIMATION | - |
dc.subject.keywordAuthor | Directional antennas | - |
dc.subject.keywordAuthor | connected dominating set | - |
dc.subject.keywordAuthor | routing costs | - |
dc.subject.keywordAuthor | wireless network | - |
dc.subject.keywordAuthor | obstacle | - |
dc.subject.keywordAuthor | general graph | - |
dc.subject.keywordAuthor | NP-hard | - |
dc.subject.keywordAuthor | virtual backbone | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.