A Wakeup Scheme for Sensor Networks: Achieving Balance between Energy Saving and End-to-end Delay Xue Yang, Nitin H.Vaidya Department of Electrical and.

Slides:



Advertisements
Similar presentations
Exploring Energy-Latency Tradeoffs for Broadcasts in Energy-Saving Sensor Networks AUTHOR: MATTHEW J. MILLER CIGDEM SENGUL INDRANIL GUPTA PRESENTER: WENYU.
Advertisements

A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks Hwee-Xian TAN and Mun Choon CHAN Department of Computer Science, School of Computing.
Dynamic Object Tracking in Wireless Sensor Networks Tzung-Shi Chen 1, Wen-Hwa Liao 2, Ming-De Huang 3, and Hua-Wen Tsai 4 1 National University of Tainan,
SELF-ORGANIZING MEDIA ACCESS MECHANISM OF A WIRELESS SENSOR NETWORK AHM QUAMRUZZAMAN.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)
1 Prediction-based Strategies for Energy Saving in Object Tracking Sensor Networks Yingqi Xu, Wang-Chien Lee Proceedings of the 2004 IEEE International.
PEDS September 18, 2006 Power Efficient System for Sensor Networks1 S. Coleri, A. Puri and P. Varaiya UC Berkeley Eighth IEEE International Symposium on.
Random Access MAC for Efficient Broadcast Support in Ad Hoc Networks Ken Tang, Mario Gerla Computer Science Department University of California, Los Angeles.
1 Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
1-1 Topology Control. 1-2 What’s topology control?
Self Organization and Energy Efficient TDMA MAC Protocol by Wake Up For Wireless Sensor Networks Zhihui Chen; Ashfaq Khokhar ECE/CS Dept., University of.
EWSN 04 – Berlin, Jan. 20, 2004 Silence is Golden with High Probability: Maintaining a Connected Backbone in Wireless Sensor Networks Paolo Santi* Janos.
1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Topology Control.
Delay-aware Routing in Low Duty-Cycle Wireless Sensor Networks Guodong Sun and Bin Xu Computer Science and Technology Department Tsinghua University, Beijing,
Achieving Long-Term Surveillance in VigilNet Pascal A. Vicaire Department of Computer Science University of Virginia Charlottesville, USA.
Energy Saving In Sensor Network Using Specialized Nodes Shahab Salehi EE 695.
Performance Evaluation and Improvement of an Ad Hoc Wireless Network Takayuki Yamamoto Graduate School of Engineering Science, Osaka University, Japan.
1 Y-MAC: An Energy-efficient Multi-channel MAC Protocol for Dense Wireless Sensor Networks Youngmin Kim, Hyojeong Shin, and Hojung Cha International Conference.
Project Introduction 이 상 신 Korea Electronics Technology Institute.
1 An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Networks The First ACM Conference on Embedded Networked Sensor Systems (SenSys 2003) November.
Stochastic sleep scheduling (SSS) for large scale wireless sensor networks Yaxiong Zhao Jie Wu Computer and Information Sciences Temple University.
ECE 256, Spring 2008 Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Jungmin So & Nitin Vaidya.
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
Power Save Mechanisms for Multi-Hop Wireless Networks Matthew J. Miller and Nitin H. Vaidya University of Illinois at Urbana-Champaign BROADNETS October.
RT-Link: A Time-Synchronized Link Protocol for Energy-Constrained Multi- hop Wireless Networks Anthony Rowe, Rahul Mangharam and Raj Rajkumar CMU SECON.
Optimizing Sensor Networks in the Energy-Latency-Density Design Space Curt Schurgers, Vlasios Tsiatsis, Saurabh Ganeriwal, Mani Srivastava, IEEE TRANSACTIONS.
1 An Adaptive Energy-Efficient and Low-Latency MAC for Data Gathering in Wireless Sensor Network Gang Lu, Bhaskar Krishnamachari, and Cauligi Raghavendra.
Lei Tang∗ Yanjun Sun† Omer Gurewitz‡ David B. Johnson∗
VAPR: Void Aware Pressure Routing for Underwater Sensor Networks
A Power Saving MAC Protocol for Wireless Networks Technical Report July 2002 Eun-Sun Jung Texas A&M University, College Station Nitin H. Vaidya University.
Presenter: Abhishek Gupta Dept. of Electrical and Computer Engineering
Presentation of Wireless sensor network A New Energy Aware Routing Protocol for Wireless Multimedia Sensor Networks Supporting QoS 王 文 毅
Minimizing Energy Consumption in Sensor Networks Using a Wakeup Radio Matthew J. Miller and Nitin H. Vaidya IEEE WCNC March 25, 2004.
Efficient Energy Management Protocol for Target Tracking Sensor Networks X. Du, F. Lin Department of Computer Science North Dakota State University Fargo,
Rendezvous Regions: A Scalable Architecture for Service Location and Data-Centric Storage in Large-Scale Wireless Sensor Networks Karim Seada, Ahmed Helmy.
A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks IEEE Transactions on Computers, vol. 60, no. 11, November.
ELECTIONEL ECTI ON ELECTION: Energy-efficient and Low- latEncy sCheduling Technique for wIreless sensOr Networks Shamim Begum, Shao-Cheng Wang, Bhaskar.
A Cooperative Lifetime Extension MAC Protocol in Duty Cycle Enabled Wireless Sensor Networks Hongzhi Jiaot, Mary Ann Ingram, Frank Y. Li Milcom 2011.
SenProbe: Path Capacity Estimation in Wireless Sensor Networks Tony Sun, Ling-Jyh Chen, Guang Yang M. Y. Sanadidi, Mario Gerla.
An Adaptive Energy-Efficient and Low- Latency MAC for Data Gathering in Wireless Sensor Networks Gang Lu, Bhaskar Krishnamachari, and Cauligi S. Raghavendra.
Zhong Zhou +, Zheng Peng +, Jun-Hong Cui +, Zaihan Jiang * Handling Triple Hidden Terminal Problems for Multichannel MAC in Long-Delay Underwater Sensor.
Self Organization and Energy Efficient TDMA MAC Protocol by Wake Up for Wireless Sensor Networks Zhihui Chen and Ashfaq Khokhar ECE Department, University.
Low Power, Low Delay: Opportunistic Routing meets Duty Cycling Olaf Landsiedel 1, Euhanna Ghadimi 2, Simon Duquennoy 3, Mikael Johansson 2 1 Chalmers University.
An Energy Efficient MAC Protocol for Wireless LANs, E.-S. Jung and N.H. Vaidya, INFOCOM 2002, June 2002 吳豐州.
A+MAC: A Streamlined Variable Duty-Cycle MAC Protocol for Wireless Sensor Networks 1 Sang Hoon Lee, 2 Byung Joon Park and 1 Lynn Choi 1 School of Electrical.
SEA-MAC: A Simple Energy Aware MAC Protocol for Wireless Sensor Networks for Environmental Monitoring Applications By: Miguel A. Erazo and Yi Qian International.
Ubiquitous Networks Wakeup Scheduling Lynn Choi Korea University.
An Energy-Efficient MAC Protocol for Wireless Sensor Networks Speaker: hsiwei Wei Ye, John Heidemann and Deborah Estrin. IEEE INFOCOM 2002 Page
Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
Delivery ratio-maximized wakeup scheduling for ultra-low duty-cycled WSNs under real-time constraints Fei Yang, Isabelle Augé-Blum National Institute of.
ECE 256, Spring 2009 __________ Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver __________________.
Turkmen Canli ± and Ashfaq Khokhar* Electrical and Computer Engineering Department ± Computer Science Department* The University of Illinois at Chicago.
EM-MAC: A Dynamic Multichannel Energy-Efficient MAC Protocol for Wireless Sensor Networks ACM MobiHoc 2011 (Best Paper Award) Lei Tang 1, Yanjun Sun 2,
GholamHossein Ekbatanifard, Reza Monsefi, Mohammad H. Yaghmaee M., Seyed Amin Hosseini S. ELSEVIER Computer Networks 2012 Queen-MAC: A quorum-based energy-efficient.
Toward Reliable and Efficient Reporting in Wireless Sensor Networks Authors: Fatma Bouabdallah Nizar Bouabdallah Raouf Boutaba.
Exploring the Energy-Latency Trade-off for Broadcasts in Energy-Saving Sensor Networks Matthew J. Miller, Cigdem Sengul, Indranil Gupta Department of Computer.
1 A Power Control MAC Protocol for Ad Hoc Networks EUN-SUN JUNG, NITIN H. VAIDYA, Wireless Networks 11, 55–66, Speaker: Han-Tien Chang.
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)
Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.
Power-Efficient Rendez- vous Schemes for Dense Wireless Sensor Networks En-Yi A. Lin, Jan M. Rabaey Berkeley Wireless Research Center University of California,
AUTO-ADAPTIVE MAC FOR ENERGY-EFfiCIENT BURST TRANSMISSIONS IN WIRELESS SENSOR NETWORKS Romain Kuntz, Antoine Gallais and Thomas No¨el IEEE WCNC 2011 Speaker.
AN ADAPTIVE MAC PROTOCOL FOR WIRELESS SENSOR NETWORKS Wen-Hwa Liao, Hsiao-Hsien Wang, and Wan-Chi Wu PIMRC ’ 07.
Max do Val Machado Raquel A. F. Mini Antonio A. F. Loureiro DCC/UFMG DCC/PUC Minas DCC/UFMG IEEE ICC 2009 proceedings Advisor : Han-Chieh Chao Student.
Time Synchronization in Ad Hoc Networks Kay R¨omer MobiHOC 2001 Speaker : hsiwei.
MAC Protocols for Sensor Networks
Straight Line Routing for Wireless Sensor Networks Cheng-Fu Chou, Jia-Jang Su, and Chao-Yu Chen Computer Science and Information Engineering Dept., National.
Towards Optimal Sleep Scheduling in Sensor Networks for Rare-Event Detection Qing Cao, Tarek Abdelzaher, Tian He, John Stankovic Department of Computer.
A Power Control MAC Protocol for Ad Hoc Networks
On the Physical Carrier Sense in Wireless Ad-hoc Networks
Presentation transcript:

