scholarly journals Parent and PHY Selection in Slot Bonding IEEE 802.15.4e TSCH Networks

Sensors ◽  
2021 ◽  
Vol 21 (15) ◽  
pp. 5150
Author(s):  
Glenn Daneels ◽  
Dries Van Van Leemput ◽  
Carmen Delgado ◽  
Eli De De Poorter ◽  
Steven Latré ◽  
...  
Keyword(s):  
Sensor Networks ◽  
Delivery Ratio ◽  
Selection Mechanism ◽  
Computationally Efficient ◽  
Industrial Internet ◽  
Parent Selection ◽  
Network Link ◽  
Channel Hopping ◽  
The One ◽  
Ieee 802.15.4E

While IEEE 802.15.4e Time-Slotted Channel Hopping (TSCH) networks should be equipped to deal with the hard wireless challenges of industrial environments, the sensor networks are often still limited by the characteristics of the used physical (PHY) layer. Therefore, the TSCH community has recently started shifting research efforts to the support of multiple PHY layers, to overcome this limitation. On the one hand, integrating such multi-PHY support implies dealing with the PHY characteristics to fit the resource allocation in the TSCH schedule, and on the other hand, defining policies on how to select the appropriate PHY for each network link. As such, first a heuristic is proposed that is a step towards a distributed PHY and parent selection mechanism for slot bonding multi-PHY TSCH sensor networks. Additionally, a proposal on how this heuristic can be implemented in the IPv6 over the TSCH mode of IEEE 802.15.4e (6TiSCH) protocol stack and its Routing Protocol for Low-power and Lossy network (RPL) layer is also presented. Slot bonding allows the creation of different-sized bonded slots with a duration adapted to the data rate of each chosen PHY. Afterwards, a TSCH slot bonding implementation is proposed in the latest version of the Contiki-NG Industrial Internet of Things (IIoT) operating system. Subsequently, via extensive simulation results, and by deploying the slot bonding implementation on a real sensor node testbed, it is shown that the computationally efficient parent and PHY selection mechanism approximates the packet delivery ratio (PDR) results of a near-optimal, but computationally complex, centralized scheduler.

scholarly journals TSCH and RPL Joining Time Model for Industrial Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (11) ◽  
pp. 3904
Author(s):  
Jose Vera-Pérez ◽  
Javier Silvestre-Blanes ◽  
Víctor Sempere-Payá
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Industry 4.0 ◽  
Wireless Sensor ◽  
Lossy Networks ◽  
Industrial Wireless Sensor Networks ◽  
Time Model ◽  
Industrial Internet ◽  
Channel Hopping ◽  
Definition Of

Wireless sensor networks (WSNs) play a key role in the ecosystem of the Industrial Internet of Things (IIoT) and the definition of today’s Industry 4.0. These WSNs have the ability to sensor large amounts of data, thanks to their easy scalability. WSNs allow the deployment of a large number of self-configuring nodes and the ability to automatically reorganize in case of any change in the topology. This huge sensorization capacity, together with its interoperability with IP-based networks, allows the systems of Industry 4.0 to be equipped with a powerful tool with which to digitalize a huge amount of variables in the different industrial processes. The IEEE 802.15.4e standard, together with the access mechanism to the Time Slotted Channel Hopping medium (TSCH) and the dynamic Routing Protocol for Low-Power and Lossy Networks (RPL), allow deployment of networks with the high levels of robustness and reliability necessary in industrial scenarios. However, these configurations have some disadvantages in the deployment and synchronization phases of the networks, since the time it takes to synchronize the nodes is penalized compared to other solutions in which access to the medium is done randomly and without channel hopping. This article proposes an analytical model to characterize the behavior of this type of network, based on TSCH and RPL during the phases of deployment along with synchronization and connection to the RPL network. Through this model, validated by simulation and real tests, it is possible to parameterize different configurations of a WSN network based on TSCH and RPL.

scholarly journals Enhancing SDN WISE with Slicing Over TSCH

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1075
Author(s):  
Federico Orozco-Santos ◽  
Víctor Sempere-Payá ◽  
Teresa Albero-Albero ◽  
Javier Silvestre-Blanes
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Control Level ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Data Traffic ◽  
Medium Access ◽  
Industrial Wireless Sensor Networks ◽  
Channel Hopping ◽  
Industrial Level

