2015 Exam Flashcards

1
Q

Why does Bluetooth MAC requires a silent period between frames? (2)

A
  • Allows time for a low cost radio to turn from transmitter to reciever
  • Freq synthesiser to settle to the new frequency of next hop
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What do GPC + GPSS do?

A

Classes deal w/ how BS scheduler communicates UL resource allocations ‘grants’ to SSs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

GPC Definition (3)

A

Grant Per Connection

  • All scheduling is done by BS therefore SS is dumb
  • Generates overheads since detailed scheduling info must be communicated from BS to SS
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

GPSS Definition (3)

A

Grant Per SS

  • One grant for each SS irrespective of # services
  • SS decides how to allocate resources, making SS complex
  • Benefit is less resource requests + grants transmitted as additional overheads of channel
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Duplexing options + challenges in 802.16 (4)

A
  • Duplex Agnostic (standard incl. TDD + FDD)
    • FDD SSs can be either full or half duplex
    • FDD BS are full duplex
  • An FDD BS must support a mixture of half + full duplex SS
    • ​Scheduling difficult as not possible to schedule all half duplex SSs to receive before transmit in each MAC frame
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

MCS Meaning

A

Modulation + Coding Scheme

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Why would a 1% PER be enforced + resultant QoS?

A

low prob of retransmission facilitating a combination of low delay jitter + low PLR

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Methods in 802.11e EDCF MAC protocol to facilitate QoS provision (3)

A
  • .11e nodes use AIFS rather than DIFS before contending
    • AIFS < DIFS (both fixed) therefore .11e nodes have a deterministic priority over .11 nodes
  • .11e different service classes have different starting CW range
    • probabilistic adv to higher priority service classes
  • .11de allows service classes to transmit multiple packets after winning contention (as many as TXOP duration)
    • provides deterministic priority between service classes
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

QoS buffering implications? (3)

A
  • Dst reads packet from buffer @ constant rate
  • Reduces throughput + delay jitter
  • Penalty is increased delay whilst buffer fills
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

How does fading give rise to multi-user diversity? (2)

A
  • Gives rise to MUD since users experience uncorrelated fading
  • DRA to users w/ good channel cond.​​
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Why b/w is superior in Rayleigh fading than Rician fading?

A

Fading in Rician channel has less variance than a Rayleigh channel therefore capacity gain w/ increasing users is less

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Why is there no gain in AWGN channel?

A

No fading

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Why does ‘Theoretical B/W Eff’ graph have an exp. shape of the curves for fading channels? (2)

A
  • Due to diminishing returns when there are more users, the best is more likely to have good conditions
  • As # users increases, there is less likelihood that if one more is added, it will have a better channel
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Do the b/w gains of MUD incr or decr when SNR increases? (3)

A
  • Gains reduce for higher SNRs
  • Multiuser diversity generates an increase in eff SNR
  • B/W eff. only increases logarithmically ​w/ SNR
    • e.g. if SNR is higher, making it higher achieves less of a result
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

QoS implications of using ARQ for error control? (2)

A
  • ARQ will reduce PER + PLR @ expense of delay jitter (due to erroneous packet retransmission)
  • Delay variance will be even worse if the round trip + access time of the link has a random element
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

The node senses the channel to be free, begins to count down its contention window but senses the channel to be busy before its contention window reaches zero

A
  • Node should back off
  • Retain it’s contention value for next contention
17
Q

The node transmits a packet and receives a corresponding acknowledgement.

A
  • Reset contention window range
  • Generate a new value
18
Q

Superior schedule tolerating delay of several MAC frame durations (2)

A
  • SSs have same pre-processing gain
    • therfore no traffic has significant delay constraints
  • Even split of resources that maximise overall b/w eff
    • provides best QoS