Controlled deployments for wireless sensor networks

In wireless sensor networks (WSNs), the operation of sensor nodes has to rely on a limited supply of energy (such as batteries). To support long lifetime operation of WSNs, an energy-efficient way of sensor deployment and operation of the WSNs is necessary. A new controlled layer deployment (CLD) protocol to guarantee coverage and energy efficiency for a sensor network is proposed. CLD outperforms previous similar protocols in that it can achieve the same performances and guarantee full area coverage and connection using a smaller number of sensors. It can also ameliorate the 'cascading problem' that reduces the whole network lifetime. Finally, analysis and simulation results show that CLD can use fewer sensor nodes for coverage and also increases the lifetime of the sensor network when compared with the probing environment and adapting sleeping (PEAS) protocol.     

无线传感器网络定位求精方法

为了提高传感器节点定位精度,将多种节点坐标计算方案(如极大似然估计、基于泰勒展开的最小二乘法和加权最小二乘法等)应用于定位求精中,并分析和比较了它们的性能.为了解决实际定位过程中锚节点存在的自身位置偏差,设计了相应的坐标求精方法,如总体最小二乘法和约束总体最小二乘法,在此基础上针对无线传感器网络定位误差的特点推广了定位误差的估计下限(参数无偏估计的Cramer-Rao下限).仿真实验结果给出了不同求精方案各自的求精性能和适用场合.在锚节点无位置误差的情况下,在泰勒展开基础上形成的加权最小二乘法更有利于精度提高;在锚节点有位置误差的情况下,约束总体最小二乘法对提高定位精度更有效.     

无线传感器网络的流量自适应分簇算法协议

在分析LEACH路由协议算法的缺点的基础上,提出了一种用于无线传感器网络的基于流量自适应的TDMA分簇算法协议.该协议根据当前节点数据流量的变化,自适应地调整该节点在其簇内通信的时隙长度,减少节点空闲时消耗的能量和节点从睡眠到活跃状态来回切换的能量.仿真实验结果表明,与LEACH协议簇内时隙分配算法相比,运用这种新的时隙分配算法,可以节省节点的能量,提高网络的生存时间,改善网络性能.     

Voronoi-based relay placement scheme for wireless sensor networks

Energy consumption is a crucially important issue in battery-driven wireless sensor networks (WSNs). In most sensor networks, the sensors near the data collector (i.e. the sink) become drained more quickly than those elsewhere in the network since they are required to relay all of the data collected in the network to the sink. Therefore more balanced data paths to the sink should be established in order to extend the lifetime of the sensor network. Accordingly, a novel relay deployment scheme for WSNs based on the Voronoi diagram is proposed. The proposed scheme is applicable to both two-dimensional and three-dimensional network topologies and establishes effective routing paths that balance the traffic load within the sensor network and alleviate the burden on the sensors around the sink. Simulation results indicate that the number of relays deployed in the proposed scheme is similar to that deployed in the predetermined location scheme and is significantly less than that deployed in the minimum set cover scheme. Furthermore, the lifetime of the sensor network containing relay nodes deployed using the current scheme is longer than that achieved using either the predetermined location scheme or the minimum set cover scheme.     

Locating ineffective sensor nodes in wireless sensor networks

Ineffective sensor node (InESN) in a wireless sensor network (WSN) is defined as one whose position cannot be estimated by traditional localisation methods. Incremental localisation method is investigated and the existence of the InESNs is confirmed. By analysing the existing characteristics, the InESNs are classified into three categories: InESNs connecting with one known node, InESNs connecting with two known nodes and InESNs standing alone. It is impossible to locate the InESNs of the third category because they cannot receive any information from the known nodes. With a moving target in the WSN, a constrained least-squares formulation is developed to estimate the InESNs of the first two categories. Numerical evaluations are carried out to examine the performance of the proposed method and show that it is indeed effective for locating the InESNs. By incorporating the InESNs in the tracking applications, the performance of the target tracking can be greatly enhanced.     

Distributed inference in wireless sensor networks

Statistical inference is a mature research area, but distributed inference problems that arise in the context of modern wireless sensor networks (WSNs) have new and unique features that have revitalized research in this area in recent years. The goal of this paper is to introduce the readers to these novel features and to summarize recent research developments in this area. In particular, results on distributed detection, parameter estimation and tracking in WSNs will be discussed, with a special emphasis on solutions to these inference problems that take into account the communication network connecting the sensors and the resource constraints at the sensors.     

Signal compression in wireless sensor networks

Signal compression is an important tool for reducing communication costs and increasing the lifetime of wireless sensor network deployments. In this paper, we overview and classify an array of proposed compression methods, with an emphasis on illustrating the differences between the various approaches.     

