面向RS-485控制网络的Modbus协议扩展及应用

Modbus协议广泛应用于工业控制领域,但其在实践中存在通信安全性差和效率低的问题.对此,分别对协议进行了“身份认证”与“读离散寄存器”功能码扩展.“身份认证”通过区分操作权限,保证通信安全;“读离散寄存器”支持对不连续地址寄存器的访问,提高了通信效率及协议寻址地址分配的灵活性.在基于R5-485的某太阳能光伏发电控制网络中成功应用的实例表明,扩展功能可有效提高协议的通信安全性与效率.     

基于ZigBee电梯无线轿厢通信的实时性优化策略

针对采用数据透明传输的Zig Bee电梯无线轿厢通信存在信息传输滞后、通信效率较低的缺点,阐述三种常用Zig Bee协议栈并分析轿厢通信原理。以Stm32W108芯片为核心的Zig Bee无线模块作为应用平台,提出一种无线轿厢通信的实时性软件优化策略。该策略通过电梯主控制器端的无线模块通过串口端、无线端分别收集询问帧及应答帧,并由其在规定时间内回复电梯主控制器信息,以满足轿厢通信的时间要求,最后提出相关软件的流程设计。经实验表明,该优化策略能满足系统的实时性要求,无线轿厢通信系统的有效通信距离能够达到165 m,满足一般高层建筑的无线轿厢通信的距离要求。     

基于CAN总线的矿用通信分站的研究

针对矿井监测监控和预警系统采用的基于RS485总线的主从式通信方式存在实时性差、通信距离较短的问题,提出了一种基于CAN总线的矿用通信分站的设计方案;详细介绍了该通信分站的硬件及软件设计。该通信分站的CAN总线应用层协议通过对CAN消息ID号和数据的功能定义,实现了紧急数据的及时上传。实验结果表明,该通信分站通信可靠,实时性高,满足煤矿井下的通信要求。     

基于RTP协议的双向语音通信

音频数据的传输对网络的实时性要求很高，如果使用高可靠性的TCP协议就不能满足实时性的要求。该文介绍了一种实时传输协议RTP，并给出了采用该协议进行音频数据实时传输的实现过程及方法。避免了使用传统TCP协议进行语音通信实时性差的缺点，减小了网络延时，改善了语音传输质最。     

有轨电车轨道模块中实时操作系统的应用

该文主要介绍将实时操作系统应用于有轨电车轨道模块控制系统,通过实时系统弥补离散控制系统实时性差的问题。采取基于LPC1700的实时多任务操作系统μC/OS-Ⅱ进行有轨电车轨道模块的通信控制,从而实现了各个模块通信的实时性。     

基于AMT并联混合动力系统的CAN通信设计

针对AMT并联混合动力系统部件组成与通信性能要求,提出了一种双总线CAN拓扑结构的实时性通信解决方案。该方案构建了基于AMT控制器"路由"转发的消息系统,设计了符合TTCAN协议内容的消息时间触发机制,能够满足换档过程整车控制器、AMT控制器、电机控制器、发动机ECU之间数据通信的高实时性要求,实现整车控制器与AMT控制器命令的无缝集成,建立持续可靠的通信连接。     

无线传感器网络MAC协议实时性研究

MAC协议决定着无线信道的使用方式,是保证网络高效通信的关键协议。通过分析无线传感器网络的特点,针对应用需求,讨论影响MAC协议设计的有关问题,研究和比较了当前典型的无线传感器网络MAC协议的主要机制及实时性,展望了无线传感器网络实时MAC协议的进一步研究策略和发展趋势。     

基于CUDA的二维泊松方程快速直接求解

二维泊松方程离散化之后可以转化为一个具有特殊格式的块三对角方程的求解问题,通过对这一结构化线性方程组的研究,提出了一个适用于统一计算架构(CUDA)的泊松方程并行算法.该算法通过离散正弦变化,可以将计算任务划分为若干相互独立的部分进行求解,各部分求解完成后再通过一次离散正弦变换即可获得最终解,整个求解过程只需要两次全局通信.结合GPU的硬件特征进行优化之后,该算法相比CPU上的串行算法可以获得10倍以上的加速比.     

一种基于块分割结构的运动估计新算法

运动估计是剔除视频压缩中的时间冗余的关键,现有算法大都是基于全搜索策略的SAD匹配算法,这些算法虽然压缩性能很好,但计算复杂,实时性差。提出一种快速运动估计新算法,将块分割成多个子块,计算每个子块的灰度值之和与灰度值的平方和,将其整体作为一个参数再结合提出的三个匹配准则,求出当前帧和候选帧之间的最优运动估计。通过实验表明,采用该算法后计算的复杂度明显减小,实时性得到较大提高,其压缩性能却非常接近基于全搜索策略的SAD算法。     

