SearcharxivSearch

arXiv subjects

Teng Joon Lim

Publications and source records attributed to Teng Joon Lim.

At least 19 recordsLinked to original sources

FedVideoMAE: Efficient Privacy-Preserving Federated Video Moderation

Short-form video moderation increasingly needs learning pipelines that protect user privacy without paying the full bandwidth and latency cost of cloud-centralized inference. We present FedVideoMAE, an on-device federated framework for video violence detection that combines self-supervised VideoMAE representations, LoRA-based parameter-efficient adaptation, client-side DP-SGD, and server-side secure aggregation. By updating only 5.5M parameters (about 3.5% of a 156M backbone), FedVideoMAE reduces communication by 28.3x relative to full-model federated updates while keeping raw videos on device throughout training. On RWF-2000 with 40 clients, the method reaches 77.25% accuracy without privacy protection and 65~66% under strong differential privacy. We further show that this privacy gap is consistent with an effective-SNR analysis tailored to the small-data, parameter-efficient federated regime, which indicates roughly 8.5~12x DP-noise amplification in our setting. To situate these results more clearly, we also compare against archived full-model federated baselines and summarize auxiliary transfer behavior on RLVS and binary UCF-Crime. Taken together, these findings position FedVideoMAE as a practical operating point for privacy-preserving video moderation on edge devices. Our code can be found at: https://github.com/zyt-599/FedVideoMAE.

cs.CV

A Multi-Drone Multi-View Dataset and Deep Learning Framework for Pedestrian Detection and Tracking

Multi-drone surveillance systems offer enhanced coverage and robustness for pedestrian tracking, yet existing approaches struggle with dynamic camera positions and complex occlusions. This paper introduces MATRIX (Multi-Aerial TRacking In compleX environments), a comprehensive dataset featuring synchronized footage from eight drones with continuously changing positions, and a novel deep learning framework for multi-view detection and tracking. Unlike existing datasets that rely on static cameras or limited drone coverage, MATRIX provides a challenging scenario with 40 pedestrians and a significant architectural obstruction in an urban environment. Our framework addresses the unique challenges of dynamic drone-based surveillance through real-time camera calibration, feature-based image registration, and multi-view feature fusion in bird's-eye-view (BEV) representation. Experimental results demonstrate that while static camera methods maintain over 90\% detection and tracking precision and accuracy metrics in a simplified MATRIX environment without an obstruction, 10 pedestrians and a much smaller observational area, their performance significantly degrades in the complex environment. Our proposed approach maintains robust performance with $\sim$90\% detection and tracking accuracy, as well as successfully tracks $\sim$80\% of trajectories under challenging conditions. Transfer learning experiments reveal strong generalization capabilities, with the pretrained model achieving much higher detection and tracking accuracy performance compared to training the model from scratch. Additionally, systematic camera dropout experiments reveal graceful performance degradation, demonstrating practical robustness for real-world deployments where camera failures may occur. The MATRIX dataset and framework provide essential benchmarks for advancing dynamic multi-view surveillance systems.

cs.CV

Wireless Resource Allocation with Collaborative Distributed and Centralized DRL under Control Channel Attacks

In this paper, we consider a wireless resource allocation problem in a cyber-physical system (CPS) where the control channel, carrying resource allocation commands, is subjected to denial-of-service (DoS) attacks. We propose a novel concept of collaborative distributed and centralized (CDC) resource allocation to effectively mitigate the impact of these attacks. To optimize the CDC resource allocation policy, we develop a new CDC-deep reinforcement learning (DRL) algorithm, whereas existing DRL frameworks only formulate either centralized or distributed decision-making problems. Simulation results demonstrate that the CDC-DRL algorithm significantly outperforms state-of-the-art DRL benchmarks, showcasing its ability to address resource allocation problems in large-scale CPSs under control channel attacks.

cs.IT

Resource-Efficient Multiview Perception: Integrating Semantic Masking with Masked Autoencoders

