RDL logo
About
Aims and ScopeAdvisory Board Members
More
Who We Are?
User Guide
​
​
Sign inGet started
​
​

About
Aims and ScopeAdvisory Board Members
More
Who We Are?
User Guide

Sign inGet started
RDL logo

Verified research datasets. Instant access. Built for collaboration.

Navigation

About

Aims and Scope

Advisory Board Members

More

Who We Are?

Add Raw Data

User Guide

Legal

Privacy Policy

Terms of Service

Support

Got an issue? Email us directly.

Email: info@rawdatalibrary.netOpen Mail App
​
​

© 2025 Raw Data Library. All rights reserved.
PrivacyTerms
  1. Raw Data Library
  2. /
  3. Publications
  4. /
  5. A Channel Selection Mechanism based on Incumbent Appearance Expectation for Cognitive Networks

Verified authors • Institutional access • DOI aware
50,000+ researchers120,000+ datasets90% satisfaction
Article
English
2009

A Channel Selection Mechanism based on Incumbent Appearance Expectation for Cognitive Networks

0 Datasets

0 Files

English
2009
IEEE Wireless Communications and Networking Conference
DOI: 10.1109/wcnc.2009.4917489

Get instant academic access to this publication’s datasets.

Create free accountHow it works

Frequently asked questions

Is access really free for academics and students?

Yes. After verification, you can browse and download datasets at no cost. Some premium assets may require author approval.

How is my data protected?

Files are stored on encrypted storage. Access is restricted to verified users and all downloads are logged.

Can I request additional materials?

Yes, message the author after sign-up to request supplementary files or replication code.

Advance your research today

Join 50,000+ researchers worldwide. Get instant access to peer-reviewed datasets, advanced analytics, and global collaboration tools.

Get free academic accessLearn more
✓ Immediate verification • ✓ Free institutional access • ✓ Global collaboration
Access Research Data

Join our academic network to download verified datasets and collaborate with researchers worldwide.

Get Free Access
Institutional SSO
Secure
This PDF is not available in different languages.
No localized PDFs are currently available.
Matti Latva-aho
Matti Latva-aho

University Of Oulu

Verified
Kaveh Ghaboosi
Allen B. MacKenzie
Luiz A. DaSilva
+2 more

Abstract

In this paper, we investigate stochastic multichannel load balancing in a distributed cognitive network coexisting with primary users. In particular, we propose a probabilistic technique for traffic distribution among a set of data channels by incorporating statistical information of primary users' activities in different channels into the selection process without centralized control. Moreover, the proposed scheme is enabled by a multi-channel binary exponential backoff mechanism to further facilitate contention resolution in a multi-channel environment. It is shown through simulations that the proposed MAC layer enhancement outperforms well-known multi-channel MAC protocols both in terms of aggregate end-to-end throughput and average frame end-to-end delay. Furthermore, its performance is also compared to two heuristic channel selection techniques in a multi-channel cognitive network, coexisting with incumbents.

How to cite this publication

Kaveh Ghaboosi, Allen B. MacKenzie, Luiz A. DaSilva, Abdallah Abdallah, Matti Latva-aho (2009). A Channel Selection Mechanism based on Incumbent Appearance Expectation for Cognitive Networks. IEEE Wireless Communications and Networking Conference, pp. 1-6, DOI: 10.1109/wcnc.2009.4917489.

Related publications

Why join Raw Data Library?

Quality

Datasets shared by verified academics with rich metadata and previews.

Control

Authors choose access levels; downloads are logged for transparency.

Free for Academia

Students and faculty get instant access after verification.

Publication Details

Type

Article

Year

2009

Authors

5

Datasets

0

Total Files

0

Language

English

Journal

IEEE Wireless Communications and Networking Conference

DOI

10.1109/wcnc.2009.4917489

Join Research Community

Access datasets from 50,000+ researchers worldwide with institutional verification.

Get Free Access