Soft handover overhead reduction by RAKE reception with finger reassignment

We propose and analyze in this paper a new finger assignment technique that is applicable for RAKE receivers when they operate in the soft handover (SHO) region. This scheme employs a new version of generalized selection combining (GSC). More specifically, in the SHO region, the receiver uses by default only the strongest paths from the serving base station (BS) and only when the combined signal-to-noise ratio (SNR) falls below a certain pre-determined threshold, the receiver uses more resolvable paths from the target BS to improve the performance. Hence, relying on some recent results on order statistics we attack the statistics of two correlated GSC stages and provide the approximate but accurate closed-form expressions for the statistics of the output SNR. By investigating the tradeoff among the error performance, the path estimation load, and the SHO overhead, we show through numerical examples that the new scheme offers commensurate performance in comparison with more complicated GSC-based diversity systems while requiring a smaller estimation load and SHO overhead.     

Finger Replacement Method for Rake Receivers in the Soft Handover Region

We propose and analyze a new finger replacement technique that is applicable for RAKE receivers in the soft handover (SHO) region. More specifically, the receiver uses in the SHO region by default the strongest paths from the serving base station (BS) and only when the combined signal-to-noise ratio falls below a certain pre-determined threshold, the receiver uses more resolvable paths from the target BS to improve the performance. Instead of changing the configuration for all fingers, the receiver just compares the sum of the weakest paths out of the currently connected paths from the serving BS with the sum of the strongest paths from the target BS and selects the better group. Using accurate statistical analysis, we investigate in this letter the tradeoff between error performance, average number of required path comparisons, and SHO overhead offered by this newly proposed scheme.     

Finger Replacement Schemes for RAKE Receivers in the Soft Handover Region With Multiple Base Stations

We propose and analyze new finger replacement techniques for RAKE reception in the soft handover (SHO) region with multiple base stations. The proposed schemes are basically based on the block comparison among groups of resolvable paths from different base stations and lead to the reduction of complexity while offering commensurate performance in comparison with previously proposed schemes. Relying on the newly derived analytical expressions, we investigate not only the complexity in terms of the average number of required path estimations/comparisons and the SHO overhead but the error performance of the proposed scheme over independent identically distributed (i.i.d.) fading channels as well. We also examine, via computer simulations, the effect of path unbalance/correlation as well as outdated/imperfect channel estimation and show the robustness of our proposed scheme to these practical limitations.     

Optimising CDMA Cell Planning with Soft Handover

Soft handover (SHO) is one of the fundamental features of code division multiple access (CDMA) systems such as universal mobile telecommunication system (UMTS), and it is affected by the placement and density of cells. Inclusion of soft handover in optimization models for UMTS and CDMA cell site selection and configuration has previously been very limited but it is important for coverage because it can provide gain to the user. Some authors have excluded SHO on the basis of tractability while others have found that omitting SHO in planning gives adequate solutions. As such the incorporation of SHO remains an important component for definitive investigation in optimisation models for cell planning. In this paper we focus on the problem and effect of including SHO in cell planning optimisation. We introduce a new cell planning optimisation model that explicitly incorporates SHO and reduces computational complexity. Exact results can be obtained when the orthogonality factor is zero, while a conservative approximation of interference is used to generate lower bounds on coverage in the general case. We demonstrate the tractability of this model and show that it leads to improved lower bounds for coverage maximisation in network planning.     

Capacity analysis in downlink WCDMA systems using soft handover techniques with SIR-based power control and site selection diversity transmission

