Mobile Computing Set 3

Which one represents a simple scheme that solves the hidden terminal problem.

a. CSMA

b. DAMA

c. PRMA

d. MACA

In ___ CSMA, stations sense the carrier and start sending immediately if the

medium is idle

a. p-persistent

b. 1-persistent

c. non-persistent

d. 2-persistent

In ____ CSMA, all situations wishing to transmit access the medium at the same

time as soon as it becomes idle

a. p-persistent

b. 1-persistent

c. non-persistent

d. 2-persistent

Reservation ALOHA also called as

a. CSMA

b. DAMA

c. PRMA

d. MACA

91. ______ represents a simple scheme that solves the hidden terminal problem

a. CSMA

b. DAMA

c. PRMA

d. MACA

PRMA stands for

a. Packet Reservation Multiple Access

b. Prototype Reservation Multiple Access

c. Peer Reservation Multiple Access

d. Persistent Reservation Multiple Access

93. DSMA stands for

a. Digital Sense Multiple Access

b. Dynamic Sense Multiple Access

c. Division Sense Multiple Access

MACA stands for

a. Multiple Access with Collision Detection

b. Module Access with Collision Detection

c. Mobile Access with Collision Detection

d. Mode Access with Collision Detection

DAMA also called as

a. Pure ALOHA

b. Slotted ALOHA

c. Reservation ALOHA

d. Polling

Walsh table is

a. 1-dimensional

b. 2-Dimensional

c. 3-dimensional

d. 4-Dimensional

Spread Aloha Multiple Access is a combination of

a. SAMA & MACA

b. SAMA & ISMA

c. CDMA & TDMA

d. CDMA & DSMA

Synchronization is difficult in

a. SDMA

b. TDMA

c. FDMA

d. CDMA

Which has complex receivers?

a. SDMA

b. TDMA

c. FDMA

d. CDMA

In ____ , one channel carries all transmissions simultaneously

a. TDMA

b. CDMA

c. FDMA

d. CSMA

SHARE

About df