2014/08/09 by Arsany Guirguis, Guirguis, Arsany, R.M. Guirguis +4 · 1 citation
Computer Science · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Wireless Networks and Protocols #cs.NI
paper · pdf · doi:10.48550/arxiv.1408.2078
Accepted for publication in the IEEE Globecom 2014
arxiv created 2014/08/09 · openalex publication_date 2014/08/09 · arxiv updated 2014/08/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.