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.

A simple loss differentiation approach to layered multicast

Abstract: Layered multicast is a promising technique for broadcasting adaptive-quality TV video to heterogeneous receivers. While several-layered multicast approaches have been proposed, prior work has identified several problems including significant and persistent instability in video quality, arbitrary unfairness with other sessions, low access link utilization due to conservative bandwidth allocation, and problems with receiver synchronization. In this paper we propose a new layered multicast scheme, where we exploit a simple, coarse-grained, two-tier loss differentiation architecture to achieve stable and fair bandwidth allocation for viewers. Despite the simplicity of our loss differentiation model, we show that it achieves most of the benefits of complex and costly priority dropping schemes. In addition, our protocol is receiver-driven and thus retains the incentives to limit bandwidth usage that are not present in existing priority dropping schemes.

Stable matching for channel access control in cognitive radio systems

Abstract: In this paper we propose a game theoretic approach to the allocation of channels to multiple cognitive users who share a set of frequencies. The famous Gale-Shapley stable matching algorithm is utilized to compute the channel allocations. We analyze the stable matching performance for the case of cognitive resource allocation and prove that in contrast to the general case, in the cognitive resource allocation problem there is a unique stable matching. We then show that the stable matching has performance very close to the optimal centralized allocation. It always achieves at least half of the total rate of the centralized allocation and under Rayleigh fading it achieves about 96% of the total centralized rate. Comparisons to random channel allocations are also discussed.

System and method for dynamic frequency selection in a multihopping wireless network

Abstract: A system and method for dynamic frequency selection at one or more access points (APs) (106). The system and method maintain at the APs (106) a table comprising end-to-end network channel information that is indicative of the degree of channel performance in the network (100). The APs (106) are capable of dynamically selecting frequencies in response to the network channel information in the table.

Market-driven bandwidth allocation in selfish overlay networks

Abstract: Selfish overlay networks consist of autonomous nodes that develop their own strategies by optimizing towards their local objectives and self-interests, rather than following prescribed protocols. It is thus important to regulate the behavior of selfish nodes, so that system-wide properties are optimized. In this paper, we investigate the problem of bandwidth allocation in overlay networks, and propose to use a market-driven approach to regulate the behavior of selfish nodes that either provide or consume services. In such markets, consumers of services select the best service providers, taking into account both the performance and the price of the service. On the other hand, service providers are encouraged to strategically decide their respective prices in a pricing game, in order to maximize their economic revenues and minimize losses in the long run. In order to overcome the limitations of previous models towards similar objectives, we design a decentralized algorithm that uses reinforcement learning to help selfish nodes to incrementally adapt to the local market, and to make optimized strategic decisions based on past experiences. We have simulated our proposed algorithm in randomly generated overlay networks, and have shown that the behavior of selfish nodes converges to their optimal strategies, and resource allocations in the entire overlay are near-optimal, and efficiently adapts to the dynamics of overlay networks.

Fractional frequency reuse in optical wireless cellular networks

Abstract: Interference coordination in optical wireless cellular networks using different frequency reuse techniques are discussed and compared in this paper. On the one hand, full frequency reuse maximises the system throughput at the cost of poor cell-edge user performance. On the other hand, cluster-based static resource partitioning offers good cell-edge user performance at the cost of low system throughput. Fractional frequency reuse (FFR) is introduced as a compromise between cell-edge user performance and the system throughput with low system complexity. Simulation results show that a guaranteed user throughput of 5.6 Mbps and an average area spectral efficiency (ASE) of 0.3389 bps/Hz/m2 are achieved by the FFR optical wireless system with appropriate power control factors. These results show considerable throughput improvement compared to both benchmark systems. It is also shown that by adjusting the LED transmission optical power of a system using visible light spectrum, the illumination requirement for an office room can be satisfied without extra lighting facilities.