一种基于CC2431的改进DV—Hop算法RDV—Hop

DV-Hop是节点定位的一种常用算法,文中利用CC2431提供的RSSI对DV-Hop进行改进,提出了一种基于RSSI的RDV-Hop(RSSI used in DV-Hop)算法.重点对DV-Hop算法的第一和第二阶段进行改进,在第一阶段,提出防止广播信息的循环,减少不可定位节点;第二阶段,引入RSSI辅助定位,改善平均每跳距离的计算.仿真表明RDV-Hop算法在一定程度上能够提高网络连通性,改善节点覆盖率,减小定位误差提高定位精度.     

A GPS-less, outdoor, self-positioning method for wireless sensor networks

One challenging issue in sensor networks is to determine where a given sensor node is physically located. This problem is especially crucial for very small sensor nodes. This paper presents a GPS-less, outdoor, self-positioning method for wireless sensor networks. In our method, a set of nodes, called reference points (RPs), are deployed in the sensor network with overlapping regions of coverage. The RP periodically broadcasts beacon frames which contain localization data. The sensor node collects the beacon frames from RPs and process the data in the frame; it can then easily localize itself. The analysis of positioning accuracy is given to show how well a sensor node can correctly localize itself. In the optimal transmitting power, the worst-case accuracy for all data points is within 28.87% of the separation-distance between two adjacent RPs and the average accuracy is within 15.51%. The simulation results also show the robustness of the proposed method. Finally, we have implemented our positioning method on a sensor network test bed and the actual measurement show that the method can achieve average accuracy within 17.9% of the separation-distance between two adjacent RPs in an outdoor environment.     

基于连通度和加权校正的移动节点定位算法

移动节点定位问题是无线传感器网络中的研究重点。针对移动节点定位误差大的问题,提出一种基于连通度和加权校正的移动节点定位算法。在未知节点移动过程中,根据节点间连通度大小选取参与定位的信标节点,利用加权校正方法修正RSSI测距信息,然后用最小二乘法对未知节点进行位置估计。仿真分析表明,节点通信半径和信标密度在一定范围内,该算法表现出良好的定位性能,定位精度明显提升。     

基于DV-Hop的RSSI-Hop算法

在无线传感器网络中,监测到时间之后关心的一个重要问题就是该事件发生的位置。传感器节点能量有限、可靠性差、节点规模大且随机布放、无线模块通信距离有限,对定位算法和定位技术提出了很高的要求。针对随机布放、节点配置低的无线传感器网络,提出一种新的RSSI-Hop定位方法,该方法可以在不增加硬件开销的基础上,有效降低节点能量消耗,较准确地估算未知节点到参考节点之间的距离,减少累积误差,提高定位的准确性。其主要思想是,节点信息根据RSSI强弱,估算各节点到信标节点之间的距离。实验表明,新算法比以前的算法定位更准确。     

E2DTS: An energy efficiency distributed time synchronization algorithm for underwater acoustic mobile sensor networks

Time synchronization plays an important role in wireless sensor network applications and energy conservation. In this paper, we focus on the need of time synchronization in underwater acoustic mobile sensor networks (UAMSNs). Several time synchronization algorithms have been carried out in this issue. But most of them are proposed for RF-based wireless sensor networks, which assume that the propagation delay is negligible. In UAMSNs, the assumption about rapid communication is incorrect because the communication is primarily via acoustic channel, so the propagation speed is much slower than RF. Furthermore, the propagation delay in underwater environment is time-varying due to the nodes’ mobility. We present an energy efficiency distributed time synchronization algorithm (called “E²DTS”) for those underwater acoustic node mobility networks. In E²DTS, both clock skew and offset are estimated. We investigate the relationship between time-varying propagation delay and nodes mobility, and then estimate the clock skew. At last skew-corrected nodes send local timestamp to beacon node to estimate its clock offset. Through analysis and simulation, we show that it achieves high level time synchronization precision with minimal energy cost.     

Range‐free intersecting chord‐based geometric localization scheme for wireless sensor networks

