Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A key problem in wireless networking is how to choose a link activation schedule and associated pors in concert with routing decisions to optimize throughput. Back-pressure control policies are optimal in this context, but the underlying por control problem is non-convex. Back-pressure por control (BPPC) was recently shown to be NP-hard, yet amenable to successive convex approximation strategies that deliver manifold improvements in end-to-end throughput relative to the prior art in wireless networking. A drawback is that existing implementations are centralized, whereas practical por control has to be distributed across the network.  fills this gap by developing a distributed version of the core step of successive convex approximation of the BPPC problem, building upon the Alternating Direction Method of Multipliers (ADMoM). The resulting protocol enjoys favorable properties relative to dual decomposition - based implementations, and allows tight approximation of the BPPC objective in all interference regimes. Judicious simulations reveal that the proposed algorithm matches the performance of its centralized counterpart, as ll as pertinent trade-offs in terms of the design parameters.
['Evaggelia Matskani', 'Nikolaos Sidiropoulos', 'Leandros Tassiulas']
I am writing a research paper on a idea Distributed back-pressure power control for wireless multi-hop networks
[{"from": "human", "value": "I am writing a research paper on a idea Distributed back-pressure power control for wireless multi-hop networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A key problem in wireless networking is how to choose a link activation schedule and associated pors in concert with routing decisions to optimize throughput. Back-pressure control policies are optimal in this context, but the underlying por control problem is non-convex. Back-pressure por control (BPPC) was recently shown to be NP-hard, yet amenable to successive convex approximation strategies that deliver manifold improvements in end-to-end throughput relative to the prior art in wireless networking. A drawback is that existing implementations are centralized, whereas practical por control has to be distributed across the network.  fills this gap by developing a distributed version of the core step of successive convex approximation of the BPPC problem, building upon the Alternating Direction Method of Multipliers (ADMoM). The resulting protocol enjoys favorable properties relative to dual decomposition - based implementations, and allows tight approximation of the BPPC objective in all interference regimes. Judicious simulations reveal that the proposed algorithm matches the performance of its centralized counterpart, as ll as pertinent trade-offs in terms of the design parameters."}]