Practical cross‐layer routing and channel assignment in cognitive radio ad hoc networks. Issue 10 (19th September 2013)

• Record Type: Journal Article
• Authors: Yao, Fuqiang; Zhang, Jianzhao; Zhao, Hangsheng; Liu, Yongxiang
• Is Part Of: Wireless communications and mobile computing. Volume 15:Issue 10(2015)
• Page Start: 1444
• Page End: 1455
• Publication Date: 2013-09-19
• Subjects: Wireless communication systems -- Periodicals; Mobile communication systems -- Periodicals; 621.38205
• DOI: 10.1002/wcm.2440
• Languages: English
• ISSNs: 1530-8669

Abstract

<abstract abstract-type="main" id="wcm2440-abs-0001"> <title>Abstract</title> <p id="wcm2440-para-0005">In the heterogeneous and unreliable channel environment of cognitive radio ad hoc networks (CRAHNs), a multipath route with channel assigned is preferable in both throughput and reliability. The cross‐layer multipath routing and channel assignment in CRAHNs is becoming a challenging issue. In this paper, this problem is characterized, formulated, and shown to be in the form of mixed integer programming. For this Non‐deterministic Polynomial‐time (NP)‐hard problem, the deficiency of the widely used linearization and sequential fixing algorithm is first analyzed. The main contribution of this paper is the development of a new backtracking algorithm with feasibility checking to search optimal solutions and a heuristic algorithm with high feasible solution‐obtained probability (HHFOP) for distributed application in CRAHNs. Through feasibility checking and solution bounds validating, backtracking algorithm with feasibility checking cuts off unnecessary searching space in early stage without loss of optimal solutions, making it much more efficient than brute searching. For practical application in CRAHNs with polynomial complexity, HHFOP first computes the maximal‐supported throughput through link‐channel assignment and link‐capacity coordination for each candidate path. Then the paths are combined, and the route throughput is optimized. Extensive simulation results demonstrate that HHFOP can achieve a high feasible solution‐obtained probability with little throughput degradation compared with linearization and sequential fixing algorithm, indicating its practicability for distributed applications in CRAHNs. Copyright © 2013 John Wiley & Sons, Ltd.</p> </abstract>