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.     

Efficient broadcasting in ad hoc wireless networks using directional antennas

Using directional antennas to conserve bandwidth and energy consumption in ad hoc wireless networks (or simply ad hoc networks) is becoming popular. However, applications of directional antennas for broadcasting have been limited. We propose a novel broadcast protocol called directional self-pruning (DSP) for ad hoc wireless networks using directional antennas. DSP is a nontrivial generalization of an existing localized deterministic broadcast protocol using omnidirectional antennas. Compared with its omnidirectional predecessor, DSP uses about the same number of forward nodes to relay the broadcast packet, while the number of forward directions that each forward node uses in transmission is significantly reduced. With the lower broadcast redundancy, DSP is more bandwidth and energy-efficient. DSP is based on 2-hop neighborhood information and does not rely on location or angle-of-arrival (AoA) information. Two special cases of DSP are discussed: the first one preserves shortest paths in reactive routing discoveries; the second one uses the directional reception mode to minimize broadcast redundancy. DSP is a localized protocol. Its expected number of forward nodes is O(1) times the optimal value. An extensive simulation study using both custom and ns2 simulators show that DSP significantly outperforms both omnidirectional broadcast protocols and existing directional broadcast protocols.     

机会分布式空时编码研究

协作分集技术能够在慢衰落无线环境中提供显著的性能增益.在现有的各种协作分集协议中,分布式空时编码是最有代表性的协作协议.但是由于其复杂性较高,实用性的分布式空时编码的研究仍然面临着很大的挑战.提出了一种新颖的基于机会的分布式空时编码协议,不仅复杂度低,而且可以获取和分布式空时编码协议接近的性能.还针对如何根据中继节点的空间分布进行协作协议选择的问题进行了分析.     

Efficient ARQ protocols for exploiting cooperative relaying in wireless sensor networks

Cooperative relaying is an efficient technique to provide diversity in wireless sensor networks. In this paper, we exploit the limited feedback from the destination and propose a novel cooperative ARQ protocol, which combines the incremental relaying and selection relaying schemes. A relay node is requested to repeat the erroneously received packet, instead of the source node. Both simple and hybrid type I ARQ schemes are studied. An analysis model is established to analyze and compare the data link layer performances of different ARQ protocols in slow fading wireless channel. We prove two SNR thresholds of the relay–destination channel, above which the cooperative ARQ protocols have better performances than the traditional counterparts. In addition, the diversity performances of the various protocols are investigated and it is demonstrated that full order diversity (second-order in this case) can be exploited by the proposed cooperative ARQ protocol. Simulation results are given, which verify the theoretical analysis and comparison.     

RMAC: A Reliable MAC Protocol Supporting Multicast for Wireless Ad Hoc Networks

This paper presents a new reliable MAC protocol called “RMAC”supporting reliable multicast for wireless ad hoc networks. By utilizing the busy tones to realize the multicast reliability, RMAC has three novelties： （1） it uses a variablelength control frame to stipulate an order for the receivers to respond, thus solving the feedback collision problem; （2） it extends the usage of busy tone for preventing data frame collisions into the multicast scenario; and （3） it introduces a new usage of busy tone for acknowledging data frames positively. In addition, RMAC is generalized into a comprehensive MAC protocol that provides both reliable and unreliable services for all the three modes of communications： unicast, multicast, and broadcast, making it capable of supporting various upper-layer protocols. The evaluation shows that RMAC achieves high reliability with very limited overhead. RMAC is also compared with other reliable MAC protocols, showing that RMAC not only provides higher reliability but also involves lower cost.     

WSNs中一种新的编码协作通信方式

采用空间分集的方法可以有效地对抗无线信道中的衰落,由于受到体积、重量、成本等因素的限制,在无线传感器网络(W SNs)节点上实现多天线技术较为困难。在W SNs中提出了一种基于π旋转LD-PC码的编码协作通信方式,2个单天线节点通过共享自己的天线,形成了一个虚拟的多天线系统。LDPC码的不同部分通过不同节点的上行链路传输到基站,获得发送分集增益。在相同的系统带宽和发送功率下,与非协作通信方式相比,该编码协作方式可显著提高系统性能。     

基于OFDM的WLAN合作分集系统设计

针对基于正交频分复用(OFDM)的无线局域网(WLAN)的系统容量与抗多径衰落等问题,提出了以合作分集方式实现空间分集的WLAN系统。该系统将具有单一天线的WLAN终端通过网络连接以合作方式形成虚拟天线阵列实现空间分集。给出了放大转发模式、解码转发模式以及这两种模式混合的直接解码转发模式下的系统模型、功率分配方案与终端接收机的设计方案。详细的仿真实验证明了提出的合作分集系统在系统容量与抗多径衰落上具有更优越的性能。     

