scholarly journals Collision Minimization Beacon Scheduling Scheme using RPL in Dense TSCH-based IoT Environment

2020 ◽  
Author(s):  
Jae-Young Kim ◽  
Sang-Hwa Chung ◽  
Gihwan Kim ◽  
Minjae Kim
Keyword(s):  
Network Formation ◽  
High Reliability ◽  
Network Congestion ◽  
Time Zone ◽  
Channel Change ◽  
Scheduling Scheme ◽  
Channel Hopping ◽  
Time Division ◽  
Entire Network ◽  
Scheduling Technique

Abstract IEEE 802.15.4e Time Slotted Channel Hopping (TSCH) operates on a time-division scheme and uses 16 separate channels for each communication to ensure high reliability even in an industrial environment where many devices are concentrated. The process of participating in the network is indispensable because the entire network operates at the same time. However, there is a problem with TSCH's channel change technique, which results in longer network participation time for new nodes wanting to participate in the network. Previous research has randomly chosen channels for beaconing to reduce network formation time. However, this approach is effective for networks with fewer nodes, but conflicts in beacon messages in networks with approximately 20 or more networks result in network congestion, which increases network participation time. To solve this problem, this paper proposes a collision minimization scheduling technique. This strategy assigns a separate time zone to each node to exclude the possibility of beacon message collisions. This algorithm allocates timeslot based on RANK of RPL. By explicitly predicting the longest network joining time of the network participating nodes, the average network joining time was measured to be about 25 seconds to 27 seconds faster compared to the previous research.

scholarly journals Collision-Free Advertisement Scheduling for IEEE 802.15.4-TSCH Networks

Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1789 ◽  
Author(s):  
Apostolos Karalis ◽  
Dimitrios Zorbas ◽  
Christos Douligeris
Keyword(s):  
Power Consumption ◽  
Ieee 802.15.4 ◽  
Mac Protocol ◽  
High Reliability ◽  
Mobile Nodes ◽  
Medium Access ◽  
Worst Case ◽  
Channel Hopping ◽  
Transmission Schedule ◽  
Scheduling Method

IEEE802.15.4-time slotted channel hopping (TSCH) is a medium access control (MAC) protocol designed to support wireless device networking, offering high reliability and low power consumption, two features that are desirable in the industrial internet of things (IIoT). The formation of an IEEE802.15.4-TSCH network relies on the periodic transmissions of network advertising frames called enhanced beacons (EB). The scheduling of EB transmissions plays a crucial role both in the joining time and in the power consumption of the nodes. The existence of collisions between EB is an important factor that negatively affects the performance. In the worst case, all the neighboring EB transmissions of a node may collide, a phenomenon which we call a full collision. Most of the EB scheduling methods that have been proposed in the literature are fully or partially based on randomness in order to create the EB transmission schedule. In this paper, we initially show that the randomness can lead to a considerable probability of collisions, and, especially, of full collisions. Subsequently, we propose a novel autonomous EB scheduling method that eliminates collisions using a simple technique that does not increase the power consumption. To the best of our knowledge, our proposed method is the first non-centralized EB scheduling method that fully eliminates collisions, and this is guaranteed even if there are mobile nodes. To evaluate our method, we compare our proposal with recent and state-of-the-art non-centralized network-advertisement scheduling methods. Our evaluation does not consider only fixed topology networks, but also networks with mobile nodes, a scenario which has not been examined before. The results of our simulations demonstrate the superiority of our method in terms of joining time and energy consumption.

scholarly journals Frame-Type-Aware Static Time Slotted Channel Hopping Scheduling Scheme for Large-Scale Smart Metering Networks

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 2200-2209 ◽  
Author(s):  
Huiung Park ◽  
Haeyong Kim ◽  
Kyeong Tae Kim ◽  
Seon-Tae Kim ◽  
Pyeongsoo Mah
Keyword(s):  
Large Scale ◽  
Smart Metering ◽  
Scheduling Scheme ◽  
Channel Hopping

