Multicarrier FH codes for multicarrier FH-CDMA wireless systems

A multicarrier (multihopping) scheme for multilevel frequency-shift keying/frequency-hopping code-division multiple access (MFSK/FH-CDMA) systems is proposed. In order to improve the frequency diversity capability for the proposed multicarrier MFSK/FH-CDMA system, several hopping frequencies per time slot are employed and transmitted in parallel. The frequency band is partitioned into N (N/spl les/P, P is a prime number) disjoint subbands on which N hop carrier frequencies are simultaneously transmitted. In previous work on multicarrier systems, it has been assumed that the hopping frequencies of N disjoint subbands are identical. We consider the FH patterns without this assumption. These FH patterns have cross correlation no greater than one in order to minimize mutual interference. In addition, we analyze the performance of the system in order to show the improvement of user capacity. Our results show that the proposed scheme performs better than the conventional one in both nonfading and fading channels.     

水下无线光通信系统中可变增益放大器的实现

为了减小水下无线光通信系统中接收信号的动态范围,采用可变增益放大器,论述了基于数字模拟转换器和数字电位器实现可控增益的两种方法,并对基于数字电位器实现的方法进行了仿真实验.结果表明,该方法能有效压缩信号的动态范围,并使其趋于稳定.     

Subcarrier allocation and bit loading algorithms for OFDMA-based wireless networks

Orthogonal Frequency Division Multiple Access (OFDMA) is an emerging multiple access technology. In this paper, we consider OFDMA in the context of fixed wireless networks. This paper addresses the problem of assigning subcarriers and bits to point-to-point wireless links in the presence of cochannel interference and Rayleigh fading. The objective is to minimize the total transmitted power over the entire network while satisfying the data rate requirement of each link. We formulate this problem as a constrained optimization problem and present centralized algorithms. The simulation results show that our approach results in an efficient assignment of subcarriers and transmitter power levels in terms of the energy required for transmitting each bit of information. However, centralized algorithms require knowledge of the entire network topology and channel characteristics of every link. In a practical scenario, that would not be the situation and there is a need for distributed rate allocation algorithms. To address this need, we also present a distributed algorithm for allocating subcarriers and bits in order to satisfy the rate requirements of the links.     

Multiservice allocation for multiaccess wireless systems

This paper discusses principles for allocating multiple bearer services onto different subsystems in multiaccess wireless systems. Based on the included subsystem's multiservice capacities, under certain constraints near-optimum subsystem service allocations that maximize combined multiservice capacity are derived through simple optimization procedures. These favorable service allocations are either extreme points where services, as far as possible, are allocated to the subsystems best at supporting them, or they are characterized by the relative efficiency of supporting services being equal in all subsystems. The consequences of this include that services should typically be mixed in subsystems with convex capacity regions and isolated in subsystems with concave capacity regions. Simple user assignment algorithms based on this are also discussed. Additionally, illustrating the main findings of the analysis, some system examples are given, including a case study with combined global system for mobile communications (GSM) and wideband code-division multiple-access (WCDMA) systems. The gain of using the proposed service allocation principles compared to a reference case of maintaining equal service mixes in all subsystems depends on the shape of the subsystem capacity regions; the more different the capacity regions, the larger the gain. In the GSM and WCDMA case study, capacity gains of up to 100% in terms of supported data users for a fixed voice traffic load are achieved.     

Low complexity bit allocation algorithm for OFDM systems

A bit allocation algorithm is presented for orthogonal frequency division multiplexing (OFDM) systems. The proposed algorithm is derived from the geometric progression of the additional transmission power required by the subcarriers and the arithmetic–geometric means inequality. Consequently, this algorithm has a simple procedure and low computational complexity. Copyright © 2008 John Wiley & Sons, Ltd.     

红外无线系统的变步长自适应功率分配算法

红外无线通信系统中,为了在功率和误码率一定的限制下进一步提高系统容量,提出了一种新的变步长自适应功率分配算法,该算法以每比特分配功率的代价最小为原则(一次可分配多个比特)来选择最佳的调制技术.分析了其速度原理,并在建立模型的基础上,通过仿真研究了新算法的系统性能,并与理想注水算法以及传统的简单速率量化算法进行比较.仿真...     

A hybrid channel allocation method for wireless communication networks

In this paper a new hybrid channel allocation method is presented, which focuses on both nominal and dynamic channel allocation. Copyright © 2000 John Wiley & Sons, Ltd.     

Licence-exempt wireless communication systems

There is growing international interest in providing users with broadband wireless connectivity using licence-exempt networks rather than next generation licenced ones. This is a potentially disruptive trend, but because these systems are fundamentally different, it is still very unclear how significant this potential disruption is likely to be. Consequently, the aim of this paper is to overview the capabilities of the technologies typically used in licence-exempt systems and to then consider their potential performance limitations within the context of designed and randomly deployed Wi-Fi networks for different deployment densities.     

