Yuming Jiang

Yuming Jiang

Auto-generated profile, based on publicly available information

Yuming Jiang

Department of Information Security and Communication Technology NTNU Norwegian University of Science and Technology

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
27 September 2018 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
Zhidu LiZhidu Li
Zhidu Li
YJYuming Jiang
Yuming Jiang
YGYuehong Gao
Yuehong Gao
LSLin Sang
Lin Sang
DYDacheng Yang
Dacheng Yang
In this paper, the buffer-constrained throughput performance of a multi-user wireless-powered communication (WPC) system is investigated, where energy harvesting follows a non-linear model. The investigation focuses on the buffer overflow performance of sending data in the downlink (DL) from the access point (AP) node to each user equipment (UE) node and that in the uplink from each UE node to the AP node, based on which the throughput performance on both directions when a buffer constraint is enforced is studied. Specifically, the buffer overflow probability at each node is analyzed, based on which the buffer-constrained throughput is studied. In addition, to ensure the throughput performance under the buffer constraint, the DL transmission power allocation policy and the required energy storage capacity at each UE are investigated. Also, the optimal channel time allocation policy is studied with the objective of maximizing the minimum buffer-constrained throughput guaranteed to each UE at the same time. To this aim, an optimization problem is first formulated and then a dichotomy-based time allocation algorithm combined with a one-dimensional search is proposed to solve this problem. The analysis and results, explicitly relating the throughput to the buffer constraint in addition to WPC characteristics, shed new light on the design and performance analysis of WPC systems.

24 January 2018 in arXiv
Verified
Preprint
Open access
PDF file
KKKatina Kralevska
Katina Kralevska
DVDimitrios J. Vergados
Dimitrios J. Vergados
YJYuming Jiang
Yuming Jiang
AMAngelos Michalas
Angelos Michalas
The recently created IETF 6TiSCH working group combines the high reliability and low-energy consumption of IEEE 802.15.4e Time Slotted Channel Hopping with IPv6 for industrial Internet of Things. We propose a distributed link scheduling algorithm, called Local Voting, for 6TiSCH networks that adapts the schedule to the network conditions. The algorithm tries to equalize the link load (defined as the ratio of the queue length over the number of allocated cells) through cell reallocation. Local Voting calculates the number of cells to be added or released by the 6TiSCH Operation Sublayer (6top). Compared to a representative algorithm from the literature, Local Voting provides simultaneously high reliability and low end-to-end latency while consuming significantly less energy. Its performance has been examined and compared to On-the-fly algorithm in 6TiSCH simulator by modeling an industrial environment with 50 sensors.

5 December 2019 in arXiv
Verified
Preprint
Open access
PDF file
DVDimitrios J. Vergados
Dimitrios J. Vergados
KKKatina Kralevska
Katina Kralevska
YJYuming Jiang
Yuming Jiang
AMAngelos Michalas
Angelos Michalas
The IETF 6TiSCH working group fosters the adaptation of IPv6-based protocols into Internet of Things by introducing the 6TiSCH Operation Sublayer (6top). The 6TiSCH architecture integrates the high reliability and low-energy consumption of IEEE 802.15.4e Time Slotted Channel Hopping (TSCH) with IPv6. IEEE 802.15.4e TSCH defines only the communication between nodes through a schedule but it does not specify how the resources are allocated for communication between the nodes in 6TiSCH networks. We propose a distributed algorithm for bandwidth allocation, called Local Voting, that adapts the schedule to the network conditions. The algorithm tries to equalize the link load (defined as the ratio of the queue length plus the new packet arrivals, over the number of allocated cells) through cell reallocation by calculating the number of cells to be added or released by 6top. Simulation results show that equalizing the load throughout 6TiSCH network provides better fairness in terms of load, reduces the queue sizes and packets reach the root faster compared to representative algorithms from the literature. Local Voting combines good delay performance and energy efficiency that are crucial features for Industrial Internet-of-Things applications.