Square Grid Points Coveraged by Connected Sources with Coverage Radius of one on a Two-Dimensional Grid

We take some parts of a theoretical mobility model in a two-dimension grid proposed by Greenlaw and Kantabutra to be our model. The model has eight necessary factors that we commonly use in a mobile wireless network: sources or wireless signal providers, the directions that a source can move, users or mobile devices, the given directions which define a user's movement, the given directions which define a source's movement, source's velocity, source's coverage, and obstacles. However, we include only the sources, source's coverage, and the obstacles in our model. We define SQUARE GRID POINTS COVERAGE (SGPC) problem to minimize number of sources with coverage radius of one to cover a square grid point size of p with the restriction that all the sources must be communicable and proof that SGPC is in NPcomplete class. We also give an APPROX-SQUARE-GRID-COVERAGE (ASGC) algorithm to compute the approximate solution of SGPC. ASGC uses the rule that any number can be obtained from the addition of 3, 4 and 5 and then combines 3-gadgets, 4-gadgets and 5-gadgets to specify the position of sources to cover a square grid point size of p. We find that the algorithm achieves an approximation ratio of 1+2P-10/P²+2. Moreover, we state about the extension usage of our algorithm and show some examples. We show that if we use ASPC on a square grid size of p and if sources can be moved, the area under the square grid can be covered in eight-time-steps movement. We also prove that if we extend our source coverage radius to 1.59, without any movement the area under the square gird will also be covered. Further studies are also discussed and a list of some tentative problems is given in the conclusion.