FlexRay总线在模块化通信导航识别系统中的应用

针对新型模块化通信导航识别( MCNI)系统对高质量数据通信的实际需求,从总线速率、实时性、可靠性、可扩展性等方面分析了现有几型总线存在的适配性问题,提出将新一代FlexRay总线技术应用到MCNI系统中,构建了基于双通道冗余拓扑构型的全新的MCNI系统总线架构,并给出了总线时隙分配和硬件框图。实验结果表明FlexRay总线传输速率可达10 Mb/s,能在重负荷情况下为MCNI系统提供实时可靠的信息交互,可为其他模块化传感器系统总线设计提供借鉴。     

面向航天器有线无线混合场景的流调度机制研究

随着各国深空探测任务的开展,空间站的建设需求日益增加,而航天器内部大量的数据通信总线在一定程度上影响了航天器的有效载荷。因此,该文将无线通信方式引入到航天器通信系统设计中,但传统无线通信难以保障时敏数据的端到端传输时延,该文提出了一种有线无线融合的时间敏感网络(TSN)流调度方案。设计了一种上下行时隙分离的TDMA时隙分配机制,通过对航天器内部业务类型与有线无线融合传输链路的时延关系进行建模分析,构建了以时敏业务平均端到端时延最小的目标函数,采用粒子群算法对时隙分配方案进行快速求解。最后在Pycharm平台对所提算法进行对比测试,并在EXata网络仿真平台搭建航天传感器采集网络进行验证。实验结果表明,该文所提出的有线无线融合流调度方案能为时敏业务提供稳定、有界的时延保障。     

时间触发总线时间同步和端到端时延测试方法

分析了TTP总线时间同步机制和基于中断方式的端到端数据传输模式,以及节点间时间同步、端到端时延和抖动等参数,设计了同步精度和时延测试方法,构建测试原型系统和配置场景并开发测试用例。结果表明,各节点间的时间偏差小于总线配置场景所允许的同步精度上限5us,端到端时延263.30～267.43us。因时间槽设置为250us,可知主机应用层与总线控制器同步方式下数据传输的端到端时延主要取决于时间槽所占时间。此测试方法和所用的原型系统可用于TTP总线通信系统设计和部署的优化。     

TDMA时隙分配对业务时延性能的影响分析

 在TDMA通信系统中,时隙分配是影响业务时延性能的重要因素,包括时隙数量分配(带宽分配)、时隙分配周期(TDMA帧长)和时隙位置分配三方面.本文针对可变速率和固定速率两类业务,基于随机服务系统理论和交通流理论建立了业务时延模型,得到了平均时延的解析式,分析了时隙数量、时隙位置和TDMA帧长度对业务时延影响的规律和特点.结果表明时隙位置分配越均匀,越能改善业务的平均时延和时延抖动性能;而在传统的时隙连续分配方式下,增加时隙数量分配对时延性能提高非常有限.在DVB-RCS卫星系统等具有较长帧设计的TDMA系统中,采用时隙均匀分配方式能够有效提高业务时延性能.计算机仿真验证了建模分析的正确性.     

低轨卫星接入系统中基于位置信息的时隙分配协议

针对浮标卫星通信系统中卫星覆盖范围广、接入链路传播时延差异大的场景结构引起的统一延迟分配协议中端到端时延长、吞吐率低的问题,提出了一种基于位置信息的时隙分配协议。协议中卫星通过获取浮标位置信息来控制时隙分配的起点,实现时隙离散分配,增大可用传输时隙长度,同时降低传输时延。 OPNET 仿真结果表明所提出的时隙分配协议可以显著提高单信道传输模式下的网络吞吐量,并有效降低单信道与双信道模式下浮标卫星通信系统接入时的端到端时延。     

基于OMNeT++的大规模确定性网络仿真实践

时间敏感网络（TSN）和确定性网络（DetNet）是确定性网络整体解决方案的重要组成部分,目前产业界还缺少这两种技术在大规模联合组网方面的研究。在OMNeT++仿真平台基于时隙调度实现了TSN和DetNet联合组网的确定性转发,并打通了控制器和仿真系统的通道,实现了转控协同的确定性仿真网络。重点介绍了对于仿真系统的改造,以及基于此的大规模跨域场景下确定性业务的端到端时延和抖动性能研究。结果表明,在大规模跨域场景下,时隙调度的机制可以提供端到端的确定性业务保障。     

Link16时隙固定分配算法的时延分析

时延是数据链的重要性能指标,而时隙分配算法对其有很大影响.运用排队理论,对数据链Link16的时隙固定分配算法进行建模,主要分析了其时延特性.数值计算和仿真结果表明,固定分配算法适用于用户业务量比较稳定且时隙资源比较充足的情况,选取合适的负荷率,系统才能达到良好的性能指标.     

ARINC825总线协议研究与实现

