KAIST Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks Suho Yang (CS710: November 4, 2008) Kyle Jamieson, Hari Balakrishnan, Y.C. Tay LNCS.

Slides:

Advertisements

Similar presentations

Nick Feamster CS 4251 Computer Networking II Spring 2008

Advertisements

Medium Access Issues David Holmer

Channel Allocation Protocols. Dynamic Channel Allocation Parameters Station Model. –N independent stations, each acting as a Poisson Process for the purpose.

Fundamentals of Computer Networks ECE 478/578

Routing Protocols for Sensor Networks Presented by Siva Desaraju Computer Science WMU An Application Specific Protocol Architecture for Wireless Microsensor.

An Application-Specific Protocol Architecture for Wireless Microsensor Networks Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan (MIT)

Multiple access What if multiple machines are sharing the same link?

An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Network

Sift: A MAC Protocol for Event- Driven Wireless Sensor Networks Kyle Jamieson †, Hari Balakrishnan †, Y.C. Tay ‡ † MIT Computer Science and Artificial.

1 A Novel Topology-blind Fair Medium Access Control for Wireless LAN and Ad Hoc Networks Z. Y. Fang and B. Bensaou Computer Science Department Hong Kong.

On Optimizing Backoff Counter Reservation and Classifying Stations for the IEEE Distributed Wireless LANs.

Dynamic Tuning of the IEEE Protocol to Achieve a Theoretical Throughput Limit Frederico Calì, Marco Conti, and Enrico Gregori IEEE/ACM TRANSACTIONS.

PEDS September 18, 2006 Power Efficient System for Sensor Networks1 S. Coleri, A. Puri and P. Varaiya UC Berkeley Eighth IEEE International Symposium on.

Distributed systems Module 1 -Basic networking Teaching unit 1 – LAN standards Ernesto Damiani University of Bozen-Bolzano Lesson 2 – LAN Medium Access.

MAC Protocols Media Access Control (who gets the use the channel) zContention-based yALOHA and Slotted ALOHA. yCSMA. yCSMA/CD. TDM and FDM are inefficient.

CS 5253 Workshop 1 MAC Protocol and Traffic Model.

CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 17 Introduction to Computer Networks.

Copyright © 2003, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Chapter 6 Multiple Radio Access.

1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 7th Lecture Christian Schindelhauer.

CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 16 Introduction to Computer Networks.

1 TDMA Scheduling in Competitive Wireless Networks Mario CagaljHai Zhan EPFL - I&C - LCA February 9, 2005.

CS 5253 Workshop 1 MAC Protocol and Traffic Model.

Semester EEE449 Computer Networks The Data Link Layer Part 2: Media Access Control En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex,

MAC Layer Protocols for Sensor Networks Leonardo Leiria Fernandes.

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

1 ECE453 – Introduction to Computer Networks Lecture 7 – Multiple Access Control (I)

Binary Exponential Backoff Binary exponential backoff refers to a collision resolution mechanism used in random access MAC protocols. This algorithm is.

Delay Analysis of IEEE in Single-Hop Networks Marcel M. Carvalho, J.J.Garcia-Luna-Aceves.

Multiple Access Protocols Chapter 6 of Hiroshi Harada Book

1 SenMetrics’05, San Diego, 07/21/2005 SOSBRA: A MAC-Layer Retransmission Algorithm Designed for the Physical-Layer Characteristics of Clustered Sensor.

A Virtual Collision Mechanism for IEEE DCF

CIS 725 Media Access Layer. Medium Access Control Sublayer MAC sublayer resides between physical and data link layer Broadcast/multiacess channels N independent.

Tuning the Carrier Sensing Range of IEEE MAC Jing Deng,Ben Liang and Pramod K. Varshney Univ. of New Orleans Globecom 2004.

Wireless Medium Access. Multi-transmitter Interference Problem  Similar to multi-path or noise  Two transmitting stations will constructively/destructively.

LECTURE9 NET301. DYNAMIC MAC PROTOCOL: CONTENTION PROTOCOL Carrier Sense Multiple Access (CSMA): A protocol in which a node verifies the absence of other.

LOCAL AREA NETWORKS. CSMA Carrier Sense Multiple Access To minimize the chance of collision and, therefore, increase the performance, the CSMA method.

1 An Adaptive Energy-Efficient and Low-Latency MAC for Data Gathering in Wireless Sensor Network Gang Lu, Bhaskar Krishnamachari, and Cauligi Raghavendra.

