CQUniversity
Browse

File(s) not publicly available

Performance analysis of expanding ring search for multi-hop wireless networks

conference contribution
posted on 2018-11-13, 00:00 authored by Jahan HassanJahan Hassan, S Jha
Expanding ring search (ERS) is a powerful technique used frequently in multi-hop wireless networks for optimising the broadcast cost of searching. How many times to search using ERS, i.e., the search threshold L, is an interesting open question. Various work found in the literature reports an arbitrary value of the search threshold. In this paper, we analyse the impact of L on the performance of ERS by modeling three different regular network topologies - circular, grid, and hexagonal. We have also carried out a pilot study on nonregular (random) topologies. Our analysis of regular topologies suggests that although it is possible to reduce the network-wide broadcast overhead with ERS by carefully selecting parameter L, the overhead reduction is only marginal. We, however, find that for random topologies, ERS may be very effective in reducing broadcast overhead. We also present guidelines for selecting L for both regular and non-regular topologies.

History

Parent Title

2004 IEEE 60th Vehicular Technology Conference: Proceedings

Volume

5

Start Page

3615

End Page

3619

Number of Pages

5

Start Date

2004-09-26

Finish Date

2004-09-29

ISSN

1090-3038

ISBN-10

0780385217

Location

Los Angeles, CA

Publisher

IEEE

Place of Publication

Piscataway, NJ

Peer Reviewed

  • Yes

Open Access

  • No

External Author Affiliations

The University of New South Wales

Era Eligible

  • Yes

Name of Conference

60th IEEE Vehicular Technology Conference (VTC-Fall 2004)

Usage metrics

    CQUniversity

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC