File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Computing capacity and connectivity in cognitive radio ad-hoc networks

TitleComputing capacity and connectivity in cognitive radio ad-hoc networks
Authors
KeywordsCognitive radio Ad-Hoc networks
Cognitive radio network
Computing capacity
Multiple radios
Connectivity problems
Issue Date2012
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000536
Citation
The 12th International Symposium on Pervasive Systems, Algorithms, and Networks (I-SPAN 2012), San Marcos, TX., 13-15 December 2012. In International Symposium on Parallel Architectures, Algorithms, and Networks, 2012, p. 9-16 How to Cite?
AbstractWe present some unique challenges in cognitive radio ad-hoc networks (CRAHNs) that are not present in conventional single-channel or multi-channel wireless ad-hoc networks. We first briefly survey these challenges and their potential impact on the design of efficient algorithms for several fundamental problems in CRAHNs. Then, we describe our recent contributions to the capacity maximization problemcite{capacity-mass} and the connectivity problemcite{connectivity-algosensors}. The capacity maximization problem is to maximize the overall throughput utility among multiple unicast sessions, the connectivity problem is to find a connected subgraph from the given cognitive radio network where each secondary node is equipped with multiple radios. By assuming the physical interference model and asynchronous communications, we reformulate the above two problems where the capacity maximization problem is to find the maximum number of simultaneously transmitting links in secondary networks, and the connectivity problem is to construct a spanning tree over secondary networks using the fewest timeslots. We discuss the challenging issues for designing distributed approximation algorithms and give a preliminary framework for solving these two problems. © 2012 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/186477
ISBN
ISSN
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorHua, Qen_US
dc.contributor.authorTan, Hen_US
dc.contributor.authorWang, Yen_US
dc.contributor.authorLi, Hen_US
dc.contributor.authorYu, Den_US
dc.contributor.authorLau, FCMen_US
dc.contributor.authorWu, Cen_US
dc.date.accessioned2013-08-20T12:11:08Z-
dc.date.available2013-08-20T12:11:08Z-
dc.date.issued2012en_US
dc.identifier.citationThe 12th International Symposium on Pervasive Systems, Algorithms, and Networks (I-SPAN 2012), San Marcos, TX., 13-15 December 2012. In International Symposium on Parallel Architectures, Algorithms, and Networks, 2012, p. 9-16en_US
dc.identifier.isbn978-076954930-9-
dc.identifier.issn1087-4089-
dc.identifier.urihttp://hdl.handle.net/10722/186477-
dc.description.abstractWe present some unique challenges in cognitive radio ad-hoc networks (CRAHNs) that are not present in conventional single-channel or multi-channel wireless ad-hoc networks. We first briefly survey these challenges and their potential impact on the design of efficient algorithms for several fundamental problems in CRAHNs. Then, we describe our recent contributions to the capacity maximization problemcite{capacity-mass} and the connectivity problemcite{connectivity-algosensors}. The capacity maximization problem is to maximize the overall throughput utility among multiple unicast sessions, the connectivity problem is to find a connected subgraph from the given cognitive radio network where each secondary node is equipped with multiple radios. By assuming the physical interference model and asynchronous communications, we reformulate the above two problems where the capacity maximization problem is to find the maximum number of simultaneously transmitting links in secondary networks, and the connectivity problem is to construct a spanning tree over secondary networks using the fewest timeslots. We discuss the challenging issues for designing distributed approximation algorithms and give a preliminary framework for solving these two problems. © 2012 IEEE.-
dc.languageengen_US
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000536-
dc.relation.ispartofInternational Symposium on Parallel Architectures, Algorithms, and Networksen_US
dc.rightsInternational Symposium on Parallel Architectures, Algorithms, and Networks. Copyright © IEEE.-
dc.rights©2012 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectCognitive radio Ad-Hoc networks-
dc.subjectCognitive radio network-
dc.subjectComputing capacity-
dc.subjectMultiple radios-
dc.subjectConnectivity problems-
dc.titleComputing capacity and connectivity in cognitive radio ad-hoc networksen_US
dc.typeConference_Paperen_US
dc.identifier.emailLau, FCM: fcmlau@cs.hku.hken_US
dc.identifier.emailWu, C: cwu@cs.hku.hken_US
dc.identifier.authorityLau, FCM=rp00221en_US
dc.identifier.authorityWu, C=rp01397en_US
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/I-SPAN.2012.8-
dc.identifier.scopuseid_2-s2.0-84874619929-
dc.identifier.hkuros217641en_US
dc.identifier.spage9-
dc.identifier.epage16-
dc.identifier.isiWOS:000324246800002-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 131009-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats