Tan F. Wong

Tan F. Wong

Auto-generated profile, based on publicly available information

Tan F. Wong

Department of Electrical and Computer Engineering, University of Florida, Gainesville, FL, USA

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 May 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
GZGuangyu Zhu
Guangyu Zhu
YDYiqin Deng
Yiqin Deng
Xianhao ChenXianhao Chen
Xianhao Chen
HZHaixia Zhang
Haixia Zhang
YFYuguang Fang
Yuguang Fang
TWTan F. Wong
Tan F. Wong
Federated learning (FL) allows multiple parties (distributed devices) to train a machine learning model without sharing raw data. How to effectively and efficiently utilize the resources on devices and the central server is a highly interesting yet challenging problem. In this article, we propose an efficient split FL (ESFL) algorithm to take full advantage of the powerful computing capabilities at a central server under a split FL framework with heterogeneous end devices (EDs). By splitting the model into different submodels between the server and EDs, our approach jointly optimizes user-side workload and server-side computing resource allocation by considering users’ heterogeneity. We formulate the whole optimization problem as a mixed-integer nonlinear program, which is an NP-hard problem, and develop an iterative approach to obtain an approximate solution efficiently. Extensive simulations have been conducted to validate the significantly increased efficiency of our ESFL approach compared with standard FL, split learning, and splitfed learning.

24 December 2009 in EURASIP Journal on Wireless Communications and Networking
Verified
Journal Article
Open access
PDF file
TWTan F. Wong
Tan F. Wong
MBMatthieu Bloch
Matthieu Bloch
JSJohn M. Shea
John M. Shea
Secret sharing over the fast-fading MIMO wiretap channel is considered. A source and a destination try to share secret information over a fast-fading MIMO channel in the presence of an eavesdropper who also makes channel observations that are different from but correlated to those made by the destination. An interactive, authenticated public channel with unlimited capacity is available to the source and destination for the secret sharing process. This situation is a special case of the "channel model with wiretapper" considered by Ahlswede and Csiszár. An extension of their result to continuous channel alphabets is employed to evaluate the key capacity of the fast-fading MIMO wiretap channel. The effects of spatial dimensionality provided by the use of multiple antennas at the source, destination, and eavesdropper are then investigated.

27 January 2022 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
CWChao-Yi Wu
Chao-Yi Wu
TZTianyi Zhang
Tianyi Zhang
JLJian Li
Jian Li
TWTan F. Wong
Tan F. Wong
We consider the problem of target parameter estimation in phase modulated continuous wave (PMCW) multiple-input multiple-output (MIMO) radar systems with quantized observations. We derive the Cramér-Rao bound (CRB) for jointly estimating targets’ amplitudes, time delays, Doppler shifts, and directions. The derived bound provides an efficient method to analyze the estimation performance achieved by different quantization schemes. We also devise the maximum likelihood (ML) estimator for the considered parameters, and a direct grid-based method (DGM) is introduced to obtain the ML estimates. To obtain the ML estimates more efficiently, a two-stage scheme is proposed. In the proposed scheme, we first formulate the estimation problem as a sparse signal recovery problem and modify the sparse learning via iterative minimization (SLIM) approach to solve it. Next, a RELAX-based iterative algorithm is proposed to refine the estimates. Simulation results show that the proposed scheme can approach the CRB. Simulation results also show that using quantized observations does not affect the estimation performance significantly when the targets’ amplitudes are similar.

13 November 2002
Verified
Conference Paper
Closed access
TWT.F. Wong
T.F. Wong
JSJ.M. Shea
J.M. Shea
We examine a class of multi-dimensional parity-check (MDPC) codes that can be obtained by generalizing the single parity-check code to multiple dimensions geometrically. We demonstrate that the MDPC codes can achieve close-to-capacity performance with a simple iterative decoding algorithm in AWGN as well as bursty channels.

14 March 2013 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
YLYan Long
Yan Long
HLHongyan Li
Hongyan Li
MPMiao Pan
Miao Pan
YFYuguang Fang
Yuguang Fang
TWTan F. Wong
Tan F. Wong
In this paper, we study the problem of resource allocation in multiradio multichannel (MRMC) networks. Specifically, under the consideration of diverse quality-of-service (QoS) requirements, we propose a fair QoS-aware resource-allocation scheme for MRMC networks. In this scheme, channel allocation, multipath routing, link scheduling, and radio assignment are jointly considered. The proposed scheme is obtained by formulating the resource-allocation problem into a cross-layer network utility maximization (NUM) problem, in which resources are allocated to services with proportional fairness. To avoid oscillation among optimal solutions due to the use of multipath routing, we transform the optimization program into an equivalent program by utilizing the proximal optimization algorithm. Then, we obtain the optimal solution of the latter by the decomposition method. Numerical results show that the proposed scheme indeed achieves proportional fairness according to diverse QoS requirements while maximizing utility.

1 March 2012
Verified
Conference Paper
Closed access
EGEric Graves
Eric Graves
TWTan F. Wong
Tan F. Wong
We consider the problem of two sources wanting to share information through a potentially untrustworthy intermediary node. We assume that the two sources transmit random symbols simultaneously and that the intermediary node relays the information in the amplify-and-forward manner. We show that under a certain sufficient condition on the channel, it is possible to asymptotically detect whether or not the intermediary node is degrading the channel by sending out manipulated symbols. This can be done solely by each source examining its received distribution conditioned on what it transmitted; thus allowing for a minimally invasive approach to determining if the intermediary node is acting maliciously. More specifically, we model the potential malicious action of the intermediate node by an “attack” channel. An estimate of the attack channel is obtained from the received conditional distribution empirically observed by a source node. We show that the estimated attack channel converges in probability to the true attack channel if the intermediate node is not acting maliciously. Otherwise there is a separation between the estimated and true attacking channels with high probability. This result provides us a clear-cut criterion to determine whether the intermediate node is malicious or not.