Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network.  consider the class of controlled flooding search strategies where query/search packets are broadcast and propagated in the network until a preset TTL (time-to-live) value carried in the packet expires. Every unsuccessful search attempt results in an increased TTL value (i.e., larger search area) and the same process is repeated.  derive search strategies that minimize the search cost in the worst-case, via a performance measure in the form of the competitive ratio beten the average search cost of a strategy and that of an omniscient observer. This ratio is shown in prior work to be lor bounded by 4 among all deterministic search strategies.   show that by using randomized strategies this ratio is lor bounded by e.  derive an optimal strategy that achieves this lor bound, and discuss its performance under other performance criteria.
['Nicholas B. Chang', 'Mingyan Liu']
I am writing a research paper on a idea Optimal controlled flooding search in a large wireless network
[{"from": "human", "value": "I am writing a research paper on a idea Optimal controlled flooding search in a large wireless network"}, {"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 searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network.  consider the class of controlled flooding search strategies where query/search packets are broadcast and propagated in the network until a preset TTL (time-to-live) value carried in the packet expires. Every unsuccessful search attempt results in an increased TTL value (i.e., larger search area) and the same process is repeated.  derive search strategies that minimize the search cost in the worst-case, via a performance measure in the form of the competitive ratio beten the average search cost of a strategy and that of an omniscient observer. This ratio is shown in prior work to be lor bounded by 4 among all deterministic search strategies.   show that by using randomized strategies this ratio is lor bounded by e.  derive an optimal strategy that achieves this lor bound, and discuss its performance under other performance criteria."}]