Throughput-efficient channel allocation in multi-channel cognitive vehicular networks

Han, You; Ekici, Eylem; Kremo, Haris; Altintas, Onur

doi:10.1109/infocom.2014.6848221

Cited by 12 publications

(11 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In coordinated methods, either global spectrum usage information is collected by the centralized entity, or local spectrum usage information is exchanged among coexisting RF systems. Given this information, spectrum sharing problems can be formulated as mathematical resource management problems, which guarantees that the resulting spectrum sharing methods are optimal with respect to certain system QoS goals (e.g., achieving maximal total throughput [54] and or minimal average delay [55]). After discussing the classification of coordinated methods, we will also discuss two common mathematical tools used in these methods: optimization theory and game theory.…”

Section: Overview Of Spectrum Sharing Methodsmentioning

confidence: 99%

“…Constraints of the spectrum sharing problems include QoS requirements of specific networks or applications, fairness among coexisting RF systems, energy consumption limits and other physical constraints like transmission range and minimum SINR requirements. Since the formulation of optimization problems requires various information of coexisting RF systems (e.g., locations of devices, PHY/MAC parameters, traffic loads and external sources of interference etc), they are more often used in centralized coordination methods (e.g., [54][39]). Optimization theory has been widely used to solve these spectrum sharing problems in the literature [15][40] [84].Optimization theory has ample branches, and the following branches are often applied in spectrum sharing problems: convex optimization [ [120]- [122] Femtocell & Femtocell [123]- [125] [126]- [128] • Game Theory: Game theoretical models have also been widely used to deal with spectrum sharing among RF systems (e.g., in [96]- [98]).…”

Section: B Mathematical Tools Used In Spectrum Sharing Methodsmentioning

confidence: 99%

See 1 more Smart Citation

Spectrum sharing methods for the coexistence of multiple RF systems: A survey

et al. 2016

Self Cite

View full text Add to dashboard Cite

Section: Overview Of Spectrum Sharing Methodsmentioning

confidence: 99%

Section: B Mathematical Tools Used In Spectrum Sharing Methodsmentioning

confidence: 99%

Spectrum sharing methods for the coexistence of multiple RF systems: A survey

et al. 2016

Self Cite

View full text Add to dashboard Cite

“…However, they did not propose any solution to reduce the effect of transmission delay on network performance. Some channel assignment protocols have been proposed to minimize the total expected delay [17] or maximize network-wide throughput [18], but the performance may frequently change due to primary user appearance. To address this problem, some other protocols [19], [20] have been proposed to find the path that is least affected by primary users.…”

Section: Related Workmentioning

confidence: 99%

Delay-Constrained Caching in Cognitive Radio Networks

Zhao

Gao

2016

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

In cognitive radio networks, unlicensed users can use under-utilized licensed spectrum to achieve substantial performance improvement. To avoid interference with licensed users, unlicensed users must vacate the spectrum when it is accessed by licensed (primary) users. Since it takes some time for unlicensed users to switch to other available channels, the ongoing data transmissions may have to be interrupted and the transmission delay can be significantly increased. This makes it hard for cognitive radio networks to meet the delay constraints of many applications. In this paper, we develop caching techniques to address this problem. We formulate the cache placement problem in cognitive radio networks as an optimization problem, where the goal is to minimize the total cost, subject to some delay constraint, i.e., the data access delay can be statistically bounded. To solve this problem, we propose a costbased approach to minimize the caching cost, and design a delay-based approach to satisfy the delay constraint. Then, we combine them and propose a distributed hybrid approach to minimize the caching cost subject to the delay constraint. Simulation results show that our approaches outperform existing caching solutions in terms of total cost and delay constraint, and the hybrid approach performs the best among the approaches satisfying the delay constraint.Index Terms-Cognitive radio networks, data access, cache placement, delay constraint ! 1536-1233 (c)

show abstract

“…Although the opportunistic channel access mechanisms for CR networks [11][12][13] and VANETs [14][15][16][17] have been extensively studied in separate, the research in the context of CR-VANET is still at a preliminary stage. The opportunistic channel allocation mechanism in CR-VANET has been investigated in a few number of existing works in the literature [18][19][20][21]. A cluster-based optimal channel access framework is proposed in [18], with an objective of maximizing the utility of data transmission by vehicles in a cluster under QoS constraints and collision probability with licensed users.…”

Section: Introductionmentioning

confidence: 99%

“…Authors in [20] propose a throughput-efficient channel allocation framework for multi-channel cognitive vehicular networks with the objective of system-wide throughput maximization. A centralized two-step scheme for the spectrum resource allocation is developed in [21] to improve system efficiency and fairness.…”

Section: Introductionmentioning

confidence: 99%

Interference-aware high-throughput channel allocation mechanism for CR-VANETs

Tabassum

Razzaque

Hassan

et al. 2016

J Wireless Com Network

View full text Add to dashboard Cite

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.

show abstract

Throughput-efficient channel allocation in multi-channel cognitive vehicular networks

Cited by 12 publications

References 16 publications

Spectrum sharing methods for the coexistence of multiple RF systems: A survey

Spectrum sharing methods for the coexistence of multiple RF systems: A survey

Delay-Constrained Caching in Cognitive Radio Networks

Interference-aware high-throughput channel allocation mechanism for CR-VANETs

Contact Info

Product

Resources

About