ARINC825规范是在CAN总线相关标准的基础上,基于民用飞机高安全性的要求,在通信调度、完整性协议、冗余等方面对CAN协议做了适应性改进而形成的一个机载总线标准,在高层协议中增加了基于主时间片和次时间片的通信调度,从而保证了确定性。对ARINC825的确定性进行分析,提出了基于FPGA的设计方法,并分别通过仿真和测试方法对该设计以及端到端传输延时进行了分析,结果表明能够满足确定性要求。     

有线无线融合的卫星时间敏感网络流调度研究

随着空间通信任务日趋复杂化,尤其是对时间敏感的需求不断提升,一方面要求星内系统的高带宽、可靠性和实时性;另一方面星间无线链路也应具备低时延和高可靠性。但由于卫星内部有线链路与星间无线链路差异大,业务数据经过有线和无线链路联合传输时,容易引发节点拥塞,而无法保障时敏业务的时延有界需求。为了提升数据在空间网络传输的实时性,该文提出了一种有线无线融合的时间敏感网络(TSN)流调度方案,首先对有线和无线链路资源分配与终端时延关系进行分析建模,并通过TSN控制器收集终端时敏需求,构建以全网时敏业务端到端最小平均时延为优化目标,然后采用基于增强精英保留遗传算法进行方案的快速求解。通过Pycharm对比测试时隙分配算法的性能,同时设计实现基于EXata网络仿真平台的低轨卫星TSN系统,并搭建实验场景进行试验验证。测试结果表明,该文所提出的流联合调度方案能够为空间时敏任务提供有界、稳定的时延保障。     

英飞凌为未来车辆开发FlexRay总线系统

11月30日，英飞凌公司宣布开始为高速车载通信系统开发下一代FlexRay标准总线系统。英飞凌的新型FlexRay收发器的数据传输速率可以达到10Mpbs，是当前车用CAN（控域网）标准的10倍。结合当前的微控制器，英飞凌将为和汽车安全息息相关的车载控制单元，传感器和制动器（如制动系统，转向系统，以及动力传动系统）之间的通信提供完善的总线系统。     

Stability-based routing,link scheduling and channel assignment in cognitive radio mobile ad-hoc networks

One fundamental issue in cognitive radio mobile ad hoc networks (CR-MANETs) is the selection of a stable path between any source and destination node to reduce the end-to-end delay and energy consumption arisen from route reconstruction. In this way, we analyse the link stability by calculating the link life time that is dependent on failures caused by secondary users’ (SUs) movements and primary users’ (PUs) activities. We propose a joint stability-based routing, link scheduling and channel assignment (SRLC) algorithm in CR-MANETs, which is benefited from considering the link life time, amount of interference imposed on PUs and energy consumption. The proposed algorithm selects a frequency channel/time slot in a way that channel utilization and previous behaviours of SUs and PUs, are taken into account. In the proposed SRLC, the concept of load balancing is applied by avoiding to route packets through SUs with insufficient energy. The effectiveness of the proposed algorithm is verified by evaluating the aggregate interference energy, end-to-end delay, goodput and the energy usage per packet transmission under three different scenarios. The results show our proposed scheme finds better routes compared to the recently proposed joint stable routing and channel assignment protocol.

     

Analytical model of round-robin scheduling for a geostationary satellite system

Round-robin scheduling is commonly employed in time-division multiple-access based medium access control protocols, to provide users with equitable access to a shared channel. The letter presents an analytical model to evaluate the mean end-to-end delay of packets traversing a geostationary satellite link with a round-robin free assignment scheduling strategy and Poisson source traffic. It is shown that the model can accurately predict the end-to-end delay performance of a round-robin scheduling satellite system.     

Novel Assignment Strategies for Spatial Reuse TDMA in Wireless Ad hoc Networks

Spatial reuse TDMA has been proposed as an access scheme for multi-hop radio networks where real-time service guarantees are important. The idea is to increase capacity by letting several radio terminals use the same time slot when possible. A time slot can be shared when the radio units are geographically separated such that small interference is obtained. In reuse scheduling, there are several alternative assignment methods. Traditionally, transmission rights are given to nodes or to links, i.e., transmitter/receiver pairs. We present a comparison of these two approaches and show that both have undesirable properties in certain cases, e.g. link assignment gives a higher delay for low traffic loads but can achieve much higher throughput than node assignment. Furthermore, we propose a novel assignment strategy, achieving the advantages of both methods. Simulation results show that the proposed method can achieve the throughput of link assignment for high traffic loads as well as the lower delay characteristics of node assignment for low traffic loads.     

车载自组网中一种分布式自适应TDMA时隙分配策略

提出了一种适用于车载自组网的自适应TDMA时隙分配机制DATS,DATS利用节点的差异性优化TDMA时隙分配机制,并且能根据节点密度自适应地调节时隙分配比例。理论分析和实验结果表明,DATS时隙分配策略能提高节点竞争成功率,降低接入时延;与现有的几种协议相比能减少至少50%的节点冲突,且具有良好的可扩展性,能够适应局部节点密度的变化。     

On scheduling optical packet switches with reconfiguration delay

