Publication
A new methodology for evaluating the neighbor discovery time in schedule-based asynchronous duty-cycling wireless sensor networks
| authorProfile.email | biblioteca@isel.pt | |
| datacite.subject.fos | Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática | |
| dc.contributor.author | Passos, Diego | |
| dc.contributor.author | Trabbold, Beatriz | |
| dc.contributor.author | Carrano, Ricardo C. | |
| dc.contributor.author | Sousa, Cledson de | |
| dc.date.accessioned | 2025-07-31T10:44:01Z | |
| dc.date.available | 2025-07-31T10:44:01Z | |
| dc.date.issued | 2024-12 | |
| dc.description.abstract | 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. | eng |
| dc.identifier.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 | |
| dc.identifier.doi | https://doi.org/10.1016/j.mex.2024.102967 | |
| dc.identifier.eissn | 2215-0161 | |
| dc.identifier.uri | http://hdl.handle.net/10400.21/21995 | |
| dc.language.iso | eng | |
| dc.peerreviewed | yes | |
| dc.publisher | Elsevier | |
| dc.relation.hasversion | https://www.sciencedirect.com/science/article/pii/S2215016124004187?via%3Dihub | |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | |
| dc.subject | Wireless sensor networks | |
| dc.subject | Duty cycling | |
| dc.subject | Neighbor discovery time | |
| dc.title | A new methodology for evaluating the neighbor discovery time in schedule-based asynchronous duty-cycling wireless sensor networks | eng |
| dc.type | research article | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 9 | |
| oaire.citation.startPage | 1 | |
| oaire.citation.title | Methodsx | |
| oaire.citation.volume | 13 | |
| oaire.version | http://purl.org/coar/version/c_be7fb7dd8ff6fe43 | |
| person.familyName | Passos | |
| person.givenName | Diego | |
| person.identifier.orcid | 0000-0002-9707-1176 | |
| person.identifier.scopus-author-id | 24478915900 | |
| relation.isAuthorOfPublication | 1baae68b-74ca-4d47-9c93-d990147ada03 | |
| relation.isAuthorOfPublication.latestForDiscovery | 1baae68b-74ca-4d47-9c93-d990147ada03 |