A Wakeup Scheme for Sensor Networks: Achieving Balance between Energy Saving and End-to-end Delay Xue Yang, Nitin H.Vaidya Department of Electrical and Computer Engineering, and Coordinated Science Laboratory University of Illinois at Urbana-Champaign IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2004) Speaker: Hao-Chun Sun

Outline Introduction Introduction Related Work Related Work Pipelined Tone Wakeup Scheme (PTW) Pipelined Tone Wakeup Scheme (PTW) Analysis for Energy Consumption Analysis for Energy Consumption Performance Evaluation Performance Evaluation Conclusion Conclusion

Introduction Wireless Sensor Network Wireless Sensor Network Application scenarios — Application scenarios — Intrusion detection Intrusion detection Disaster alarming Disaster alarming The communication is typically driven by events and events occur rather infrequently. The communication is typically driven by events and events occur rather infrequently. Sensors spend a considerable fraction of lifetime to monitor the environment, said to be in the monitoring state. Sensors spend a considerable fraction of lifetime to monitor the environment, said to be in the monitoring state. Once events are detected, sensors may need to leave the monitoring state and actively communicate with each other. Once events are detected, sensors may need to leave the monitoring state and actively communicate with each other.

Introduction WSNs are characterized by the limited energy supply. WSNs are characterized by the limited energy supply. It is generally desired to turn off a sensor ’ s radio when there is no need for communication. It is generally desired to turn off a sensor ’ s radio when there is no need for communication.

