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.

Energy-Efficient Resource Allocation in D2D Underlaid Cellular Uplinks

Abstract: In this letter, we study the joint channel allocation and power control problem to maximize the energy efficiency (EE) of device-to-device (D2D) links in a D2D underlaid cellular network. Due to the location dispersion of D2D pairs and short-distance D2D transmission, it should be preferred that multiple D2D pairs can simultaneously share the resource with cellular users (CUs). To address the nonconvexity of the EE maximization problem, we divide the original problem into two subproblems and propose an iterative algorithm with low complexity to solve it. Simulation results show that the proposed algorithm converges rapidly and the EE of D2D links can be significantly improved compared with existing methods especially for an increasing number of CUs.

Method and apparatus for common packet channel assignment

Abstract: A method and device for initiating uplink data packet communication from a mobile device to a base station on a common packet channel is initiated when the mobile device reads broadcast status of common packet channels, after which the mobile device sends an access preamble to the base station that is acknowledged by the base station, and then the mobile device sends a collision preamble which the base station answers with a matching collision response. If the base station's response to the collision preamble also includes a channel allocation message, then the base station begins uplink data packet communication on an allocated channel provided that the allocated channel previously had free broadcast status. However, if the base station's response to the collision preamble includes a channel allocation message designating channel(s) not previously having free broadcast status, then the mobile device's access attempt is aborted.

Spectrum and Energy Aware Routing Protocol for Cognitive Radio Ad Hoc Networks

Abstract: Throughput maximization is one of the core challenges in cognitive radio ad hoc networks (CRANs), where local spectrum resources are changing over time and locations. This paper proposes a spectrum and energy aware routing (SER) protocol for CRANs, which involves spectrum aware, and energy-efficient route selection, and channel-timeslot assignment. A good routing protocol should be aware of the interference as well as the end-to-end delay. The proposed joint spectrum and energy aware routing with channel-timeslot assignment can balance the energy consumption, eliminates contention between users, and decompose contending traffics over different channels and timeslots. As a result, the proposed scheme leads to significant increases in network throughput and decreases the end-to-end delay. The simulation results show the effectiveness of our proposed approach with good generalization ability.

Adaptive Resource Allocation for Interference Management in Small Cell Networks

Abstract: We consider a femto cellular network consisting of multiple neighboring femtocells, eg, in an enterprise deployment such as shopping malls, stadiums, or corporate premises We present a practical but suboptimal channel assignment and interference management algorithm for fractional frequency reuse (FFR) wireless networks More specifically, we propose an adaptive graph coloring approach for resource allocation with the goal of interference management among femtocells as well as achieving fairness among users While the global-optimum solution has exponential complexity, our proposed scheme has a linear complexity in the number of femtocells Although suboptimal, we have evaluated our algorithm in small scenarios, where direct evaluation is possible, and found that the achieved minimum user rate using the proposed algorithm is 85% of the optimal minimum rate Additionally, we have analyzed several practical design considerations of our proposal such as channel feedback, latency, and computational complexity We demonstrate the performance of our proposed solution against various alternatives and show that it provides better performance under various environment parameters For example, in a dense femtocell deployment, the performance was improved by 47% over a full frequency reuse scheme

Intermediate-node initiated reservation (IIR): a new signaling scheme for wavelength-routed networks

Abstract: A problem of many distributed lightpath provisioning schemes is wavelength contention, which occurs when a connection request attempts to reserve a wavelength channel that is no longer available. This situation results from the lack of updated global link-state information at every node. In networks with highly dynamic traffic loads, wavelength contention may seriously degrade the network performance. To overcome this problem, we propose a new framework for distributed signaling and introduce a class of schemes referred to as intermediate-node initiated reservation. In the new scheme, reservations may be initiated at any set of nodes along the route; in contrast, reservations can only be initiated by the destination node in the classic destination initiated reservation (DIR) scheme. As a result, the possibility of having outdated information due to propagation delay is significantly lowered. Specifically, we consider two schemes within this framework, for networks with no wavelength conversion and for networks with sparse wavelength conversion, respectively. Theoretical and simulation results show that, compared with the classic DIR scheme, the new schemes can significantly improve the network blocking performance. The accuracy of the analytical models is also confirmed by extensive numerical simulations.