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.

Slides:



Advertisements
Similar presentations
Self-Configurable Positioning Technique for Multi-hop Wireless Networks To appear in IEEE Transaction on Networking Chong Wang Center of Advanced Computer.
Advertisements

1 Sensor Deployment and Target Localization Based on Virtual Forces Y. Zou and K. Chakrabarty IEEE Infocom 2003 Conference, pp ,. ACM Transactions.
An Efficient Algorithm Based on Self-adapted Fuzzy C-Means Clustering for Detecting Communities in Complex Networks Jianzhi Jin 1, Yuhua Liu 1, Kaihua.
Computer Networks Group Universität Paderborn Ad hoc and Sensor Networks Chapter 9: Localization & positioning Holger Karl.
1 An Energy-Efficient Unequal Clustering Mechanism for Wireless Sensor Networks Chengfa Li, Mao Ye, Guihai Chen State Key Laboratory for Novel Software.
Locating in fingerprint space: wireless indoor localization with little human intervention. Proceedings of the 18th annual international conference on.
Routing in WSNs through analogies with electrostatics December 2005 L. Tzevelekas I. Stavrakakis.
An Authentication Service Based on Trust and Clustering in Wireless Ad Hoc Networks: Description and Security Evaluation Edith C.H. Ngai and Michael R.
Localization from Mere Connectivity Yi Shang (University of Missouri - Columbia); Wheeler Ruml (Palo Alto Research Center ); Ying Zhang; Markus Fromherz.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 16th Lecture Christian Schindelhauer.
Applied Geostatistics Geostatistical techniques are designed to evaluate the spatial structure of a variable, or the relationship between a value measured.
An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.
The Impact of Spatial Correlation on Routing with Compression in WSN Sundeep Pattem, Bhaskar Krishnamachri, Ramesh Govindan University of Southern California.
1 TTS: A Two-Tiered Scheduling Algorithm for Effective Energy Conservation in Wireless Sensor Networks Nurcan Tezcan & Wenye Wang Department of Electrical.
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.
Scalable and Distributed GPS free Positioning for Sensor Networks Rajagopal Iyengar and Biplab Sikdar Department of ECSE, Rensselaer Polytechnic Institute.
Load Balancing Routing Scheme in Mars Sensor Network CS 215 Winter 2001 Term Project Prof : Mario Gerla Tutor: Xiaoyan Hong Student : Hanbiao Wang & Qingying.
Mobile Filtering for Error-Bounded Data Collection in Sensor Networks Dan Wang Hong Kong Polytechnic Univ. Jianliang Xu ∗ Hong Kong Baptist Univ. Jiangchuan.
Yanyan Yang, Yunhuai Liu, and Lionel M. Ni Department of Computer Science and Engineering, Hong Kong University of Science and Technology IEEE MASS 2009.
A Distributed Localization Scheme for Wireless Sensor Networks with Improved Grid-Scan and Vector- Based Refinement Jang-Ping Sheu, Pei-Chun Chen, and.
1 Secure Cooperative MIMO Communications Under Active Compromised Nodes Liang Hong, McKenzie McNeal III, Wei Chen College of Engineering, Technology, and.
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,
Authors: Sheng-Po Kuo, Yu-Chee Tseng, Fang-Jing Wu, and Chun-Yu Lin
A scalable key pre-distribution mechanism for large-scale wireless sensor networks Author: A. N. Shen, S. Guo, H. Y. Chien and M. Y. Guo Source: Concurrency.
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.
Distributed Anomaly Detection in Wireless Sensor Networks Ksutharshan Rajasegarar, Christopher Leckie, Marimutha Palaniswami, James C. Bezdek IEEE ICCS2006(Institutions.
A Routing-Driven Elliptic Curve Cryptography Based Key Management Scheme for Heterogeneous Sensor Networks Author: Xiaojiang Du, Guizani M., Yang Xiao.
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.
Young-sam Kim / M.D Course School of Information Technology Dept. of Computer Engineering Korea University of Technology and Education Location Tracking.
A hybrid routing tree to avoid the energy hole problem in wireless sensor network Yuhua Liu, Wenwen Dai, Kaihua Xu, Meirong Zheng Department of Computer.
Distance Estimation by Constructing The Virtual Ruler in Anisotropic Sensor Networks Yun Wang,Kai Li, Jie Wu Southeast University, Nanjing, China, Temple.
A New Hybrid Wireless Sensor Network Localization System Ahmed A. Ahmed, Hongchi Shi, and Yi Shang Department of Computer Science University of Missouri-Columbia.
TOPOLOGY MANAGEMENT IN COGMESH: A CLUSTER-BASED COGNITIVE RADIO MESH NETWORK Tao Chen; Honggang Zhang; Maggio, G.M.; Chlamtac, I.; Communications, 2007.
RADAR: an In-building RF-based user location and tracking system
A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks IEEE Transactions on Computers, vol. 60, no. 11, November.
On the Topology of Wireless Sensor Networks Sen Yang, Xinbing Wang, Luoyi Fu Department of Electronic Engineering, Shanghai Jiao Tong University, China.
University “Ss. Cyril and Methodus” SKOPJE Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks Ass. Biljana Stojkoska.
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
Copyright © 2011, Scalable and Energy-Efficient Broadcasting in Multi-hop Cluster-Based Wireless Sensor Networks Long Cheng ∗ †, Sajal K. Das†,
Network Computing Laboratory 1 Vivaldi: A Decentralized Network Coordinate System Authors: Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris MIT Published.
Ching-Ju Lin Institute of Networking and Multimedia NTU
Adaptive Tracking in Distributed Wireless Sensor Networks Lizhi Yang, Chuan Feng, Jerzy W. Rozenblit, Haiyan Qiao The University of Arizona Electrical.
Computer Science 1 Using Clustering Information for Sensor Network Localization Haowen Chan, Mark Luk, and Adrian Perrig Carnegie Mellon University
Hole Detection and Boundary Recognition in Wireless Sensor Networks Kun-Ying Hsieh ( 謝坤穎 ) Dept. of Computer Science and Information Engineering National.
Ahmad Salam AlRefai.  Introduction  System Features  General Overview (general process)  Details of each component  Simulation Results  Considerations.
By: Aaron Dyreson Supervising Professor: Dr. Ioannis Schizas
Localized Low-Power Topology Control Algorithms in IEEE based Sensor Networks Jian Ma *, Min Gao *, Qian Zhang +, L. M. Ni *, and Wenwu Zhu +
2010 IEEE Fifth International Conference on networking, Architecture and Storage (NAS), pp , 2010 作者: Filip Cuckov and Min Song 指導教授:許子衡 教授 報告學生:馬敏修.
Efficient Pairwise Key Establishment Scheme Based on Random Pre-Distribution Keys in Wireless Sensor Networks Source: Lecture Notes in Computer Science,
Saran Jenjaturong, Chalermek Intanagonwiwat Department of Computer Engineering Chulalongkorn University Bangkok, Thailand IEEE CROWNCOM 2008 acceptance.
A Protocol for Tracking Mobile Targets using Sensor Networks H. Yang and B. Sikdar Department of Electrical, Computer and Systems Engineering Rensselaer.
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)
A Novel Virtual Anchor Node- based Localization Algorithm for Wireless Sensor Networks Pengxi Liu, Xinming Zhang, Shuang Tian, Zhiwei Zhao, Peng Sun Department.
Deploying Sensors for Maximum Coverage in Sensor Network Ruay-Shiung Chang Shuo-Hung Wang National Dong Hwa University IEEE International Wireless Communications.
A Low Interference Channel Assignment Algorithm for Wireless Mesh Networks Can Que 1,2, Xinming Zhang 1, and Shifang Dai 1 1.Department of Computer Science.
Energy Efficient Detection of Compromised Nodes in Wireless Sensor Networks Haengrae Cho Department of Computer Engineering, Yeungnam University Gyungbuk.
I owa S tate U niversity Laboratory for Advanced Networks (LAN) Coverage and Connectivity Control of Wireless Sensor Networks under Mobility Qiang QiuAhmed.
1 Power-efficient Clustering Routing Protocol Based on Applications in Wireless Sensor Network Authors: Tao Liu and Feng Li Form:International Conferecnce.
Presented by Edith Ngai MPhil Term 3 Presentation
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Localization for Anisotropic Sensor Networks
Presented by Prashant Duhoon
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Wireless Mesh Networks
Survey on Coverage Problems in Wireless Sensor Networks - 2
Edinburgh Napier University
Presentation transcript:

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 of Computer, Central China Normal University, Wuhan , China 2 Kaihua Xu College of Physical Science and Technology, Central China Normal University, Wuhan , China

