Robust Cubic-Based 3-D Localization for Wireless Sensor Networks

The rapid progress of wireless communication and the availability of many small-sized, light-weighted and low-cost communication and computing devices nowadays have greatly impacted the development of wireless sensor network. Localization using sensor network has attracted much attention for its comparable low-cost and potential use with mon- itoring and targeting purposes in real and hostile application scenarios. Currently, there are many available approaches to locating persons/things based on global positioning system (GPS) and radio-frequency identification (RFID) technologies. However, in some application scenario, e.g., disaster rescue application, such localization devices may be damaged and may not provide the location information of the survivors. The main goal of this paper is to design and develop a robust localization technique for human existence detection in case of disasters such as earthquake or fire. In this paper, we propose a 3-D localization technique based on the hop-count data collected from sensor anchors to estimate the location of the activated sensor mote in 3-D coordination. Our algorithm incorporates two salient features, cubic-based output and event-triggering mechanism, to guarantee both improved accuracy and power efficiency. Both simulation and experimental results indicate that the proposed algorithm can improve the localization precision of the human existence and work well in real environment.

A Three-Dimensional Range-Free Localization Algorithm Based on Mobile Beacons for Wireless Sensor Networks

In wireless sensor networks （WSNs） the position information of individual nodes is a matter of vital importance because allows the implementation of necessary network functions such as routing, querying and other applications. The objective of this paper is to propose an algorithm of three-dimensional distributed range-free localization for WSNs, using a mobile beacon （MB） equipped with a rotary and tilting directional antenna. This algorithm, denominated as the three-dimensional azimuthally defined area localization algorithm （3D- ADAL）, is executed in each sensor node and is based only on the analysis of the information received from the MB, therefore is energy efficient and contributes to extend the lifetime of the sensor network. Additionally the proposed algorithm has the advantage of being simple and economical. The simulation results show that the proposed algorithm is a practical, effective and accurate method for a three-dimensional location of sensor nodes in a WSN.

LOCALIZATION ALGORITHM BASED ON MINIMUM CONDITION NUMBER FOR WIRELESS SENSOR NETWORKS

During range-based self-localization of Wireless Sensor Network (WSN) nodes, the number and placement methods of beacon nodes have a great influence on the accuracy of localization. This paper proves a theorem which describes the relationship between the placement of beacon nodes and whether the node can be located in 3D indoor environment. In fact, as the highest locating accuracy can be acquired when the beacon nodes form one or more equilateral triangles in 2D plane, we generalizes this conclusion to 3D space, and proposes a beacon nodes selection algorithm based on the minimum condition number to get the higher locating accuracy, which can minimize the influence of distance measurement error. Simulation results show that the algorithm is effective and feasible.

Three-Dimensional Dynamic Based Borrowing Scheme for Wireless Cellular Networks

Mobility metrics of wireless networks such as link availability, number of neighboring nodes, link duration, link state, and link stability make it difficult to provide a node with quality of services guarantee. In previous research on Quality of Service (QoS) for cellular networks especially for handling handoff connections, the design was based on a flat 2D hexagon cells. However, in reality Base Station antenna coverage is in a 3D space and there exists a blind spot;the area which is just above and bellow the radiated antenna. In this paper we introduce the concept of Blind Spot (BS) in which there is no signals to initiate a call or accepting a handoff one. In BS, the signal power equal zero. Even if there is enough bandwidth to initiate or accept a handoff call, it will be blocked or dropped respectively. We present an implementation of Static Borrowing Scheme (SBS) and we extend the dynamic-rate based borrowing scheme [1] into 3-Dimentional structure and call it 3-Dimensional Dynamic Based Borrowing Scheme (3D DBBS). The proposed new technique for resource sharing is to ensure the continuity for both originating and handoff connections in 3-D cellular networks based on Dynamic-Based Borrowing Scheme (3D BBS). This technique aims to minimize the blocking probability of the originating calls by minimizing the dropping probability of the handoff requests and maximizing the channel utilization. The results revealed that 3D DBBS outperformed the static based schemes by 5% on average even when the blind spot of the base station antenna is taken into consideration. When moving to a 3D space, the results of the simulation showed the 3D DBBS outperformed the static scheme by 2% on average. As a result, considering nodes in a 3D space will have better QoS guarantee as the blocking and dropping probabilities are decreased. Thus, the bandwidth utilization is increased.

A Void Avoidance Scheme for Grid-Based Multipath Routing in Underwater Wireless Sensor Networks

