无线传感器网络二阶一致性时间同步

考虑到在无线传感器网络中,新节点的加入或老节点的死亡均会导致拓扑呈动态变化,该文研究一种完全分布式二阶一致性时间同步(Second-Order Consensus Time Synchronization, SOCTS)算法。将节点的时钟特性建模成二阶状态方程,按照伪同步周期广播节点的本地虚拟时间,根据邻居节点的本地虚拟时间的不一致来构造同步控制输入;通过坐标变换将网络的一致性时间同步问题转化为变换系统的稳定性问题,理论分析了SOCTS算法的收敛性和收敛条件,并研究了影响SOCTS算法收敛速度的因素。通过数值仿真实验验证了所提方法的有效性。     

无线传感器网络的时间同步算法分析

当前移动通信领域对于无线传感器网络的研究正在逐渐加深,时间同步技术是WSN应用中的支撑技术,是无线网络传感器网络研究中的重中之重。然而传统的同步方法NTP和GPS因为尺寸、代价、能量问题、复杂度等因素并不适用于传感器网络,而且传感器网络自身的体积与能量受限等特点给时间同步计算也增加了一定的难度,为了使无线传感器网络的应用潜力得到最大限度的发挥,对时间同步技术的研究就显得尤为必要。文章从无线传感器网络时间同步和相关问题入手,重点介绍了影响时间同步的关键因素、无线传感网络节点时间校正的几项基本技术以及具体的计算方法。     

Time Synchronization for Cooperative Communication in Wireless Sensor Networks

Time synchronization is crucial for the implementation of cooperative communication in wireless sensor networks. In this paper, we explore the effect of synchronization error on cooperative communication utilizing distributed Alamouti code. The analysis and simulation results show that small synchronization error has negligible effect on bit error rate (BER) performance. In order to synchronize the distributed sensor nodes within an acceptable error, we propose a physical layer synchronization scheme. This scheme consists of an initial synchronization of the cooperative transmitters, synchronization error estimation at the cooperative receiver and finally a feedback phase. A maximum likelihood method is proposed to make the synchronization error estimation. It achieves better performance than the matched filter method at the price of moderate increase in computational complexity and memory space. Two strategies after synchronization error estimation have been analyzed. They provide better BER performance in the existence of initial synchronization error. They are practical to be implemented in the sensor nodes before the Alamouti decoding.     

WSN时间同步算法研究

WSN时间同步技术是WSN许多关键技术实现的基础。阐述了当前较为主流的RBS算法、DMTS算法、LTS算法、TPSN同步算法、基于连通支配集的全局时钟同步算法等时间同步算法,并分析、比较了它们的优缺点。     

一种低功耗的多跳无线传感网时间同步算法

高精度低功耗的时间同步对于无线传感网络至关重要,文中重点分析了高精度时间同步算法,发现其在多跳网络时间同步过程中由于每跳范围内所有节点均要广播时间同步包,会产生大量的冗余信息。为降低同步功耗,提出了一种新方法,通过调节发射功率,筛选出每一跳范围内的周边节点,使其完成下一跳范围的时间同步,而非周边节点只接受却不发送时间同步包。最后,针对改进的算法在OMNet++上进行了仿真实验,仿真结果表明,改进后的算法能够有效地降低全网能量消耗。     

无线传感器网络能量有效时间同步算法研究

针对无线传感器网络中随着节点数目增多,传统的参考广播同步算法网络开销非常大的问题,该文提出一种能量有效的参考广播同步算法。该算法首先只对不相邻的两个接收节点在多个参考广播消息的条件下求平均相位偏差,并且对计算得出的相位偏差进行最大后验估计;其次采用最小二乘线性回归方法周期性地拟合时钟偏移,完成同步过程。仿真结果表明,能量有效的参考广播同步算法在同步精度方面有所改进的同时,有效减少了无线传感器网络的能量消耗。     

无线传感器网络典型时间同步技术分析

从无线传感器网络特点出发,结合三种时间同步模型及已有的时间同步算法,根据评价时间同步算法性能的指标,对典型的时间同步算法性能进行了分析评估,为进一步改进时间同步算法的性能提供了帮助     

SANSync: An Accurate Time Synchronization Protocol for Wireless Sensor and Actuator Networks

