Title
Neighbor discovery time in schedule-based asynchronous duty cycling
Abstract
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.
Year
DOI
Venue
2012
10.1109/WD.2012.6402841
Wireless Days
Keywords
Field
DocType
radio networks,scheduling,NDT,block design schedule,neighbor discovery time,overlapping active time,schedule-based asynchronous duty cycling,time slots,wireless networks
Asynchronous communication,Radio networks,Scheduling (computing),Duty cycle,Computer science,Block design,Computer network,Schedule,Duty cycling,Neighbor Discovery Protocol,Distributed computing
Conference
ISSN
ISBN
Citations 
2156-9711 E-ISBN : 978-1-4673-4403-6
978-1-4673-4403-6
1
PageRank 
References 
Authors
0.37
4
5