IWSNs (Industrial Wireless Sensor Networks) have become the next step in the evolution of WSN (Wireless Sensor Networks) due to the nature and demands of modern industry. With this type of network, flexible and scalable architectures can be created that simultaneously support traffic sources with different characteristics. Due to the great diversity of application scenarios, there is a need to implement additional capabilities that can guarantee an adequate level of reliability and that can adapt to the dynamic behavior of the applications in use. The use of SDNs (Software Defined Networks) extends the possibilities of control over the network and enables its deployment at an industrial level. The signaling traffic exchanged between nodes and controller is heavy and must occupy the same channel as the data traffic. This difficulty can be overcome with the segmentation of the traffic into flows, and correct scheduling at the MAC (Medium Access Control) level, known as slices. This article proposes the integration in the SDN controller of a traffic manager, a routing process in charge of assigning different routes according to the different flows, as well as the introduction of the Time Slotted Channel Hopping (TSCH) Scheduler. In addition, the TSCH (Time Slotted Channel Hopping) is incorporated in the SDN-WISE framework (Software Defined Networking solution for Wireless Sensor Networks), and this protocol has been modified to send the TSCH schedule. These elements are jointly responsible for scheduling and segmenting the traffic that will be sent to the nodes through a single packet from the controller and its performance has been evaluated through simulation and a testbed. The results obtained show how flexibility, adaptability, and determinism increase thanks to the joint use of the routing process and the TSCH Scheduler, which makes it possible to create a slicing by flows, which have different quality of service requirements. This in turn helps guarantee their QoS characteristics, increase the PDR (Packet Delivery Ratio) for the flow with the highest priority, maintain the DMR (Deadline Miss Ratio), and increase the network lifetime.

scholarly journals A Joining Procedure and Synchronization for TSCH-RPL Wireless Sensor Networks

Sensors ◽  
2018 ◽  
Vol 18 (10) ◽  
pp. 3556 ◽  
Author(s):  
Jose Vera-Pérez ◽  
David Todolí-Ferrandis ◽  
Salvador Santonja-Climent ◽  
Javier Silvestre-Blanes ◽  
Víctor Sempere-Payá
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Frequency Diversity ◽  
Industrial Internet Of Things ◽  
Medium Access ◽  
Industrial Internet ◽  
Channel Hopping ◽  
The Common ◽  
Operational Networks

Wireless Sensor Networks have become a key enabler for Industrial Internet of Things (IoT) applications; however, to adapt to the derived robust communication requirements, deterministic and scheduled medium access should be used, along with other features, such as channel hopping and frequency diversity. Implementing these mechanisms requires a correct synchronization of all devices in the network, a stage in deployment that can lead to non-operational networks. The present article presents an analysis of such situations and possible solutions, including the common current approaches and recommendations, and proposes a new beacon advertising method based on a specific Trickle Timer for the Medium Access Control (MAC) Time-Slotted Channel Hopping (TSCH) layer, decoupling from the timers in the network and routing layers. With this solution, improvements in connection success, time to join, and energy consumption can be obtained for the widely extended IEEE802.15.4e standard.

Fault Tolerant Reliable Protocol (FTRP) Performance Evaluation in Wireless Sensor Networks: An Extensitive Study

2019 ◽  
pp. 1-36
Keyword(s):  
Wireless Sensor Networks ◽  
Fault Tolerance ◽  
Sensor Networks ◽  
Fault Tolerant ◽  
Cluster Head ◽  
Biological Data ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Good Performer ◽  
Wide Range

Fault Tolerant Reliable Protocol (FTRP) is proposed as a novel routing protocol designed for Wireless Sensor Networks (WSNs). FTRP offers fault tolerance reliability for packet exchange and support for dynamic network changes. The key concept used is the use of node logical clustering. The protocol delegates the routing ownership to the cluster heads where fault tolerance functionality is implemented. FTRP utilizes cluster head nodes along with cluster head groups to store packets in transient. In addition, FTRP utilizes broadcast, which reduces the message overhead as compared to classical flooding mechanisms. FTRP manipulates Time to Live values for the various routing messages to control message broadcast. FTRP utilizes jitter in messages transmission to reduce the effect of synchronized node states, which in turn reduces collisions. FTRP performance has been extensively through simulations against Ad-hoc On-demand Distance Vector (AODV) and Optimized Link State (OLSR) routing protocols. Packet Delivery Ratio (PDR), Aggregate Throughput and End-to-End delay (E-2-E) had been used as performance metrics. In terms of PDR and aggregate throughput, it is found that FTRP is an excellent performer in all mobility scenarios whether the network is sparse or dense. In stationary scenarios, FTRP performed well in sparse network; however, in dense network FTRP’s performance had degraded yet in an acceptable range. This degradation is attributed to synchronized nodes states. Reliably delivering a message comes to a cost, as in terms of E-2-E. results show that FTRP is considered a good performer in all mobility scenarios where the network is sparse. In sparse stationary scenario, FTRP is considered good performer, however in dense stationary scenarios FTRP’s E-2-E is not acceptable. There are times when receiving a network message is more important than other costs such as energy or delay. That makes FTRP suitable for wide range of WSNs applications, such as military applications by monitoring soldiers’ biological data and supplies while in battlefield and battle damage assessment. FTRP can also be used in health applications in addition to wide range of geo-fencing, environmental monitoring, resource monitoring, production lines monitoring, agriculture and animals tracking. FTRP should be avoided in dense stationary deployments such as, but not limited to, scenarios where high application response is critical and life endangering such as biohazards detection or within intensive care units.

QoS Aware Multi-hop Multi-path Routing Approach in Wireless Sensor Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 43-52
Author(s):  
Omkar Singh ◽  
Vinay Rishiwal
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Life Time ◽  
Base Station ◽  
Environmental Data ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
End To End

