• Tidak ada hasil yang ditemukan

ENE 422 Data Communications

N/A
N/A
Protected

Academic year: 2024

Membagikan "ENE 422 Data Communications"

Copied!
8
0
0

Teks penuh

(1)

D

~11', ENE 422 Data Communications

A A A " A f': .:td

n,ft'l!fTlA''lO"i'nJmann·rn'M.mma:::L't1"ifl3J'M.,ft3J iln

3 section 2

"' ..I

t'lel1J 1~~1i'YI 3 <;1~11-lll ~-"'· 2561

na,

9:00 - 12:00 '"·

'I,, A ..t.... .., IV

1. '1HlH1lU1"1!1'1.UJ 22 '1111 8 'VIU1

2. him•onc;iliihwil'.;ii111h:n11um1L1tJi.uii1i11-:1H11u

3. il'M.011c;}li'lhunH1'i A4 ,i1u1u 2 LLe-iU L'IJ1i1l-:JH1lULi LLfl:i11-:ia.;ifiwl-:i 2 LLe-iWYfl1llJfl'IJ'IJ1lH1l'IJ 4. ii1£1.;iluii11H11rn'Yi1ifu

5. la.io'M.ru1c;i

1

iKihLfl~1).;Jf11U 1tu.L'IJ11' 1).;Jff1)'1J 6. la.io'M.ru1c;i l i'll1"r'l,!U1Un1lJL"li1i11.;iH1J'IJ

... ... ,:I O ... ..,

7. 'V11lJUni'lmflU1'111JH1JU1J 1Jnu11nV111.;iH111J

Iii, La owlii, u ":::",

L~oi:.nfln1t1m110 ffillJLff~,iio-1 uni'.iou on m'i&1m'iA&1ffot1 L

. Yi

011 o o'M.ru1c;ioon"o nio-1ffot1

.

.,

., .,

..

'111lH1lU'V\U1'Yl 2 3 4 5 6 7 8

39 25 35 30 37 34 30 230

~e1-a11a ... "iMffin~n:Y., ... .

.=a - ... ... ....

1

'iA'. c;i-s. L'iil'1'ii1'1 "!ilffll'i:: ~ilil011ilffiltl ( 'Yl'i: 9060)

ifo ff ii uifli U1'M, n1'i1.h::L3J'M,';)1 nAm:::n'i'i3J 01'it.h::,11mA1'.111LLa'l

7 ...

(2)

.a QJ 0.1.d

'lf'O-ffQ'1 _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ '.i'Hff'UflfYfl'Hl _ _ _ _ _ _

1. n1,rn~ i1-h::i1Jfftyty1wi~11i'W11h.nnn (20 fl::;!l'U'U)

a. \M1l~ffWWlW'Utl-:J 01010101 1~uiiManchester scheme ., .,

b. \l-:J1Jt1fl'Ut1~1m::;'Ut1lffU'Utl-:J Manchester scheme

c.11-:i11~tYWWlW'Utl-:J 01010101 hm1i'MLT-3 ., .,

j/ d j/ d

d. 11-:i1Jt1fl'Ut1~1m::;'Utll'i:YU'Ut1-:J ML T-3

2. (15 fl::;!l'U'\.!)

a. disparity controller iiii'r~titi::;i'.i _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _

b. tiimuin disparity controller 'Utl-:J 8B6T _ _ _ _ _ _ _ _ _ _ _ _ _ _

c. tiimuin disparity controller 'Utl-:J 6B/1 OB _ _ _ _ _ _ _ _ _ _ _ _ _