Fast algorithm for power and bit allocation in OFDM systems

The problem of power and bit allocation in OFDM systems is analysed. A solution algorithm with substantially lower computational complexity than existing algorithms is proposed     

Propagation prediction models for wireless communication systems

A comprehensive review of the propagation prediction models for terrestrial wireless communication systems is presented in this paper. The classic empirical models are briefly described and the focus is placed on the application of ray-tracing techniques to the development of deterministic propagation models. Schemes to increase the computational efficiency and accuracy are discussed. Traditional statistical models are also briefly reviewed for completeness. New challenges to the propagation prediction are described and some new approaches for meeting these challenges are presented     

End-to-end TCP-friendly streaming protocol and bit allocation for scalable video over wireless Internet

With the convergence of wired-line Internet and mobile wireless networks, as well as the tremendous demand on video applications in mobile wireless Internet, it is essential to an design effective video streaming protocol and resource allocation scheme for video delivery over wireless Internet. Taking both network conditions in the Internet and wireless networks into account, in this paper, we first propose an end-to-end transmission control protocol (TCP)-friendly multimedia streaming protocol for wireless Internet, namely WMSTFP, where only the last hop is wireless. WMSTFP can effectively differentiate erroneous packet losses from congestive losses and filter out the abnormal round-trip time values caused by the highly varying wireless environment. As a result, WMSTFP can achieve higher throughput in wireless Internet and can perform rate adjustment in a smooth and TCP-friendly manner. Based upon WMSTFP, we then propose a novel loss pattern differentiated bit allocation scheme, while applying unequal loss protection for scalable video streaming over wireless Internet. Specifically, a rate-distortion-based bit allocation scheme which considers both the wired and the wireless network status is proposed to minimize the expected end-to-end distortion. The global optimal solution for the bit allocation scheme is obtained by a local search algorithm taking the characteristics of the progressive fine granularity scalable video into account. Analytical and simulation results demonstrate the effectiveness of our proposed schemes.     

分布式阵列系统中反馈比特的分配方法

在采用频分双工的通信系统中,基站通常需要用户反馈信道状态信息以进行预编码。对于分布式阵列系统,由于多个接入节点布置在小区的不同位置,用户与小区内不同接入节点之间的信道条件不同。当用于反馈信道状态信息的资源受限时,需要对反馈比特的分配方法进行优化,从而提高系统的整体性能。在多用户分布式阵列系统中,采用基于距离阈值的接入节点选择方法,并在此基础上结合随机矢量量化码本的量化特性以及泰勒展开法,对系统量化容量损失进行推导,并给出了近似表达式。基于该表达式,提出了反馈比特分配方法,与其他的分配方法相比,不限制用户选择的接入节点数目使本文的方法更加具有普遍性。仿真结果显示,在反馈资源有限的情况下,提出的策略优于传统的等比特分配方案,可以获得较好的性能。     

New adaptive bit allocation algorithms for multiuser OFDM/CDMA systems

An adaptive bit allocation algorithm is proposed for multiuser transmission in OFDM/CDMA systems. The proposed scheme takes advantage of frequency diversity to dynamically allocate a suitable number of bits/per symbol on subcarriers of each user based on the transmitting objectives such as the required transmission rate and BER. A suboptimal solution to the problem of the bit allocation on subcarriers for each user is derived by minimizing the interference power from each user. Then an algorithm for adjusting the number of allocated bits is used to further reduce the interference without changing the total transmitted data rate. The performance obtained by minimizing the interference resulting from each user is studied in terms of BER, transmission data rate and the system capacity supporting multiple users. The theoretical analysis and simulation results show that the proposed algorithm substantially outperforms those reported previously.     

Optimum bit allocation algorithm for DMT-based systems underminimum transmitted power constraint

An algorithm for allocating bits to several carriers of a discrete multitone (DMT) symbol is proposed. The target of the algorithm is to assign the required bits (supported service) among the carriers so that the transmitted power is kept to a minimum. Ultimately, this algorithm is a transmitted power back-off algorithm which enables the system to operate at the minimum required power, resulting in the minimisation of the crosstalk interference to other systems located in the same binder group. Even though this algorithm was originally designed according the very high speed digital subscriber line system specifications, it can equally be used in every DMT-based digital subscriber line system such as asymmetrical digital subscriber line systems     

Asymptotic design of quantization and bit allocation for distributed estimation in wireless sensor networks

