Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University.

Slides:

Advertisements

Similar presentations

Victor K. Y. Wu Department of Electrical Engineering

Advertisements

Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.

Fast and Reliable Estimation Schemes in RFID Systems Murali Kodialam and Thyaga Nandagopal Bell Labs, Lucent Technologies.

Every Bit Counts – Fast and Scalable RFID Estimation Muhammad Shahzad and Alex X. Liu Dept. of Computer Science and Engineering Michigan State University.

KAIST Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Suho Yang (September 4, 2008) Ming Ma, Yuanyuan Yang IEEE Transactions.

Secure Unlocking of Mobile Touch Screen Devices by Simple Gestures – You can see it but you can not do it Arjmand Samuel Microsoft Research Muhammad Shahzad.

LightFlood: An Optimal Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.

1 Data Persistence in Large-scale Sensor Networks with Decentralized Fountain Codes Yunfeng Lin, Ben Liang, Baochun Li INFOCOM 2007.

Department of Electrical Engineering National Chung Cheng University, Taiwan IEEE ICHQP 10, 2002, Rio de Janeiro NCCU Gary W. Chang Paulo F. Ribeiro Department.

Adaptive Splitting Protocols for RFID Tag Collision Arbitration Jihoon Myung and Wonjun Lee ACM Mobihoc 06.

Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.

Power Efficient IP Lookup with Supernode Caching Lu Peng, Wencheng Lu*, and Lide Duan Dept. of Electrical & Computer Engineering Louisiana State University.

Solving Probabilistic Combinatorial Games Ling Zhao & Martin Mueller University of Alberta September 7, 2005 Paper link:

ICNP'061 Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta and Samir Das Computer Science Department Stony Brook University.

SafeQ: Secure and Efficient Query Processing in Sensor Networks Fei Chen and Alex X. Liu Department of Computer Science and Engineering Michigan State.

Reliable Reporting of Delay-Sensitive Events in Wireless Sensor-Actuator Networks Edith C.-H. Ngai †, Yangfan Zhou †, Michael R. Lyu †, and Jiangchuan.

Dynamic Localization Control for Mobile Sensor Networks S. Tilak, V. Kolar, N. Abu-Ghazaleh, K. Kang (Computer Science Department, SUNY Binghamton)

TPS: A Time-Based Positioning Scheme for outdoor Wireless Sensor Networks Authors: Xiuzhen Cheng, Andrew Thaeler, Guoliang Xue, Dechang Chen From IEEE.

Optimizing Lifetime for Continuous Data Aggregation With Precision Guarantees in Wireless Sensor Networks Xueyan Tang and Jianliang Xu IEEE/ACM TRANSACTIONS.

RFID Cardinality Estimation with Blocker Tags

Lesson Title: Singulation Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas 1 This material.

Mobile Filtering for Error-Bounded Data Collection in Sensor Networks Dan Wang Hong Kong Polytechnic Univ. Jianliang Xu ∗ Hong Kong Baptist Univ. Jiangchuan.

CH 1 Introduction Prof. Ming-Shaung Ju Dept. of Mechanical Engineering NCKU.

Yanyan Yang, Yunhuai Liu, and Lionel M. Ni Department of Computer Science and Engineering, Hong Kong University of Science and Technology IEEE MASS 2009.

“SDJS: Efficient Statistics in Wireless Networks” Albert Krohn, Michael Beigl, Sabin Wendhack TecO (Telecooperation Office) Institut für Telematik Universität.

RFID and Positioning. Outline RFID Introduction Indoor Localization RFID positioning Algorithm – LANDMARC – RFID-Based 3-D Positioning Schemes RFID application.

Fast and Reliable Estimation Schemes in RFID Systems Murali Kodialam and Thyaga Nandagopal Bell Labs, Lucent Technologies Presented by : Joseph Gunawan.

1 Cardinality Estimation for Large-scale RFID Systems Chen Qian, Hoilun Ngan, and Yunhao Liu Hong Kong University of Science and Technology.

COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,

A Distributed and Privacy Preserving Algorithm for Identifying Information Hubs in Social Networks M.U. Ilyas, Z Shafiq, Alex Liu, H Radha Michigan State.