Using optical technology for the design of packet switches/routers offers several advantages such as scalability, high bandwidth, power consumption, and cost. However, reconfiguring the optical fabric of these switches requires significant time under current technology (microelectromechanical system mirrors, tunable elements, bubble switches, etc.). As a result, conventional slot-by-slot scheduling may severely cripple the performance of these optical switches due to the frequent fabric reconfiguration that may entail. A more appropriate way is to use a time slot assignment (TSA) scheduling approach to slow down the scheduling rate. The switch gathers the incoming packets periodically and schedules them in batches, holding each fabric configuration for a period of time. The goal is to minimize the total transmission time, which includes the actual traffic-sending process and the reconfiguration overhead. This optical switch scheduling problem is defined in this paper and proved to be NP-complete. In particular, earlier TSA algorithms normally assume the reconfiguration delay to be either zero or infinity for simplicity. To this end, we propose a practical algorithm, ADJUST, that breaks this limitation and self-adjusts with different reconfiguration delay values. The algorithm runs at O(/spl lambda/N/sup 2/logN) time complexity and guarantees 100% throughput and bounded worst-case delay. In addition, it outperforms existing TSA algorithms across a large spectrum of reconfiguration values.     

Local Coordination Based Routing and Spectrum Assignment in Multi-hop Cognitive Radio Networks

Although Cognitive Radio technology brings efficient spectrum usage and effective interference avoidance, it also brings new challenges to routing in multi-hop Cognitive Radio Networks. Firstly, spectrum assignment is required for each hop in routing; secondly, new delay is introduced during multi-frequency scheduling and frequency switching in each node; thirdly, the intersecting nodes serving multi-frequency traffic is easy to be bottleneck in neighborhood region. In this paper, we analysis and model the per-node delay and the path delay in multi-hop Cognitive Radio Network. Then we propose a framework of local coordination based routing and spectrum assignment to solve above problems, which consists of one protocol for routing path and one scheme for neighborhood region. A on-demand Routing and Spectrum Assignment Protocol is proposed to exchange the local spectrum information and interact with multi-frequency scheduling in each node. A local coordination scheme is presented to support flow redirection at an intersecting node and distribute heavy multi-frequency workload to its neighborhood. We prove the correctness and effectiveness of the protocol by thorough simulations, and find that the proposed solution provides good adaptability to varying spectrum distribution. The end-to-end delay when adaptive relay is cooperating with routing protocol outperforms traditional bare-routing solutions.     

基于统计网络演算的端到端时延上界研究

为分析融合网络端到端统计时延性能,根据最小加代数理论中的统计网络演算相关知识,提出了一种改进的统计服务曲线并应用GPS调度系统模型,然后利用网络演算理论求解串型网络节点统计时延上界。数值分析结果表明,改进的调度模型有效改善了自相关特性对时延上界所造成的影响,比未改进的模型相比统计时延上界更具有良好的紧致性,为在融合网络环境中对端到端节点延迟上界研究提供有效控制、调度和管理具有一定的参考价值。     

Wavelength channel minimization-based energy-aware mechanism in a multichannel EPON

We propose an energy-aware mechanism (EAM) applicable to the multichannel Ethernet Passive Optical Network that can minimize the number of wavelength channels used and save energy. Wavelength channel minimization is processed by collecting the information such as request message, allocated grant, and start time of each optical network unit (ONU) transmission in the previously elapsed scheduling cycles and comparing it with the buffer occupancy and packet delay conditions of the ONUs required by the user’s quality-of-service requirement. They are exchanged between the optical line terminal (OLT) and the ONUs via the multipoint control protocol. In this way, at the beginning of each scheduling cycle, the ONU’s buffer occupancy and packet delay conditions can be evaluated, and then, the OLT decides the smallest number of wavelength channels to be used in the current scheduling cycle. By turning off the OLT receivers corresponding to the unused wavelength channels, the OLT can save energy. The performance of the proposed EAM was evaluated through simulations using nonjoint off-line dynamic bandwidth allocation and dynamic wavelength assignment algorithms. The results showed that the OLT receivers’ power consumption could be reduced by 48 % on average.     

Bound analysis for WRR scheduling in a statistical multiplexer with bursty sources

Among various cell scheduling schemes for ATM networks, weighted round‐robin (WRR) seems a promising algorithm for explicit bandwidth allocation [15]. In this paper, we present a method for analyzing a discrete‐time queueing model of a statistical multiplexer with contiguous slot assignments, deterministic vacations, and bursty input sources, which serves as a bound analysis for WRR scheduling in ATM networks. Similar models have been studied as well in the context of TDMA (time division multiple access) schemes with multiple contiguous slots assigned per frame [3,16]. For the model under study, after establishing an expression for the probability generating function (pgf) of the system contents, we derive closed‐form expressions for performance measures such as the expected value, and an asymptotic approximation for the tail probabilities of the system contents distribution. Also, after examining the cell delay, we formulate the pgf of the cell delay in a closed form in terms of the system contents pgf. The numerical results obtained for the system contents and cell delay distributions illustrate that they match with simulation results extremely well, especially in the low probability area. We also discuss the impact of the slot assignment cycle of WRR on the system performance. This revised version was published online in June 2006 with corrections to the Cover Date.