基于Bloom Filter和概率分发队列的P2P网络快速查找算法

无结构化P2P网络资源定位过程中的响应时间、查准率及覆盖率难以同时被优化。提出一种面向有向无环随机网络的基于Bloom Filter和概率分发队列的快速查找算法BFPDQ(Bloom Filter and Probabilistic Distribution Queue),它用Bloom Filter表达和传递节点命中资源信息及查找请求信息,计算新查询消息与历史查询消息Bloom Filter语义向量相似度,并应用底层网络路径性能信息指导上层转发决策。概率分发队列(Probabilistic Distribution Queue,PDQ)把传统walkers表示成为查找消息分发队列,查找请求者协调各分发队列的查找方向和深度,并融合各队列查找过程中得到的定位消息。仿真实验表明,BFPDQ算法在保持较少冗余信息的同时有效缩短了响应时间。     

一种可靠可伸缩组通信系统设计与实现

组通信系统是支持一致性和容错的分布式协同系统中非常重要的组成部分.为了满足大规模协同应用的需求,文中采用了基于流言的协议与确定性协议组合的方法设计并实现了一种可靠可伸缩组通信系统SGCS.该系统主要包括可靠消息传输服务与组成员管理服务,其中基于流言的可靠多播协议和确定的消息恢复、流量控制、排序协议的组合,基于流言的失败检测协议与确定的视图一致化协议的组合以及乐观虚同步机制应用使系统具有良好的可伸缩性、可靠性和灵活性.     

基于RS纠删码的无线传感器网络信息分发协议性能评价

无线传感器网络中,传感器节点的能量、存储和计算能力有限,且无线传感器网络具有数据链路不对称、拓扑易变化等特点,设计节能可靠的网络协议是困难的。设计良好的网络协议不仅能降低网络的负载,还有助于节省传感器节点的能量,从而延长网络的生存周期。在无线传感器网络操作系统TinyOS平台上实现了基于RS纠删码的信息分发协议,并理论分析了在单跳情况下的协议性能,最后在仿真环境TOSSIM上模拟比较了在多跳、多路径情况下该信息分发协议和洪泛分发协议的性能。模拟仿真表明,提出的基于RS纠删码的信息分发协议明显减少了发送方发送数据包的数量,同时提高了节点的报文接收率,从而达到了降低网络能耗的目的。     

基于MQTT协议的轻量化文本信息分发技术研究

随着卫星通信网络的发展,基于卫星通信网络实现手机、平板电脑等移动通信设备之间的通信成为研究的热点。由于其采用无线电波进行信号传输,且需要经过多个中继站进行信号的转发和处理,导致存在网络延时大、丢包率高以及信道狭窄等问题。针对文本信息在卫星通信网络下的分发过程存在效率低下、可靠性不高的问题,设计一种基于MQTT(Message Queuing Telemetry Transport)协议的轻量化文本信息分发技术。该技术使用MQTT协议作为消息传输协议,在文本信息分发前对MQTT协议进行主题设计、发布订阅机制设计、设备连接设计以及设备心跳设计,确保设备之间的连通性;在文本信息的分发过程中,设计数据校验加密算法、文本信息轻量化处理方法和离线消息存储机制,保证文本信息分发的安全性、可靠性。实验结果表明：相较于传统的基于JSON数据的文本信息分发技术,该技术在提高文本信息分发效率的同时,可确保信息分发的安全性、完整性和稳定性。     

无线传感网中基于自适应概率广播的数据保存

对于部署在恶劣环境中且无法放置Sink节点的无线传感器网络,节点的能量有限且易于损坏.每个节点为了避免自己死亡后数据丢失,需要将数据分发到网络中其他一部分节点上进行保存.但是,由于节点只知道自己邻居的信息,同时存储容量有限,因此如何有效地进行数据分发和存储是一个具有挑战性的问题.提出一个基于自适应概率广播的数据保存协议APBDP来解决这个问题.在APBDP中,节点通过一种自适应的概率广播机制分发数据,这种机制不仅可以使所有节点接收到数据包,而且能有效地减少数据的冗余传输以节省节点能量.此外,节点利用LT码来对数据进行编码存储,所有节点完成数据的分发和存储后,数据采集者只需要访问少量的节点就能恢复出所有的源数据.理论分析和实验表明,APBDP不仅具有较高的解码性能,而且能量有效.     

基于秘密共享的无线传感器网络组密钥管理方案

提出了一种基于秘密共享的无线传感器网络组密钥管理方案,简称为GKMSSS.GKMSSS在采用LEACH协议进行网络分簇的基础上,利用秘密共享和对称密钥加密的原理,将组密钥分量分布式存储在各个组成员中,成功实现了密钥的预配置、层次密钥的生成、网络的分簇、密钥的生成与分发、密钥的更新、组新成员的加入和组成员的退出等关键过程.通过相关分析和实验表明,在保证存储开销和通信开销在可接受范围之内的情况下,有效保障了组通信的前向保密性、后向保密性以及抗串谋攻击,且有较好的节点抗俘虏能力.     

