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.

LACAV: an energy-efficient channel assignment mechanism for vehicular ad hoc networks

Abstract: Designing an efficient channel assignment system for Vehicular Ad hoc Networks (VANETs), which conserves energy, is a challenging task, primarily because of the high degrees of mobility of nodes in these networks. As the high mobility of nodes in vehicular networks leads to frequent handoffs, channel assignment in VANETs becomes a tedious task. In this paper, we propose a channel assignment mechanism using the concepts of learning automata (LA) and reusability. LA is used to optimize the performance of the proposed system by selecting suitable number of reserved channels for the handoff calls and reusability allows the channel to be reused by the different base stations (BSs) based on the reuse distance. The proposed system is designed to reduce the dropping probability. The proposed system is suitable for network architectures in which it is possible to arrange the BSs with different groups of channels sequentially in a particular order that helps in conserving energy. Our experiments clearly indicate that the system reduces the dropping probability and allows a continuous communication throughout the duration of the call. The performance of proposed algorithm is compared with the Vehicular Fast Handover Scheme (VFHS), and the Cooperative scheme for service channel reservation (CRaSCH) scheme in terms of handoff latency, and it is shown that the proposed algorithm performs better than VFHS and CRaSCH.

An adaptive approach to weighted fair queue with QoS enhanced on IP network

Abstract: We propose an adaptive bandwidth allocation algorithm for reservation protocols to support quality-of-service networking on the future multimedia Internet. QoS design is the fundamental functionality of the next generation IP router to enable differentiated delivery and to guarantee the delivery quality for diverse service traffic. The proposed algorithm called adaptive weighted fair queue (AWFQ) scheduling employs the queue status and priority assignment to determine the bandwidth sharing of various Internet services and to ensure the defined QoS policy is obtained. We propose a smart methodology of distributing the outlink bandwidth in a flexible, fair and prioritized manner to utilize network bandwidth more effectively and efficiently. In simulation, we compare the proposed AWFQ algorithm with priority queue (PQ) and weighted fair queue (WFQ) that are two famous scheduling algorithms in practice. In comparison, we examine their performances in terms of packet loss, bandwidth utilization and queue dynamics to verify our algorithm. We find that the proposed algorithm has the following advantages: 1) improves the bandwidth starvation of low-priority traffic occurring in PQ, 2) has a high bandwidth utilization close to PQ, 3) has a low queue congestion and 4) maintains the fairness of WFQ. Overall, the proposed algorithm not only has an excellent performance close to PQ but also improve the disadvantage of PQ.

An Iterative Matching-Stackelberg Game Model for Channel-Power Allocation in D2D Underlaid Cellular Networks

Abstract: In device-to-device (D2D) underlaid cellular networks, several D2D pairs can share one channel to improve the system throughput. Most existing works allow D2D pairs to reuse all the channels, which may incur complicated interference management. Therefore, each D2D pair is limited to reuse at most one channel to reduce overhead. We aim to maximize the throughput of D2D pairs while suppressing the interference to cellular links. However, the optimization problem is an intractable mixed integer non-linear programming (MINLP) problem. Meanwhile, as network size increases, acquiring the global channel state information (CSI) is expensive even impossible in practice. Therefore, we propose a novel local CSI-based distributed channel-power allocation scheme. The base station (BS) broadcasts a control signal to indicate its received interference from D2D pairs. Upon this signal, each D2D pair executes channel selection and power update independently and iteratively. Specifically, the channel allocation problem is formulated as a many-to-one matching game with externalities. The power control problem is modeled as a Stackelberg game. We prove the existence of two-sided swap-stable matching and show that the outcomes of the Stackelberg game are locally optimal under some mild conditions. Simulation results show that our scheme is efficient with low overhead.

Dynamic QoS-Based Bandwidth Allocation Framework for Broadband Wireless Networks

Abstract: Broadband wireless communication systems, namely, Worldwide Interoperability for Microwave Access (WiMAX) and Long-Term Evolution (LTE), promise to revolutionize the mobile users wireless experience by offering many of the services and features promised by fourth-generation (4G) wireless systems, such as supporting multimedia services with high data rates and wide coverage area, as well as all-Internet Protocol (IP) with security and quality-of-service (QoS) support. These systems, however, require proficient radio resource management (RRM) schemes to provide the aforementioned features they promise. In this paper, we propose a new framework, which is called dynamic QoS-based bandwidth allocation (DQBA), to support heterogeneous traffic with different QoS requirements in WiMAX networks. The DQBA framework operates as such; it dynamically changes the bandwidth allocation (BA) for ongoing and new arrival connections based on traffic characteristics and service demand. The DQBA aims at maximizing the system capacity by efficiently utilizing its resources and by being fair, practical, and in compliance with the IEEE 802.16 standard specifications. To achieve its objectives, DQBA employs a flexible architecture that combines the following related components: 1) a two-level packet scheduler scheme; 2) an efficient call admission control policy; and 3) a dynamic BA mechanism. Simulation results and comparisons with existing schemes show the effectiveness and strengths of the DQBA framework in delivering promising QoS and being fair to all classes of services in a WiMAX network.

Power-Efficient Resource Allocation for Time-Division Multiple Access Over Fading Channels

Abstract: We investigate resource allocation policies for time-division multiple access (TDMA) over fading channels in the power-limited regime. For frequency-flat block-fading channels and transmitters having full channel state information (CSI), we first minimize power under a weighted sum average rate constraint and show that the optimal rate and time allocation policies can be obtained by a greedy water-filling approach with linear complexity in the number of users. Subsequently, we pursue power minimization under individual average rate constraints and establish that the optimal resource allocation also amounts to a greedy water-filling solution. Our approaches not only provide fundamental power limits when each user can support an infinite-size capacity-achieving codebook (continuous rates), but also yield guidelines for practical designs where users can only support a finite set of adaptive modulation and coding modes (discrete rates).