Recent advancement in wireless sensor network has contributed greatly to the emerging of low‐cost, low‐powered sensor nodes. Even though deployment of large‐scale wireless sensor network became easier, as the power consumption rate of individual sensor nodes is restricted to prolong the battery lifetime of sensor nodes, hence the heavy computation capability is also restricted. Localization of an individual sensor node in a large‐scale geographic area is an integral part of collecting information captured by the sensor network. The Global Positioning System (GPS) is one of the most popular methods of localization of mobile terminals; however, the use of this technology in wireless sensor node greatly depletes battery life. Therefore, a novel idea is coined to use few GPS‐enabled sensor nodes, also known as anchor nodes, in the wireless sensor network in a well‐distributed manner. Distances between anchor nodes are measured, and various localization techniques utilize this information. A novel localization scheme Intersecting Chord‐Based Geometric Localization Scheme (ICBGLS) is proposed here, which loosely follows geometric constraint‐based algorithm. Simulation of the proposed scheme is carried out for various communication ranges, beacon broadcasting interval, and anchor node traversal techniques using Omnet++ framework along with INET framework. The performance of the proposed algorithm (ICBGLS), Ssu scheme, Xiao scheme, and Geometric Constraint‐Based (GCB) scheme is evaluated, and the result shows the fact that the proposed algorithm outperforms the existing localization algorithms in terms of average localization error. The proposed algorithm is executed in a real‐time indoor environment using Arduino Uno R3 and shows a significant reduction in average localization time than GCB scheme and similar to that of the SSU scheme and Xiao scheme.     

Optimal trajectory determination of a single moving beacon for efficient localization in a mobile ad-hoc network

An ad hoc network of small robots (sensor nodes) adjusting their positions to establish network connectivity would be able to provide a communication infrastructure in an urban battlefield environment. A sensor node would be capable of moving to a particular position to establish network connectivity, provided it knows its current position, positions of other sensor nodes and the radio propagation characteristics of the sensor area.In this paper, we present a pseudo formation control based trajectory algorithm to determine the optimal trajectory of a moving beacon used in localization of the sensor nodes in real-time. The trajectory and the frequency of transmission of the GPS based position information of the moving beacon influences the accuracy of localization and the power consumed by the beacon to localize. Localization accuracy and reduction in the number of position information messages can be achieved, in real-time, by determining the optimal position from where the beacon should transmit its next position information. This will decrease the time required to localize, and power consumed by the beacon in comparison to random or predetermined trajectories.We first show that optimal position determination is a pseudo formation control problem. Next, we show the pseudo formation control problem formulated as an unconstrained optimization problem under the free space propagation model. We further present the modeling of the beacon incorporating the trajectory algorithm based on the pseudo formation control in a discrete event simulator. Simulation results, comparing the performance of localization with pseudo formation control based trajectory against random waypoint and predetermined trajectories for the beacon are presented. The simulation results show that the localization accuracy is significantly improved along with reduction in the number of position information messages transmitted when the beacon traverses along the pseudo formation control based trajectory.     

An analysis of error inducing parameters in multihop sensor node localization

Ad hoc localization of wireless sensor nodes is a fundamental problem in wireless sensor networks. Despite the recent proposals for the development of ad hoc localization algorithms, the fundamental behavior in systems using measurements has not been characterized. In this paper, we take a first step toward such a characterization by examining the behavior of error inducing parameters in multihop localization systems in an algorithm independent manner. We first derive the Crame Rao Bound for Gaussian measurement error for multihop localization systems using distance and angular measurements. Later on, we use these bounds on a carefully controlled set of scenarios to study the trends in the error induced by the measurement technology accuracy, network density, beacon node concentration, and beacon uncertainty. By exposing these trends, the goal of this paper is to develop a fundamental understanding of the error behavior that can provide a set of guidelines to be considered during the design and deployment of multihop localization systems.     

基于射线声学的水下传感网络静默定位算法

水下传感网络静默定位方法是一种可服务于多用户的免时钟同步定位算法,待定位节点全程无需发声,具有隐蔽性强和方便扩展等优点。该文提出了一种结合声线跟踪技术的水下传感网络节点静默定位方法,将高斯-牛顿法引入到水下网络节点静默定位中,解决了已有方法存在定位盲区的问题。鉴于水中声速分布不均的情况,将声线跟踪技术融入迭代过程,用以修正声线弯曲带来的定位误差。同时,针对实际应用过程中可能出现的信标节点阵型不佳的情况,采用了改进的Tikhonov正则化方法,根据目标函数变化情况反馈控制正则化参数,消除了雅可比矩阵不满秩对迭代过程的影响。通过仿真分析,验证了该文算法的有效性。     