Central China Normal University Introduction MDS-MAP Improved MDS-MAP Experiments and Simulations Conclusion References Outline

Central China Normal University A sensor network is composed of a large number of sensor nodes, which are densely deployed either inside the phenomenon or very close to it The goal of a sensor network is to perceive, collect and process the information of specific objects, and send the information to observers Localization plays a key role within the application of WSN Introduction (1/ 1)

Central China Normal University What is MDS-MAP Procedure of MDS-MAP MDS-MAP (1/ 3)

Central China Normal University MDS-MAP (2/ 3) What is MDS-MAP ? MDS( Multidimensional Scaling) is a set of data analysis technology which can transform the given data into geometry model, thus problems can be visually solved. Torgerson firstly given the terminology MDS based on the work of Richardson, and proposed the first MDS method.

Central China Normal University MDS-MAP (3/ 3) Procedure of MDS-MAP –Calculate the shortest distances between nodes in WSN –Calculate the first r maximum eigenvalues of r dimensional space to construct the relative location map of nodes –Transforms the relative location map to absolute location map

Central China Normal University Clustering Building Cluster Location Map Merging Cluster Location Map Improved MDS-MAP (1/ 9)

Central China Normal University Improved MDS-MAP (2/ 9) Clustering –Selection of Cluster Heads –Inter-cluster Nodes