Background & Objective: Wireless Sensor Network (WSN) consist of huge number of tiny senor nodes. WSN collects environmental data and sends to the base station through multi-hop wireless communication. QoS is the salient aspect in wireless sensor networks that satisfies end-to-end QoS requirement on different parameters such as energy, network lifetime, packets delivery ratio and delay. Among them Energy consumption is the most important and challenging factor in WSN, since the senor nodes are made by battery reserved that tends towards life time of sensor networks. Methods: In this work an Improve-Energy Aware Multi-hop Multi-path Hierarchy (I-EAMMH) QoS based routing approach has been proposed and evaluated that reduces energy consumption and delivers data packets within time by selecting optimum cost path among discovered routes which extends network life time. Results and Conclusion: Simulation has been done in MATLAB on varying number of rounds 400- 2000 to checked the performance of proposed approach. I-EAMMH is compared with existing routing protocols namely EAMMH and LEACH and performs better in terms of end-to-end-delay, packet delivery ratio, as well as reduces the energy consumption 13%-19% and prolongs network lifetime 9%- 14%.

scholarly journals Void Avoidance Opportunistic Routing Protocol for Underwater Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 1942
Author(s):  
Rogaia Mhemed ◽  
Frank Comeau ◽  
William Phillips ◽  
Nauman Aslam
Keyword(s):  
Sensor Networks ◽  
Routing Protocol ◽  
Opportunistic Routing ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Underwater Sensor Networks ◽  
Network Resources ◽  
Hop Count ◽  
Intermediate Node ◽  
Packet Delivery

Much attention has been focused lately on the Opportunistic Routing technique (OR) that can overcome the restrictions of the harsh underwater environment and the unique structures of the Underwater Sensor Networks (UWSNs). OR enhances the performance of the UWSNs in both packet delivery ratio and energy saving. In our work; we propose a new routing protocol; called Energy Efficient Depth-based Opportunistic Routing with Void Avoidance for UWSNs (EEDOR-VA), to address the void area problem. EEDOR-VA is a reactive OR protocol that uses a hop count discovery procedure to update the hop count of the intermediate nodes between the source and the destination to form forwarding sets. EEDOR-VA forwarding sets can be selected with less or greater depth than the packet holder (i.e., source or intermediate node). It efficiently prevents all void/trapped nodes from being part of the forwarding sets and data transmission procedure; thereby saving network resources and delivering data packets at the lowest possible cost. The results of our extensive simulation study indicate that the EEDOR-VA protocol outperforms other protocols in terms of packet delivery ratio and energy consumption

scholarly journals A Social-Based DTN Routing in Cooperative Vehicular Sensor Networks

2018 ◽  
Vol 27 (01) ◽  
pp. 1741003 ◽  
Author(s):  
Tong Wang ◽  
Yongzhe Zhou ◽  
Xibo Wang ◽  
Yue Cao
Keyword(s):  
Information System ◽  
Sensor Networks ◽  
High Speed ◽  
Delivery Ratio ◽  
Dtn Routing ◽  
Replication Strategy ◽  
Social Metrics ◽  
Routing Mechanism ◽  
Network Overhead ◽  
Overhead Ratio

As a cooperative information system, vehicles in Vehicular Sensor Networks deliver messages based on collaboration. Due to the high speed of vehicles, the topology of the network is highly dynamic, and the network may be disconnected frequently. So how to transfer large files in such network is worth considering. The encountering nodes which never meet before flood messages blindly cause tremendous network overhead. We address this challenge by introducing the Encounter Utility Rank Router (EURR) based on social metrics. EURR includes three cases: Utility Replication Strategy, Lifetime Replication Strategy and SocialRank Replication Strategy. The Lifetime Replication is promising and complements Utility Replication. It enhances the delivery ratio by relaying the copy via the remaining lifetime. Considering the network overhead, the SocialRank Replication replicates a copy according to the SocialRank when two communicating nodes have not met before. The routing mechanism explores the utility of history encounter information and social opportunistic forwarding. The results under the scenario show an advantage of the proposed EURR over the compared algorithms in terms of delivery ratio, average delivery latency and overhead ratio.

An Improved Congestion Control Mechanism Based on Mobile Agent for Wireless Sensor Networks

2014 ◽  
Vol 519-520 ◽  
pp. 1239-1242
Author(s):  
Xiao Hu Yu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Congestion Control ◽  
Mobile Agent ◽  
Mobile Agents ◽  
Control Mechanism ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Routing Table ◽  
Congestion Control Mechanism

An improved congestion control mechanism based on mobile agent for wireless sensor networks is proposed, which includes node-level congestion and link-level congestion control. The formers congestion information is collected and distributed by mobile agents (MA). When mobile agent travels through the networks, it can select a less-loaded neighbor node as its next hop and update the routing table according to the nodes congestion status. Minimum package of node outgoing traffic was preferentially transmitted in the link-level congestion. Simulation result shows that proposed mechanism attains high delivery ratio and throughput with reduced delay when compared with the existing technique.

Sign in / Sign up

Export Citation Format

Share Document