1 / 1

WINLAB

Cognitive Radio Rendezvous. Craig Gutterman , Kyle Soska. Advisors: R. Yates, I. Seskar , K. Le, P. Maddala. Motivation. Rendezvous Process. Results. Parameters Varied: Size of Window Random back-off time interval Measure: Average number of attempts to rendezvous

zack
Download Presentation

WINLAB

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Cognitive Radio Rendezvous Craig Gutterman, Kyle Soska Advisors: R. Yates, I. Seskar, K. Le, P. Maddala Motivation Rendezvous Process Results • Parameters Varied: • Size of Window • Random back-off time interval • Measure: • Average number of attempts to rendezvous • Average time To rendezvous (Avg. (TTR)) • Results: • 4ms Window Size Minimizes Avg. (TTR) • Small Backoff reduces TTR • Develop Rendezvous Process • Interference is Asymmetric • Time Asynchronous • Use Jump Stay Based Hopping Sequence • Uncoordinated Cognitive Radios need to agree upon a common channel and synchronize in time • Goal: Design Rendezvous algorithm to synchronize two radios quickly as possible System Model • Measure interference of channel with 64-pt FFT • Determine which channels are available • Channels: C={c1,…c16) • Available Channels Radio 1:C1 ⊆ C • Available Channels Radio 2:C2⊆ C • C 1 ∩ C 2 ≠ Ø • The channel hopping sequence follows: • C1(t) є C1 • C2(t) є C2 • Transmitting: mi(t)=1 • Receiving: mi(t)=0 • Rendezvous Time: • R=min (t≥0 | C1(t) =C2(t), m1(t)= m2 ꞌ (t)) • Process begins by listening for a beacon • Transmits Beacon after random back-off • Continues to listen for response before switching channels • Message not recognized if on different channel • Algorithm continues until successful handshake • Rendezvous not guaranteed even if on same channel Network Algorithm • Use a slotted networking protocol • Data Stream 1: Sends Spectrum Data to Host • Data Stream 2: Sends and Receives data packets to Host Window Size (ms) Backoff Delay (ms) WINLAB

More Related