Hongjie Du
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hongjie Du has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Weili Wu
Department of Computer Science, The University of Texas at Dallas, Richardson, TX, USA
5 shared publications - Wonjun Lee
Gachon University
3 shared publications - Shan Shan
University of Texas at Dallas
2 shared publications - Ailian Jiang
College of Computer Science and Technology, Taiyuan University of Technology, Taiyuan 030600, China
1 shared publication - Ding-Zhu Du
University of Texas at Dallas, Richardson, USA
1 shared publication - Donghyun Kim
Department of Computer Science
1 shared publication
Latest Publications
- 18 May 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 11 (7) , 1102-1112
Efficient Virtual Backbone Construction with Routing Cost Constraint in Wireless Networks Using Directional Antennas
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.
- 18 May 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 11 (7) , 1102-1112
Efficient Virtual Backbone Construction with Routing Cost Constraint in Wireless Networks Using Directional Antennas
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.
- 2 August 2011
- Published by Springer Nature in Optimization Letters
- Vol. 6 (8) , 1787-1794
An efficient approximation for minimum energy broadcast in multi-channel multi-hop wireless network with directional antennas
- 2 August 2011
- Published by Springer Nature in Optimization Letters
- Vol. 6 (8) , 1787-1794
An efficient approximation for minimum energy broadcast in multi-channel multi-hop wireless network with directional antennas
- 9 October 2010
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 23 (2) , 301-307
Constructing weakly connected dominating set for secure clustering in distributed sensor network
- 9 October 2010
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 23 (2) , 301-307
Constructing weakly connected dominating set for secure clustering in distributed sensor network
- 26 June 2010
- Published by Springer Nature in Journal of Global Optimization
- Vol. 50 (2) , 229-234
On minimum submodular cover with submodular cost
- 26 June 2010
- Published by Springer Nature in Journal of Global Optimization
- Vol. 50 (2) , 229-234
On minimum submodular cover with submodular cost
- 29 April 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 14 (5) , 435-437
An efficient approximation for minimum latency broadcast in multi-channel multi-hop wireless networks
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.
- 29 April 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 14 (5) , 435-437
An efficient approximation for minimum latency broadcast in multi-channel multi-hop wireless networks
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.