一种多出口的WiMAX Mesh回程网络资源调度算法

由于WiMAX Mesh网络可以有效保证网络的QoS,因此有可能将其应用于电信级的回程网络.本文分析了WiMAX Mesh网络的调度机制和单出口 WiMAX Mesh网络存在的问题,提出了一种多出口WiMAX Mesh网络组网方案,在该方案的基础上提出了全局最优的调度算法,并给出了把该算法应用到实际WiMAX Mesh网络中的详细步骤.本文对具有20个和50个SS节点的Mesh网络进行了仿真,对算法的性能和效果进行了验证.仿真结果表明,本算法可以把调度效率提高53%～70%.     

Multi-Hop WiMAX Networks: A New Opportunistic Algorithm Using AMC and PUSC Mode for Different Mobility Users

Resource allocation algorithms play the main role in provisioning high throughput in broad band wireless communications. The previous studies in WiMAX networks have considered either AMC or PUSC techniques for the resource allocation algorithms. In this way, AMC based algorithms have presented high throughput for low speed users. Conversely, PUSC based algorithms have not been affected by users’ speed, whilst the throughput is low. To date, the importance of presenting proportional fair and maintaining the network throughput for the users with different speeds has not been acknowledged yet. This paper presents a novel opportunistic algorithm which is suitable for the users with different mobility speeds. The new algorithm uses two modes of AMC and PUSC simultaneously. The simulation results reveal that in comparison to similar algorithms, the proposed algorithm presents more proportional fair throughput when there are both high and low speed users.     

一种跨层设计的WiMAX上行链路调度算法

本文研究了WiMAX系统PMP(point to multi-point)模式下的调度算法,并综合考虑MAC层的队列状况/物理层的信道条件以及业务流的QoS要求,跨层设计了一种能够动态适应调制编码方案和信道干扰的上行链路调度算法--DMIA(dynamic MCS and intederence aware scheduling algorithm),最后利用NS2建模仿真,结果表明,与RR、WRR以及PQ+PF算法相比,本文提出的算法具有更高的吞吐量,更小的时延、时延抖动和丢包率,能满足各类业务的QoS要求.     

WiMAX网络的自适应切换算法

宽带无线通信由于载频的不断提高使得覆盖网络的半径越来越小,切换将变的更加频繁。针对不同移动用户,提出了一种基于移动速度的自适应切换算法,在切换过程中目标基站通过自适应的调整切换的延时时间来提高切换质量,降低了切换的掉话率。仿真表明,该策略可以有效降低切换掉话率,得到了一个比较完善的切换机制,可广泛用于将来宽带无线通信融合网络的切换中。     

EGPRS中新的调度算法

EGPRS（Enhanced GPRS）网络中，为不同用户分配物理信道PDCH（Packet Data Channel）的传统调度算法是PF（Proportionally Fair）算法。文中介绍了一种新的调度算法OHA（Opportunistic Handling Algorithm），该算法可以根据用户使用的不同服务类别为用户提供不同的服务质量；最后对OHA算法和PF算法的性能进行了比较。     

A Novel SIP-Based Route Optimization for Network Mobility

With the provision of various wireless services, e.g., third-generation (3G) and wireless local area network (WLAN), more and more people request to access the Internet anywhere at anytime. For example, people want to check their e-mails on the bus or watch online news while traveling in the train. For this purpose, the Internet Engineering Task Force (IETF) proposed the concept of network mobility, i.e., a set of users move as a unit. We motivate the network mobility problem by considering the state-of-the-art scenario of the network mobility (NEMO) basic support protocol that is extended from the Mobile IPv6 (MIPv6). In order to avoid the same problems suffered by MIPv6, a new session initiation protocol (SIP)-based network mobility management scheme called SIP-NEMO is designed and proposed in this paper. The proposed SIP-NEMO not only copes with the movement of a mobile network but also achieves the route optimization between two SIP clients without too many signaling messages over wireless links, even if the mobile network is nested. In this paper, we also analytically compute and simulate the performance of SIP-NEMO with the NEMO basic support protocol proposed by the IETF.     

一种EPON-WiMAX融合网络带宽分配算法

