Diego Passos , Beatriz Trabbold , Ricardo C. Carrano , Cledson de Sousa
{"title":"评估基于计划的异步占空比无线传感器网络中邻居发现时间的新方法","authors":"Diego Passos , Beatriz Trabbold , Ricardo C. Carrano , Cledson de Sousa","doi":"10.1016/j.mex.2024.102967","DOIUrl":null,"url":null,"abstract":"<div><div>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.<ul><li><span>•</span><span><div>We propose a new subslot-based methodology for computing the NDT of a wakeup schedule used for asynchronous duty cycling.</div></span></li><li><span>•</span><span><div>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.</div></span></li><li><span>•</span><span><div>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.</div></span></li></ul></div></div>","PeriodicalId":18446,"journal":{"name":"MethodsX","volume":"13 ","pages":"Article 102967"},"PeriodicalIF":1.6000,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A new methodology for evaluating the neighbor discovery time in schedule-based asynchronous duty-cycling wireless sensor networks\",\"authors\":\"Diego Passos , Beatriz Trabbold , Ricardo C. Carrano , Cledson de Sousa\",\"doi\":\"10.1016/j.mex.2024.102967\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>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.<ul><li><span>•</span><span><div>We propose a new subslot-based methodology for computing the NDT of a wakeup schedule used for asynchronous duty cycling.</div></span></li><li><span>•</span><span><div>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.</div></span></li><li><span>•</span><span><div>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.</div></span></li></ul></div></div>\",\"PeriodicalId\":18446,\"journal\":{\"name\":\"MethodsX\",\"volume\":\"13 \",\"pages\":\"Article 102967\"},\"PeriodicalIF\":1.6000,\"publicationDate\":\"2024-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MethodsX\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2215016124004187\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MULTIDISCIPLINARY SCIENCES\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MethodsX","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2215016124004187","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MULTIDISCIPLINARY SCIENCES","Score":null,"Total":0}
A new methodology for evaluating the neighbor discovery time in schedule-based asynchronous duty-cycling wireless sensor networks
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.
•
We propose a new subslot-based methodology for computing the NDT of a wakeup schedule used for asynchronous duty cycling.
•
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.
•
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.