Base Station Placement Problem on the Boundary of a Convex Region

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 has become an important issue in mobile communication research. An important sub-problem in this area is the base-station placement problem, where the objective is to identify the location for placing the basestations. Mobile terminals communicate with their respective nearest base station, and the base stations communicate with each other over scarce wireless channels in a multi-hop fashion by receiving and transmitting radio signals. Each base station emits signal periodically and all the mobile terminals within its range can identify it as its nearest base station after receiving such radio signal. Here the problem is to position the base stations such that each point in the entire area can communicate with at least one base-station, and total power required for all the base-stations in the network is minimi...

• Type: Conference
• Year: 2007
• Where: WALCOM
• Authors: Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy
• Keywords: Algorithms, Base Stations, Mobile Communication, Nearest Base Station, WALCOM 2007