Consider a set of receptors belonging to two competitive telecommunication firms, the blue firm and the red firm. The receptors are represented as points in the plane, b are blue and belong to the blue firm and r are red and belong to the red firm. The blue firm has an emitting device represented as a point that moves along a path sending information to blue receptors as follows: At any time, the device sends information to all blue receptors covered by the largest disk centered at it and containing no red receptor. In this scenario, we study two optimization problems. The first problem is to compute a path P , such that the number of blue receptors served by a moving device is maximized. In particular, we give efficient algorithms when P is a straight line, an anchored half-line, and an axis-parallel double ray. As a second task, we study the problem of removing the minimum number of red receptors in such a way there exists a straight line path P so that if the device moves along P all blue receptors are served. We prove geometrical properties of an optimal straight line and propose efficient algorithms depending on the degrees of freedom of the line.