Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  study the problem of link scheduling for multi-hop wireless networks with per-flow delay constraints under the   $K$  -hop interference model. Specifically,  are interested in algorithms that maximize the asymptotic decay-rate of the probability with which the maximum end-to-end backlog among all flows exceeds a threshold, as the threshold becomes large.  provide both positive and negative results in this direction. By minimizing the drift of the maximum end-to-end backlog in the converge-cast on a tree,  design an algorithm, Largest-ight-First (LWF), that achieves the optimal asymptotic decay-rate for the overflow probability of the maximum end-to-end backlog as the threshold becomes large. Hover, such a drift minimization algorithm may not exist for general networks.  provide an example in which no algorithm can minimize the drift of the maximum end-to-end backlog. Finally,  simulate the LWF algorithm together with a ll known algorithm (the back-pressure algorithm) and a large-deviations optimal algorithm in terms of the sum-queue (the P-TREE algorithm) in converge-cast networks. Our simulation shows that our algorithm performs significantly better not only in terms of asymptotic decay-rate, but also in terms of the actual overflow probability.
['Shizhen Zhao', 'Xiaojun Lin']
I am writing a research paper on a idea Design of scheduling algorithms for end-to-end backlog minimization in wireless multi-hop networks under k -hop interference models
[{"from": "human", "value": "I am writing a research paper on a idea Design of scheduling algorithms for end-to-end backlog minimization in wireless multi-hop networks under k -hop interference models"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  study the problem of link scheduling for multi-hop wireless networks with per-flow delay constraints under the   $K$  -hop interference model. Specifically,  are interested in algorithms that maximize the asymptotic decay-rate of the probability with which the maximum end-to-end backlog among all flows exceeds a threshold, as the threshold becomes large.  provide both positive and negative results in this direction. By minimizing the drift of the maximum end-to-end backlog in the converge-cast on a tree,  design an algorithm, Largest-ight-First (LWF), that achieves the optimal asymptotic decay-rate for the overflow probability of the maximum end-to-end backlog as the threshold becomes large. Hover, such a drift minimization algorithm may not exist for general networks.  provide an example in which no algorithm can minimize the drift of the maximum end-to-end backlog. Finally,  simulate the LWF algorithm together with a ll known algorithm (the back-pressure algorithm) and a large-deviations optimal algorithm in terms of the sum-queue (the P-TREE algorithm) in converge-cast networks. Our simulation shows that our algorithm performs significantly better not only in terms of asymptotic decay-rate, but also in terms of the actual overflow probability."}]