Multiview systems have become a key technology in modern computer vision, offering advanced capabilities in scene understanding and analysis. However, these systems face critical challenges in bandwidth limitations and computational constraints, particularly for resource-limited camera nodes like drones. This paper presents a novel approach for communication-efficient distributed multiview detection and tracking using masked autoencoders (MAEs). We introduce a semantic-guided masking strategy that leverages pre-trained segmentation models and a tunable power function to prioritize informative image regions. This approach, combined with an MAE, reduces communication overhead while preserving essential visual information. We evaluate our method on both virtual and real-world multiview datasets, demonstrating comparable performance in terms of detection and tracking performance metrics compared to state-of-the-art techniques, even at high masking ratios. Our selective masking algorithm outperforms random masking, maintaining higher accuracy and precision as the masking ratio increases. Furthermore, our approach achieves a significant reduction in transmission data volume compared to baseline methods, thereby balancing multiview tracking performance with communication efficiency.

cs.CV

Machine Learning-Based Early Detection of IoT Botnets Using Network-Edge Traffic

In this work, we present a lightweight IoT botnet detection solution, EDIMA, which is designed to be deployed at the edge gateway installed in home networks and targets early detection of botnets prior to the launch of an attack. EDIMA includes a novel two-stage Machine Learning (ML)-based detector developed specifically for IoT bot detection at the edge gateway. The ML-based bot detector first employs ML algorithms for aggregate traffic classification and subsequently Autocorrelation Function (ACF)-based tests to detect individual bots. The EDIMA architecture also comprises a malware traffic database, a policy engine, a feature extractor and a traffic parser. Performance evaluation results show that EDIMA achieves high bot scanning and bot-CnC traffic detection accuracies with very low false positive rates. The detection performance is also shown to be robust to an increase in the number of IoT devices connected to the edge gateway where EDIMA is deployed. Further, the runtime performance analysis of a Python implementation of EDIMA deployed on a Raspberry Pi reveals low bot detection delays and low RAM consumption. EDIMA is also shown to outperform existing detection techniques for bot scanning traffic and bot-CnC server communication.

cs.CR

Early Detection Of Mirai-Like IoT Bots In Large-Scale Networks Through Sub-Sampled Packet Traffic Analysis

The widespread adoption of Internet of Things has led to many security issues. Recently, there have been malware attacks on IoT devices, the most prominent one being that of Mirai. IoT devices such as IP cameras, DVRs and routers were compromised by the Mirai malware and later large-scale DDoS attacks were propagated using those infected devices (bots) in October 2016. In this research, we develop a network-based algorithm which can be used to detect IoT bots infected by Mirai or similar malware in large-scale networks (e.g. ISP network). The algorithm particularly targets bots scanning the network for vulnerable devices since the typical scanning phase for botnets lasts for months and the bots can be detected much before they are involved in an actual attack. We analyze the unique signatures of the Mirai malware to identify its presence in an IoT device. The prospective deployment of our bot detection solution is discussed next along with the countermeasures which can be taken post detection. Further, to optimize the usage of computational resources, we use a two-dimensional (2D) packet sampling approach, wherein we sample the packets transmitted by IoT devices both across time and across the devices. Leveraging the Mirai signatures identified and the 2D packet sampling approach, a bot detection algorithm is proposed. Subsequently, we use testbed measurements and simulations to study the relationship between bot detection delays and the sampling frequencies for device packets. Finally, we derive insights from the obtained results and use them to design our proposed bot detection algorithm.

cs.CR

EDIMA: Early Detection of IoT Malware Network Activity Using Machine Learning Techniques

The widespread adoption of Internet of Things has led to many security issues. Post the Mirai-based DDoS attack in 2016 which compromised IoT devices, a host of new malware using Mirai's leaked source code and targeting IoT devices have cropped up, e.g. Satori, Reaper, Amnesia, Masuta etc. These malware exploit software vulnerabilities to infect IoT devices instead of open TELNET ports (like Mirai) making them more difficult to block using existing solutions such as firewalls. In this research, we present EDIMA, a distributed modular solution which can be used towards the detection of IoT malware network activity in large-scale networks (e.g. ISP, enterprise networks) during the scanning/infecting phase rather than during an attack. EDIMA employs machine learning algorithms for edge devices' traffic classification, a packet traffic feature vector database, a policy module and an optional packet sub-sampling module. We evaluate the classification performance of EDIMA through testbed experiments and present the results obtained.

