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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages167-171
Number of pages5
Volume6221 LNCS
DOIs
Publication statusPublished - 2010 Oct 29
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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Binary trees
Mobile Robot
Mobile robots
Binary Tree
Performance Comparison
Robots
Expected Value
Robot
Simulation

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Roh, H., Kim, K., & Lee, W. (2010). Delay minimization of tree-based neighbor discovery in mobile robot networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6221 LNCS, pp. 167-171). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6221 LNCS). https://doi.org/10.1007/978-3-642-14654-1_21

Delay minimization of tree-based neighbor discovery in mobile robot networks. / Roh, Heejun; Kim, Kyunghwi; Lee, Wonjun.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6221 LNCS 2010. p. 167-171 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6221 LNCS).

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

Roh, H, Kim, K & Lee, W 2010, Delay minimization of tree-based neighbor discovery in mobile robot networks. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6221 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6221 LNCS, pp. 167-171, 5th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2010, Beijing, China, 10/8/15. https://doi.org/10.1007/978-3-642-14654-1_21
Roh H, Kim K, Lee W. Delay minimization of tree-based neighbor discovery in mobile robot networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6221 LNCS. 2010. p. 167-171. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-14654-1_21
Roh, Heejun ; Kim, Kyunghwi ; Lee, Wonjun. / Delay minimization of tree-based neighbor discovery in mobile robot networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6221 LNCS 2010. pp. 167-171 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{3f003c8145f94b80968c4e26da9d26e6,
title = "Delay minimization of tree-based neighbor discovery in mobile robot networks",
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.",
author = "Heejun Roh and Kyunghwi Kim and Wonjun Lee",
year = "2010",
month = "10",
day = "29",
doi = "10.1007/978-3-642-14654-1_21",
language = "English",
isbn = "3642146538",
volume = "6221 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "167--171",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

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

AU - Roh, Heejun

AU - Kim, Kyunghwi

AU - Lee, Wonjun

PY - 2010/10/29

Y1 - 2010/10/29

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77958498244&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77958498244&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-14654-1_21

DO - 10.1007/978-3-642-14654-1_21

M3 - Conference contribution

AN - SCOPUS:77958498244

SN - 3642146538

SN - 9783642146534

VL - 6221 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 167

EP - 171

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -