On the Implications of the Log-normal Path Loss Model: An Efficient Method to Deploy and Move Sensor Motes Yin Chen, Andreas Terzis November 2, 2011.

Slides:



Advertisements
Similar presentations
Giovanni Zanca, Francesco Zorzi, Andrea Zanella and Michele Zorzi
Advertisements

Communications Research Centre (CRC) Defence R&D Canada – Ottawa 1 Properties of Mobile Tactical Radio Networks on VHF Bands Li Li & Phil Vigneron Communications.
FM-BASED INDOOR LOCALIZATION TsungYun 1.
Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.
Fault-Tolerant Target Detection in Sensor Networks Min Ding +, Dechang Chen *, Andrew Thaeler +, and Xiuzhen Cheng + + Department of Computer Science,
Understanding Packet Delivery Performance in Dense Wireless Sensor Networks Jerry Zhao & Ramesh Govindan SenSys ‘03.
SELECT: Self-Learning Collision Avoidance for Wireless Networks Chun-Cheng Chen, Eunsoo, Seo, Hwangnam Kim, and Haiyun Luo Department of Computer Science,
Exploiting Sparse Markov and Covariance Structure in Multiresolution Models Presenter: Zhe Chen ECE / CMR Tennessee Technological University October 22,
Constructing Popular Routes from Uncertain Trajectories Ling-Yin Wei 1, Yu Zheng 2, Wen-Chih Peng 1 1 National Chiao Tung University, Taiwan 2 Microsoft.
Institute for Software Integrated Systems Vanderbilt University Node Density Independent Localization Presented by: Brano Kusy B.Kusy, M.Maroti, G.Balogh,
Error Estimation for Indoor Location Fingerprinting.
1 School of Computing Science Simon Fraser University, Canada PCP: A Probabilistic Coverage Protocol for Wireless Sensor Networks Mohamed Hefeeda and Hossein.
1/24 Passive Interference Measurement in Wireless Sensor Networks Shucheng Liu 1,2, Guoliang Xing 3, Hongwei Zhang 4, Jianping Wang 2, Jun Huang 3, Mo.
Radio Propagation Spring 07 CS 527 – Lecture 3. Overview Motivation Block diagram of a radio Signal Propagation  Large scale path loss  Small scale.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Theory of Interferences, Trade-Offs between.
1 ENHANCED RSSI-BASED HIGH ACCURACY REAL-TIME USER LOCATION TRACKING SYSTEM FOR INDOOR AND OUTDOOR ENVIRONMENTS Department of Computer Science and Information.
Semantic text features from small world graphs Jure Leskovec, IJS + CMU John Shawe-Taylor, Southampton.
Enhancing RSSI-based Tracking Accuracy in Wireless Sensor Networks
Networked Slepian–Wolf: Theory, Algorithms, and Scaling Laws R˘azvan Cristescu, Member, IEEE, Baltasar Beferull-Lozano, Member, IEEE, Martin Vetterli,
The Impact of Spatial Correlation on Routing with Compression in WSN Sundeep Pattem, Bhaskar Krishnamachri, Ramesh Govindan University of Southern California.
Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks.
Bluenet a New Scatternet Formation Scheme * Huseyin Ozgur Tan * Zifang Wang,Robert J.Thomas, Zygmunt Haas ECE Cornell Univ*
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
CC2420 Channel and RSSI Evaluation Nov/22/2006 Dept. of EECS, UC Berkeley C O nnect vityLab i.
1 OUTLINE Motivation Distributed Measurements Importance Sampling Results Conclusions.
EEE440 Modern Communication Systems Wireless and Mobile Communications.
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha Presented by Ray Lam Oct 23, 2004.
Energy Conservation in wireless sensor networks Kshitij Desai, Mayuresh Randive, Animesh Nandanwar.
BluEyes Bluetooth Localization and Tracking Ei Darli Aung Jonathan Yang Dae-Ki Cho Mario Gerla Ei Darli Aung Jonathan Yang Dae-Ki Cho Mario Gerla.
Experimental study of the effects of Transmission Power Control and Blacklisting in Wireless Sensor Networks Dongjin Son, Bhaskar Krishnamachari and John.
Basics of Wireless Locationing Mikko Asikainen, Msc University of Eastern Finland Department of Computer Science.
Energy Saving In Sensor Network Using Specialized Nodes Shahab Salehi EE 695.
Harnessing Mobile Multiple Access Efficiency with Location Input Wan Du * and Mo Li School of Computer Engineering Nanyang Technological University, Singapore.
Wireless Sensor Networking for “Hot” Applications: Effects of Temperature on Signal Strength, Data Collection and Localization.
LPT for Data Aggregation in Wireless Sensor Networks Marc Lee and Vincent W.S. Wong Department of Electrical and Computer Engineering, University of British.
Authors: Sheng-Po Kuo, Yu-Chee Tseng, Fang-Jing Wu, and Chun-Yu Lin
Hongyu Gong, Lutian Zhao, Kainan Wang, Weijie Wu, Xinbing Wang
Target Tracking with Binary Proximity Sensors: Fundamental Limits, Minimal Descriptions, and Algorithms N. Shrivastava, R. Mudumbai, U. Madhow, and S.
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha.
RushNet: Practical Traffic Prioritization for Saturated Wireless Sensor Networks Chieh-Jan Mike Liang †, Kaifei Chen ‡, Nissanka Bodhi Priyantha †, Jie.
Stochastic sleep scheduling (SSS) for large scale wireless sensor networks Yaxiong Zhao Jie Wu Computer and Information Sciences Temple University.
Minimal Hop Count Path Routing Algorithm for Mobile Sensor Networks Jae-Young Choi, Jun-Hui Lee, and Yeong-Jee Chung Dept. of Computer Engineering, College.
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
Link Range and (In)Stability on Sensor Network Architecture Bhaskaran Raman, Kameswari Chebrolu, Naveen Madabhushi, Dattatraya Y. Gokhale, Phani K. Valiveti,
KTH Royal Institute of Technology.  Background  Problem  Goals  Communication Protocols  Proposed Solutions  Experiments  Data & Conclusions 
1 EnviroStore: A Cooperative Storage System for Disconnected Operation in Sensor Networks Liqian Luo, Chengdu Huang, Tarek Abdelzaher John Stankovic INFOCOM.
1/30 Energy-Efficient Forwarding Strategies for Geographic Routing in Lossy Wireless Sensor Networks Wireless and Sensor Network Seminar Dec 01, 2004.
Doc.: IEEE /0553r1 Submission May 2009 Alexander Maltsev, Intel Corp.Slide 1 Path Loss Model Development for TGad Channel Models Date:
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
Whitespace Measurement and Virtual Backbone Construction for Cognitive Radio Networks: From the Social Perspective Shouling Ji and Raheem Beyah Georgia.
College of Engineering Anchor Nodes Placement for Effective Passive Localization Karthikeyan Pasupathy Major Advisor: Dr. Robert Akl Department of Computer.
A Passive Approach to Sensor Network Localization Rahul Biswas and Sebastian Thrun International Conference on Intelligent Robots and Systems 2004 Presented.
Network and Systems Laboratory nslab.ee.ntu.edu.tw Branislav Kusy, Christian Richter, Wen Hu, Mikhail Afanasyev, Raja Jurdak, Michael Brunig, David Abbott,
By Naeem Amjad 1.  Challenges  Introduction  Motivation  First Order Radio Model  Proposed Scheme  Simulations And Results  Conclusion 2.
Maximizing Lifetime per Unit Cost in Wireless Sensor Networks
Network/Computer Security Workshop, May 06 The Robustness of Localization Algorithms to Signal Strength Attacks A Comparative Study Yingying Chen, Konstantinos.
Research & development Hendrik Schmidt France Telecom NSM/RD/RESA/NET SpasWin07, Limassol, Cyprus 16 April 2007 Comparison.
Investigating a Physically-Based Signal Power Model for Robust Low Power Wireless Link Simulation Tal Rusak, Philip Levis MSWIM 2008.
1 Travel Times from Mobile Sensors Ram Rajagopal, Raffi Sevlian and Pravin Varaiya University of California, Berkeley Singapore Road Traffic Control TexPoint.
Optimal Relay Placement for Indoor Sensor Networks Cuiyao Xue †, Yanmin Zhu †, Lei Ni †, Minglu Li †, Bo Li ‡ † Shanghai Jiao Tong University ‡ HK University.
ECE637 : Fundamentals of Wireless Communications
A Place-based Model for the Internet Topology Xiaotao Cai Victor T.-S. Shi William Perrizo NDSU {Xiaotao.cai, Victor.shi,
PROJECT DOMAIN : NETWORK SECURITY Project Members : M.Ananda Vadivelan & E.Kalaivanan Department of Computer Science.
A Measurement Study of Interference Modeling and Scheduling in LPWN Ritesh Maheshwari, Shweta Jain, Samir R. Das Department of Computer Science Stony Brook.
Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors
Combating Tag Cloning with COTS RFID Devices
Coverage and Connectivity in Sensor Networks
Indoor Location Estimation Using Multiple Wireless Technologies
Edinburgh Napier University
SpecSense: Crowdsensing for Efficient Querying of Spectrum Occupancy
Presentation transcript:

On the Implications of the Log-normal Path Loss Model: An Efficient Method to Deploy and Move Sensor Motes Yin Chen, Andreas Terzis November 2, 2011

What to do about the transitional region?What to do about the transitional region? –Place motes in the transitional region vs in the connected region Transitional region 2 Connected region

Our Proposal Occupy the transitional regionOccupy the transitional region –Perform random trials to construct links with high PRR –Based on the Log-normal radio model 3

Motivation: Placing Relay Nodes 4

Outline Introduce log-normal path loss model Discuss pitfalls Present the experimental results – reality check 5

Log-normal Path Loss Model Power of the transmitted signal Path loss exponent Random variation Sender Receiver 6

Three Regions of Radio Links 7

Connected Region In connected region PRR is very likely to be high Trying one location will likely produce good link Sender Receiver 5 meters 8

Transitional Region In transitional region PRR may or may not be high Trying a few spots should yield a good link Sender Receiver 15 meters 9

Disconnected Region In disconnected region PRR is very unlikely to be high Trying multiple spots seems worthless Sender Receiver 40 meters 10

Outline Introduce log-normal path loss model Discuss pitfalls Present the experimental results – reality check 11

Pitfalls Log-normal path loss model is not perfect The Gaussian variation in signal strength is a statistical observation Signal strengths at nearby locations are correlated 12

Reality Check Verify log-normal path loss model Quantify spatial correlations Count number of trials to construct good links Investigate temporal variations 13

Experimental Setup Devices –TelosB motes –iRobot with an Ebox-3854 running Linux Environments –Outdoor parking lot –Lawn –Indoor hallway –Indoor testbed –Two forests 14

Evaluations on the Log-normal Model 15

Q-Q Plot of the Residual RSSI Values 16

Reality Check Verify log-normal path loss model Quantify spatial correlations Count number of trials to construct good links Investigate temporal variations 17

Spatial Correlation PRR measurements at a parking lot –iRobot moves in a 2-d plane (the ground) –Black cell : PRR below 85%; Gray cell : PRR above 85% 18

Reality Check Verify log-normal path loss model Quantify spatial correlations Count number of trials to construct good links Investigate temporal variations 19

Number of Trials - Configuration Grid sampling –Bernoulli trials Number of trials to find a good PRR is geometrically distributed 1 meter 20

Number of Trials - Results 21

Number of Trials – Fitting Geometric Distribution Suggests that 1 meter ensures independent trials. 22

Connecting Two Motes Mote A Mote B Relay  TAR: number of trials to connect to A  TBR: number of trials to connect to B  TARB: number of trials to connect to both A and B 23

Reality Check Verify log-normal path loss model Quantify spatial correlations Count number of trials to construct good links Investigate temporal variations 24

Temporal Variation Box plots of residual RSSI values for two forests 25

Conclusion Log-normal model fits sensornets Signal correlation vanishes at 1 meter separation Easy to find good links in the transitional region –Rule of thumb: at twice the length of connected region, number of trials is less than 5 with high probability 26

Application – Placing Relay Nodes Number of relay nodes at large scale –Place 120 sensor motes in an area of size 800m by 800m –Run Steiner Tree algorithm to place relay nodes 27

Application – Mobile Sensor Networks Mobile sink –If the current spot yields low PRR, move 1 meter –Minimize travel distance Mobile motes Signal variation in the space domain Signal variation in the time domain 28

Thank you! Questions? 29