Fully Adaptive Power Saving Protocols for Ad Hoc Networks Using the Hyper Quorum System

1. Fully Adaptive Power Saving Protocols for Ad Hoc Networks Using the Hyper Quorum System Shan-Hung Wu(吳谷鴻), Ming-Syan Chen (陳銘憲) and Chung-Min Chen(陳仲民) Dept. of EE, National Taiwan University IEEE ICDCS 2008

2. Outline • Introduction • Related Work • Hyper Quorum-based System • Simulation • Conclusions

3. Introduction • Quorum-based Power Saving (QPS) protocols have been proposed for ad hoc networks (e.g., IEEE 802.11 ad hoc mode) to increase energy efficiency and prolong the operational time of mobile stations. • In all existing QPS protocols, the cycle length is either identical for all stations or is restricted to certain numbers (e.g. squares or primes).

4. Goal • Proposed a generalization of QPS that allows for arbitrary cycle lengths. • Hyper Quorum System (HQS)

5. Related Work • 802.11 Power Saving Mode • Static grid-based quorum system • Adaptive Quorum-based Energy Conserving (AQEC) with semi-adaptivity

6. B B B B B B B B B B Related Work (1) B Beacon frame Beacon interval ATIM Window H0 H1 802.11 Power Saving Mode

7. A D B ATIM frame Beacon frame Data frame a ATIM ACK d Data ACK Related Work (1) Beacon interval ATIM Window B B B B B a d H0 A D B H1 B B B B data 802.11 Power Saving Mode

8. 4 1 2 3 5 0 7 8 0 6 B B B B B B B B B Related Work (2) Cycle length (ni) Beacon interval n0=9 ATIM Window a d H0 n1=9 B A A A D H1 data Static grid-based quorum systems (Proposed by Y.C. Tseng etc.)

9. 0 4 5 8 0 1 2 3 4 6 8 7 8 0 7 6 3 5 1 2 a d A A A D Related Work (2) n0=9 H0 n1=9 H1 data Static grid-based quorum systems (Proposed by Y.C. Tseng etc.)

10. 1 7 0 1 2 4 5 6 2 8 3 0 1 2 3 8 3 0 1 0 Related Work (3) n0=4 a d H0 n1=9 A A D H1 data AQEC with semi-adaptivity (Proposed by C.M. Chao)

11. Proposed Mechanism • Two schemes • Extended Grid (EG) scheme • Difference Set (DS) scheme

12. Proposed Mechanism • EG scheme • Extended grid quorum Gi Φ1 By fixing gj+1-gj=2, G1={0,1,2,4,6} By fixing gj+1-gj=2, G1={0,1,3,5,7} By fixing gj+1-gj=1, G1={0,1,2,3,4,5} By fixing gj+1-gj=1, G1={0,1,3,4,5,6} Let nd-1 =20, n1 =8. Φ1=2, q1=4 G1 in the 2 x 4 grid.

13. 10=n01/2+n1-1 =41/2 +9 -1 head of R4,10,2(Q0)=3,7 Q0={1,2,3} Φ0=2 n0=4 H0 R4,10,2(Q0)={0,1,3,4,5,7,8,9} l0=2 R9,10,1(Q1)={2,5,6,7,8} l1=1 n1=9 H1 Φ1=3 head of R9,10,1(Q1)=8 Q1={0,3,6,7,8} t: reference point of time

14. Proposed Mechanism • DS scheme • Difference set Gi Φ1 Let n1=8, nd-1=20. Φi=4, q1=2 G1 in the 2 x 4 grid. By fixing gj+1-gj=1, G1={0,1,2} By fixing gj+1-gj=2, G1={0,1,3} By fixing gj+1-gj=3, G1={0,1,4}

15. Simulation

16. Cycle length

17. HQPS adaptive with delay-constrained HQPS adaptive with best-effort traffic

18. Conclusion • HQS has shown that two hosts are guaranteed to receive one another’s beacon frame at least once every beacon intervals. (n as cycle length) • Hyper Quorum System (HQS) is fully adaptive in the sense that a station can select any value of cycle length .

19. Thank you~