Quorum-based Power-Saving Multicast Protocols in the Asynchronous Ad Hoc Network Yu-Chen Kuo Department of Computer Science and Information Management Soochow University Computer Networks, vol. 54, no. 11, August 2010, pp

Outline Introduction Quorum concept Asynchronous multicast problem Quorum-based asynchronous power-saving protocols –Rotation m-closure property –Uniform k-arbiter quorum systems –CRT quorum systems Performance evaluation Conclusion

Introduction IEEE wireless hosts –batteries to supply their limited power Critical issue –How to extend the lifetime of wireless hosts

Introduction IEEE defines the power-saving (PS) mode for wireless hosts to reduce the usage of radio activity. –ATIM = Announcement Traffic Indication Map Station ATIM Window Beacon Interval 0 PS Mode Beacon DATA Window ATIM Window Beacon Interval 1 Active Mode Beacon DATA Window … ATIM Window Beacon Interval k Active Mode Beacon DATA Window Station A ATIM Window Beacon Interval Active Mode ATIM DATA Window Station B ACK Active Mode

Quorum Concept Quorum-based Power Saving protocols have been proposed for IEEE ad hoc networks –increase energy efficiency –prolong the operational time of mobile stations Quorum Systems –Random selection –Intersection

Quorum systems –Random selection –Intersection Quorum Concept Host A ATIM Window Beacon Intervals 3 and 4 Active Mode ATIM DATA Window Host B ACK Active Mode Host AHost B Quorum Interval (A): 1, 2, 3, 4, 7 Quorum Interval (B): 3, 4, 5, 6, 9 A B Grid Quorum Systems

Quorum Concept Q1Q1 Q2Q2 Q3Q3 Q4Q Q5Q5 Q6Q6 Q7Q7 Q8Q Cyclic Quorum Systems

Quorum Concept Cyclic Quorum Systems –Random selection –Intersection –Q 1 = {1, 2, 3}, Q 7 = {1, 7, 8}, Q 8 = {1, 2, 8} Q1Q Q7Q7 Q8Q

Asynchronous Multicast Problem However, how to apply the quorum-based power-saving protocol for –Asynchronous networks –Multicast Quorum systems U={0, 1, 2, 3} C={{0,1}, {0,2}, {0,3}} Q 1 ={0,2}, Q 2 ={0,1}, Q 3 ={0,3} Clock drift r 3 = 3

Asynchronous Multicast Problem However, how to apply the quorum-based power-saving protocol for –Asynchronous networks –Multicast B C D A B C D A t B CD

However, how to apply the quorum-based power-saving protocol for –Asynchronous networks –Multicast Asynchronous Multicast Problem Possible Solution: Busy Waiting Sender

Asynchronous Multicast Problem However, how to apply the quorum-based power-saving protocol for –Asynchronous networks –Multicast Possible Solution: Busy Waiting Sender

Goals To design quorum-based power-saving multicast protocols in the asynchronous –Quorum systems –Asynchronous –Multicast

Rotation m-Closure Property Quorum system C under U={0, 1, 2, …, N-1} Quorums Q  C Clock drift r Quorum systems U={0, 1, 2, 3} C={{0,1}, {0,2}, {0,3}} Q 1 ={0,2}, Q 2 ={0,1}, Q 3 ={0,3} Clock drift r 3 = 3

Rotation m-Closure Property Intersection Property Quorum systems U={0, 1, 2, 3} C={{0,1}, {0,2}, {0,3}} Q 1 ={0,2}, Q 2 ={0,1}, Q 3 ={0,3} Clock drift r 3 = 3

Rotation m-Closure Property Rotation Closure Property  

Rotation m-Closure Property To multicast for m hosts at the same time  

Uniform k-arbiter Quorum Systems Quorum system C under U={0, 1, 2, …, N-1} Quorums Q  C Clock drift r Uniform k-arbiter:

Uniform k-arbiter Quorum Systems, k: number of multicast members, N=|U| Quorum systems U ={0, 1, 2, 3, 4, 5, 6, 7, 8} Q 1 ={0, 1, 2, 4, 5, 7, 8} Q 2 ={0, 2, 3, 5, 6, 7, 8} Q 3 ={0, 1, 2, 3, 4, 5, 6} Clock drift r 2 = 1 Clock drift r 3 = H1H1 H2H2 H3H3 Sender 1

Compare with Busy waiting Uniform k-arbiter Busy waiting

CRT Quorum Systems Chinese Reminder Theorem p i = wakeup frequency f i for host H i H 1 : p 1 =5, r 1 =0 H 2 : p 2 =3, r 2 =1 H 3 : p 3 =2, r 3 =8 H 1 ={0(+5) 5(+5)10(+5) } H 2 ={1(+3) 4(+3) 7(+3)10(+3)} H 3 ={8(+2) 10(+2) }

Performance Evaluation Simulator: NS2 –100 hosts in 200m*200m –Transmission range: 250m –Transmission rate: 2 Mbps –Battery power: 1000 J

Performance Evaluation

Conclusion This paper proposes a quorum-based power saving protocols –Asynchronous networks –For multicast TheEND Thanks for your attention !