无线传感器网络中基于树的能量高效分布式精确数据收集算法

在大规模节点密集的多跳传感器网络中,精确数据收集存在着"热区"问题:越靠近Sink节点的传感器节点,其承担的数据转发量就越多,能量消耗也越快,从而成为瓶颈节点,缩短整个网络的生命周期.最大生命周期数据收集树的构建已被证明是NP完全问题.已有算法大多是集中式算法,不适用于大规模节点密集的传感器网络.本文提出一种分布式精确数据收集算法EEDAT,在大规模节点密集的传感器网络中,不仅能够保证每个节点到Sink的路径是最短路径(最少跳数),而且能有效延长网络生命周期.EEDAT分为两个基本步骤,首先随机生成一棵数据收集树,然后根据各个传感器节点的孩子数和剩余能量,对已生成的数据收集树进行调整,使得各个节点的负载尽量均衡,从而达到延长网络生命周期的目的.实验结果表明,与已有分布式算法LMST相比,EEDAT所构造的数据收集树能延长网络生命周期平均20%.     

An analytical geometric range free localization scheme based on mobile beacon points in wireless sensor network

In many applications of wireless sensor network, the position of the sensor node is useful to identify the actuating response of the environment. The main idea of the proposed localization scheme is similar with most of the existing localization schemes, where a mobile beacon with global positioning system broadcast its current location coordinate periodically. The received information of the coordinates help other unknown nodes to localize themselves. In this paper, we proposed a localization scheme using mobile beacon points based on analytical geometry. Sensor node initially choose two distant beacon points, in-order to minimize its residence area. Later using the residence area, sensor node approximate the radius and half length of the chord with reference to one of the distant beacon point. Then the radius and half length of the chord are used to estimate the sagitta of an arc. Later, sensor node estimate its position using radius, half length of the chord, and sagitta of an arc. Simulation result shows the performance evaluation of our proposed scheme on various trajectories of mobile beacon such as CIRCLE, SPIRAL, S-CURVE, and HILBERT.     

基于无线传感器网络的一种改进Dv-Hop算法

无线传感器网络中的Dv-Hop算法是一种无需测距的节点定位算法,经仿真观察,该算法在信标节点密度较低时节点平均误差较大且稳定性不好.提出了一种改进Dv-Hop算法,即在一个网络区域的边缘设置信标节点.经仿真验证,该算法在和Dv-Hop同等信标节点密度的情况下,在定位精度、节点定位的稳定性以及能源消耗方面都有所改善.     

基于接收信号强度的WSN概率定位算法

定位对无线传感器网络的应用、操作和管理发挥着至关重要的作用.针对传感器节点的定位,提出了一种基于接收信号强度的概率定位算法.介绍了算法原理及实现过程,讨论了信标节点分布对该算法性能的影响,最后比较了本概率定位算法和最小二乘定位算法在传感器节点定位性能上的优劣.仿真结果表明,信标节点分布对未知节点的定位误差具有较大的影响,本定位算法的性能要优于最小二乘定位算法.     

A Greedy Approach for Coverage Hole Detection and Restoration in Wireless Sensor Networks

Wireless sensor network contains several small sensor nodes that are designed to work autonomously. Coverage preservation is an underlying requirement to efficiently deliver certain services in WSNs. During network operation, some sensor nodes die because of several reasons like energy exhaustion, link failure, node failure etc. We refer it as coverage hole problem of WSNs. In this paper, a new decentralized, node based, localized algorithm called Coverage Hole Detection and Restoration is proposed for detection as well as restoration of coverage holes. Our proposed algorithm is expected to outperform existing algorithms on the parameters of energy and time consumption for convex and non-convex holes.     

无线传感器网络中DV-Hop定位方法的一种改进策略

原DV-Hop(Distance Vector-Hop)方法的定位步骤可归纳为两步：距离估计与位置计算。其中,距离估计精度对网络拓扑敏感,而位置计算算法对距离估计精度敏感,从而导致方法整体对多样性网络拓扑分布的鲁棒性较差。针对这一问题进行分析与改进,在距离估计阶段提出基于1跳内最近邻信标与其余信标的跳数连接关系独立确定未知节点与各信标间平均跳距的策略,以此改善未知节点与信标之间的距离估计误差;在位置计算阶段提出在原有Lateration算法的基础上增加牛顿迭代法优化步骤,以此提高定位精度。实验结果表明,在相同的网络条件下,与原DV-Hop方法和其他典型改进方法相比,改进策略首先在距离估计阶段提高了距离估计精度,进而在位置计算阶段提高了对距离估计误差的鲁棒性,从而整体上可有效提高全网未知节点的定位精度。     

