一种用于高速公路上防车辆连环碰撞的V2V广播协议

目前,V2V网络主要通过周期性广播紧急预警消息(emergency warning message,EWM)来解决高速公路上经常发生的连环碰撞事件,但是周期性广播EWM容易产生广播风暴,造成大量消息的传输失败和传输延时,从而影响了预警网络的可靠性和效率.通过研究V2V网络中的各种无线广播协议,提出了一种用于高速公路上防止车辆连环碰撞的广播协议.协议在方向性广播的基础上,通过发送ACK帧选择广播车辆并由广播车辆负责广播EWM来解决广播协议中的EWM冗余问题.仿真实验表明:协议能有效地控制EWM的冗余问题,提高EWM传输的可靠性并降低传输延时.     

自适应紧急消息广播协议在VANET中的应用

车联网VANET(vehicular ad hoc network)被认为是智能交通系统最有前景技术之一,能够提出不同的应用服务,其中安全预警是最为重要的应用.可靠、有效地广播紧急消息是实现安全预警的关键.为此,提出面向不同应用的自适应紧急消息广播DAEMB(different application-self-adaption emergency messages broadcasting)协议.DAEMB协议依据应用的不同特性,采用Reliable和Dissemination两种紧急消息传输模式,并利用非均匀化基于时间和距离的段(segment)策略选择转发节点.仿真结果表明,提出的DAEMB协议平均传输时延、吞时量和紧急消息传输成功率方面具有良好的性能.     

移动自组网络中采用连通支配集的有效广播技术

广播是移动自组网络(MANET)中的一种常用操作.许多移动自组网络的按需路由协议依赖于它来发现任意两个节点之间的路径.广播也是许多MANET应用中发布信息的重要手段.实现广播的直接途径是洪泛(flooding).然而,在没有有效的控制机制下,洪泛将带来严重的消息冗余、传输冲突和碰撞问题.基于图论中的连通支配集(CDS)概念,提出了一种有效的广播途径.它能较大地减小消息的冗余度,同时保持了洪泛的优点.模拟结果表明,提出的广播途径优于一个基于CDS的分布式算法和一个基于簇(cluster)的途径.     

异步多信道无线传感器网络MAC 协议

针对无线传感器网络中控制信道饱和问题以及三重隐终端问题,提出了一种异步多信道MAC协议——RIM(receiver-initiated MAC).RIM利用接收端开始的传输机制有效地解决了控制信道饱和问题,同时采用了基于概率的随机信道选择机制避免了三重隐终端问题.而且,RIM支持一种简单且可靠的异步广播机制.通过基于马尔可夫链的理论分析,得到了RIM中节点的最优占空比.为验证RIM的实际性能,进行了模拟和真实实验.实验结果表明,与其他多信道MAC协议相比,随着信道数及网络负载的增加,RIM增加了网络吞吐量,降低了传输所消耗的能量,同时也提高了广播的可靠性,达到了能量有效的目的.     

车联网中基于模糊逻辑处理的多跳广播协议

多跳广播是车联网中告警消息传播的关键技术之一。在真实环境下,由于车辆的高速移动、网络信号不稳定等若干因素容易造成大量失真数据。现有的多跳广播协议在选择中继转发节点时,往往忽略了失真数据所带来的不良影响,从而导致其实际广播应用效果不佳。综合考虑交通环境下无线网络信号的可靠性、消息传输的实时性及道路交通状况信息,提出了一种基于模糊逻辑处理的广播协议(MBOF),该协议首先采用模糊逻辑选择中继节点,提高广播机制的容错能力,确保告警消息的定向传输,然后通过使用候补转发机制来降低告警消息丢失率。实验结果表明,MBOF协议在容错能力上较相关协议有较大提高。     

一种基于OLSR的传感网络再编程可靠与能量有效传输协议

远程再编程是有效维护和管理部署后传感网络的重要手段,但要求更新的代码可靠且能量有效地传送到网络中的所有节点.提出一种基于OLSR的传感网络再编程可靠与能量有效传输协议,该协议利用ADV消息中的"下次ADV发送间隔"参数t和传输的代码段数C,变传统的ADVREQDATA三次握手顺序传输为ADVDATA两次握手非顺序传输;并从低层OLSR协议形成的MPR集中选择下级广播节点,有效地减少了广播的节点数,从而降低了能量开销;事后还能统计出实际参与代码更新的节点数.性能分析与模拟实验表明:该协议在节点完全更新代码率、平均延时、能量消耗等方面优于传统的PSFQ.     

基于本体的语义Web服务通信协议的研究

