Bulk data dissemination in wireless sensor networks: Modeling and analysis

Wireless sensor networks (WSNs) have recently gained a great deal of attention as a topic of research, with a wide range of applications being explored. Bulk data dissemination is a basic building block for sensor network applications. The problem of designing efficient bulk data dissemination protocols has been addressed in a number of recent studies. The problem of accurately analyzing the performance of these protocols, however, has not been addressed sufficiently in the literature. In this work, we show a way of accurately analyzing the performance of bulk data dissemination protocols in WSNs. Our model can be applied to practical network topologies by use of the shortest propagation path. Our model is accurate by considering topological information, impact of contention, and impact of pipelining. We validate the analytical results through testbeds and detailed simulations. Results show that the analytical results fit well with the testbed results and simulation results. Further, we demonstrate that the analytical results can be used to aid protocol design for performance optimizations, e.g., page size tuning for shortening the completion time.     

WSN中利用蚁群路径优化的时隙选择重排算法

针对无线传感器网络(WSN)汇聚传输中的数据传输时间和功耗问题,提出了考虑时间同步和唤醒延迟的汇聚传输时隙选择重排算法。将时分多址接入(TDMA)用作介质访问协议,并允许每个节点在传输时隙期间可以发送或接收数据;设计新的WSN数据收集树模型,将传感器节点生成的数据通过无线链路形成的多跳网络发送到汇聚节点,在数据收集树的每条链路上分析时隙顺序,优化时隙选择,并基于蚁群算法优化路径选择,减少传输能量消耗和均衡簇头能量。实验结果表明,提出的算法可以实现显著的数据传输性能提高和功耗节约。     

An end-connected dual bus topology for metropolitan area networks