This paper analyzes the downlink performance of a wideband code-division multiple-access system with site selection diversity transmission power control during soft handover (SHO) mode. Signal-to-interference ratio power control techniques are modeled and used in the simulations of this analysis. The study is focused on finding the optimum SHO margin in terms of maximum system capacity under energy-per-bit to noise spectral density ratio (E/sub b//N/sub 0/) quality requirements. The results of this analysis show an increase in user capacity of about 15%-20% for optimum SHO margins of 5-5.5 dB. Nevertheless, the resources required (number of scrambling codes) by the base station increase faster than the number of active users in terms of SHO margin up to values of approximately 9.5 dB.     

A Low-Complexity MAP–SIC Detector for Massive MIMO Systems

This paper represents the modified version of spotted hyena optimizer (SHO) to improve the performance. The spiral moment and astrophysics concepts are utilized in the proposed algorithm. The spiral moment is used to enhance the intensification capability of SHO. The concept of astrophysics is incorporated in SHO to improve both diversification and intensification. The performance of the proposed algorithm is compared with five well-known metaheuristic algorithms over CEC 2015 benchmark test functions. The results depict that the proposed algorithm outperforms the others in terms of fitness function value. The effects of scalability and sensitivity analysis have also been investigated. The proposed algorithm is also applied to two constrained engineering design problems. The experimental result shows that the proposed algorithm performs better than the other algorithms.

     

QoS-controlling soft handoff based on simple step control and a fuzzy inference system with the gradient descent method

Quality of service (QoS) is an important criterion considered in mobile communication systems since it directly affects system users in terms of both call blocking and call quality. This paper aims to control the QoS in code-division multiple-access mobile communication systems by proposing two new practical methods applied to the conventional soft handoff (SHO) process based on a simple step-control method and a human-oriented information method of fuzzy inference system with classical mathematics of the gradient descent method. The output parameters selected to be controlled by adapting SHO thresholds are the trunk-resource efficiency (TRE), the forward link's average energy per bit to the interference plus noise power spectral density ratio (E/sub b//I/sub 0/), and the outage probability (P/sub out/). TRE is concerned with call blocking while E/sub b//I/sub 0/ is an indicator of the call quality. The number of the remaining channels of serving base station (CH/sub rm/), the moving average number of pilots in active set of any mobile station (no/sub BS/), and E/sub b//I/sub 0/ is or are selected to be one, two, or three of the control plant inputs, depending on the method applied. QoS-controlling SHO (TRE- and E/sub b//I/sub 0/-controlling SHO) can improve the system performance. However, which method that will be selected for use is according to the environment and the requirement of the system operator and/or users.     

Huffman coding of DCT coefficients using dynamic codeword assignment and adaptive codebook selection

In many image sequence compression applications, Huffman coding is used to eliminate statistical redundancy resident in given data. The Huffman table is often pre-defined to reduce coding delay and table transmission overhead. Local symbol statistics, however, may be much different from the global ones manifested in the pre-defined table. In this paper, we propose three Huffman coding methods in which pre-defined codebooks are effectively manipulated according to local symbol statistics. The first proposed method dynamically modifies the symbol-codeword association without rebuilding the Huffman tree itself. The encoder and decoder maintain identical symbol-codeword association by performing the same modifications to the Huffman table, thus eliminating extra transmission overhead. The second method adaptively selects a codebook from a set of given ones, which produces the minimum number of bits. The transmission overhead in this method is the codebook selection information, which is observed to be negligible compared with the bit saving attained. Finally, we combine the two aforementioned methods to further improve compression efficiency. Experiments are carried out using five test image sequences to demonstrate the compression performance of the proposed methods.     

Dynamic control plane management for software‐defined networks

Software‐defined network (SDN) is an emerging network paradigm that allows flexible network management by providing programmability from a separated control plane. Because of the centralized management scheme that SDN adopts, intensive control plane overhead incurs as the scale of SDN increases. The control plane overhead is mainly caused by a massive amount of control messages generated during data plane monitoring and reactive flow instantiation. By far, very few works have addressed the overhead issue on reaction flow instantiation; therefore, we mainly focus on alleviating such overhead in this work. To achieve this goal, we propose a new control plane management (CPMan) method. CPMan aims to realize the following two objectives: first, reduce the number of control messages exchanged through the control channel and second, evenly distribute the control workload across multiple controllers to mitigate the potential performance bottleneck. To realize the former, we propose a lightweight feedback loop‐based control scheme, whereas for the latter, we propose a dynamic switch‐to‐controller (DSC) placement scheme. To show the feasibility of our proposal, we implemented a prototype of the two proposed schemes on top of a carrier‐grade SDN controller and validated its performance in an emulated network. We achieved approximately 57.13% overhead reduction with feedback loop‐based control scheme, while achieved approximately 98.68% balance ratio with DSC placement scheme. Copyright © 2016 John Wiley & Sons, Ltd.     

Performance analysis of dynamic OFDMA systems with inband signaling

Within the last decade, the orthogonal frequency- division multiplexing (OFDM) transmission scheme has become part of several standards for wireless systems. Today, OFDM is even a candidate for fourth-generation wireless systems. It is well known that dynamic OFDMA systems potentially increase the spectral efficiency. They exploit diversity effects in time, space, and frequency by assigning system resources periodically to terminals. Informing the terminals about new assignments creates a signaling overhead. Up to now, this overhead has not been taken into account in studies on dynamic orthogonal frequency-division multiplexing access (OFDMA) systems. Yet this is crucial for a realistic notion of the performance achieved by dynamic approaches. In this paper, we close this gap. We introduce two forms of representing the signaling information and discuss how these affect system performance. The study of the signaling impact on the performance is conducted for an exemplary dynamic approach. We find that the throughput behavior of dynamic OFDMA systems is significantly influenced by the signaling overhead. In many situations, neglecting the overhead leads to wrong performance conclusions. Also, the performance difference between dynamic and static schemes is now much more sensible to the specific parameter set of the transmission scenario (e.g., frame length, subcarrier number, etc.). This leads to the proposal of access points which should adapt certain system parameters in order to provide optimal performance.     

Is blind channel estimation feasible in mobile communicationsystems? A study based on GSM

We compare the effect of blind and nonblind channel estimates on the performance of Global System for Mobile communications (GSM) receivers. More precisely, we investigate whether two blind approaches, based on higher order statistics (HOS), can compete with two conventional methods, exploiting training sequences. For blind and nonblind estimates of six fast and slowly fading mobile radio channels, we give simulated bit error rates (BERs), after Viterbi detection, in terms of the signal-to-noise ratio (SNR). We also study the influence of cochannel interferers at different values of the signal-to-interference ratio (SIR). Averaged over the six channel examples, we demonstrate that the blind channel estimation algorithm eigenvector approach to blind identification (EVI) leads to an SNR loss of 1.2-1.3 dB only, while it saves the 22% overhead in GSM data rate caused by the transmission of training sequences. Since just 142 samples are used for blind channel estimation, we consider this performance outstanding for an approach based on HOS     

A multicast key management scheme based on characteristic values of members

A new collusion attack on Pour-like schemes is proposed in this paper. Then, we present a collusion-free centralized multicast key management scheme based on characteristic values of members. The re-keying method that other group members calculate new keys when a member is joining or leaving is also designed. It achieves forward secrecy and backward secrecy. Compared with typical existing centralized schemes, the storage of Group Key Controller (GKC) in our scheme halves the storage overhead of others, and communication overhead of GKC is 2 in case of joining re-keying. Especially, the leaving re-keying overhead is log₂ n, and the overall performance is excellent.     

基于改进斑点鬣狗优化算法的红外图像分割

针对斑点鬣狗优化算法（spotted hyena optimizer,SHO）容易陷入局部最优解、求解质量低等缺点,本文提出使用Lévy飞行和单纯形搜索算法改进SHO（spotted hyena optimizer based on simplex method and Lévy flight, Lévy_SM_SHO）。将Lévy_SM_SHO与Lévy飞行斑点鬣狗优化算法（spotted hyena optimizer based on Lévy flight, Lévy_SHO）、单纯形搜索斑点鬣狗优化算法（spotted hyena optimizer based on simplex method, SM_SHO）和SHO在测试函数上结果进行对比,实验证明改进算法能够取得较好的优化结果。并将Lévy_SM_SHO算法用于红外图像阈值分割问题,通过与粒子群算法（particle swarm optimization, PSO）分割结果对比,证明Lévy_SM_SHO算法能够取得较好的阈值分割结果。     

Reverse link performance of wireless local loop CDMA networks

We study the effect of directional subscriber antennas on the reverse link performance of a power-controlled code-division multiple access (CDMA) network in wireless local loop deployments. We investigate the capacity gain that is attained in wireless local loop (WLL) CDMA over mobile cellular systems and its variation as a function of the channel statistics. We also determine the overhead that soft handoff and directional subscriber antennas impose on the WLL system capacity     

基于IBED和仿生算法的LT码度分布设计

度分布是影响Luby变换（Luby transform,LT）码性能优劣的关键因素,为了得到更优的度分布,提出一种基于改进的二进制指数分布（improved binary exponential distribution,IBED）和仿生算法的LT码度分布设计方案.采用IBED度分布进行LT编码,初始译码成功率可高达90%以上,但随着译码开销增大,译码成功率上升速度减缓,而此时鲁棒孤子分布（robust soliton distribution,RSD）的译码性能表现更佳.为了将IBED和RSD的优点有机结合,利用人工鱼群算法（artificial fish swarm algorithm,AFSA）在两种度分布间寻优,基于期望可译集构建该算法的目标函数,通过最大化目标值得到更优的度分布.仿真结果表明,与类似方法及传统的RSD相比,采用新度分布进行LT编码可明显降低译码开销,并节约编译码耗时.     

Greater than 200 Gb/s Transmission Using Direct-Detection Optical OFDM Superchannel

In this paper, we propose direct-detection optical orthogonal frequency division multiplexing superchannel (DDO-OFDM-S) and optical multiband receiving method (OMBR) to support a greater than 200 Gb/s data rate and longer distance for direct-detection systems. For the new OMBR, we discuss the optimum carrier-to-sideband power ratio (CSPR) in the cases of back-to-back and post transmission. We derive the analytical form for CSPR and theoretically verify it. A low overhead training method for estimating I/Q imbalance is also introduced in order to improve performance and maintain high system throughput. The experiment results show that these proposals enable an unprecedented data rate of 214 Gb/s (190 Gb/s without overhead) per wavelength over an unprecedented distance of 720 km SSMF in greater than 100 Gb/s DDO-OFDM systems.     

Improved Opportunistic Beamforming in Ricean Channels

In order to improve the performance of opportunistic beamforming in Ricean channels, we propose an improved opportunistic beamforming scheme which forms beams intelligently to the users. First, a new concept of the generalized Ricean distribution is introduced. On the basis of this theory, we propose a maximum-likelihood (ML) estimator of the directions of arrival of the users, and we derive the Cramer-Rao lower bound to evaluate the performance of the ML estimator. Furthermore, the generalized Ricean K-factors are estimated by a moment-based method. With the same pilot overhead in the downlink and with the same feedback overhead in the uplink, the improved scheme considerably outperforms conventional opportunistic beamforming     

网络功能虚拟化场景下的并行加速

在网络功能虚拟化场景下,每个网络功能都以软件的形式来实现。但传统的串行网络功能组链方式将带来极大的性能损耗。而如今针对网络功能进行加速的工作,主要集中在优化该串行链的每个组成成分上。提出了一个高性能的系统框架,通过让网络功能并行地对数据分组进行处理,提高网络功能虚拟化场景下服务链的整体性能。该系统由 3 个部分组成。首先,该系统为管理员提供了一个策略描述语言来直观地描述串行或并行的组链意图。然后,该系统的编排器智能地鉴别网络功能之间的依赖性,并基于所提供的策略,生成高性能的“服务图”。最后,该系统的底层实现通过执行轻量级的数据分组复制、分布式的并行分组转发和负载均衡后的数据分组合并来支持网络功能的并行处理。基于DPDK技术,在Linux容器中实现了该系统的原型机。通过实验验证可知,该系统能极大地减少真实世界中服务链的处理时延。     

Constructing Internet coordinate system based on delay measurement

In this paper, we consider the problem of how to represent the locations of Internet hosts in a Cartesian coordinate system to facilitate estimation of network distances among arbitrary Internet hosts. We envision an infrastructure that consists of beacon nodes and provides the service of estimating network distance between pairs of hosts without direct delay measurement. We show that the principal component analysis (PCA) technique can effectively extract topological information from delay measurements between beacon hosts. Based on PCA, we devise a transformation method that projects the raw distance space into a new coordinate system of (much) smaller dimensions. The transformation retains as much topological information as possible and yet enables end hosts to determine their coordinates in the coordinate system. The resulting new coordinate system is termed as the Internet Coordinate System (ICS). As compared to existing work (e.g., IDMaps and GNP), ICS incurs smaller computation overhead in calculating the coordinates of hosts and smaller measurement overhead (required for end hosts to measure their distances to beacon hosts). Finally, we show via experiments with both real-life and synthetic data sets that ICS makes robust and accurate estimates of network distances, incurs little computational overhead, and its performance is not susceptible to the number of beacon nodes (as long as it exceeds a certain threshold) and the network topology.     

Modeling path duration distributions in MANETs and their impact on reactive routing protocols

We develop a detailed approach to study how mobility impacts the performance of reactive mobile ad hoc network routing protocols. In particular, we examine how the statistics of path durations including probability density functions vary with the parameters such as the mobility model, relative speed, number of hops, and radio range. We find that at low speeds, certain mobility models may induce multimodal distributions that reflect the characteristics of the spatial map, mobility constraints and the communicating traffic pattern. However, this paper suggests that at moderate and high velocities the exponential distribution with appropriate parameterizations is a good approximation of the path duration distribution for a range of mobility models. Analytically, we show that the reciprocal of the average path duration has a strong linear relationship with the throughput and overhead of dynamic source routing (DSR), which is also confirmed by simulation results. In addition, we show how the mathematical expression obtained for the path duration distribution can also be used to prove that the nonpropagating cache hit ratio in DSR is independent of velocity for the freeway mobility model. These two case studies illustrate how various aspects of protocol performance can be analyzed with respect to a number of significant parameters including the statistics of link and path durations.