MAXIMIZING SPECTRUM UTILIZATION OF COGNITIVE RADIO NETWORKS USING CHANNEL ALLOCATION AND POWER CONTROL Anh Tuan Hoang and Ying-Chang Liang Vehicular Technology.

International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.

Sensor Positioning in Wireless Ad-hoc Sensor Networks Using Multidimensional Scaling Xiang Ji and Hongyuan Zha Dept. of Computer Science and Engineering,

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.

Mapping and Localization with RFID Technology Matthai Philipose, Kenneth P Fishkin, Dieter Fox, Dirk Hahnel, Wolfram Burgard Presenter: Aniket Shah.

A Dedicated Multi-channel MAC Protocol Design for VANET with Adaptive Broadcasting Ning Lu 1, Yusheng Ji 2, Fuqiang Liu 1, and Xinhong Wang 1 1 Dept. of.

Noise Can Help: Accurate and Efficient Per-flow Latency Measurement without Packet Probing and Time Stamping Dept. of Computer Science and Engineering.

Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Medium Access Control Sublayer Chapter.

Wireless Sensor Networks In-Network Relational Databases Jocelyn Botello.

Prophet Address Allocation for Large Scale MANETs Matt W. Mutka Dept. of Computer Science & Engineering Michigan State University East Lansing, USA IEEE.

Multi-Criteria Routing in Pervasive Environment with Sensors Santhanakrishnan, G., Li, Q., Beaver, J., Chrysanthis, P.K., Amer, A. and Labrinidis, A Department.

Dave McKenney 1.  Introduction  Algorithms/Approaches  Tiny Aggregation (TAG)  Synopsis Diffusion (SD)  Tributaries and Deltas (TD)  OPAG  Exact.

Advanced Spectrum Management in Multicell OFDMA Networks enabling Cognitive Radio Usage F. Bernardo, J. Pérez-Romero, O. Sallent, R. Agustí Radio Communications.

/ 22 1 A Distributed and Efficient Flooding Scheme Using 1-hop Information in Mobile Ad Hoc Networks Hai Liu Xiaohua Jia Peng-Jun Wan Dept. of Comput.

APL: Autonomous Passive Localization for Wireless Sensors Deployed in Road Networks IEEE INFOCOM 2008, Phoenix, AZ, USA Jaehoon Jeong, Shuo Guo, Tian He.

RFID E STIMATION P ROBLEM Lee, Gunhee S URVEY. R EFERENCES Energy Efficient Algorithms for the RFID Estimation Problem –Tao Li, Samuel Wu, Shigang Chen.

1 TBD: Trajectory-Based Data Forwarding for Light-Traffic Vehicular Networks IEEE ICDCS’09, Montreal, Quebec, Canada Jaehoon Jeong, Shuo Gu, Yu Gu, Tian.

Dr. Sudharman K. Jayaweera and Amila Kariyapperuma ECE Department University of New Mexico Ankur Sharma Department of ECE Indian Institute of Technology,

MMAC: A Mobility- Adaptive, Collision-Free MAC Protocol for Wireless Sensor Networks Muneeb Ali, Tashfeen Suleman, and Zartash Afzal Uzmi IEEE Performance,

LightFlood: An Efficient Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.

Fairness Matters: Identification of Active RFID Tags with Statistically Guaranteed Fairness Michigan State University Muhammad Shahzad Alex X. Liu North.

Fast Join and Synchronization Schema in the IEEE e MAC

Toward a Packet Duplication Control for Opportunistic Routing in WSNs Georgios Z. Papadopoulos, Julien Beaudaux, Antoine Gallais, Periklis Chatzimisios,

Secure Unlocking of Mobile Touch Screen Devices by Simple Gestures – You can see it but you can not do it Muhammad Shahzad, Alex X. Liu Michigan State.

Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering

Enhanced MAC Protocol to reduce latency in Wireless Sensor Network Myungsub Lee 1, Changhyeon Park 2 1 Department of Computer Technology, Yeungnam College.

Computer Science Department of University of Virginia  Voltage on a tag Radio Frequency Identification Systems New Ideas and Algorithms Introduction to.

Model Fusion and its Use in Earth Sciences R. Romero, O. Ochoa, A. A. Velasco, and V. Kreinovich Joint Annual Meeting NSF Division of Human Resource Development.