This paper investigates the schemes of asymptotically optimal quantization and bit allocation for distributed estimation in wireless sensor networks in which a total bit rate constraint is imposed. Because there is no communication among all sensors, quantizers for observations need to be designed separately. The Lloyd‐Max quantizer is shown to be asymptotically optimal for each sensor. Moreover, it is shown that the level number of asymptotically optimal quantization for sensors is proportional to the signal‐to‐noise ratio, which is determined by the variances of observation and noise. Because the original quantized minimum mean‐square error estimator often corresponds to a high computational cost when a large number of sensors are active, in our work, an asymptotically equivalent algorithm of iterative quantized estimator (IQE), which enjoys a low computational cost, is proposed. In addition, an IQE algorithm can be applied to wireless sensor networks with delay or packet loss. Simulation results of this work indicate that the effectiveness of our IQE algorithm is obvious; that is, a significant improvement of estimation performance is achieved by using the optimal bit allocation when comparing with the uniform bit allocation. Copyright © 2016 John Wiley & Sons, Ltd.     

Dynamic multiuser resource allocation and adaptation for wireless systems

Driven by the increasing popularity of wireless broadband services, future wireless systems will witness a rapid growth of high-data-rate applications with very diverse quality of service requirements. To support such applications under limited radio resources and harsh wireless channel conditions, dynamic resource allocation, which achieves both higher system spectral efficiency and better QoS, has been identified as one of the most promising techniques. In particular, jointly optimizing resource allocation across adjacent and even nonadjacent layers of the protocol stack leads to dramatic improvement in overall system performance. In this article we provide an overview of recent research on dynamic resource allocation, especially for MIMO and OFDM systems. Recent work and open issues on cross-layer resource allocation and adaptation are also discussed. Through this article, we wish to show that dynamic resource allocation will become a key feature in future wireless communications systems as the subscriber population and service demands continue to expand.     

A novel channel-identification method for wireless communication systems

We present a novel dual-channel identification approach for mobile wireless communication systems. Unlike traditional channel-estimation methods that rely on training symbols, we propose a bent-pipe feedback mechanism which requires the mobile station (MS) to send portions of its received signal back to the base station (BS) for wireless channel identification. Using a filter-bank decomposition concept, we introduce an effective algorithm that can identify both the forward and the reverse channels based only on this feedback information. This new method permits transfer of computational burden from the MS to the resource-rich BS, and leads to significant savings in bandwidth-consuming training signals.     

Propagation-prediction and site-planning software for wireless communication systems

Propagation-prediction and site-planning software for wireless communication networks has been developed. The software has a user-friendly graphical user interface (GUI), and provides calculations for large-scale and small-scale propagation parameters, including path loss (or received power) and delay profiles. Angles of arrival/departure, which are useful for the design of wireless systems employing multiple antennas, are also provided in the simulation. Some of the main features of the software include the use of a computationally efficient ray-tracing approach for simulating propagation in wireless environments, and the fact that users can upload AutoCAD .dxf files for indoor or outdoor environments. Both a single-building floor plan or an entire city layout can be simulated, and the user is provided with the ability to assign wall geometries and electrical parameters. User-defined realistic antenna radiation patterns for both the transmitting and receiving antennas are incorporated in the simulation. Broadband as well as polarization-dependent simulations are also included in the software.     

Performability modelling of wireless communication systems

The high expectations of performance and availability for wireless mobile systems has presented great challenges in the modelling and design of fault tolerant wireless systems. The proper modelling methodology to study the degradation of such systems is so‐called performability modelling. In this paper, we give overview of approaches for the construction and the solution of performability models for wireless cellular networks. First, we start with the Erlang loss model, in which hierarchical and composite Markov chains are constructed to obtain loss formulas for a system with channel failures. Consequently, we develop two level hierarchical models for the wireless cellular system with handoff and channel failures. Then, for a TDMA system consisting of base repeaters and a control channel, we build a hierarchical Markov chain model for automatic protection switching (APS). Finally, we discuss stochastic reward net (SRN) models for performability analysis of wireless systems. Copyright © 2003 John Wiley & Sons, Ltd.     

On Multi Agent based modeling and control in large scale wireless communication systems for improved resource allocation performance

The goal of this paper is to investigate the application of the Multi Agent technology in modeling and simulating large scale wireless communication systems. There are very few studies using the multi agent concept as an alternative approach for designing and simulating resource allocation in cellular systems and especially in large scale ones. Thus, a novel modeling methodology of wireless network services exploiting multi agent technology and investigating in depth critical agent issues is proposed in this paper. It is shown that the multi agent concept proves to be a suitable solution for modeling and implementing cellular network services simulation even in the case of large scale wireless networks. The whole investigation is divided in two phases: (a) multi agent modeling analysis and (b) multi agent model development for controlling network performance. Simulation results show the effectiveness of the proposed multi agent model when is applied in combination with the state of the art event scheduling mechanism.