UC Berkeley International Conference on GIScience Short Paper Proceedings

Similar documents
Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.

Performance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks

Increasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment

Compressed Sensing Image Processing Based on Stagewise Orthogonal Matching Pursuit

Minimum congestion spanning trees in bipartite and random graphs

Image authentication and tamper detection using fragile watermarking in spatial domain

Motion Control (wheeled robots)

Key Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing.

A Novel Grey-RSS Navigation System Design for Mobile Robots

Planning of scooping position and approach path for loading operation by wheel loader

Keywords: Defect detection, linear phased array transducer, parameter optimization, phased array ultrasonic B-mode imaging testing.

Gray-level histogram. Intensity (grey-level) transformation, or mapping. Use of intensity transformations:

A Practical Model for Minimizing Waiting Time in a Transit Network

Computing C-space Entropy for View Planning

Focused Video Estimation from Defocused Video Sequences

Correlation Models for Shadow Fading Simulation

DAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications

xy-monotone path existence queries in a rectilinear environment

Laboratory Exercise 6

Mirror shape recovery from image curves and intrinsic parameters: Rotationally symmetric and conic mirrors. Abstract. 2. Mirror shape recovery

Shortest Paths with Single-Point Visibility Constraint

Research on Star Image Noise Filtering Based on Diffusion Model of Regularization Influence Function

Hassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem,

CENTER-POINT MODEL OF DEFORMABLE SURFACE

Quadrilaterals. Learning Objectives. Pre-Activity

SLA Adaptation for Service Overlay Networks

Laboratory Exercise 6

Drawing Lines in 2 Dimensions

Localized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks

Comparison of Methods for Horizon Line Detection in Sea Images

Tracking Articulator Movements Using Orientation Measurements

( ) subject to m. e (2) L are 2L+1. = s SEG SEG Las Vegas 2012 Annual Meeting Page 1

Texture-Constrained Active Shape Models

Variable Resolution Discretization in the Joint Space

On successive packing approach to multidimensional (M-D) interleaving

Power Aware Location Aided Routing in Mobile Ad-hoc Networks

Markov Random Fields in Image Segmentation

A METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS

Laboratory Exercise 6

/06/$ IEEE 364

Kinematics Programming for Cooperating Robotic Systems

All in-focus View Synthesis from Under-Sampled Light Fields

A PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED

Polygon Side Lengths NAME DATE TIME

A NEW APPROACH IN MEASURING OF THE ROUGHNESS FOR SURFACE CONSTITUTED WITH MACHINING PROCESS BY MATERIAL REMOVAL

Locating Brain Tumors from MR Imagery Using Symmetry

Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks

An Image Edge Detection Algorithm using Wavelet Transform and Fuzzy Techniques

3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES

USING ARTIFICIAL NEURAL NETWORKS TO APPROXIMATE A DISCRETE EVENT STOCHASTIC SIMULATION MODEL

Chapter 13 Non Sampling Errors

Analysis of Surface Wave Propagation Based on the Thin Layered Element Method

Design of a Stewart Platform for General Machining Using Magnetic Bearings

REMOTE SENSING AND IMAGING IN A RECONFIGURABLE COMPUTING ENVIRONMENT

Towards Optimal Deployment of a Sensor Network in a 3D Indoor Environment for the Mobility of People with Disabilities

How to Select Measurement Points in Access Point Localization

Connected Placement of Disaster Shelters in Modern Cities

A CLUSTERING-BASED HYBRID REPLICA CONTROL PROTOCOL FOR HIGH AVAILABILITY IN GRID ENVIRONMENT

Finite Elements Method in Split Hopkinson Pressure Bar developing process

Anisotropic filtering on normal field and curvature tensor field using optimal estimation theory

3D SMAP Algorithm. April 11, 2012

New DSP to measure acoustic efficiency of road barriers. Part 2: Sound Insulation Index

