Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider a one-hop wireless network with independent time varying ON/OFF channels and  N  users, such as a multi-user uplink or downlink.  first show that general classes of scheduling algorithms that do not consider queue backlog must incur average delay that grows at least linearly with  N  .  then construct a dynamic queue-length aware algorithm that maximizes throughput and achieves an average delay that is independent of  N . This is the first order-optimal delay result for opportunistic scheduling with asymmetric links. The delay bounds are achieved via a technique of  queue  grouping together with Lyapunov drift and statistical multiplexing concepts.
['Michael J. Neely']
I am writing a research paper on a idea Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks
[{"from": "human", "value": "I am writing a research paper on a idea Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider a one-hop wireless network with independent time varying ON/OFF channels and  N  users, such as a multi-user uplink or downlink.  first show that general classes of scheduling algorithms that do not consider queue backlog must incur average delay that grows at least linearly with  N  .  then construct a dynamic queue-length aware algorithm that maximizes throughput and achieves an average delay that is independent of  N . This is the first order-optimal delay result for opportunistic scheduling with asymmetric links. The delay bounds are achieved via a technique of  queue  grouping together with Lyapunov drift and statistical multiplexing concepts."}]