Towards the performance evaluation of 4th generation wireless communication standards: LTE versus Mobile WiMAX

Advances in wireless communication protocols and networking toward support of the next generation of mobile and radio broadband technologies have contributed to a strong competition among various telecommunication standards in particular Long Term Evolution (LTE) and Mobile Worldwide Interoperability for Microwave Access (WiMAX). In this paper, we provide an in‐depth comparison analysis of LTE and Mobile WiMAX at the physical (PHY) layer by studying the most similar PHY configuration scenarios for these two technologies. Our study includes a throughput analysis of downlink (DL) and uplink (UL) transmissions in time division duplex with the least overhead possible and different antenna schemes as well as modulation and code rates. This study also performs an overhead analysis in both protocols to provide a more in‐depth understanding of the PHY layer capacity in various PHY layer configurations. Our simulation results generally show higher performance for LTE in both DL and UL transmission with 7 Mbps in DL and 5 Mbps in UL, when using one antenna port. However, by increasing the number of antennas for multiple‐input/multiple‐output configurations, the results illustrate a reduction in the performance of LTE compared to Mobile WiMAX. This arises from the increase in reference signal overhead in LTE from 4.7% in single‐input/single‐output (SISO) to 14.28% in 4 × 4 multiple‐input/multiple‐output (MIMO). Copyright © 2013 John Wiley & Sons, Ltd.     

VxWorks平台内核态ARINC653分区实时调度算法设计与实现

集成模块化航空电子架构(Integrated Modular Avionic, IMA)已成为主流航空电子系统。ARINC 653作为航空电子设备IMA架构的标准应用接口,成为研究航空电子软件编程方法的入口。最新研究表明,VxWorks能够为航空电子分区管理提供最优化的平台。然而,基于VxWorks的ARINC 653高效分区调度算法依然是研究的“盲区”。由此,设计了VxWorks内核态分层ARINC 653分区实时调度算法,提高了分区调度效率,为VxWorks内核ARINC 653完整性的研究提供非常有价值的参考。实验数据说明,相较于传统用户态分区管理模型,该调度算法使分区释放开销和分区释放抖动两项指标均显著降低。     

面向5G的D2D簇内信息共享机制

D2D (device-to-device)通信是5G网络中的重要技术,有利于提升数据分发业务传输效率;然而,由于D2D通信引入了大量额外信令开销,当前的增强多播方案无法解决高效数据传输与低效信令流程之间的矛盾,降低了整体性能增益.为此,提出了一种基于多维矢量分析的最小化信令开销的D2D簇内信息共享算法,包含集中式与分布式两种实现方式,能通过自适应地选择D2D多播重传发射者和多播重传数据分组,大幅减少簇内重传次数,达到显著降低信令开销和传输时延的目的.     

基于消息优先级的 OppIoV拥塞控制策略

针对机会车联网的网络拥塞问题,提出了一种基于所传输消息优先级的车辆节点拥塞控制策略。当车辆节点存储空间不足而又需要存储新的消息时,该车辆节点内的所有消息按照其优先级由高到低排列,丢弃优先级最低的消息,直至有存储空间来接收新的消息。通过大量的仿真实验与传统的丢弃策略对比,该拥塞控制策略能显著提高消息的递交率,减小开销,并对网络拥塞状况有更好的自适应能力。     

RM算法的运行时开销研究与算法改进

RM算法是经典的固定优先级实时调度算法.而在嵌入式实时系统中,系统的工作负荷往往是由很多频率快、执行时间较短的任务组成.因此,直接使用RM算法进行任务调度会由于实时操作系统中任务的上下文切换开销而导致嵌入式系统资源利用率的降低.分析了基于RM算法调度的任务之间的抢占关系,并建立了以任务属性为参数的上下文切换开销模型.在该模型的基础上,通过优化任务的释放时间来降低RM算法导致的系统运行时任务切换开销.最后的实验结果验证了该策略的有效性.     

