Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider allocating the transmit pors for a wireless multi-link (N-link) system, in order to maximize the total system throughput under interference and noise impairments, and short term por constraints. Employing dynamic spectral reuse,  allow for centralized control. In the two-link case, the optimal por allocation then has a remarkably simple nature termed binary por control: depending on the noise and channel gains, assign full por to one link and minimum to the other, or full por on both. Binary por control (BPC) has the advantage of leading towards simpler or even distributed por control algorithms. For N>2  propose a strategy based on checking the corners of the domain resulting from the por constraints to perform BPC.  identify scenarios in which binary por allocation can be proven optimal also for arbitrary N. Furthermore, in the general setting for N>2, simulations demonstrate that a throughput performance with negligible loss, compared to the best non-binary scheme found by geometric programming, can be obtained by BPC. Finally, to reduce the complexity of optimal binary por allocation for large networks,  provide simple algorithms achieving 99% of the capacity promised by exhaustive binary search.
['A. Gjendemsj', 'David Gesbert', 'Geir E. Oien', 'Saad G. Kiani']
I am writing a research paper on a idea Binary Power Control for Sum Rate Maximization over Multiple Interfering Links
[{"from": "human", "value": "I am writing a research paper on a idea Binary Power Control for Sum Rate Maximization over Multiple Interfering Links"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider allocating the transmit pors for a wireless multi-link (N-link) system, in order to maximize the total system throughput under interference and noise impairments, and short term por constraints. Employing dynamic spectral reuse,  allow for centralized control. In the two-link case, the optimal por allocation then has a remarkably simple nature termed binary por control: depending on the noise and channel gains, assign full por to one link and minimum to the other, or full por on both. Binary por control (BPC) has the advantage of leading towards simpler or even distributed por control algorithms. For N>2  propose a strategy based on checking the corners of the domain resulting from the por constraints to perform BPC.  identify scenarios in which binary por allocation can be proven optimal also for arbitrary N. Furthermore, in the general setting for N>2, simulations demonstrate that a throughput performance with negligible loss, compared to the best non-binary scheme found by geometric programming, can be obtained by BPC. Finally, to reduce the complexity of optimal binary por allocation for large networks,  provide simple algorithms achieving 99% of the capacity promised by exhaustive binary search."}]