Delay Minimization of Tree-Based Neighbor Discovery in Mobile Robot Networks

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.

[1]  Ilenia Tinnirello,et al.  Kalman filter estimation of the number of competing terminals in an IEEE 802.11 network , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[2]  Steven A. Borbash,et al.  Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks , 2001, MobiHoc '01.

[3]  Luís Seabra Lopes,et al.  Self-configuration of an adaptive TDMA wireless communication protocol for teams of mobile robots , 2008, 2008 IEEE International Conference on Emerging Technologies and Factory Automation.

[4]  Luís Seabra Lopes,et al.  An Adaptive TDMA Protocol for Soft Real-Time Wireless Communication among Mobile Autonomous Agents , 2004 .

[5]  Leonard Barolli,et al.  Performance analysis of an adaptive medium access control protocol for robot communication , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).