12 search results - page 1 / 3 » Base station placement on boundary of a convex polygon |
JPDC
2008
13 years 4 months ago
2008
Let P be a polygonal region which is forbidden for placing a base station in the context of mobile communication. Our objective is to place one base station at any point on the bo...
WALCOM
2007
IEEE
13 years 6 months ago
2007
IEEE
Due to the recent growth in the demand of mobile communication services in several typical environments, the development of efficient systems for providing specialized services ha...
IJRR
2008
13 years 4 months ago
2008
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...
JPDC
2006
13 years 4 months ago
2006
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
—We study in this paper the question of determining locations of base stations (BSs) that may belong to the same or to competing service providers, taking into account the impact...