scholarly journals Centralized Energy Harvesting-Based TDMA Protocol for Terahertz NanoSensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (20) ◽  
pp. 4508 ◽  
Author(s):  
Juan Xu ◽  
Jiali Kan ◽  
Yan Zhang
Keyword(s):  
Energy Harvesting ◽  
Multiple Access ◽  
Packet Transmission ◽  
Global Perspective ◽  
Impact Factors ◽  
Slot Allocation ◽  
Data Buffer ◽  
Markov Decision ◽  
Time Division ◽  
Entire Network

Terahertz wireless nano-sensor networks (WNSNs) are novel networks interconnecting multiple nano-devices by means of wireless communication. In this paper, a centralized energy harvesting-based time division multiple access (TDMA) protocol, called CEH-TDMA is proposed. This protocol examines the data transmission process from a global perspective, where the nano-controller regulates the channel access and allocates time slots for all nano-nodes. First, each nano-node sends the remaining energy and the number of packets in its data buffer to the nano-controller, and then, the nano-controller constructs a Markov decision process (MDP) model according to the state information of all nano-nodes, where the energy consumption and the number of transmitted packets in the entire network are considered as impact factors in designing the award function in the MDP model. Finally, a globally optimal slot allocation strategy is obtained, which maximizes the amount of packet transmission in the perpetual WNSNs.

Design of a Temporary Ground Wire Monitoring System and Reliability Research

2014 ◽  
Vol 599-601 ◽  
pp. 878-881
Author(s):  
Ying Hui Kong ◽  
Xiang Yuan Fu ◽  
Zhi Xiong Chen
Keyword(s):  
Monitoring System ◽  
High Reliability ◽  
Good Effect ◽  
Information Collection ◽  
Accurate Information ◽  
Network Congestion ◽  
The Status ◽  
Comprehensive Test ◽  
Communication Reliability ◽  
Job Site

Considering the current situation that ground wire is short of automated management, a temporary ground wire monitoring system is designed in this paper. In this system, RC 522 RFID reader chip is used to achieve reliable information collection of the state of ground wire and ZigBee chip CC2530 is used to achieve accurate information transmission. A comprehensive test is conducted. Against the interference, obstacles blocking and network congestion issues in a substation, proposes to increase routing nodes, adjust letter spacing, etc. to improve communication reliability. The system can achieve real-time monitoring of the status of temporary ground wire in a substation job site,with high reliability and good effect,which is worth being extended.

scholarly journals Collision Avoidance and Dynamic Sleep Scheduling Technique for Cluster Based Underwater Wireless Sensor Networks (UWSN)

2021 ◽  
Author(s):  
D. Anuradha ◽  
S. Suresh ◽  
P. Muneeshwari
Keyword(s):  
Data Aggregation ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Sleep Scheduling ◽  
Underwater Wireless Sensor Networks ◽  
Data Packets ◽  
Scheduling Scheme ◽  
Design Protocol ◽  
To Receive ◽  
Scheduling Technique

Abstract In UWSN, during clustering, there may be occurrence of intra cluster collision. In order to overcome this issue, in this paper, we propose to design protocol to efficiently handle the intra-cluster collisions and to design sleep-wake up scheduling scheme for the data aggregation. In this case, the cluster head coordinates with its cluster members to transmit (append) their data packets with partially overlapping transmission times. After the CH finishes transmitting its packets to the courier nodes, it starts to receive incoming appended packets from its members. It then sends the packet to its parent CH towards the sink applying data fusion and sending the aggregated packet in TDMA period based on the receiver oriented sleep scheduling scheme. By simulation results, we show that the proposed technique minimizes collision and transmission delay.

scholarly journals Efficiency enhancement using optimized static scheduling technique in TSCH networks

2020 ◽  
Vol 10 (2) ◽  
pp. 1952
Author(s):  
Manjunath G. Asuti ◽  
Prabhugoud I. Basarkod
Keyword(s):  
Data Exchange ◽  
Performance Metrics ◽  
High Reliability ◽  
Link Scheduling ◽  
Time Data ◽  
Static Scheduling ◽  
Mandatory Requirement ◽  
Iot Devices ◽  
Scheduling Technique ◽  
Ieee 802.15.4E