This work proposes a geographic routing protocol for UWSNs based on the construction of a 3D virtual grid structure, called Void-Avoidance Grid-based Multipath Position-based Routing (VA-GMPR). It consists of two main components, the multipath routing scheme and the grid-based void avoidance (GVA) mechanism for handling routing holes. The multipath routing scheme adopts node-disjoint routes from the source to the sink in order to enhance network reliability and load balancing. While the GVA mechanism handles the problem of holes in 3D virtual grid structure based on three techniques: Hole bypass, path diversion, and path backtracking. The performance evaluation of the VA-GMPR protocol was compared to a recently proposed grid-based routing protocol for UWSNs, called Energy-efficient Multipath Geographic Grid-based Routing (EMGGR). The results showed that the VA-GMPR protocol outperformed the EMGGR protocol in terms of packet delivery ratio, and end-to end-delay. However, the results also showed that the VA-GMPR protocol exhibited higher energy consumption compared to EMGGR.

Autonomous UAV 3D trajectory optimization and transmission scheduling for sensor data collection on uneven terrains

This paper considers a time-constrained data collection problem from a network of ground sensors located on uneven terrain by an Unmanned Aerial Vehicle(UAV),a typical Unmanned Aerial System(UAS).The ground sensors harvest renewable energy and are equipped with batteries and data buffers.The ground sensor model takes into account sensor data buffer and battery limitations.An asymptotically globally optimal method of joint UAV 3D trajectory optimization and data transmission schedule is developed.The developed method maximizes the amount of data transmitted to the UAV without losses and too long delays and minimizes the propulsion energy of the UAV.The developed algorithm of optimal trajectory optimization and transmission scheduling is based on dynamic programming.Computer simulations demonstrate the effectiveness of the proposed algorithm.

基于改进麻雀搜索算法的3DDV-Hop定位算法

针对经典3DDV-Hop算法定位精度不高的问题,提出一种基于改进麻雀搜索算法优化的改进的3DDV-Hop算法;算法首先通过多通信半径优化传感器节点之间跳数,并且在平均跳距计算过程中引入动态加权因子提高平均跳距计算精度,其次在麻雀搜索算法的基础上融合反向学习策略与萤火虫算法分别对麻雀搜索算法的种群与位置更新迭代进行优化,最后将未知节点坐标计算问题转化成改进后的麻雀搜索算法寻优问题,利用改进后的麻雀搜索算法替代最小二乘法计算未知节点坐标,进一步提高未知节点位置计算精度;经过MATLAB仿真验证,改进算法对比于经典3DDV-Hop算法和相关算法,定位精度得到有效提高。

A New 3D Wireless Directional Sensing Model and Coverage Enhancement Algorithm

Coverage control for each sensor is based on a 2D directional sensing model in directional sensor networks conventionally. But the 2D model cannot accurately characterize the real environment. In order to solve this problem,a new 3D directional sensor model and coverage enhancement algorithm is proposed. We can adjust the pitch angle and deviation angle to enhance the coverage rate. And the coverage enhancement algorithm is based on an improved gravitational search algorithm. In this paper the two improved strategies of GSA are directional mutation strategy and individual evolution strategy. A set of simulations show that our coverage enhancement algorithm has a good performance to improve the coverage rate of the wireless directional sensor network on different number of nodes,different virtual angles and different sensing radius.

基于ZigBee和3G的多污水处理厂监控系统设计

为了实现快速准确地采集多污水泵站和处理厂信息,提出了基于ZigBee和3G技术的远程多污水处理厂协同监控系统.该系统主要由污水处理厂信息监测网络节点、嵌入式ARM+DSP开发模块3、G/GPRS传输网络与Internet网络、远程服务器控制中心端组成.在污水处理厂现场,使用传感器节点采集各种所需信息,通过ZigBee无线传感网将各种信息上传到上位机,然后上位机通过网关节点集成移动通讯网络,利用3G/GPRS网络实现与Internet的信息交互,完成多泵站和污水处理厂数据的自动采集、无线传输以及Web方式下的参数远程设置和信息实时监测.采用该系统后,污水处理厂的污水处理量最少增加了5.2%,千吨水电耗最少下降了5.4%,剩余污泥量也均比采用前有明显的下降.

LM3S9B96与CC2520平台上的ZigBee组网技术及应用

ZigBee技术是基于IEEE 802.15.4的一种新兴的短距离、低功耗、低成本和低速率的无线传感器网络技术。网络节点作为无线传感器网络的物理载体,如何实现众多网络节点的智能化接入成为关键问题之一。本文提出了LM3S9B96+CC2520平台上无线通信节点的智能化设计,分析了ZigBee无线组网与数据通信技术,并实现了智能泊车引导系统的应用。

