Wireless Token Ring ProtocolUC Berkeley WOW (WTRP) Performance Comparison with IEEE 802.11

Mustafa Ergen, Duke Lee, Raja Sengupta, Pravin Variaya

ISCC Antalya, 2003 WTRP 1 UC Berkeley WOW Automated Vehicle Platoon

Real-time safety critical control over ad-hoc network Vehicles transmit control data in round robin every 20 ms Wireless Quality of Service

ISCC Antalya, 2003 WTRP 2 UC Berkeley WOW Motivations for WTRP Quality of service (real time applications) Distributed solution (robust against a single node failure) Flexible topology (token ring can be created with Pico cells) Safety critical applications (need fast recovery from failure) No need for clock synchronization (compared to TDMA) Partial connectivity (hidden terminal problem)

ISCC Antalya, 2003 WTRP 3 UC Berkeley WOW Motivations for WTRP Quality of service (real time applications) Distributed solution (robust against a single node failure) Flexible topology (token ring can be created with Pico cells) Safety critical applications (need fast recovery from failure) No need for clock synchronization (compared to TDMA) Works on partial connectivity (no hidden terminal problem)

ISCC Antalya, 2003 WTRP 4 UC Berkeley WOW Motivations for WTRP Quality of service (real time applications) Distributed solution (robust against a single node failure) Flexible topology (token ring can be created with Pico cells) Safety critical applications (need fast recovery from failure) No need for clock synchronization (compared to TDMA) Works on partial connectivity (no hidden terminal problem)

centralized (802.11 PCF, ) distributed (token ring) ISCC Antalya, 2003 WTRP 5 UC Berkeley WOW Motivations for WTRP Quality of service (real time applications) Distributed solution (robust against a single node failure) Flexible topology (token ring can be created with Pico cells) Safety critical applications (need fast recovery from failure) No need for clock synchronization (compared to TDMA) Works on partial connectivity (no hidden terminal problem)

142 31

TDMA

ISCC Antalya, 2003 WTRP 6 UC Berkeley WOW Motivations for WTRP Quality of service (real time applications) Distributed solution (robust against a single node failure) Flexible topology (token ring can be created with Pico cells) Safety critical applications (need fast recovery from failure) No need for clock synchronization (compared to TDMA) Works on partial connectivity (no hidden terminal problem)

ISCC Antalya, 2003 WTRP 7 UC Berkeley WOW Additional Challenges From Wireless Medium

Partial connectivity (unable to hear all nodes in a ring) Support for multiple rings Self-managed admission control Frequent packet loss, corruption

ISCC Antalya, 2003 WTRP 8 UC Berkeley WOW

7

7 4 5 1 4

5 1 The Wireless Token Ring Protocol (WTRP) is a protocol for wireless networks in mission critical systems. It supports quality of service in terms of bounded latency and reserved bandwidth. The defines the transmission order, and each token is forced to give up the token after a specified amount of time. Each ring has unique ring id based on unique MAC address of one of the stations of the ring. (The station is called the owner of the ring). When owner leaves the ring, another station elects itself to be the owner of the ring. ISCC Antalya, 2003 WTRP 9 UC Berkeley WOW Connectivity Table Each node builds and updates connectivity table that contains information of all stations in its reception range, and transmission order of the nodes in its ring

ISCC Antalya, 2003 WTRP 10 UC Berkeley WOW Unique Priority of Token Based on ring address and generation sequence number pair. Station only accept token that has higher priority than the last token that the station has accepted.

ring address generation sequence … Implicit ACK ACK is thought to be received when the successor initiates a transmission or token.

ISCC Antalya, 2003 WTRP 11 UC Berkeley WOW Descriptions (Operations) Invite Contend Token

Token

Joining: Stations periodically invite other nodes to join the ring by broadcasting the available resources left in the medium

1. SET_SUC C A B C

2. SET_PRED A

F D E Leaving: When B wants to leave, it requests A to connect to its successor, C. If A does not have connection with C, then it connects to the next node in terms of the transmission order of the ring. ISCC Antalya, 2003 WTRP 12 UC Berkeley WOW Descriptions (Management) 1. Retransmit TOKEN

AB C

2. SET_PRED A

F D E

Ring Recovery Able to recover quickly by keeping information about topology of the ring, recovers from multiple simultaneous faults by taking increasingly drastic actions 2 6 2 6 2 2 6 6 6 2 2 6 6 6 6 Token Recovery Multiple token is deleted using unique priority of token based on generation sequence number and token ring address pair. ISCC Antalya, 2003 WTRP 13 UC Berkeley WOW WTRP

ISCC Antalya, 2003 WTRP 14 UC Berkeley WOW IEEE 802.11

ISCC Antalya, 2003 WTRP 15 UC Berkeley WOW Token Rotation Time

A A 1 A 2 3 C B C B C B

ISCC Antalya, 2003 WTRP 16 UC Berkeley WOW Robustness

ISCC Antalya, 2003 WTRP 17 UC Berkeley WOW Fairness

ISCC Antalya, 2003 WTRP 18 UC Berkeley WOW Throughput

ISCC Antalya, 2003 WTRP 19 UC Berkeley WOW Conclusions The wireless token ring protocol (WTRP) is a medium access control protocol for wireless networks in mission critical systems. It supports quality of service in terms of bounded latency and reserved bandwidth. WTRP is efficient in the sense that it reduces the number of retransmissions due to collisions. It is fair in the sense that each station takes a turn to transmit and is forced to give up the right to transmit after transmitting for a specified amount of time. It is a distributed protocol that supports many topologies since not all stations need to be connected to each other or to a central station. It can be used with an admission control agent for bandwidth or latency reservations. WTRP is robust against single node failure. WTRP is designed to recover gracefully from multiple simultaneous faults.

ISCC Antalya, 2003 WTRP 20