0% found this document useful (0 votes)
17 views1 page

Guc 353 59 31567 2023-05-09T07 53 21

The document outlines a tutorial for a Communication Networks course, focusing on various polling and multiple access protocols in wireless LANs. It includes calculations for maximum polling times, frame arrival rates, system efficiency, and channel allocation in GSM900. The tutorial consists of five problems requiring analytical solutions based on given parameters and assumptions.

Uploaded by

yusuf tarek
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
17 views1 page

Guc 353 59 31567 2023-05-09T07 53 21

The document outlines a tutorial for a Communication Networks course, focusing on various polling and multiple access protocols in wireless LANs. It includes calculations for maximum polling times, frame arrival rates, system efficiency, and channel allocation in GSM900. The tutorial consists of five problems requiring analytical solutions based on given parameters and assumptions.

Uploaded by

yusuf tarek
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Communication Networks [NETW501] – Spring 2021

Dr.-Ing. Maggie Mashaly


Eng. Mariham Wasfy

Tutorial 7

1. A wireless LAN using Polling to provide communications between 10 work stations and a
central base station. The system uses a channel operating at 25 Mbps. Assume that half the
stations (station of type A) are 100 meters away from the base station and are given opportunity
to send 2 frames per poll. The rest (stations of type B) are 50 meters away from the base station
and are allowed to send 4 frames per poll. The polling messages are 64 bytes long. Also assume
that frames are of constant length 1250 bytes and those stations indicate that they have no
frames to transmit with a 64 bytes message. The channels are error-free.

a. Calculate the maximum time that could elapse between 2 consecutive polls at any
station.
b. Given the value you have computed in a. What is the maximum arrival rate of frames
that station of type A may support?

2. Assume Round Robin Polling applied for 4 users A, B, C, D. Each user is allowed to transmit
only 2 frames per poll. Assume at t = 0 the polling order starts with station A followed by B,
C then D. If stations A, B, C & D need to transmit 9, 5, 7, 6 frames respectively. Assume frame
size is 1500 bytes and the transmission rate is 1 Mbps. Assume the time used to send the
polling messages are negligible as well as the propagation time.

At what time will station B be able to complete transmission of all its frames?

3. If Reservation is used as multiple access protocol and No. of stations = No. of mini-slots (M)
= 6. Each mini-slot can reserve up to 4 frames (k = 4) and frame transmission time (X) is 1
msec. and reservation delay (v) = 50 µsec.

Calculate the system maximum efficiency.

4. A wireless LAN uses Polling to provide communications between M workstations and a


central base station. The system uses a channel operating at 25 Mbps. Assume that all stations
100 meters from the base station and that polling messages are 64 bytes long. Assume that
frames are of constant length of 1250 bytes, the frame arrival rate is 40 frames/sec and that
stations indicate that they have no frames to transmit with a 64-byte message. What is the
maximum possible number of stations that can be supported if stations are allowed if stations
are allowed to transmit 4 frames per poll?

5. For GSM900, the available bandwidth is 890 → 960 MHz (890 → 915 for the uplink and
935 → 960 for the downlink). FDMA is used such that each user has 200 KHz. If two
operators share the same bandwidth, find the number of channels for each operator given that
TDMA is used to serve 8 users in 8 time slots for upload and serve 8 users in 8 time slots for
download.

1|Page

You might also like