A Novel Virtual Anchor Node- based Localization Algorithm for Wireless Sensor Networks Pengxi Liu, Xinming Zhang, Shuang Tian, Zhiwei Zhao, Peng Sun Department.

Slides:



Advertisements
Similar presentations
Using Cramer-Rao-Lower-Bound to Reduce Complexity of Localization in Wireless Sensor Networks Dominik Lieckfeldt, Dirk Timmermann Department of Computer.
Advertisements

Bidding Protocols for Deploying Mobile Sensors Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic University.
GPS-Free Node Localization in Mobile Wireless Sensor Networks H¨useyin Akcan 1, Vassil Kriakov 1,Herv´e Br¨onnimann 1, Alex Delis 2 1 CIS Department Polytechnic.
Computer Networks Group Universität Paderborn Ad hoc and Sensor Networks Chapter 9: Localization & positioning Holger Karl.
TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application.
Range-Free Sensor Localization Simulations with ROCRSSI-based Algorithm Matt Magpayo
1 An Energy-Efficient Unequal Clustering Mechanism for Wireless Sensor Networks Chengfa Li, Mao Ye, Guihai Chen State Key Laboratory for Novel Software.
A Query-Based Routing Tree in Sensor Networks In Chul Song Yohan Roh Dongjoon Hyun Myoung Ho Kim GSN 2006 (Geosensor Network) 1.
Good afternoon everyone.
KAIST Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Suho Yang (September 4, 2008) Ming Ma, Yuanyuan Yang IEEE Transactions.
Using Auxiliary Sensors for Pair-Wise Key Establishment in WSN Source: Lecture Notes in Computer Science (2010) Authors: Qi Dong and Donggang Liu Presenter:
Target Tracking Algorithm based on Minimal Contour in Wireless Sensor Networks Jaehoon Jeong, Taehyun Hwang, Tian He, and David Du Department of Computer.
Impact of Mobility and Heterogeneity on Coverage and Energy Consumption in Wireless Sensor Networks Xiao Wang, Xinbing Wang, Jun Zhao Department of Electronic.
Edith C. H. Ngai1, Jiangchuan Liu2, and Michael R. Lyu1
Novel Self-Configurable Positioning Technique for Multihop Wireless Networks Authors : Hongyi Wu Chong Wang Nian-Feng Tzeng IEEE/ACM TRANSACTIONS ON NETWORKING,
Layered Diffusion based Coverage Control in Wireless Sensor Networks Wang, Bang; Fu, Cheng; Lim, Hock Beng; Local Computer Networks, LCN nd.
1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.
Probability Grid: A Location Estimation Scheme for Wireless Sensor Networks Presented by cychen Date : 3/7 In Secon (Sensor and Ad Hoc Communications and.
Jana van Greunen - 228a1 Analysis of Localization Algorithms for Sensor Networks Jana van Greunen.
Yanyan Yang, Yunhuai Liu, and Lionel M. Ni Department of Computer Science and Engineering, Hong Kong University of Science and Technology IEEE MASS 2009.
Delay Analysis of Large-scale Wireless Sensor Networks Jun Yin, Dominican University, River Forest, IL, USA, Yun Wang, Southern Illinois University Edwardsville,
Locating Sensors in the Wild: Pursuit of Ranging Quality Wei Xi, Yuan He, Yunhao Liu, Jizhong Zhao, Lufeng Mo, Zheng Yang, Jiliang Wang,
Speed and Direction Prediction- based localization for Mobile Wireless Sensor Networks Imane BENKHELIFA and Samira MOUSSAOUI Computer Science Department.
A Distributed Localization Scheme for Wireless Sensor Networks with Improved Grid-Scan and Vector- Based Refinement Jang-Ping Sheu, Pei-Chun Chen, and.
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
Sensor Positioning in Wireless Ad-hoc Sensor Networks Using Multidimensional Scaling Xiang Ji and Hongyuan Zha Dept. of Computer Science and Engineering,
Hongyu Gong, Lutian Zhao, Kainan Wang, Weijie Wu, Xinbing Wang
Introduction to Sensor Networks Rabie A. Ramadan, PhD Cairo University 3.
Localization With Mobile Anchor Points in Wireless Sensor Networks
A novel gossip-based sensing coverage algorithm for dense wireless sensor networks Vinh Tran-Quang a, Takumi Miyoshi a,b a Graduate School of Engineering,
Localization in Wireless Sensor Networks Shafagh Alikhani ELG 7178 Fall 2008.
2015/10/1 A color-theory-based energy efficient routing algorithm for mobile wireless sensor networks Tai-Jung Chang, Kuochen Wang, Yi-Ling Hsieh Department.
WMNL Sensors Deployment Enhancement by a Mobile Robot in Wireless Sensor Networks Ridha Soua, Leila Saidane, Pascale Minet 2010 IEEE Ninth International.
Tracking with Unreliable Node Sequences Ziguo Zhong, Ting Zhu, Dan Wang and Tian He Computer Science and Engineering, University of Minnesota Infocom 2009.
Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.
Multi-hop-based Monte Carlo Localization for Mobile Sensor Networks
1 Mobile-Assisted Localization in Wireless Sensor Networks Nissanka B.Priyantha, Hari Balakrishnan, Eric D. Demaine, Seth Teller IEEE INFOCOM 2005 March.
Relative Accuracy based Location Estimation in Wireless Ad Hoc Sensor Networks May Wong 1 Demet Aksoy 2 1 Intel, Inc. 2 University of California, Davis.
Distance Estimation by Constructing The Virtual Ruler in Anisotropic Sensor Networks Yun Wang,Kai Li, Jie Wu Southeast University, Nanjing, China, Temple.
Neighborhood-Based Topology Recognition in Sensor Networks S.P. Fekete, A. Kröller, D. Pfisterer, S. Fischer, and C. Buschmann Corby Ziesman.
1 Probabilistic Coverage in Wireless Sensor Networks Nadeem Ahmed, Salil S. Kanhere and Sanjay Jha Computer Science and Engineering, University of New.
Bounded relay hop mobile data gathering in wireless sensor networks
A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks IEEE Transactions on Computers, vol. 60, no. 11, November.
2017/4/25 INDOOR LOCALIZATION SYSTEM USING RSSI MEASUREMENT OF WIRELESS SENSOR NETWORK BASED ON ZIGBEE STANDARD Authors:Masashi Sugano, Tomonori Kawazoe,
Localization and Secure Localization. Learning Objectives Understand why WSNs need localization protocols Understand localization protocols in WSNs Understand.
Central China Normal University A Cluster-based and Range Free Multidimensional Scaling-MAP Localization Scheme in WSN 1 Ke Xu, Yuhua Liu ( ), Cui Xu School.
Redeployment for Mobile Wireless Sensor Networks Weihong Fan, Hengyang Zhang and Xuanping Cai Yunhui Liu Yunhui LiuJoint Center of Intelligent Sensing.
University “Ss. Cyril and Methodus” SKOPJE Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks Ass. Biljana Stojkoska.
© 2007 Sean A. Williams 1 Ecolocation: A Sequence Based Technique for RF Localization in Wireless Sensor Networks Authors: Kiran Yedavalli, Bhaskar Krishnamachari,
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
Adaptive Tracking in Distributed Wireless Sensor Networks Lizhi Yang, Chuan Feng, Jerzy W. Rozenblit, Haiyan Qiao The University of Arizona Electrical.
Hole Detection and Boundary Recognition in Wireless Sensor Networks Kun-Ying Hsieh ( 謝坤穎 ) Dept. of Computer Science and Information Engineering National.
Localized Low-Power Topology Control Algorithms in IEEE based Sensor Networks Jian Ma *, Min Gao *, Qian Zhang +, L. M. Ni *, and Wenwu Zhu +
Modeling End-to-end Distance for Given Number of Hops in Dense Planar Wireless Sensor Networks April Chan-Myung Kim
1 GPS-Free-Free Positioning System for Wireless Sensor Networks Farid Benbadis, Timur Friedman, Marcelo Dias de Amorim, and Serge Fdida IEEE WCCN 2005.
ICIIS Peradeniya, Sri Lanka1 An Enhanced Top-Down Cluster and Cluster Tree Formation Algorithm for Wireless Sensor Networks H. M. N. Dilum Bandara,
A Load-Balanced Guiding Navigation Protocol in Wireless Sensor Networks Wen-Tsuen Chen Department of Computer Science National Tsing Hua University Po-Yu.
A Key Management Scheme for Wireless Sensor Networks Using Deployment Knowledge Wenliang Du et al.
Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Ming Ma and Yuanyuan Yang Department of Electrical & Computer Engineering.
SenSys 2003 Differentiated Surveillance for Sensor Networks Ting Yan Tian He John A. Stankovic Department of Computer Science, University of Virginia November.
HCRL: A Hop-Count-Ratio based Localization in Wireless Sensor Networks Sungwon Yang, Jiyoung Yi and Hojung Cha Department of Computer Science, Yonsei University,
Younghwan Yoo† and Dharma P. Agrawal‡ † School of Computer Science and Engineering, Pusan National University, Busan, KOREA ‡ OBR Center for Distributed.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Zijian Wang, Eyuphan Bulut, and Boleslaw K. Szymanski Center for Pervasive Computing and Networking and Department of Computer Science Rensselaer Polytechnic.
A Coverage-Preserving and Hole Tolerant Based Scheme for the Irregular Sensing Range in WSNs Azzedine Boukerche, Xin Fei PARADISE Research Lab Univeristy.
Distributed Localization Using a Moving Beacon in Wireless Sensor Networks IEEE Transactions on Parallel and Distributed System, Vol. 19, No. 5, May 2008.
Density-Aware Hop-Count Localization (DHL) in Wireless Sensor Networks with Variable Density Sau Yee Wong 1,2, Joo Chee Lim 1, SV Rao 1, Winston KG Seah.
Straight Line Routing for Wireless Sensor Networks Cheng-Fu Chou, Jia-Jang Su, and Chao-Yu Chen Computer Science and Information Engineering Dept., National.
Fast Localization for Emergency Monitoring and Rescue in Disaster Scenarios Based on WSN SPEAKER:Jyun-Ying Yu ADVISOR:DR. Kai-Wei Ke DATE:2018/05/04.
Presentation transcript:

A Novel Virtual Anchor Node- based Localization Algorithm for Wireless Sensor Networks Pengxi Liu, Xinming Zhang, Shuang Tian, Zhiwei Zhao, Peng Sun Department of Computer Science and Technology University of Science and Technology of China International Conference on Networking 2007

Outline Introduction Error analysis of typical localization algorithms Virtual Anchor Node-based Localization Algorithm (VANLA) Performance evaluation Conclusion

Introduction WSNs usually are arranged at special scout region, and sense special physics information in the region. Sensor nodes are often deployed by random bestrewing. The application of WSNs is often related to the positions of nodes. So the localization of sensor nodes has become a hot topic in WSNs.

Introduction Most of the existent researches suppose The network includes a small number of anchor nodes. The existence of various errors The location precision will be restricted Some nodes even cannot be located. The improvement of localization precision with lower cost less energy consumption less hardware support

Introduction The new algorithm finds out virtual anchors to provide highly precise positions for unknowns nodes to assist in locating the rest unknowns along with primary real anchors.

Error analysis of typical localization algorithms The authors choose two concrete algorithms to carry out error analysis. Euclidean Range-Based DV-hop Range-Free

Error analysis of typical localization algorithms - Euclidean Each sensor has ability to measure their relative distance. A B C L1 D α β L3 L2

Error analysis of typical localization algorithms - Euclidean The draw back of Euclidean The ranging error is the main flaw of Range-based algorithm. This error can be accumulated hop by hop.

Error analysis of typical localization algorithms – DV-hop DV-hop Use the corrected factor c i to fixed the hop distance. A B C X cAcA

Error analysis of typical localization algorithms – DV-hop The draw back of DV-hop In practical application, the communication range of each node is not a standard circle ideally.

Error analysis of typical localization algorithms – DV-hop A BC n-hop n*rn*r/2 The corrected factor is (3n*r/2*2n)=3r/4 Distance AC is n* 3r/4 =3n*r/4 The error is n*r-(3n*r/4)=n*r/4 This error can be accumulated hop by hop.

Virtual anchor node-based localization algorithm There can be only a few anchor nodes deployed in the network due to high cost and energy issue Virtual anchor node-based localization algorithm The Selection of Virtual Anchor Node The Upgrade of Virtual Anchor Node

Virtual anchor node-based localization algorithm Assumption The WSN is a dense network There are few anchor node in the network The shape of the path with the smallest hop count is asymptotic to a beeline

Virtual anchor node-based localization algorithm Scenario A C B D UEUE y

Virtual anchor node-based localization algorithm The Selection of Virtual Anchor Node A B C Hop A =1 x Compare Hop with “Hop A =n A ” If the hop has not received or is smaller than present hop Store Hop A =n A Hop A =n A Hop B =n B Hop C =n C Hop A =n A Hop B =0 Hop C =n C D

Virtual anchor node-based localization algorithm The Selection of Virtual Anchor Node A B C Hop A =n A Hop B =0 Hop C =n C Hop D =n d y Hop A =A y Hop B =B y Hop C =C y Hop D =D y IF A y +B y =n A candidate virtual anchor D

Virtual anchor node-based localization algorithm A B If Max(hop A, hop B ) – Min(hop A, hop B )= shortest path AB, it is also an candidate anchor y Hop A =n A Hop B =n B n AB nBnB n A = n AB +n B n A - n B =n AB

Virtual anchor node-based localization algorithm The Selection of Virtual Anchor Node A B C D

Virtual anchor node-based localization algorithm The Upgrade of Virtual Anchor Node A B C D UEUE

Virtual anchor node-based localization algorithm A C B D UEUE Node U E can upgrade as a anchor node

Virtual anchor node-based localization algorithm Node U E can upgrade as a anchor node W Y X Z UHUH UFUF UGUG

Virtual anchor node-based localization algorithm A C B D UEUE Calculate U E ’ s position (Xb,Yb)(Xb,Yb) (Xa,Ya)(Xa,Ya) (Xd,Yd)(Xd,Yd) (Xc,Yc)(Xc,Yc) (Xe,Ye)(Xe,Ye)

Virtual anchor node-based localization algorithm A C B D UEUE Calculate U E ’ s position F G

Performance evaluation Compiler: oCaml Language: caml OS: Cygwin

Performance evaluation Random deployment Field:32000m x 32000m Radius: 2200m 500nodes Ranging error 20%~50%

Performance evaluation

Random deployment Field:10000m x 10000m Radius: 2100m 500nodes

Performance evaluation

Conclusion In this paper, the authors proposed a distributed algorithm for virtual anchor nodes upgrading it can increase the density of virtual anchor nodes at low physical cost assist some algorithms which already exist to enhance the precision of localization in the network with dense nodes