Introduction Allowing radio to be turned off research directions have been taken to preserve the communication capability of WSNs — Allowing radio to be turned off research directions have been taken to preserve the communication capability of WSNs — Spatial redundancy Spatial redundancy Topology management schemes maintain network connectivity. Topology management schemes maintain network connectivity. Temporal potential in energy saving Temporal potential in energy saving Wake up mechanism wake the radio up when communication is necessary. Wake up mechanism wake the radio up when communication is necessary.

Introduction Motivation of this paper — Motivation of this paper — Wakeup schemes have great potential in energy saving for sensor networks where events occur infrequently. Wakeup schemes have great potential in energy saving for sensor networks where events occur infrequently. Existing wakeup schemes encounter critical tradeoffs between energy saving and wakeup delay. Existing wakeup schemes encounter critical tradeoffs between energy saving and wakeup delay. Ex: a message forward 10 hops on average. Ex: a message forward 10 hops on average. Wakeup delay: 1.3 s  end-to-end delay: 13 s Wakeup delay: 1.3 s  end-to-end delay: 13 s Object Tracking: object speed — 120km/h Object Tracking: object speed — 120km/h 13s  433 m 13s  433 m

Introduction Motivation of this paper — Motivation of this paper — Propose a wakeup scheme Propose a wakeup scheme Helps to achieve the balance between energy saving and end-to-end packet delay. Helps to achieve the balance between energy saving and end-to-end packet delay.

Related Work Wake schemes Wake schemes Synchronous schemes Synchronous schemes Ex: IEEE power saving mechanism Ex: IEEE power saving mechanism It is hard to be implemented in large WSNs. It is hard to be implemented in large WSNs. Asynchronous schemes Asynchronous schemes “ Power-saving protocols for IEEE based Multi-hop Ad Hoc Networks. ” IEEE Computer and Communication Societies, “ Power-saving protocols for IEEE based Multi-hop Ad Hoc Networks. ” IEEE Computer and Communication Societies, The objective is to arrange the wakeup schedule so that any two neighboring nodes are guaranteed to detect each other in finite time. The objective is to arrange the wakeup schedule so that any two neighboring nodes are guaranteed to detect each other in finite time.