Wireless Personal Communications - Wireless sensor and actuator networks (WSANs) consists of a large number of sensors and a relatively small number of actuators connected through wireless links....     

自适应高效无线传感器网络时间同步优化算法

针对无线传感器网络全网多跳自适应时间同步效率低的问题,在接收端与接收端同步模型基础上,该文提出一种自适应高效无线传感器网络时间同步优化算法(AEO)。首先,双节点同步时,从节点接收来自参考节点的同步消息并进行确认,在同步周期结束后通过拟合估计和数据更新完成时间修正,构建交互参数同步包,并与主节点进行信息交换完成同步过程。其次,全网同步时,建立Voronoi多边形拓扑结构,认定拓扑结构中参考节点和邻域节点身份(ID),参考节点覆盖区域间通过邻域节点交换同步信息,实现自适应多区域节点联合时间同步。仿真结果表明该算法在双节点时间同步中能够保证同步误差较小,网络能耗较低;同时,Voronoi拓扑相较于其他典型拓扑,在连通效率和收敛时间方面均有所改进。     

一种无线传感器网络的协作时间同步方法

传统的基于分组消息交换的无线传感器网络(WSN)同步方式很难做到同时兼顾同步精度和能耗.本文提出了一种基于分组消息交换的协作时间同步方法(CTS):对同步分组信息交互过程进行分析得出,协作中继的引入不会改变同步精度.通过协作中继对收发两端的同步分组信息进行接收转发来降低发射功率、降低能耗.理论分析和计算机仿真都表明在不降低同步精度的前提下,通过引入协作中继能达到降低能耗的目的,在视距信道模型中最大可达到4倍能耗效率.     

一种适用于无线传感器网络的 高效节能广播机制

 针对无线传感器网络结点体积小、内存与计算能力小、靠电池供电、结点密度高以及网络规模大的特点,提出了高效广播协议(EBP,Effective Broadcast Protocol).通过对广播过程中一个结点转播之后其邻域内其它结点的转播,即引发新转播的讨论,完成了对最佳引发新转播的分析.EBP广播协议以此为依据选择转播结点,不需要任何邻结点信息就可以高效完成广播,算法的控制开销和存储开销大大降低.EBP广播机制简单有效,在无线传感器网络中具有良好的扩展性.     

基于无线传感器网络时间同步MAC协议研究

针对S-MAC协议中不同虚拟簇边界节点的帧的监听时隙不同,提出了在每个节点中保存一个调度表列表,设计创建生成树同步算法。根据优先级标准,在虚拟簇边界节点上进行调度取舍,实现调度的全网同步,完成虚拟簇的合并,消除边界节点,从而解决边界节点能耗过快的问题。仿真结果表明,相比于原有协议,改进后的协议减少网络能耗,降低了数据传输时延。     

A Distributed Multi-competitive Clustering Approach for Wireless Sensor Networks

Wireless sensor networks (WSNs) need simple and effective approaches to reduce energy consumption because of limited energy. Clustering nodes is an effective approach to make WSNs energy-efficient. In this paper we propose a distributed multi-competitive clustering approach (DMCC) for WSNs. First, the nodes with high residual energy are selected to act as cluster head candidates (CHCs). Second, cluster heads (CHs) are selected from the CHCs based on a hybrid of competition. If the distances to the selected CHs are suitable, a CHC with more neighbor nodes and smaller average distance to its neighbor nodes is more likely to become a CH. If the number of CHs selected from the CHCs is insufficient, more CHs are selected from non-CHCs continually according to residual energy until the CHs number is suitable. DMCC makes the CHs number stable and distribute the CHs evenly. Simulation experiments were performed on to compare DMCC with some related clustering approaches. The experimental results suggest that DMCC balances the load among different clusters and reduces the energy consumption, which improves the network lifetime.     

An Efficient Grid-Based Pairwise Key Predistribution Scheme for Wireless Sensor Networks

Research on wireless sensor networks (WSNs) has been receiving a lot of attention recently. Because of the constraints on the cost of hardware, there are a lot of restrictions regarding memory, computational ability, and energy consumption, hampering WSN research. So far, many key establishment schemes have been proposed for WSNs. For the proposed schemes, random key predistribution is a practical solution. With this, each sensor shares a common key with its neighbors via predistributed keys. However, it may happen that two sensor nodes do not share a common key. In this paper, an efficient grid-based pairwise key predistribution scheme for WSNs is proposed. In the proposed scheme, multiple polynomials for each row, each column, and each diagonal in the grid are constructed. Then, each sensor node in each row, column, and diagonal in the grid establishes a pairwise key with the other node using the predistributed symmetric polynomial. Simulation results demonstrate the effectiveness of the proposed scheme in increasing the probability of establishing pairwise keys and reducing communication overhead.     

