Debian Codegraph @

tcl/edu/rts-cts/RTS-CTS-DATA-ACKdescription

raw
1 RTS-CTS-DATA-ACK
2 ----------------
3
4 In a Wireless network topolgy, when not all nodes are within each other's
5 range, carrier sense only provides information about collisions at the
6 sender, not at the receiver. This leads to problems like "hidden terminal"
7 (where two sender nodes out of range of each other transmit packets at the
8 same time, to the same receiver, resulting in collisions at the
9 receiver).
10 To solve such problems, control packets (RTS & CTS) are used, as an
11 alternative to the carrier sense protocol. When a node wants to transmit
12 packets, it first sends a RTS (Request To Send) packet to the reciever.
13 All nodes within the sender's range receive this RTS packet. Every node
14 hearing the RTS packet will defer transmission. If receiver is not
15 receiving data from any other node, it responds with a CTS (Clear To Send)
16 packet. This packet is again received by every node within receiver's
17 range. So all nodes in the range defer transmission . Sender node sends
18 the data packet after receiving CTS. If sender node does not hear the CTS,
19 it will time-out and schedule retransmission of RTS. On receiving the data
20 packet, reciever sends an ACK to the sender. Link layer ACKs are used to
21 facilitate recovery from collision faster. RTS and CTS packets are very
22 short, hence their collision is very less likely.If RTS packets from 2
23 sender nodes collide at the receiver, sender nodes will not receive a CTS
24 packet and the nodes, as a result will back off for certain duration,
25 resulting in collision detection.
26 This protocol solves the hidden terminal problem, even though two sender
27 nodes may be out of range of each other, but they both are in the range of
28 the receiver they want to send the data packets to. Hence, when receiver
29 responds to one node with a CTS packet, it will be heard by the other
30 sender node too and it will defer transmission.
31 In our animation, we have 3 nodes 0, 1, 2.
32 We see how the nodes behave in the following 3 cases :
33 Case 1:
34 -------
35 Both sender nodes, nodes 0 and 2 are in range of each other, but node 1
36 is out of range of node 2.
37 When node 2 wants to send data to node 0 and node 0 wants to send data to node 1.
38 In this case, both nodes 0 and 2 do carrier sense. Node 0 then sends
39 RTS packet to nodea 1 and 2. Node 2 backs off after hearing this
40 RTS packet. Node 1 sends a CTS to Node 0 and Node 0 performs its
41 data transmission, at the end of which, node 2 again does a carrier
42 sense and performs its data transmission, finding the medium free.
43
44 Case 2:
45 -------
46 Both sender nodes 0 and 2 are in range of each other and in range of node 1.
47 So, they can all hear each other's RTS and CTS packets.
48 In this case, when node 2 wants to send data to node 1 at the same time that
49 node 0 wants to send data to node 1, node 2 hears the RTS from node 0 and backs off,
50 thus deferring its transmission till node 0 finishes its transmission
51 and hence avoiding collision at the receiver.
52
53 Case 3:
54 -------
55 Both sender nodes 0 and 2 are out of range of each other but are in range
56 of node 1, the receiver.
57 In this case, nodes are not able to hear each other's RTS packets, but
58 are able to hear CTS packet from th receiver and hence back off, deferring
59 transmission till the other node finishes transmission.
60
61 So, we see in all 3 cases, one node backsoff, thus avoiding collisions at the
62 receiver and hence solving the hidden terminal problem.