Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  are interested in using large-deviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless scheduling algorithms, as the overflow threshold approaches infinity.  consider ad-hoc wireless networks where each link interferes with a given set of other links, and  focus on a distributed scheduling algorithm called Q-SCHED, which is introduced by Gupta et al. First,  derive a lor bound on the asymptotic decay rate of the queue-overflow probability for Q-SCHED.  then present an upper bound on the decay rate for all possible algorithms operating on the same network. Finally, using these bounds,  are able to conclude that, subject to a given constraint on the asymptotic decay rate of the queue-overflow probability, Q-SCHED can support a provable fraction of the offered loads achievable by any algorithms.
['Can Zhao', 'Xiaojun Lin']
I am writing a research paper on a idea On the queue-overflow probabilities of distributed scheduling algorithms
[{"from": "human", "value": "I am writing a research paper on a idea On the queue-overflow probabilities of distributed scheduling algorithms"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  are interested in using large-deviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless scheduling algorithms, as the overflow threshold approaches infinity.  consider ad-hoc wireless networks where each link interferes with a given set of other links, and  focus on a distributed scheduling algorithm called Q-SCHED, which is introduced by Gupta et al. First,  derive a lor bound on the asymptotic decay rate of the queue-overflow probability for Q-SCHED.  then present an upper bound on the decay rate for all possible algorithms operating on the same network. Finally, using these bounds,  are able to conclude that, subject to a given constraint on the asymptotic decay rate of the queue-overflow probability, Q-SCHED can support a provable fraction of the offered loads achievable by any algorithms."}]