17 September 2024 in IEEE Signal Processing Letters
Because of the equilibrium between mathematical tractability and approximation accuracy maintained by the inverse Gaussian (IG) distributional model, it has been regarded as the most appropriate approximation substitute for the lognormal distributional model for shadowed and atmospheric turbulence induced (ATI) fading in the past decades. In this paper, we conduct an in-depth information-theoretic analysis for the lognormal-to-IG channel model substitution (CMS) technique and study its parametric mapping optimality achieved by minimizing the Kullback-Leibler (K-L) divergence between the two distributional models. In this way, we rigorously prove that the moment matching criterion produces the optimal IG substitute for lognormal reference distributions, which has never been observed in other CMS techniques. In addition, we clarify a myth in the realm of CMS that the IG substitute outperforms the gamma substitute for approximating lognormal reference distributions; instead, the substitution superiority shall depend on the parametric mapping criterion and the scale parameter of the lognormal reference distribution. All analytical insights presented in this paper are validated by simulation results.
7 July 2025 in IEEE Transactions on Mobile Computing
Direct acyclic graph (DAG)-based ledgers and distributed consensus algorithms have been proposed for use in the Internet of Things (IoT). The DAG-based ledgers have many advantages over single-chain blockchains, such as low resource consumption, low transaction fee, high transaction throughput, and short confirmation delay. However, the scalability of the DAG consensus has not been comprehensively verified on a large scale. This paper explores the scalability of DAG consensus within the low-to-high load regime (L2HR) using the tangle model, where L2HR characterizes the transition from a phase of low network load to another phase of high network load. In particular, we determine the average number of tips in the tangle in L2HR when adopting the uniform random tip selection (URTS) and rigorously prove that using the tangle model, the average number of tips at the end of L2HR converges to a constant. We also analyze the probability that a transaction in L2HR becomes an abandoned tip, the approximate average time required for the network load to transition from low load regime (LR) to high load regime (HR), and the average time required for a tip being approved for the first time in L2HR. All analytics are verified by numerical simulations.
6 November 2024 in IEEE Internet of Things Journal
The imminent deployment of sixth-generation (6G) wireless communication systems promises new opportunities and challenges for model training using data from the edge devices in the Internet of Things (IoT). However, current research has yet to fully address the efficiency and scalability challenges arising from the extensive connectivity of edge devices across various scenarios. The presence of malicious devices further intensifies the system uncertainty during large-scale data interactions and model training, making it difficult for a single model to effectively manage the complexities introduced by heterogeneous devices and dynamic network conditions. To overcome these challenges, we propose FedSC, an innovative edge computing framework that leverages side-chain technology for efficient edge node management and employs federated learning to enable robust cross-device and cross-scenario model interactions. To accelerate the multimodel aggregation process, we introduce an asynchronous cross-domain iterative algorithm (ACDI) based on smart contracts. Additionally, to mitigate the impact of malicious and inactive nodes, we propose a robust consensus algorithm and a committee mechanism for leader node election based on contribution value. Experimental results demonstrate that the proposed FedSC achieves a 3.2% and 44.23% accuracy improvement on i.i.d. and non-i.i.d. dataset, respectively, along with a remarkable latency reduction of 256.51%, compared to FedAvg. Our work is conducive to the training of multiple models in different IoT scenarios, utilizing substantial amounts of IoT device data and facilitating collaboration between models. Furthermore, it enables the provision of fundamental services to diverse applications in 6G.
24 February 2026 in IEEE Transactions on Vehicular Technology
Channel model substitution (CMS) has been shown to be a powerful toolkit for maintaining the equilibrium between the accuracy and mathematical tractability of channel models for complex analysis and optimization. To enable statistically robust parametric mapping for CMS applications, we generalize and study the Cramér-von Mises (C-V) criterion based parametric mapping in this paper. The C-V criterion seeks the optimal parametric mapping relations by minimizing the integrated squared error (ISE) between the cumulative distribution functions (CDFs) of the reference channel model and its distributional substitute. We analyze the corresponding parametric mapping problem based on the C-V criterion and rigorously prove several key analytical attributes. By taking the CMS techniques for the lognormal shadowed channel model as examples, we verify the generic analysis and illustrate the advantages of the C-V criterion based CMS parametric mapping over those enabled by classical moment matching (MM), Kullback-Leibler (K-L), and Kolmogorov-Smirnov (K-S) criteria. The proven lemmas and attributes for the C-V criterion based parametric mapping in this paper serve as a solid mathematical foundation for applying the C-V criterion to other more sophisticated CMS applications.