Improved error performance for generalised spatial modulation with enhanced spectral efficiency

The existing analytical average bit error rate (ABER) expression of conventional generalised spatial modulation (CGSM) does not agree well with the Monte Carlo simulation results in the low signal‐to‐noise ratio (SNR) region. Hence, the first contribution of this paper is to derive a new and easy way to evaluate analytical ABER expression that improves the validation of the simulation results at low SNRs. Secondly, a novel system termed CGSM with enhanced spectral efficiency (CGSM‐ESE) is presented. This system is realised by applying a rotation angle to one of the two active transmit antennas. As a result, the overall spectral efficiency is increased by 1 bit/s/Hz when compared with the equivalent CGSM system. In order to validate the simulation results of CGSM‐ESE, the third contribution is to derive an analytical ABER expression. Finally, to improve the ABER performance of CGSM‐ESE, three link adaptation algorithms are developed. By assuming full knowledge of the channel at the receiver, the proposed algorithms select a subset of channel gain vector (CGV) pairs based on the Euclidean distance between all CGV pairs, CGV splitting, CGV amplitudes, or a combination of these.     

A novel fast distance relay for series compensated transmission lines

This paper presents a fast distance relay for series compensated transmission lines based on the R–L differential-equation algorithm using the theory of equal transfer process of transmission lines. The measuring distances based on the proposed algorithm can fast approach the actual value of fault distance when a fault occurs in front of the series capacitor. When a fault occurs behind of the series capacitor, the fault loop, including the series capacitor, does not match the R–L transmission line model, so the measuring distances fluctuate severely. Based on this, the relative position of the fault with respect to the series capacitor can be judged effectively according to the fluctuation range of the measuring distances, and the accurate fault location can be obtained fast. A variety of PSCAD/EMTDC simulation tests show that the new relay has fast operating speed and high accuracy when applied to the long series compensated transmission lines.     

小型机载激光通信系统设计与验证

针对空空宽带高速通信的需求，设计了小型化机载激光通信系统。仿真分析了300 km、2.5 Gb/s无线激光链路性能，并通过运动仿真台模拟机动环境测试了系统的跟踪与通信性能，其中粗跟踪误差为533.2 μrad(1σ)，精跟踪误差为3.6 μrad(1σ)，测试数据传输240 s，通信误码率为2.82×10-9。仿真与实验验证了该系统用于远距离空空无线激光通信的可行性。     

On one boundary problem for nonlinear stationary controlled system

The object of study is nonlinear stationary controlled system of ordinary differential equations with constant disturbance in the right part. The problem of constructing the synthesising control function providing the transfer of this system from the initial state to the origin is considered. The sufficiently simple for numerical implementation algorithm of solution of the above-mentioned problem is obtained. It is shown that for local null controllability of the considered system, it is sufficient that the conditions of the Kalman's type were satisfied. In addition, the estimates restricting the choice of initial conditions and external disturbances under which the transfer is guaranteed are obtained. The main idea of the method of construction of the desired control function consists in reducing the original problem to stabilisation of a special kind linear non-stationary system and solving the Cauchy problem for an auxiliary system of ordinary differential equations closed by stabilising control. The simplicity of the realisation of this algorithm is determined by the construction of the auxiliary system and its stabilisation that could be obtained by analytical methods. The effectiveness of the method is illustrated by solving the problem of crane control and its numerical simulation.     

Automated network management and configuration using Probabilistic Trans-Algorithmic Search

Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search.     

Protection of power transformer using multi criteria decision-making

Power transformers are protected by different relays that operate independently. Malfunction of each relay has a major role in reducing the reliability of the protection system. In order to mitigate the main drawbacks of the power transformer relays, an overall protection scheme is presented in this paper. This scheme proposes a novel multi criterion algorithm using decision-making based on fuzzy logic. In this paper the outputs of restricted earth fault relay and a directional check unit, are combined with the output of the differential protection relay. Therefore, problems that are pertaining to independent operation of each relay have been mitigated and the relays cover protection blind spots of each other. The improved power transformer protection (IPTP) scheme enhances the sensitivity and reliability of the power transformer protection. Extensive simulations are used to measure the effectiveness and merit of the proposed IPTP relay. The above efforts result in a multi criteria approach for protection of power transformers.     