Related Work The power saving capability and wakeup delay can be improved by using an additional wakeup channel. The power saving capability and wakeup delay can be improved by using an additional wakeup channel. There is a low power wakeup radio — There is a low power wakeup radio — The wakeup radio can stay awake for the entire time. The wakeup radio can stay awake for the entire time. Drawback: Drawback: The low power wakeup radio usually has a smaller transmission range than the high power data radio. The low power wakeup radio usually has a smaller transmission range than the high power data radio. Two same capability radio — Two same capability radio — STEM (Sparse Topology and Energy Management) STEM (Sparse Topology and Energy Management) MobiHoc 2002 MobiHoc 2002

Related Work STEM (Sparse Topology and Energy Management) — STEM (Sparse Topology and Energy Management) — Two radio Two radio Wakeup radio Wakeup radio Periodically turns on for T dstem every T duration Periodically turns on for T dstem every T duration is defined as the duty cycle ratio. is defined as the duty cycle ratio. Data radio Data radio Sleep until wakeup mechanism alerting. Sleep until wakeup mechanism alerting. Wakeup radio Sleep Duty Time T dstem Sleep T

Related Work STEM (Sparse Topology and Energy Management) — STEM (Sparse Topology and Energy Management) — Wake Operation Wake Operation Sender Receiver Others TwTw T wack Duty Time Sleep TwTw Turn on Data radio Duty Time Turn on Data radio

Related Work STEM (Sparse Topology and Energy Management) — STEM (Sparse Topology and Energy Management) — Minimum duty time Minimum duty time Not synchronized Not synchronized When bit rate is low, T dstm could be large. When bit rate is low, T dstm could be large. T has to be large enough to achieve the desired energy saving, resulting in a large wakeup delay. T has to be large enough to achieve the desired energy saving, resulting in a large wakeup delay. Sender Receiver Sleep TwTw T wack TwTw Duty Time T dstem

Pipelined Tone Wakeup Scheme PTW — PTW — Two radio Two radio Wakeup radio Wakeup radio Periodically turns on for T dtone every T duration Periodically turns on for T dtone every T duration is defined as the duty cycle radio. is defined as the duty cycle radio. Data radio Data radio Sleep until wakeup mechanism alerting. Sleep until wakeup mechanism alerting. Wakeup radio Sleep Duty Time T dtone Sleep T

Pipelined Tone Wakeup Scheme Using the Wakeup Tone Using the Wakeup Tone Wake Operation — Wakeup Channel Wake Operation — Wakeup Channel Sender Receiver Others Duty Time Sleep TpTp Turn on Data radio Duty Time Turn on Data radio Tone

Pipelined Tone Wakeup Scheme Using the Wakeup Tone Using the Wakeup Tone Wake Operation — Data Channel Wake Operation — Data Channel Sender Receiver Others Data Transmission Turn off Data radio Data Notification ACK

Pipelined Tone Wakeup Scheme Using the Wakeup Tone Using the Wakeup Tone T dtone ≧ t d + T transit T dtone ≧ t d + T transit t d : tone detection time (200μs) t d : tone detection time (200μs) T transit : sleep  receive duration (518μs) T transit : sleep  receive duration (518μs) T p = 2 × T dtone + T sleep = T + T dtone T p = 2 × T dtone + T sleep = T + T dtone Sender Receiver Sleep TpTp T dtone T sleep False probability: Detection probability:99.1% TR1000 RF Module using ASK

Pipelined Tone Wakeup Scheme PTW — PTW — A wakes up all its neighbors Wakeup Channel Data Channel A notify B t0 t1t2 B wakes up all its neighbors A sends a data packet to B B notify C C wakes up all its neighbors t3t4 A sends a data packet to B t5 … … ABCDEF TpTp T data T data = Queuing delay + Channel access delay + transmission delay + Propagation delay T p ≦ T data 10ms~hundreds of ms Satisfy!!

Analysis for Energy Consumption Analysis Model — Analysis Model — Total node: N Total node: N Number of neighbors of S: N s Number of neighbors of S: N s Monitoring state: T event Monitoring state: T event Assume: T w = T wack Assume: T w = T wack T dstem = 2T w +T wack = 3T w = 3T wack T dstem = 2T w +T wack = 3T w = 3T wack Power of Transmisson, Receive, Idle: P Power of Transmisson, Receive, Idle: P S D A4 A3 A2 A1 TTT … t Wakeup radio t Data radio Sleep Data Wakeup procedure T event

