Primary User-aware Network Coding for Multi-hop Cognitive Radio Networks

Network coding has proved its efficiency in increasing the network performance for traditional ad-hoc networks. In this paper, we investigate using network coding for enhancing the throughput of multi-hop cognitive radio networks. We formulate the network coding throughput maximization problem as a graph theory problem, where different constraints and primary users' characteristics are mapped to the graph structure. We then show that the optimal solution to this problem in NP-hard and propose a heuristic algorithm to efficiently solve it. Evaluation of the proposed algorithm through NS2 simulations shows that we can increase the throughput of the constrained secondary users' network by 150\% to 200\% for a wide range of scenarios covering different primary users' densities, traffic loads, and spectrum availability.

[1]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[2]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[3]  Ramachandran Ramjee,et al.  Network Coding-Based Broadcast in Mobile Ad-hoc Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[4]  Junshan Zhang,et al.  Spectrum shaping via network coding in cognitive radio networks , 2011, 2011 Proceedings IEEE INFOCOM.

[5]  Qin Liu,et al.  Network coding based geographical opportunistic routing for ad hoc cognitive radio networks , 2012, 2012 IEEE Globecom Workshops.

[6]  Christina Fragouli,et al.  Network Coding Applications , 2008, Found. Trends Netw..

[7]  Luigi Paura,et al.  CAODV: Routing in mobile ad-hoc cognitive radio networks , 2010, 2010 IFIP Wireless Days.

[8]  Jörg Widmer,et al.  A Network Coding Approach to Energy Efficient Broadcasting: From Theory to Practice , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9]  Muriel Médard,et al.  XORs in the Air: Practical Wireless Network Coding , 2006, IEEE/ACM Transactions on Networking.

[10]  Moustafa Youssef,et al.  Dead zone penetration protocol for cognitive radio networks , 2013, 2013 IEEE 9th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob).

[11]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[12]  Yasir Saleem,et al.  Network Simulator NS-2 , 2015 .

[13]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[14]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[15]  Athanasios V. Vasilakos,et al.  Routing Metrics of Cognitive Radio Networks: A Survey , 2014, IEEE Communications Surveys & Tutorials.

[16]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[17]  Tracey Ho,et al.  Network Coding for Wireless Applications: A Brief Tutorial , 2005 .

[18]  Baochun Li,et al.  Multicast Scheduling with Cooperation and Network Coding in Cognitive Radio Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[19]  Moustafa Youssef,et al.  A new routing metric and protocol for multipath routing in cognitive networks , 2011, 2011 IEEE Wireless Communications and Networking Conference.

[20]  Moustafa Youssef,et al.  Location-aware probabilistic route discovery for cognitive radio networks , 2014, 2014 IEEE Wireless Communications and Networking Conference (WCNC).

[21]  Muriel Médard,et al.  XORs in the air: practical wireless network coding , 2008, TNET.

[22]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..