Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  considers optimization of por and delay in a time-varying wireless link using rateless codes. The link serves a sequence of variable-length packets. Each packet is coded and transmitted over multiple slots. Channel conditions can change from slot to slot and are unknown to the transmitter. The amount of mutual information accumulated on each slot depends on the random channel realization and the por used. The goal is to minimize average service delay subject to an average por constraint.  formulate this problem as a frame-based stochastic optimization problem and solve it via an online algorithm.  show that the subproblem within each frame is a simple integer program which can be effectively solved using a dynamic program. The optimality of this online algorithm is proved using the frame-based Lyapunov drift analysis.
['Xiaohan Wei', 'Michael J. Neely']
I am writing a research paper on a idea Delay optimal power aware opportunistic scheduling with mutual information accumulation
[{"from": "human", "value": "I am writing a research paper on a idea Delay optimal power aware opportunistic scheduling with mutual information accumulation"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  considers optimization of por and delay in a time-varying wireless link using rateless codes. The link serves a sequence of variable-length packets. Each packet is coded and transmitted over multiple slots. Channel conditions can change from slot to slot and are unknown to the transmitter. The amount of mutual information accumulated on each slot depends on the random channel realization and the por used. The goal is to minimize average service delay subject to an average por constraint.  formulate this problem as a frame-based stochastic optimization problem and solve it via an online algorithm.  show that the subproblem within each frame is a simple integer program which can be effectively solved using a dynamic program. The optimality of this online algorithm is proved using the frame-based Lyapunov drift analysis."}]