Chor Ping Low
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Chor Ping Low has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
Chau Yuen
School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798, Singapore
1 shared publicationChoon Leng Tan
School of Electrical and Electronic Engineering, Nanyang Technological University, Blk S2, Nanyang Avenue, Singapore, Singapore 639798
1 shared publicationJim Mee Ng
School of Electrical & Electronic Engineering, Nanyang Technological University, Singapore
1 shared publication- Ting Wang
School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore
1 shared publication - Ting Wang
School of Electrical Engineering, Xian Jiaotong University, Xian, China
1 shared publication - Ting Wang1 shared publication
Latest Publications
- 1 January 2013
- Published by EJournal Publishing in International Journal of Information and Education Technology
- p. 417-423
A Data Driven Model for the Detection of Random Waypoint
- 1 January 2013
- Published by EJournal Publishing in International Journal of Information and Education Technology
- p. 417-423
A Data Driven Model for the Detection of Random Waypoint
- 1 March 2012
- Published by Elsevier in Computer Networks
- Vol. 56 (4) , 1442-1457
The general message ferry route (MFR∗) problem and the An-Improved-Route (AIR) scheme
- 1 March 2012
- Published by Elsevier in Computer Networks
- Vol. 56 (4) , 1442-1457
The general message ferry route (MFR∗) problem and the An-Improved-Route (AIR) scheme
- 1 October 2010
- Published by Elsevier in Computer Communications
- Vol. 33 (16) , 1949-1960
A fully distributed node allocation scheme with partition protection for Mobile Ad Hoc Networks
- 1 October 2010
- Published by Elsevier in Computer Communications
- Vol. 33 (16) , 1949-1960
A fully distributed node allocation scheme with partition protection for Mobile Ad Hoc Networks
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of 15th International Conference on Computer Communications and Networks
- No. 10952055,p. 143-148
An Approximation Algorithm for The Load-Balanced Clustering Problem in Wireless Sensor Networks
Wireless sensor networks have been receiving increasing attention in recent years due to their potential applications in the establishment of dynamic communications for emergency/rescue operations, disaster relief efforts, and military networks. In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gateway nodes, will act as cluster-heads for each cluster and the objective is to balance the load among these gateways. Load balanced clustering increases system stability and improves the communication between the various nodes in the network. We call the problem addressed in this paper as the load-balanced clustering problem (LBCP). We prove that LBCP is NP-hard and we proposed an efficient 3/2-approximation algorithm for the problem.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of 15th International Conference on Computer Communications and Networks
- No. 10952055,p. 143-148
An Approximation Algorithm for The Load-Balanced Clustering Problem in Wireless Sensor Networks
Wireless sensor networks have been receiving increasing attention in recent years due to their potential applications in the establishment of dynamic communications for emergency/rescue operations, disaster relief efforts, and military networks. In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gateway nodes, will act as cluster-heads for each cluster and the objective is to balance the load among these gateways. Load balanced clustering increases system stability and improves the communication between the various nodes in the network. We call the problem addressed in this paper as the load-balanced clustering problem (LBCP). We prove that LBCP is NP-hard and we proposed an efficient 3/2-approximation algorithm for the problem.
- 23 March 2004
- Published by Wiley in International Journal of Communication Systems
- Vol. 17 (4) , 375-388
Energy efficient broadcast routing in mobilead hocnetworks
In this paper, we address the problem of broadcast routing in mobilead hocnetworks from the viewpoint of energy efficiency. In anad hocwireless network, each node runs on a local energy source which has a limited energy lifespan. Thus, energy conservation is a critical issue inad hocnetworks. One approach for energy conservation is to establish routes which require lowest total energy consumption. This optimization problem is referred as the minimum‐energy broadcast routing problem (MEBRP). In this paper, we propose new efficient algorithms for the construction of energy‐efficient trees for broadcast in mobilead hocnetworks. These algorithms exploit the broadcast nature of the wireless channel, and address the need for energy‐efficient operations. Empirical studies show that our algorithms are able to achieve better performance than algorithms that have been developed for MEBRP. Copyright © 2004 John Wiley & Sons, Ltd.
- 23 March 2004
- Published by Wiley in International Journal of Communication Systems
- Vol. 17 (4) , 375-388
Energy efficient broadcast routing in mobilead hocnetworks
In this paper, we address the problem of broadcast routing in mobilead hocnetworks from the viewpoint of energy efficiency. In anad hocwireless network, each node runs on a local energy source which has a limited energy lifespan. Thus, energy conservation is a critical issue inad hocnetworks. One approach for energy conservation is to establish routes which require lowest total energy consumption. This optimization problem is referred as the minimum‐energy broadcast routing problem (MEBRP). In this paper, we propose new efficient algorithms for the construction of energy‐efficient trees for broadcast in mobilead hocnetworks. These algorithms exploit the broadcast nature of the wireless channel, and address the need for energy‐efficient operations. Empirical studies show that our algorithms are able to achieve better performance than algorithms that have been developed for MEBRP. Copyright © 2004 John Wiley & Sons, Ltd.
- 1 September 2003
- Published by Elsevier in Computer Communications
- Vol. 26 (14) , 1541-1550
On anycast routing with bandwidth constraint
- 1 September 2003
- Published by Elsevier in Computer Communications
- Vol. 26 (14) , 1541-1550
On anycast routing with bandwidth constraint
- 30 September 2002
- Published by Elsevier in Information Processing Letters
- Vol. 83 (6) , 315-321
An efficient retrieval selection algorithm for video servers with random duplicated assignment storage technique
- 30 September 2002
- Published by Elsevier in Information Processing Letters
- Vol. 83 (6) , 315-321
An efficient retrieval selection algorithm for video servers with random duplicated assignment storage technique
- 29 April 1998
- Published by Elsevier in Information Processing Letters
- Vol. 66 (2) , 87-92
A fast search algorithm for the quorumcast routing problem
- 29 April 1998
- Published by Elsevier in Information Processing Letters
- Vol. 66 (2) , 87-92
A fast search algorithm for the quorumcast routing problem