Searcharxiv⌕ Search

arXiv subjects

Justin Kong

Publications and source records attributed to Justin Kong.

7 recordsLinked to original sources
arXiv2026

Biased Backpressure Routing for Multihop Wireless Networks with Heterogeneous Interfaces

Heterogeneous-interface multihop wireless networks (Het-MuNets) are emerging as a promising paradigm for tactical networks and for infrastructure-light applications such as vehicular communications, wireless backhaul, and non-terrestrial connectivity. To exploit the diverse profiles of heterogeneous communication technologies in penetration, interference, and bandwidth, packet-to-interface assignment must be determined on a per-hop basis, making routing and scheduling highly complex. In this work, we develop a unified framework for joint packet routing, link scheduling, and interface assignment in Het-MuNets with multiple concurrent flows. By modeling packet-to-interface assignment as transmission between virtual subnodes, we transform interface assignment into intra-device virtual routing, which is solved jointly with physical routing and scheduling under a unified multi-layer shortest path-biased Backpressure (SP-BP) scheme. Numerical results demonstrate that the proposed framework outperforms SP-BP operating on other baseline graph models and non-backpressure routing schemes in goodput, latency, and packet delivery rate.

cs.NI↗
arXiv2026

Optimal Routing and Link Configuration for Covert Heterogeneous Wireless Networks in the Presence of a Friendly Jammer

In modern radio networks, nodes frequently access multiple communication interfaces such as WiFi, cellular, LoRa, and Zigbee. Optimal utilization of such heterogeneous networks (HetNets) at link and network levels is essential for ensuring efficient and secure communication. Some applications require a high level of security, requiring the signal to be completely undetectable. Previous works have considered such covertness, but it often results in limited achievable rates. Physical layer analysis shows that friendly jamming can significantly improve covert data rates, motivating its incorporation into HetNets. Here, we analyze a scenario where a jammer assists communication in a HetNet in the presence of an adversary attempting signal detection. We first optimize the physical layer (PHY) for a single link and then incorporate those results into an optimal routing and link configuration approach that accounts for an adversary observing the aggregate signals from all links. Numerical results demonstrate significant performance gains when compared to alternative approaches. In fact, the rate observed for the proposed approach is high enough to question the optimality of the low rate design approach employed; we address this concern through revised algorithms and characterize their performance.

eess.SP↗
arXiv2026

Covert Routing with DSSS Signaling Against Cycle Detectors

This paper investigates covert multi-hop communication in wireless networks where an adversary employs a cyclostationary (cycle) detector to reveal hidden transmissions. The covert route employs direct sequence spread spectrum (DSSS) signaling to ensure either maximum end-to-end covertness maximization or minimum latency minimization-under quality-of-service (QoS) and link budget constraints. Optimal bandwidth, transmit power, and spreading gain for each hop jointly satisfy reliability and either rate or covertness requirements. We show the equivalence between the covertness and the detection SNR gain-based widest-path formulations, and, hence, enabling efficient route computation. Numerical simulations in a realistic 3D environment illustrate that (i) end-to-end latency increases exponentially with the covertness requirement, (ii) the end-to-end latency increase is super-linear with the packet size M, and (iii) cycle and energy detectors impose different latency behavior as a function of the message length and the covertness requirement. The proposed framework provides important insights into resource allocation and routing design for covert networks against advanced detection adversaries.

eess.SP↗
arXiv2024

Decentralized Covert Routing in Heterogeneous Networks Using Reinforcement Learning

This letter investigates covert routing communications in a heterogeneous network where a source transmits confidential data to a destination with the aid of relaying nodes where each transmitter judiciously chooses one modality among multiple communication modalities. We develop a novel reinforcement learning-based covert routing algorithm that finds a route from the source to the destination where each node identifies its next hop and modality only based on the local feedback information received from its neighboring nodes. We show based on numerical simulations that the proposed covert routing strategy has only negligible performance loss compared to the optimal centralized routing scheme.

cs.NI↗
arXiv2017

Ulam Sphere Size Analysis for Permutation and Multipermutation Codes Correcting Translocation Errors

Permutation and multipermutation codes in the Ulam metric have been suggested for use in non-volatile memory storage systems such as flash memory devices. In this paper we introduce a new method to calculate permutation sphere sizes in the Ulam metric using Young Tableaux and prove the non-existence of non-trivial perfect permutation codes in the Ulam metric. We then extend the study to multipermutations, providing tight upper and lower bounds on multipermutation Ulam sphere sizes and resulting upper and lower bounds on the maximal size of multipermutation codes in the Ulam metric.

cs.IT↗
arXiv2017

Multipermutation Ulam Sphere Analysis Toward Characterizing Maximal Code Size

Permutation codes, in the form of rank modulation, have shown promise for applications such as flash memory. One of the metrics recently suggested as appropriate for rank modulation is the Ulam metric, which measures the minimum translocation distance between permutations. Multipermutation codes have also been proposed as a generalization of permutation codes that would improve code size (and consequently the code rate). In this paper we analyze the Ulam metric in the context of multipermutations, noting some similarities and differences between the Ulam metric in the context of permutations. We also consider sphere sizes for multipermutations under the Ulam metric and resulting bounds on code size.

cs.IT↗