Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In the information exchange problem, k packets that are initially maintained by k nodes need to be disseminated to the whole network as quickly as possible.  consider this problem in single-hop multi- channel networks of n nodes, and propose a uniform protocol that with high probability accomplishes the dissemination in O(k/F + F \cdot log n) rounds, assuming F available channels and collision detection. This result is asymptotically optimal when k is large (k \geq F^2 \cdot log n). To our knowledge, this is the first uniform protocol for information exchange in multi-channel networks.
['Li Ning', 'Dongxiao Yu', 'Yong Zhang', 'Yuexuan Wang', 'Francis C. M. Lau', 'Shengzhong Feng']
I am writing a research paper on a idea Uniform Information Exchange in Multi-channel Wireless Ad Hoc Networks
[{"from": "human", "value": "I am writing a research paper on a idea Uniform Information Exchange in Multi-channel Wireless Ad Hoc Networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In the information exchange problem, k packets that are initially maintained by k nodes need to be disseminated to the whole network as quickly as possible.  consider this problem in single-hop multi- channel networks of n nodes, and propose a uniform protocol that with high probability accomplishes the dissemination in O(k/F + F \\cdot log n) rounds, assuming F available channels and collision detection. This result is asymptotically optimal when k is large (k \\geq F^2 \\cdot log n). To our knowledge, this is the first uniform protocol for information exchange in multi-channel networks."}]