Can I read Square Grid Points Coveraged by Connected Sources with Coverage Radius of One on a Two-Dimensional Grid on EtoBox?

Square Grid Points Coveraged by Connected Sources with Coverage Radius of One on a Two-Dimensional Grid by Longani, Pattama is a scholarly article available to read on EtoBox.

What is Square Grid Points Coveraged by Connected Sources with Coverage Radius of One on a Two-Dimensional Grid about?

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 NP-complete 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 rat

Author

Longani, Pattama

Published

2014

Language

EN