scispace - formally typeset
Search or ask a question
Topic

Channel allocation schemes

About: Channel allocation schemes is a research topic. Over the lifetime, 10656 publications have been published within this topic receiving 182117 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: Recursion formulas for the new call blocking and handoff failure probabilities for Fractional Guard Channel policies in cellular networks are derived and it was found that LFGC outperforms GC and UFGC under any mobility condition.
Abstract: In this letter, recursive formulas for the new call blocking and handoff failure probabilities for Fractional Guard Channel (FGC) policies in cellular networks are derived. The effect of users' mobility on the maximum system capacity achieved with the Guard Channel (GC), the Limited Fractional Guard Channel (LFGC), and the Uniform Fractional Guard Channel (UFGC) strategies is then evaluated. Results show that maximum system capacity decreases exponentially as the mean cell dwell time decreases and that the relative capacity gain of each scheme depends on the mean cell dwell time. It was also found that LFGC outperforms GC and UFGC under any mobility condition.

45 citations

Journal ArticleDOI
TL;DR: This letter proposes an extended model for bandwidth allocation and uses a modified version of a MOP-based bandwidth allocation to provide a possible solution to the mentioned balancing problems.
Abstract: The problem of bandwidth allocation may be simply stated, independently of the target of the allocation: an amount of bandwidth must be shared among different entities. Each entity receives a portion of the overall bandwidth. Bandwidth allocation may be formalized as a Multi-Objective Programming (MOP) problem where the constraint is the maximum available bandwidth. The objectives of the allocation such as loss and power may be modelled through a group of objective functions possibly contrasting with each other. It is quite intuitive that using more bandwidth will reduce losses, but also that transmitted power will increase with the bandwidth. Which is the balance among these needs? This letter proposes an extended model for bandwidth allocation [1] and uses a modified version of a MOP-based bandwidth allocation to provide a possible solution to the mentioned balancing problems.

45 citations

Proceedings ArticleDOI
01 Dec 2010
TL;DR: This work proposes an on-demand multicast routing and channel allocation algorithm that takes channel heterogeneity and switching latency into consideration and aims at reducing the end-to-end delay, and at the same time reducing the degradation of throughput using a dynamic programming approach.
Abstract: Cognitive radio networks (CRN) have emerged as a promising, yet challenging, solution to enhance spectrum utilization, thanks to the technology of cognitive radios. In this work, we consider the multicast routing and channel allocation problem in cognitive radio mesh networks. Due to the potential heterogeneity in channel availability among mesh routers (MRs) and the frequency switching latency, end-to-end delay and throughput degradation could be subject to a significant increase. We propose an on-demand multicast routing and channel allocation algorithm that takes channel heterogeneity and switching latency into consideration. The algorithm aims at reducing the end-to-end delay, and at the same time reducing the degradation of throughput using a dynamic programming approach.

45 citations

Patent
08 Feb 2012
TL;DR: In this paper, the available frequency band for communication is determined and a frequency fc of a carrier is determined based on the available spectrum available for communication, and the carrier fc is used for communicating with one or more communication devices via a second communication channel within the available bandwidth.
Abstract: In a method available frequency band for communication is determined and a frequency fc of a carrier is determined based on the available frequency band. The carrier is set to the frequency fc for communicating with one or more communication devices via a first communication channel within the available frequency band using. After communicating via the first communication channel, the carrier frequency fc is used for communicating with one or more communication devices via a second communication channel within the available bandwidth. A center frequency of the first channel is different than a center frequency of the second channel.

45 citations

Journal ArticleDOI
TL;DR: In this paper, a scenario consisting of multiple WLANs using DCB and operating within carrier-sensing range of one another is considered, and an analytical framework for evaluating the performance of such networks is presented.
Abstract: Dynamic Channel Bonding (DCB) allows for the dynamic selection and use of multiple contiguous basic channels in Wireless Local Area Networks (WLANs). A WLAN operating under DCB can enjoy a larger bandwidth, when available, and therefore achieve a higher throughput. However, the use of larger bandwidths also increases the contention with adjacent WLANs, which can result in longer delays in accessing the channel and consequently, a lower throughput. In this paper, a scenario consisting of multiple WLANs using DCB and operating within carrier-sensing range of one another is considered. An analytical framework for evaluating the performance of such networks is presented. The analysis is carried out using a Markov chain model that characterizes the interactions between adjacent WLANs with overlapping channels. An algorithm is proposed for systematically constructing the Markov chain corresponding to any given scenario. The analytical model is then used to highlight and explain the key properties that differentiate DCB networks of WLANs from those operating on a single shared channel. Furthermore, the analysis is applied to networks of IEEE 802.11ac WLANs operating under DCB–which do not fully comply with some of the simplifying assumptions in our analysis–to show that the analytical model can give accurate results in more realistic scenarios.

45 citations


Network Information
Related Topics (5)
Wireless network
122.5K papers, 2.1M citations
95% related
Wireless ad hoc network
49K papers, 1.1M citations
94% related
Network packet
159.7K papers, 2.2M citations
94% related
Wireless
133.4K papers, 1.9M citations
92% related
Fading
55.4K papers, 1M citations
91% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202315
202259
2021181
2020268
2019293
2018292