Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Constructions of Control Sequence Set for Hierarchical Access in Data Link Network

Niu Xianhua, Ma Jiabei, Zhou Enzhi, Wang Yaoxuan, Zeng Bosen, Li Zhiping

TL;DR

This paper addresses differentiated access in data-link networks using TDMA by introducing Hierarchical Control Sequences (HCS) to allocate time slots across multiple access levels. It derives a new theoretical bound relating the frame size $t$, number of levels $\lambda$, and per-level parameters $(r_i,u_i)$, and provides two optimal constructions (First and Second) that achieve zero Hamming correlation and full slot utilization under the bound. An Access Protocol Based on HCS (SAC) enables hierarchical, random, and secure access with conflict-free transmission, and performance evaluations via parameter comparisons and SER simulations demonstrate improved anti-interference and throughput compared to fixed-slot schemes. The results indicate that longer HCS provide stronger interference resilience, making HCS well-suited for high-priority, real-time data in differentiated-access data-link networks.

Abstract

Time slots are a valuable channel resource in the data link network with time division multiple access architecture. The need for finding a secure and efficient way to meet the requirements of large access capacity, differentiated access, maximum utilization of time slot resource and strong anti-eavesdropping ability in data link networks is well motivated.In this paper, a control sequence-based hierarchical access control scheme is proposed, which not only achieves differentiated time slots allocation for the different needs and levels of nodes, but also enhances randomness and anti-interception performance in data link networks.Based on the scheme, a new theoretical bound is derived to characterize parameter relationships for designing optimal hierarchical control sequence(HCS) set. Moreover, two flexible classes of optimal hierarchical control sequence sets are constructed.By our construction, the terminal user in the data link can access hierarchically and randomly and transmit data packets during its own hopping time slots of the successive frames to prevent eavesdropping while maintaining high throughput.

Constructions of Control Sequence Set for Hierarchical Access in Data Link Network

TL;DR

This paper addresses differentiated access in data-link networks using TDMA by introducing Hierarchical Control Sequences (HCS) to allocate time slots across multiple access levels. It derives a new theoretical bound relating the frame size , number of levels , and per-level parameters , and provides two optimal constructions (First and Second) that achieve zero Hamming correlation and full slot utilization under the bound. An Access Protocol Based on HCS (SAC) enables hierarchical, random, and secure access with conflict-free transmission, and performance evaluations via parameter comparisons and SER simulations demonstrate improved anti-interference and throughput compared to fixed-slot schemes. The results indicate that longer HCS provide stronger interference resilience, making HCS well-suited for high-priority, real-time data in differentiated-access data-link networks.

Abstract

Time slots are a valuable channel resource in the data link network with time division multiple access architecture. The need for finding a secure and efficient way to meet the requirements of large access capacity, differentiated access, maximum utilization of time slot resource and strong anti-eavesdropping ability in data link networks is well motivated.In this paper, a control sequence-based hierarchical access control scheme is proposed, which not only achieves differentiated time slots allocation for the different needs and levels of nodes, but also enhances randomness and anti-interception performance in data link networks.Based on the scheme, a new theoretical bound is derived to characterize parameter relationships for designing optimal hierarchical control sequence(HCS) set. Moreover, two flexible classes of optimal hierarchical control sequence sets are constructed.By our construction, the terminal user in the data link can access hierarchically and randomly and transmit data packets during its own hopping time slots of the successive frames to prevent eavesdropping while maintaining high throughput.
Paper Structure (13 sections, 5 theorems, 35 equations, 6 figures, 4 tables, 2 algorithms)

This paper contains 13 sections, 5 theorems, 35 equations, 6 figures, 4 tables, 2 algorithms.

Table of Contents

  1. Introduction
  2. Access in Data Link
  3. Notations and Definitions
  4. New Hierarchical Access Control Model
  5. Theoretical Bound
  6. Constructions of HCS Set
  7. The First Construction
  8. The Second Construction
  9. Access Control Protocol Based on HCS
  10. Performance Evaluation of HCS
  11. Sequence Parameters Comparison
  12. Simulation Results
  13. Conclusions

Key Result

Theorem 1

If there are $\emph{t}$ time slots in a time frame and $\lambda$ levels, for any level $i(0 \leq i \leq \lambda-1)$ and the number of users with level $i$, we have

Figures (6)

  • Figure 1: Data Link Networks
  • Figure 2: Hierarchical Access Control Model.
  • Figure 3: Feasible and optimal number of users with three access levels
  • Figure 4: Access to the group in data link. The solid line represents that the node has been entered, while the dotted line indicates that the node is applying for access in.
  • Figure 5: The SER under the case of single-interference
  • ...and 1 more figures

Theorems & Definitions (12)

  • Definition 1
  • Definition 2
  • Theorem 1
  • Proof 1
  • Theorem 2
  • Proof 2
  • Theorem 3
  • Proof 3
  • Theorem 4
  • Proof 4
  • ...and 2 more