BP神经网络在无线传感器网络三维定位中的应用

为了减小多跳距离估计误差对三维无线传感器网络节点定位的影响,提出了一种结合BP神经网络的多跳定位(BPL)算法.建立了BP神经网络模型,用来修正不相邻节点间的多跳距离估计值;根据锚节点间的位置关系提取样本对其进行训练,使其能够反映三维无线传感器网络几何结构的主要特性,未知节点利用训练好的BP神经网络估计出自身到一定跳数...     

一种传感器网络的非均匀节能分簇模型

针对无线传感器网络中节点能耗不平衡导致系统生存时间缩短的问题,提出了一种无线传感器网络的非均匀节能分簇(UEEC)模型.UEEC通过自组织的方式和对簇头的动态选择,在靠近sink点(基站)的地方形成较小的簇,在远离sink点的地方形成较大的簇,从而使簇头能够对信息收集能耗与信息转发能耗进行平衡.同时,簇头的动态选举又能够把能耗平均分散在各个节点上.仿真结果表明,UEEC在减少与平衡无线传感器网络的节点能耗上有较好的性能,从而能够延长无线传感器网络的生存时间.     

一种新的分布式无线传感器网络定位方法

针对无线传感器网络节点能源受限的特征,以系统最小硬件开销为设计原则,提出了一种适用于基于测距的分布式定位方法(3/2-NANDB),该方法可在不增加单个独立节点硬件开销的情况下,利用附加的外部控制系统发射一个旋转定向波束充分挖掘节点间的冗余信息,有效排除节点位置的模糊性,从而可完全确定只有两个邻居节点的节点位置和部分只有一个邻居节点的节点位置,达到减少GPS携带节点数量、最大化网络内部可定位节点数目、扩大网络观察范围和延长无线传感器网络存活时间等目的.而利用该方法的节点二义性排除算法,还可以辅助其他现有的基于三邻居(3-NA)的定位算法提高整体定位性能.     

Game-theoretic medium access control protocol for wireless sensor networks

In the traditional medium access control (MAC) protocols for wireless sensor networks (WSNs), energy consumption is traded for throughput and delay. However, in future WSNs, throughput and delay performance had better not be sacrificed for energy conservation. Here first, an incompletely cooperative game-theoretic heuristic-based constraint optimisation framework is introduced to achieve the goals of throughput, delay and energy conservation simultaneously. Then a simplified game-theoretic MAC (G-MAC) protocol is presented, which can be easily implemented in WSNs. Simulation results show that compared with two typical MAC protocols for WSNs, sensor MAC and timeout MAC, G-MAC can increase system throughput, and decrease delay and packet-loss-rate, while maintaining relatively low energy consumption.     

面向传感网可信检测的协同感知策略

为了提高基于传感器网络的目标检测的检测精度和尽可能延长网络的寿命,将满足用户对检测精度要求的检测定义为可信检测,并提出了一种面向可信检测的协同感知策略。该策略首先对传感器的相关性及感知能力差异性进行定量分析,发现它们与传感器簇的感知性能的关联性,为实现传感器的协同选择提供依据;然后用一种分布式传感器协同选择方法进行传感器协同选择:根据传感器相关性、感知能力差异性及剩余能量来计算节点的重要性,之后按节点重要性选择合适的传感器。试验表明,与传统方法相比,该策略既能更好地满足用户对检测精度的要求,又能在实现能量均衡、延长网络寿命上取得更好的效果。     

基于局部网络拓扑特征的鲁棒节点定位算法

针对无线传感器网络的较大测距误差严重影响定位算法精度和鲁棒性的问题,利用节点均匀部署网络的拓扑特征,提出了一种基于局部网络拓扑特征的鲁棒节点定位算法(LFLS算法).该算法通过构建节点测距高估粗差阈值参数和测距低估粗差阈值参数,在对未知节点1跳测距数据集进行粗差识别及剔除等预处理滤波的基础上,使用高斯加权最小二乘定位算法实现节点定位.仿真结果表明,基于局部网络拓扑特征的鲁棒节点定位算法的定位精度明显优于未采用局部网络拓扑特征进行粗差预处理的加权最小二乘定位算法,其中粗差测距直接相关节点的定位精度改进尤为明显.     

一种低计算复杂度的无线传感器网络分簇定位算法

