Presentation is loading. Please wait.

Presentation is loading. Please wait.

Ivy Slackers Multihop Routing Barbara Hohlt Nest Retreat January 2003.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Ivy Slackers Multihop Routing Barbara Hohlt Nest Retreat January 2003."— Presentation transcript:

1 Ivy Slackers Multihop Routing Barbara Hohlt Nest Retreat January 2003

2 What is Slackers ? Power scheduling multihop routing algorithm for Ivy networks Primary goal is significant reduction of duty cycle per node Network nodes are sparsely positioned Slowly varying periodic data demands

3 The Algorithm 1.Init – listen 1 cycle for parent 2.For current cycle, pick an advertisement slot and a reservation slot randomly from idle slots 3.Loop through slots in cycle 1. Receive message from downstream 2. Transmit message upstream 3. Broadcast an Advertisement 4. Listen for a reservation request 5. Send reservation request 6. Idle – power down 4.Repeat 2 - 4

4 http://www-bsac.eecs.berkeley.edu/projects/ivy Ivy Network Node Application Node Base Station Remote Users Remote Database

5 Power Scheduling Each time slot is reserved for Transmitting to and Receiving from specific network node pairs. 3 21 4 0 5 __ __ R2 R1 R3 R4 __ T0R5 __ T0 __ T1 __ Rn Rn __ T1 Rn Rn T2 __ Rn Rn Sensor nodes can power down during the time slots that are not scheduled.

6 0RRTRPR TRTTTRATI 1TIRITIII ATRTPI 2ATRPIII TRIIIIII 3II IAIIITII III 4IIT IIAIIII III 5I IIIAIIIII TII Experiment: Sample schedules from a 6 sensor node network with a demand of 1. The number of slots per cycle is 15. Transmit Receive Advertise Transmit Pending Receive Pending Idle

7 Connectivity of a 13-node network with. Solid lines represent the standard connection set while the dotted lines are added for the augmented connection set. Each network node has several application nodes (not shown) communicating to each of the network nodes. More realistic networks

8 A bar chart showing the number of slots occupied by either transmission or reception following completion of the schedule of the 13-node network with a demand of 5 at each node. The number of slots per cycle is 125 and pAS = 0.5 The results are averaged over a set of 100 trials. Duty Cycle

9 Slackers Architecture AM ReceiveMsgSendMsg Send MultiHopSend MultiHop MultiHopRoute PowerMode PowerScheduler MultiHopRoute receives messages MultiHopSend forwards messages PowerScheduler sends/receives advertisements

Download ppt "Ivy Slackers Multihop Routing Barbara Hohlt Nest Retreat January 2003."

Similar presentations

Problems in Ad Hoc Channel Access

Problems in Ad Hoc Channel Access
An Adaptive Compulsory Protocol for Basic Communication in Ad-hoc Mobile Networks Ioannis Chatzigiannakis Sotiris Nikoletseas April 2002.

An Adaptive Compulsory Protocol for Basic Communication in Ad-hoc Mobile Networks Ioannis Chatzigiannakis Sotiris Nikoletseas April 2002.
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.

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.
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.

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.
A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks Le Zou, Mi Lu, Zixiang Xiong, Department of Electrical Engineering,

A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks Le Zou, Mi Lu, Zixiang Xiong, Department of Electrical Engineering,
TDMA Scheduling in Wireless Sensor Networks

TDMA Scheduling in Wireless Sensor Networks
Urban Multi-Hop Broadcast Protocol for Inter-Vehicle Communication Systems Δημόκας Νικόλαος Data Engineering Laboratory, Aristotle University of Thessaloniki.

Urban Multi-Hop Broadcast Protocol for Inter-Vehicle Communication Systems Δημόκας Νικόλαος Data Engineering Laboratory, Aristotle University of Thessaloniki.
Presented by Rick Skowyra

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

Routing Protocols for Sensor Networks Presented by Siva Desaraju Computer Science WMU An Application Specific Protocol Architecture for Wireless Microsensor.
Low-Energy Adaptive Clustering Hierarchy An Energy-Efficient Communication Protocol for Wireless Micro-sensor Networks M. Aslam hayat.

Low-Energy Adaptive Clustering Hierarchy An Energy-Efficient Communication Protocol for Wireless Micro-sensor Networks M. Aslam hayat.
Geo – Routing in ad hoc nets References: Brad Karp and H.T. Kung “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks”, Mobicom 2000 M. Zorzi,

Geo – Routing in ad hoc nets References: Brad Karp and H.T. Kung “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks”, Mobicom 2000 M. Zorzi,
A Query-Based Routing Tree in Sensor Networks In Chul Song Yohan Roh Dongjoon Hyun Myoung Ho Kim GSN 2006 (Geosensor Network) 1.

A Query-Based Routing Tree in Sensor Networks In Chul Song Yohan Roh Dongjoon Hyun Myoung Ho Kim GSN 2006 (Geosensor Network) 1.
A Novel Cluster-based Routing Protocol with Extending Lifetime for Wireless Sensor Networks Slides by Alex Papadimitriou.

A Novel Cluster-based Routing Protocol with Extending Lifetime for Wireless Sensor Networks Slides by Alex Papadimitriou.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)

Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
PEDS September 18, 2006 Power Efficient System for Sensor Networks1 S. Coleri, A. Puri and P. Varaiya UC Berkeley Eighth IEEE International Symposium on.

PEDS September 18, 2006 Power Efficient System for Sensor Networks1 S. Coleri, A. Puri and P. Varaiya UC Berkeley Eighth IEEE International Symposium on.
1 Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.

1 Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
Flexible Power Scheduling for Sensor Networks Barbara Hohlt Eric Brewer Nest Retreat June 2003.

Flexible Power Scheduling for Sensor Networks Barbara Hohlt Eric Brewer Nest Retreat June 2003.
Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Vikram Kanodia.

Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Vikram Kanodia.
Approaches to Communication Scheduling Barbara Hohlt and Eric Brewer Terence Tong, David Molnar, and Alec Woo Umesh Shankar and Naveen Sastry.

Approaches to Communication Scheduling Barbara Hohlt and Eric Brewer Terence Tong, David Molnar, and Alec Woo Umesh Shankar and Naveen Sastry.
Two Mote Projects Barbara Hohlt NEST Retreat 18 June 2002.

Two Mote Projects Barbara Hohlt NEST Retreat 18 June 2002.

Similar presentations

Ads by Google