Analysis for Energy Consumption One Wakeup Procedure — One Wakeup Procedure — The sender S The sender S STEM — STEM — PTW — PTW — Compare — Compare — Ex: Duty stem =10, Duty tone =100 Need T event > 6.03T

Analysis for Energy Consumption One Wakeup Procedure — One Wakeup Procedure — The receiver D The receiver D STEM — STEM — PTW — PTW — Compare — Compare — Ex: Duty stem =10, Duty tone =100 Need T event > 5.56T

Analysis for Energy Consumption One Wakeup Procedure — One Wakeup Procedure — The other neighboring nodes A The other neighboring nodes A STEM — STEM — PTW — PTW — Compare — Compare — Ex: Duty stem =10, Duty tone =100 Need T event > 5.93T

Analysis for Energy Consumption One Wakeup Procedure — One Wakeup Procedure — The Loose Bound for T event The Loose Bound for T event Taking into account that Duty stem and Duty tone ≧ 1 Taking into account that Duty stem and Duty tone ≧ 1 Ex: wakeup and Ack packet size: 144 bits tone detection time: 100μs Bit Rate=3x144/100=4.3Mbps In most application, It is not likely a low cost sensor will be equipped.

Analysis for Energy Consumption Multiple Wakeup Procedures — Multiple Wakeup Procedures — The Loose Bound for T event The Loose Bound for T event H: The max number of wakeup procedures a node is involved upon an event. H: The max number of wakeup procedures a node is involved upon an event. Ex: Duty stem =10, Duty tone =100, H=5 Need T event > 102T

Performance Evaluation Simulator: The modified version of ns-2 Simulator: The modified version of ns-2 Radio power: TR1000 (20m) Radio power: TR1000 (20m) Wakeup packet size: 144 bits Wakeup packet size: 144 bits Data packet size: 1040 bits Data packet size: 1040 bits Data Ack size: 128 bits Data Ack size: 128 bits Bits Rate: 2.4Kbps Bits Rate: 2.4Kbps T dstem =225ms, Duty stem =13.33 T dstem =225ms, Duty stem =13.33 T dtone =1ms, Duty tone =229 T dtone =1ms, Duty tone =229

Performance Evaluation Cluster Scenario — 55 nodes  11 clusters Cluster Scenario — 55 nodes  11 clusters Source: Node 0, Destination: Node 50 Source: Node 0, Destination: Node 50 Path:0  5  10  15  20  25  30  35  40  4 5  50 (Ten events with 100s period) Path:0  5  10  15  20  25  30  35  40  4 5  50 (Ten events with 100s period) Extreme case: All node will be awakened. Many nodes will be awakened multiple times. Extreme case: All node will be awakened. Many nodes will be awakened multiple times. 55

Performance Evaluation Cluster Scenario — Cluster Scenario — Individual Energy Consumption (Joule) Individual Energy Consumption (Joule) Source Forward nodeNF-NeighborSink

Performance Evaluation Cluster Scenario — Cluster Scenario — Total energy consumption & end-to-end delay Total energy consumption & end-to-end delay 10 hops 10 hops

Performance Evaluation Random Generated Networks — Random Generated Networks — 10 random topologies are generated. 10 random topologies are generated. 100 nodes 100 nodes Square area: 79.25m x 79.25m Square area: 79.25m x 79.25m Average number of neighbor each node: 20 Average number of neighbor each node: 20 As different values of Duty stem in STEM trade off energy with delay. As different values of Duty stem in STEM trade off energy with delay. STEM1 — Duty stem =5.33 STEM1 — Duty stem =5.33 STEM2 — Duty stem =13.33 STEM2 — Duty stem = events 10 events

Performance Evaluation Random Generated Networks — Random Generated Networks —

Conclusion It has presented a Pipelined Tone Wakeup (PTW) scheme for sensor network, which helps to achieve the balance between energy saving and end-to-end delay. It has presented a Pipelined Tone Wakeup (PTW) scheme for sensor network, which helps to achieve the balance between energy saving and end-to-end delay. The use of wakeup tone enables a large duty cycle ratio without causing a large wakeup delay at each hop. The use of wakeup tone enables a large duty cycle ratio without causing a large wakeup delay at each hop. It helps the pipeline to hide most of the wakeup delay while achieving a major energy saving. It helps the pipeline to hide most of the wakeup delay while achieving a major energy saving.