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