Central China Normal University Improved MDS-MAP (3/ 9) Clustering –Selection of Cluster Heads Selection of cluster heads

Central China Normal University Improved MDS-MAP (4/ 9) Clustering –Inter-cluster Nodes Result of k-hop clustering

Central China Normal University Improved MDS-MAP (5/ 9) Building Cluster Location Map –Step 1: After k-hop clustering completed, each cluster head node calculates distance based on RSSI and the IDs of neighboring nodes[7]. Using the distance information which is expressed in a distance matrix and the shortest path algorithm, Dijkstra or Floyd, the cluster head node constructs a shortest distance matrix; –Step 2: Using this shortest distance matrix, the MDS-MAP algorithm produces a relative location map within the cluster; –Step 3: Refine cluster location map.

Central China Normal University Merging Cluster Location Map If have more than 3 nodes, than using formula (6) can transform the coordinates of nodes in Cluster-j to coordinates in Cluster-i: (6) where is zoom factor, depicts rotation transformation, indicates translation transformation, the technique of compute,, is shown as below. Suppose are coordinate matrices of nodes of in Cluster-i and Cluster-j. The row vector of are depicted by.The central points of are computed through formula (7). (7) Improved MDS-MAP (6/ 9)

Central China Normal University Merging Cluster Location Map Assume, the zoom factor s in formula (6) is calculated through formula (8). (8) The covariance matrix of can be computed by using formula (9). (9) Improved MDS-MAP (7/ 9)

Central China Normal University Merging Cluster Location Map Define matrix as formula (10): (10) Compute which is composed by eigenvalue of matrix : Compute R() of formula (6) using formula (11). (11) Improved MDS-MAP (8/ 9)

Central China Normal University Merging Cluster Location Map Compute through formula (12): (12) Using formula (6), (8), (11), (12), the matrix D (the nodes’ coordinate matrix of ) can be transformed to the coordinate system of Cluster-i, the technique is shown as formula (13). (13) where is a all-1 matrix which has an equal row number as matrix. Using this technique, all clusters’ location map can be merged to one location map. Improved MDS-MAP (9/ 9)

Central China Normal University Experiments and Simulations (1/ 4) Simulations of Two Types of WSN Localization Error with Connectivity

Central China Normal University Simulations of Two Types of WSN localization results where a sensor topology is configured in a C shape Experiments and Simulations (2/ 4)

Central China Normal University Simulations of Two Types of WSN localization results in a sensor topology with a horseshoe-shaped hole Experiments and Simulations (3/ 4)

Central China Normal University Localization Error with Connectivity Localization error with connectivity in C-shaped WSNs(a), horseshoe-shaped WSNs(b) Experiments and Simulations (4/ 4)

Central China Normal University Conclusion (1/ 1) This article proposes MDS-MAP(C,RF) algorithm based on conventional MDS-MAP. Simulation results indicate that MDS-MAP(C,RF) is better than MDS-MAP for it can improve localization accuracy. Since MDS-MAP(C,RF) is a cluster based technique which can reduce the burden of center nodes, it can extend lifespan of WSN. The next stage work is focus on the effect to WSN’s lifespan of MDS-MAP(C,RF).

Central China Normal University Referencs(1/ 1) 1 G. Mao, B. Fidan, B. Anderson. Wireless sensor network localization techniques[J]. Computer Networks. 51(10), (2007). 2 A. Pal. Localization algorithm in wireless sensor networks: Current approaches and future challenges. Network Protocols and Alogriths. 2(1), 45-73(2010). 3 G.D.Stefano and A. Petricola. A distributed AOA based localization algorithm for wireless sensor networks. Journal of Computers. 3(4), 1-8(2008). 4 Ewa Niewiadomska-szynkiewicz. Localization in wireless sensor networks: classification and evaluation of techniques. International Journal of Applied Mathematics and Computer Science. 22(2), (2012) 5Y. Shang, W. Ruml, Y. Zhang and M. Fromherz. Localization from mere connectivity. Proceeding of the 4th ACM international symposium on Mobile ad hoc networking & computing,ACM New York. pp, (2003) 6W. S. Torgeson. Multidimensional scaling of similarity. Psychometrika. 30(4),379–393(1965) 7Kaihua Xu, Ya Wang and Yuhua Liu. A Clustering Algorithm Based on Power for WSNs.Lecture Notes in Computer Science, Springer. 4489, (2007) 8Y. Shang, W. Ruml. Improved MDS-Based Localization[C]. INFOCOM 2004, Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies, Hong Kong, China. pp, (2004)