RMP:一种具有高可伸缩性的随机成员协议

针对组播通信协议中所使用的成员协议的伸缩性差的问题,提出了一种新的随机成员协议(RMP).RMP通过使用随机的响应组成员的加入请求,建立一个每个节点仅仅维护logcN个其它成员信息的连接图,并可以为可靠的报文扩散提供基础.文中对RMP的算法在数学上进行了分析,并通过仿真进行验证,结果表明,RMP是一种具有很强可伸缩性的成员协议.     

一种动态多播组成员管理策略的研究

在研究了多播组成员管理协议以及当今多播路由协议的基础上,依据延迟休假队列模型提出了一种新型动态组管理策略.在一个网络中,尽管在某一时间范围内一个特定的组成员数量为0时,多播路由器不是简单地把该多播组从多播路由器中分离,而是采取一种智能的相关因子的方式决定多播路由器是否从特定的多播组中分离,从而可以减少在组成员维护时的代价.应用随机服务系统理论对该策略进行了建模并进行了理论分析.     

IPv6组播环境中实时信息分发系统的研究

针对实时信息分发以及传输的要求,以IPv6作为消息底层主要通信平台,构建了IPv6组播环境中的实时信息分发系统,系统主要包括信源接入、分发控制以及信息分发三个部分.通过累计确认以及扩展确认相结合的方式,给出了分发客户端和分发服务器端的信息处理流程,提出了一种基于可靠数据组播传输的分发方法,并对该方法进行了性能分析,通过一个应用实例实现了可靠的、高效的、可扩展的实时信息分发服务.     

车用自组网自适应单跳广播协议

在车用自组织网的单跳广播协议中,隐藏/暴露节点是影响广播信息成功分发的关键因素,媒体接入控制层的竞争窗口是影响吞吐量性能的关键因素.首先建模分析广播信息成功接收率、吞吐量与节点密度、竞争窗口之间的关系,然后针对车用自组织网的节点密度动态变化特征提出基于多目标优化的自适应可靠单跳广播协议.仿真研究结果表明,该协议通过自动调整节点竞争窗口可以在保证广播信息可靠分发的同时优化网络吞吐量.     

Probabilistic flooding in stochastic networks: Analysis of global information outreach

This article investigates probabilistic information dissemination in stochastic networks. The following problem is studied: A source node intends to deliver a message to all other network nodes using probabilistic flooding, i.e., each node forwards a received message to all its neighbors with a common network-wide forwarding probability ω. Question is: what is the minimum ω-value each node should use, such that the flooded message is obtained by all nodes with high probability? We first present a generic approach to derive the global outreach probability in arbitrary networks and then focus on Erd?s Rényi graphs (ERGs) and random geometric graphs (RGGs). For ERGs we derive an exact expression. For RGGs we derive an asymptotic expression that represents an approximation for networks with high node density. Both reliable and unreliable links are studied.     

一种基于第三方认证的无线组密钥协商协议*

提出一种基于第三方认证的组密钥协商协议,用于在无线Mesh网络环境下的移动用户间的协同工作。经过安全性分析和性能分析得出,新协议不仅可以对组用户提供私密性保护,而且协议参与者的身份得到认证,此外,每个成员的计算成本和通信量显著降低,提高了协议的执行效率。因此,该协议是无线Mesh网络环境下的一种新型、可靠的组密钥协商协议。     

Refinement-oriented probability for CSP

Jones and Plotkin give a general construction for forming a probabilistic powerdomain over any directed-complete partial order [Jon90, JoP89]. We apply their technique to the failures/divergences semantic model for Communicating Sequential Processes [Hoa85].The resulting probabilistic model supports a new binary operator, probabilistic choice, and retains all operators of CSP including its two existing forms of choice. An advantage of using the general construction is that it is easy to see which CSP identities remain true in the probabilistic model. A surprising consequence however is that probabilistic choice distributes through all other operators; such algebraic mobility means that the syntactic position of the choice operator gives little information about when the choice actually must occur. That in turn leads to some interesting interaction between probability and nondeterminism.A simple communications protocol is used to illustrate the probabilistic algebra, and several suggestions are made for accommodating and controlling nondeterminism when probability is present.All authors are members of the Programming Research Group; McIver and Seidel are supported by the EPSRC.0     

Efficient and adaptive epidemic-style protocols for reliable and scalable multicast

