Admission Control Threshold in Cellular Relay Networks with Power Adjustment
In the cellular network with relays, the mobile station can benefit from both coverage extension and capacity enhancement. However, the operation complexity increases as the number of relays grows up. Furthermore, in the cellular network with cooperative relays, it is even more complex because of an...
Format: | Article |
---|---|
Language: | English |
Published: |
SpringerOpen
2009-03-01
|
Series: | EURASIP Journal on Wireless Communications and Networking |
Online Access: | http://dx.doi.org/10.1155/2009/275121 |
id |
doaj-ad19aff1ca83430192f43dbc820f2145 |
---|---|
record_format |
Article |
spelling |
doaj-ad19aff1ca83430192f43dbc820f21452020-11-25T00:23:23ZengSpringerOpenEURASIP Journal on Wireless Communications and Networking1687-14721687-14992009-03-01200910.1155/2009/275121Admission Control Threshold in Cellular Relay Networks with Power AdjustmentIn the cellular network with relays, the mobile station can benefit from both coverage extension and capacity enhancement. However, the operation complexity increases as the number of relays grows up. Furthermore, in the cellular network with cooperative relays, it is even more complex because of an increased dimension of signal-to-noise ratios (SNRs) formed in the cooperative wireless transmission links. In this paper, we propose a new method for admission capacity planning in a cellular network using a cooperative relaying mechanism called decode-and-forward. We mathematically formulate the dropping ratio using the randomness of “channel gain.” With this, we formulate an admission threshold planning problem as a simple optimization problem, where we maximize the accommodation capacity (in number of connections) subject to two types of constraints. (1) A constraint that the sum of the transmit powers of the source node and relay node is upper-bounded where both nodes can jointly adjust the transmit power. (2) A constraint that the dropping ratio is upper-bounded by a certain threshold value. The simplicity of the problem formulation facilitates its solution in real-time. We believe that the proposed planning method can provide an attractive guideline for dimensioning a cellular relay network with cooperative relays. http://dx.doi.org/10.1155/2009/275121 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
title |
Admission Control Threshold in Cellular Relay Networks with Power Adjustment |
spellingShingle |
Admission Control Threshold in Cellular Relay Networks with Power Adjustment EURASIP Journal on Wireless Communications and Networking |
title_short |
Admission Control Threshold in Cellular Relay Networks with Power Adjustment |
title_full |
Admission Control Threshold in Cellular Relay Networks with Power Adjustment |
title_fullStr |
Admission Control Threshold in Cellular Relay Networks with Power Adjustment |
title_full_unstemmed |
Admission Control Threshold in Cellular Relay Networks with Power Adjustment |
title_sort |
admission control threshold in cellular relay networks with power adjustment |
publisher |
SpringerOpen |
series |
EURASIP Journal on Wireless Communications and Networking |
issn |
1687-1472 1687-1499 |
publishDate |
2009-03-01 |
description |
In the cellular network with relays, the mobile station can benefit from both coverage extension and capacity enhancement. However, the operation complexity increases as the number of relays grows up. Furthermore, in the cellular network with cooperative relays, it is even more complex because of an increased dimension of signal-to-noise ratios (SNRs) formed in the cooperative wireless transmission links. In this paper, we propose a new method for admission capacity planning in a cellular network using a cooperative relaying mechanism called decode-and-forward. We mathematically formulate the dropping ratio using the randomness of “channel gain.” With this, we formulate an admission threshold planning problem as a simple optimization problem, where we maximize the accommodation capacity (in number of connections) subject to two types of constraints. (1) A constraint that the sum of the transmit powers of the source node and relay node is upper-bounded where both nodes can jointly adjust the transmit power. (2) A constraint that the dropping ratio is upper-bounded by a certain threshold value. The simplicity of the problem formulation facilitates its solution in real-time. We believe that the proposed planning method can provide an attractive guideline for dimensioning a cellular relay network with cooperative relays. |
url |
http://dx.doi.org/10.1155/2009/275121 |
_version_ |
1725357410833399808 |