cs.CR

A Secure Contained Testbed for Analyzing IoT Botnets

Many security issues have come to the fore with the increasingly widespread adoption of Internet-of-Things (IoT) devices. The Mirai attack on Dyn DNS service, in which vulnerable IoT devices such as IP cameras, DVRs and routers were infected and used to propagate large-scale DDoS attacks, is one of the more prominent recent examples. IoT botnets, consisting of hundreds-of-thousands of bots, are currently present ``in-the-wild'' at least and are only expected to grow in the future, with the potential to cause significant network downtimes and financial losses to network companies. We propose, therefore, to build testbeds for evaluating IoT botnets and design suitable mitigation techniques against them. A DETERlab-based IoT botnet testbed is presented in this work. The testbed is built in a secure contained environment and includes ancillary services such as DHCP, DNS as well as botnet infrastructure including CnC and scanListen/loading servers. Developing an IoT botnet testbed presented us with some unique challenges which are different from those encountered in non-IoT botnet testbeds and we highlight them in this paper. Further, we point out the important features of our testbed and illustrate some of its capabilities through experimental results.

cs.CR

Hybrid NOMA-TDMA for Multiple Access Channels with Non-Ideal Batteries and Circuit Cost

We consider a multiple-access channel where the users are powered from batteries having non-negligible internal resistance. When power is drawn from the battery, a variable fraction of the power, which is a function of the power drawn from the battery, is lost across the internal resistance. Hence, the power delivered to the load is less than the power drawn from the battery. The users consume a constant power for the circuit operation during transmission but do not consume any power when not transmitting. In this setting, we obtain the maximum sum-rates and achievable rate regions under various cases. We show that, unlike in the ideal battery case, the TDMA (time-division multiple access) strategy, wherein the users transmit orthogonally in time, may not always achieve the maximum sum-rate when the internal resistance is non-zero. The users may need to adopt a hybrid NOMA-TDMA strategy which combines the features of NOMA (non-orthogonal multiple access) and TDMA, wherein a set of users are allocated fixed time windows for orthogonal single-user and non-orthogonal joint transmissions, respectively. We also numerically show that the maximum achievable rate regions in NOMA and TDMA strategies are contained within the maximum achievable rate region of the hybrid NOMA-TDMA strategy.

cs.IT

Layered Coding for Energy Harvesting Communication Without CSIT

Due to stringent constraints on resources, it may be infeasible to acquire the current channel state information at the transmitter in energy harvesting communication systems. In this paper, we optimize an energy harvesting transmitter, communicating over a slow fading channel, using layered coding. The transmitter has access to the channel statistics, but does not know the exact channel state. In layered coding, the codewords are first designed for each of the channel states at different rates, and then the codewords are either time-multiplexed or superimposed before the transmission, leading to two transmission strategies. The receiver then decodes the information adaptively based on the realized channel state. The transmitter is equipped with a finite-capacity battery having non-zero internal resistance. In each of the transmission strategies, we first formulate and study an average rate maximization problem with non-causal knowledge of the harvested power variations. Further, assuming statistical knowledge and causal information of the harvested power variations, we propose a sub-optimal algorithm, and compare with the stochastic dynamic programming based solution and a greedy policy.

cs.IT

Energy Harvesting Communication Using Finite-Capacity Batteries with Internal Resistance

Modern systems will increasingly rely on energy harvested from their environment. Such systems utilize batteries to smoothen out the random fluctuations in harvested energy. These fluctuations induce highly variable battery charge and discharge rates, which affect the efficiencies of practical batteries that typically have non-zero internal resistances. In this paper, we study an energy harvesting communication system using a finite battery with non-zero internal resistance. We adopt a dual-path architecture, in which harvested energy can be directly used, or stored and then used. In a frame, both time and power can be split between energy storage and data transmission. For a single frame, we derive an analytical expression for the rate optimal time and power splitting ratios between harvesting energy and transmitting data. We then optimize the time and power splitting ratios for a group of frames, assuming non-causal knowledge of harvested power and fading channel gains, by giving an approximate solution. When only the statistics of the energy arrivals and channel gains are known, we derive a dynamic programming based policy and, propose three sub-optimal policies, which are shown to perform competitively. In summary, our study suggests that battery internal resistance significantly impacts the design and performance of energy harvesting communication systems and must be taken into account.

