异构分层无线网络中基于逗留时间的动态流量均衡算法研究

为使异构分层无线网络能服务更多的移动用户,提出了一种基于逗留时间的动态流量均衡算法.该算法首先根据用户移动模型计算其在小区内的逗留时间,然后基于小区呼叫到达率和重叠覆盖小区的流量状态来确定一个周期内呼叫转移的数量,最后依据逗留时间门限值将重负载小区中满足条件的呼叫转移到轻负载的重叠覆盖小区中.为降低切换呼叫掉线率,还对异构网间的呼叫切换策略做了改进.仿真实验结果表明,本算法在新呼叫阻塞率和切换呼叫掉线率等性能指标上比传统方法有显著的提高.     

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.     

本地七号公共信令网实施的若干问题

本文主要讨论本地七号公共信令网实施的若干问题，如信令转发点的设置，链路设置和路由选择，话路网和信令网的关系，不同制式七号公共信令的互通问题等。     

Variational Derivative for Buckling Loads of Beams and Frames

The finite-difference method is a numerical technique for obtaining approximate solutions to differential equations. The main objective of the present study is to give a new aspect to the finite-difference method by using a variational derivative. By applying this formulation, accurate values of the buckling loads of beams and frames with various end supports are obtained. The performance of this formulation is verified by comparison with numerical examples in the literature __________ Published in Prikladnaya Mekhanika, Vol. 41, No. 7, pp. 139–144, July 2005.     

A parallel cell‐based DSMC method on unstructured adaptive meshes

A parallel DSMC method based on a cell‐based data structure is developed for the efficient simulation of rarefied gas flows on PC‐clusters. Parallel computation is made by decomposing the computational domain into several subdomains. Dynamic load balancing between processors is achieved based on the number of simulation particles and the number of cells allocated in each subdomain. Adjustment of cell size is also made through mesh adaptation for the improvement of solution accuracy and the efficient usage of meshes. Applications were made for a two‐dimensional supersonic leading‐edge flow, the axi‐symmetric Rothe's nozzle, and the open hollow cylinder flare flow for validation. It was found that the present method is an efficient tool for the simulation of rarefied gas flows on PC‐based parallel machines. Copyright © 2004 John Wiley & Sons, Ltd.     

强流四脉冲电子束源实验研究

 为了进行强流多电子束源研究，对现有2MeV LIA 注入器进行了四脉冲改造，二极管脉冲电压约500kV。实验研究了天鹅绒阴极在四脉冲条件下的发射能力、传导电流负载效应以及阴极等离子体运动对阴极电子发射和束能量的影响。利用空间电荷限制流模型推算出阴极等离子体膨胀速率在1 ~4cm/μs之间。     

基于TS101型DSP链路口的多通道高精度数据采集电路设计

介绍一种基于数字信号处理器(DSP)TS101链路口的多通道高精度数据采集电路的设计方法,详细阐述利用多个ADS8361型A/D转换器进行数据采集,并经TS101链路口传输数据的FP-GA和DSP设计实现,讨论如何提高A/D转换精度的问题.     

Performance analysis of IEEE 802.11 ad hoc networks in the presence of exposed terminals

The paper evaluates the performance effects of exposed terminals in IEEE 802.11 ad hoc networks in finite load conditions. It derives analytical models for the estimation of channel utilization and media access delay for IEEE 802.11 ad hoc networks in finite load conditions with and without exposed terminals. The simulation results show that the analytical estimated channel utilization and media access delay metrics are fairly accurate.     

Randomization helps to perform independent tasks reliably

This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

针对混合应用业务的ARQ改进方案

在高速无线通信中,自动请求重传(ARQ)是链路层不可缺少的技术,它通过重传向上层屏蔽无线链路上包的丢失。随着无线网络的发展,无线传输速率不断提高,应用的业务类型也越来越广泛。目前,众多ARQ技术的研究都集中在如何提高该技术的确认效率,以适应更高的传输速率,但鲜有研究着手于如何使ARQ能够更好地应用于混合业务环境。针对混合业务环境下的ARQ改进提出了2种方案,并给出其中1种在实际应用中的改善效果。