• Title/Summary/Keyword: BS Assignment

Search Result 11, Processing Time 0.018 seconds

A channel assignment scheme for reducing call blocking rate in DS-CDMA cellular systems (DS-CDMA 셀룰라 시스템에서 호 차단률 개선을 위한 채널 할당 방식)

  • 전형구;황선호;권수근;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.5
    • /
    • pp.1075-1082
    • /
    • 1997
  • In this paper, we propose a channel assignment scheme for reducing call blocking rate in a base station(BS) of DS-CDMA cellular systems. The proposed scheme can e applied to the case where the capacity of reverse radio link is enough, but not are the available traffic channels performing the digital modulation and demodulation functions between a mobile station and the base station. The proposed scheme takes advantage of the feature of soft handoff in which a mobile station keeps its communication link even if one of the two communication links is released. The scheme estimates the mean and variance of the received power level measured at the base station before assigning a traffic channel for a new call request. The BS makes decision based on the estimated balues whether the new call request will be accepted or not. If it is decided that the capacity of reverse radio link is enough, but all traffic channels are not available, then the BS increases the soft handoff parameter T_DROP to release the traffic channels of mobile stations loactedin soft handoff area. The BS assigns the released traffic channel to anew call or a handoff call. The performance of the proposed channel assignment scheme is evaluated by computer simulation. The results show that the call blocking rate for new calls and handoff calls is reduced.

  • PDF

Pilot Sequence Assignment for Spatially Correlated Massive MIMO Circumstances

  • Li, Pengxiang;Gao, Yuehong;Li, Zhidu;Yang, Dacheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.1
    • /
    • pp.237-253
    • /
    • 2019
  • For massive multiple-input multiple-output (MIMO) circumstances with time division duplex (TDD) protocol, pilot contamination becomes one of main system performance bottlenecks. This paper proposes an uplink pilot sequence assignment to alleviate this problem for spatially correlated massive MIMO circumstances. Firstly, a single-cell TDD massive MIMO model with multiple terminals in the cell is established. Then a spatial correlation between two channel response vectors is established by the large-scale fading variables and the angle of arrival (AOA) span with an infinite number of base station (BS) antennas. With this spatially correlated channel model, the expression for the achievable system capacity is derived. To optimize the achievable system capacity, a problem regarding uplink pilot assignment is proposed. In view of the exponential complexity of the exhaustive search approach, a pilot assignment algorithm corresponding to the distinct channel AOA intervals is proposed to approach the optimization solution. In addition, simulation results prove that the main pilot assignment algorithm in this paper can obtain a noticeable performance gain with limited BS antennas.

Optimization of Coverage Extension in OFDMA Based MMR System (OFDMA 방식을 사용하는 MMR시스템의 최적화된 커버리지 확장)

  • Kim, Seung-Yeon;Kim, Se-Jin;Ryu, Seung-Wan;Lee, Hyong-Woo;Cho, Choong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.7B
    • /
    • pp.567-574
    • /
    • 2008
  • In this paper, we propose an optimal coverage extension scheme in the OFDMA based mobile multi-hop relay system. First, we propose an optimal frequency and time assignment scheme for maximizing system throughput and analyze the frame efficiency of schemes. Then, under the given BS capacity, we find the maximum number of relay hops that can be used to estimate the maximum coverage area of a BS in a multi-hop relay system. Analytical results show that the proposed scheme is efficient in coverage extension and throughput maximization in OFDMA based multi-hop relay system. Our work may be a rough guideline to control the parameters for multi-hop relay system optimization.

Designing Cellular Mobile Network Using Lagrangian Based Heuristic (라그랑지안 기반의 휴리스틱 기법을 이용한 셀룰러 모바일 네트워크의 설계)

  • Hong, Jung-Man;Lee, Jong-Hyup
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.37 no.1
    • /
    • pp.19-29
    • /
    • 2011
  • Cellular network is comprised of several base stations which serve cellular shaped service area and each base station (BS) is connected to the mobile switching center (MSC). In this paper, the configuration modeling and algorithm of a cellular mobile network with the aim of minimizing the overall cost of operation (handover) and network installation cost (cabling cost and installing cost of mobile switching center) are considered. Handover and cabling cost is one of the key considerations in designing cellular telecommunication networks. For real-world applications, this configuration study covers in an integrated framework for two major decisions: locating MSC and assigning BS to MSC. The problem is expressed in an integer programming model and a heuristic algorithm based on Lagrangian relaxation is proposed to resolve the problem. Searching for the optimum solution through exact algorithm to this problem appears to be unrealistic considering the large scale nature and NP-Completeness of the problem. The suggested algorithm computes both the bound for the objective value of the problem and the feasible solution for the problem. A Lagrangian heuristics is developed to find the feasible solution. Numerical tests are performed for the effectiveness and efficiency of the proposed heuristic algorithm. Computational experiments show that the performance of the proposed heuristics is satisfactory in the quality of the generated solution.

