Geographic Segmented Opportunistic Routing in Cognitive Radio Ad Hoc Networks Using Network Coding

IEEE Access

卷:6

Jing Wang¹  Kunxiao Zhou²  Junwei Zhou³  Xing Tang³  Shengwu Xiong³ 

[1] Computer School of Wuhan University, Wuhan, China;

[2] School of Computer Science and Network Security, Dongguan University Technology, Dongguan, China;

[3] School of Computer Science and Technology, Wuhan University of Technology, Wuhan, China;

关键词: Cognitive radio;    ad hoc networks;    routing protocols;    geographic opportunistic routing;   

DOI  :  10.1109/ACCESS.2018.2875566

来源: DOAJ

【 摘 要 】

In cognitive radio ad hoc networks (CRAHNs), the secondary users' links are interrupted by the arrival of primary users, which leads to a significant increase of the number of transmissions per packet. Since network coding and opportunistic routing can reduce the number of transmissions over unreliable wireless links, they are more suitable for CRAHNs. Network coding-based opportunistic routing has been well studied in previous works for traditional ad hoc networks. However, existing approaches have limitations to handle CRAHNs. First, the routing decisions of these methods aim to find one optimal forwarding set for the whole path from the source to the destination. If the channel conditions change dynamically, the pre-selected forwarding set may become unavailable or non-optimal. Second, their coding schemes are not efficient enough to cope with the dynamic spectrum variation in CRAHNs. In this paper, we attempt to overcome these limitations and propose a network-coding-based geographic segmented opportunistic routing scheme for CRAHNs, by fully embracing its characteristics. In our scheme, the whole path from the source to the destination is cut down into several smaller opportunistic route segments, where the packets are transmitted through multiple segments based on a step-by-step forwarding procedure until all the packets are delivered to the destination. Since our scheme utilizes only local spectrum opportunities, topology information, and geometric conditions to compute the forwarding set for each short-term opportunistic route segment, it can better adapt to dynamic spectrum environments and changing network topologies in CRAHNs. Furthermore, we construct a coding graph to show that our coding problem is a reduction from the maximum clique problem, and we propose an efficient network coding strategy to solve it. Simulation results show that our scheme can achieve a considerable performance, compared with the latest opportunistic routing protocols designed for CRAHNs.

【 授权许可】

Unknown