Kam-Wing Ng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Kam-Wing Ng has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Ye Tian
Anhui Key Laboratory on High Performance Computing, School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China
3 shared publications - Di Wu
Department of Computer Science & Engineering, The Chinese University of Hong Kong, Shatin, NT, Hong Kong
2 shared publications - Hong-Ning Dai
Hong Kong Baptist University
2 shared publications - Min-You Wu
Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, People’s Republic of China
2 shared publications - Anwitaman Datta
College of Computing and Data Science, Nanyang Technological University, Singapore
1 shared publication - C.M. Tsang
The Chinese University of Hong Kong
1 shared publication
Latest Publications
- 14 May 2013
- Published by Springer Nature in Wireless Personal Communications
- Vol. 73 (3) , 611-636
On Busy-Tone Based MAC Protocol for Wireless Networks with Directional Antennas
- 14 May 2013
- Published by Springer Nature in Wireless Personal Communications
- Vol. 73 (3) , 611-636
On Busy-Tone Based MAC Protocol for Wireless Networks with Directional Antennas
- Open Access
- 16 April 2013
- Published by MDPI AG in Journal of Sensor and Actuator Networks
- Vol. 2 (2) , 213-234
Channel Allocation in Wireless Networks with Directional Antennas
In this paper, we study the channel allocation in multi-channel wireless ad hoc networks with directional antennas. In particular, we investigate the problem: given a set of wireless nodes equipped with directional antennas, how many channels are needed to ensure collision-free communications? We derive the upper bounds on the number of channels, which heavily depend on the node density and the interference ratio (i.e., the ratio of the interference range to the transmission range). We construct several scenarios to examine the tightness of the derived bounds. We also take the side-lobes and back-lobes as well as the signal path loss into our analysis. Our results can be used to estimate the number of channels required for a practical wireless network (e.g., wireless sensor network) with directional antennas.
- 16 April 2013
- Published by MDPI AG in Journal of Sensor and Actuator Networks
- Vol. 2 (2) , 213-234
Open AccessChannel Allocation in Wireless Networks with Directional Antennas
In this paper, we study the channel allocation in multi-channel wireless ad hoc networks with directional antennas. In particular, we investigate the problem: given a set of wireless nodes equipped with directional antennas, how many channels are needed to ensure collision-free communications? We derive the upper bounds on the number of channels, which heavily depend on the node density and the interference ratio (i.e., the ratio of the interference range to the transmission range). We construct several scenarios to examine the tightness of the derived bounds. We also take the side-lobes and back-lobes as well as the signal path loss into our analysis. Our results can be used to estimate the number of channels required for a practical wireless network (e.g., wireless sensor network) with directional antennas.
- 9 July 2009
- Published by SAGE Publications in Multiagent and Grid Systems
- Vol. 5 (2) , 235-263
DPMF: A policy management framework for heterogeneous authorization systems in grid environments
In order to enable an open Grid environment to support organized resource sharing between multiple heterogeneous Virtual Organizations (VOs), we need to tackle the challenges of dynamic membership of VOs and trust relationships between the VOs. We pr
- 9 July 2009
- Published by SAGE Publications in Multiagent and Grid Systems
- Vol. 5 (2) , 235-263
DPMF: A policy management framework for heterogeneous authorization systems in grid environments
In order to enable an open Grid environment to support organized resource sharing between multiple heterogeneous Virtual Organizations (VOs), we need to tackle the challenges of dynamic membership of VOs and trust relationships between the VOs. We pr
- 5 February 2008
- Published by Elsevier in Computer Communications
- Vol. 31 (2) , 220-239
Stochastic analysis of the interplay between object maintenance and churn
- 5 February 2008
- Published by Elsevier in Computer Communications
- Vol. 31 (2) , 220-239
Stochastic analysis of the interplay between object maintenance and churn
- 13 November 2007
- Published by Springer Nature
- Vol. 2033, 247-263
An Agent-Based Micropayment System for E-Commerce
- 13 November 2007
- Published by Springer Nature
- Vol. 2033, 247-263
An Agent-Based Micropayment System for E-Commerce
- 1 November 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 07421303,p. 115-122
Achieving Resilient and Efficient Load Balancing in DHT-based P2P Systems
In DHT-based P2P systems, the technique of "virtual server" is widely used to achieve load balance. To efficiently handle the workload skewness , "virtual servers" are allowed to migrate between nodes. Among existing migration-based load balancing strategies, there are two main categories: (I) rendezvous directory strategy (RDS) and (2) independent searching strategy (ISS). However, none of them can achieve resilience and efficiency at the same time. In this paper, we propose a gossip dissemination strategy (GDS) for load balancing in DHT systems, which attempts to achieve the benefits of both RDS and ISS. GDS doesn't rely on a few static rendezvous directories to perform load balancing. Instead, load information is disseminated within the formed groups via a gossip protocol, and each peer has enough information to act as the rendezvous directory and perform load balancing within its group. Besides intra-group balancing, inter-group balancing and emergent balancing are also supported by GDS. To further improve system resilience, the position of the rendezvous directory is randomized in each round. For a better understanding, we also perform analytical studies on GDS in terms of its scalability and efficiency under churn. Finally, the effectiveness of GDS is evaluated by extensive simulation under different workload and churn levels
- 1 November 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 07421303,p. 115-122
Achieving Resilient and Efficient Load Balancing in DHT-based P2P Systems
In DHT-based P2P systems, the technique of "virtual server" is widely used to achieve load balance. To efficiently handle the workload skewness , "virtual servers" are allowed to migrate between nodes. Among existing migration-based load balancing strategies, there are two main categories: (I) rendezvous directory strategy (RDS) and (2) independent searching strategy (ISS). However, none of them can achieve resilience and efficiency at the same time. In this paper, we propose a gossip dissemination strategy (GDS) for load balancing in DHT systems, which attempts to achieve the benefits of both RDS and ISS. GDS doesn't rely on a few static rendezvous directories to perform load balancing. Instead, load information is disseminated within the formed groups via a gossip protocol, and each peer has enough information to act as the rendezvous directory and perform load balancing within its group. Besides intra-group balancing, inter-group balancing and emergent balancing are also supported by GDS. To further improve system resilience, the position of the rendezvous directory is randomized in each round. For a better understanding, we also perform analytical studies on GDS in terms of its scalability and efficiency under churn. Finally, the effectiveness of GDS is evaluated by extensive simulation under different workload and churn levels
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10952055,p. 405-410
On the Effectiveness of Migration-based Load Balancing Strategies in DHT Systems
As a fundamental problem in DHT-based P2P systems, load balancing is important to avoid performance degradation and guarantee system fairness. In this paper, to get a better understanding about the effectiveness of migration-based load balancing approaches in DHT systems, we analytically study two representative migration-based load balancing strategies: rendezvous directory strategy (RDS) and independent searching strategy (ISS). They differ in load information management and decision making in the process of load balancing. We analyze their performance in terms of efficiency, scalability and robustness, and explore the impact of their parameter settings. Based on the analysis results, we also propose a gossip-based strategy (GBS) for load balancing in DHT systems, which attempts to achieve the benefits of both RDS and ISS. Later, the effectiveness of GBS is evaluated by simulation under different workload and churn.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10952055,p. 405-410
On the Effectiveness of Migration-based Load Balancing Strategies in DHT Systems
As a fundamental problem in DHT-based P2P systems, load balancing is important to avoid performance degradation and guarantee system fairness. In this paper, to get a better understanding about the effectiveness of migration-based load balancing approaches in DHT systems, we analytically study two representative migration-based load balancing strategies: rendezvous directory strategy (RDS) and independent searching strategy (ISS). They differ in load information management and decision making in the process of load balancing. We analyze their performance in terms of efficiency, scalability and robustness, and explore the impact of their parameter settings. Based on the analysis results, we also propose a gossip-based strategy (GBS) for load balancing in DHT systems, which attempts to achieve the benefits of both RDS and ISS. Later, the effectiveness of GBS is evaluated by simulation under different workload and churn.