Cart (Loading....) | Create Account
Close category search window
 

Computing Capacity and Connectivity in Cognitive Radio Ad-Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

7 Author(s)
Qiang-Sheng Hua ; Inst. for Theor. Comput. Sci., Tsinghua Univ., Beijing, China ; Haisheng Tan ; Yuexuan Wang ; Hongxing Li
more authors

We 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 problem [29] and the connectivity problem [32]. 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.

Published in:

Pervasive Systems, Algorithms and Networks (ISPAN), 2012 12th International Symposium on

Date of Conference:

13-15 Dec. 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.