Indexed by:
期刊论文
First Author:
Chen, Bingcai
Correspondence Author:
Chen, BC (reprint author), Dalian Univ Technol, Fac Elect Informat & Elect Engn, Dalian 116024, Peoples R China.; Chen, BC (reprint author), Xinjiang Normal Univ, Sch Comp Sci & Technol, Urumqi 830054, Peoples R China.
Co-author:
Gao, Zhenguo,Yang, Manrou,Ning, Qian,Yu, Chao,Pan, Weimin,Nian, Mei,Xie, Dongmei
Date of Publication:
2018-01-01
Journal:
IEEE ACCESS
Included Journals:
SCIE、EI
Document Type:
J
Volume:
6
Page Number:
8768-8781
ISSN No.:
2169-3536
Key Words:
Random network coding; cognitive radio ad hoc networks; multicast;
broadcast; link reliability
Abstract:
This paper studies packet multicast technology in cognitive radio ad hoc networks (CRAHNs) by using a random network coding (RNC)-based approach. We first specify the key problem of packet multicast applications in CRAHNs, called multichannel single-hop wireless multicast problem (MCSHWMP), then present the definition of MCSHWMP of its four-element tuple model. Next, we propose a framework for the network coding -based scheme in packet multicast applications of CRAHNs and provide several candidate schemes based on the framework. The proposed schemes have several desirable features: 1) necessary packet transmissions are reduced greatly by exploiting the broadcast nature of wireless transmissions by using RNC; 2) each packet transmission is tried to maximize the packet reception gain of the receivers by considering opportunistic accessibility of wireless channels and heterogeneous packet reception success ratio of different wireless channels; and 3) packet size to be transmitted is effectively shortened by reducing decoding information to be transmitted in the packet. Simulation results show that NC-based schemes decrease packet transmissions significantly comparing with non-NC-based schemes. The advantage of NC-based schemes is more distinctive when packet reception success ratio of wireless links are near but smaller than 1, and in these cases around 50% of packet transmissions could be saved.
Translation or Not:
no