文中提出了一种应用于EPON和WiMAX的融合网络,实现用户多优先级业务区分并保证用户QoS的动态带宽分配算法。算法让EPON网络和WiMAX网络协同分配带宽,在EPON网络带宽分配的过程中加入WiMAX网络的带宽分配。整体算法使得因得不到足够带宽而受到影响的用户数保持在最小,同时加入令牌机制兼顾了用户之间的公平性。文中在现有融合网络框架的基础上提出算法,并给出了算法的具体设计步骤,详细分析了带宽申请和分配的过程,讨论了算法的优越性。     

A Novel Distributed Scheduling Algorithm for Downlink Relay Networks

To extend network coverage and to possibly increase data packet throughput, the future wireless cellular networks could adopt relay nodes for multi-hop data transmission. This letter proposes a novel distributed scheduling algorithm for downlink relay networks. Soft-information indicating the probability of activating each network link is exchanged iteratively among neighboring network nodes to determine an efficient schedule. To ensure collision-free simultaneous data transmissions, collision-avoiding local constraint rules are enforced at each network node. To increase resource utility, the soft-information is weighted according to the urgency of data transmission across each link, which also helps maintain throughput fairness among network users.     

CoMP系统低复杂度集中式调度算法研究

在3GPPLTE—A网络中,可以使用CoMP（多点协作）技术来提高边缘用户的性能。为了最大化全网边缘用户的总吞吐量,关键是要确定在每个PRB（物理资源块）中同时被服务的用户集合、每个被调度用户所对应的协作基站、以及各基站的传输功率。基于每个边缘用户的RSRP（参考信号接收功率）,提出一种低复杂度的集中式传输调度算法,针对每个PRB中被服务的边缘用户和相应的协作基站进行动态选择,并通过仿真实验验证算法的性能增益。     

A Novel Battery-Aware Task Scheduling Algorithm for Multiprocessor Systems

In battery-powered portable devices, the most important design goal is maximizing the battery lifetime. This paper addresses the problem of battery- aware task scheduling on multiprocessor systems to extend the battery lifetime, and proposed a Critical-path based battery-aware task scheduling （CPbBATS） algorithm with a novel efficient flow. Experiments on hundreds of task graphs each having 10 to 100 tasks show that, compared with algorithm that simply sequences tasks with their highest voltages and utilizes the slack by the latest possible task, the CPbBATS achieved 3.3%-6.1% reduction on apparent charge lost which means longer battery lifetime, 3.6%-8.3% reduction on actual charge lost which means lower energy consumption, and average 31.99% reduction on the CPU runtime which means much lower computa- tional complexity.     

一种适应信道的WiMAX分级调度架构

针对无线信道中与时间和位置相关性错误,文章简要介绍了IEEE 802.16d协议[1]的QoS服务模型,在对WiMAX的QoS机制和调度策略进行了深入的研究后,提出了一种新的MAC层分级分组调度架构.该架构主要由调度控制器、流量监控和两级分组调度组成,并给出了关键调度的算法模型.对算法的仿真表明,这个调度架构能够有效地区分对待实时业务、非实时业务和BE业务,满足不同类型业务的QoS需求,解决了无线信道特殊性带来的调度问题.     

一种新的基于HSDPA系统的分组调度算法

传统的HSDPA分组调度算法利用信道状态的变化来选择信道质量相对较好的用户,以此来达到吞吐量最大化.然而,由于信道质量较差的用户无法获得服务而被"饿死",因而这将引起公平性的问题.文章在分析了传统调度算法的基础上,提出了一种新的M-LWDF算法,并通过了计算机仿真,论证了新的算法在公平性方面较改进前有了较大的提高.     

A Novel Technique for Channel Estimation and Equalization for High Mobility OFDM Systems

