Network coding based geographical opportunistic routing for ad hoc cognitive radio networks

In this paper, we discuss a geographical opportunistic routing scheme combined with network coding for ad hoc cognitive radio (CR) networks. Given a set of CR nodes with geographical locations and their available channels, our task is to design a coding-based routing protocol, such that the average number of transmissions per packet is minimized. We propose a geographical opportunistic routing protocol where packets are transmitted through a number of temporary destination nodes hop by hop, until they eventually reach destination. In addition, an efficient heuristic coding algorithm is proposed to further improve the performance. Simulation results demonstrate that our protocol can achieve much better performance in terms of lower number of transmissions compared to DSR protocol.