On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003.

Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Medium Access Control Sublayer.

جلسه یازدهم شبکه های کامپیوتری به نــــــــــــام خدا.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Unit-II Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Multiple Access.

Chapter 6 Multiple Radio Access

LOCAL AREA NETWORKS. CSMA/CA In a wired network, the received signal has almost the same energy as the sent signal because either the length of the cable.

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

Ethernet. Ethernet (802.3) 1-persistent CSMA, CD, binary exponential backoff Carrier sense: station listens to channel first. 1-persistent: If idle, station.

Token-DCF, COMSNET(2013) -> MOBICOM(2014). Introduction ▣ To improve standard MAC protocol of IEEE for WLAN. ▣ S-MAC, A-MAC, SPEED-MAC, and etc.

Ch 12. Multiple Access. Multiple Access for Shared Link Dedicated link – Point-to-point connection is sufficient Shared link – Link is not dedicated –

An Energy Efficient MAC Protocol for Wireless LANs, E.-S. Jung and N.H. Vaidya, INFOCOM 2002, June 2002 吳豐州.

Wi-Fi. Basic structure: – Stations plus an access point – Stations talk to the access point, then to outside – Access point talks to stations – Stations.

1 An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Networks Tijs van Dam, Koen Langendoen In ACM SenSys /1/2005 Hong-Shi Wang.

CS3502: Data and Computer Networks Local Area Networks - 1 introduction and early broadcast protocols.

Medium Access Control in Wireless networks

MAC Layer Protocols for Wireless Networks. What is MAC? MAC stands for Media Access Control. A MAC layer protocol is the protocol that controls access.

Carrier Sense Multiple Access Improve ALOHA by using carrier sense –Stations listen to the carrier before transmitting –If channel is busy, the station.

Toward Reliable and Efficient Reporting in Wireless Sensor Networks Authors: Fatma Bouabdallah Nizar Bouabdallah Raouf Boutaba.

A Bit-Map-Assisted Energy- Efficient MAC Scheme for Wireless Sensor Networks Jing Li and Georgios Y. Lazarou Department of Electrical and Computer Engineering,

Discovering Sensor Networks: Applications in Structural Health Monitoring Summary Lecture Wireless Communications.

Chapter 4 The Medum Access Sublayer. MA Sublayer Additional Reference –Local and Metropolitan Area Networks, William Stallings, Prentice Hall, 2000, 6th.

Medium Access Control Protocols, Local Area Networks, and Wireless Local Area Networks Lecture Note 10.

THE MEDIUM ACCESS CONTROL SUBLAYER 4.1 THE CHANNEL ALLOCATION PROBLEM 4.2 MULTIPLE ACCESS PROTOCOLS.

Z-MAC : a Hybrid MAC for Wireless Sensor Networks Injong Rhee, Ajit Warrier, Mahesh Aia and Jeongki Min ACM SenSys Systems Modeling.

AN EFFICIENT TDMA SCHEME WITH DYNAMIC SLOT ASSIGNMENT IN CLUSTERED WIRELESS SENSOR NETWORKS Shafiq U. Hashmi, Jahangir H. Sarker, Hussein T. Mouftah and.

COMPUTER NETWORKS Data-link Layer (The Medium Access Control Sublayer) MAC Sublayer.

Multiple Access By, B. R. Chandavarkar, CSE Dept., NITK, Surathkal Ref: B. A. Forouzan, 5 th Edition.

CS 5253 Workshop 1 MAC Protocol and Traffic Model.

Data Collection and Dissemination

CSE 313 Data Communication

Chapter 6 Multiple Radio Access.

Presentation transcript:

