Jiaqing Huang

Prof. Jiaqing Huang


Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
20 April 2017 in Sensors
Verified
Journal Article
Open access
PDF file
AUAlfred Uwitonze
Alfred Uwitonze
JHJiaqing Huang
Jiaqing Huang
YYYuanqing Ye
Yuanqing Ye
WCWenqing Cheng
Wenqing Cheng
The problem of finding the number and optimal positions of relay nodes for restoring the network connectivity in partitioned Wireless Sensor Networks (WSNs) is Non-deterministic Polynomial-time hard (NP-hard) and thus heuristic methods are preferred to solve it. This paper proposes a novel polynomial time heuristic algorithm, namely, Relay Placement using Space Network Coding (RPSNC), to solve this problem, where Space Network Coding, also called Space Information Flow (SIF), is a new research paradigm that studies network coding in Euclidean space, in which extra relay nodes can be introduced to reduce the cost of communication. Unlike contemporary schemes that are often based on Minimum Spanning Tree (MST), Euclidean Steiner Minimal Tree (ESMT) or a combination of MST with ESMT, RPSNC is a new min-cost multicast space network coding approach that combines Delaunay triangulation and non-uniform partitioning techniques for generating a number of candidate relay nodes, and then linear programming is applied for choosing the optimal relay nodes and computing their connection links with terminals. Subsequently, an equilibrium method is used to refine the locations of the optimal relay nodes, by moving them to balanced positions. RPSNC can adapt to any density distribution of relay nodes and terminals, as well as any density distribution of terminals. The performance and complexity of RPSNC are analyzed and its performance is validated through simulation experiments.

19 May 2012
Verified
Book Chapter
Closed access
PDF file
JHJiaqing Huang
Jiaqing Huang
QLQingyuan Liu
Qingyuan Liu
ZLZhibin Lei
Zhibin Lei
DCDah Ming Chiu
Dah Ming Chiu

27 March 2018 in PLOS ONE
Verified
Journal Article
Open access
PDF file
AUAlfred Uwitonze
Alfred Uwitonze
JHJiaqing Huang
Jiaqing Huang
YYYuanqing Ye
Yuanqing Ye
WCWenqing Cheng
Wenqing Cheng
ZLZongpeng Li
Zongpeng Li
Space Information Flow (SIF) is a new promising research area that studies network coding in geometric space, such as Euclidean space. The design of algorithms that compute the optimal SIF solutions remains one of the key open problems in SIF. This work proposes the first exact SIF algorithm and a heuristic SIF algorithm that compute min-cost multicast network coding for N (N ≥ 3) given terminal nodes in 2-D Euclidean space. Furthermore, we find that the Butterfly network in Euclidean space is the second example besides the Pentagram network where SIF is strictly better than Euclidean Steiner minimal tree. The exact algorithm design is based on two key techniques: Delaunay triangulation and linear programming. Delaunay triangulation technique helps to find practically good candidate relay nodes, after which a min-cost multicast linear programming model is solved over the terminal nodes and the candidate relay nodes, to compute the optimal multicast network topology, including the optimal relay nodes selected by linear programming from all the candidate relay nodes and the flow rates on the connection links. The heuristic algorithm design is also based on Delaunay triangulation and linear programming techniques. The exact algorithm can achieve the optimal SIF solution with an exponential computational complexity, while the heuristic algorithm can achieve the sub-optimal SIF solution with a polynomial computational complexity. We prove the correctness of the exact SIF algorithm. The simulation results show the effectiveness of the heuristic SIF algorithm.

3 March 2017 in Communications in Computer and Information Science
Verified
Book Chapter
Closed access
PDF file
AUAlfred Uwitonze
Alfred Uwitonze
JHJiaqing Huang
Jiaqing Huang
YYYuanqing Ye
Yuanqing Ye
WCWenqing Cheng
Wenqing Cheng

1 October 2017
Verified
Book Chapter
Closed access
PDF file
AUAlfred Uwitonze
Alfred Uwitonze
JHJiaqing Huang
Jiaqing Huang
YYYuanqing Ye
Yuanqing Ye
WCWenqing Cheng
Wenqing Cheng

1 January 2012
Verified
Book Chapter
Closed access
PDF file
JHJiaqing Huang
Jiaqing Huang
HLHang Luo
Hang Luo
JWJing Wang
Jing Wang