Abstract
This paper proposes a Billiards algorithm for two sensor deployment problems, random and deterministic deployment. The deployment considers both homogenous and heterogeneous sensors. The algorithm aims to maximize the coverage of a given monitored field with obstacles. The coverage is maximized by avoiding sensors overlapping and minimizing the uncovered areas. By adjusting the expansion ratio, the algorithm was able to find the best sensing ranges that maximize the field coverage. The conducted experiments point out the effect of expansion ratio, iterations between expansions, number Of collisions, and mobility, on the overall coverage. At the same time, Billiards algorithm shows significant improvement in the coverage performance from the initial field's coverage.