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 Cooperative Game Framework for Bandwidth Allocation in 4G Heterogeneous Wireless Networks

Abstract: One of the most important features of the evolving fourth generation (4G) wireless networks is the capability of a mobile station to connect to several wireless access networks simultaneously. This introduces new challenges in bandwidth allocation among mobiles since the load characteristics of different networks must be taken into account to design efficient resource allocation algorithms. In this paper, we present bandwidth allocation and admission control algorithms based on bankruptcy game which is a special type of an N-person cooperative game. A coalition among the different wireless access networks is formed to offer bandwidth to a new connection. The stability of the allocation is analyzed by using the concept of the core and the amount of allocated bandwidth to a connection in each network is obtained by using Shapley value. Subsequently, an admission control algorithm is proposed. Numerical results are presented to demonstrate the behaviors of the proposed algorithms.

Joint access point placement and channel assignment for 802.11 wireless LANs

Abstract: To deploy a multi-cell 802.11 wireless local area network (WLAN), access point (AP) placement and channel assignment are two primary design issues. For a given pattern of traffic demands, we aim at maximizing not only the overall system throughput, but also the fairness in resource sharing among mobile terminals. A novel method for estimating the system throughput of multi-cell WLAN is proposed. An important feature of this method is that co-channel overlapping is allowed. Unlike conventional approaches that decouple AP placement and channel assignment into two phases, we propose to jointly solve the two problems for better performance. The optimal solution can be found using exhaustive searching. Due to the high computational complexity involved in exhaustive searching, an efficient local searching algorithm, called patching algorithm, is designed. Numerical results show that for a typical indoor environment, patching algorithm can provide a close-to-optimal performance with much lower time complexity than exhaustive searching

The nonuniform compact pattern allocation algorithm cellular mobile systems

Abstract: An algorithm for allocating nominal channels according to traffic distribution is designed. The algorithm attempts to minimize the average blocking probability as nominal channels are allocated one at a time. Simulation results show that the system's traffic-carrying capacity can be increased by about 10% by the use of this algorithm, and that the gain is additional to the improvement obtained from the channel-borrowing strategies. If the effect of shadow blocking is considered in the assignment of channels, only a very small increase in the traffic capacity is observed. >

Resource Efficiency: A New Paradigm on Energy Efficiency and Spectral Efficiency Tradeoff

Abstract: Spectral efficiency (SE) and energy efficiency (EE) are the main metrics for designing wireless networks. Rather than focusing on either SE or EE separately, recent works have focused on the relationship between EE and SE and provided good insight into the joint EE-SE tradeoff. However, such works have assumed that the bandwidth was fully occupied regardless of the transmission requirements and therefore are only valid for this type of scenario. In this paper, we propose a new paradigm for EE-SE tradeoff, namely the resource efficiency (RE) for orthogonal frequency division multiple access (OFDMA) cellular network in which we take into consideration different transmission-bandwidth requirements. We analyse the properties of the proposed RE and prove that it is capable of exploiting the tradeoff between EE and SE by balancing consumption power and occupied bandwidth; hence simultaneously optimizing both EE and SE. We then formulate the generalized RE optimization problem with guaranteed quality of service (QoS) and provide a gradient based optimal power adaptation scheme to solve it. We also provide an upper bound near optimal method to jointly solve the optimization problem. Furthermore, a low-complexity suboptimal algorithm based on a uniform power allocation scheme is proposed to reduce the complexity. Numerical results confirm the analytical findings and demonstrate the effectiveness of the proposed resource allocation schemes for efficient resource usage.

USAP multiple access: dynamic resource allocation for mobile multihop multichannel wireless networking

Abstract: A number of tactical military and commercial applications require self-organizing, wireless networks that can operate in dynamic environments and provide peer-to-peer, multi-hop, multimedia communications. Rockwell Collins developed the Soldier Phone to meet these needs as part of the WireCorn Engine Technology Reinvestment Program jointly sponsored by DARPA and CECOM. USAP multiple access is the part of the system that manages the TDMA slot and channel assignments for optimal operation in the face of changing topologies and traffic requirements.