Epidemic-style (gossip-based) techniques have recently emerged as a class of scalable and reliable protocols for peer-to-peer multicast dissemination in large process groups. However, popular implementations of epidemic-style dissemination suffer from two major drawbacks: 1) Network overhead: when deployed on a WAN-wide or VPN-wide scale, they generate a large number of packets that transit across the boundaries of multiple network domains (e.g., LANs, subnets, ASs), causing an overload on core network elements such as bridges, routers, and associated links. 2) Lack of adaptivity: they impose the same load on process group members and the network even under reduced failure rates (viz., packet losses, process failures). In this paper, we describe two protocols to address these problems: 1) a hierarchical gossiping protocol and 2) an adaptive dissemination framework (for multicasts) that allows use of any gossiping primitive within it. These protocols work within a virtual peer-to-peer hierarchy called the leaf box hierarchy. Processes can be allocated in a topologically aware manner to the leaf boxes of this structure, so that protocols 1 and 2 produce low traffic across domain boundaries in the network and induce minimal overhead when there are no failures.     

An adaptive epidemic information dissemination model for wireless sensor networks

We propose an adaptive bio-inspired information dissemination model that exploits the specific characteristics of the sampled/generated data stream (DS) in a wireless sensor network. Our model extends the basic epidemic algorithm by adapting key operational parameters (i.e., the forwarding probability and validity period) of the data dissemination process. The main idea is that the forwarding probability is tuned according to the variability of the involved DS. Our findings from the introduction of this adaptive epidemic are quite promising. Our scheme supersedes conventional probabilistic information dissemination algorithms in terms of efficiency and reliability.     

McTorrent: Using multiple communication channels for efficient bulk data dissemination in wireless sensor networks

This paper presents McTorrent, a reliable bulk data dissemination protocol for sensor networks. The protocol is designed to take advantage of multiple radio channels to reduce packet collisions and improve the latency of large object dissemination. We evaluated the performance of McTorrent via detailed simulations and experiments based upon an implementation on the TinyOS platform. Our results show that in comparison to Deluge, the de facto network reprogramming protocol for TinyOS, McTorrent significantly reduces the number of packet transmissions and the amount of time required to propagate a large data object through a sensor network.     

能量驱动的移动Ad Hoc网络概率组播路由协议

在ODMRP协议中，由于采用周期性地广播Join-Query包来更新成员信息和路由信息，因此网络中流动着大量平凡的Join-Query控制包，造成网络开销增大，网络拥塞。采用能量驱动的概率转发的方法，根据每个节点的能量资源信息为每个节点设置相应的转发投递概率，抑制网络中的Join-Query控制包。模拟结果显示，能量驱动的MANET概率组播路由协议(p-ODMRP)在投递率满足需求的情况下，网络的控制开销减小20%左右，增加了网络寿命，协议的综合性能有明显提高。     

A novel adaptive protocol for lightweight efficient multicasting in ad hoc networks

In group communications, we find that current multicast protocols are far from “one size fits all”: they are typically geared towards and optimized for particular scenarios. As a result, when deployed in different scenarios, their performance and overhead often degrades significantly. A common problem is that most of these protocols incur high overheads with a high density of group members and in high mobility. Our objective is to design a protocol that adapts in response to the dynamics of the network. In particular, our objective is to provide efficient and lightweight multicast data dissemination irrespective of the density of group members and node density. Our work is motivated by two observations. First, broadcasting in some cases is more efficient than multicasting. Second, member and node layout distributions are not necessarily homogeneous. For example, many MANET applications result in a topological clustering of group members that move together. Thus, we develop Fireworks, an adaptive approach for group communications in mobile ad hoc networks. Fireworks is a hybrid 2-tier multicast/broadcast protocol that adapts to maintain performance given the dynamics of the network topology and group density. In a nutshell, our protocol creates pockets of broadcast distribution in areas with many members, while it develops a multicast backbone to interconnect these dense pockets. Fireworks offers packet delivery statistics comparable to that of a pure multicast scheme but with significantly lower overheads.     

无线体域网中基于时隙滑动窗口的概率路由协议

无线体域网(Wireless Body Area Network,WBAN)不仅应用于医疗保健领域,而且在特殊人群监护、运动、娱乐以及军事等领域也有着巨大的应用价值,然而WBAN技术自身的特点将严重影响数据传输的可靠性,如何设计一个可靠的路由协议成为一个具有挑战性的工作。基于时隙滑动窗口提出了一种概率路由协议,提高了数据包传递的可靠性并减少了网络延迟。在VS2012上用C#语言对该路由算法进行实现,结果证明,在概率路由协议中加入时隙滑动窗口确实能够提高网络的可靠性。     

RMP：一种具有高可伸缩性的随机成员协议

针对组播通信协议中所使用的成员协议的伸缩性差的问题，提出了一种新的随机成员协议(RMP)。RMP通过使用随机的响应组成员的加入请求，建立一个每个节点仅仅维护logN个其它成员信息的连接图，并可以为可靠的报文扩散提供基础。文中对RMP的算法在数学上进行了分析，并通过仿真进行验证，结果表明，RMP是一种具有很强可伸缩性的成员协议。