ARP欺骗原理及抵御方案设计

ARP(地址解析协议的英文缩写)欺骗是一种利用ARP协议的漏洞对局域网内主机的通信实施攻击的欺骗行为,本文对ARP协议的工作原理和安全漏洞进行了论述,通过分析ARP欺骗的方式,提出通过在客户端绑定网关和ARP服务器的真实MAC地址、设置ARP服务器和设置主机的ARP请求三个方面来抵御这种欺骗.     

随机需求有时间窗的路径优化及补救策略研究

针对城市物流配送中客户需求量不确定且时效性要求较高的特点,考虑客户需求量为随机变量且有时间窗的车辆路径优化问题,同时基于不同的信息化调度水平,考虑了配送失败时的三种补救策略。构建了机会约束混合整数规划数学模型并转化为等价的确定性模型进行求解。提出了含有多种算子的改进混合进化算法来求解该模型,并基于算例,验证了算法的优越性。同时,对模型的参数敏感性和三种补救策略下的风险成本进行了分析。结果表明,采用提前预测,实时反馈,即时派出新车的补救策略可以最大程度保证满足客户时间约束,同时还具有降低配送路程的经济优势。     

一种航空自组网中带差分服务的跳频MAC协议建模

针对军事航空通信中部分信息传输对时效性和可靠性的严格要求以及传播时延不可忽略的问题,提出一种基于Turbo 编码、猝发技术、异步跳频和优先级区分的媒体接入控制协议(PFH_MAC).通过为高、低两种优先级分组提供不同的排队策略和接入网络权限,以提供差分服务能力.运用Markov 建模、排队理论、组合理论和离散Laplase 变换得到系统各项性能的数学表达式.仿真结果验证了理论推导的准确性及差分服务机制的有效性.     

多选择背包问题离散狼群算法研究

狼群算法是一种通过模拟狼群的捕食行为和猎物分配方式提出的群体智能算法,为求解复杂组合优化问题提供了一种新的思路。目前狼群算法不能解决离散问题,以NP难中的经典问题——多选择背包问题的求解为研究对象,设计了基于离散空间的狼群算法。对于离散空间的狼群算法,通过将人工狼编码,重新设计了狼群的游走、奔袭和围捕过程,并设计了三个过程中的步长。把学习机制引入离散狼群算法,实现了人工狼之间的交流,且确立了自适应步长公式。结果表明：离散狼群算法成功实现了对离散问题的求解,为组合优化问题的求解提供了新方法。     

Penalty Formulations and Trap-Avoidance Strategies for Solving Hard Satisfiability Problems

In this paper we study the solution of SAT problems formulated as discrete decision and discrete constrained optimization problems. Constrained formulations are better than traditional unconstrained formulations because violated constraints may provide additional forces to lead a search towards a satisfiable assignment. We summarize the theory of extended saddle points in penalty formulations for solving discrete constrained optimization problems and the associated discrete penalty method (DPM). We then examine various formulations of the objective function, choices of neighborhood in DPM, strategies for updating penalties, and heuristics for avoiding traps. Experimental evaluations on hard benchmark instances pinpoint that traps contribute significantly to the inefficiency of DPM and force a trajectory to repeatedly visit the same set of or nearby points in the original variable space. To address this issue, we propose and study two trap-avoidance strategies. The first strategy adds extra penalties on unsatisfied clauses inside a trap, leading to very large penalties for unsatisfied clauses that are trapped more often and making these clauses more likely to be satisfied in the future. The second strategy stores information on points visited before, whether inside traps or not, and avoids visiting points that are close to points visited before. It can be implemented by modifying the penalty function in such a way that, if a trajectory gets close to points visited before, an extra penalty will take effect and force the trajectory to a new region. It specializes to the first strategy because traps are special cases of points visited before. Finally, we show experimental results on evaluating benchmarks in the DIMACS and SATLIB archives and compare our results with existing results on GSAT, WalkSAT, LSDL, and Grasp. The results demonstrate that DPM with trap avoidance is robust as well as effective for solving hard SAT problems.     

Hybrid rolling-horizon optimization for berth allocation and quay crane assignment with unscheduled vessels

