Location-aware Routing for Cognitive Radio NetworksSpeaker: Moustafa A Youssef – New Borg Elarab City, Alexandria, Egypt
Topic(s): Computational Theory, Algorithms and Mathematics
Multi-hop cognitive radio networks (CRNs) are gaining interest recently in many practical applications. With location information becoming more available, designing location-aware routing protocols that fit the nature of CRNs becomes a necessity. In this talk, we explore the use of location information for enhancing the performance of routing protocols in CRNs both for obtaining efficient routes as well as reducing the route maintenance overhead when a primary user becomes active. For the former, we present the LAUNCH protocol that has a set of desirable properties: efficient use of the common control channel, minimal route setup delay, favoring stable routes, handling primary users’ heterogeneity and handling secondary users’ mobility. LAUNCH is based on four main concepts: (1) a novel location-aware CRN routing metric that takes into account the PUs’ activity; (2) distributed calculations at the neighbors; (3) a channel locking mechanism to achieve the route stability and minimize channel switching time; (4) an efficient route maintenance strategy. Evaluation of LAUNCH shows that its performance significantly outperforms the current state-of-the-art CRNs routing protocols in terms of throughput and packet loss rate. In addition, LAUNCH incurs a low control overhead with a fast route establishment delay.
For the latter point, current routing protocols for cognitive radio networks are severely affected by the frequent activity of primary users. Nodes that are in the interference range of an appearing primary user are not allowed to transmit, and therefore existing routes which utilize such nodes are obliged to undergo a route maintenance phase. This naturally provides other routes to the destination that may incur extra delay or increase packet queuing overhead. For this, we propose a novel route maintenance protocol that allows existing routes to endure the event of primary user presence by forming cooperative links between neighboring nodes and nulling out transmission at the primary receiver using cooperative beamforming. Our proposed protocol can be used in conjunction with any of the existing routing protocols, thus achieving modularity. Extensive simulations are done which prove that our proposed protocol outperforms existing route maintenance techniques in terms of end-to-end delay and loss ratio, with minimal incurred overhead.
About this LectureNumber of Slides: 40
Duration: 60 minutes
Languages Available: Arabic, English
Request this Lecture
To request this particular lecture, please complete this online form.
Request a Tour
To request a tour with this speaker, please complete this online form.
All requests will be sent to ACM headquarters for review.