In recent times, the reliable and real-time data transmission becomes a mandatory requirement for various industries and organizations due to the large utilization of Internet of Things (IoT) devices. However, the IoT devices need high reliability, precise data exchange and low power utilization which cannot be achieved by the conventional Medium Access Control (MAC) protocols due to link failures and high interferences in the network. Therefore, the Time-Slotted Channel Hopping (TSCH) networks can be used for link scheduling under the IEEE 802.15.4e standard. In this paper, we propose an Optimized Static Scheduling Technique (OSST) for the link scheduling in IEEE 802.15.4e based TSCH networks. In OSST the link schedule is optimized by considering the packet latency information during transmission by checking the status of the transmitted packets as well as keeping track of the lost data packets from source to destination nodes. We evaluate the proposed OSST model using 6TiSCH Simulator and compare the different performance metrics with Simple distributed TSCH Scheduling.

scholarly journals Security Vulnerabilities and Countermeasures for Time Synchronization in TSCH Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-14
Author(s):  
Wei Yang ◽  
Yadong Wan ◽  
Jie He ◽  
Yuanlong Cao
Keyword(s):  
Wireless Mesh Networks ◽  
High Precision ◽  
Time Synchronization ◽  
Mesh Networks ◽  
Test Bed ◽  
Security Vulnerabilities ◽  
Wireless Mesh ◽  
Channel Hopping ◽  
Wireless Standards ◽  
Entire Network

Time-slotted channel hopping (TSCH), which can enable highly reliable and low-power wireless mesh networks, is the cornerstone of current industrial wireless standards. In a TSCH network, all nodes must maintain high-precision synchronization. If an adversary launches a time-synchronization attack on a TSCH network, the entire network communication system can be paralyzed. Thus, time-synchronization security is a key problem in this network. In this article, time synchronization is divided into single-hop pairwise, clusterwise, and three-level multihop according to the network scope. We deeply analyze their security vulnerabilities due to the TSCH technology itself and its high-precision synchronization requirements and identify the specific attacks; then, we propose corresponding security countermeasures. Finally, we built a test bed using 16 OpenMoteSTM nodes and the OpenWSN software to evaluate the performance of the proposed scheme. The experimental results showed that serious security vulnerabilities exist in time-synchronization protocols, and the proposed countermeasures can successfully defend against the attacks.

scholarly journals Transmission Scheduling of Periodic Real-Time Traffic in IEEE 802.15.4e TSCH-Based Industrial Mesh Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Ke Shi ◽  
Lin Zhang ◽  
Zhiying Qi ◽  
Kang Tong ◽  
Hongsheng Chen
Keyword(s):  
Real Time ◽  
Mesh Networks ◽  
High Reliability ◽  
Industrial Applications ◽  
Maximum Matching ◽  
Mesh Topology ◽  
Dynamic Priority ◽  
Real Time Traffic ◽  
Channel Hopping ◽  
Ieee 802.15.4E

Time-slotted channel hopping (TSCH) is a part of an emerging IEEE 802.15.4e standard to enable deterministic low-power mesh networking, which offers high reliability and low latency for wireless industrial applications. Nonetheless, the standard only provides a framework, but it does not mandate a specific scheduling mechanism for time and frequency slot allocation. This paper focuses on a centralized scheme to schedule multiple concurrent periodic real-time flows in TSCH networks with mesh topology. In our scheme, each flow is assigned a dynamic priority based on its deadline and the hops remaining to reach the destination. A maximum matching algorithm is utilized to find conflict-free links, which provides more chances to transfer high-priority flows at each time slot. Frequency allocation is implemented by graph coloring to make finally selected links interference free. Simulation results show that our algorithm clearly outperforms the existing algorithms on the deadline satisfaction ratio with a similar radio duty cycle.

Sign in / Sign up

Export Citation Format

Share Document