Skip to content
This repository has been archived by the owner on Aug 1, 2023. It is now read-only.

Latest commit

 

History

History
27 lines (27 loc) · 1.74 KB

README.md

File metadata and controls

27 lines (27 loc) · 1.74 KB

PECSN - Project

Opportunistic Cellular Network

Brief Description

A cellular network transmits its traffic to n users. Each user has its own FIFO queue on the transmitting antenna. On each timeslot, users report to then antenna a Channel Quality Indicator (CQI), i.e. a number from 1 to 15, which determines the number of bytes that the antenna can pack into a Resource Block (RB). Then the antenna composes a frame of 25 RBs by scheduling traffic from the users, and sends the frame to the users. A packet that cannot be transmitted entirely will not be scheduled. An RB can only carry traffic for one user. However, two or more packets for the same user can share the same RB. (e.g., packet 1 is 1.5 RBs and packet 2 is 1.3 RBs, hence ceiling(1.5 + 1.3) = 3 RBs are required to transmit them).

The antenna serves its users using an opportunistic policy: backlogged users are served by decreasing CQI. When a user is considered for service, its queue is emptied, if the number of unallocated RBs is large enough.

Project Objectives

Consider the following workload for all users:

  • Packet interarrival times are IID RVs.
  • Service demands (in bytes) are IID RV.
Study the throughput and response time of the above system with a varying workload at least in the following scenarios:
  • Exponential interarrivals, uniform service demands (the largest packet dimension is such that it fits a frame at the minimum CQI), uniform CQIs.
  • Same as above, with binomial CQIs, chosen so that the mean CQI of different users are sensibly different.