在简单介绍语义W eb服务、本体的同时,将本体与通信协议结合,提出建立通信协议本体的概念,并给出协议本体的简单模型。将语义W eb服务中的核心SOAP协议引入到协议本体中,在服务机制中将语义引入消息传输机制,提高服务的灵活性以及适应性。还可减少事务处理中产生的不确定性。     

移动Ad Hoc网络中基于NACK的可靠多播协议

如何采用有效的机制来保证多播数据的可靠传输是移动Ad Hoc网络中的一个难题.针对IEEE 802.11 MAC层进行改进,提出了一种基于使用NACK消息的可靠多播协议,该协议仅当数据分组传输出错时才发送NACK消息要求重传数据.仿真结果表明使用该协议能提高多播路由传输数据的吞吐量,同时降低了平均时延.     

基于WS-addressing构建SOAP消息调用

Web服务寻址定义了一种新的规范,为标准化指定Web服务的位置提供了方法.介绍了Web服务寻址的主要框架,并通过具体的例子详细展示了如何使用WS-addressing规范构建SOAP消息调用;在此基础上进一步分析了基于Web服务寻址实现SOAP消息的异步传输和跨多种协议传输;讨论了Web服务寻址对未来Web服务产生的深远影响.     

无线网络冲突感知广播调度算法*

文章在协议干扰模型下,通过证明、计算、仿真实验等方法,提出了一个冲突感知广播调度算法（简称CBS算法）,以解决无线网络中的广播调度延迟问题。研究结果表明,CBS算法能够保证节点在广播调度过程中不会相互干扰,避免冲突产生;只需发送少量消息,就能完成网络广播调度;能够同时调度广播树中多个层的节点进行传输,有效地提高了网络信道的利用率。仿真实验结果表明,CBS算法能在较短的时间内完成广播调度,有效地降低了广播延迟。     

Consensus-based fault-tolerant total order multicast

While total order broadcast (or atomic broadcast) primitives have received a lot of attention, this paper concentrates on total order multicast to multiple groups in the context of asynchronous distributed systems in which processes may suffer crash failures. “Multicast to Multiple Groups” means that each message is sent to a subset of the process groups composing the system, distinct messages possibly having distinct destination groups. “Total Order” means that all message deliveries must be totally ordered. This paper investigates a consensus-based approach to solve this problem and proposes a corresponding protocol to implement this multicast primitive. This protocol is based on two underlying building blocks, namely, uniform reliable multicast and uniform consensus. Its design characteristics lie in the two following properties. The first one is a minimality property, more precisely, only the sender of a message and processes of its destination groups have to participate in the total order multicast of the message. The second property is a locality property: No execution of a consensus has to involve processes belonging to distinct groups (i.e., consensus is executed on a “per group” basis). This locality property is particularly useful when one is interested in using the total order multicast primitive in large-scale distributed systems. In addition to a correctness proof, an improvement that reduces the cost of the protocol is also suggested     

Atomic broadcast in asynchronous crash-recovery distributed systems and its use in quorum-based replication

Atomic broadcast is a fundamental problem of distributed systems: It states that messages must be delivered in the same order to their destination processes. This paper describes a solution to this problem in asynchronous distributed systems in which processes can crash and recover. A consensus-based solution to atomic broadcast problem has been designed by Chandra and Toueg for asynchronous distributed systems where crashed processes do not recover. We extend this approach: it transforms any consensus protocol suited to the crash-recovery model into an atomic broadcast protocol suited to the same model. We show that atomic broadcast can be implemented requiring few additional log operations in excess of those required by the consensus. The paper also discusses how additional log operations can improve the protocol in terms of faster recovery and better throughput. To illustrate the use of the protocol, the paper also describes a solution to the replica management problem in asynchronous distributed systems in which processes can crash and recover. The proposed technique makes a bridge between established results on weighted voting and recent results on the consensus problem.     

Centralized asynchronous broadcast in radio networks

We study asynchronous broadcasting in packet radio networks. A radio network is represented by a directed graph, in which one distinguished source node stores a message that needs to be disseminated among all the remaining nodes. An asynchronous execution of a protocol is a sequence of events, each consisting of simultaneous deliveries of messages. The correctness of protocols is considered for specific adversarial models defined by restrictions on events the adversary may schedule. A protocol specifies how many times the source message is to be retransmitted by each node. The total number of transmissions over all the nodes is called the work of the broadcast protocol; it is used as complexity measure. We study computational problems, to be solved by deterministic centralized algorithms, either to find a broadcast protocol or to verify the correctness of a protocol, for a given network. The amount of work necessary to make a protocol correct may have to be exponential in the size of network. There is a polynomial-time algorithm to find a broadcast protocol for a given network. We show that certain problems about broadcasting protocols for given networks are complete in NP and co-NP complexity classes.     