双层无线传感网络的3连通近似算法

主要研究双层无线传感网络模型,即数据信息流只能在传感器和中继器或中继器和中继器之间传输,而不能在传感器之间传输。近似算法基于两个子问题:k圆盘覆盖问题和单层传感网络的k连通问题,而后在部分中继器周围设置"等六边形"结构的中继器点,最终达到整个网络的3-连通水平。该算法的最终性能比为8α+β,其中α为k圆盘覆盖近似算法的性能比,β为单层传感网络的k连通近似算法的性能比。

一种用于NS-3仿真的电池模型及其数值解法

为了解决网络模拟器NS-3不能对无线传感器网络节点的电池信息做出准确仿真的问题,吸收LiIon电池模型和KiBaM电池模型各自的优点,采用LiIon电池模型的方法计算KiBaM电池模型中有效电荷井的输出电压,得到能够体现电池的速率容量效应和自恢复效应、能够反映输出电压随剩余电量降低而降低的KiBaM-LiIon电池模型,并对模型中无法获得解析解的微分方程组求解,基于隐式Runge-Kutta方法,提出了易于编程实现的数值解法。仿真和实验的结果表明,模型及其数值解法能够在NS-3中对电池使用过程中任何时刻的电压、剩余电量等作出准确预测,且具备计算复杂度低的优点。所提出的电池模型及其数值解法不仅适用于NS-3,同样也适用于其他网络模拟器,可为无线传感器网络和移动Ad-hoc网络的研发提供参考。

基于NS-3的无线传感器网络物理层设计及仿真

NS-3是一种新的网络仿真工具,它将会慢慢取代目前广泛使用的NS-2。本文着重介绍了基于NS-3的无线传感器网络的物理层仿真模块的设计,搭建了无线传感器网络仿真平台,使一个简单的例子得以在上面运行,并给出了仿真结果。该仿真平台可以用于对无线传感器网络的深入研究与探讨,有助于无线传感器网络的优化设计、缩短系统的开发周期。

无线传感器网络的3连通多跳控制集

无线传感器网络的一个虚拟骨干是一个节点子集,虚拟骨干中的节点负责相关的路由任务。设计的虚拟骨干越小,网络的相关开销就越少,虚拟骨干的大小是衡量虚拟骨干质量的关键因素。通常,单位圆盘图被用来模拟一个无线传感器网络。在无线传感器网络中寻找最小虚拟骨干问题可以抽象为求单位圆盘图中的最小连通控制集问题。然而,求单位圆盘图中的最小连通控制集问题是NP难问题,许多工作都是致力于寻找最小连通控制集的近似算法。无线传感器网络中构造3连通多跳控制集可以有效地减小连通控制集的大小和节点间转发的信息总数,是寻找最小虚拟骨干的有效近似。为此提出了一个无线传感器网络中构造3连通多跳控制集的算法,获得一个大小不超过5(2r+2β+1)(r+1)β|U|-10(2+β)(r+1)-5r-12的3连通多跳控制集。最后通过仿真实验对提出的算法性能进行了相应分析,实验结果符合算法的预期效果。

Design of 3D Space Following Positioning System Based on ZigBee

The research on positioning system and spatial alignment is a big topic. In this paper, we proposed a design (that) studies two issues. One is the study of range positioning algorithm based on ZigBee communication system. The other one is spatial alignment platform which is controlled with two servos. Hardware and software control system was realized, which also consists of two parts, ZigBee network positioning system and automatic orientation platform.

3DT-PP:localization and path planning of mobile anchors over complex 3D terrains

Mobile anchors are widely used for localization in WSNs.However,special properties over 3D terrains limit the implementation of them.In this paper,a novel 3D localization algorithm is proposed,called 3 DT-PP,which utilizes path planning of mobile anchors over complex 3 D terrains,and simulations based upon the model of mountain surface network are conducted.The simulation results show that the algorithm decreases the position error by about 91%,8.7%and lowers calculation overhead by about 75%,1.3%,than the typical state-of-the-art localization algorithm(i.e.,'MDS-MAP','Landscape-3D').Thus,our algorithm is more potential in practical WSNs which are the characteristic of limited energy and 3D deployment.

Three-Dimensional Distance-Error-Correction-Based Hop Localization Algorithm for IoT Devices