Stochastic Search and Graph Techniques for MCM Path Planning Christine D. Piatko, Christopher P. Diehl, Paul McNamee, Cheryl Resch and I-Jeng Wang

Implementation of a momentum-based distance metric for motion graphs. Student: Alessandro Di Domenico (st.no ), Supervisor: Nicolas Pronost

else end while End References

Mid-term review ECE 161C Electrical and Computer Engineering University of California San Diego

A Novel Feature Line Segment Approach for Pattern Classification

Performance Evaluation of an Advanced Local Search Evolutionary Algorithm

Towards an Efficient Optimal Trajectory Planner for Multiple Mobile Robots

A DIVISIVE HIERARCHICAL CLUSTERING- BASED METHOD FOR INDEXING IMAGE INFORMATION

A System Dynamics Model for Transient Availability Modeling of Repairable Redundant Systems

Optimization Coverage of Wireless Sensor Networks Based on Energy Saving. Technology, Luoyang , China. Xi an , China

Possible application of fractional order derivative to image edges detection. Oguoma Ikechukwu Chiwueze 1 and Alain Cloot 2.

MAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc

Part 1 Data Collection Planning

Orienting Micro-Scale Parts with Squeeze and Roll Primitives

Greedy but Safe Replanning under Kinodynamic Constraints

IMPLEMENTATION OF AREA, VOLUME AND LINE SOURCES

KS3 Maths Assessment Objectives

Laboratory Exercise 6

Karen L. Collins. Wesleyan University. Middletown, CT and. Mark Hovey MIT. Cambridge, MA Abstract

Efficient Data Forwarding in Mobile Social Networks with Diverse Connectivity Characteristics

A Multi-objective Genetic Algorithm for Reliability Optimization Problem

Firewall Packet Filtering Optimization using Statistical Traffic Awareness Test

Loop Forming Snake-like Robot ACM-R7 and Its Serpenoid Oval Control

FPGA Implementation of Closed Loop Control of Pan Tilt Mechanism

A study on turbo decoding iterative algorithms

arxiv: v1 [cs.ms] 20 Dec 2017

A reduced reference image quality metric based on feature fusion and neural networks

EVen though remarkable progress has been made in

Simulation of Rover Locomotion on Sandy Terrain - Modeling, Verification and Validation

Keywords Cloud Computing, Service Level Agreements (SLA), CloudSim, Monitoring & Controlling SLA Agent, JADE

An efficient resource allocation algorithm for OFDMA cooperative relay networks with fairness and QoS guaranteed

SECTOR BASED MULTICAST ROUTING ALGORITHM FOR MOBILE AD-HOC NETWORKS

Homework 4 Due Thursday Oct 7. CLRS 12-4 (number of binary trees) CLRS (rb insert implementation)

ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION

A Fast Association Rule Algorithm Based On Bitmap and Granular Computing

IMPROVED JPEG DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION. Tak-Shing Wong, Charles A. Bouman, and Ilya Pollak

Particle-based Variational Inference for Continuous Systems

Course Project: Adders, Subtractors, and Multipliers a

Transcription:

UC Berkeley International Conference on GIScience Short Paper Proceeding Title A novel method for probabilitic coverage etimation of enor network baed on 3D vector repreentation in complex urban environment Permalink http://echolarhip.org/uc/item/4kv536qq Journal International Conference on GIScience Short Paper Proceeding, 1(1) Author Afghantoloee, Ali Karimipour, Farid Motafavi, Mir Abolfazl Publication Date 2016-01-01 DOI 10.21433/B3114kv536qq Peer reviewed escholarhip.org Powered by the California Digital Library Univerity of California