Performance analysis of broadcast protocols in ad hoc networks based on self-pruning

Self-pruning is an effective scheme for efficient broadcasting in ad hoc wireless networks. In a self-pruning broadcast protocol, a node may not forward a broadcast packet if a certain self-pruning condition is satisfied based on the neighborhood information. In a static network with an ideal MAC layer, only a subset of nodes forward the broadcast packet and still guarantee the complete network delivery. Various protocols have been proposed with different self-pruning conditions. Recently, a generic self-pruning protocol was proposed by Wu and Dai (2003), which combines the strength of previous conditions and is more effective. In this paper, we first propose an enhanced version of the generic protocol, which is more elegant in interpreting existing protocols and has a simpler correctness proof. Then, we evaluate the performance of the family of self-pruning protocols under various network situations with ns2. The objective is to observe the efficiency and reliability of these protocols as a function of network density, congestion, and mobility, and provide a guideline of implementation in the "real world". Our performance analysis reveals that the protocol reliability is barely affected by packet collision. However, most self-pruning protocols suffer from low delivery ratio in highly mobile networks. We further explore various techniques that improve the delivery ratio and show that both high efficiency and reliability can be achieved in highly mobile networks.     

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

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

基于秘密共享的无线传感器网络广播密钥分发协议

在无线传感器网络中,能量消耗主要集中在节点之间的通信上,节点计算所消耗的能量远小于通信所消耗的能量。由于无线传感器网络的"一对多"和"多对一"通信模式,广播是节约能量的主要通信方式。为了保证广播实体和消息的合法性和保密性,必须首先解决无线传感器网络广播密钥安全分发问题。本文在充分考虑无线传感器网络自身特点的基础上,基于Shamir的门限秘密共享方案,提出了椭圆曲线双线性对上的无线传感器网络广播密钥分发协议,并对其进行安全性和性能分析。分析发现,该协议不仅满足安全性要求,同时,能够适合无线传感器网络的特殊应用要求。     

Efficient Dissemination of Transaction-Consistent Data in Broadcast Environments

In this paper, we present a novel protocol for disseminating data in broadcast environments such that view consistency, a useful correctness criterion for broadcast environments, is guaranteed. Our protocol is based on concurrency control information that is constructed by the server and is broadcasted at the beginning of each broadcast cycle. The concurrency control information mainly captures read-from relations among update transactions. A salient feature of the protocol is that the concurrency control information is small in size, but precise enough for reducing unnecessary abortion of mobile transactions. The small-sized concurrency control information implies low communication overhead on broadcasting system. In addition, the computation overheads imposed by the algorithm on the server and the clients are low. We also address the reliability issue of wireless communication and the incorporation of a prefetching mechanism into our protocol. Simulation results demonstrate the superiority of our protocol in comparison with existing methods. Furthermore, we have extended our protocol to deal with local view consistency which requires that all mobile transactions submitted by the same client observe the same serial order of update transactions     

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

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

Dominating sets and neighbor elimination-based broadcastingalgorithms in wireless networks

In a multihop wireless network, each node has a transmission radius and is able to send a message to all of its neighbors that are located within the radius. In a broadcasting task, a source node sends the same message to all the nodes in the network. In this paper, we propose to significantly reduce or eliminate the communication overhead of a broadcasting task by applying the concept of localized dominating sets. Their maintenance does not require any communication overhead in addition to maintaining positions of neighboring nodes. Retransmissions by only internal nodes in a dominating set is sufficient for reliable broadcasting. Existing dominating sets are improved by using node degrees instead of their ids as primary keys. We also propose to eliminate neighbors that already received the message and rebroadcast only if the list of neighbors that might need the message is nonempty. A retransmission after negative acknowledgements scheme is also described. The important features of the proposed algorithms are their reliability (reaching all nodes in the absence of message collisions), significant rebroadcast savings, and their localized and parameterless behavior. The reduction in communication overhead for the broadcasting task is measured experimentally. Dominating set based broadcasting, enhanced by a neighbor elimination scheme and highest degree key, provides reliable broadcast with ⩽53 percent of node retransmissions (on random unit graphs with 100 nodes) for all average degrees d. Critical d is around 4, with <48 percent for ⩽3, ⩽40 percent for d⩾10, and ⩽20 percent for d⩾25. The proposed methods are better than existing ones in all considered aspects: reliability, rebroadcast savings, and maintenance communication overhead. In particular, the cluster structure is inefficient for broadcasting because of considerable communication overhead for maintaining the structure and is also inferior in terms of rebroadcast savings     

一种基于协同分集的无线传感器网络节能MAC协议

