Diversity advantage for cordless telephones

The advantage in using spatial diversity for cordless telephone operation at 900 MHz is examined, and the resulting improvement in performance and user density for a digital burst-mode system is compared with that for a conventional analogue FM system.     

片上网络的动态虚通道分配策略

针对片上网络（NoC）的传统的静态虚通道分配不能很好适应非平衡的业务负荷问题,本论文提出了NoC动态虚通道分配策略。在静态虚通道分配基础上,动态分配虚通道通过实时监测节点端口的包流量的方向,决定分配给该端口的虚通道数目。动态虚通道资源可以在所有端口间共享,并根据通信业务需求动态调度。在二维meshNoC上的仿真表明,动态虚通道分配策略不仅节约了存储器资源,而且对NoC传输延时有一定的改善。     

Efficiency comparison of channel allocation schemes for digitalmobile communication networks

This paper provides network designers and operators with simple guidelines on traffic measurements and efficiency evaluation of various channel allocation schemes in digital mobile telecommunications networks. The paper evaluates the efficiency obtained by implementing the following channel allocation schemes: (1) fixed uniform channel allocation (FUCA); (2) fixed nonuniform channel allocation (FNCA); (3) dynamic channel allocation (DCA) where the number of frequency carriers is adaptive and dependent on the load; and (4) dynamic frequency/time channel allocation (DFTCA) (a new scheme which is the most efficient) where the number of channels is adaptive (based on the load), allowing two channels of the same frequency carrier to be used in two neighboring cells. The analysis is based on standard queuing models under the following assumptions: (1) Poisson call arrivals in each cell; (2) exponential call holding time; (3) exponential mobile travel time; and (4) exponential sojourn time of a mobile in a cell. Numerical results are presented to provide insight into the accuracy of the models and efficiency gain by dynamic frequency time channel allocation under different traffic conditions (including conditions related to highway traffic)     

A mathematical model for wireless channel allocation and handoff schemes

A mathematical model for analytical study on complete and partial channel allocation schemes is presented in this paper. Expression for the queue length distribution has been analytically derived. The mathematical model can be used for analysis of multiple call categories like new calls, handoff calls, delay tolerant or delay sensitive calls. This adaptive mathematical model can be utilized to design optimal channel allocation algorithms, or even test the already established resource allocation schemes for provisioning of Quality-of-Service to enable the usage of real time mobile applications. Most existing studies depend upon simulation experiments to investigate the performance of their proposed algorithms, but the mathematical model presented here can really help to evaluate such proposals from an analytical perspective.     

Dynamic resource allocation schemes during handoff for mobilemultimedia wireless networks

User mobility management is one of the important components of mobile multimedia systems. In a cell-based network, a mobile should be able to seamlessly obtain transmission resources after handoff to a new base station. This is essential for both service continuity and quality of service assurance. In this paper, we present strategies for accommodating continuous service to mobile users through estimating resource requirements of potential handoff connections. A diverse mix of heterogeneous traffic with diverse resource requirements is considered. The investigate static and dynamic resource allocation schemes. The dynamic scheme probabilistically estimates the potential number of connections that will be handed off from neighboring cells, for each class of traffic. The performance of these strategies in terms of connection blocking probabilities for handoff and local new connection requests are evaluated. The performance is also compared to a scheme previously proposed by Yu and Leung (see IEEE J. Select. Areas Commun., vol.15, p.1208-25, 1997). The results indicate that using dynamic estimation and allocation, we can significantly reduce the dropping probability for handoff connections     

Dynamic guard channel allocation scheme for calls in WONs

Future wireless networks will provide ubiquitous communication services to a large number of mobile users. The design of such networks is based on heterogeneous wireless overlay networks that allow efficient use of the limited available spectrum, and also cover different ranges of coverage areas. A dynamic guard channel allocation scheme for calls in wireless overlay networks is developed. The new scheme considers the mobility, current location of mobile terminals, and bandwidth status in allocating bandwidth for new calls in order to guarantee the quality of service for all calls     

Dynamic channel allocation in wireless ATM networks

During the last few years extensive research has been carried out to extend fixed ATM networks to mobile users. Currently the European Telecommunications Standards Institute (ETSI) is standardising new types of Broadband Radio Access Networks (BRAN): HIPERLAN/2 and HIPERACCESS. In cellular systems like HIPERLAN/2 the aspect of channel allocation plays an important role. In this paper two approaches for channel allocation are introduced and compared with each other concerning the spectrum efficiency and their influence on the implementation of wireless ATM networks and wireless LANs. This revised version was published online in July 2006 with corrections to the Cover Date.     

多智能体强化学习驱动的无人机动态信道分配