We propose a new topology and the associated medium access protocol for Metropolitan Area Networks (MAN's). The network uses a dual bus with connected ends as the topology. The protocol uses a token passing scheme with destination stripping as the access mechanism. Additional transmissions, referred here as restricted transmissions are also included in the protocol. These transmissions are made possible by the end-connected topology. Using this scheme, a station can make use of even a reserved slot for transmission up to the reserving station on the bus. This mechanism considerably improves the network utilization over those of the conventional Distributed Queue Dual Bus (DQDB) and the Destination Stripping Dual Ring (DSDR) protocols. We carried out simulations to study the utilization and the delay characteristics of the proposed protocol under various network conditions. We demonstrate that the performance of the proposed protocol is much better than that of the DQDB with slot reuse.     

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

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

适用于飞行自组网的闲置时隙预约TDMA协议

在飞行自组网中,固定时隙分配时分多址接入(TDMA)协议存在闲置时隙无法成功使用的问题.通过对TDMA协议引入闲置时隙预约机制,提出一种支持业务优先级传输机制的闲置时隙预约TDMA协议.采用短帧长的方式满足协同与控制业务的低时延传输需求,并利用闲置时隙预约机制允许节点使用闲置时隙传输感知业务,从而满足感知业务的高吞吐量...     

A data collection protocol for real-time sensor applications

The nature of many sensor applications as well as continuously changing sensor data often imposes real-time requirements on wireless sensor network protocols. Due to numerous design constraints, such as limited bandwidth, memory and energy of sensor platforms, and packet collisions that can potentially lead to an unbounded number of retransmissions, timeliness techniques designed for real-time systems and real-time databases cannot be applied directly to wireless sensor networks. Our objective is to design a protocol for sensor applications that require periodic collection of raw data reports from the entire network in a timely manner. We formulate the problem as a graph coloring problem. We then present TIGRA (Timely Sensor Data Collection using Distributed Graph Coloring) — a distributed heuristic for graph coloring that takes into account application semantics and special characteristics of sensor networks. TIGRA ensures that no interference occurs and spatial channel reuse is maximized by assigning a specific time slot for each node. Although the end-to-end delay incurred by sensor data collection largely depends on a specific topology, platform, and application, TIGRA provides a transmission schedule that guarantees a deterministic delay on sensor data collection.     

一种采用时隙对准方式的TDMA自组网同步协议

通过对TDMA方式下的同步协议STS和TISS进行研究,提出一种基于时隙对准方式的TDMA自组网同步协议MFSS。该协议以工作周期为自组网节点之间同步的标准,在节点初入网时采用双向交互和时隙对准方法,消除了传输时延误差和初始时间偏差,从而实现了快速初始同步;随后通过监测过程保证了节点之间产生的时钟漂移误差可自适应控制,同时减小了重新同步带来的开销。仿真结果证明,相比于STS协议和TISS协议,MFSS协议在同步收敛速度、同步精度以及同步开销上都取得了更好的性能。     

区块链网络综述

区块链是典型的分布式系统,底层网络的性能和安全性至关重要.区块链网络的本质是P2P网络,然而在安全模型、传输协议和性能指标等方面与传统P2P网络存在明显差异.首先,针对区块链网络的传输流程进行全面、深入地分析,阐明区块链网络所面临的瓶颈挑战.其次,针对区块链网络拓扑结构和传输协议的最新研究工作,从节点异构性、编码方案、广播算法和中继网络等方面系统性地分类梳理,并归纳总结跨链网络实现和网络仿真工具.最后,探讨区块链网络的未来研究趋势.     

Impact of out-of-sequence processing on the performance of data transmission

Application Level Framing (ALF) was proposed by Clark and Tennenhouse as an important design principle for developing high performance applications. ALF relies in part on the ability of applications and protocols to process packets independently one from the other. Thus, performance gains one might expect from the use of ALF are clearly related to performance gains one might expect from applications that can handle and process packets received out-of-sequence, as compared to application that require in-sequence delivery (FTP, TELNET, etc.). In this paper, we examine how the ability to process out-of-sequence packets impacts the efficiency of data transmission. We consider both the impact of application parameters such as the time to process a packet by the application, as well as network parameters such as network transmission delay, network loss rate and flow and congestion control characteristics. The performance measure of interest are total latency, buffer requirements, and jitter. We show, using experimental and simulation results, that out-of-sequence processing is beneficial only for very limited ranges of transmission delays and application processing time. We discuss the impact of this on the architecture of communication systems dedicated to distributed multimedia applications.     

太赫兹无线个域网高时隙利用率跨PAN数据传输协议

针对现有跨PAN数据传输机制存在的业务量分布不均衡造成的时隙浪费、协调超帧开始时刻不明确、超帧统一机制所需控制开销较大等问题,提出了一种高时隙利用率太赫兹无线个域网跨PAN数据传输机制HTSU-PAN（high time slot utilization cross PAN data transmission protocol for Terahertz wireless personal area network）。该协议通过采用隐式TDMA时隙分配、基于无beacon的空闲时段启用以及基于网桥节点超帧统一这三种新机制,有效提高时隙利用率,降低数据传输时延从而提升网络吞吐量。     

Direction-based adaptive data propagation for heterogeneous sensor mobility

We consider sensor networks where the sensor nodes are attached on entities that move in a highly dynamic, heterogeneous manner. To capture this mobility diversity we introduce a new network parameter, the direction-aware mobility level, which measures how fast and close each mobile node is expected to get to the data destination (the sink). We then provide local, distributed data dissemination protocols that adaptively exploit the node mobility to improve performance. In particular, “high” mobility is used as a low cost replacement for data dissemination (due to the ferrying of data), while in the case of “low” mobility either (a) data propagation redundancy is increased (when highly mobile neighbors exist) or (b) long-distance data transmissions are used (when the entire neighborhood is of low mobility) to accelerate data dissemination toward the sink. An extensive performance comparison to relevant methods from the state of the art demonstrates significant improvements, i.e. latency is reduced by even four times while keeping energy dissipation and delivery success at very satisfactory levels.     

An efficient broadcast scheduling algorithm for TDMA ad-hoc networks

In this paper, we propose an efficient algorithm to find a collision-free time slot schedule in a time division multiple access frame. In order to minimize the system delay, the optimal schedule must be defined as the one that has the minimum frame length and provides the maximum slot utilization. The proposed algorithm is based on the sequential vertex coloring algorithm. Numerical examples and comparisons with the algorithm in previous research have shown that the proposed algorithm can find near-optimal solutions in respect of the system delay.Scope and purposeAn ad-hoc network was introduced in order to apply packet switching communication to a shared radio channel. Using a radio channel as the broadcast medium to interconnect users, an ad-hoc network provides flexible data communication services among a large number of geographically distributed, possibly mobile, radio units. In an ad-hoc network, since all users share a single channel by multiple access protocol, unconstrained transmission may lead to the time overlap of two or more packet receptions, called collision, resulting in damaged useless packets at the destination. Collided packets increase the system delay because they must be retransmitted. Therefore, the transmission for each station must be scheduled to avoid any collision, that is, collision-free transmission should be guaranteed. The time division multiple access (TDMA) technology can be used to schedule collision-free transmission. In this paper, we propose an efficient algorithm to find a collision-free time slot schedule in a TDMA ad-hoc network.     

Evaluation framework for adaptive context-aware routing in large scale mobile peer-to-peer systems

The proliferation of novel wireless network technologies creates new opportunities for complex peer-to-peer information dissemination systems. A key challenge that remains in this area is how to select the best algorithms and protocols to communicate effectively on a large scale. In this paper, we focus in particular on large scale mobile networks where effectiveness depends on the requirements of the application at hand and on the context of the peers in the network. We propose a framework for context-aware adaptive information sharing that allows the evaluation of and comparison with alternative information routing protocols using network metrics to measure a variety of quality attributes of the information dissemination protocols. These metrics can then be used to verify which protocol is best suited for a particular application. We illustrate our evaluation framework with different information dissemination protocols in an inter-vehicle communication scenario.     

高效快速融合的双LAN太赫兹无线局域网MAC协议

为了使两个独立运行的太赫兹无线局域网能快速完成协调融合以及提升融合后网络的性能,提出一种高效快速融合的双LAN太赫兹无线局域网MAC协议——EFC-MAC(efficient and fast convergence of MAC protocols)。首先,针对现有网桥节点选举机制不完善以及网络协调融合机制存在不足之处的问题,提出了在第一个网间节点进行申请入网时就开始进行网桥节点的选举,并将选举结果在下一超帧的BP时段进行通告的机制,并根据网络是否已经完成了协调融合而决定是否申请CTA以转发heartbeat消息的机制,使网络能高效快速完成融合;然后,针对网间节点申请公共时隙方式不够灵活的问题,提出根据P-CTAP所剩时隙量来动态申请CTA的机制,提升了网络的性能;最后,针对网桥节点切换机制尚不明确的问题,提出了采用一个CAP时段长度完成网桥节点切换的机制。仿真结果表明,所提协议有效提高了网络吞吐量,提升了时隙利用率以及降低了数据传输时延。     

基于网络效用最大化与冲突避免的无线传感器网络MAC协议

针对周期汇报型无线传感器网络(WSN)中的无线信号冲突和能量利用效率问题,提出了一种基于网络效用最大化与冲突避免的媒体访问控制(UM-MAC)协议。该协议基于时分多路复用(TDMA)调度机制,将效用模型引入无冲突的节点工作时隙分配过程中,把链路可靠性、网络能耗归纳到一个统一的效用优化框架中;进而提出了一个启发式算法,使网络能够快速找到一个基于网络效用最大化与冲突避免的节点工作时隙调度方案。将UM-MAC协议与S-MAC协议和冲突避免MAC(CA-MAC)协议进行比较,在不同节点数量的网络环境中,UM-MAC获得的网络效用较大,平均数据包成功发送率较高,生命周期介于S-MAC与CA-MAC之间,在不同的网络负载下所有节点发数据包到汇聚节点的平均时延有所增加。仿真实验结果表明:UM-MAC协议较好地解决了冲突干扰问题,提高了网络的数据包成功发送率和能量利用效率等性能;在低网络负载时,TDMA类协议的性能并不比竞争类协议好。     

A Dynamic Performance-Based Flow Control Method for High-Speed Data Transfer

New types of specialized network applications are being created that need to be able to transmit large amounts of data across dedicated network links. TCP fails to be a suitable method of bulk data transfer in many of these applications, giving rise to new classes of protocols designed to circumvent TCP's shortcomings. It is typical in these high-performance applications, however, that the system hardware is simply incapable of saturating the bandwidths supported by the network infrastructure. When the bottleneck for data transfer occurs in the system itself and not in the network, it is critical that the protocol scales gracefully to prevent buffer overflow and packet loss. It is therefore necessary to build a high-speed protocol adaptive to the performance of each system by including a dynamic performance-based flow control. This paper develops such a protocol, Performance Adaptive UDP (henceforth PA-UDP), which aims to dynamically and autonomously maximize performance under different systems. A mathematical model and related algorithms are proposed to describe the theoretical basis behind effective buffer and CPU management. A novel delay-based rate-throttling model is also demonstrated to be very accurate under diverse system latencies. Based on these models, we implemented a prototype under Linux, and the experimental results demonstrate that PA-UDP outperforms other existing high-speed protocols on commodity hardware in terms of throughput, packet loss, and CPU utilization. PA-UDP is efficient not only for high-speed research networks, but also for reliable high-performance bulk data transfer over dedicated local area networks where congestion and fairness are typically not a concern.     

User-level network interface protocols

Modern high speed local area networks offer great potential for communication intensive applications, but their performance is limited by the use of traditional communication protocols, such as TCP/IP. In most cases, these protocols require that all network access be through the operating system, which adds significant overhead to both the transmission path (typically a system call and data copy) and the receive path (typically an interrupt, a system call, and a data copy). To address this performance problem, several user level communication architectures have been developed that remove the operating system from the critical communication path. The article describes six important issues to consider in designing communication protocols for user level architectures. The issues discussed focus on the performance and semantics of a communication system. These issues include data transfer, address translation, protection, and control transfer mechanisms, as well as the issues of reliability and multicast. To provide a basis for analyzing these issues, the authors present a simple network interface protocol for Myricom's Myrinet network, which has a programmable network interface. Researchers can thus explore many protocol design options, and several groups have designed communication systems for Myrinet. The authors refer to 11 such systems, all of which differ significantly in how they resolve these design issues but all of which aim for high performance and provide a lean, low level, and more or less generic communication facility     

基于ZigBee环境监控系统的MAC协议研究

针对环境污染监控系统数据量小、时间间隔长、周期性等缺点,改进IEEE 802.15.4MAC层规范,提出适合环境监测系统的协议emMAC,协议使用MAC层帧的保留位,保持帧长和格式不变,将GTS时隙进行再细分,最多可分为112个时隙,可为每个节点分配一个时隙进行CFP访问,并为提高QoS加入预警发送机制。emMAC保持了与IEEE802.15.4的兼容,通过使用omnet++4.1分析与仿真表明,协议有效的避免了信道冲撞,减少能耗,延长了网络寿命,性能优于802.15.4协议。     

网络层匿名通信协议综述

匿名通信系统是一种建立在应用层之上结合利用数据转发、内容加密、流量混淆等多种隐私保护技术来隐藏通信实体关系和内容的覆盖网络。然而,作为覆盖网络运行的匿名通信系统,在性能和安全保障上的平衡问题上存在不足。未来互联网架构的出现使构建基于基础设施的匿名通信系统成为可能。此类匿名通信系统将匿名设计为网络基础设施服务,通过为路由器配备加密操作,可解决匿名网络的可拓展性和性能限制的部分问题,因此也可称它们为网络层匿名通信协议。对现有的网络层匿名通信协议（LAP、Dovetail、Hornet、PHI和Taranet）进行了研究,介绍了网络层匿名通信协议的分类标准,简述其创新点和具体加密思想,并对它们如何在安全性和性能二者之间的权衡进行分析,也指出了这几种网络匿名通信协议的优势和不足,最后提出在匿名通信系统发展的过程中所面临的挑战和需要深入研究的问题。     

移动实时数据库系统中的更新分发

数据广播作为移动计算环境下有效的数据分发技术已有许多研究,当数据广播用于发送不断更新的数据时称它为更新分发.现有的更新分发协议因没有考虑实时数据库系统中数据和事务的定时要求而不适合移动实时只读事务的处理.重点研究了移动实时数据库系统中更新分发的问题,提出了混合前向多版本数据广播协议,该协议在保证事务一致性的同时满足了数据和事务的定时约束.模拟实验表明,该协议能够有效地降低事务错过率和提高数据流行性,较现有更新分发协议更适合移动实时只读事务的处理.