A cross-layer transmission scheduling scheme for wireless sensor networks

In a wireless sensor network, the sensor nodes are densely deployed for detecting in many cases. One design challenge for such a network is how to devise a good data fusion algorithm for information retrieval. Noting that the channel state information (CSI) between the cluster head and the sensor nodes will influence the received bit energy noise ratio of the sensor nodes, we propose an optimal data fusion algorithm taking into account the CSI for a one-hop clustered wireless sensor network. On the basis of the fusion algorithm, we consider the redundancy of the sensor deployment and propose a cross-layer transmission scheduling scheme. By selecting proper set of sensor nodes to transmit their local information back in turn, the scheme can prolong the lifetime of the sensor network. The numerical and simulation results show that it can get a good tradeoff between the energy efficiency and the performance.     

无线传感器网络中基于分簇的数据聚合机制

在无线传感器网络(WSNs)中如何有效聚合数据是当前物联网应用中的重要挑战.然而在已有的若干解决方案中,传感器的计算和通信过程消耗了较高的能量,数据的隐私性和完整性得不到有效保障.针对上述问题,提出一种基于分簇的数据聚合机制,采用代数方程计算传感器的中间数据聚合值,采用数字签名进行簇间传感器的身份认证.实验表明:该机制能有效降低传感器计算和通信的耗能,保证数据的隐私性和完整性.     

分簇无线传感器网络多Sink多信道传输方案

针对无线传感器网络(WSNs)在大规模网络应用时出现的问题,通过对 Siphon 协议的研究,提出一个基于分簇网络结构的多 Sink 多信道传输方案,并采用多信道的方法解决簇间传输干扰问题,在保证节点有效利用能量的同时提高 WSNs 的数据传输性能.介绍和分析"漏斗效应"和 Siphon 协议,对平面网络结构和分簇网络...     

基于簇分割的无线传感网数据汇聚方案

为了减少数据汇聚的通信开销,提出一种基于簇分割的无线传感网数据汇聚方案,将簇划分为3个分区,为每个分区指定报告点,分区内与报告点具有相同读数的传感器在数据汇聚时不进行数据发送,减少了簇内数据传输量.分析与实验结果表明,该方案中簇内汇聚所需的通信量低于相关方案,在数据冗余度较高的情况下通信开销下降较为明显.     

一种分区管理的温室传感器网络数据传输技术

基于无线传感器网络能量受限的特点,结合温室的结构特征,从网络结构设计入手,提出一种将温室网络划分成多个子网实现分区管理的数据传输技术。移动汇聚节点部署在温室上方的轨道上,在移动过程中分时地与相应区域内的传感器节点构成星形网络进行数据传输。详细介绍了此方案的网络模型、通信机制,以及其中的重要参数。研究结果表明：此方法与LEACH相比可节省能耗30％以上。     

Fault tolerant data transmission reduction method for wireless sensor networks

World Wide Web - Several theoretical studies have clearly demonstrated that the Dual Prediction Mechanism (DPM) remains the most efficient technique for data reduction in Wireless Sensor Networks...     

Adaptive location updates for mobile sinks in wireless sensor networks

Mobile sinks can be used to balance energy consumption for sensor nodes in Wireless Sensor Networks (WSNs). Mobile sinks are required to inform sensor nodes about their new location information whenever necessary. However, frequent location updates from mobile sinks can lead to both rapid energy consumption of sensor nodes and increased collisions in wireless transmissions. We propose a new solution with adaptive location updates for mobile sinks to resolve this problem. When a sink moves, it only needs to broadcast its location information within a local area other than among the entire network. Both theoretical analysis and simulation studies show that this solution consumes less energy in each sensor node and also decreases collisions in wireless transmissions, which can be used in large-scale WSNs.

一种无线传感器网络的密钥管理机制

