Q. In _______ methods, a station cannot send unless it has been authorized by other stations.

View solution

Q. There are ______ popular controlled-access methods.

View solution

Q. In the ________ method, a station needs to make a reservation before sending data. Time is divided into intervals.

View solution

Q. In the _____ method, time is divided into intervals. In each interval, a reservation frame precedes the data frames sent in that interval.

View solution

Q. In the ______ method, all data exchanges must be made through the primary device even when the ultimate destination is a secondary device.

View solution

Q. In the _______ method, the primary device controls the link; the secondary devices follow its instructions.

View solution

Q. In the _______ method, the stations in a network are organized in a logical ring.

View solution

Q. In the _______ method, each station has a predecessor and a successor.

View solution

Q. In the _________ method, a special packet called a ______ circulates through the ring.

View solution

Q. _________ is a multiple-access method in which the available bandwidth of a link is shared in time, frequency, or through code, between different stations.

View solution

Q. There are ________ channelization protocols.

View solution

Q. In ________, the available bandwidth is divided into frequency bands.

View solution

Q. In ______, each station is allocated a band to send its data. In other words, each band is reserved for a specific station, and it belongs to the station all the time.

View solution

Q. In _______, the stations share the bandwidth of the channel in time.

View solution

Q. In _____, each station is allocated a time slot during which it can send data. Each station transmits its data in its assigned time slot.

View solution

Q. In _____, each station transmits its data in its assigned time slot.

View solution

Q. In ______, the stations use different codes to achieve multiple access.

View solution

Q. _______ is based on coding theory and uses sequences of numbers called chips.

View solution

Q. In _______, the sequences are generated using orthogonal codes such the Walsh tables.

View solution

Q. Busy Waiting is found in ..............

View solution