A Gaussian Mixture Model-Based Continuous Boundary Detection for 3D Sensor Networks

This paper proposes a high precision Gaussian Mixture Model-based novel Boundary Detection 3D (BD3D) scheme with reasonable implementation cost for 3D cases by selecting a minimum number of Boundary sensor Nodes (BNs) in continuous moving objects. It shows apparent advantages in that two classes of boundary and non-boundary sensor nodes can be efficiently classified using the model selection techniques for finite mixture models; furthermore, the set of sensor readings within each sensor node’s spatial neighbors is formulated using a Gaussian Mixture Model; different from DECOMO [1] and COBOM [2], we also formatted a BN Array with an additional own sensor reading to benefit selecting Event BNs (EBNs) and non-EBNs from the observations of BNs. In particular, we propose a Thick Section Model (TSM) to solve the problem of transition between 2D and 3D. It is verified by simulations that the BD3D 2D model outperforms DECOMO and COBOM in terms of average residual energy and the number of BNs selected, while the BD3D 3D model demonstrates sound performance even for sensor networks with low densities especially when the value of the sensor transmission range (r) is larger than the value of Section Thickness (d) in TSM. We have also rigorously proved its correctness for continuous geometric domains and full robustness for sensor networks over 3D terrains

A hybrid localization approach in 3D wireless sensor network

Location information acquisition is crucial for many wireless sensor network (WSN) applications. While existing localization approaches mainly focus on 2D plane, the emerging 3D localization brings WSNs closer to reality with much enhanced accuracy. Two types of 3D localization algorithms are mainly used in localization application: the range-based localization and the range-free localization. The range-based localization algorithm has strict requirements on hardware and therefore is costly to implement in practice. The range-free localization algorithm reduces the hardware cost but at the expense of low localization accuracy. On addressing the shortage of both algorithms, in this paper, we develop a novel hybrid localization scheme, which utilizes the range-based attribute RSSI and the range-free attribute hopsize, to achieve accurate yet low-cost 3D localization. As anchor node deployment strategy plays an important role in improving the localization accuracy, an anchor node configuration scheme is also developed in this work by utilizing the MIS (maximal independent set) of a network. With proper anchor node configuration and propagation model selection, using simulations, we show that our proposed algorithm improves the localization accuracy by 38.9% compared with 3D DV-HOP and 52.7% compared with 3D centroid

The 3D Deployment Multi-objective Problem in Mobile WSN: Optimizing Coverage and Localization

International audienceThe deployment of sensor nodes is a critical phase that significantly affects the functioning and performance of the sensor network. Coverage is an important metric reflecting how well the region of interest is monitored. Random deployment is the sim-plest way to deploy sensor nodes but may cause unbalanced deployment and therefore, we need a more intelligent way for sensor deployment. In this paper, we study the positioning of sensor nodes in a WSN in order to maximize the coverage problem and to optimize the localization. First, the problem of deployment is introduced, then we present the latest research works about the different proposed methods. Also, we propose a mathematical formulation and a genetic based approach to solve this problem. Finally, the numerical results of experimentations are presented and discussed. Indeed, this paper presents a genetic algorithm which aims at searching for an optimal or near optimal solution to the coverage holes problem. Our algorithm defines the minimum number and the best locations of the mobile nodes to add after the initial random deployment of the stationary nodes. Compared with random deployment, our genetic algorithm shows significant performance improvement in terms of quality of coverage while optimizing the localization in the sensor network

3Dimension Location Management for Containers

A method to determine the 3D positions using RSSI is proposed as a solution to find location of sensors on containers. This paper presents a novel algorithm for the estimation of the coordinates and a self-correcting localization for sensors on containers. A sensor finds its location by RSSI that received from anchor (location-known) nodes or nodes which are already found. After sensors wait as much as delayed time calculated by the formula we suggested in this paper, a sensor which has the strongest RSSI broadcasts its location information and other nodes wait and save the node's location information and its procedure till finding all sensors' locations. This algorithm results in less anchor nodes and less messages. Our proposed method is simulated in our own simulator and this simulation result shows that when we use variations of signal strength with 20 % or greater, it starts to occur errors for finding a location of error. This algorithm is required of less anchor nodes and less messages.Computer Science Departmen