介绍了一种用于无线传感器网络(WSNs)的密钥预分配机制:多密钥空间哈希随机密钥预分配(HARPMS)机制。该机制针对group-based节点投放模型,将密钥空间划分成多个子空间,在密钥分配和建立时使用Hash链技术,以提高网络的抗节点俘获能力。分析表明:相比传统的用于group-based投放模型的随机密钥预分配机制,HARPMS获得了同等的连通性,但却有更好的抗节点俘获能力。     

Low latency and energy efficient routing tree for wireless sensor networks with multiple mobile sinks

We propose the minimum Wiener index spanning tree (MWST) as a routing topology that is suitable for sensor networks with multiple mobile base nodes. However, it was proved that finding a spanning tree with the minimum Wiener index from a weighted graph is NP-hard. To address this problem and analyze the effectiveness of the MWST as the routing tree on sensor networks with multiple mobile base nodes, we designed two algorithms: a branch and bound algorithm for small-scale wireless sensor networks and a simulated annealing algorithm for large-scale wireless sensor networks. The simulation results show that MWST outperforms the minimum spanning tree (MST), one of the representative spanning trees used in many routing protocols for sensor networks, in terms of energy efficiency and packet delay.     

无线传感器网络中数据分发方案的研究

无线传感器网络是由大量具有感知、计算和通信能力的能量有限的微型传感器节点组成。为了建立有效的数据传输路径,节约能耗和带宽,延长网络生存期,设计能量有效的数据分发方案是至关重要的。针对无线传感器网络中节点是否可移动的三种情况,分析了目前提出的主要数据分发方案。     

无线传感器网络中一种新的混合密钥管理方法

密钥管理作为传感器网络安全中最为基本的环节,在认证和加密过程中起着至关重要的作用。提出了一种新的混合密钥管理方法。该方案借助于Blom矩阵和混沌序列来完成密钥预分配,使得所有的簇头间、节点间以及节点和它的簇头间都能进行安全通信。分析表明：该方法占用较小密钥存储空间,同时支持网络的拓扑结构的变化,能动态地管理密钥信息,从而解决了密钥泄漏等问题。     

基于标识的无线传感器网络密钥预分配方案

密钥分配是无线传感器网络中极具挑战性的安全问题之一.为了实现无线传感器网络中的安全通讯,需要对传感器结点间传递的信息进行加密.由于受每个传感器结点自身资源的限制,传统网络中使用的密钥分配策略,并不适用于无线传感器网络.提出了基于结点ID的密钥预分配方案,实现了非对称和对称密钥体制、分布式和集中式密钥管理的结合,有效地提高了传感器网络其安全性和连通性.     

Adaptive RSSI-based localization scheme for wireless sensor networks

Range of applications for Wireless Sensor Networks (WSNs) is increasing rapidly. One class of such applications is Energy-Aware Wireless Positioning Systems for situation awareness. Localization deals with determining a target node’s position in WSN by analyzing signals exchanged between nodes. Received Signal Strength Indicator (RSSI) represents the ratio between received signal power and a reference power, and is typically used to estimate distances between nodes. RSSI distance estimations are affected by many factors. This paper aims to enhance the accuracy of RSSI-based localization techniques in ZigBee Networks through studying the communication channel status between two nodes. As the network nodes are exposed to high noise levels, position estimation accuracy deteriorates. A novel adaptive localization scheme is proposed; Two-State Markov model with moving average is employed to detect unpredictable RSSI readings that may reflect badly on the estimation. The proposed scheme achieves better estimation accuracy, for example, the estimation error was reduced from 11.7 m to just 3 m using the proposed scheme.     

DyDAP: A dynamic data aggregation scheme for privacy aware wireless sensor networks

End-to-end data aggregation, without degrading sensing accuracy, is a very relevant issue in wireless sensor networks (WSN) that can prevent network congestion to occur. Moreover, privacy management requires that anonymity and data integrity are preserved in such networks. Unfortunately, no integrated solutions have been proposed so far, able to tackle both issues in a unified and general environment. To bridge this gap, in this paper we present an approach for dynamic secure end-to-end data aggregation with privacy function, named DyDAP. It has been designed starting from a UML model that encompasses the most important building blocks of a privacy-aware WSN, including aggregation policies. Furthermore, it introduces an original aggregation algorithm that, using a discrete-time control loop, is able to dynamically handle in-network data fusion to reduce the communication load. The performance of the proposed scheme has been verified using computer simulations, showing that DyDAP avoids network congestion and therefore improves WSN estimation accuracy while, at the same time, guaranteeing anonymity and data integrity.     