针对无人机编队在进行远距离实时视频传输时频谱资源不足且利用效率低、吞吐量要求较高、传输任务难以完成等问题,提出了多智能体强化学习驱动的动态信道分配算法,使得无人机编队可以根据传输任务和信道环境动态地选择使用的信道,实现了频谱资源的高效利用。该算法使用了集中式训练分布式执行的架构,通过联合探索和联合学习的方式保证了无人机间的探索和合作能力,使得每架无人机均可以依据局部观测信息同时独立分配自身使用信道,提高了算法的灵活性和可行性,并减少了频谱分配用时。仿真结果表明,该算法训练过程性能更好,执行时相比于现有算法可以提高编队整体的平均任务传输成功率。     

Capacity optimizing channel allocation schemes for multi‐service cellular systems with mobile users

In this paper, we study the blocking and dropping probability of mobile users in the multi‐service cellular systems with mobile users. Based on the idea that different services may require different signal‐to‐interference ratios and different reuse factors, we proposed a channel allocation scheme called channel partitioning to support different services using different reuse factors. Under channel partitioning scheme, the channels in each cell are divided into two or more sets of channels and each set of the channels supports certain service, depending on the required reuse factor of the service. We first apply this channel partitioning with fixed channel allocation scheme called fixed channel partitioning (FCP), where a three‐dimensional Markov chain is developed to analyze the impact of the mobile user. After that a simpler model, which can estimate the numeric result from the closed‐form solution, is presented to make the analysis easier. In order to cater for the traffic variation between services and between cells, a dynamic channel partitioning with flexible channel combination scheme, called FDCP, is proposed to support multiple services. This FDCP tries to minimize the effect of assigned channels on the availability of channels for use in the interfering cells. The analysis and the simulation results show that for equal arrival rate of two services, the proposed FCP and FDCP scheme can provide about 32% and 54% improvement, respectively, in terms of grade of service as compared with conventional FCA scheme using a single reuse factor to support two services for the mobile users. Copyright © 2006 John Wiley & Sons, Ltd.     

Performance analysis of channel de-allocation schemes for dynamic resource allocation in GSM/GPRS networks

Channel de-allocation for GSM voice call (DASV) has been considered for dynamic resource allocation in GSM/GPRS networks. Two new de-allocation schemes are proposed: de-allocation for GPRS packet (DASP) and de-allocation for both GSM voice call and GPRS packet (DASVP). An analytic model with general GPRS data channel requirement is derived to evaluate the performance of the schemes in terms of GSM voice call incompletion probability, GPRS packet dropping probability, average GPRS packet transmission time and channel utilisation.     

Dynamic channel allocation techniques using adaptive modulation andadaptive antennas

This article studies the impact of adaptive quadrature amplitude modulation (AQAM) on network performance when applied to a cellular network, using adaptive antennas in conjunction with both fixed channel allocation (FCA) and locally distributed dynamic channel allocation (DCA) schemes. The performance advantages of using adaptive modulation are investigated in terms of the overall network performance, mean transmitted power, and the average network throughput. Adaptive modulation allowed an extra 51% of users to be supported by an FCA 4-QAM network, while in conjunction with DCA, an additional 54% user capacity was attained     

Distributed resource allocation schemes

In this article, we discuss distributed resource allocation schemes in which each transmitter determines its allocation autonomously, based on the exchange of interference prices. These schemes have been primarily motivated by the common model for spectrum sharing in which a user or service provider may transmit in a designated band provided that they abide by certain rules (e.g., a standard such as 802.11). An attractive property of these schemes is that they are scalable, i.e., the information exchange and overhead can be adapted according to the size of the network.     

Dynamic channel allocation in interference-limited cellular systemswith uneven traffic distribution

Most recently proposed wireless dynamic channel allocation methods have used carrier-to-interference (C/I) information to increase the system performance. Power control is viewed as essential for interference-limited systems. However, the performance of such systems under an imbalance of load among cells, as may occur often in microcells, is largely unknown. Here, we study a typical interference-limited dynamic channel allocation policy. Calls are accepted if a channel can be assigned that will provide a minimum C/I, and power control and intracell handoffs are used to maintain this level. We focus on the relationship between system performance and the amount of imbalance in load among neighboring cells. Previous studies for systems that do not use C/I information have found that dynamic channel allocation (DCA) outperforms fixed channel allocation (FCA) in all but heavily loaded systems with little load imbalance. We present two principal new results. First, we find that with use of C/I information, the difference in performance between FCA and DCA (in terms of throughput or blocking probability) is increasing with load imbalance. DCA was found to be more effective in congestion control at the cost of a slightly lower call quality. Second, we find that use of power control to maintain a minimum C/I results in two equilibrium average power levels for both DCA and FCA, with DCA using a higher average power than FCA, and that while DCA's power is increasing with load imbalance, FCA's average power is decreasing with load imbalance     

Novel semi-blind channel estimation schemes for Rician fading MIMO channel

