Capacity Assignment

Problems
By Yaqeen Jasim
Supervised by Prof. Dr.Saad Talib
Agenda

● 5.3.3 Modeling Wireless Networks

● 5.3.3.1 Capacity Region
● 5.3.3.2 Indirect Capacity Allocation
● 5.4 MAC Design in Hard-Interference Scenarios
● 5.4.1 Optimization in Random Access Networks
● 5.4.1.1 TA-to-Capacity Relation
● 5.4.1.2 Capacity Region
● 5.4.2.3 CSMA and Maximum Entropy
● 5.5 Transmission Power Optimization in Soft Interference
Scenarios
Modeling Wireless Networks

● Wireless links may appear or disappear due to channel fluctuations. A

link exists only when channel conditions allow correct transmission.
● Ad-hoc networks:
All nodes are of the same type; any two nodes can communicate
directly if the channel between them is good.
● Cellular networks:
Two types of nodes: base stations and mobile users.
Mobile users cannot communicate directly with each other;
communication is only via the base station. Links include: user–BS,
BS–user, and BS–BS.
● Link capacity:
ue​is the amount of traffic that can be correctly received at the end
of the link.
Capacity Region
Capacity Region
 Indirect Capacity Allocation
● Capacity-allocation algorithms in wireless networks are distributed
iterative methods that run at network nodes to quickly adapt link
capacities to changing conditions. The capacity of a link is not set
directly; instead, it results from controlling other parameters. For
example, in cellular networks the link capacity is determined by
transmission power, and giving more power to one link increases its
capacity but also increases interference that reduces others’
capacities. In another case, MAC protocols assign each link a channel-
access probability, and increasing this probability raises its capacity
but also increases collision chances, reducing the capacity of other
users. In this setting, the general capacity-assignment problem aims to
maximize the network utility.
Indirect Capacity Allocation
Indirect Capacity
Allocation
MAC Design in Hard-Interference
Scenarios
MAC Design in Hard-Interference Scenarios
 MAC Design in Hard-Interference Scenarios

This region contains all possible link-capacity

vectors that respect interference constraints.
It is convex because it is formed by convex
combinations of the capacity vectors of valid
schedules. The design goal of MAC protocols is
to achieve any capacity inside U But practical
constraints may limit protocols to a smaller
region than U
Optimization in Random Access Networks
Optimization in Random
Access Networks
TA-to-Capacity Relation
TA-to-Capacity Relation
Capacity Region
CSMA and Maximum Entropy
CSMA and Maximum Entropy
Transmission Power Optimization in
Soft Interference Scenarios
Transmission Power Optimization in Soft
Interference Scenarios
Thank