Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  establish an O(n log/sup 2/n) upper bound on the time for deterministic distributed broadcasting in multi-hop radio networks with unknown topology. This nearly matches the known lor bound of /spl Omega/(n log n). The fastest previously known algorithm for this problem works in time O(n/sup 3/2/). Using our broadcasting algorithm,  develop an O(n/sup 3/2/log/sup 2/n) algorithm for gossiping in the same network model.
['Marek Chrobak', 'Leszek Gasieniec', 'Wojciech Rytter']
I am writing a research paper on a idea Fast broadcasting and gossiping in radio networks
[{"from": "human", "value": "I am writing a research paper on a idea Fast broadcasting and gossiping in radio networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  establish an O(n log/sup 2/n) upper bound on the time for deterministic distributed broadcasting in multi-hop radio networks with unknown topology. This nearly matches the known lor bound of /spl Omega/(n log n). The fastest previously known algorithm for this problem works in time O(n/sup 3/2/). Using our broadcasting algorithm,  develop an O(n/sup 3/2/log/sup 2/n) algorithm for gossiping in the same network model."}]