信标节点漂移情况下的无线传感器网络节点定位机制

针对信标节点漂移情况下的节点定位问题,提出了一种分布式的信标节点漂移检测方法,采用节点自评分和协商机制,自动寻找可能发生了漂移的信标节点,同时针对大量信标节点发生漂移后的定位覆盖率下降问题,构建普通节点的定位可信度模型,并在定位盲区内使用一些较为可靠的普通节点作为临时信标节点进行定位。仿真实验表明,该算法在误检测、定位误差方面性能优于传统算法,具有较低的通信开销、较高的实用性和灵活性。     

无线供能反向散射通信中能耗最小化资源分配方法

针对无线供能反向散射通信网络,提出了一种满足传感设备通信需求及能量因果的专用能量站能耗最小化资源分配方法。在考虑非线性能量收集模型及不完美串行干扰消除基础上,通过联合优化专用能量站发射功率、传感设备反向散射通信时间、反向散射系数及其能量收集时间,构建了一个专用能量站能耗最小化的非凸多维资源分配问题。首先,构建辅助变量对反向散射系数与时间进行解耦,再利用目标函数是关于专用能量站发射功率的单调递减函数这一特性来设计一种基于二分法的迭代算法来获取原问题的最优解。仿真验证了所提算法的快速收敛性,同时,与同类算法相比,所提方法可为专用能量站节约更多的能量。     

Optimal Speed Control of Mobile Node for Data Collection in Sensor Networks

A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the proximity of a sensor node. This can be an alternative to multihop forwarding of data when we can utilize node mobility in a sensor network. To be useful, a data mule approach needs to minimize data delivery latency. In this paper, we first formulate the problem of minimizing the latency in the data mule approach. The data mule scheduling (DMS) problem is a scheduling problem that has both location and time constraints. Then, for the 1D case of the DMS problem, we design an efficient heuristic algorithm that incorporates constraints on the data mule motion dynamics. We provide lower bounds of solutions to evaluate the quality of heuristic solutions. Through numerical experiments, we show that the heuristic algorithm runs fast and yields good solutions that are within 10 percent of the optimal solutions.     

一种基于网络密度分簇的移动信标辅助定位方法

现有移动信标辅助定位算法未充分利用网络节点分布信息,存在移动路径过长及信标利用率较低等问题。该文把网络节点分簇、增量定位与移动信标辅助相结合,提出了一种基于网络密度分簇的移动信标辅助定位算法(MBL(ndc))。该算法选择核心密度较大的节点作簇头,采用基于密度可达性的分簇机制把整个网络划分为多个簇内密度相等的簇,并联合使用基于遗传算法的簇头全局路径规划和基于正六边形的簇内局部路径规划方法,得到信标的优化移动路径。当簇头及附近节点完成定位后,升级为信标,采用增量定位方式参与网络其它节点的定位。仿真结果表明,该算法定位精度与基于HILBERT路径的移动信标辅助定位算法相当,而路径长度不到后者的50％。     

Learning Automata Based Face-Aware Mobicast

Target tracking is one of the most popular applications of the wireless sensor networks. It can be accomplished using different approaches and algorithms, one of which is the spatiotemporal multicast protocol, called “mobicast”. In this protocol, it is assumed that the area around the moving target, called the delivery zone, is known at any given time during the operation of the network. The aim of the protocol is to awake sensor nodes, which will be within the delivery zone in the near future, to be prepared for tracking the approaching moving target. In this paper, we propose a novel mobicast algorithm, aiming at reducing the number of awakened sensor nodes. To this end, we equipped every sensor node with a learning automaton, which helps the node in determining the sensor nodes it must awaken. To evaluate the performance of the proposed algorithm, several experiments have been conducted. The results have shown that the proposed algorithm can significantly outperform other existing algorithms such as forward-zone constrained and FAR in terms of energy consumption, number of active nodes, number of exchanged packets and slack time.