Abstract
AbstractIn this paper, we develop a delay‐centric parallel multi‐path routing protocol for multi‐hop cognitive radio ad hoc networks. First, we analyze the end‐to‐end delay of multi‐path routing based on queueing theory and present a new dynamic traffic assignment scheme for multi‐path routing with the objective of minimizing end‐to‐end delay, considering both spectrum availability and link data rate. The problem is formulated as a convex problem and solved by a gradient‐based search method to obtain optimal traffic assignments. Furthermore, a heuristic decentralized traffic assignment scheme for multi‐path routing is presented. Then, based on the delay analysis and the 3D conflict graph that captures spectrum opportunity and interference among paths, we present a route discovery and selection scheme. Via extensive NS2‐based simulation, we show that the proposed protocol outperforms the benchmark protocols significantly and achieves the shortest end‐to‐end delay. Copyright © 2015 John Wiley & Sons, Ltd.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.