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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
McGlynn, M.J., Borbash, S.A.: Birthday Protocols for Low Energy Deployment and Flexible Neighbor Discovery in Ad Hoc Wireless Networks. In: Proc. of ACM MOBIHOC (2001)
Santos, F., Almeida, L., Pedreiras, P., Facchinetti, T.: An adaptive TDMA Protocol for Soft Real-time Wireless Communication among Mobile Autonomous Agents. In: Proc. of WACERTS 2004 in Conjunction with RTSS (2004)
Santos, F., Almeida, L., Lopes, L.S.: Self-configuration of an Adaptive TDMA wireless communication protocol for teams of mobile robots. In: Proc. of IEEE ETFA (2008)
Arai, J., Koyama, A., Barolli, L.: Performance Analysis of an Adaptive Medium Access Control Protocol for Robot Communication. In: Proc. of ICPADS (2005)
Bianchi, G., Tinnirello, I.: Kalman Filter Estimation of the Number of Competing Terminals in an IEEE 802.11 Network. In: Proc. of INFOCOM (2003)
Bianchi, G.: Performance Analysis of the IEEE 802.11 Distributed Coordination Function. IEEE JSAC 18(3), 535–547 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roh, H., Kim, K., Lee, W. (2010). Delay Minimization of Tree-Based Neighbor Discovery in Mobile Robot Networks. In: Pandurangan, G., Anil Kumar, V.S., Ming, G., Liu, Y., Li, Y. (eds) Wireless Algorithms, Systems, and Applications. WASA 2010. Lecture Notes in Computer Science, vol 6221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14654-1_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-14654-1_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14653-4
Online ISBN: 978-3-642-14654-1
eBook Packages: Computer ScienceComputer Science (R0)