Port operations usually suffer from uncertainties, such as vessels’ arrival time and handling time and unscheduled vessels. To address this, this study presents a dynamic berth allocation and crane assignment specific problem (BACASP) when unscheduled vessels arrive at the port, which is branded the berth allocation and quay crane assignment specific problem with unscheduled vessels (UBACASP). A rolling-horizon based method is proposed to decompose the UBACASP into a multi-stage static decision BACASP, wherein a rescheduling margin-based hybrid rolling-horizon optimization method is developed by incorporating the event-driven and periodical rolling-horizon strategies as the urgency of dynamic events is evaluated. In each rolling horizon, a mixed integer linear programming model (MILP) is presented for the BACASP to minimize the total port stay time of vessels and the penalties of delays associated with the spatial and temporal constraints, such as the length of continuous berth, number of quay cranes (QCs) and non-crossing of QCs. A discretization strategy is designed to divide the continuous berth into discrete segments, and convert the BACASP to a discrete combinatorial optimization problem, which is efficiently solved by the proposed adaptive large neighborhood search algorithm (ALNS). Case studies with different problem characteristics are conducted to prove the effectiveness of the solution methods proposed in this study. Moreover, the performances of the ALNS and the existing methods for solving the BACASP are compared, and the advantages and disadvantages of different rolling strategies under different degrees of uncertainties are deeply analyzed.     

SAAMAN: Scalable Address Autoconfiguration in Mobile Ad Hoc Networks

Address autoconfiguration is one of the fundamental issues in mobile ad hoc networks (MANET). A node must need some form of identity before participating in any sort of communication. So each host in a MANET needs to be uniquely addressed so that the packets can be relayed hop-by-hop and delivered ultimately to the desired destination. Moreover, nodes in the MANET are free to move and organize themselves in an arbitrary fashion. Therefore any fixed infrastructure based solution for assigning identity (i.e. IP address) is not directly applicable to MANET. Under this infrastructureless and sporadic nature of the mobile nodes, several protocols of address autoconfiguration in the mobile ad hoc networks (MANET) have been proposed. Although some of these protocols perform decently in sparse and small networks, but exhibit poor performance (e.g., single point of failure, storage limitation, large protocol overhead and so on) when the network is either dense or very large. In this paper, we propose an efficient and scalable address autoconfiguration protocol that automatically configures a network by assigning unique IP addresses to all nodes with a very low overhead and minimal cost. Evenly distributed Duplicate-IP address Detection Servers are used to ensure the uniqueness of an IP address during IP address assignment session. In contrast to some other solutions, the proposed protocol does not exhibit any problems pertaining to leader election or centralized server-based solutions. Furthermore, grid based hierarchy is used for efficient geographic forwarding as well as for selecting Duplicate-IP address Detection Servers. Through simulation results we demonstrate scalability, robustness, low latency, fault tolerance and some other important aspects of our protocol.     

Automated verification of responsive protocols modeled by extended finite state machines

Along with advancement of communication systems, the demand for fault-tolerance and real-time performance for communication protocols continues to increase. Communication protocols which perform recovery from any abnormal state to a normal state are called self-stabilizing protocols. However, in these protocols, real-time recovery is not taken into consideration. This paper discusses verification of communication protocols which have self-stabilizing and timeliness properties, which are called responsive protocols.Gouda et al. proposed a mathematical method to prove whether a given protocol specification satisfies the self-stabilizing property. However, this method is not automated and does not verify the timeliness property. This paper thus proposes an automated method for verification of responsive protocols. In this method, communication protocols are modeled by extended finite state machines and their states are represented by predicates. The self-stabilizing property is proven by verifying that sequences of such states which start from an arbitrary abnormal state converge in a normal state. Also, the timeliness property is proven by verifying that the convergence is done within a priori given time.     

一种基于SNMP协议的主代理/子代理通信机制

通过分析采用集中服务模式的SNMP网络管理系统的缺陷以及AgentX框架的基本思想及其通信模型,针对AgentX框架中主/子代理间采用AgentX协议进行通信的不足,提出了一种基于SNMP协议的主/子代理间的通信机制,描述了如何将一个已经实现的SNMP代理扩展成基于SNMP协议通信的主/子代理框架的具体实现方法。     

控制与通信协同设计的新进展

详尽地论述、分析、对比和讨论了网络化控制系统中的控制与通信协同设计问题．通过对该问题国内外研究现状的分析,强调了控制与通信协同设计研究的必要性、重要性和紧迫性,并着重从通信序列及通信协议两个方面阐述了控制与通信协同设计研究领域存在的不足、现有解决策略及主要结果的分析和对比,从而指出该领域急需解决的科学问题、可能的求解方向和今后的发展趋势,并为将来的研究工作提出了有益的建议和参考思路．     

具有完整TCP/IP协议支持的U-Boot

在保护装置中最为稳定的引导程序U-Boot中实现了对该通用调试软件的通信协议的支持。基于U-Boot提供的独立应用开发框架,将独立的具有完整TCP/IP协议支持的lwIP协议栈移植至U-Boot。基于该协议栈以及U-Boot的独立应用开发框架,实现了对通用调试软件的复杂通讯协议的完整支持。经过上述技术改进,极大地扩展了通用调试软件的适用范围,加快了变电站工程实施中遇到的各种装置类似问题的解决速度。