CSE5345_Lecture12

CSE5345_Lecture12 - Last Class PLCP frame format CSE 5345...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
1 CSE 5345 – Fundamentals of Wireless Networks Yonghe Liu Yonghe@cse.uta.edu 2/21/12 2 Last Class PLCP frame format Preamble: SYNC, SFD Header: Signal, Service, Length, CRC Carrier Sensing Range v.s. Transmission Range 3 Today Performance of DCF Markov Chain overview 4 Markov Chain (Discrete Time) Consider a stochastic process {X n , n = 0, 1, …} X n = {0, 1, 2, …} X n = i denotes the process is in state i at time n 1 0 p q 1 -q 1 -p 1 0 2 a d f c b e
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 5 Markov Chain At every time slot a “jump” decision is made X n = i --> X n+1 =j 1 0 p q 1 -q 1 -p 1 0 2 a d f c b e 6 Markov Property Future is independent of Past Memoryless {X n } is called a Markov chain if it has the Markov property 1 0 p q 1 -q 1 -p 1 0 2 a d f c b e 7 Example: 1-D Random Walk Time is slotted The walker flips a coin every time slot to decide which way to go X(t) p 1- p 8 Discussion A non-Markov example X(t) p 1- p
Background image of page 2
3 9 Transition Probability Probability to jump from state i to state j Assume stationary : independent of time
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/22/2012 for the course CSE 5345 taught by Professor Youngheliu during the Spring '12 term at UT Arlington.

Page1 / 9

CSE5345_Lecture12 - Last Class PLCP frame format CSE 5345...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online