Interprocedural Compiler Optimization for Partial Run-Time Reconfiguration

In this paper, we study the performance impact of dynamic hardware reconfigurations for current reconfigurable technology. As a testbed, we target the Xilinx Virtex II Pro, the Molen experimental platform and the MPEG2 encoder as the application. Our experiments show that slowdowns of up to a factor 1000 are observed when the configuration latency is not hidden by the compiler. In order to avoid the performance decrease, we propose an interprocedural optimization that minimizes the number of executed hardware configuration instructions taking into account constraints such as the “FPGA-area placement conflicts” between the available hardware configurations. The presented algorithm allows the anticipation of hardware configuration instructions up to the application’s main procedure. The presented results show that our optimization produces a reduction of 3 to 5 order of magnitude of the number of executed hardware configuration instructions. Moreover, the optimization allows to exploit up to 97% of the maximal theoretical speedup achieved by the reconfigurable hardware execution.     

Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows

This paper describes the parallelization of a two-phase metaheuristic for the vehicle routing problem with time windows and a central depot (VRPTW). The underlying objective function combines the minimization of the number of vehicles in the first search phase of the metaheuristic with the minimization of the total travel distance in the second search phase. The parallelization of the metaheuristic follows a type 3 parallelization strategy (cf. Crainic and Toulouse (2001). In F. Glover and G. Kochenberger (eds.). State-of-the-Art Handbook in Metaheuristics. Norwell, MA: Kluwer Academic Publishers), i.e. several concurrent searches of the solution space are carried out with a differently configured metaheuristic. The concurrently executed processes cooperate through the exchange of solutions. The parallelized two-phase metaheuristic was subjected to a comparative test on the basis of 358 problems from the literature with sizes varying from 100 to 1000 customers. The derived results seem to justify the proposed parallelization concept.     

On parallel asynchronous high-order solutions of parabolic PDEs

In achieving significant speed-up on parallel machines, a major obstacle is the overhead associated with synchronizing the concurrent processes. This paper presents high-orderparallel asynchronous schemes, which are schemes that are specifically designed to minimize the associated synchronization overhead of a parallel machine in solving parabolic PDEs. They are asynchronous in the sense that each processor is allowed to advance at its own speed. Thus, these schemes are suitable for single (or multi) user shared memory or (message passing) MIMD multiprocessors. Our approach is demonstrated for the solution of the multidimensional heat equation, of which we present a spatial second-order Parametric Asynchronous Finite-Difference (PAFD) scheme. The well-known synchronous schemes are obtained as its special cases. This is a generalization and expansion of the results in [5] and [7]. The consistency, stability and convergence of this scheme are investigated in detail. Numerical tests show that although PAFD provides the desired order of accuracy, its efficiency is inadequate when performed on each grid point.In an alternative approach that uses domain decomposition, the problem domain is divided among the processors. Each processor computes its subdomain mostly independently, while the PAFD scheme provides the solutions at the subdomains' boundaries. We use high-order finite-difference implicit scheme within each subdomain and determine the values at subdomains' boundaries by the PAFD scheme. Moreover, in order to allow larger time-step, we use remote neighbors' values rather than those of the immediate neighbors. Numerical tests show that this approach provides high efficiency and in the case which uses remote neighbors' values an almost linear speedup is achieved. Schemes similar to the PAFD can be developed for other types of equations [3].This research was supported by the fund for promotion of research at the Technion.     

一种分层的环状应用层多播模型

提出了一种新型的适合于大规模应用层多播的模型VRBH(Virtual Ring-Based Hierarchy),它以环作为拓扑结构,同时引入了分层和虚拟环的概念。采用了基于优先级的动态规划方法使得该环状拓扑结构随时间的变化逐渐趋于合理,并且采取一定的措施使得当出现数据传输错误时可以进行快速的恢复。由仿真试验结果得知该模型具有较低的控制开销,较高的带宽利用率和较高的数据传输率,应用该多播模型可以较好地提高多播的性能。