Short Paper Proceeding A novel method for probabilitic coverage etimation of enor network baed on 3D vector repreentation in complex urban environment A. Afghantoloee 1, F. Karimipour 2, M. A. Motafavi 1 1 Center for Reearch in Geomatic, Department of Geomatic, Univerité Laval, Quebec, Canada Email: ali.afghantoloee.1@ulaval.ca;mir-abolfazl.motafavi@cg.ulaval.ca 2 Dept. of Geomatic Engineering, Univerity of Tehran, Amir-abad Street, Tehran, Iran Email: fkarimipr@ut.ac.ir Abtract Wirele Senor Network (WSN) are widely ued for monitoring and obervation of dynamic phenomena. A enor in WSN cover only a limited region, depending on it ening and communicating range, a well a the environment configuration. For efficient deployment of enor in a WSN the coverage etimation i a critical iue. Probabilitic method are among the mot accurate model propoed for enor coverage etimation. However, mot of thee method are baed on rater repreentation of the environment for coverage etimation which limit their quality. In thi paper, we propoe a probabilitic method for etimation of the coverage of a enor network baed on 3D vector repreentation of the environment. 1. Introduction Nowaday, WSN have found variou application in indutry, ecurity, agriculture, military and diater management. Efficient monitoring and management of dynamic phenomena in the real world neceitate it efficient and accurate coverage. The efficiency of the coverage of a enor network depend on optimal poition of each enor node within the network. An individual enor cover only a limited area, which depend on it ening capacity, range of communication a well a the environment complexity. The total area covered by a WSN i obtained from the union of the region covered by individual enor. Therefore, efficient deployment of enor in a WSN i a critical iue that affect the coverage a well a communication between enor. Several optimization method (i.e., global or local, determinitic or tochatic, etc.) have been propoed to detect and eliminate coverage hole and hence increae the coverage of enor network (Argany et al. 2015). One of the key iue of all deployment optimization algorithm i accurate etimation of the coverage of an individual enor. Sening model of individual enor which could be binary or probabilitic, omnidirectional or directional ha ignificant impact on the precie coverage etimation of a enor network uing divere optimization algorithm. Mot of the enor coverage etimation method ue a rater repreentation of the environment (Akbarzadeh et al. 2013) for optimization purpoe that limit their preciion and efficiency. Thi i becaue rater repreentation are contrained by their patial reolution, and their regular hape reult in redundant data for unoccupied area. Few vector-baed optimization algorithm are propoed in the literature, which are motly baed on 2D vector-baed repreentation of the environment and do not adequately conider the preence of manmade and natural obtacle in the ening area (Wang and Cao 2011). To overcome thee limitation, in thi paper we propoe a probabilitic enor coverage etimation method baed on precie 3D vector-bae repreentation of the environment and we preent ome reult of an ongoing reearch project that aim at better optimization of a enor network in a 3D complex urban area. 1

Short Paper Proceeding 2. Probabilitic ening model Akbarzadeh et al. (2013) preented an improvement to optimization model by propoing a probabilitic ening model for individual enor that conider not only the impact of ditance on ening capacity, but alo the impact of angle between the enor direction and the line connecting the enor to a given target (Figure 1). However, thi model i till limited in accurately optimizing and etimating the coverage of a enor network a it i baed on a rater repreentation of the environment. Figure 1: Probabilitic ening model of a enor with limited ditance and angle range (Akbarzadeh 2013) Advance in geopatial method and technologie provide precie and timely collection of 3D patial data allowing the creation of multi-reolution and multi-purpoe 3D vector model of the environment that can ignificantly improve the efficiency and accuracy of optimization and coverage etimation of a enor network in a 3D urban environment. 3. 3D vector-baed Probabilitic enor coverage etimation Conider a repreentation of the environment a a et of polygon that form building, terrain and obtacle, and a enor that ha a limited range in ditance and field of view. Then, in a 3D probabilitic enor coverage model, quality of detection of a polygon depend on it ditance to the enor a well a the angle between the polygon and the enor. In Figure 2, for example, polygon A i further from enor S compared to polygon B, thu polygon A i detected with a lower quality than polygon B. On the other hand, although polygon B and C are, in average, located at the ame ditance to the enor S, polygon C ha a lower detection quality than polygon B a it ha a more oblique direction repect to the enor S. Even, a the ditance and direction differ from point to point on an individual polygon, each point on a polygon may have a different detection quality. C S Figure 2: Detection quality of target baed on ditance and direction. To practically implement the propoed methodology, the polygon, or the fraction of polygon, that are viible by the enor are determined (Afghantoloee et al. 2014). Then, thee viible polygon are dicretized to a grid (Figure 3) and the detection quality of cell i etimated and finally categorized to certain clae. A B 2