Improvement of assurance including security for wireless sensor networks using dispersed data transmission

Assurance networks are one of the essential technologies of New-generation Networks. Assurance is defined as the capability of guaranteeing functional and non-functional system properties such as dependability, security, timeliness and adaptability to heterogeneous and changing requirements. Assurance is essential for sustainable networks and this research focused specifically on providing assurance for WSNs. Node capture attacks are one prospective kind of attack on WSNs. To reduce negative effect of node capture attacks, we have previously proposed secure decentralized data transfer. In this proposed method, it was assumed that multiple paths were in place. In this paper as well, we again propose using the multipath routing method. To make multiple paths fit our previously proposed method, we have modified ATR (Augmented Tree Based Routing). We have conducted simulation experiments using our proposed method in a network simulator. The results show that our previously proposed method is effective in both cases in which the network size is small or large. In addition, we conducted other simulation experiments to measure several aspects of the assurance of our method. We measured in terms of varying parameters such as node densities, distance between the source and the destination nodes, and so on. Additionally, our method is more assured than the single path-based method.     

Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks

We address the problem of maximizing the lifetime of a wireless sensor network with energy-constrained sensors and a mobile sink. The sink travels among discrete locations to gather information from all the sensors. Data can be relayed among sensors and then to the sink location, as long as the sensors and the sink are within a certain threshold distance of each other. However, sending information along a data link consumes energy at both the sender and the receiver nodes. A vital problem that arises is to prescribe sink stop durations and data flow patterns that maximally prolong the life of the network, defined as the amount of time until any node exhausts its energy. We describe linear programming and column generation approaches for this problem, and also for a version in which data can be delayed in its transmission to the sink. Our column generation approach exploits special structures of the linear programming formulations so that all subproblems are shortest path problems with non-negative costs. Computational results demonstrate the efficiency of the proposed algorithms.     

基于二元多项式的短波自组网密钥预分配方案

针对短波通信在传输过程中连通率低及容易遭受敌方截获和攻击的缺点,提出一种基于二元多项式的密钥预分配方案。该方案采用对称加密技术保证报文加/解密的效率;运用公钥密码体制复杂性提高会话密钥的安全性;引入hash函数对报文进行签名,验证报文的真实性与完整性;基于区域划分对节点进行分簇,实现节点之间100%的连通率。实验结果表明,该方案能有效抵御敌方的攻击,保证网络的安全通信。     

UWSN中基于信息价值的数据传输方案

在水下传感器网络中,现有的数据传输策略没有对采集到的信息价值的重要性进行区别对待,降低了数据收集的意义。为此,以传输给陆地基站的数据信息价值最大为目标,针对水下传感获得的数据块的信息价值提出多种调度算法,以确定何时通过声学路由传输哪些数据,实现传递给用户的信息价值最大化。基于真实场景的仿真研究表明,可在本地估计数据块信息价值的算法可显著提高数据传输的信息价值。相反,没有在结点层面考虑信息价值量的策略和算法略优于只使用AUV进行数据采集的基准情况。     

关键路径优先WSNs负载均衡多路数据传输协议

由于无线传感器网络中节点能量有限,如何实现各节点负载均衡以延长网络生存周期是亟待解决的问题.利用关键路径优先原则提出一种多路径数据传输协议,快速选择适合路径并剔除不适合数据传输的路径,并用剩余能量均衡法为各传送路径分配数据,以有效均衡各节点能量,延长网络生存周期.仿真实验表明:算法显著延长了网络寿命,与其他多路径传输算法相比网络寿命延长超过37%.