Table 1 Comparison of characteristics between algorithms.
Proposed method | Baseline algorithm-1 | Baseline algorithm-2 | |
|---|---|---|---|
Beam tracking | Yes | No | Yes |
Range of beam search (whole range is indicated as \({\Omega _{beams}}\)) | Beam is selected from \({\Omega _{beams}}\) based on point-to-point as scenario cognition deepens | Beam is selected from \({\Omega _{beams}}\) based on exhaustion | Beam is selected from \({\Omega _{beams}}\) based on the previous prediction |
Complexity of computation | \(O({N_p}{D_p})\) | \(O(({N_{b1})}^{{W_{b1}}})\) | \(O({N_{b2}}{{W_{b2}}})\) |
Training datasets | No | No | Yes |
