Tongxin Zhu

Tongxin Zhu

Auto-generated profile, based on publicly available information

Tongxin Zhu

School of Computer Science and Engineering, Southeast University, Nanjing, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
9 October 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
TZTongxin Zhu
Tongxin Zhu
TSTuo Shi
Tuo Shi
JLJianzhong Li
Jianzhong Li
ZCZhipeng Cai
Zhipeng Cai
XZXun Zhou
Xun Zhou
Mobile Edge Computing(MEC) is a new computing approach in which computation tasks carried by Mobile Devices (MD) can be offloaded to MEC servers or computed locally. Since the mobile devices are always battery limited and computation tasks have strict deadlines, how to schedule the execution of each task energy effectively is important. Comparing with existing works, we consider a much more complexed scenario, in which multiple moving mobile devices sharing multiple heterogeneous MEC servers, and a problem named as Minimum Energy Consumption problem in Deadline-aware MEC system is formulated. Such problem is proved to be NP-Hard, and two approximation algorithms are proposed focusing on single and multiple MD scenarios, respectively. The performances of these algorithms are varied by theoretical analysis and simulations.

15 November 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
ZCZhipeng Cai
Zhipeng Cai
QCQuan Chen
Quan Chen
TSTuo Shi
Tuo Shi
TZTongxin Zhu
Tongxin Zhu
KCKunyi Chen
Kunyi Chen
YLYingshu Li
Yingshu Li
Battery-free wireless sensor network (including energy harvesting network and energy rechargeable network) is a new network architecture that has been proposed in recent years to solve the lifetime limitation problem of conventional wireless sensor networks. Battery-free sensor nodes can harvest energy from environmental energy resources or from artificial power stations. Thus, the lifetime of a battery-free wireless sensor network is unlimited in terms of energy. The specific properties of battery-free wireless sensor networks have brought new challenges in fundamental issues, such as energy management, networking and data acquisition, which means the existing algorithms in wireless sensor networks cannot be adopted directly. The battery-free wireless sensor network can be regarded as a totally new topic in IoT and has attracted much attention from researchers. Many algorithms have been proposed to solve the fundamental problems in battery-free wireless sensor networks. The objective of this survey is to comprehensively summarize and analyze the existing works. In this survey, we first introduce the existing algorithms from three fundamental aspects including energy management, networking and data acquisition. Then we present some specific applications of battery-free wireless sensor networks.

19 August 2021 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
TZTongxin Zhu
Tongxin Zhu
JLJianzhong Li
Jianzhong Li
HGHong Gao
Hong Gao
YLYingshu Li
Yingshu Li
ZCZhipeng Cai
Zhipeng Cai
Age of Information (AoI) is a new metric for measuring the freshness of sensory data in wireless sensor networks. The Battery-Free Wireless Sensor Network (BF-WSN) is proposed to break through the lifetime limitation of battery-powered wireless sensor networks. However, the emerging BF-WSN also brings challenges to the minimization of AoI, on account of its energy characteristics. In this paper, we investigate the AoI minimization data collection scheduling problem for BF-WSNs. The off-the-shelf works for the AoI minimization data collection scheduling problem either focus on simple networks with no more than three nodes or assume that battery-free sensor nodes have specific energy harvesting process, such as Bernoulli process and Poisson process. Different from these works, we first consider the AoI minimization data collection scheduling for one-hop BF-WSNs with multiple battery-free sensor nodes transmitting their sensory data to the sink node, where the energy harvesting processes of battery-free sensor nodes are non-specific. We propose the optimal offline algorithm and the online algorithm for the problem, respectively. The optimality of the offline algorithm and the competitive ratio of the online algorithm are theoretical proved and analyzed. Numerical results are provided to verify the performances of the proposed algorithms.

30 August 2024 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
JGJuwei Guan
Juwei Guan
XFXiaolin Fang
Xiaolin Fang
TZTongxin Zhu
Tongxin Zhu
ZCZhipeng Cai
Zhipeng Cai
ZLZhen Ling
Zhen Ling
JLJunzhou Luo
Junzhou Luo
Camouflaged objects often blend in with their surroundings, making the perception of a camouflaged object a more complex procedure. However, most neural-network-based methods that simulate the visual information processing pathway of creatures only roughly define the general process, which deficiently reproduces the process of identifying camouflaged objects. How to make modeled neural networks perceive camouflaged objects as effectively as creatures is a significant topic that deserves further consideration. After meticulous analysis of biological visual information processing, we propose an end-to-end prudent and comprehensive neural network, termed IdeNet, to model the critical information processing. Specifically, IdeNet divides the entire perception process into five stages: information collection, information augmentation, information filtering, information localization, and information correction and object identification. In addition, we design tailored visual information processing mechanisms for each stage, including the information augmentation module (IAM), the information filtering module (IFM), the information localization module (ILM), and the information correction module (ICM), to model the critical visual information processing and establish the inextricable association of biological behavior and visual information processing. The extensive experiments show that IdeNet outperforms state-of-the-art methods in all benchmarks, demonstrating the effectiveness of the five-stage partitioning of visual information processing pathway and the tailored visual information processing mechanisms for camouflaged object detection. Our code is publicly available at: https://github.com/whyandbecause/IdeNet.

25 May 2020 in ACM Transactions on Sensor Networks
Verified
Journal Article
Open access
TZTongxin Zhu
Tongxin Zhu
JLJianzhong Li
Jianzhong Li
HGHong Gao
Hong Gao
YLYingshu Li
Yingshu Li
The lifetime of battery-powered Wireless Sensor Networks (WSNs) are limited by the batteries equipped in sensors. The appearance of Battery-free Wireless Sensor Networks (BF-WSNs) breaks through this limitation, in which battery-free sensors harvest energy from sustainable but uncontrollable energy sources in ambient environment, such as solar power, wind power, radio frequency signal power, and so on. The energy characteristics of BF-WSNs make it more challenging for data collection scheduling in BF-WSNs. Latency of data collection is a crucial measurement to evaluate the performance of data collection schedules. In this article, we study the problem of generating data collection schedules with minimum latency for BF-WSNs and propose latency-efficient data collection scheduling algorithms for line BF-WSNs and general BF-WSNs, respectively. Theoretical analysis and extensive simulations are conducted to verify the efficiency and effectiveness of the proposed algorithms.

3 November 2020 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
TZTongxin Zhu
Tongxin Zhu
JLJianzhong Li
Jianzhong Li
HGHong Gao
Hong Gao
YLYingshu Li
Yingshu Li
To break through the limitation of battery-powered wireless sensor networks, a novel kind of network, named battery-free wireless sensor network (BF-WSN), is proposed. Battery-free sensor nodes in BF-WSNs harvest energy from power sources in their ambient environment, such as solar power, wind power and radio frequency (RF) signal power, etc. , instead of batteries. Therefore, the energy consumption of battery-free sensor nodes are not limited by the battery capacity anymore. However, they still have limited energy harvesting rates and energy capacities. Data aggregation is a fundamental operation in sensor networks where the sensory data gathered by the relay nodes can be merged by in-network computation, such as taking the maximum, average, or sum, etc., of them. Due to the energy features of BF-WSNs, the data aggregation scheduling problem in BF-WSNs is more complicated and the previous aggregation scheduling algorithms designed for battery-powered WSNs are no longer applicable. This paper investigates the Minimum-Latency Aggregation Scheduling problem in BF-WSNs, which is proved to be NP-hard. Then, we propose the Data Aggregation Scheduling algorithm to solve the problem. Finally, the theoretical analysis and extensive simulation results are provided to verify the performance of the proposed algorithm.