The Internet of Things(IoT)is envisioned as a network of various wireless sensor nodes communicating with each other to offer state-of-the-art solutions to real-time problems.These networks of wireless sensors monitor the physical environment and report the collected data to the base station,allowing for smarter decisions.Localization in wireless sensor networks is to localize a sensor node in a two-dimensional plane.However,in some application areas,such as various surveillances,underwater monitoring systems,and various environmental monitoring applications,wireless sensors are deployed in a three-dimensional plane.Recently,localization-based applications have emerged as one of the most promising services related to IoT.In this paper,we propose a novel distributed range-free algorithm for node localization in wireless sensor networks.The proposed three-dimensional hop localization algorithm is based on the distance error correction factor.In this algorithm,the error decreases with the localization process.The distance correction factor is used at various stages of the localization process,which ultimately mitigates the error.We simulated the proposed algorithm using MATLAB and verified the accuracy of the algorithm.The simulation results are compared with some of the well-known existing algorithms in the literature.The results show that the proposed three-dimensional error-correctionbased algorithm performs better than existing algorithms.

Using Wearable Sensors for Remote Healthcare Monitoring System

Recent technological advances in wireless communications and wireless sensor networks have enabled the design of low-cost, intelligent, tiny, and lightweight medical sensor nodes that can be strategically placed on human body, create a wireless body area network (WBAN) to monitor various physiological vital signs for a long period of time and providing real-time feedback to the user and medical staff. WBANs promise to revolutionize health monitoring. In this paper, medical sensors were used to collect physiological data from patients and transmit it to Intelligent Personal digital Assistant (IPDA) using ZigBee/IEEE802.15.4 standard and to medical server using 3G communications. We introduced priority scheduling and data compression into the system to increase transmission rate of physiological critical signals which improve the bandwidth utilization. It also extends the life time of hand-held personal server by reducing power consumption during transmission.

Incremental Linear Discriminant Analysis Dimensionality Reduction and 3D Dynamic Hierarchical Clustering WSNs

Optimizing the sensor energy is one of the most important concern in Three-Dimensional(3D)Wireless Sensor Networks(WSNs).An improved dynamic hierarchical clustering has been used in previous works that computes optimum clusters count and thus,the total consumption of energy is optimal.However,the computational complexity will be increased due to data dimension,and this leads to increase in delay in network data transmission and reception.For solving the above-mentioned issues,an efficient dimensionality reduction model based on Incremental Linear Discriminant Analysis(ILDA)is proposed for 3D hierarchical clustering WSNs.The major objective of the proposed work is to design an efficient dimensionality reduction and energy efficient clustering algorithm in 3D hierarchical clustering WSNs.This ILDA approach consists of four major steps such as data dimension reduction,distance similarity index introduction,double cluster head technique and node dormancy approach.This protocol differs from normal hierarchical routing protocols in formulating the Cluster Head(CH)selection technique.According to node’s position and residual energy,optimal cluster-head function is generated,and every CH is elected by this formulation.For a 3D spherical structure,under the same network condition,the performance of the proposed ILDA with Improved Dynamic Hierarchical Clustering(IDHC)is compared with Distributed Energy-Efficient Clustering(DEEC),Hybrid Energy Efficient Distributed(HEED)and Stable Election Protocol(SEP)techniques.It is observed that the proposed ILDA based IDHC approach provides better results with respect to Throughput,network residual energy,network lifetime and first node death round.

Architecture Design of an Integrated Communication and Broadcasting Network

Due to the power limitation of nodes in wire-less sensor networks (WSNs), how to maximize network lifetime has become a critical issue for deployment of WSNs. Although several schemes have been proposed for 2D WSNs, few for 3D WSNs are known. In this paper, we present a scheme to maximize network lifetime for 3D WSNs through balancing energy consumption, as an extension of the existing scheme for 2D WSNs proposed recently [1]. Same as [1], we formulate the energy consumption balancing problem as an problem of optimal distribution of transmitting data by combining the techniques of sphere-corona based network division, mixed-routing and data aggregation. We first present a Tiled-block based routing scheme in order to balance energy consumption among nodes in each sphere-corona. Then we design an algorithm to compute the optimal distribution ratio of transmitting data between direct and hop-by-hop transmission, with the purpose of balancing energy consumption among nodes across different sphere-coronas. We show maximizing network lifetime through computing the optimal number of sphere-coronas. Afterwards a energy consumption balanced data collecting protocol (ECBDC) is designed and a solution to extend ECBDC to largescale WSNs is also presented. Simulaiton results show that ECBDC is superior to conventional direct and multihop transmission schemes in network lifetime.