Global data computation in chordal rings

Existing Global Data Computation (GDC) protocols for asynchronous systems are round-based algorithms designed for fully connected networks. In this paper, we discuss GDC in asynchronous chordal rings, a non-fully connected network. The virtual links approach to solve the consensus problem may be applied to GDC for non-fully connected networks, but it incurs high message overhead. To reduce the overhead, we propose a new non-round-based GDC protocol for asynchronous chordal rings with perfect failure detectors. The main advantage of the protocol is that there is no notion of rounds. Every process creates two messages initially, with one message traversing in a clockwise direction and visiting each and every process in the chordal ring. The second message traverses in a counterclockwise direction. When there is direct connection between two processes, a message is sent directly. Otherwise, the message is sent via virtual links. When the two messages return, the process decides according to the information maintained by the two messages. The perfect failure detector of a process need only detect the crash of neighboring processes, and the crash information is disseminated to all other processes. Analysis and comparison with two virtual links approaches show that our protocol reduces message complexity significantly.     

A simple and fast asynchronous consensus protocol based on a weak failure detector

Summary. The Consensus problem is a fundamental paradigm for fault-tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to consensus can serve as a basic building block for solving such problems (e.g., atomic commitment or atomic broadcast). Solving consensus in an asynchronous system is not a trivial task: it has been proven (1985) by Fischer, Lynch and Paterson that there is no deterministic solution in asynchronous systems which are subject to even a single crash failure. To circumvent this impossibility result, Chandra and Toueg have introduced the concept of unreliable failure detectors (1991), and have studied how these failure detectors can be used to solve consensus in asynchronous systems with crash failures. This paper presents a new consensus protocol that uses a failure detector of the class . Like previous protocols, it is based on the rotating coordinator paradigm and proceeds in asynchronous rounds. Simplicity and efficiency are the main characteristics of this protocol. From a performance point of view, the protocol is particularly efficient when, whether failures occur or not, the underlying failure detector makes no mistake (a common case in practice). From a design point of view, the protocol is based on the combination of three simple mechanisms: a voting mechanism, a small finite state automaton which manages the behavior of each process, and the possibility for a process to change its mind during a round. Received: August 1997 / Accepted: March 1999     

Broadcast protocols for distributed systems

An innovative approach is presented to the design of fault-tolerant distributed systems that avoids the several rounds of message exchange required by current protocols for consensus agreement. The approach is based on broadcast communication over a local area network, such as an Ethernet or a token ring, and on two novel protocols, the Trans protocol, which provides efficient reliable broadcast communication, and the Total protocol, which with high probability promptly places a total order on messages and achieves distributed agreement even in the presence of fail-stop, omission, timing, and communication faults. Reliable distributed operations, such as locking, update, and commitment, typically require only a single broadcast message rather than the several tens of messages required by current algorithms     

适用于区块链的高效异步拜占庭容错算法

针对现有异步共识算法存在的多轮次通信开销大、随机抽签算法中缺乏信誉机制导致了较多的抽取次数等不足,提出了一种高效的异步拜占庭容错算法PenguinBFT。首先,在广播交易时直接广播原文,降低了共识通信开销;其次,引入了节点信誉评估机制,从网络情况相对稳定的节点集合中选取出块者,以减少随机抽取次数;最后,对网络节点进行分区,在请求交易缺失时,让不同的节点访问不同的分区进行交易恢复,既能减少通信开销又能提升交易恢复效率。实验结果表明,当节点规模达到64时,提出的PenguinBFT算法相较于Honey-BadgerBFT、DumboBFT和DispersedLedger算法,在通信开销、吞吐量和交易确认时延等方面均有50%以上的提升。     

基于WSE和消息队列的异步Web服务研究及实现

针对目前利用RPC方式难以真正实现异步Web服务的问题,提出了一种新的异步Web服务解决方案,即在WSE体系架构下,通过将SOAP协议与消息队列的绑定,完成SOAP消息的异步传递,从而实现Web服务的异步调用。     

面向连接的无线窄带信道传输协议

面向连接的无线窄带信道传输协议是适用于无线窄带广播信道上的链路层组网协议.从一个通信协议设计的角度详细阐述了面向连接的无线窄带信道传输协议帧结构的设计、初始化流程的设计、数据传输流程的设计以及时隙的动态管理机制的设计.从实际效果看:该协议采用了时分复用的传输方式、时隙的动态管理机制以及面向连接的服务等数据通信技术,解决了窄带广播信道数据通信效率低的难题;另外,该协议的设计基于TCP/IP的体系结构,为透明传输IP提供了可靠保障.