Uplink Scheduling in CDMA Packet-Data Systems

Uplink scheduling in wireless systems is gaining importance due to arising uplink intensive data services (ftp, image uploads etc.), which could be hampered by the currently in-built asymmetry in favor of the downlink. In this work, we propose and study algorithms for efficient uplink packet-data scheduling in a CDMA cell. The algorithms attempt to maximize system throughput under transmit power limitations on the mobiles assuming instantaneous knowledge of user queues and channels. However no channel statistics or traffic characterization is necessary. Apart from increasing throughput, the algorithms also improve fairness of service among users, hence reducing chances of buffer overflows for poorly located users. The major observation arising from our analysis is that it is advantageous on the uplink to schedule “strong” users one-at-a-time, and “weak” users in larger groups. This contrasts with the downlink where one-at-a-time transmission for all users has shown to be the preferred mode in much previous work. Based on the optimal schedules, we propose less complex and more practical approximate methods, both of which offer significant performance improvement compared to one-at-a-time transmission, and the widely acclaimed Proportional Fair (PF) algorithm, in simulations. When queue content cannot be fed back, we propose a simple modification of PF, Uplink PF (UPF), that offers similar improvement. Hereafter, we refer to users with low recieved power at the base even when transmitting at peak transmit power as “weak” users, and the strongly recieved users at the base as “strong” users. Krishnan Kumaran is currently a member of the Complex Systems Modeling section in the Corporate Strategic Research of ExxonMobil Corp., Clinton, NJ. Formerly, he was a Member of Technical Staff in the Mathematics of Networks and Systems Research Department at Bell Labs in Murray Hill, NJ, where his research interests were in modeling, analysis and simulation of design, resource management and scheduling issues in telecommunication networks. Lijun Qian is an assistant professor in the Department of Electrical Engineering at Prairie View A&M University. He received his B.S. from Tsinghua University in Beijing, M.S. from Technion-Israel Institute of Technology, and Ph.D. from WINLAB, Rutgers University, all in electrical engineering. Before joining PVAMU, he was a researcher at Networks and Systems Research Department of Bell Labs in Murray Hill, NJ. His major research interests are in wireless communications and networking technologies, especially in radio resource management, protocol design, TCP/RLP optimization and MPLS traffic engineering.     

A Bluetooth Based Sensor Network for Civil Infrastructure Health Monitoring

Communicating with sensors has long been limited either to wired connections or to proprietary wireless communication protocols. Using a ubiquitous and inexpensive wireless communication technology to create Sensor Area Networks (SANs) will accelerate the extensive deployment of sensor technology. Bluetooth, an emerging, worldwide standard for inexpensive, local wireless communication is a viable choice for SANs because of its inherent support for some of the important requirements – low power, small form factor, low cost and sufficient communication range. In this paper we outline an approach, centered on the Bluetooth technology, to support a sensor network composed of fixed wireless sensors for health monitoring of highways, bridges and other civil infrastructures. We present a topology formation scheme that not only takes into account the traffic generated by different sensors but also the associated link strengths, buffer capacities and energy availability. The algorithm makes no particular assumptions as to the placement of nodes, and not all nodes need to be in radio proximity of each other. The output is a tree shaped scatternet rooted at the sensor hub (data logger) that is balanced in terms of traffic carried on each of the links. We also analyze the scheduling, routing and healing aspects of the resulting sensor-net topology.     

WPAN/WLAN应用环境下基于PER的链路自适应算法

本文重点研究基于包错误率测量的链路自适应算法，分析了包错误率与信道参数的关系，提出了一种有别于固定门限值方案的优化门限值方案。仿真结果表明，优化门限值方案的网络吞吐量要大于固定门限值方案和基于信干比估计的链路自适应算法，最大增幅可达12Mbit/s。在系统引入重传机制后，网络吞吐量将有所损失，但最大不超过1Mbit/s，相比较服务质量的提高是值得的。需指出的是，虽然分析和仿真均以HIPERLAN／2为例，但不失一般性，它们同样适合于WPAN/WLAN等类似系统。     

火工品压药机装配误差的研究

针对军用雷管生产线中压药机结构,分别用极值法和概率法对压药机冲子和雷管的配合精度,进行了装配尺寸链的描述和计算,并对所得的结果进行了比较。