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

Heejun Roh; Kyunghwi Kim; Wonjun Lee

doi:10.1007/978-3-642-14654-1_21

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

Heejun Roh, Kyunghwi Kim, Wonjun Lee

School of Cybersecurity

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Wireless Algorithms, Systems, and Applications - 5th International Conference, WASA 2010, Proceedings
Pages	167-171
Number of pages	5
DOIs	https://doi.org/10.1007/978-3-642-14654-1_21
Publication status	Published - 2010
Event	5th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2010 - Beijing, China Duration: 2010 Aug 15 → 2010 Aug 17

Publication series

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

Other

Other	5th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2010
Country/Territory	China
City	Beijing
Period	10/8/15 → 10/8/17

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

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

Cite this

Roh, H., Kim, K., & Lee, W. (2010). Delay minimization of tree-based neighbor discovery in mobile robot networks. In Wireless Algorithms, Systems, and Applications - 5th International Conference, WASA 2010, Proceedings (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.
Wireless Algorithms, Systems, and Applications - 5th International Conference, WASA 2010, Proceedings. 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 proceeding › Conference contribution

Roh, H, Kim, K & Lee, W 2010, Delay minimization of tree-based neighbor discovery in mobile robot networks. in Wireless Algorithms, Systems, and Applications - 5th International Conference, WASA 2010, Proceedings. 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 Wireless Algorithms, Systems, and Applications - 5th International Conference, WASA 2010, Proceedings. 2010. p. 167-171. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 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. Wireless Algorithms, Systems, and Applications - 5th International Conference, WASA 2010, Proceedings. 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",

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).; 5th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2010 ; Conference date: 15-08-2010 Through 17-08-2010",

year = "2010",

doi = "10.1007/978-3-642-14654-1_21",

language = "English",

isbn = "3642146538",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "167--171",

booktitle = "Wireless Algorithms, Systems, and Applications - 5th International Conference, WASA 2010, Proceedings",

}

TY - GEN

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

AU - Roh, Heejun

AU - Kim, Kyunghwi

AU - Lee, Wonjun

N1 - 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).

PY - 2010

Y1 - 2010

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

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

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

SP - 167

EP - 171

BT - Wireless Algorithms, Systems, and Applications - 5th International Conference, WASA 2010, Proceedings

T2 - 5th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2010

Y2 - 15 August 2010 through 17 August 2010

ER -

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

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this