Research Article
Efficient Wireless Broadcasting through Joint Network Coding and Beamforming
Algorithm 1
Greedy-selection-based algorithm.
step 1: Initialization | | | | step 2: For each MS , compute where is determined by semiorthogonal to the subspace | | | {Note that when , assume | step 3: Select the MS such that | | | | | step 4: Find a cluster of MSs whose SINRs are greater than some threshold . We denote that cluster | by where and | step 5: If , compute as follows: | | where , and | | {Note that if and then go to step 2. Otherwise, the algorithm terminates and | returns a set of scheduled MSs} |
|