A Study on the Bandwidth Assignment Scheme for Video Data Using Dynamic Parameters in the Wireless ATM Networks (무선 ATM망에서 동적 변수를 이용한 비디오 데이터의 대역폭 할당방식에 대한 연구)

  • Jang, Dong-Hyeok;Kim, Seung-Hwan;Lee, Sun-Sook;Kwon, Oh-Seok
    • The KIPS Transactions:PartC
    • /
    • v.9C no.1
    • /
    • pp.73-78
    • /
    • 2002
  • In WATM networks, in order to perform dynamic slot allocation required slots of mobile terminals are estimated based on DP (Dynamic Parameter) reflecting characteristics of traffic. In VBR (Variable Bit Rate) traffic, slot allocation is done at MT considering both time-dependent characteristics and QoS (Quality of Service) requirements. In this paper, DPs-buffer state information and buffer state change-are transmitted through in-band signaling. BS (Base Station) performs dynamic slot allocation considering traffic characteristics of each MT (Mobile Terminal), in other words, buffer state information informs the potentiality of 'buffer full state'to BS if MT buffer is over the specific threshold value and buffer state change notifies change in buffer state of incoming cells to MT. If buffer state information is equal to 'low (more than threshold)' and 'abrupt increase' it generates 'buffer full' state cell transmission delay or cell loss might occur. At this time BS should assign additional slots to MT, and then MT consumes cells in its buffer. In simulation, the proposed scheme shows better performance in cell delay and loss than EPSA (Estimation-Prorated Slot Assignment) in-band scheme.

Resource Allocation in Full-Duplex OFDMA Networks: Approaches for Full and Limited CSIs

  • Nam, Changwon;Joo, Changhee;Yoon, Sung-Guk;Bahk, Saewoong
    • Journal of Communications and Networks
    • /
    • v.18 no.6
    • /
    • pp.913-925
    • /
    • 2016
  • In-band wireless full-duplex is a promising technology that enables a wireless node to transmit and receive at the same time on the same frequency band. Due to the complexity of self-interference cancellation techniques, only base stations (BSs) are expected to be full-duplex capable while user terminals remain as legacy half-duplex nodes in the near future. In this case, two different nodes share a single subchannel, one for uplink and the other for downlink, which causes inter-node interference between them. In this paper, we investigate the joint problem of subchannel assignment and power allocation in a single-cell full-duplex orthogonal frequency division multiple access (OFDMA) network considering the inter-node interference. Specifically, we consider two different scenarios: i) The BS knows full channel state information (CSI), and ii) the BS obtains limited CSI through channel feedbacks from nodes. In the full CSI scenario, we design sequential resource allocation algorithms which assign subchannels first to uplink nodes and then to downlink nodes or vice versa. In the limited CSI scenario, we identify the overhead for channel measurement and feedback in full-duplex networks. Then we propose a novel resource allocation scheme where downlink nodes estimate inter-node interference with low complexity. Through simulation, we evaluate our approaches for full and limited CSIs under various scenarios and identify full-duplex gains in various practical scenarios.

A Study of Coverage Extension and Minimum Deployment Cost in NBTC and WBTC Structures based WiBro System Using Multi-hop Relay (NBTC와 WBTC 구조를 갖는 WiBro 시스템에서 멀티홉 중계기를 이용한 커버리지 확장과 최소 설치비용 연구)

  • Kim, Se-Jin;Kim, Seung-Yeon;Lee, Byung-Bog;Ryu, Seung-Wan;Lee, Hyong-Woo;Cho, Choong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.10B
    • /
    • pp.911-918
    • /
    • 2008
  • In this paper, we propose new cell structures using multi-hop Relay Station(RS) based on IEEE802.16j in Narrow-Beam Trisector Cell (NBTC) and Wide-Beam Trisector Cell (WBTC), which are two methods for cell sectorization using 3-sector directional antennas. Then, we analyze our proposed structures compared with the existing system which does not use any RS about the numbers of optimized Base Station (BS) and multi-hop relay, the extended BS coverage, and the deployment cost according to the traffic density using optimization model. According to the results, we know the reduction of total deployment cost of the proposed systems and that WBTC is suitable when the traffic density is high and NBTC is suitable when the traffic density is low in our proposed multi-hop based NBTC and WBTC structures.

