A new methodology for evaluating the neighbor discovery time in schedule-based asynchronous duty-cycling wireless sensor networks

Passos, Diego; Trabbold, Beatriz; Carrano, Ricardo C.; Sousa, Cledson de

http://hdl.handle.net/10400.21/21995

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
A new methodology_DPassos.pdf		1.05 MB	Adobe PDF	Download

Send Feedback

Authors

Passos, Diego

Trabbold, Beatriz

Carrano, Ricardo C.

Sousa, Cledson de

Abstract(s)

Duty cycling is a fundamental mechanism for battery-operated wireless networks, such as wireless sensor networks. Due to its importance, it is an integral part of several Medium Access Protocols and related wireless technologies. In Schedule-based Asynchronous Duty Cycle, nodes activate and deactivate their radio interfaces according to a pre-designed schedule of slots, which guarantees overlapping uptime between two neighbors, independent of the offset between their internal clocks, making communication between them possible. This paper presents a new methodology for evaluating the Neighbor Discovery Time (NDT) of Schedule-based Asynchronous Duty Cycle. Differently from previous methodologies, it accounts for the possibility of the slots in the schedules of the two neighbors not being perfectly border-aligned - an unrealistic assumption in practice. By means of simulation, we show that not taking this under consideration can lead to an overestimate of the NDT by a factor of 2 depending on the particular scenario, thus justifying the importance of our work. center dot We propose a new subslot-based methodology for computing the NDT of a wakeup schedule used for asynchronous duty cycling. center dot It replaces the traditional slot-based methodology, by dividing slots into subslots, allowing for the analysis of non-integer clock offsets between nodes, and further allowing mathematical models to consider the more realistic continuous-time case. center dot Our validation data shows that the slot-based methodology may overestimate NDT by a factor of up to 2, making the proposed subslot-based methodology much more precise.

Keywords

Wireless sensor networks Duty cycling Neighbor discovery time

URI

http://hdl.handle.net/10400.21/21995

Citation

Passos, D., Trabbold, B., Carrano, R. C., & Sousa, C. (2024). A new methodology for evaluating the neighbor discovery time in schedule-based asynchronous duty-cycling wireless sensor networks. Methodsx, 13, 1-9. https://doi.org/10.1016/j.mex.2024.102967