Adaptive Rateless Coding Technique for Data Dissemination in Multichannel Multiuser Cognitive Radio Networks

In this paper, we study rateless coding technique for secondary user communication in a multi-channel multi-user cognitive radio network. Generally, a multi-channel multi-user cognitive radio system is a wireless network comprising several secondary users and one or more primary users. In order to c...

Full description

Saved in:
Bibliographic Details
Published in:Wireless personal communications 2017-09, Vol.96 (2), p.2463-2484
Main Authors: Farrokhi, Hamid, Pourmohammadi, Iman
Format: Article
Language:English
Subjects:
Algorithms
Coding
Cognitive radio
Communications Engineering
Computer Communication Networks
Computer simulation
Engineering
Multichannel communication
Networks
Packet transmission
Performance enhancement
Radio networks
Signal,Image and Speech Processing
Wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we study rateless coding technique for secondary user communication in a multi-channel multi-user cognitive radio network. Generally, a multi-channel multi-user cognitive radio system is a wireless network comprising several secondary users and one or more primary users. In order to combat with interference due to the appearance of either primary users or other secondary users, we assign rateless codes to each secondary user to transmit its input data packets. Rateless codes are a class of channel codes with exceptional performance in both erasure and noisy channels. However, when some input data packets have been reconstructed at the decoder or already known at the receiver, the code efficiency decreases as a result of repeated transmission of the encoded packets. This has led us to propose algorithms based on a novel type of these codes called adaptive rateless codes to improve the performance of secondary users in terms of throughput. Simulation results demonstrate the efficiency of the proposed algorithms on secondary users communication.
ISSN:0929-6212
1572-834X
DOI:10.1007/s11277-017-4307-z