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: It is shown that channel segregation can resolve the problem of unaccessible channel with a small modification of its algorithm and its applications to the TDMA/FDMA or multicarrier TDMA system is discussed.
Abstract: Channel segregation was previously proposed as a self-organized dynamic channel assignment. Its performance was examined by applying it to frequency-division multiple access systems. Its applications to the TDMA/FDMA (time-division multiple access/frequency-division multiple access) or multicarrier TDMA system is discussed. The spectrum efficiency of the TDMA/FDMA cellular system deteriorates due to the problem of unaccessible channel: a call can be blocked in a cell even when there are idle channels because of the restriction on simultaneous use of different carrier frequencies in the cell. It is shown that channel segregation can resolve this problem with a small modification of its algorithm. The performance of the TDMA/FDMA system with channel segregation on the call blocking probability versus traffic density is analyzed with computer simulation experiments. The effect of losing the TDMA frame synchronization between cells on the performance is also discussed. >

115 citations

Journal ArticleDOI
TL;DR: It is suggested that opportunistic spectrum sharing can significantly improve spectrum efficiency and system capacity, even under unreliable spectrum detection.
Abstract: We analyze the performance of a wireless system consisting of a set of secondary users opportunistically sharing bandwidth with a set of primary users over a coverage area. The secondary users employ spectrum sensing to detect channels that are unused by the primary users and hence make use of the idle channels. If an active secondary user detects the presence of a primary user on a given channel, it releases the channel and switches to another idle channel, if one is available. In the event that no channel is available, the call waits in a buffer until either a channel becomes available or a maximum waiting time is reached. Spectrum sensing errors on the part of a secondary user cause false alarm and mis-detection events, which can potentially degrade the quality-of-service experienced by primary users. We derive system performance metrics of interest such as blocking probabilities. Our results suggest that opportunistic spectrum sharing can significantly improve spectrum efficiency and system capacity, even under unreliable spectrum detection. The proposed model and analysis method can be used to evaluate the performance of future opportunistic spectrum sharing systems.

115 citations

Journal ArticleDOI
TL;DR: A two-way relay channel (TWRC) in which two terminals T 1 and T 2 exchange orthogonal frequency division multiplexing (OFDM) signals with the help of an amplify-and-forward (AF) relay T 3 is considered here, and an efficient technique for allocating powers to N parallel tones of OFDM is developed.
Abstract: A two-way relay channel (TWRC) in which two terminals T 1 and T 2 exchange orthogonal frequency division multiplexing (OFDM) signals with the help of an amplify-and-forward (AF) relay T 3 is considered here, and an efficient technique for allocating powers to N parallel tones of OFDM is developed. A sum rate maximization problem is formulated by replacing the individual power constraints of the conventional sum rate maximization problem, which limit the power of each terminal, with the total power constraint limiting the sum of powers of all terminals. The maximization problem with the total power constraint yields a more efficient power allocation policy than the conventional problem with individual power constraints. It is shown that the closed-form solution of the maximization problem under the total power constraint can be obtained for a single-tone system (N=1). Based on this result, a two-step suboptimal approach is proposed in which the power is optimally assigned to each tone first, and then at each tone the assigned power is distributed to the three terminals. The proposed method is shown to assign 50% of the total power to relay T 3 irrespective of the channels. It is demonstrated that the proposed method is considerably simpler to implement than the conventional dual-decomposition method (DDM), yet the performance of the former is almost identical to that of the latter.

115 citations

Journal ArticleDOI
TL;DR: A dynamic channel reservation scheme to improve the utilization of wireless network resources while guaranteeing the required QoS of handoff calls and keep the new call blocking probability as low as possible.
Abstract: We present a dynamic channel reservation scheme to improve the utilization of wireless network resources while guaranteeing the required QoS of handoff calls. The wireless channels are dynamically reserved by using the request probability determined by the mobility characteristics and channel occupancy to guarantee acceptable quality of handoff calls and keep the new call blocking probability as low as possible.

115 citations

Journal ArticleDOI
TL;DR: A novel underlaying resource-sharing communication mode for vehicular networks is proposed, in which different V2V and V2I communication links are permitted to access the same resources for their individual data transmission.
Abstract: This paper investigates the resource-sharing problem in vehicular networks, including both vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication links. A novel underlaying resource-sharing communication mode for vehicular networks is proposed, in which different V2V and V2I communication links are permitted to access the same resources for their individual data transmission. To solve the resource-sharing problem in vehicular networks, we, for the first time, apply graph theory and propose the following two interference graph-based resource-sharing schemes: 1) the interference-aware graph-based resource-sharing scheme and 2) the interference-classified graph-based resource-sharing scheme. Compared with the traditional orthogonal communication mode in vehicular networks, the proposed two resource-sharing schemes express better network sum rate. The utility of the proposed V2V and V2I underlaying communication mode and the two proposed interference graph-based resource-sharing schemes are verified by simulations.

115 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