Chapter 8 – Tree-based Anti-Collision Protocols for RFID tags

A Reliability-oriented Transmission Service in Wireless Sensor Networks Yunhuai Liu, Yanmin Zhu and Lionel Ni Computer Science and Engineering Hong Kong.

Every Bit Counts – Fast and Scalable RFID Estimation

RM-MAC: A Routing-Enhanced Multi-Channel MAC Protocol in Duty-Cycle Sensor Networks Ye Liu, Hao Liu, Qing Yang, and Shaoen Wu In Proceedings of the IEEE.

Identifying the Missing Tags in a Large RFID System Tao Li (University of Florida, US) Shigang Chen (University of Florida, US) Yibei Ling (Telcordia Technologies,

Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.

On Detecting Termination in Cognitive Radio Networks Shantanu Sharma 1 and Awadhesh Kumar Singh 2 1 Ben-Gurion University of the Negev, Israel 2 National.

A Stochastic Frame Based Approach to RFID Tag Searching Ann L. Wang Dept. of Computer Science and Engineering Michigan State University Joint work with.

Sensing multiple passive tags simultaneously

by Xiang Mao and Qin Chen

Chapter 9 - A Comparison of TTF and RTF UHF RFID Protocols

Presentation transcript:

Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University East Lansing, Michigan, 48824, USA

2 RFID is everywhere Muhammad Shahzad

3 Radio Frequency Identification Muhammad Shahzad

4 Tree Walking (EPCGlobal Standard) Number of queries: Muhammad Shahzad

5 Optimizing Tree Walking Muhammad Shahzad  Total queries = successful + collisions + empty  Minimize total queries

6 Limitations of Prior Art  All prior work proposes heuristics to reduce identification time ─ MobiHoc’06, PerCom’07, INFOCOM’09, ICDCS’10  No formal model of the Tree Walking process ─ No optimality results Muhammad Shahzad

7 Our Modeling of Tree Walking (Hypergeometric distribution) Level l Position p n=16 m=4 Muhammad Shahzad

8 Proposed Approach 1.Estimate unidentified tag population size 2.Find optimal level and the first unvisited node 3.Perform Tree Walking. Go to step 1 Muhammad Shahzad

9 Population Size Estimation  First time estimation: rough, but fast ─ We adapt a fast scheme proposed by Flajolet and Martin in the database community in ─ Did not use accurate RFID estimation schemes  Subsequent estimation = estimated tags - identified tags Muhammad Shahzad

10 Calculating Optimal Level Muhammad Shahzad

11 Muhammad Shahzad

12 Tree Hopping vs. Tree Walking Muhammad Shahzad

13 Tree Hopping Example Number of queries: 11 (compared to 16 of TW) Muhammad Shahzad

14 Experimental Evaluation  Implemented 8 protocols in addition to TH 1.BS (IEEE Trans. on Information Theory, 1979) 2.ABS (MobiHoc, 2006) 3.TW (DIAL-M 2000) 4.ATW (Tanenbaum, 2002) 5.STT (Infocom, 2009) 6.MAS (PerCom, 2007) 7.ASAP (ICDCS 2010) 8.Frame Slotted Aloha (IEEE Transactions on Communications, 2005) Muhammad Shahzad

15 Improvement of TH over prior art  Uniformly distributed populations ─ Total number of queries: 50% ─ Identification time: 10% ─ Average responses per tag: 30%  Non-uniformly distributed populations ─ Total number of queries: 26% ─ Identification time: 37% ─ Average responses per tag: 26% Muhammad Shahzad

16 Normalized Queries Muhammad Shahzad

17 Identification Speed Muhammad Shahzad

18 Normalized Collisions Muhammad Shahzad

19 Normalized Empty Reads Muhammad Shahzad

20 Conclusion  First effort towards modeling the Tree Walking process  Proposed a method to minimize the expected number of queries  More in the paper ─ Method to make TH reliable in the presence of communication errors ─ Continuous scanning of dynamically changing tag populations ─ Multiple readers environment with overlapping regions  Comprehensive side-by-side comparison of TH with 8 major prior tag identification protocols Muhammad Shahzad

21 Questions? Muhammad Shahzad