Delay minimization of tree-based neighbor discovery in mobile robot networks

Heejun Roh, Kyunghwi Kim, Wonjun Lee

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    In this paper, delay minimization schemes for tree-based neighbor discovery in mobile robot networks are proposed and analyzed. Depending on the tree construction scheme, the expected value of neighbor discovery delay is changed. In our study, we focus on M-ary and M-Binary tree-based neighbor discovery. Regarding the number of neighboring robots, M-ary tree-based neighbor discovery has low but steady performance whilst M-Binary tree-based neighbor discovery shows better performance for optimal M. The simulation results provide performance comparisons of these schemes.

    Original languageEnglish
    Title of host publicationWireless Algorithms, Systems, and Applications - 5th International Conference, WASA 2010, Proceedings
    Pages167-171
    Number of pages5
    DOIs
    Publication statusPublished - 2010
    Event5th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2010 - Beijing, China
    Duration: 2010 Aug 152010 Aug 17

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume6221 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other5th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2010
    Country/TerritoryChina
    CityBeijing
    Period10/8/1510/8/17

    Bibliographical note

    Funding Information:
    This research was jointly supported by MEST, Korea, under WCU (R33-2008-000-10044-0), a KOSEF Grant funded by the Korean Government (MEST) (No. R01-2007-000-11203-0), a KRF Grant (KRF-2008-314-D00354), and MKE, Korea under ITRC NIPA-2010-(C1090-1021-0008).

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • General Computer Science

    Fingerprint

    Dive into the research topics of 'Delay minimization of tree-based neighbor discovery in mobile robot networks'. Together they form a unique fingerprint.

    Cite this