In this paper, we propose two novel semi-blind channel estimation techniques based on QR decomposition for Rician fading Multiple Input Multiple Output (MIMO) channel. In the first technique, the MIMO channel matrix H can be decomposed as an upper triangular matrix R and unitary rotation matrix Q as H = RQ. The matrix R is estimated blindly from only received data by using the orthogonal matrix triangularization based Householder QR decomposition, while the optimum rotation matrix Q is estimated exclusively from the algorithm of Orthogonal Pilot Maximum Likelihood Estimator (OPML) based on pilot information. In the second technique, the joint semi-blind channel and data estimation is performed by using the Least Square (LS) algorithm based on QR decomposition. The simulation results obtained for 4-PSK data modulation scheme using two transmitters and six receiver antennas for different Rice factor (K) have shown that the BER performance increases with an increase in the Rice factor. Finally, we compare these two new techniques with the conventional semi-blind channel estimation technique based on Whitening Rotation (WR), and the results show that the first proposed technique outperforms and the second technique achieves a very nearby performance as compared to the technique based on whitening rotation.     

Adaptive channel allocation for wireless PCN

In cellular networks, forced call terminations due to handoff call blocking are generally more objectionable than new call blocking. In order to maintain an acceptable call dropping probability rate, we propose, in this paper, two new guard channel schemes: an adaptive one – New Adaptive Channel Reservation (NACR) – and a dynamic one – Predictive Reservation Policy (PRP). In NACR, for a given period of time, a given number of channels is guarded in each cell for handoff traffic. In PRP, the number of reserved channels depends on the actual number of calls in progress in the neighboring cells. An approximate analytical model of NACR is presented. A Tabu search method has been implemented in order to optimize the Grade of Service. Discrete event simulations of PRP and NACR were run. The effectiveness of the proposed methods is emphasized on a complex configuration.     

Optimal coding schemes for conflict-free channel access

A method is proposed for conflict-free access of a broadcast channel. The method uses a variable-length coding scheme to determine which user gains access to the channel. For an idle channel, an equation for optimal expected overhead is derived and a coding scheme that produces optimal codes is presented. Algorithms for generating optimal codes for access on a busy channel are discussed. Suboptimal schemes are found that perform in a nearly optimal fashion. The method is shown to be superior in performance to previously developed conflict-free channel access schemes     

Energy minimization resource allocation schemes for relay-enhanced OFDMA networks

This paper studies the problem of joint allocation of subchannel, transmission power, and phase duration in the relay-enhanced bidirectional orthogonal frequency-division multiple access time division duplex systems. The challenges of this resource allocation problem arise from the complication of multiple-phase assignments within a subchannel since the relay station can provide an additional signal path from the base station to the user equipments (UEs). Existing research work does not fully consider all the influential factors to achieve feasible resource allocation for the relay-based networks. Since energy consumption is one of the principal issues, the energy minimization resource allocation (EMRA) schemes are proposed in this paper to design the allocation of subchannel, power, and phase duration for the UEs with the consideration of UE’s quality-of-service (QoS) requirements. Both the four-phase and two-phase bidirectional relaying assignments and the network coding technique are adopted to obtain the suboptimal solutions for the proposed EMRA schemes. Different weights are designed for the UEs to achieve the minimization of weighted system energy for the relay-enhanced networks. Simulation results show that the proposed EMRA schemes can provide comparably better energy conservation and outage performance with QoS support.

     

Energy aware power allocation strategies for multihop-cooperative transmission schemes

This paper is focused on the optimization of transmitted power in a cooperative decoded relaying scheme for nodes belonging to the single primary route towards. a destination. The proposed transmission protocol, referred to as Multihop Cooperative Transmission Chain (MCTC), is based on the linear combination of copies of the same message by multiple previous terminals along the route in order to maximize the multihop diversity. Power allocations among transmitting nodes in the route can be obtained according to the average (not instantaneous) node-to-node path attenuation using a recursive power assignment. The latter can be employed locally on each node with limited signalling exchange (for fixed or nomadic terminals) among nodes. In this paper the power assignments for the MCTC strategy employing conventional linear combining schemes at receivers (i.e., selection combining, maximal ratio combining and equal gain combining) have been derived analytically when the power optimization is constrained to guarantee the end-to-end outage probability. In particular, we show that the power assignment that minimize the maximum spread of received power (min-max strategy) can efficiently exploit the multihop diversity. In addition, for ad hoc networks where the energy of each node is an issue, the MCTC protocol with the min-max power assignment increases considerably the network lifetime when compared to non-cooperative multihop schemes     

Dynamic routing schemes for international networks

Major issues that should be examined in evaluating the performance of networks with dynamic routing are reviewed. The characteristics of international 24-h traffic profiles are examined, and proposed dynamic routing schemes are described. Gain allocation principles are discussed, and results on circuit savings and fault tolerance of international dynamic routing networks are outlined