Picture of a sphere with binary code

Making Strathclyde research discoverable to the world...

The Strathprints institutional repository is a digital archive of University of Strathclyde research outputs. It exposes Strathclyde's world leading Open Access research to many of the world's leading resource discovery tools, and from there onto the screens of researchers around the world.

Explore Strathclyde Open Access research content

On search sets of expanding ring search in wireless networks

Deng, J. and Zuyev, S. (2008) On search sets of expanding ring search in wireless networks. Ad Hoc Networks, 6 (7). pp. 1168-1181. ISSN 1570-8705

Full text not available in this repository. (Request a copy from the Strathclyde author)

Abstract

We focus on the problem of finding the best search set for expanding ring search (ERS) in wireless networks. ERS is widely used to locate randomly selected destinations or information in wireless networks such as wireless sensor networks. In ERS, controlled flooding is employed to search for the destinations in a region limited by a time-to-live (TTL) before the searched region is expanded. The performance of such ERS schemes depends largely on the search set, the set of TTL values that are used sequentially to search for one destination. Using a cost function of searched area size, we identify, through analysis and numerical calculations, the optimum search set for the scenarios where the source is at the center of a circular region and the destination is randomly chosen within the entire network. When the location of the source node and the destination node are both randomly distributed, we provide an almost-optimal search set. This search set guarantees the search cost to be at most 1% higher than the minimum search cost, when the network radius is relatively large.