Chapter 7, Problem P8P

a.

Program Plan Intro

Given scenario:

• The network consists of four wireless nodes A, B, C and D. The shaded region in the given figure is radio coverage of the four nodes and all the nodes share the same frequency.
• If A transmits only send/ received by the node B; if B transmits both A and C can send/ receive from the node B; if C transmits both B and D can send/ receive from C; if D transmits only C can send/ receive from D.
• If the node A wants to send the message to the node D, first a message send to the node B, which then sends to node C and finally a message reaches the targeted node D.
• The time is slotted, with a message transmission time taking exactly one time slot.

b.

Program Plan Intro

Given scenario:

• The network consists of four wireless nodes A, B, C and D. The shaded region in the given figure is radio coverage of the four nodes and all the nodes share the same frequency.
• If A transmits only send/ received by the node B; if B transmits both A and C can send/ receive from the node B; if C transmits both B and D can send/ receive from C; if D transmits only C can send/ receive from D.
• If the node A wants to send the message to the node D, first a message send to the node B, which then sends to node C and finally a message reaches the targeted node D.
• The time is slotted, with a message transmission time taking exactly one time slot.

c.

Program Plan Intro

Given scenario:

• The network consists of four wireless nodes A, B, C and D. The shaded region in the given figure is radio coverage of the four nodes and all the nodes share the same frequency.
• If A transmits only send/ received by the node B; if B transmits both A and C can send/ receive from the node B; if C transmits both B and D can send/ receive from C; if D transmits only C can send/ receive from D.
• If the node A wants to send the message to the node D, first a message send to the node B, which then sends to node C and finally a message reaches the targeted node D.
• The time is slotted, with a message transmission time taking exactly one time slot.

d.

Program Plan Intro

Given scenario:

• The network consists of four wireless nodes A, B, C and D. The shaded region in the given figure is radio coverage of the four nodes and all the nodes share the same frequency.
• If A transmits only send/ received by the node B; if B transmits both A and C can send/ receive from the node B; if C transmits both B and D can send/ receive from C; if D transmits only C can send/ receive from D.
• If the node A wants to send the message to the node D, first a message send to the node B, which then sends to node C and finally a message reaches the targeted node D.
• The time is slotted, with a message transmission time taking exactly one time slot.

e.

Explanation of Solution

• Maximum rate which a data message can be transferred from C to A with ACK:
  • The maximum rate which a data message can be transferred from C to A is one message per four slots (1 message/ 4 slots), in slot 1 a message sends from A to B, in slot 2 a message sends from B to C, in slot 3 the ACK sends from C to B and in slot 4 the ACK sends from B to A.
• Combined maximum rate which a data message can be transferred from A to B and D to C with ACK:
  • The combined maximum rate which a data message can be transferred from A to B and D to C are two ...