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
- Complete parts (a) and (b) using the probability distribution below. The number of overtime hours worked in one week per employee Overtime hours 0 1 2 3
- How do you compute df for the chi-square test for goodness of fit? a. df = n – 1 b. df = n – C (where C is the number of
- Could kesmer have instituted her changes without eliciting a negative reaction from the worker? If so how?