1. School of EECS, Peking University 1 A Group-theoretic Framework for Rendezvous in Heterogeneous Cognitive Radio Networks Lin Chen ∗, Kaigui Bian ∗, Lin Chen † Cong Liu #, Jung-Min Jerry Park ♠, and Xiaoming Li ∗ ∗ Peking University, Beijing, China † University Paris-Sud, Orsay, France # Sun Yat-Sen University, Guangzhou, China ♠ Virginia Tech, Blacksburg, VA, USA ACM MobiHoc 2014

2. School of EECS, Peking University 2 What is the Rendezvous problem Rendezvous dilemma, rendezvous search game

3. School of EECS, Peking University 3 Rendezvous is a problem about “dating”… Two young people want to date (meet or rendezvous) in a large park, where N places are suitable for dating. [Steve Alpern, 1976] They need a strategy to visit these N places for early rendezvous. A B C

4. School of EECS, Peking University 4 It is NOT a challenging problem today… They can call each other directly by cell phone A B C Let’s meet at “C” At 10AM!

5. School of EECS, Peking University 5 No hidden assumptions here  E.g., no cell phones! That means, no pre-shared knowledge  Places can be unavailable (due to congestion)  Clocks can be asynchronous  No pre-assigned roles (i.e., the strategy should be the same for two people) It is challenging as a math problem

6. School of EECS, Peking University 6 Rendezvous problem in multi-channel wireless networks Rendezvous channel = control channel  Link establishment and control message exchange, etc.  Subject to congestion, attack, primary user traffic, etc So, it is needed to rendezvous on multiple channels Ch 2 Ch 1 Rdv ch Rdv Data Rdv Data

7. School of EECS, Peking University 7 Q1: How fast can they achieve rendezvous?  Is there a minimum, bounded latency? Q2: What is the max # of rendezvous channels?  What if a given rendezvous channel is unavailable? Two interesting questions

8. School of EECS, Peking University 8 Existing research Channel hopping (CH) can create rendezvous

9. School of EECS, Peking University 9 Random, common channel hopping Random hopping ： unbounded TTR Common hopping: clock sync. required A BC

10. School of EECS, Peking University 10 Sequence based channel hopping Interleaving, [Dyspan08] Modular clock, [MobiCom04, Infocom11, MobiHoc13] Single rendezvous channel

11. School of EECS, Peking University 11 Different sensing channel sets [MobiHoc13] No common channel index, no integer channel indices Node i Node j xy a bc Channel hopping over heterogeneous channel sets

12. School of EECS, Peking University 12 A lower bound for rendezvous latency Q1: how fast to rendezvous?

13. School of EECS, Peking University 13 Nodes i has a number of N i channels, in chan set C i Nodes j has a number of N j channels, in chan set C j Theorem 1: to rdv on every channel in C i ∩ C j  Two nodes need at least N i N j time slots Intuition: Elements in group Z Ni ⊕ Z Nj enumerate all possible pairs of rendezvous channels in C i ∩ C j A lower bound of rdv latency (TTR)

14. School of EECS, Peking University 14 Max # of rendezvous channels = || Max # of rendezvous channels = |C i ∩ C j | Q2: what is the max # of rdv channels?

15. School of EECS, Peking University 15 3 steps of creating channel hopping sequences Three channels:  Everyone has two short sequences: fast and slow  Choice bit sequence: 0/1 sequence  Interleave fast and slow sequence  If 0, pick fast; if 1, pick slow. 102102 1010 1 0 1 0 1 0 0 0 10 101 1 0 12 0 02 Fast seq Slow seq Choice bit seq Final seq used for rdv 0 12 2

16. School of EECS, Peking University 16 Fast hopping: hop across N i channels by N i slots Slow hopping: stay on channel h for N i slots However, two nodes use different strategies! Step 1: Rdv between fast and slow sequences Fast seq. Slow seq.

17. School of EECS, Peking University 17 Step 2: Creating choice bit sequences 1 0 1 0 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1

18. School of EECS, Peking University 18 Step 3: Interleaving fast and slow seqs for rdv 102102102 10 2 10 2 1 02 1 1 0 0 1 0 1 0 0 1 0 1 0 0 … 1002 10 2 1 1 0 12 0 021 2 2 Node i 3 chans Node j 2 chans Fast Slow Choice Final seq 1 20 0 2 0 2 0 0 2 2 0 2 Fast Slow Choice 0 2 1 1 0 0 1 … Final seq 20 02 20 02 20 02 0 2 0 2 0 2 0 2 00 00 22 22 … 0

19. School of EECS, Peking University 19 Simulation results

20. School of EECS, Peking University 20 Legend of our protocol is “Adv rdv” by light blue curve Small TTR (left) + Max robustness (right)

21. School of EECS, Peking University 21 Conclusion

22. School of EECS, Peking University 22 Conclusion We formulate the rendezvous problem in heterogeneous cognitive radio networks. We derive the lower bound of rdv latency in the heterogeneous environment. By symmetrization and interleaving fast/slow seqs, we devise a near-optimal rdv protocol.  Max # of rdv channels is |C i ∩ C j |  Achieve max rdv with a bounded latency ~ O(N i N j )

23. School of EECS, Peking University 23 any questions? Thanks & 感谢观看

24. School of EECS, Peking University 24 Assignment of Choice Sequence Symmetrization

25. School of EECS, Peking University 25 Finished! Assignment of choice seq.

26. School of EECS, Peking University 26 Two distributed assignment algorithms symmetrization map

27. School of EECS, Peking University 27 Suppose the length of ID is. Just append to it. Length of choice seq.: symmetrization 110001011000000000001