IEICE TRANSACTIONS on Communications
Optimization Problem for Minimizing Density of Base Stations in Multihop Wireless Networks
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E91-B No.6 pp.2067-2072
- Publication Date
- 2008/06/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e91-b.6.2067
- Type of Manuscript
- LETTER
- Category
- Terrestrial Radio Communications
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Akira TANAKA, Susumu YOSHIDA, "Optimization Problem for Minimizing Density of Base Stations in Multihop Wireless Networks" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 6, pp. 2067-2072, June 2008, doi: 10.1093/ietcom/e91-b.6.2067.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.6.2067/_p
Copy
@ARTICLE{e91-b_6_2067,
author={Akira TANAKA, Susumu YOSHIDA, },
journal={IEICE TRANSACTIONS on Communications},
title={Optimization Problem for Minimizing Density of Base Stations in Multihop Wireless Networks},
year={2008},
volume={E91-B},
number={6},
pages={2067-2072},
abstract={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.},
keywords={},
doi={10.1093/ietcom/e91-b.6.2067},
ISSN={1745-1345},
month={June},}
Copy
TY - JOUR
TI - Optimization Problem for Minimizing Density of Base Stations in Multihop Wireless Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2067
EP - 2072
AU - Akira TANAKA
AU - Susumu YOSHIDA
PY - 2008
DO - 10.1093/ietcom/e91-b.6.2067
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2008
AB - 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.
ER -
English