无线传感器网络分布式一致时间同步协议的收敛分析及加速设计

该文研究了基于分布式一致的无线传感器网络时间同步协议的收敛和加速问题。通过将其同步迭代过程映射到马尔可夫链的状态转移过程,推导出了分布式一致时间同步协议在循环网中的收敛速度与节点邻居数和网络规模有关。Matlab仿真实验表明该结论对类均匀规则网和类均匀网也是正确的。此外,对于类均匀网,邻居数分布也会影响协议的收敛速度。因此该文提出了基于改变网络邻居数分布的加速算法来提高分布式一致时间同步协议的收敛速度。规模为100个节点的类均匀网络实验结果表明,该文提出的加速算法在没有显著改变节点平均传输半径的情况下可使分布式一致时间同步协议的收敛迭代次数降低约25%。     

Fast Response PKC-Based Broadcast Authentication in Wireless Sensor Networks

Public Key-based (PKC) approaches have gained popularity in Wireless Sensor Network (WSN) broadcast authentication due to their simpler protocol operations, e.g., no synchronization and higher tolerance to node capture attack compared to symmetric key-based approaches. With PKC??s security strength, a sensor node that authenticates messages before forwarding them can detect a bogus message within the first hop. While this prevents forged traffic from wasting the sensor nodes?? energy, performing PKC operations in the limited computing-power sensor nodes can result in undesirably long message propagation time. At the other extreme, the sensor node can forward messages to other nodes prior to authenticating them. This approach diminishes propagation time with the trade-off of allowing forged messages to propagate through the network. To achieve swift and energy efficient broadcast operation, sensor nodes need to decide wisely when to forward first and when to authenticate first. In this paper, we present two new broadcast authentication schemes, called the key pool scheme and the key chain scheme, to solve this dilemma without any synchronization or periodic key redistribution. Both schemes utilize a Bloom filter and the distribution of secret keys among sensor nodes to create fast and capture-resistant PKC-based broadcast authentication protocols. Our NS-2 simulation results for a 3,000-node WSN confirm that broadcast delays of our protocol are only 46.7% and 39.4% slower than the forwarding-first scheme for the key pool and the key chain scheme respectively. At the same time, both protocols are an order of magnitude faster than the authentication-first scheme. The key pool scheme is able to keep forged message propagation to the minimal even when the majority of the nodes have been captured by the attacker. The key chain scheme has smaller transmission overhead than the key pool scheme at the expense of less resistance to node capturing. Two generic improvements to these schemes are also described. One reduces the marking limit on the Bloom filter vector (BFV), which makes it more difficult for an attacker to forge a BFV for a bogus message. The other limits broadcast forwarding to a spanning tree, which reduces the number of nodes forwarding bogus messages by one to two orders of magnitude depending on the percentage of compromised nodes. The first improvement can be applied to any BFV scheme, while the second is even more generally applicable.     

Jitter Detection for Synchronization Control in Wireless Multimedia Sensor Networks

Collaborative in-network processing operations in Wireless multimedia sensor networks （WMSNs） often require effective synchronization control. Extensive researches in the traditional networks mainly focus on the synchronization control with the buffer management in the receiver. However, for WMSNs, the chaotic transport channel and low bandwidth introduce serious jitter. Jitter degrades the timing relationship among packets in a single media stream and between packets from different media streams and, hence, creates multimedia synchronization problems. Moreover, too much jitter will also degrade the performance of the streaming buffer. By only employing the buffer management scheme in the receiver, we can hardly satisfy the synchronization requirement of the in-network processing. In this study, we propose an active jitter detection mechanism for the synchronization control in WMSNs. This mechanism will improve the quality of service in multimedia networking by discarding the jitter-corrupted packets immediately and balancing the delay and jitter actively. We implement the proposed scheme in the practical WMSNs platform. The experiment results show that our scheme can reduce the average packet jitter effectively and improve the synchronization controlling performance significantly.