Optimal beam scheduling for multicasting in wireless networks
View Patent ↗Systems and methods are disclosed to partition a multicast group into a plurality of partitions where each partition has a mutually exclusive subset of users or clients; scheduling beam transmission with switched beamforming antennas; and performing the multicast transmission in accordance with the beam scheduling.
1. A method for multicasting in a wireless network using an access point (AP), comprising:
[a.] partitioning a multicast group into a plurality of partitions where each partition has a mutually exclusive subset of users or clients;
[b.] scheduling beam transmission with switched beamforming antennas;
[c.] performing the multicast transmission in accordance with the beam scheduling;
transmitting sequentially each beam and obtaining the strongest received signal strength indication (RSSI) for each associated client;
determining an effective RSSI on each beam as the RSSI of a bottleneck client; and
arranging beams in decreasing order of effective RSSI.
2. The method of claim 1 , comprising sending users in the same partition the multicast data through a broadcast.
3. The method of claim 1 , comprising sending data to users in different partitions sequentially.
4. The method of claim 1 , wherein the AP determines a composite beam pattern and rate for transmission to each of the partitions.
5. The method of claim 1 , wherein the AP transmits multicast data through a composite beam pattern at a rate sufficient for all users in the partition to decode the transmitted data.
6. The method of claim 1 , comprising performing equal power splitting.
7. The method of claim 6 , comprising determining an optimal solution that partitions the set of beams arranged in decreasing order of effective RSSI in a contiguous manner.
8. The method of claim 6 , comprising determining an optimal solution that picks a composite beam pattern and rate for each partition to minimize aggregate transmission time for continuous and discrete rates.
9. The method of claim 6 , comprising:
formulating an integer program as
SPP
:
Minimize
∑
j
=
1
M
c
j
y
j
;
s
.
t
.
∑
j
=
1
M
a
ij
y
j
=
1
,
∀
i
∈
[
1
,
K
]
where
c
j
=
L
B
log
2
(
1
+
min
i
{
a
ij
R
i
*
}
∑
i
a
ij
;
a
ij
,
y
j
=
{
0
,
1
}
;
solving a linear program relaxation to obtain one or more partitions; and
determining a beam pattern and a rate for each partition.
10. The method of claim 6 , comprising determining a low complexity near optimal solution that picks a composite beam pattern and rate for each pattern to minimize an aggregate transmission time for continuous and discrete rates using an effective cost of partitions as metric.
11. The method of claim 10 , comprising determining a partition with a lowest effective cost among uncovered beams.
12. The method of claim 10 , comprising adjusting a current partition with a prior partition to minimize cost.
13. The method of claim 6 , comprising determining
Effective cost of partition=(Cost of partition)/(Number of beams covered).
14. A method for multicasting in a wireless network using an access point (AP), comprising:
partitioning a multicast group into a plurality of partitions where each partition has a mutually exclusive subset of users or clients; and
scheduling beam transmission with switched beamforming antennas;
performing the multicast transmission in accordance with the beam scheduling;
performing equal power splitting; and
determining an optimal solution that partitions the set of beams arranged in decreasing order of effective RSSI in a contiguous manner.
15. A method for multicasting in a wireless network using an access point (AP), comprising:
partitioning a multicast group into a plurality of partitions where each partition has a mutually exclusive subset of users or clients; and
scheduling beam transmission with switched beamforming antennas;
performing the multicast transmission in accordance with the beam scheduling;
performing asymmetric power control; and
determining an optimal solution for continuous rates that picks a single composite beam pattern, transmission rate for the composite pattern and power allocation to constituent beams in the composite pattern to minimize aggregate transmission time.
16. The method of claim 15 , comprising determining a near-optimal solution for discrete rates that partitions the set of beams non-contiguously.
17. The method of claim 16 , comprising determining a near-optimal solution for discrete rates that involves multiple partitions, and picks a composite beam pattern for every partition, transmission rate for each pattern and power allocation to constituent beams in the composite pattern to minimize aggregate transmission time.
18. The method of claim 16 , comprising determining the specific partitions of lowest cost based on discrete rates for a given number of partitions as input, and picking the best set of partitions yielding the lowest cost among various inputs.
19. The method of claim 18 , comprising increasing the number of partitions by
determining a partition among existing partitions that when further partitioned into two yields the lowest incremental cost based on continuous rates; and
obtaining a corresponding cost based on discrete rates.