3. \l-:J1Jtlflfl1111'11111U'Utl-:Jn'\'U 8 'Utl-:J 10B58 ( 4

(3)

A °" Q,I ~

'lftHYQcl _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 'HHY'Uflfffl'lll _ _ _ _ _ _

,,

4. Codewords 9i'fJi'lJuiifJt1HY1J'!ffil;~l~'\.l'\1l'fli11 l'W'il:::'fl:::i'i (5 fl:::U'U'U)

00000 0 10 11 1 0111 1 11 11

5. ~~flll!1Wfll 2-byte checksum 'll'fl~ 0x4567BA98CABF (5 fl:::U'U'U)

6. fll'l-11-!~

lir

data word 11'Jl! 101001 Ucl:::iTttl'i 11'Jl! 10111 M'l-11 codeword 'IJ'fJ~a~tY~

( 6 fl:::Ul!l!)

7. 'flnmuri111 node-to-node communication (4 fl:::Ul!l!)

' ,,

8. t1nmmnu1n111'1Ju (5 fl:::lll!l!)

Control 10 SREJ

(4)

I

Control

I o Is•

9

10. Draw the window position and flow diagram between Node A and Node B by Selective Repeat ARQ using the frame numbers Oto 5 and the window size is 3 slots. (30 r1::u1rw)

- Timer for Frame 0 starts at the first request. Frame 0 is sent from Node A but lost.

- During waiting for the acknowledgment from Node B, Timer for Frame l starts at the second request. Frame 1 arrived to Node B safely.

- Draw what Node B has to do. At the same time, Timer for Frame 2 starts at the third request. Frame 2 arrived to Node B safely.

- After Node A received the frame, draw what node A has to do.

- After Node B received the frame, draw what node B has to do.

Node A NodeB

(5)

.i:!t QI Q.J,-:S

'lH.H1'fJ"1 _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 'HH1''Uf1flf11-,Jl _ _ _ _ _ _

11. ~'tl1Jfll01lJt~tnt11J Selective Repeat ARQ (15 fl~U'U'U)

a. '1'11Jflf117 Selective Repeat ARQ ~f111 Stop-and-Wait ARQ protocol edi.:i11

.A l'I d ,A l'l ., ., , .I .J l'l. I t

b. '1'11Jflf11.:Jfl'U 1'1J'VlllJfl 1Hl1'J1Jll~ff.:itTIHl'IJ'U rn'lt'U network layer

12. (15 fl~U'U'U)

I

Flag

I

Address

I

Control

I

Protocol

I

Payload

I

FCS

I

Flag

I

,, '

c. 'U'U~fl'Wvi~t1f111 network phase iiw:n:url1riqJ0d1.:ih

(6)

a Q.I QI 4

'lfO-ffQcl _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ l'Vlff'Uflrrt1'tll _ _ _ _ _ _ 13. propagation time ll1lfl1J 3 µs !lei::: transmission time 1n1n'U 5 µs ffl.JlJ~11ii 2 stations

A 1rn::: B m1:::1~'I.Hl'll'll bus CSMA/CD (18 fl:::ll'U'U) a.

1J'j'jUlf.Jl~tnn1Jml'ii',11vJrn

- - - -

,,

b. l'i-nrn.:i stations ri.:i1vJnrnom.Jrn!t:11Jfl'U ll~cl::: station 11;:;ffllJl'.if.'l detect flll'lf'Ufl'U ,rn.:iivJrn 1;t11 lJ 111111.h~t:11li'm~Hm.h:::nt:11Jt11~01J

14. fflJlJ~i1ij 2 stations A 1rn::: B 1rn:::1~'Ull1J1J bus CSMA/CD l:::U:::Yll.:i'.i:::1111.:ifft:1.:i stations ll1lfl1J 2000 llJ~'j 1m:::nm11J1~1fl~'U!Viifl1J 2 X l 08 m/s t"i'1 station A 11:uri.:i~

11'1111 i1.hi~flt:1c1t11:::111' station B ri.:i1vJ'.i1J~11m 11 +8µs11~t:11:u l'rn1:::t:1:::1'.i (6fl:::ll'U'U)

a. t"i'1H 1-p e r s i s t e n t - - - ~ - - - - b ,, , ,, .

. m 'If nonpers1stent _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _

15. 11.:i1Jt:1flfft:1.:i1V1fl'Ufl~ CSMA/CD 1i1~t:1'111fll'.i'lf'Ufl'U'll~rnvJrn ( 4 fl:::ll'U'U)

16. t:1irnt1t1111 Token Ring MAC (5 fl:::ll'U'U)

(7)

.A QI a.,,:!l

'lftHYfJ~ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 'HHY'Uflflfl1:ll _ _ _ _ _ _ 18. station AB 1rn:: C fi1rl'.:il!~'1'U'U!'li'1li medium (9 fl~ll'U'U)

a. fll'Hil11u11~1'U1'U slot lu contention window 1illi'U'uo.:iu~~~ station 'YJOOH11

b. 'il·rnnmu contention window flllll'it:l'lhu'hl'rvhlJ'i.:iflllJ station i1i1n11fllrn'U

mh:ih

19. 'il-:JOfi'lJlUflWfff 1-:i switching table (5 fl~ll'U'U)

20. (15 fl~U'U'U)

Preamble SFD Destination address

Source address

Type Data and Padding CRC-32

a. 'il-:J1JOfl'l1Ul~'\Jij,:j Type

v b ~ - - - -

b. Padding fiomnilo::11

- - - -

"' ,.I .I ' 'J) ,f 'J) ,f 'J) 0 111

d. mmrtrnmnm111~01 t'.ilt~O'i'il~~o-:imo::; 11

- - - -

21. m1u1m~u1ti11 contention-free MAC sublayer'\J0'1 IEEE 802.11 wireless LAN (5 fl~U'U'U) _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _

(8)

~ Q,I a . , ~

'l10-ffQtl _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 'HHY'Uf1f'lft'lfl _ _ _ _ _ _

"

22. 'il.:i1rn'Ut11t.m.1~011H1 (30 i'l~uuu)

I

FC

I

D

I

Address 1

I

Address 2

I

Address 3 j SC

I

Address 4

I

payload j ?

,,

c. 01tvlrnilt~'U RTS t'V'lrn address 1 ui1~ address 2 fio address o~1l

d. 'il.:i'l11ti1 D 'Uti.:it'V'lrn RTS 01it1-m1ni.:i data frame \i1u1u 1 rwrn ffl.ll,1;11

transmission time 'Utl.:i data t'nlf1'U 20µs Utl~'Uti.:i RTS, CTS, ACK t'nlfi'U lµs

tm~ SIFS t'\1lf1'U 0.5 µs Uri~ propagation time tl1lf1'U 10 µs

~111 ~ ' 111 ' ~I • .I "'

e. t'l'llJllOl i~mm inltlJ'l-HTirn RTS '11'rn CTS

Referensi

Dokumen terkait

To improve the coverage rate of wireless sensor network node in the campus and prolong network lifetime, an optimization method for network node coverage based on escape particle

• Projects, views, tables, charts, layout, and scripts all have their own windows • Only one window is “active” at a time • To make a window active, click on it. or select it

Second, we show that, for the following four system performance measures: (a) mean waiting time in queue, (b) mean waiting time in system, (c) mean number of customers in queue and

The ease of insertion, high retention rate and readability of both the internal elastomer and alphanumeric tags will increase the efficiency of selective breeding programs by

However, it relies on TikZ node and edge mechanisms to draw nodes and edges, instead of using the drawing information provided by Graphviz2. This allows much tighter integration

COCR Communications Operating Concept and Requirements for the Future Radio System COTP Connection Oriented Transport Protocol CPDLC Controller Pilot Data Link Communication CRC Cyclic

If there are five nodes in a distributed system and when the leader node is down, then the waiting time for the remaining four nodes can be assigned according to the following steps:

Further, we obtain the Walnut’s representation and invertibility of the frame operator corresponding to Gabor superframes and multi-window Gabor frames onWHLp, Lqv, 1≤p, q≤ ∞,as a