k-closest pair query is a useful type of query in many practical applications involving spatial data for decision making. The traditional techniques to handle k-closest pair queries generally assume that the objects are static. In this paper, we study the problem of k-closest pair monitoring (kCPM) over moving objects. Aiming at reducing communication cost for location updates between the clients and the server, our proposed kCPM approach achieves high monitoring accuracy with less CPU utilization compared to existing periodical location update schemes.