节能是无线传感器网络的研究焦点之一,设计能量有效的MAC策略是达到节能目的的一种有效手段.本文结合无线传感器网络中一种节能MAC协议--BMA,引入协同分集技术,提出了一种新的协同MAC协议--CD-BMA.分析和仿真表明,所提协议能够显著提升系统的容量及能量效率等方面性能.     

支持协作通信的MAC协议研究

协作通信被视为一种可以获取空间分集的有效方法。通过协作,单天线的节点可以共享天线组成一个虚拟的多天线系统,以获得更加可靠的数据传输。然而,通信中更多节点的介入不可避免地使得接入访问更加复杂,因此需要重新进行MAC协议的相关研究。介绍了一种支持协作通信的通用框架,并提出了一套协作MAC协议。该协议不仅可以支持各种不同的协作方式,而且可以支持不同个数的中继节点。仿真结果显示,协作MAC协议能够显著提高网络的性能。     

Optimized broadcasting and multicasting protocols in cut-throughrouted networks

This paper addresses the one-to-all broadcasting problem and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Broadcasting is the information dissemination problem in which a node of a network sends the same piece of information to all the other nodes. Multicasting is a partial broadcasting in the sense that only a subset of nodes forms the destination set. Both operations have many applications in parallel and distributed computing. In this paper, we study these problems in both line model, and cut-through model. The former assumes long distance calls between nonneighboring processors. The latter strengthens the line model by taking into account the use of a routing function. Long distance calls are possible in circuit-switched and wormhole-routed networks, and also in many networks supporting optical facilities. In the line model, it is well known that one can compute in polynomial time a [log₂n]-round broadcast or multicast protocol for any arbitrary network. Unfortunately such a protocol is often inefficient from a practical point of view because it does not use the resources of the network in a balanced way. In this paper, we present a new algorithm to compute broadcast or multicast protocols. This algorithm applies under both line and cut-through models. Moreover, it returns protocols that efficiently use the bandwidth of the network. From a complexity point of view, we also show that most of the optimization problems relative to the maximization of the efficiency of broadcast or multicast protocols in terms of switching time or vertex load are NP-complete. We have, however, derived polynomial efficient solutions for tree-networks     

车载自组织网络基于簇的协作MAC协议研究

随着无线通信技术的发展,车载自组织网络(Vehicular Ad Hoc Network,VANET)已经成为一个新型的研究领域。针对VANET中车辆行驶的特征以及车辆间安全信息传输严格的时延限制和高可靠性要求,提出了一种基于簇的协作MAC(CCB-MAC)协议用于安全信息的传输。当在广播期间节点没有接收到安全信息时,被选择的辅助节点重传先前侦听到的安全信息到目的节点,并且重传是在未被预留的时隙中进行的,这将不会中断正常的传输。数值分析和仿真结果表明,CCB-MAC明显提高了安全信息传输成功的概率,降低了传输时延和丢包率。     

无线传感器网络中改进的HeeD路由协议

在无线传感器网络的路由技术中,基于簇的路由算法在拓扑管理、能耗利用、数据融合等方面都有较强的优势。在分析HeeD协议的基础上,提出了HeeD算法存在的问题,并相应地修改了成簇算法,增强了算法的健壮性。同时通过反应式的广播各节点的通信代价,而不是周期性的在每轮初始化阶段广播,大大降低了节点间广播通信代价的次数,节省了网络的整体能耗。仿真结果也证明了改进后的A-HeeD协议相对于HeeD提高了网络的生命周期。     

An Efficient Channel Allocation Technique for Multiple Videos-on-Demand

There are several broadcasting protocols for video-on-demand (VOD). Most of these protocols are tailored to handle the distribution of single video for a specific range of request arrival rates. In order to distribute multiple videos, broadcasting protocols like fast broadcasting (FB), new pagoda broadcasting (NPB) and universal distribution (UD) require more channels that are proportional to the number of hot videos to be broadcast. We present here an efficient broadcasting protocol in which, channel numbers can be reduced when multiple videos are broadcast either simultaneously or asynchronously. During the low to moderate request rates, our protocol performs best as similar to other reactive protocols and saves bandwidth and requires lesser number of channels as compared to other proactive or reactive protocols.     

一种基于局部连通性的增强型车载网多跳广播协议

在车载网中,许多应用都依赖于可靠高效的消息广播。由于无线信道共享介质的特性,消息广播不得不面临广播风暴问题。概率广播是一类能抑制广播风暴的简单有效的方法,然而车载网中除DV-CAST以外的概率广播协议均未考虑稀疏节点场景下的网络分割问题。在分析和验证DV-CAST协议固有缺点的基础上,借鉴其利用局部连通性进行转发决策的思想,提出了一种基于局部连通性的增强型多跳广播协议。实验表明,提出的协议能在稠密节点及稀疏节点场景中均取得较好的可靠性并具有较低开销。