[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (47)

Search Parameters:
Keywords = TSCH

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
24 pages, 918 KiB  
Article
Quality of Service-Aware Multi-Objective Enhanced Differential Evolution Optimization for Time Slotted Channel Hopping Scheduling in Heterogeneous Internet of Things Sensor Networks
by Aida Vatankhah and Ramiro Liscano
Sensors 2024, 24(18), 5987; https://doi.org/10.3390/s24185987 - 15 Sep 2024
Viewed by 630
Abstract
The emergence of the Internet of Things (IoT) has attracted significant attention in industrial environments. These applications necessitate meeting stringent latency and reliability standards. To address this, the IEEE 802.15.4e standard introduces a novel Medium Access Control (MAC) protocol called Time Slotted Channel [...] Read more.
The emergence of the Internet of Things (IoT) has attracted significant attention in industrial environments. These applications necessitate meeting stringent latency and reliability standards. To address this, the IEEE 802.15.4e standard introduces a novel Medium Access Control (MAC) protocol called Time Slotted Channel Hopping (TSCH). Designing a centralized scheduling system that simultaneously achieves the required Quality of Service (QoS) is challenging due to the multi-objective optimization nature of the problem. This paper introduces a novel optimization algorithm, QoS-aware Multi-objective enhanced Differential Evolution optimization (QMDE), designed to handle the QoS metrics, such as delay and packet loss, across multiple services in heterogeneous networks while also achieving the anticipated service throughput. Through co-simulation between TSCH-SIM and Matlab, R2023a we conducted multiple simulations across diverse sensor network topologies and industrial QoS scenarios. The evaluation results illustrate that an optimal schedule generated by QMDE can effectively fulfill the QoS requirements of closed-loop supervisory control and condition monitoring industrial services in sensor networks from 16 to 100 nodes. Through extensive simulations and comparative evaluations against the Traffic-Aware Scheduling Algorithm (TASA), this study reveals the superior performance of QMDE, achieving significant enhancements in both Packet Delivery Ratio (PDR) and delay metrics. Full article
(This article belongs to the Special Issue Advanced Applications of WSNs and the IoT)
Show Figures

Figure 1

Figure 1
<p>Sample tree topology showing sink, transmitting nodes, and flows.</p>
Full article ">Figure 2
<p>Simple wireless network topology with an example TSCH schedule.</p>
Full article ">Figure 3
<p>QoS-oriented Multi-objective Differential Evolution Optimization flowchart.</p>
Full article ">Figure 4
<p>Sample of six pool statuses corresponding to six time slots.</p>
Full article ">Figure 5
<p>Process of mapping the generated matrix values to sensors for TSCH schedule creation: (<b>a</b>) random matrix generation, (<b>b</b>) normalization, (<b>c</b>) mapping the sensor’s position in the pool, and (<b>d</b>) assign nodes and matching pairs.</p>
Full article ">Figure 6
<p>Co-simulation: sequence diagram of QMDE using Matlab and TSCH-SIM.</p>
Full article ">Figure 7
<p>Optimization progress in scenario 5 with 64 nodes.</p>
Full article ">Figure 8
<p>Slotframe size of QMDE algorithm in various scenarios.</p>
Full article ">Figure 9
<p>Evaluation of delay between applications in (<b>a</b>) Scn 1, (<b>b</b>) Scn 2, (<b>c</b>) Scn 3, (<b>d</b>) Scn 4, and (<b>e</b>) Scn 5.</p>
Full article ">Figure 10
<p>Evaluation of PDR for two applications in (<b>a</b>) Scn 1, (<b>b</b>) Scn 2, (<b>c</b>) Scn 3, (<b>d</b>) Scn 4, and (<b>e</b>) Scn 5.</p>
Full article ">Figure 11
<p>Time complexity of QMDE algorithm in various scenarios.</p>
Full article ">Figure 12
<p>Delay comparison between QMDE and TASA in (<b>a</b>) Scn 1, (<b>b</b>) Scn 2, (<b>c</b>) Scn 3, (<b>d</b>) Scn 4, and (<b>e</b>) Scn 5.</p>
Full article ">Figure 13
<p>PDR comparison between QMDE and TASA in (<b>a</b>) Scn 1, (<b>b</b>) Scn 2, (<b>c</b>) Scn 3, (<b>d</b>) Scn 4, and (<b>e</b>) Scn 5.</p>
Full article ">
30 pages, 24993 KiB  
Article
Multi-Objective Optimization of Orchestra Scheduler for Traffic-Aware Networks
by Niharika Panda, Supriya Muthuraman and Atis Elsts
Smart Cities 2024, 7(5), 2542-2571; https://doi.org/10.3390/smartcities7050099 - 6 Sep 2024
Viewed by 1230
Abstract
The Internet of Things (IoT) presents immense opportunities for driving Industry 4.0 forward. However, in scenarios involving networked control automation, ensuring high reliability and predictable latency is vital for timely responses. To meet these demands, the contemporary wireless protocol time-slotted channel hopping (TSCH), [...] Read more.
The Internet of Things (IoT) presents immense opportunities for driving Industry 4.0 forward. However, in scenarios involving networked control automation, ensuring high reliability and predictable latency is vital for timely responses. To meet these demands, the contemporary wireless protocol time-slotted channel hopping (TSCH), also referred to as IEEE 802.15.4-2015, relies on precise transmission schedules to prevent collisions and achieve consistent end-to-end traffic flow. In the realm of diverse IoT applications, this study introduces a new traffic-aware autonomous multi-objective scheduling function called OPTIMAOrchestra. This function integrates slotframe and channel management, adapts to varying network sizes, supports mobility, and reduces collision risks. The effectiveness of two versions of OPTIMAOrchestra is extensively evaluated through multi-run experiments, each spanning up to 3600 s. It involves networks ranging from small-scale setups to large-scale deployments with 111 nodes. Homogeneous and heterogeneous network topologies are considered in static and mobile environments, where the nodes within a network send packets to the server with the same and different application packet intervals. The results demonstrate that OPTIMAOrchestra_ch4 achieves a current consumption of 0.72 mA while maintaining 100% reliability and 0.86 mA with a 100% packet delivery ratio in static networks. Both proposed Orchestra variants in mobile networks achieve 100% reliability, with current consumption recorded at 6.36 mA. Minimum latencies of 0.073 and 0.02 s are observed in static and mobile environments, respectively. On average, a collision rate of 5% is recorded for TSCH and RPL communication, with a minimum of 0% collision rate observed in the TSCH broadcast in mobile networks. Overall, the proposed OPTIMAOrchestra scheduler outperforms existing schedulers regarding network efficiency, time, and usability, significantly improving reliability while maintaining a balanced latency–energy trade-off. Full article
Show Figures

Figure 1

Figure 1
<p>Work flow.</p>
Full article ">Figure 2
<p>Traffic-aware scheduling taxonomy.</p>
Full article ">Figure 3
<p>Different network topologies. (<b>a</b>) Modified smart home optimized path; (<b>b</b>) 10 clusters, 10 nodes; (<b>c</b>) heterogeneous.</p>
Full article ">Figure 4
<p>Slotting in four physical channels.</p>
Full article ">Figure 5
<p>Slotting in 11 physical channels.</p>
Full article ">Figure 6
<p>Different topologies. (<b>a</b>) 10 clusters, 10 nodes with mobile nodes; (<b>b</b>) 50 clusters, 10 nodes; (<b>c</b>) 100 clusters, 10 nodes.</p>
Full article ">Figure 7
<p>Reliability in static smart homes. (<b>a</b>) Basic smart home; (<b>b</b>) average smart home; (<b>c</b>) advanced smart home.</p>
Full article ">Figure 8
<p>Reliability in mobile smart homes. (<b>a</b>) Basic smart home; (<b>b</b>) average smart home; (<b>c</b>) advanced smart home.</p>
Full article ">Figure 9
<p>Latency across static smart homes. (<b>a</b>) Basic smart home; (<b>b</b>) average smart home; (<b>c</b>) advanced smart home.</p>
Full article ">Figure 10
<p>Latency across mobile smart homes. (<b>a</b>) Basic smart home; (<b>b</b>) average smart home; (<b>c</b>) advanced smart home.</p>
Full article ">Figure 11
<p>Current consumption across static smart homes. (<b>a</b>) Basic smart home; (<b>b</b>) average smart home; (<b>c</b>) advanced smart home.</p>
Full article ">Figure 12
<p>Current Consumption across mobile smart homes. (<b>a</b>) Basic smart home; (<b>b</b>) average smart home; (<b>c</b>) advanced smart home.</p>
Full article ">Figure 13
<p>Performance metrics in static evolving networks. (<b>a</b>) Packet delivery ratio; (<b>b</b>) latency; (<b>c</b>) current consumption.</p>
Full article ">Figure 14
<p>Performance metrics in mobile evolving networks. (<b>a</b>) Packet delivery ratio; (<b>b</b>) latency; (<b>c</b>) current consumption.</p>
Full article ">Figure 15
<p>Collision in static evolving networks.</p>
Full article ">Figure 16
<p>Collision in mobile evolving networks.</p>
Full article ">Figure 17
<p>Homogeneous topology performance. Similar vs. varying application packet intervals in static and mobile environments.</p>
Full article ">Figure 18
<p>Collision rate comparison in homogeneous topologies: static vs. mobile environments with varying packet intervals.</p>
Full article ">Figure 19
<p>Analysis of static heterogeneous topologies: impact of varying packet intervals.</p>
Full article ">Figure 20
<p>Collision rate analysis in static heterogeneous topologies: effect of variable packet intervals.</p>
Full article ">Figure 21
<p>Analysis of mobile heterogeneous topologies: impact of varying packet intervals.</p>
Full article ">Figure 22
<p>Collision rate analysis in mobile heterogeneous topologies: effect of variable packet intervals.</p>
Full article ">
18 pages, 4142 KiB  
Article
Improved Cell Allocation Strategies Using K-Means Clustering in Congested 6TiSCH Environments
by Fransiskus Xaverius Kevin Koesnadi and Sang-Hwa Chung
Sensors 2024, 24(17), 5608; https://doi.org/10.3390/s24175608 - 29 Aug 2024
Viewed by 636
Abstract
The 6TiSCH protocol (IEEE 802.15.4e) is crucial for the Industrial Internet of Things (IIoT), utilizing a time-slotted channel hopping (TSCH) mode based on node distribution. In this study, we propose an innovative cell allocation strategy based on node position clustering using the K-means [...] Read more.
The 6TiSCH protocol (IEEE 802.15.4e) is crucial for the Industrial Internet of Things (IIoT), utilizing a time-slotted channel hopping (TSCH) mode based on node distribution. In this study, we propose an innovative cell allocation strategy based on node position clustering using the K-means algorithm, specifically designed to address congestion and optimize resource distribution in the 6TiSCH network. Our mechanism effectively groups nodes into clusters, allowing for dynamic adjustment of cell capacities in congested areas by analyzing traffic patterns and the spatial distribution of nodes. This clustering approach enhances the efficiency of slot frame utilization and minimizes communication delays by reducing interference and improving routing stability. The proposed strategy leverages the clustering results to improve cell usage efficiency and reduce communication latency between nodes. By tailoring cell allocation to the specific traffic needs of each cluster, we significantly reduce packet loss, manage congestion more effectively, and enhance data transmission reliability. We evaluated the clustering method using the K-means algorithm through experiments with the 6TiSCH simulator. Additionally, we considered using objective functions in Routing Protocol for Low-Power and Lossy Networks (RPL), such as OF0 and MRHOF, to assess clustering results and their impact on throughput and packet delivery. Our method resulted in significantly improved average performance metrics. Under the OF0 routing protocol, we achieved a 30.01% latency reduction, a 15.95% faster joining time, an 8% higher packet delivery ratio, and a 13.82% throughput increase. Similarly, we observed a 12.34% improvement in packet delivery ratio, 21.06% latency reduction, 12.68% faster joining time, and 25.97% higher throughput speed with the MRHOF routing protocol. These findings highlight the effectiveness of the improved cell allocation strategy in congested 6TiSCH environments, offering a better solution for enhancing network performance in IIoT applications. Full article
(This article belongs to the Section Sensor Networks)
Show Figures

Figure 1

Figure 1
<p>Pseudocode for K-means cluster center initialization and updating.</p>
Full article ">Figure 2
<p>Pseudocode for node granting and optimal K selection: Coordinate clustering.</p>
Full article ">Figure 3
<p>Pseudocode for node granting and optimal K selection: Clustering algorithm.</p>
Full article ">Figure 4
<p>TSCH scheduling based on period traffic.</p>
Full article ">Figure 5
<p>As-is diagram of default cell allocation in TSCH.</p>
Full article ">Figure 6
<p>To-be diagram of cell allocation through clustering approach.</p>
Full article ">Figure 7
<p>Pseudocode for enhanced TSCH cell allocation based on clustering.</p>
Full article ">Figure 8
<p>Scheme of the proposed clustering for cell allocation.</p>
Full article ">Figure 9
<p>Graphs showing results for the Objective Function Zero (OF0) routing protocol: (<b>a</b>) Packet Delivery Ratio (PDR), (<b>b</b>) end-to-end latency, (<b>c</b>) joining time, and (<b>d</b>) throughput.</p>
Full article ">Figure 10
<p>Graph results of the Minimum Rank with Hysteresis (MRHOF) routing protocol: (<b>a</b>) Packet Delivery Ratio (PDR), (<b>b</b>) end-to-end Latency, (<b>c</b>) joining time, and (<b>d</b>) throughput.</p>
Full article ">
18 pages, 1359 KiB  
Article
Distance- and Angle-Based Hybrid Localization Integrated in the IEEE 802.15.4 TSCH Communication Protocol
by Grega Morano, Aleš Simončič, Teodora Kocevska, Tomaž Javornik and Andrej Hrovat
Sensors 2024, 24(12), 3925; https://doi.org/10.3390/s24123925 - 17 Jun 2024
Viewed by 769
Abstract
Accurate localization of devices within Internet of Things (IoT) networks is driven by the emergence of novel applications that require context awareness to improve operational efficiency, resource management, automation, and safety in industry and smart cities. With the Integrated Localization and Communication (ILAC) [...] Read more.
Accurate localization of devices within Internet of Things (IoT) networks is driven by the emergence of novel applications that require context awareness to improve operational efficiency, resource management, automation, and safety in industry and smart cities. With the Integrated Localization and Communication (ILAC) functionality, IoT devices can simultaneously exchange data and determine their position in space, resulting in maximized resource utilization with reduced deployment and operational costs. Localization capability in challenging scenarios, including harsh environments with complex geometry and obstacles, can be provided with robust, reliable, and energy-efficient communication protocols able to combat impairments caused by interference and multipath, such as the IEEE 802.15.4 Time-Slotted Channel Hopping (TSCH) protocol. This paper presents an enhancement of the TSCH protocol that integrates localization functionality along with communication, improving the protocol’s operational capabilities and setting a baseline for monitoring, automation, and interaction within IoT setups in physical environments. A novel approach is proposed to incorporate a hybrid localization by integrating Direction of Arrival (DoA) estimation and Multi-Carrier Phase Difference (MCPD) ranging methods for providing DoA and distance estimates with each transmitted packet. With the proposed enhancement, a single node can determine the location of its neighboring nodes without significantly affecting the reliability of communication and the efficiency of the network. The feasibility and effectiveness of the proposed approach are validated in a real scenario in an office building using low-cost proprietary devices, and the software incorporating the solution is provided. The experimental evaluation results show that a node positioned in the center of the room successfully estimates both the DoA and the distance to each neighboring node. The proposed hybrid localization algorithm demonstrates an accuracy of a few tens of centimeters in a two-dimensional space. Full article
(This article belongs to the Special Issue Integrated Localization and Communication: Advances and Challenges)
Show Figures

Figure 1

Figure 1
<p>Topology of the destination-oriented directed acyclic graph (DODAG) network with the proposed method of hybrid localization, where a single node referred to as the root/parent node can determine the location of its child nodes.</p>
Full article ">Figure 2
<p>Integration of a phase measurement process into the Time Slotted Channel Hopping (TSCH) timeslot.</p>
Full article ">Figure 3
<p>(<b>a</b>) Experiment setup. (<b>b</b>) Micro-controller equipped with AT86RF215 radio and RF switch. (<b>c</b>) Uniform circular antenna array with eight elements.</p>
Full article ">Figure 4
<p>Cumulative Distribution Function (CDF) for estimated location errors. (<b>a</b>) Comparison of CDF with a single measurement with 5 and 16 successive measurements. (<b>b</b>) CDF for each node’s location with 5 successive measurements.</p>
Full article ">Figure 5
<p>Actual (circles) and estimated (crosses) locations of devices in an office room based on five successive measurements as a final result.</p>
Full article ">
17 pages, 1140 KiB  
Article
Enhanced Beacons Dynamic Transmission over TSCH
by Erik Ortiz Guerra, Mario Martínez Morfa, Carlos Manuel García Algora, Hector Cruz-Enriquez, Kris Steenhaut and Samuel Montejo-Sánchez
Future Internet 2024, 16(6), 187; https://doi.org/10.3390/fi16060187 - 24 May 2024
Viewed by 2630
Abstract
Time slotted channel hopping (TSCH) has become the standard multichannel MAC protocol for low-power lossy networks. The procedure for associating nodes in a TSCH-based network is not included in the standard and has been defined in the minimal 6TiSCH configuration. Faster network formation [...] Read more.
Time slotted channel hopping (TSCH) has become the standard multichannel MAC protocol for low-power lossy networks. The procedure for associating nodes in a TSCH-based network is not included in the standard and has been defined in the minimal 6TiSCH configuration. Faster network formation ensures that data packet transmission can start sooner. This paper proposes a dynamic beacon transmission schedule over the TSCH mechanism that achieves a shorter network formation time than the default minimum 6TiSCH static schedule. A theoretical model is derived for the proposed mechanism to estimate the expected time for a node to get associated with the network. Simulation results obtained with different network topologies and channel conditions show that the proposed mechanism reduces the average association time and average power consumption during network formation compared to the default minimal 6TiSCH configuration. Full article
(This article belongs to the Special Issue Industrial Internet of Things (IIoT): Trends and Technologies)
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>Slotframe structure example with parameters: slotframe length 7 slots, <math display="inline"><semantics> <mrow> <mi>s</mi> <mi>l</mi> <mi>o</mi> <mi>t</mi> <mi>O</mi> <mi>f</mi> <mi>f</mi> <mi>s</mi> <mi>e</mi> <mi>t</mi> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>, and <math display="inline"><semantics> <mrow> <mi>m</mi> <mo>=</mo> <mn>16</mn> </mrow> </semantics></math> available channels.</p>
Full article ">Figure 2
<p>TSCH linear network association process.</p>
Full article ">Figure 3
<p>EBDT-TSCH with <math display="inline"><semantics> <mrow> <mi>α</mi> <mo>=</mo> <mn>0.5</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>ρ</mi> <mo>=</mo> <mn>0.75</mn> </mrow> </semantics></math>, and <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math> for 4 available network channels.</p>
Full article ">Figure 4
<p>Trade-off between <math display="inline"><semantics> <mi>α</mi> </semantics></math>, <math display="inline"><semantics> <mi>β</mi> </semantics></math>, and <math display="inline"><semantics> <mrow> <mi>E</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math> with <math display="inline"><semantics> <mrow> <mi>m</mi> <mo>=</mo> <mn>16</mn> </mrow> </semantics></math> available channels, <math display="inline"><semantics> <mrow> <mi>T</mi> <mi>e</mi> <mi>b</mi> <mo>=</mo> <mn>4</mn> <mi>s</mi> </mrow> </semantics></math>, and <math display="inline"><semantics> <mrow> <mi>ρ</mi> <mo>=</mo> <mn>0.75</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 5
<p>Probability of getting associated at the intensive phase for different network available channels, represented by the symbol “x” in discrete values of <math display="inline"><semantics> <mi>β</mi> </semantics></math>.</p>
Full article ">Figure 6
<p>Pair synchronizer–join-seeker network scenario. Node 1 is the network coordinator and node 2 is a join-seeker. The green circle depicts the transmission range of node 1, while the grey circle depicts the interference range.</p>
Full article ">Figure 7
<p>EBDT-TSCH association time. Pair synchronizer–join-seeker scenario.</p>
Full article ">Figure 8
<p>Linear network scenario. The nodes are on a line and each node can only communicate with its adjacent nodes. Node 1 is the network coordinator and nodes 2–4 are join-seekers. The green circle depicts the transmission range of node 1, while the grey circle depicts the interference range.</p>
Full article ">Figure 9
<p>Association time in a linear network topology.</p>
Full article ">Figure 10
<p>Average energy consumption of the linear network scenario until all nodes get associated.</p>
Full article ">Figure 11
<p>Simulation scenario with ring topology. Node 1 is the network coordinator and nodes 2–11 are join-seekers. The green circle depicts the transmission range of node 1, while the grey circle depicts the interference range.</p>
Full article ">Figure 12
<p>Network formation time in a ring topology for different link quality values.</p>
Full article ">Figure 13
<p>Average energy consumption of the network in ring topology.</p>
Full article ">
35 pages, 1977 KiB  
Article
3MSF: A Multi-Modal Adaptation of the 6TiSCH Minimal Scheduling Function for the Industrial IoT
by Robbe Elsas, Dries Van Leemput, Jeroen Hoebeke and Eli De Poorter
Sensors 2024, 24(8), 2414; https://doi.org/10.3390/s24082414 - 10 Apr 2024
Viewed by 1051
Abstract
Although wireless devices continuously gain communication capabilities, even state-of-the-art Industrial Internet of Things (IIoT) architectures, such as Internet Protocol version 6 over the Time-Slotted Channel Hopping (TSCH) mode of IEEE 802.15.4 (6TiSCH), continue to use network-wide, fixed link configurations. This presents a missed [...] Read more.
Although wireless devices continuously gain communication capabilities, even state-of-the-art Industrial Internet of Things (IIoT) architectures, such as Internet Protocol version 6 over the Time-Slotted Channel Hopping (TSCH) mode of IEEE 802.15.4 (6TiSCH), continue to use network-wide, fixed link configurations. This presents a missed opportunity to (1) forego the need for rigorous manual setup of new deployments; and (2) provide full coverage of particularly heterogeneous and/or dynamic industrial sites. As such, we devised the Multi-Modal Minimal Scheduling Function (3MSF) for the TSCH link layer, which, combined with previous work on the routing layer, results in a 6TiSCH architecture able to dynamically exploit modern multi-modal hardware on a per-link basis through variable-duration timeslots, simultaneous transmission, and routing metric normalization. This paper describes, in great detail, its design and discusses the rationale behind every choice made. Finally, we evaluate three basic scenarios through simulations, showcasing both the functionality and flexibility of our 6TiSCH implementation. Full article
(This article belongs to the Section Internet of Things)
Show Figures

Figure 1

Figure 1
<p>Example of a common implementation of the Internet Engineering Task Force (IETF) Internet Protocol version 6 (IPv6) over the Time-Slotted Channel Hopping (TSCH) mode of IEEE 802.15.4 (6TiSCH) protocol stack. Network-layer functionality is indicated in red, whereas link-layer functionality is marked blue. Reprinted from [<a href="#B1-sensors-24-02414" class="html-bibr">1</a>] with permission from the authors.</p>
Full article ">Figure 2
<p>Connection between the three Routing Protocol for Low-power and Lossy Networks (LLNs) (RPL) neighbor sets maintained by each non-root node. The formation of these sets is prescribed by an RPL Objective Function (OF). Reprinted from [<a href="#B8-sensors-24-02414" class="html-bibr">8</a>] with permission from the authors.</p>
Full article ">Figure 3
<p>Abstract representation of multi-mode TSCH slotframes using fixed- or variable-duration timeslots, respectively, in the time dimension only. Each coloured box corresponds to one (virtual) timeslot, with a dedicated colour associated with each communication mode (each having a specific data rate). Note that there are other ways to aggregate consecutive transmissions within a fixed-duration timeslot. Reprinted from [<a href="#B1-sensors-24-02414" class="html-bibr">1</a>] with permission from the authors.</p>
Full article ">Figure 4
<p>Format of a 6TiSCH Operation Sublayer (6top) Protocol (6P) <tt>ADD</tt> request. The three Most Significant Bits (MSBs) of the <tt>CellOptions</tt> field indicate the communication mode to use in the supercells/subcells proposed by the <tt>CellList</tt>.</p>
Full article ">Figure 5
<p>Example of the slotframe structure of the Multi-Modal Minimal Scheduling Function (3MSF). As 3MSF is a distributed scheduler, the contents of the slotframes shown constitute the schedule as seen by a single node (i.e., #2) in a small example network. Black arrows indicate child–parent relationships.</p>
Full article ">Figure 6
<p>Timeslot timing intervals assuming acknowledged transmission. A unique set of timing intervals is associated with each supercell length. Any interface-mode that wishes to use supercells of a given length must be able to transmit a unicast packet and receive a corresponding acknowledgement using the corresponding timing intervals.</p>
Full article ">Figure 7
<p>Format of a TSCH IETF Informational Element (IE) carrying a Timing sub-IE. Note that we used an IETF IE <tt>Subtype ID</tt> [<a href="#B12-sensors-24-02414" class="html-bibr">12</a>] (Section 4) in the experimental usage range. The Timing sub-IE contains a variable-length <tt>FactorList</tt>, where each entry must follow a specific format.</p>
Full article ">Figure 8
<p>Flowchart of events related to the selection of the next link a node must wake up for when it has either just joined the TSCH network by synchronizing to an Enhanced Beacon (EB) or when operations on the currently active link have concluded. In this flowchart, <math display="inline"><semantics> <mrow> <mi>S</mi> <msub> <mi>C</mi> <mrow> <mi>c</mi> <mi>u</mi> <mi>r</mi> <mi>r</mi> </mrow> </msub> </mrow> </semantics></math> is the currently active supercell, <math display="inline"><semantics> <mrow> <mi>S</mi> <msub> <mi>C</mi> <mrow> <mi>j</mi> <mi>o</mi> <mi>i</mi> <mi>n</mi> </mrow> </msub> </mrow> </semantics></math> is the minimal supercell in which the node first synchronized to an EB and joined the TSCH network, <math display="inline"><semantics> <mrow> <mi>S</mi> <msub> <mi>C</mi> <mrow> <mi>n</mi> <mi>e</mi> <mi>x</mi> <mi>t</mi> </mrow> </msub> </mrow> </semantics></math> is the supercell being evaluated against the Current Best Supercell (CBS) during link selection, <math display="inline"><semantics> <mrow> <mi>S</mi> <msub> <mi>F</mi> <mrow> <mi>n</mi> <mi>e</mi> <mi>x</mi> <mi>t</mi> </mrow> </msub> </mrow> </semantics></math> is the slotframe to which <math display="inline"><semantics> <mrow> <mi>S</mi> <msub> <mi>C</mi> <mrow> <mi>n</mi> <mi>e</mi> <mi>x</mi> <mi>t</mi> </mrow> </msub> </mrow> </semantics></math> belongs, and <math display="inline"><semantics> <mrow> <mi>A</mi> <mi>S</mi> <msub> <mi>N</mi> <mrow> <mi>c</mi> <mi>u</mi> <mi>r</mi> <mi>r</mi> </mrow> </msub> </mrow> </semantics></math> is the Absolute Slot Number (ASN) of <math display="inline"><semantics> <mrow> <mi>S</mi> <msub> <mi>C</mi> <mrow> <mi>c</mi> <mi>u</mi> <mi>r</mi> <mi>r</mi> </mrow> </msub> </mrow> </semantics></math>’s first subcell.</p>
Full article ">Figure 9
<p>Example of a successful 6P <tt>ADD</tt> transaction used by 3MSF, based on the fictitious setup depicted in <a href="#sensors-24-02414-f005" class="html-fig">Figure 5</a>. Node #2 sends an <tt>ADD</tt> request to its preferred parent #1, providing it with a <tt>CellList</tt> containing two subcell groupings. From these groupings, node #1 picks two supercells in the negotiated slotframe following the request’s <tt>NumCells</tt> value and the supercell length corresponding to the TSCH mode specified by node #2 in the 3 MSBs of the <tt>CellOptions</tt>.</p>
Full article ">Figure 10
<p>Example of a successful 6P <tt>RELOCATE</tt> transaction used by 3MSF, based on the fictitious setup depicted in <a href="#sensors-24-02414-f005" class="html-fig">Figure 5</a>.</p>
Full article ">Figure 11
<p>Example of a successful 6P <tt>SIGNAL</tt> transaction used by 3MSF during shadow operations, based on the fictitious setup depicted in <a href="#sensors-24-02414-f005" class="html-fig">Figure 5</a>. Node #2 sends a <tt>SIGNAL</tt> request to its preferred parent #1, indicating that the supercells in the shadow slotframe between #2 and #1 (previously added through shadow <tt>ADD</tt> transactions) are ready to replace the existing negotiated supercells between #2 and #1. The successful completion of this <tt>SIGNAL</tt> transaction marks the end of shadow operations.</p>
Full article ">Figure 12
<p>Flowchart of events when the inferred metric update process is called for a given interface-mode of a given neighbor. <math display="inline"><semantics> <msub> <mi>C</mi> <mrow> <mi>t</mi> <mi>x</mi> </mrow> </msub> </semantics></math> and <math display="inline"><semantics> <msub> <mi>C</mi> <mrow> <mi>a</mi> <mi>c</mi> <mi>k</mi> </mrow> </msub> </semantics></math> are the transmit (Tx) and acknowledgement (ACK) counters, <math display="inline"><semantics> <msub> <mi>C</mi> <mrow> <mi>t</mi> <mi>x</mi> <mo>;</mo> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> </msub> </semantics></math> is the Tx counter’s maximum value, <math display="inline"><semantics> <msub> <mi>C</mi> <mrow> <mi>n</mi> <mi>o</mi> <mi>a</mi> <mi>c</mi> <mi>k</mi> </mrow> </msub> </semantics></math> counts consecutive non-ACKed Tx attempts, <math display="inline"><semantics> <mrow> <mi>E</mi> <mi>T</mi> <msub> <mi>X</mi> <mrow> <mi>i</mi> <mi>n</mi> <mi>i</mi> <mi>t</mi> </mrow> </msub> </mrow> </semantics></math> is a constant used to initialize the inferred metric when receiving on a newly discovered interface-mode, <math display="inline"><semantics> <mrow> <mi>E</mi> <mi>T</mi> <msub> <mi>X</mi> <mrow> <mi>s</mi> <mi>t</mi> <mi>o</mi> <mi>r</mi> </mrow> </msub> </mrow> </semantics></math> is the actual inferred metric, and <math display="inline"><semantics> <mrow> <mi>E</mi> <mi>T</mi> <msub> <mi>X</mi> <mrow> <mi>n</mi> <mi>o</mi> <mi>a</mi> <mi>c</mi> <mi>k</mi> </mrow> </msub> </mrow> </semantics></math> is a large constant, which must be greater than the inferred metric threshold. A separate set of these variables is maintained for each interface-mode of each neighbor.</p>
Full article ">Figure 13
<p>Updated flowchart of events involved in Contiki-NG probing. The idea is to perform a minimal number of Tx attempts on each interface-mode of a probing target before the probing of said target completes, such that we can reasonably assume all its inferred metrics are fresh upon completion while incurring a minimal amount of overhead.</p>
Full article ">Figure 14
<p>Setup of the first scenario involving two nodes, i.e., a root (#1) and a non-root node (#2). The black arrow indicates a child–parent relationship. A single grid square measures 10 m × 10 m.</p>
Full article ">Figure 15
<p>Characterization of the “link” between nodes #2 and #1 (i.e., the root), as depicted in <a href="#sensors-24-02414-f014" class="html-fig">Figure 14</a>, for a single simulation run. The first graph shows the evolution of the inferred metrics for each interface-mode over time. The second graph depicts the time intervals in which a given interface-mode was preferred. The third graph depicts the same but for the frozen interface-mode. The fourth and final graph shows the evolution of the normalized metric over time. In each graph, the pink highlighted area shows the time period during which all sub-GHz interface-modes were blocked.</p>
Full article ">Figure 16
<p>Time to non-blocked interface-mode from the start of blocking all modes of the 868 megahertz (MHz) interface at once (i.e., interface two) across all simulations in this scenario. The rare cases where a 2.4 GHz interface-mode becomes frozen first but the absolute difference in inferred metric never exceeds the hysteresis threshold explain the 0 values.</p>
Full article ">Figure 17
<p>Setup of the second scenario involving three nodes, i.e., one root (#1) and two non-root nodes (#2, and #3). The black arrows indicate (the intended) child–parent relationships. A single grid square measures 10 m × 10 m.</p>
Full article ">Figure 18
<p>Cumulative number of used transmit links across all simulations of this scenario (represented as a fraction) by slotframe. Only Tx links of directed node pairs in which the destination could potentially be the preferred parent of the source are displayed.</p>
Full article ">Figure 19
<p>Setup of the third scenario involving four nodes, i.e., one root (#1) and three non-root nodes (#2, #3, and #4). The black arrows indicate child–parent relationships in a steady state. A single grid square measures 10 m × 10 m.</p>
Full article ">Figure 20
<p>Number of times node #4 either switched preferred parent from #2 to #3 or only switched the frozen interface-mode towards #2 instead (represented as a fraction of the total number of simulations), by configuration. In the first configuration, all nodes possessed only the sub-GHz interface-modes. In the second configuration, all nodes possessed only one mode per interface, i.e., (2, 1) and (1, 1). In the third configuration, each node possessed all four interface-modes.</p>
Full article ">
24 pages, 800 KiB  
Article
Comparative Analysis of Time-Slotted Channel Hopping Schedule Optimization Using Priority-Based Customized Differential Evolution Algorithm in Heterogeneous IoT Networks
by Aida Vatankhah and Ramiro Liscano
Sensors 2024, 24(4), 1085; https://doi.org/10.3390/s24041085 - 7 Feb 2024
Cited by 1 | Viewed by 1159
Abstract
The Time-Slotted Channel Hopping (TSCH) protocol is known for its suitability in highly reliable applications within industrial wireless sensor networks. One of the most significant challenges in TSCH is determining a schedule with a minimal slotframe size that can meet the required throughput [...] Read more.
The Time-Slotted Channel Hopping (TSCH) protocol is known for its suitability in highly reliable applications within industrial wireless sensor networks. One of the most significant challenges in TSCH is determining a schedule with a minimal slotframe size that can meet the required throughput for a heterogeneous network. We proposed a Priority-based Customized Differential Evolution (PCDE) algorithm based on the determination of a collision- and interference-free transmission graph. Our schedule can encompass sensors with different data rates in the given slotframe size. This study presents a comprehensive performance evaluation of our proposed algorithm and compares the results to the Traffic-Aware Scheduling Algorithm (TASA). Sufficient simulations were performed to evaluate different metrics such as the slotframe size, throughput, delay, time complexity, and Packet Delivery Ratio (PDR) to prove that our approach achieves a significant result compared with this method. Full article
Show Figures

Figure 1

Figure 1
<p>Priority-based Customized Differential Evolution Algorithm flowchart.</p>
Full article ">Figure 2
<p>(<b>a</b>) Randomly generated topology with 10 nodes. (<b>b</b>) Designated feasible routes for Spanning Tree in Mesh graph. (<b>c</b>) Spanning Tree for 10 nodes.</p>
Full article ">Figure 3
<p>Tree topology example with root and three sensor nodes.</p>
Full article ">Figure 4
<p>(<b>a</b>) Union of collision and interference graph. (<b>b</b>) FreeSet.</p>
Full article ">Figure 5
<p>Cosimulation: sequence diagram of PCDE optimization algorithm and TSCH-SIM.</p>
Full article ">Figure 6
<p>Trend of number of SATISFIED nodes during PCDE optimization process for 10 nodes.</p>
Full article ">Figure 7
<p>Slotframe size for Local Iteration = 20 and 50 with (<b>a</b>) 10, (<b>b</b>) 20, and (<b>c</b>) 50 nodes.</p>
Full article ">Figure 8
<p>Delay for different tree depths and packet rates in networks with (<b>b</b>) 10, (<b>b</b>) 20, and (<b>c</b>) 50 nodes.</p>
Full article ">Figure 9
<p>Delay comparison between PCDE and TASA.</p>
Full article ">Figure 10
<p>Packet Delivery Ratio comparison between PCDE and TASA.</p>
Full article ">Figure 11
<p>Throughput comparison between PCDE and TASA.</p>
Full article ">Figure 12
<p>Average time complexity for (<b>a</b>) 10, (<b>b</b>) 20, and (<b>c</b>) 50 nodes in various packet rates.</p>
Full article ">Figure 13
<p>Slotframe size for different tree depths and packet rates in networks with (<b>a</b>) 10, (<b>b</b>) 20, and (<b>c</b>) 50 Nodes.</p>
Full article ">Figure 14
<p>Slotframe size comparison between PCDE and TASA.</p>
Full article ">
9 pages, 586 KiB  
Systematic Review
Hyperacusis: Focus on Gender Differences: A Systematic Review
by Lucia Belen Musumano, Stavros Hatzopoulos, Virginia Fancello, Chiara Bianchini, Tiziana Bellini, Stefano Pelucchi, Piotr Henryk Skarżyński, Magdalena B. Skarżyńska and Andrea Ciorba
Life 2023, 13(10), 2092; https://doi.org/10.3390/life13102092 - 21 Oct 2023
Cited by 1 | Viewed by 1717
Abstract
Background: While gender differences of several diseases have been already described in the literature, studies in the area of hyperacusis are still scant. Despite the fact that hyperacusis is a condition that severely affects the patient’s quality of life, it is not well [...] Read more.
Background: While gender differences of several diseases have been already described in the literature, studies in the area of hyperacusis are still scant. Despite the fact that hyperacusis is a condition that severely affects the patient’s quality of life, it is not well investigated; a comprehensive understanding of its features, eventually including gender differences, could be a valuable asset in developing clinical intervention strategies. Aim: To evaluate gender differences among subjects affected by hyperacusis. Methods: A literature search was conducted focused on adult patients presenting hyperacusis, using the MedLine bibliographic database. Relevant peer-reviewed studies, published in the last 20 years, were sought. A total of 259 papers have been identified, but only 4 met the inclusion criteria. The review was performed according to the Preferred Reporting Items for Systematic Reviews and Meta-Analysis (PRISMA) guidelines. Results: The four selected papers included data from 604 patients; of these, 282 subjects resulted as affected by hyperacusis (125 females and 157 males). Questionnaires for analyzing factors affecting the attentional, social and emotional variance of hyperacusis (such as VAS, THI, TSCH, MASH) were administered to all included subjects. The data suggest that there are no hyperacusis gender-specific differences in the assessed population samples. Conclusions: The literature data suggest that males and females exhibit a similar level of hyperacusis. However, in light of the subjective nature of this condition, the eventual set up of further tests to assess hyperacusis features could be very helpful in the near future. Full article
(This article belongs to the Special Issue Gender Medicine: Are Gender Differences Important for Medicine?)
Show Figures

Figure 1

Figure 1
<p>Flow diagram of the literature search, according to the PRISMA criteria (<a href="http://www.prisma-statement.org/" target="_blank">http://www.prisma-statement.org/</a>, accessed on 1 April 2023), with the various steps in the manuscript selection process. The initially identified 259 manuscripts were reduced to 4 after the application of the selection criteria.</p>
Full article ">
27 pages, 19654 KiB  
Article
Application-Aware Scheduling for IEEE 802.15.4e Time-Slotted Channel Hopping Using Software-Defined Wireless Sensor Network Slicing
by Tarek Sayjari, Regina Melo Silveira and Cintia Borges Margi
Sensors 2023, 23(16), 7143; https://doi.org/10.3390/s23167143 - 12 Aug 2023
Cited by 1 | Viewed by 1282
Abstract
Given the improvements to network flexibility and programmability, software-defined wireless sensor networks (SDWSNs) have been paired with IEEE 802.15.4e time-slotted channel hopping (TSCH) to increase network efficiency through slicing. Nonetheless, ensuring the quality of service (QoS) level in a scalable SDWSN remains a [...] Read more.
Given the improvements to network flexibility and programmability, software-defined wireless sensor networks (SDWSNs) have been paired with IEEE 802.15.4e time-slotted channel hopping (TSCH) to increase network efficiency through slicing. Nonetheless, ensuring the quality of service (QoS) level in a scalable SDWSN remains a significant difficulty. To solve this issue, we introduce the application-aware (AA) scheduling approach, which isolates different traffic types and adapts to QoS requirements dynamically. To the best of our knowledge, this approach is the first to support network scalability using shared timeslots without the use of additional hardware while maintaining the application’s QoS level. The AA approach is deeply evaluated compared with both the application traffic isolation (ATI) approach and the application’s QoS requirements using the IT-SDN framework and by varying the number of nodes up to 225. The evaluation process took into account up to four applications with varying QoS requirements in terms of delivery rate and delay. In comparison with the ATI approach, the proposed approach enhanced the delivery rate by up to 28% and decreased the delay by up to 57%. Furthermore, even with four applications running concurrently, the AA approach proved capable of meeting a 92% delivery rate requirement for up to 225 nodes and a 900 ms delay requirement for up to 144 nodes. Full article
(This article belongs to the Section Communications)
Show Figures

Figure 1

Figure 1
<p>Application-aware (AA) IT-SDN system.</p>
Full article ">Figure 2
<p>Sch 0 scheduling.</p>
Full article ">Figure 3
<p>Sequence of the system operations.</p>
Full article ">Figure 4
<p>Scheduling calculation procedure.</p>
Full article ">Figure 5
<p>The new calculated scheduling (three-application case).</p>
Full article ">Figure 6
<p>Simulation scenarios for ATI and AA approaches.</p>
Full article ">Figure 7
<p>Comparison between AA and ATI approaches in the data plane (four applications’ case).</p>
Full article ">Figure 8
<p>Comparison between AA and ATI approaches in the control plane (four applications’ case).</p>
Full article ">Figure 9
<p>Data delivery rate, changing the MCR value.</p>
Full article ">Figure 10
<p>Data delay, changing the MCR value.</p>
Full article ">Figure 11
<p>Control overhead, changing the MCR value.</p>
Full article ">Figure 12
<p>Energy consumption, changing the MCR value.</p>
Full article ">Figure 13
<p>Control delivery rate, changing the MCR value.</p>
Full article ">Figure 14
<p>Control delay, changing the MCR value.</p>
Full article ">Figure 15
<p>Data delivery rate, changing the DTR value.</p>
Full article ">Figure 16
<p>Data delay, changing the DTR value.</p>
Full article ">Figure 17
<p>Control overhead, changing the DTR value.</p>
Full article ">Figure 18
<p>Energy consumption, changing the DTR value.</p>
Full article ">Figure 19
<p>Control delivery rate, changing the DTR value.</p>
Full article ">Figure 20
<p>Control delay, changing the DTR value.</p>
Full article ">
12 pages, 3326 KiB  
Article
Comparative Physiological Analysis of Lignification, Anthocyanin Metabolism and Correlated Gene Expression in Red Toona sinensis Buds during Cold Storage
by Qian Zhao, Xiu-Lai Zhong, Xia Cai, Shun-Hua Zhu, Ping-Hong Meng, Jian Zhang and Guo-Fei Tan
Agronomy 2023, 13(1), 119; https://doi.org/10.3390/agronomy13010119 - 30 Dec 2022
Cited by 4 | Viewed by 1674
Abstract
The characteristics of anthocyanin and lignin are important parameters in evaluating the quality of red Toona sinensis buds. Red T. sinensis buds are prone to senescence during postharvest storage, which subsequently affects their quality and sales. However, the mechanism of senescence in red [...] Read more.
The characteristics of anthocyanin and lignin are important parameters in evaluating the quality of red Toona sinensis buds. Red T. sinensis buds are prone to senescence during postharvest storage, which subsequently affects their quality and sales. However, the mechanism of senescence in red T. sinensis buds under low-temperature conditions remains unclear. In this study, red T. sinensis buds were stored at 4 °C, and their anthocyanin and lignin contents as well as the enzyme activities of PAL (phenylalanine ammonia lyase), 4CL (4-coumarate-CoA ligase), CAD (cinnamyl alcohol dehydrogenase) and POD (peroxidase) were determined at 0, 1, 2 and 3 d after handing. Meanwhile, the cellular structure of postharvest red T. sinensis buds was observed by microscopy. The relative expression of lignin-related and anthocyanin-related genes was analyzed using qRT-PCR. The results show that the anthocyanin content of the leaves was higher than that of the petioles. After 3 d of storage, the anthocyanin content of the leaves was 4.66 times that of the petioles. Moreover, the lignin content of the red T. sinensis buds gradually increased. Compared with 0 d, the lignin content of the leaves and petioles increased by 331.8 and 94.14 mg·g−1, respectively. The enzyme activities of PAL, 4CL, CAD and POD increased during cold storage. The intercellular space and the arrangement of the palisade tissue and sponge tissue in the mesophyll of red T. sinensis buds became smaller and closer, respectively. The secondary cell wall of xylem cells thickened, the number of xylem cells increased, and the arrangement number of the xylem cells became closed in the leaf vein and petioles during red T. sinensis bud storage. The expression levels of anthocyanin-related (Except for TsCHS and TsANS) and lignin-related genes increased during red T. sinensis bud storage and are highly consistent with the accumulation patterns of anthocyanins and lignin. This study may serve as a reference for exploring the molecular mechanisms of senescence, regulating the quality and cultivating new varieties of red T. sinensis buds that have low lignin content but high anthocyanin content after harvest. Full article
Show Figures

Figure 1

Figure 1
<p>Color changes and anthocyanins, lignin and chlorophyll content of red <span class="html-italic">T. sinensis</span> buds during storage. (<b>A-I</b>): Stored red <span class="html-italic">T. sinensis</span> buds for 0 d; (<b>A-II</b>): Stored red <span class="html-italic">T. sinensis</span> buds for 1 d; (<b>A-III</b>): Stored red <span class="html-italic">T. sinensis</span> buds for 2 d; (<b>A-IV</b>): Stored red <span class="html-italic">T. sinensis</span> buds for 3 d; (<b>B-I</b>): Lignin content of red <span class="html-italic">T. sinensis</span> buds during storage; (<b>B-II</b>): Anthocyanin content of red <span class="html-italic">T. sinensis</span> buds during storage. Note: The white arrows in the figure represent the sampling site for observing the paraffin section. Different lowercase letters on the column indicates significant differences among different treatments (<span class="html-italic">p</span> &lt; 0.05).</p>
Full article ">Figure 2
<p>Analysis of enzyme activity of <span class="html-italic">T. sinensis</span> buds during storage in lignin metabolic pathways. (<b>A</b>): The PAL activity of red <span class="html-italic">T. sinensis</span> buds during storage; (<b>B</b>): The 4CL activity of red <span class="html-italic">T. sinensis</span> buds during storage; (<b>C</b>): The CAD activity of red <span class="html-italic">T. sinensis</span> buds during storage; (<b>D</b>): The POD activity of red <span class="html-italic">T. sinensis</span> buds during storage. Different lowercase letters on the column indicates significant differences among different treatments (<span class="html-italic">p</span> &lt; 0.05).</p>
Full article ">Figure 3
<p>Mesophyll cell, leaf vein, petiole structure of red <span class="html-italic">T. sinensis</span> buds during storage. (<b>A-I</b>): Mesophyll cell structure of red <span class="html-italic">T. sinensis</span> budsstored for 0 d; (<b>A-II</b>): Mesophyll cell structure of red <span class="html-italic">T. sinensis</span> buds stored for 1 d; (<b>A-III</b>): Mesophyll cell structure of red <span class="html-italic">T. sinensis</span> buds stored for 2 d; (<b>A-IV</b>): Mesophyll cell structure of red <span class="html-italic">T. sinensis</span> buds stored for 3 d; (<b>B-I</b>): Leaf vein structure of red <span class="html-italic">T. sinensis</span> budsstored for 0 d; (<b>B-II</b>): Leaf vein structure of red <span class="html-italic">T. sinensis</span> budsstored for 1 d; (<b>B-III</b>): Leaf vein structure of red <span class="html-italic">T. sinensis</span> budsstored for 2 d; (<b>B-IV</b>): Leaf vein structure of red <span class="html-italic">T. sinensis</span> budsstored for 3 d; (<b>C-I</b>): Petiole structure of red <span class="html-italic">T. sinensis</span> budsstored for 0 d; (<b>C-II</b>): Petiole structure of red <span class="html-italic">T. sinensis</span> budsstored for 1 d; (<b>C-III</b>): Petiole structure of red <span class="html-italic">T. sinensis</span> budsstored for 2 d; (<b>C-IV</b>): Petiole structure of red <span class="html-italic">T. sinensis</span> budsstored for 3 d. Epidermis (Ep), palisade tissue (Pt), sponge tissue (St), xylem (X) were marked in figure.</p>
Full article ">Figure 4
<p>Relative expression level of lignin-related genes of red <span class="html-italic">T. sinensis</span> buds during storage. (<b>A</b>): The expression level of <span class="html-italic">TsPAL</span> in red <span class="html-italic">T. sinensis</span> during storage; (<b>B</b>): The expression level of <span class="html-italic">TsC4H</span> in red <span class="html-italic">T. sinensis</span> during storage; (<b>C</b>): The expression level of <span class="html-italic">Ts4CL</span> in red <span class="html-italic">T. sinensis</span> during storage; (<b>D</b>): The expression level of <span class="html-italic">TsCCR</span> in red <span class="html-italic">T. sinensis</span> during storage; (<b>E</b>): The expression level of <span class="html-italic">TsCAD</span> in red <span class="html-italic">T. sinensis</span> during storage; (<b>F</b>): The expression level of <span class="html-italic">TsHCT</span> in red <span class="html-italic">T. sinensis</span> during storage; (<b>G</b>): The expression level of <span class="html-italic">TsC3’H</span> in red <span class="html-italic">T. sinensis</span> during storage; (<b>H</b>): The expression level of <span class="html-italic">TsCOMT</span> in red <span class="html-italic">T. sinensis</span> during storage; (<b>I</b>): The expression level of <span class="html-italic">TsF5H</span> in red <span class="html-italic">T. sinensis</span> during storage; (<b>J</b>): The expression level of <span class="html-italic">TsCCoAOMT</span> in red <span class="html-italic">T. sinensis</span> during storage; (<b>K</b>): The expression level of <span class="html-italic">TsLAC</span> in red <span class="html-italic">T. sinensis</span> during storage. Different lowercase letters on the column indicates significant differences among different treatments (<span class="html-italic">p</span> &lt; 0.05).</p>
Full article ">Figure 5
<p>Relative expression level of anthocyanins-related genes of red <span class="html-italic">T. sinensis</span> buds during storage. (<b>A</b>): The expression level of <span class="html-italic">TsCHS</span> in red <span class="html-italic">T. sinensis</span> during storage; (<b>B</b>): The expression level of <span class="html-italic">TsCHI</span> in red <span class="html-italic">T. sinensis</span> during storage; (<b>C</b>): The expression level of <span class="html-italic">TsF3H</span> in red <span class="html-italic">T. sinensis</span> during storage; (<b>D</b>): The expression level of <span class="html-italic">TsF3′5′H</span> in red <span class="html-italic">T. sinensis</span> during storage; (<b>E</b>): The expression level of <span class="html-italic">TsDFR</span> in red <span class="html-italic">T. sinensis</span> during storage; (<b>F</b>): The expression level of <span class="html-italic">TsANS</span> in red <span class="html-italic">T. sinensis</span> during storage; (<b>G</b>): The expression level of <span class="html-italic">Ts3GT</span> in red <span class="html-italic">T. sinensis</span> during storage. Different lowercase letters on the column indicates significant differences among different treatments (<span class="html-italic">p</span> &lt; 0.05).</p>
Full article ">Figure 6
<p>A model to elucidate the senescence mechanism involved in lignin and anthocyanin metabolism of red <span class="html-italic">T. sinensis</span> buds during storage. +: marks the promotion of senescence.</p>
Full article ">
24 pages, 2564 KiB  
Article
Traffic Aware Scheduler for Time-Slotted Channel-Hopping-Based IPv6 Wireless Sensor Networks
by Diana Deac, Eden Teshome, Roald Van Glabbeek, Virgil Dobrota, An Braeken and Kris Steenhaut
Sensors 2022, 22(17), 6397; https://doi.org/10.3390/s22176397 - 25 Aug 2022
Cited by 7 | Viewed by 1971
Abstract
Wireless sensor networks (WSNs) are becoming increasingly prevalent in numerous fields. Industrial applications and natural-disaster-detection systems need fast and reliable data transmission, and in several cases, they need to be able to cope with changing traffic conditions. Thus, time-slotted channel hopping (TSCH) offers [...] Read more.
Wireless sensor networks (WSNs) are becoming increasingly prevalent in numerous fields. Industrial applications and natural-disaster-detection systems need fast and reliable data transmission, and in several cases, they need to be able to cope with changing traffic conditions. Thus, time-slotted channel hopping (TSCH) offers high reliability and efficient power management at the medium access control (MAC) level; TSCH considers two dimensions, time and frequency when allocating communication resources. However, the scheduler, which decides where in time and frequency these communication resources are allotted, is not part of the standard. Orchestra has been proposed as a scheduler which allocates the communication resources based on information collected through the IPv6 routing protocol for low-power and lossy networks (RPL). Orchestra is a very elegant solution, but does not adapt to high traffic. This research aims to build an Orchestra-based scheduler for applications with unpredictable traffic bursts. The implemented scheduler allocates resources based on traffic congestion measured for the children of the root and RPL subtree size of the same nodes. The performance analysis of the proposed scheduler shows lower latency and higher packet delivery ratio (PDR) compared to Orchestra during bursts, with negligible impact outside them. Full article
Show Figures

Figure 1

Figure 1
<p>Example of routing table created by the IPv6 routing protocol for low-power and lossy networks (RPL) in storing mode for node 3.</p>
Full article ">Figure 2
<p>Example of scheduled Rx and Tx cells for nodes 1 to 6 in the time/channel offset space. The Rx cells are highlighted with red and the Tx cells with green. (<b>a</b>) Receiver-based shared (RBS) cell allocation. (<b>b</b>) Sender-based shared (SBS) cell allocation.</p>
Full article ">Figure 3
<p>Overview of discussed schedulers.</p>
Full article ">Figure 4
<p>Initialization phase: allocation of Rx and Tx slots. (<b>a</b>) Initialization phase step 1: Rx slots are allocated for each node. (<b>b</b>) Initialization phase step 2: Tx slots are allocated for children to communicate with parent. (<b>c</b>) Initialization phase step 3: Tx slots are allocated for the parent to communicate with children.</p>
Full article ">Figure 5
<p>The structure of the DAO message and the RPL target option. The fields used in our implementation are marked. (<b>a</b>) Destination advertisement object (DAO) message structure. The <span class="html-italic">reserved</span> field is used for inserting the subtree size. (<b>b</b>) The structure of the RPL target option.</p>
Full article ">Figure 6
<p>Example of allocation of Rx and Tx slots with the new scheduler. (<b>a</b>) The placement of nodes results in a topology with 3 children for the root. Each child has a different subtree size. (<b>b</b>) Allocation of Tx and Rx slots based on the topology in (<b>a</b>).</p>
Full article ">Figure 7
<p>Summary of the allocation and deallocation phases for the root and its children. (<b>a</b>) The algorithm for allocating and deallocating Tx slots for the root’s children. (<b>b</b>) The algorithm for allocating and deallocating Rx slots for the root.</p>
Full article ">Figure 8
<p>Possible placements of nodes. The green area represents the transmission and interference ranges, both equal to 50 m. The size of the grid is 200 m × 200 m. (<b>a</b>) Placement 1: the sink node is situated at the top of the grid. (<b>b</b>) Placement 2: the sink node is situated in the middle of the grid.</p>
Full article ">Figure 9
<p>We observe that when it comes to average packet delivery ratio (PDR), the new scheduler performs better than Orchestra, in high traffic situations.</p>
Full article ">Figure 10
<p>We observe that when it comes to average number of packets dropped from queues, the new scheduler performs better than Orchestra, in high traffic situation.</p>
Full article ">Figure 11
<p>We observe that when it comes to average delay, the new scheduler performs better than Orchestra, in high traffic situation.</p>
Full article ">Figure 12
<p>Average PDR for each sender node in low and high traffic situations. (<b>a</b>) We observe that in normal traffic situation, the average PDR is high for both schedulers. (<b>b</b>) We observe that in a high traffic situation for RBS Orchestra, the average PDR is lowest for the root’s children, being nodes 2–5.</p>
Full article ">Figure 13
<p>Average delay for each sender node in low and high traffic situations. (<b>a</b>) We observe that in normal traffic situation, the average delay is comparable for the two schedulers. (<b>b</b>) We observe that in high traffic situation for RBS Orchestra the average delay is highest for the root’s children, being nodes 2–5.</p>
Full article ">Figure 14
<p>We observe that when it comes to average radio duty cycle, the new scheduler performs better than Orchestra in a high-traffic situation.</p>
Full article ">Figure 15
<p>We observe that when it comes to stability, the new scheduler performs better than Orchestra, in high traffic situations.</p>
Full article ">Figure 16
<p>Comparison between OSCAR and the new scheduler considering different topology sizes. (<b>a</b>) We observe that the new scheduler has a higher PDR when the number of nodes is less than 100. (<b>b</b>) We observe that the new scheduler has a lower delay when the number of nodes is less than 80. (<b>c</b>) We observe that the new scheduler has a higher radio duty cycle.</p>
Full article ">Figure 16 Cont.
<p>Comparison between OSCAR and the new scheduler considering different topology sizes. (<b>a</b>) We observe that the new scheduler has a higher PDR when the number of nodes is less than 100. (<b>b</b>) We observe that the new scheduler has a lower delay when the number of nodes is less than 80. (<b>c</b>) We observe that the new scheduler has a higher radio duty cycle.</p>
Full article ">
21 pages, 4060 KiB  
Article
Multiple Concurrent Slotframe Scheduling for Wireless Power Transfer-Enabled Wireless Sensor Networks
by Sol-Bee Lee, Sam Nguyen-Xuan, Jung-Hyok Kwon and Eui-Jik Kim
Sensors 2022, 22(12), 4520; https://doi.org/10.3390/s22124520 - 15 Jun 2022
Cited by 3 | Viewed by 2070
Abstract
This paper presents a multiple concurrent slotframe scheduling (MCSS) protocol for wireless power transfer (WPT)-enabled wireless sensor networks. The MCSS supports a cluster-tree network topology composed of heterogeneous devices, including hybrid access points (HAPs) serving as power transmitting units and sensor nodes serving [...] Read more.
This paper presents a multiple concurrent slotframe scheduling (MCSS) protocol for wireless power transfer (WPT)-enabled wireless sensor networks. The MCSS supports a cluster-tree network topology composed of heterogeneous devices, including hybrid access points (HAPs) serving as power transmitting units and sensor nodes serving as power receiving units as well as various types of traffic, such as power, data, and control messages (CMs). To this end, MCSS defines three types of time-slotted channel hopping (TSCH) concurrent slotframes: the CM slotframe, HAP slotframe, and WPT slotframe. These slotframes are used for CM traffic, inter-cluster traffic, and intra-cluster traffic, respectively. In MCSS, the length of each TSCH concurrent slotframe is set to be mutually prime to minimize the overlap between cells allocated in the slotframes, and its transmission priority is determined according to the characteristics of transmitted traffic. In addition, MCSS determines the WPT slotframe length, considering the minimum number of power and data cells required for energy harvesting and data transmission of sensor nodes and the number of overprovisioned cells needed to compensate for overlap between cells. The simulation results demonstrated that MCSS outperforms the legacy TSCH medium access control protocol and TSCH multiple slotframe scheduling (TMSS) for the average end-to-end delay, aggregate throughput, and average harvested energy. Full article
Show Figures

Figure 1

Figure 1
<p>System architecture of MCSS.</p>
Full article ">Figure 2
<p>Example of two-step and three-step 6P transactions.</p>
Full article ">Figure 3
<p>Example of multiple concurrent slotframes in MCSS.</p>
Full article ">Figure 4
<p>Example of an MCSS schedule.</p>
Full article ">Figure 5
<p>Example of the three-step 6P transaction.</p>
Full article ">Figure 6
<p>Aggregate throughput of MCSS: (<b>a</b>) one, (<b>b</b>) two, and (<b>c</b>) four packets/s.</p>
Full article ">Figure 7
<p>Average end-to-end delay.</p>
Full article ">Figure 8
<p>WPT slotframe lengths of HAPs: (<b>a</b>) one, (<b>b</b>) two, and (<b>c</b>) four packets/s.</p>
Full article ">Figure 9
<p>Aggregate throughput.</p>
Full article ">Figure 10
<p>Average harvested energy.</p>
Full article ">Figure 11
<p>Effect of WPT on aggregate throughput: (<b>a</b>) 12 and (<b>b</b>) 36 sensor nodes.</p>
Full article ">
10 pages, 525 KiB  
Brief Report
Impact of the COVID-19 Lockdown on Patients with Chronic Tinnitus—Preliminary Results
by Alessandra Fioretti, Eleonora Natalini, Gianluigi Triggianese, Rebecca Eibenstein, Anna Maria Angelone, Maria Lauriello and Alberto Eibenstein
Audiol. Res. 2022, 12(3), 327-336; https://doi.org/10.3390/audiolres12030034 - 15 Jun 2022
Cited by 4 | Viewed by 3255
Abstract
The COVID-19 pandemic and the lockdown measures are both causes of psychological distress. The aim of the current study was to evaluate the psychological effects of lockdown measures on patients with subjective chronic tinnitus diagnosed before the COVID-19 pandemic. A sample of n [...] Read more.
The COVID-19 pandemic and the lockdown measures are both causes of psychological distress. The aim of the current study was to evaluate the psychological effects of lockdown measures on patients with subjective chronic tinnitus diagnosed before the COVID-19 pandemic. A sample of n = 77 patients with chronic tinnitus was contacted by mail/phone for a survey between June 2021 and September 2021. All patients filled out questionnaires on tinnitus distress (Tinnitus Handicap Inventory, THI), anxiety (Beck Anxiety Inventory, BAI) and depression (Beck Depression Inventory, BDI) and eight items of the Tinnitus Sample Case History (TSCH) about tinnitus history (i.e., loudness, pitch, perception, tinnitus location), stress, and related conditions (noise annoyance, vertigo/dizziness, headache). Forty patients with chronic tinnitus filled out the survey. No significant differences of total THI mean scores (p > 0.05) were found compared to the results obtained before the COVID-19 pandemic and after lockdown. Regarding depression and anxiety, the female population showed a significant increase in scores obtained from the BDI (p < 0.0170) and the BAI (p < 0.049). Only two patients (0.5%) were infected by COVID-19 (positive RT-PCR), and they did not report any worsening of tinnitus. According to the data of the literature, our patients experienced a heterogeneous course of tinnitus, and the severity of tinnitus was not significantly affected by lifestyle changes during the COVID-19 pandemic and lockdown. Full article
(This article belongs to the Special Issue Audio-Vestibular Disorders in the COVID-19 Pandemics)
Show Figures

Figure 1

Figure 1
<p>THI grades before COVID-19 and after lockdown.</p>
Full article ">
40 pages, 833 KiB  
Article
Scheduling UWB Ranging and Backbone Communications in a Pure Wireless Indoor Positioning System
by Maximilien Charlier, Remous-Aris Koutsiamanis and Bruno Quoitin
IoT 2022, 3(1), 219-258; https://doi.org/10.3390/iot3010013 - 2 Mar 2022
Cited by 2 | Viewed by 5782
Abstract
In this paper, we present and evaluate an ultra-wideband (UWB) indoor processing architecture that allows the performing of simultaneous localizations of mobile tags. This architecture relies on a network of low-power fixed anchors that provide forward-ranging measurements to a localization engine responsible for [...] Read more.
In this paper, we present and evaluate an ultra-wideband (UWB) indoor processing architecture that allows the performing of simultaneous localizations of mobile tags. This architecture relies on a network of low-power fixed anchors that provide forward-ranging measurements to a localization engine responsible for performing trilateration. The communications within this network are orchestrated by UWB-TSCH, an adaptation to the ultra-wideband (UWB) wireless technology of the time-slotted channel-hopping (TSCH) mode of IEEE 802.15.4. As a result of global synchronization, the architecture allows deterministic channel access and low power consumption. Moreover, it makes it possible to communicate concurrently over multiple frequency channels or using orthogonal preamble codes. To schedule communications in such a network, we designed a dedicated centralized scheduler inspired from the traffic aware scheduling algorithm (TASA). By organizing the anchors in multiple cells, the scheduler is able to perform simultaneous localizations and transmissions as long as the corresponding anchors are sufficiently far away to not interfere with each other. In our indoor positioning system (IPS), this is combined with dynamic registration of mobile tags to anchors, easing mobility, as no rescheduling is required. This approach makes our ultra-wideband (UWB) indoor positioning system (IPS) more scalable and reduces deployment costs since it does not require separate networks to perform ranging measurements and to forward them to the localization engine. We further improved our scheduling algorithm with support for multiple sinks and in-network data aggregation. We show, through simulations over large networks containing hundreds of cells, that high positioning rates can be achieved. Notably, we were able to fully schedule a 400-cell/400-tag network in less than 11 s in the worst case, and to create compact schedules which were up to 11 times shorter than otherwise with the use of aggregation, while also bounding queue sizes on anchors to support realistic use situations. Full article
Show Figures

Figure 1

Figure 1
<p>Positioning system composed of a single cell that contains 3 anchors.</p>
Full article ">Figure 2
<p>Principles of single-sided two-way ranging (SS-TWR) and double-sided two-way ranging (DS-TWR) protocols. Messages are composed of a preamble (orange) and payload (blue). A timestamp is associated to the end of the preamble. Times <math display="inline"><semantics> <mrow> <mi>T</mi> <msub> <mi>X</mi> <mi>u</mi> </msub> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>R</mi> <msub> <mi>X</mi> <mi>u</mi> </msub> </mrow> </semantics></math> and <math display="inline"><semantics> <msub> <mi>T</mi> <mrow> <mi>Reply</mi> <mo>,</mo> <mi>u</mi> </mrow> </msub> </semantics></math> are measured with node <span class="html-italic">u</span>’s clock reference.</p>
Full article ">Figure 3
<p>Schedule corresponding to the example of <a href="#IoT-03-00013-f001" class="html-fig">Figure 1</a>. The slotframe contains 5 timeslots and repeats over time.</p>
Full article ">Figure 4
<p>Dynamic registration to a cell provisioned with a 2-timeslots CAP and a single reserved tag, without the need for re-scheduling UWB-TSCH communications.</p>
Full article ">Figure 5
<p>Structure of an ADS-TWR timeslot for 3 different nominal bitrates supported by the Decawave DW1000 transceiver. Node <b>A</b> is the initiator of the TWR exchange, typically an anchor, and <b>B</b> is the responder, typically a tag.</p>
Full article ">Figure 6
<p>Structure of a ranging frame.</p>
Full article ">Figure 7
<p>Multi-cell positioning system.</p>
Full article ">Figure 8
<p>Routing graph <math display="inline"><semantics> <mi mathvariant="bold-italic">G</mi> </semantics></math>.</p>
Full article ">Figure 9
<p>Augmented interference graph for <span class="html-italic">reserved tag t</span>1.</p>
Full article ">Figure 10
<p>Evolution of queue depth from <math display="inline"><semantics> <mrow> <msub> <mi>q</mi> <mrow> <mi>u</mi> <mo>,</mo> <mi>v</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> to <math display="inline"><semantics> <mrow> <msub> <mi>q</mi> <mrow> <mi>u</mi> <mo>,</mo> <mi>v</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>k</mi> <mo>+</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> </semantics></math> during timeslot <span class="html-italic">k</span>. The communication that occurs during timeslot <span class="html-italic">k</span> is shown with a very thick edge. Blue nodes are <span class="html-italic">reserved tags</span> and blue edges are ranging exchanges.</p>
Full article ">Figure 11
<p>Routing graph <math display="inline"><semantics> <mi mathvariant="bold">G</mi> </semantics></math>.</p>
Full article ">Figure 12
<p>One transceiver cannot be involved in multiple communications within the same timeslot. (<b>a</b>) Simultaneous transmission to the same parent. (<b>b</b>) Simultaneous reception and transmission.</p>
Full article ">Figure 13
<p>Two communication <math display="inline"><semantics> <mrow> <mi>u</mi> <mo>↔</mo> <mi>v</mi> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>s</mi> <mo>↔</mo> <mi>t</mi> </mrow> </semantics></math> cannot be scheduled on the same channel/code if there is any edge in <math display="inline"><semantics> <msub> <mi mathvariant="bold-italic">G</mi> <mi>aug</mi> </msub> </semantics></math> between a pair of vertices each taken from a different communication (dashed lines).</p>
Full article ">Figure 14
<p>Routing graph <math display="inline"><semantics> <mi mathvariant="bold-italic">G</mi> </semantics></math>.</p>
Full article ">Figure 15
<p>Interference graph <math display="inline"><semantics> <msub> <mi mathvariant="bold-italic">G</mi> <mi>aug</mi> </msub> </semantics></math>.</p>
Full article ">Figure 16
<p>Conflict graph <math display="inline"><semantics> <msub> <mi mathvariant="bold-italic">I</mi> <mrow> <mi>c</mi> <mi>s</mi> </mrow> </msub> </semantics></math>.</p>
Full article ">Figure 17
<p>The UDG model used in the simulator. The green circle of radius <math display="inline"><semantics> <msub> <mi>δ</mi> <mi>c</mi> </msub> </semantics></math> models the communication range, while the red circle of radius <math display="inline"><semantics> <msub> <mi>δ</mi> <mi>i</mi> </msub> </semantics></math> models the interference range.</p>
Full article ">Figure 18
<p>Illustration of the grid topology generation process. In this example, the following radii are used: 0, 0.71, 1.59, 2.13 and 2.55.</p>
Full article ">Figure 19
<p>Number of transmissions as a function of the network size. The differences in network sizes between the two sink placements can be attributed to the expansion process explained in <a href="#sec6dot2-IoT-03-00013" class="html-sec">Section 6.2</a>.</p>
Full article ">Figure 20
<p>Path length to the sink for each node according to the network size. The dashed curve shows the mean path length.</p>
Full article ">Figure 21
<p>Slotframe length as a function of the network size and the number of allowed channels.</p>
Full article ">Figure 22
<p>Number of transmissions per timeslot and maximum number of transmissions per channel and timeslot. Note the split x-axis and different x-axis scales.</p>
Full article ">Figure 23
<p>Frequency of position update according to the number of channels at 6.8 Mb/s.</p>
Full article ">Figure 24
<p>Slotframe length and mean concurrent channel usages according to the interference range and the size of the network. tsch is configured with 8 channels.</p>
Full article ">Figure 25
<p>Distribution of concurrent communications over the slotframe for different interference ranges. UWB-TSCH is configured with 8 channels. Note the split x-axis.</p>
Full article ">Figure 26
<p>Distribution of in cells and at the same time distribution of the achieved positioning rate.</p>
Full article ">Figure 27
<p>Slotframe length as a function of the number of sinks. Scenarios with a 400 cells network, using 8 channels.</p>
Full article ">Figure 28
<p>Structure of a ranging frame showing space left for aggregation of multiple measurements.</p>
Full article ">Figure 29
<p>Slotframe length as a function of network size (in cells) in different aggregation scenarios. Each scenario is named <b>Ch<span class="html-italic">m</span>,A<span class="html-italic">n</span></b> with <span class="html-italic">m</span> the number of channels and <span class="html-italic">n</span> the amount of aggregation.</p>
Full article ">Figure 30
<p>Maximum queue depth observed during slotframe execution. UWB-TSCH is configured with 8 channels. Each scenario is named <b>A<span class="html-italic">m</span>,S<span class="html-italic">n</span></b> where <span class="html-italic">m</span> is the aggregation level, <span class="html-italic">n</span><sub>agg</sub>, and <span class="html-italic">m</span> the number of sinks.</p>
Full article ">Figure 31
<p>Slotframe length as a function of the number of sinks with either no aggregation (<span class="html-italic">n</span><sub>agg</sub> = 1) or maximal aggregation level (<span class="html-italic">n</span><sub>agg</sub> = 14). The network contains 400 cells and the schedule can make use of up to 8 channels.</p>
Full article ">Figure 32
<p>Mean schedule computation time for different network sizes and scenarios using up to 8 channels, aggregation, and either a single sink or all anchors as sink.</p>
Full article ">Figure 33
<p>Mean schedule computation time for scenarios with up to 8 channels, multiple sinks and no of maximum aggregation in a 400 cells network.</p>
Full article ">
19 pages, 1037 KiB  
Article
Ultra-Low Power Wireless Sensor Networks Based on Time Slotted Channel Hopping with Probabilistic Blacklisting
by Gianluca Cena, Stefano Scanzio and Adriano Valenzano
Electronics 2022, 11(3), 304; https://doi.org/10.3390/electronics11030304 - 19 Jan 2022
Cited by 13 | Viewed by 1592
Abstract
Devices in wireless sensor networks are typically powered by batteries, which must last as long as possible to reduce both the total cost of ownership and potentially pollutant wastes when disposed of. By lowering the duty cycle to the bare minimum, time slotted [...] Read more.
Devices in wireless sensor networks are typically powered by batteries, which must last as long as possible to reduce both the total cost of ownership and potentially pollutant wastes when disposed of. By lowering the duty cycle to the bare minimum, time slotted channel hopping manages to achieve very low power consumption, which makes it a very interesting option for saving energy, e.g., at the perception layer of the Internet of Things. In this paper, a mechanism based on probabilistic blacklisting is proposed for such networks, which permits to lower power consumption further. In particular, channels suffering from non-negligible disturbance may be skipped based on the perceived quality of communication so as to increase reliability and decrease the likelihood that retransmissions have to be performed. The only downside of this approach is that the transmission latency may grow, but this is mostly irrelevant for systems where the sampling rates are low enough. Full article
(This article belongs to the Special Issue Applications of Embedded Systems, Volume II)
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>Block diagram for ACCS (including optional normalization to the minimum): the MAC of TSCH is instructed whether to use or to skip every cell allocated to the link.</p>
Full article ">Figure 2
<p>Sample sequence of cells skipped on channel <span class="html-italic">c</span> vs. quantized disturbance <math display="inline"><semantics> <msub> <mi>q</mi> <mi>c</mi> </msub> </semantics></math>.</p>
Full article ">Figure 3
<p>Real and estimated (SMA/EMA) values of <math display="inline"><semantics> <msub> <mi>ϵ</mi> <mi>c</mi> </msub> </semantics></math> vs. time (sample) <span class="html-italic">i</span>.</p>
Full article ">Figure 4
<p>Performance indicators about communication for the different approaches (TSCH, ACCS, and normalized ACCS) in the three considered operating conditions (mild, heavy, and negligible disturbance).</p>
Full article ">Figure 5
<p>Number of transmission attempts per frame vs. time (sample).</p>
Full article ">Figure 6
<p>Frame transmission latency vs. time (sample).</p>
Full article ">
Back to TopTop