Power Allocation and Subcarrier Assignment for Joint Delivery of Unicast and Broadcast Transmissions in OFDM Systems

  • Lee, Deokhui;So, Jaewoo;Lee, Seong Ro
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.375-386
    • /
    • 2016
  • Most existing studies on broadcast services in orthogonal frequency division multiplexing (OFDM) systems have focused on how to allocate the transmission power to the subcarriers. However, because a broadcasting system must guarantee quality of service to all users, the performance of the broadcast service dominantly depends on the channel state of the user who has the lowest received signal-to-noise ratio among users. To reduce the effect of the worst user on the system performance, we propose a joint delivery scheme of unicast and broadcast transmissions in OFDM systems with broadcast and unicast best-effort users. In the proposed joint delivery scheme, the BS delivers the broadcast information using both the broadcast and unicast subcarriers at the same time in order to improve the performance of the broadcast service. The object of the proposed scheme is to minimize the outage probability of the broadcast service while maximizing the sum-rate of best-effort users. For the proposed joint delivery scheme, we develop an adaptive power and subcarrier allocation algorithm under the constraint of total transmission power. This paper shows that the optimal power allocation over each subcarrier in the proposed scheme has a multi-level water filling form. Because the power allocation and the subcarrier assignment problems should be jointly solved, we develop an iterative algorithm to find the optimal solution. Numerical results show that the proposed joint delivery scheme with adaptive power and subcarrier allocation outperforms the conventional scheme in terms of the outage probability of the broadcast service and the sum-rate of best-effort users.

Origin-Destination Estimation Based on Cellular Phone's Base Station (휴대폰 기지국 정보를 이용한 O/D 추정기법 연구)

  • Kim, Si-Gon;Yu, Byeong-Seok;Gang, Seung-Pil
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.1
    • /
    • pp.93-102
    • /
    • 2005
  • An Origin-Destination (O/D) is considered as one of the important information in route choices and trip assignments. A household interview survey is deemed to be the traditional and the most widely used method in making sample O/D and its conversion to the total O/D. Some researchers have studied to estimate dynamic O/D from the relationship between link volumes and trip assignment model. Nowadays, owing to the recent rapid spread of cellular phones. Location information of the cellular phone through the Base Station(BS) is considered as an alternative to O/D estimation. In this study, the methodology of generating BS-based O/D and the methodology of converting this O/D into an administrative district-based O/D are proposed. The information of GPS positions and cellular BS positions have acquired by establishing GPS equipment and cellular phone on taxies in Cheongju. Three weeks data are collected and used in estimating O/D by matching them on a digital map. Scatter diagram and sample correlation coefficients are used to investigate the similarity of the GPS-based O/D pattern among weeks, among days, and among times in day. The results show that there are few significant differences among weeks. But there is a difference in O/C pattern between weekday and weekend. Furthermore, there is a difference between morning peak and afternoon peak. Two methodologies are proposed to convert BS-based O/D into an administrative district-based O/D. The first one is to use the distribution pattern of GPS coordinates, the other is to use the coverage area of the BSs. To validate such converted O/D, GPS O/D is used as a true value. The statical analyses through scatter diagram, MAE and RMSE shows that there is few significant defference of pattern between the estimated BS-based O/D and GPS O/D. In the case of using only cellular information, the methodology using coverage area of the BSs is recommended for estimating O/D.

Performance Analysis of Handoff Channel Assignment Scheme in CDMA Cellular System (CDMA 셀룰러시스템에서의 핸드오프 채널할당기법 성능분석)

  • Lee, Dong-Myung;Lee, Chul-Hee
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.6
    • /
    • pp.17-29
    • /
    • 1999
  • In this paper, the prioritized queueing handoff scheme in CDMA (Code Division Multiple Access) cellular system is proposed. Also, the analytical survey for the proposed scheme is carried out, and the performance of this scheme is compared with that of non prioritized scheme and FIFO (First In First Out) queue scheme by computer simulation. The handoff region is defined as the time between the handoff treshold and the receiver threshold, and it is used for the maximum queue waiting time in the proposed scheme. The handoff and the receiver thresholds are defined as rewpectively: 1) the time that the Pilot Strength Measurement Message in the neighbor in the neighbor cell is received to the BS (Base Station) under the T_ADD threshold; and 2) the time that the T_DROP timer is expired and the Pilot Strength Measurement Message in the current cell is received to the BS under the T_DROP threshold. The performance metrics for analyzing the proposed scheme are : 1) probability of forced termination; 2) probability of call blocking; 3) ratio of carried traffic to total offered load; 4) average queue size; 5) average handoff delay time in queue. The simulation results show that the proposed scheme maintains high performance for handoff requests at a small penalty in total system capacity.

  • PDF