Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider the problem of throughput-optimal broadcasting in time-varying wireless network with an underlying Directed Acyclic Graph (DAG) topology. Known broadcast algorithms route packets along pre-computed spanning trees. In large wireless networks with time-varying connectivities, the optimal trees are difficult to compute and maintain.   propose a new online throughput-optimal broadcast algorithm, which takes packet-by-packet scheduling and routing decisions, obviating the need for maintaining any global topological structures, such as spanning-trees. Our algorithm utilizes certain  queue-like  system-state information for making transmission decisions and hence, may be thought of as a generalization of the ll-known  back pressure algorithm , which makes point-to-point unicast transmission decisions based on local queue-length information. Technically, the back-pressure algorithm is derived by stabilizing the packet-queues. Hover, because of packet-duplications, the work-conservation principle is violated and appropriate queuing processes are difficult to define in the broadcast setting. To address this fundamental issue,  identify certain state-variables whose dynamics behave like  virtual queues . By stochastically stabilizing these virtual queues,  devise a throughput-optimal broadcast policy.  also derive new characterizations of the broadcast-capacity of time-varying wireless DAGs and derive an efficient algorithm to compute the capacity exactly under certain assumptions, and a poly-time approximation algorithm for computing the capacity approximately under less restrictive assumptions.
['A. Sinha', 'Leandros Tassiulas', 'Eytan Modiano']
I am writing a research paper on a idea Throughput-optimal broadcast in wireless networks with dynamic topology
[{"from": "human", "value": "I am writing a research paper on a idea Throughput-optimal broadcast in wireless networks with dynamic topology"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider the problem of throughput-optimal broadcasting in time-varying wireless network with an underlying Directed Acyclic Graph (DAG) topology. Known broadcast algorithms route packets along pre-computed spanning trees. In large wireless networks with time-varying connectivities, the optimal trees are difficult to compute and maintain.   propose a new online throughput-optimal broadcast algorithm, which takes packet-by-packet scheduling and routing decisions, obviating the need for maintaining any global topological structures, such as spanning-trees. Our algorithm utilizes certain  queue-like  system-state information for making transmission decisions and hence, may be thought of as a generalization of the ll-known  back pressure algorithm , which makes point-to-point unicast transmission decisions based on local queue-length information. Technically, the back-pressure algorithm is derived by stabilizing the packet-queues. Hover, because of packet-duplications, the work-conservation principle is violated and appropriate queuing processes are difficult to define in the broadcast setting. To address this fundamental issue,  identify certain state-variables whose dynamics behave like  virtual queues . By stochastically stabilizing these virtual queues,  devise a throughput-optimal broadcast policy.  also derive new characterizations of the broadcast-capacity of time-varying wireless DAGs and derive an efficient algorithm to compute the capacity exactly under certain assumptions, and a poly-time approximation algorithm for computing the capacity approximately under less restrictive assumptions."}]