cs.IT

Placement Optimization of UAV-Mounted Mobile Base Stations

In terrestrial communication networks without fixed infrastructure, unmanned aerial vehicle (UAV)-mounted mobile base stations (MBSs) provide an efficient solution to achieve wireless connectivity. This letter aims to minimize the number of MBSs needed to provide wireless coverage for a group of distributed ground terminals (GTs), ensuring that each GT is within the communication range of at least one MBS. We propose a polynomial-time algorithm with successive MBS placement, where the MBSs are placed sequentially starting on the area perimeter of the uncovered GTs along a spiral path towards the center, until all GTs are covered. Each MBS is placed to cover as many uncovered GTs as possible, with higher priority given to the GTs on the boundary to reduce the occurrence of outlier GTs that each may require one dedicated MBS for its coverage. Numerical results show that the proposed algorithm performs favorably compared to other schemes in terms of the total number of required MBSs and/or time complexity.

cs.IT

Constant Envelope Precoding for MIMO Systems

Constant envelope (CE) precoding is an appealing transmission technique, which enables highly efficient power amplification, and is realizable with a single radio frequency (RF) chain at the multi-antenna transmitter. In this paper, we study the transceiver design for a point-to-point multiple-input multiple-output (MIMO) system with CE precoding. Both single-stream transmission (i.e., beamforming) and multi-stream transmission (i.e., spatial multiplexing) are considered. For single-stream transmission, we optimize the receive beamforming vector to minimize the symbol error rate (SER) for any given channel realization and desired constellation at the combiner output. By reformulating the problem as an equivalent quadratically constrained quadratic program (QCQP), we propose an efficient semi-definite relaxation (SDR) based algorithm to find an approximate solution. Next, for multi-stream transmission, we propose a new scheme based on antenna grouping at the transmitter and minimum mean squared error (MMSE) or zero-forcing (ZF) based beamforming at the receiver. The transmit antenna grouping and receive beamforming vectors are then jointly designed to minimize the maximum SER over all data streams. Finally, the error-rate performance of single- versus multi-stream transmission is compared via simulations under different setups.

cs.IT

Constant Envelope Precoding with Adaptive Receiver Constellation in MISO Fading Channel

Constant envelope (CE) precoding is an appealing transmission technique which enables the realization of high power amplifier (PA) efficiency. For CE precoding in a single-user multiple-input single-output (MISO) channel, a desired constellation is feasible at the receiver if and only if it can be scaled to lie in an annulus, whose boundaries are characterized by the instantaneous channel realization. Therefore, if a fixed receiver constellation is used for CE precoding in a fading channel, where the annulus is time-varying, there is in general a non-zero probability of encountering a channel that makes CE precoding infeasible, thereby causing a high probability of error. To tackle this problem, this paper studies the adaptive receiver constellation design for CE precoding in a single-user MISO flat-fading channel with an arbitrary number of antennas at the transmitter. We first investigate the fixed-rate adaptive receiver constellation design to minimize the symbol error rate (SER). Specifically, an efficient algorithm is proposed to find the optimal amplitude-and-phase shift keying (APSK) constellation with two rings that is both feasible and of the maximum minimum Euclidean distance (MED), for any given constellation size and instantaneous channel realization. Numerical results show that by using the optimized fixed-rate adaptive receiver constellation, our proposed scheme achieves significantly improved SER performance over CE precoding with a fixed receiver constellation. Furthermore, based on the family of optimal fixed-rate adaptive two-ring APSK constellation sets, a variable-rate CE transmission scheme is proposed and numerically examined.

cs.IT

Throughput Maximization for Mobile Relaying Systems