KAIST Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks Suho Yang (CS710: November 4, 2008) Kyle Jamieson, Hari Balakrishnan, Y.C. Tay LNCS Springer 2006

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / 24 Contents Introduction Motivation Our proposal: Sift Performance Evaluation Conclusion & Discussion 2

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / 24 Event-driven WSN Report an event information when an phenomenon occurs ↔ periodic traffic Latency-sensitive applications 3 Introduction

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / 24 4 Sift Focus Designing MAC protocol to handle event-driven traffic Challenges Low latency Good throughput Good fairness Introduction

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / 24 5 Problems of traditional contention-based MAC in WSN Spatial correlated contention Not suitable for bursty traffic Motivation: Problems of Traditional CSMA

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / 24 6 Problems of traditional non-persistent CSMA Timeslot: opportunity for a node to begin transmitting Pick a timeslot chosen uniformly in [0, CW] Listen up to chosen slot Transmit if nobody else started transmitting Wait more if somebody else started transmitting Motivation: Problems of Traditional CSMA Busy Medium When the channel is idle, 1-persistent CSMA: transmit immediately with 100% probability p-persistent CSMA : transmit immediately with p*100% probability Non-persistent CSMA: transmit after waiting for a random amount of time and checks again

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / 24 7 Problems of traditional non-persistent CSMA Successful transmission case Collision case Motivation: Problems of Traditional CSMA Node A: Node B: Slot choice (slot #4) Slot choice (slot #8) Node A: Node B: Slot choice (slot #4)

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / 24 8 Problems of traditional non-persistent CSMA High contention causes collisions in CSMA Motivation: Problems of Traditional CSMA Unacceptable collision rate above ~15 transmitting sensors Due to uniform distribution!

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / 24 9 Solution for this problem Create more slots Conventional approach Called “binary exponential backoff” (BEB) Motivation: Problems of Traditional CSMA Acknowledgement? Reduce CW Double CW and resend YesNo

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / Problem of BEB Takes time for every node to increase CW Especially if traffic is spatially-correlated and bursty Waste backoff slots if collisions cause CW to increase We are interested in the collision-free transmission of only the first R of N potential reports of some event Motivation: Problems of Traditional CSMA sink

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / Sift is a MAC protocol for... Event-driven traffic Low-latency requirements Sift’s properties Extremely simple Offers up to 7-fold lower latency Goal Design a MAC protocol that minimizes the latency taken to send R of without collisions Our proposal: Sift

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / Main Idea Change the way we pick slots Instead of uniform distribution Use small and fixed-size contention window No BEB Not all sensing nodes need to report an event It is enough for a subset of the event reports to reach the data sink Out of N nodes, only the first R nodes report (the remainder are suppressed) Changing the Distribution for picking transmission slot Use an geometrically-increasing probability distribution → Reduce the chance of collisions → Reduce wastage of backoff slots Our proposal: Sift

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / Sift’s slot selection distribution Increasing exponential distribution Our proposal: Sift

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / Why use this pdf? Our proposal: Sift A Bins represent backoff slots → Nodes choosing each slot →

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / Optimal non-persistent CSMA performance With knowledge of number of nodes (IEEE JSAC ’04) Our proposal: Sift

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / 24 Sift keeps success rate above this unacceptable range 16 Sift approaches Optimal Sift needs no knowledge of the number of nodes Our proposal: Sift

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / 24 Performance Evaluation Simulation-based NS-2 Comparisons with (BEB), /copy (=copy overheard CW+countdown timer) Experiment Setup (Event-driven traffic pattern) Topology: Single-hop to one base station N nodes sense and report an event R (≤ N ) reports are required If a node hears ≥ R reports then it suppresses its own event report 17 BS E.g. N=4, R=3

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / 24 Performance Evaluation Simulation_1-1: Latency Sift outperforms when N is large 18 R=16 R=1

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / 24 Performance Evaluation Simulation_1-2: Latency Sift outperforms as R Increases 19

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / 24 Performance Evaluation Simulation_2: Fairness Sift outperforms in terms of fairness 20 Eight nodes 64 nodes

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / 24 Performance Evaluation Simulation_3: Hidden terminal experiment setup Separate 128 sensors into mutually-hidden clusters Nodes in one cluster cannot hear nodes in another All nodes send to the base station Result: hidden terminal collisions at the base station 21 Base Station

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / 24 Performance Evaluation Simulation_3: Hidden terminal experiment setup 22

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / Sift is ideal for sensor networks, where... it is often sufficient that any R of N sensors that observe an event report it spatially-correlated contention occurs sudden changes in the number of sensors that are trying to send data Key idea Use a geometrically-increasing probability distribution for picking a transmission slot within a fixed-size contention window Sift is a latency-enhancing MAC for event-driven sensor networks Conclusion

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / The lack of mentions about... Energy consumption No attention about... How to determine R? Only manual setting Too strong assumption Single-hop communication to one base station Discussion

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / 24 Thank you 25

Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks / Existing MAC protocols in WSN Let s be a slot number, assume N ≥ 2 sensors transmitting. Define: Appendix A: Optimal Non-Persistent CSMA “Collision Minimizing CSMA and its Applications to Wireless Sensor Networks.” IEEE JSAC, 2004