Download now Free registration required
In this paper, the authors address a fundamental problem concerning the optimal searching strategy in terms of searching cost for the multi-target discovery problem in wireless networks. In order to find the nearest k targets from a total of m members with the least cost, how many searching attempts should they use, and how large should each searching area be? After providing the applications that motivate the research, they model the problem and derive a general formula for the expected cost as a function of the parameters of the number of searching attempts n and the searching area for each attempt, Ai.
- Format: PDF
- Size: 357.6 KB