Relaying is an effective technique to achieve reliable wireless connectivity in harsh communication environment. However, most of the existing relaying schemes are based on relays with fixed locations, or \emph{static relaying}. In this paper, we consider a novel \emph{mobile relaying} technique, where the relay nodes are assumed to be capable of moving at high speed. Compared to static relaying, mobile relaying offers a new degree of freedom for performance enhancement via careful relay trajectory design. We study the throughput maximization problem in mobile relaying systems by optimizing the source/relay transmit power along with the relay trajectory, subject to practical mobility constraints (on the relay speed and initial/final relay locations), as well as the \emph{information-causality constraint} at the relay owing to its decode-store-and-forward (DSF) strategy. It is shown that for fixed relay trajectory, the throughput-optimal source/relay power allocations over time follow a "staircase" water filling (WF) structure, with \emph{non-increasing} and \emph{non-decreasing} water levels at the source and relay, respectively. On the other hand, with given power allocations, the throughput can be further improved by optimizing the relay trajectory via successive convex optimization. An iterative algorithm is thus proposed to optimize the power allocations and relay trajectory alternately. Furthermore, for the special case with free initial and final relay locations, the jointly optimal power allocation and relay trajectory are derived. Numerical results show that by optimizing the trajectory of the relay and power allocations adaptive to its induced channel variation, mobile relaying is able to achieve significant throughput gains over the conventional static relaying.

cs.IT

Wireless Communications with Unmanned Aerial Vehicles: Opportunities and Challenges

Wireless communication systems that include unmanned aerial vehicles (UAVs) promise to provide cost-effective wireless connectivity for devices without infrastructure coverage. Compared to terrestrial communications or those based on high-altitude platforms (HAPs), on-demand wireless systems with low-altitude UAVs are in general faster to deploy, more flexibly re-configured, and are likely to have better communication channels due to the presence of short-range line-of-sight (LoS) links. However, the utilization of highly mobile and energy-constrained UAVs for wireless communications also introduces many new challenges. In this article, we provide an overview of UAV-aided wireless communications, by introducing the basic networking architecture and main channel characteristics, highlighting the key design considerations as well as the new opportunities to be exploited.

cs.IT

Throughput Maximization for Mobile Relaying Systems

This paper studies a novel mobile relaying technique, where relays of high mobility are employed to assist the communications from source to destination. By exploiting the predictable channel variations introduced by relay mobility, we study the throughput maximization problem in a mobile relaying system via dynamic rate and power allocations at the source and relay. An optimization problem is formulated for a finite time horizon, subject to an information-causality constraint, which results from the data buffering employed at the relay. It is found that the optimal power allocations across the different time slots follow a "stair-case" water filling (WF) structure, with non-increasing and non-decreasing water levels at the source and relay, respectively. For the special case where the relay moves unidirectionally from source to destination, the optimal power allocations reduce to the conventional WF with constant water levels. Numerical results show that with appropriate trajectory design, mobile relaying is able to achieve tremendous throughput gain over the conventional static relaying.

cs.IT

Capacity Region of MISO Broadcast Channel for Simultaneous Wireless Information and Power Transfer

This paper studies a multiple-input single-output (MISO) broadcast channel (BC) featuring simultaneous wireless information and power transfer (SWIPT), where a multi-antenna access point (AP) delivers both information and energy via radio signals to multiple single-antenna receivers simultaneously, and each receiver implements either information decoding (ID) or energy harvesting (EH). In particular, pseudo-random sequences that are {\it a priori} known and therefore can be cancelled at each ID receiver is used as the energy signals, and the information-theoretically optimal dirty paper coding (DPC) is employed for the information transmission. We characterize the capacity region for ID receivers under given energy requirements for EH receivers, by solving a sequence of weighted sum-rate (WSR) maximization (WSRMax) problems subject to a maximum sum-power constraint for the AP, and a set of minimum harvested power constraints for individual EH receivers. The problem corresponds to a new form of WSRMax problem in MISO-BC with combined maximum and minimum linear transmit covariance constraints (MaxLTCCs and MinLTCCs), which differs from the celebrated capacity region characterization problem for MISO-BC under a set of MaxLTCCs only and is challenging to solve. By extending the general BC-multiple access channel (MAC) duality, which is only applicable to WSRMax problems with MaxLTCCs, and applying the ellipsoid method, we propose an efficient algorithm to solve this problem globally optimally. Furthermore, we also propose two suboptimal algorithms with lower complexity by assuming that the information and energy signals are designed separately. Finally, numerical results are provided to validate our proposed algorithms.

cs.IT