Neighbor discovery time in schedule-based asynchronous duty cycling

In schedule-based asynchronous duty cycling, nodes alternate between active and inactive time slots in cycles that guarantee the occurrence of overlapping active time, therefore ensuring that neighbors will have opportunities to communicate. Among these schedules, Block Designs provide the minimal duty cycle for a given number of time slots [1]. However, there exists no precise estimation model for the resulting NDT when such schedules are employed. This paper provides an accurate model for nodes operating under Block Design schedules.