Abstract

The incorporation of cognitive radio (CR) technology in vehicular ad hoc networks (VANETs) has given birth to a new network, namely CR-VANET, which facilitates the vehicular network to achieve communication efficiency in many resource-demanding applications including video and audio streaming, collision warning, gaming, etc. One of the primary challenges in this CR-VANET network is to allocate high-throughput licensed channels to the application requests in face of interference between the primary users (PUs) and the secondary users (SUs) and among the SUs on the channels. In this paper, we address the channel allocation problem in CR-VANET with the objective of system-wide throughput maximization while maintaining the application quality-of-service (QoS) requirements in terms of channel throughput and packet delivery delay for data transmission. We develop conflict graphs of link-band pairs to describe the interference relationship among source-destination vehicle pairs on different channels and determine independent sets of vehicle pairs that can communicate simultaneously to maximize the spatial reuse of the licensed channels. Finally, we formulate a high-throughput channel allocation problem as a mixed-integer linear programming (MILP) problem. Through extensive simulations, we demonstrate that the proposed interference-aware high-throughput channel allocation mechanism (HT-CAM) provides with better network performances compared to state-of-the-art protocols.

Highlights

  • The increasing number of on-road vehicles, their use of smart devices, and significant rise in vehicular applications and services, especially in urban environments, have resulted in an overlay crowded dedicated short-range communication (DSRC) spectrum in the 5.9-GHz band

  • In cognitive radio (CR)-vehicular ad hoc networks (VANETs), each CR-enabled vehicle is equipped with an OBU that has moderate computing and communication capabilities with the entire neighbor vehicles as well as the RSU for Internet accessibility, information sharing, and many other intelligent applications [7]

  • We propose a novel interference-aware high-throughput channel allocation mechanism for CR-VANET, namely HT-CAM, that focuses on interference-free reusability of licensed channels to maximize the network throughput while the user QoS requirements are met in terms of channel bandwidth and data delivery delay

Read more

Summary

Introduction

The increasing number of on-road vehicles, their use of smart devices, and significant rise in vehicular applications and services, especially in urban environments, have resulted in an overlay crowded dedicated short-range communication (DSRC) spectrum in the 5.9-GHz band. Exploiting the statistics of licensed channel availability, a distributed opportunistic spectrum access scheme that is based on a non-cooperative congestion game is proposed These methods focus on allocating optimal channel to a vehicle pair requesting transmission that maximizes the throughput of that particular transmission but fails to maximize the aggregated throughput of the network. We have designed an interference-aware HT-CAM that maximizes overall network throughput by considering spatial reusability of licensed channels For this purpose, HT-CAM determines independent sets of non-interfering OBU pairs by developing conflict graphs. HT-CAM develops a linear programming model to obtain the optimal policy for channel assignment to the OBU pairs with objective of network-wide throughput maximization while QoS constraints (e.g., channel bandwidth, data delivery delay) for data transmissions are met. OBUs need to send their neighborhood information to the RSU periodically

Neighbor discovery
PU traffic pattern prediction
Generation of independent sets
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.