Consider four wireless nodes (A, B, C, D). The radio coverage is shown in the attached figure. When A transmits, it can only be heard/received by B; when B transmits, it is heard/received by C; when C transmits, it is heard/received by B and D; when D transmits, only C can hear/receive it.
Suppose each node has an infinite supply of messages it can send to other nodes, and that all share the same frequency. If a message's destination is not an immediate neighbor, then the message must be relayed (e.g., A can communicate with D by having its messages relayed through B and C).
Time is slotted, with a message transmission between neighboring nodes taking exactly one slot. During a slot, a node can do one of three things: (i) send a message; (ii) receive a message; (iii) remain silent. If a node hears two or more simultaneous transmissions, a collision occurs and none of the transmissions is correctly received. Ignore all other potential sources of message errors (such as bit errors caused by fading).
Suppose, further, that there is an omniscient controller that has perfect information of network conditions and can schedule transmissions between nodes in an optimal way.
Finally, suppose a data message is to be transferred from C to A. What is the maximum rate at which this transfer can occur, given that there are no other messages between
other source/destination pairs, expressed as messages/slot.
Recently Asked Questions
- Please analyze the output related to the problem. What is the objective function value? What does this value mean? What is the optimal solution? What does it
- They ask you to explain how, prior to the recapitalization, the company had $2.0 billion of positive equity and now it’s a $2.0 billion deficit? What kind of
- The Area of a rectangle is 10 square inches. If the length is 5 inches less than 3 times the width, the find the dimensions of the rectangle. Round off your