A dynamic slot assignment algorithm of TDMA for the distribution class protocol using node neighborhood information

Lin, Cheng; Cai, Xinshuo; Su, Youxing; Ni, Pengcheng; Shi, Haibin

doi:10.1109/icasid.2017.8285760

Cited by 12 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Under the same guarantee conditions, we can see that the end-to-end delay of the algorithm in this paper is shorter than that of the other two algorithms, with better performance. HY-Mac algorithm has a faster growth in the early stage, and PD-Mac has a smoother growth, but the effect is lower than that of the algorithm in this paper, The result of the picture [5] shows that when the network is stable, the throughput of the algorithm in this paper is 150% higher than that of the PD-Mac and 124% higher than that of the HY-Mac.…”

Section: Comparison With Other Methodsmentioning

confidence: 62%

See 1 more Smart Citation

A low delay dynamic distributed TDMA slot allocation algorithm for ad hoc networks

Liu

Yang

2023

International Conference on Intelligent Systems, Communications, and Computer Networks (ISCCN 2023)

View full text Add to dashboard Cite

For the ad hoc network topology is changeable: the network scale becomes larger, which leads to difficulty in network management and lack of efficiency; The diversity of network services (text, pictures, audio, video, etc.) leads to the dynamic occupation of channels by nodes, which easily affects the end-to-end delay and throughput of the network. This study proposes a dynamic distributed TDMA protocol using theoretical analysis and network simulation verification methods. The full connection matrix of nodes is used for distributed scheduling. The influence of TDMA slot allocation on service delay is analyzed in detail. The simulation results of end-to-end delay and throughput of the network are given in the simulation experiment. The simulation shows that this directional routing protocol has some improvements in reducing end-to-end delay, reducing average packet hops, improving channel space reuse rate, and increasing network capacity.

show abstract

Section: Comparison With Other Methodsmentioning

confidence: 62%

“…Compared with the first type of protocol, TDMA protocol has higher stability. When the number of nodes is large and the topology changes, its performance is far better than that of competitive protocols [5] .…”

Section: Introductionmentioning

confidence: 99%

A low delay dynamic distributed TDMA slot allocation algorithm for ad hoc networks

Liu

Yang

2023

International Conference on Intelligent Systems, Communications, and Computer Networks (ISCCN 2023)

View full text Add to dashboard Cite

show abstract

“…Due to the limited transmission range of wireless signals, information time slots can be multiplexed in space. Nodes can apply to occupy multiple information time slots according to their information transmission requirements 10 .…”

Section: (2) Preliminary Allocation Phasementioning

confidence: 99%

NPB-DTDMA: a node priority-based dynamic TDMA algorithm based on the usage proportion of sending queue

Wang,

2023

5th International Conference on Information Science, Electrical, and Automation Engineering (ISEAE 2023)

View full text Add to dashboard Cite

Ad hoc networks are often used in scenarios such as environmental monitoring, reconnaissance reporting, and alarm. In order to realize correct and efficient data transmission of high-load nodes in the network, this paper proposes a node priority-based dynamic TDMA algorithm (NPB-DTDMA), which defines the node priority according to the usage proportion of the node's sending queue and enables the high-load nodes in the network to have advantages in obtaining information time slots. The simulation results show that when packet sending rate is lower than saturated transmission capacity, NPB-DTDMA algorithm can achieve higher throughput, lower packet loss rate, and lower average end-to-end delay than P-TDMA, E-ABROAD, and fixed TDMA algorithms.

show abstract

“…Wireless Communications and Mobile Computing processing time required for channel access. Literature [35] proposed a dynamic access protocol, which establishes a channel access table for nodes within two hops by monitoring the control messages broadcasted periodically by neighboring nodes in the control period. Literature [36] proposed G-schedule using the independent characteristics of multiple channels, which can improve channel utilization while avoiding intercell interference.…”

Section: Related Workmentioning

confidence: 99%

An Enhanced Reliable Access Scheme for Massive IoT Applications in Ubiquitous IoT Systems

Peng

Shi

Wang

2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

As a key infrastructure for intelligent manufacturing, the Industrial Internet of Things (IIoT) can connect people, massive intelligent terminals, automated control equipment, and convergence nodes to achieve a high integration of industrial systems with advanced computing, sensor technology, fifth-generation technology (5G), and the Internet. How to realize the robust and reliable connection of massive IoT applications has become the research focus of industry and academia. However, the massive IoT industrial equipment, diverse business types, complex networking mode, and broadcast characteristics of wireless media have posed serious challenges to providing stable and reliable connections in industrial communication scenarios. In order to overcome this problem, the paper proposes an enhanced reliable access scheme (ERAS) for massive IoT applications in software-defined industrial heterogeneous networks. Based on the idea of software-defined networking (SDN), the ERAS is designed from two perspectives of the control plane and the data plane. Based on the idea of greedy algorithms, ERAS uses priority, interference set, deadline, and other information to find the local optimal solution and then obtain the global optimum. First, low-priority periodic data is accessed to the channel based on the earliest deadline. Then, high-priority data (such as control and interactive services) judges the channel occupancy status according to the access flow table, and if there is an idle channel in the current time slot, it is normally accessed. Otherwise, the subslots reserved with high priority in the control channel are used to preempt the low-priority channel. This preemption mechanism can ensure reliable and real-time connections for massive IIoT. Simulation results show that the ERAS performs better than traditional methods in terms of delay, deadline guarantee rate, and packet loss rate.

show abstract

A dynamic slot assignment algorithm of TDMA for the distribution class protocol using node neighborhood information

Cited by 12 publications

References 7 publications

A low delay dynamic distributed TDMA slot allocation algorithm for ad hoc networks

A low delay dynamic distributed TDMA slot allocation algorithm for ad hoc networks

NPB-DTDMA: a node priority-based dynamic TDMA algorithm based on the usage proportion of sending queue

An Enhanced Reliable Access Scheme for Massive IoT Applications in Ubiquitous IoT Systems

Contact Info

Product

Resources

About