Short Paper Proceeding C S Figure 3: Surface raterizing in 3D pace. The detection quality of a cell i determined uing the area of each cell multiplied by the probability of coverage repect to it ditance and direction from the enor. Thi i obtained uing the following equation (Akbarzadeh et al. 2013): C Area( q)* P( q p )* P( ( q, p )) (1) 1 q p d P( q p ) 1 exp q p 0 otherwie co( ( qp, )) 1 ( ) ( ( qp, )), P( q p ) 2 0 otherwie where Area(q) i the area of the pixel q; d and α are repectively the ditance and angle range of the enor; (q,p) i the pan angle of the enor relative to the pixel q; q-p i the ditance between the enor and pixel q; θ i pan angle of the enor; and α, β, and ω are the parameter for configuring the probability function which can be etimated from the obervation behavior of the enor. 4. Cae tudy In order to evaluate the propoed trategy, a directional enor with a 3 and 30 meter height and radiu, pan angle of 45 and direction of [1,1,-1] wa conidered in 3D environment. The parameter α, β, and ω are repectively conidered a 350, 10, and 3. All feature in the 3D vector model are contructed by polygon with 1 cm accuracy, which have a counterclockwie tructure. Uing perpective baed viibility etimation methodology and 3D raterizing of the polygon, the probabilitic coverage of all cell of the 3D model wa calculated. Figure 4 illutrate the probabilitic coverage conidering (a) ditance, (b) direction and (c) both together. Figure 5 how the reult for the ame cae in a 2.5 rater dimenion model with 20 cm reolution. Comparing the reult (Table 1) indicate that the propoed trategy allow a more precie probabilitic coverage etimation compared to a rater model. A B (2) (3) 4. Concluion Thi paper propoed a novel method baed on 3D urban vector model for etimation of the coverage of wirele enor network. Thi method ha more advantage compared to raterbaed DSM/DEM model a it conider the coverage of all facet of feature like building and wall, and even under the feature uch a bridge and balconie. The propoed method for a probabilitic ening etimation model led to a more realitic coverage etimation for individual enor in a enor network in a 3D complex environment. 3

Short Paper Proceeding (a) (b) (c) Figure 4: Probabilitic coverage etimation in a 3D vector model: (a) direction (b) ditance, and (c) both together. (a) (b) (c) Figure 5: Probabilitic coverage etimation in a rater model: (a) direction (b) ditance, and (c) both together. Table 1. The comparion coverage probabilitic etimation in Rater and Vector model. Coverage probability Rater_20cm (m 2 ) Vector_without wall (m 2 ) Vector_with wall (m 2 ) Ditance 438.66 446.5768 691.6791 Direction 1329.570 1349.364 2073.376 Ditance & Direction 364.928 370.363 568.989 Reference Afghantoloee A, Doodman S, Karimipour F and Motafavi MA, 2014. Coverage Etimation of Geoenor in 3d Vector Environment, GIReearch 2014. Akbarzadeh V., Gagne C., Parizeau M, Argany M and Motafavi MA, 2013, Probabilitic ening model for enor placement optimization baed on line-of-ight coverage. IEEE Tranaction on Intrumentation and Meaurement. 62:293-303. Argany M, Motafavi MA, Gagné C, 2015. Context-Aware Local Optimization of Senor Network Deployment. Journal of Senor and Actuator Network (JSAN). 4(3): 160-188 Wang, Y., Cao, G., 2006. Movement-aited enor deployment, IEEE Infocom (INFOCOM 04), pp. 640-652. 4