Orthogonal frequency division multiplexing (OFDM) technique, when used in wireless environments, is known to be robust against frequency selective fading. However, when the channel shows time selective fading, rapid variations destroy the subcarrier orthogonality and introduce inter-carrier interference (ICI). The use of ICI mitigation schemes requires the availability of channel state information (CSI) at the receiver, which is a non-trivial task in fast fading systems. In our work, we have addressed the problem of estimation of rapidly varying channels for OFDM systems. The channel is modeled using complex exponentials as basis functions and the estimation process makes use of the cyclic prefix (CP) part available in OFDM symbols as training. The system is viewed as a state space model and Kalman filter is employed to estimate the channel. Following this, a time domain ICI mitigation filter that maximizes the received SINR (signal to interference plus noise ratio) is employed for equalization. This method performs considerably well in terms of MSE as well as BER at very high Doppler spreads.

Padded Frames: A Novel Algorithm for Stable Scheduling in Load-Balanced Switches

The load-balanced Birkhoff-von Neumann switching architecture consists of two stages: a load balancer and a deterministic input-queued crossbar switch. The advantages of this architecture are its simplicity and scalability, while its main drawback is the possible out-of-sequence reception of packets belonging to the same flow. Several solutions have been proposed to overcome this problem; among the most promising are the Uniform Frame Spreading (UFS) and the Full Ordered Frames First (FOFF) algorithms. In this paper, we present a new algorithm called Padded Frames (PF), which eliminates the packet reordering problem, achieves 100% throughput, and improves the delay performance of previously known algorithms.      

A Weight-Based Resource Scheduling Algorithm for Uplink LTE-A Femtocell Network

Wireless Personal Communications - SC-FDMA is the most suitable option for the LTE-A uplink. Contiguity plagiarism characteristics are required for optimum channel scheduling in an SC-FDMA system....     

一种蜂窝网中的跟踪算法

移动台定位技术是未来移动通信的方向。为了实现动态连续定位跟踪服务和提高定位精度,提出了一种在蜂窝网络中非视距（NLOS,Non-line of Sight）环境下对移动台（MS,Mobile Station）的定位跟踪算法。在用经典定位算法获得定位初始估计值后,利用卡尔曼滤波器对移动台的初始位置估计值进行修正,并配合检测门限对移动台进行跟踪。仿真结果表明,该跟踪算法能够实现对移动台动态定位跟踪,并且取得了良好的效果。     

一种具有QoS保证的无线分组调度算法

为提高系统吞吐量对指数规则（EXP-rule）调度算法进行了改进。改进的指数规则（WEXP-rule）算法根据各移动用户收发信道质量和业务传输的QoS要求动态调整各用户的业务传输优先级,确定下行共享信道的调度方案。并给出该算法的简化形式SWEXP-rule。仿真结果表明,与传统调度算法相比,SWEXP-rule算法在数据包传输时延受限的条件下具有无线信道利用率高、实现复杂度低等特点。     

一种新型无线传感器网络分布式定位算法

针对无线传感器网络(Wireless Sensor Networks,WSN)的低成本、低耗能以及准确定位的需求,提出了一种射频干涉与测量多普勒频偏相结合的节点定位方法。该方法中移动锚节点通过2次交叉运动,产生多普勒效应并与静止锚节点形成射频干涉场;未知节点通过测量自身低频干涉信号的瞬时频率的变化规律,获得定位相关信息进而实现节点定位。仿真实验结果表明该方法可以实现预期的定位,且定位精度较高;同时,定位算法简单,运算量小,能耗小,尤其适用于大范围分布的大量节点进行定位。     

A Novel Algorithm for Fast Detection of Network Failure

Fast failure detection is critical to traffic protection/restoration in a high-speed network. Generally, the way to detect failures is to periodically exchange keep-alive messages by layer 3 protocols. In traditional protocols like Open Shortest Path First (OSPF), the failure detection time is about tens of seconds, which makes the protection/restoration time too long to keep up with the increasing quality-of-service (QoS) demand. Although configuring the related parameters in OSPF can reduce the detection time to the order of milliseconds, it introduces notable issues of scalability and instability to the network. In this paper, a novel algorithm called Low Priority Hello Reduction (LPHR) is proposed to achieve faster failure detection while maintaining high network stability. This algorithm reduces the Hello messages sent when the signaling network is congested and maintains the adjacency by other messages. We compare it with previous schemes and our experimental results show that the algorithm we propose is superior in about an order of magnitude in reduction of both false failure alarms and queuing delay of other messages, especially at a light network load.