Hongjie Du

Hongjie Du

Auto-generated profile, based on publicly available information

Hongjie Du

University of Texas at Dallas

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
18 May 2012 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
LDLing Ding
Ling Ding
WWWeili Wu
Weili Wu
JWJames Willson
James Willson
HDHongjie Du
Hongjie Du
WLWonjun Lee
Wonjun Lee
Directional antennas can divide the transmission range into several sectors. Thus, through switching off sectors in unnecessary directions in wireless networks, we can save bandwidth and energy consumption. In this paper, we will study a directional virtual backbone (VB) in the network where directional antennas are used. When constructing a VB, we will take routing and broadcasting into account since they are two common operations in wireless networks. Hence, we will study a VB with guaranteed routing costs, named α Minimum rOuting Cost Directional VB (α-MOC-DVB). Besides the properties of regular VBs, α-MOC-DVB also has a special constraint - for any pair of nodes, there exists at least one path all intermediate directions on which must belong to α-MOC-DVB and the number of intermediate directions on the path is smaller than α times that on the shortest path. We prove that construction of a minimum α-MOC-DVB is an NP-hard problem in a general directed graph. A heuristic algorithm is proposed and theoretical analysis is also discussed in the paper. Extensive simulations demonstrate that our α-MOC-DVB is much more efficient in the sense of VB size and routing costs compared to other VBs.

26 June 2010 in Journal of Global Optimization
Verified
Journal Article
Closed access
PDF file
HDHongjie Du
Hongjie Du
WWWeili Wu
Weili Wu
WLWonjun Lee
Wonjun Lee
QLQinghai Liu
Qinghai Liu
ZZZhao Zhang
Zhao Zhang
Ding-Zhu DuDing-Zhu Du
Ding-Zhu Du

9 October 2010 in Journal of Combinatorial Optimization
Verified
Journal Article
Closed access
PDF file
HDHongjie Du
Hongjie Du
WWWeili Wu
Weili Wu
SSShan Shan
Shan Shan
DKDonghyun Kim
Donghyun Kim
WLWonjun Lee
Wonjun Lee


29 April 2010 in IEEE Communications Letters
Verified
Journal Article
Closed access
SSShan Shan
Shan Shan
WWWei Wang
Wei Wang
HDHongjie Du
Hongjie Du
XGXiaofeng Gao
Xiaofeng Gao
WWWeili Wu
Weili Wu
In this paper, we discuss the minimum latency broadcast problem (MLB) in multi-channel multi-hop wireless networks (MLB-MC). This problem is NP-hard since its special version, MLB in single-channel network (MLB-SC) is proved to be NP-hard . We design an efficient approximation for MLB-MC, analyze its approximation ratio, and evaluate its performance via numerical experiments. Furthermore, we give a general theorem as an upper bound to compare the performance between approximations for MLB-MC and MLB-SC.