针对已有的集中式定位算法定位精度低,而分布式定位算法计算复杂度高、通信量大的问题,提出了一种适用于无线传感器网络的计算复杂度低的节点分簇定位算法.首先,提出满足最大连通度的多边界节点分簇算法,采用此算法把网络划分为若干个簇,各簇分别进行簇内节点定位;其次,各簇进行融合,最终实现全网节点的定位.仿真结果表明,这种分簇定位算法比分布式定位算法计算复杂度低、通信量小、定位精度相当或略差,比集中式定位算法计算复杂度低、通信量小、定位精度高.采用该算法可以降低传感器网络节点定位过程中的能耗,提高计算效率,延长网络寿命.     

支持性能测量的无线传感器网络实验床技术研究

针对目前无线传感器网络实验床普遍缺乏性能测量机制的问题,基于TinyOS的特点,提出了一种支持对实验对象进行现场测量的实验床体系结构.将轻量级测量实体嵌入到实验床中,对被测系统、测量指标进行约束与定义,设计了高能效的测量方法和测量算法,实现了对实验中节点能耗、链路质量、吞吐量、丢包率、时延、网络拓扑等性能参数的高效可靠获取,解决了传感器网络协议或应用的实时测试问题.该实验床技术支持分布式多点测量和平面、分簇、Multi-Sink等多种网络结构,提高了实验床设施的利用率和实验效率.实验案例证明了其良好的易用性、普适性和可扩展性.     

无线传感网3D-MCM封装结构的设计与实现

设计和实现了一种新型的三维多芯片组件(3D-MCM).采用融合了FCOB(flip-chip on board)、COB(chip on board)、BGA(ball grid array)等技术的三维封装(3D packaging)形式,通过倒装焊和引线键合等互连技术在高密度多层有机基板上实现了塑封BGA器件和裸芯片的混载集成.对器件结构的散热特性进行了数值模拟,并对热可靠性进行了评估.实现了电功能和热机械可靠性,达到设计要求并付诸应用.     

Low-complexity low-memory energy-efficient image coding for wireless image sensor networks

Wireless image sensor networks are capable of sensing, processing and transmitting the image in hard-to-access regions without expensive network infrastructure and will have great contribution in Internet of Things. These networks are resource constraint systems with limited memory, energy, processing speed and bandwidth. Low computational energy and communication energy will improve the lifetime of these resource-limited networks. In this paper, an energy-efficient low-memory and low-bitrate image coding is designed exclusively for low-power camera-equipped sensor node. The performance of the proposed image coder is analysed in terms of bitrate, image quality, memory size and energy consumption. Experiments are carried out with Atmel ATmega128 processor. The experimental results show that this system consumes only 0.23% of energy consumed by true Discrete Cosine Transform-based Joint Photographic Experts Group (JPEG) standard and offers reasonable image quality suitable for visual perception at low bitrate. This system requires only 19% of memory required by standard JPEG.     

Matheuristic approaches for Q-coverage problem versions in wireless sensor networks

This article deals with sensor coverage scheduling in wireless sensor networks subject to Q-coverage constraints. The main concern is to maximize the network lifetime, while ensuring that each target is covered by a given number of sensors. Three different variations of this problem are considered. Column generation based exact approaches are developed for those problems where the auxiliary problem is solved by a two-level approach comprising a genetic algorithm and an integer linear programming formulation. The genetic algorithm takes advantage of the auxiliary problem structure and appears to be very efficient at providing the master problem with attractive columns. The auxiliary problem integer linear programming (ILP) formulation is then mostly used for proving the optimality status of the current master problem solution. The proposed approaches are shown to be significantly faster than column generation approaches relying only on the auxiliary problem ILP formulation.     

一种改进的传感器网络分簇分层路由协议

在分析了无线传感器网络中传统的LEACH和LEACH-C路由协议基础上,结合MTE路由协议思想,提出了一种新的改进型分簇分层路由协议(improved clustering hierarchical routing protocol,ICH).文中簇首节点可以采用多跳方式传输数据包,且在选择中继节点时考虑节点剩余能量,对进入下一轮的条件进行了限制.实验表明,改进后的ICH协议的节点存活率比LEACH-C好.     

一种基于协同MIMO的无线传感器网络传输方案

针对无线传感器网络中能量有限和能耗不均衡问题,提出了一种基于协同多输入多输出(MIMO)的无线传感器网络传输方案,此方案利用有限比特的反馈信息实时调整簇头节点(CH)和协同簇头节点(CCHs)的发射功率并动态地更新协同簇头节点,减少协同簇头节点的能耗.在给定误比特率条件下,为使网络总能耗最小,对传输速率和协同簇头节点数进行联合优化,给出了均衡簇内节点能耗的算法.理论分析和仿真结果表明,此方案既能有效降低网络的总能耗,又能均衡网络中节点的能耗.