For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Optimization Problem for Minimizing Density of Base Stations in Multihop Wireless Networks
Akira TANAKA Susumu YOSHIDA
IEICE TRANSACTIONS on Communications
Publication Date: 2008/06/01
Online ISSN: 1745-1345
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Terrestrial Radio Communications
multihop wireless networks, base station density, energy consumption, delay, cost optimization,
Full Text: PDF(1.1MB)>>
A useful optimization problem to help solve various base station layout problems in multihop wireless networks is formulated. By solving the proposed generalized formula, the relation between the permissible largest number of hops and the minimum base station density necessary to cover an entire service area while guaranteeing a specified QoS is easily calculated. Our formula is extendable to other allocation problems by replacing parameters. The energy-cost transformation and scope of the multihop effect are also presented.