• Title/Summary/Keyword: 링크비용 함수

Search Result 37, Processing Time 0.021 seconds

SLNR-Based Precoder Design for Multiuser MIMO in Distributed Antenna Systems (분산 안테나 시스템에서 다중 사용자 MIMO를 위한 SLNR 기반의 프리코더 설계)

  • Seo, Bangwon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.6
    • /
    • pp.75-82
    • /
    • 2018
  • In this paper, we consider a precoder design for downlink multiuser multiple-input multiple-output (MU-MIMO) in distributed antenna systems (DAS). In DAS, remote radio heads (RRHs) are placed at geographically different locations within a cell area. Three different precoder design schemes are proposed to maximize the separate or joint signal-to-leakage-plus-noise ratio (SLNR) metrics by considering RRH sum power or per-RRH power constraints. The analytical closed-form form solution for each optimization problem is presented. Through computer simulation, we show that the joint SLNR based precoding schemes have better signal-to-interference-plus-noise ratio (SINR) and bit error rate (BER) performances than the separate SLNR based schemes. Also, it is shown that the precoding scheme with RRH sum power constraint has better performance than the precoding scheme with per-RRH power constraint.

Data Congestion Control Using Drones in Clustered Heterogeneous Wireless Sensor Network (클러스터된 이기종 무선 센서 네트워크에서의 드론을 이용한 데이터 혼잡 제어)

  • Kim, Tae-Rim;Song, Jong-Gyu;Im, Hyun-Jae;Kim, Bum-Su
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.7
    • /
    • pp.12-19
    • /
    • 2020
  • The clustered heterogeneous wireless sensor network is comprised of sensor nodes and cluster heads, which are hierarchically organized for different objectives. In the network, we should especially take care of managing node resources to enhance network performance based on memory and battery capacity constraints. For instances, if some interesting events occur frequently in the vicinity of particular sensor nodes, those nodes might receive massive amounts of data. Data congestion can happen due to a memory bottleneck or link disconnection at cluster heads because the remaining memory space is filled with those data. In this paper, we utilize drones as mobile sinks to resolve data congestion and model the network, sensor nodes, and cluster heads. We also design a cost function and a congestion indicator to calculate the degree of congestion. Then we propose a data congestion map index and a data congestion mapping scheme to deploy drones at optimal points. Using control variable, we explore the relationship between the degree of congestion and the number of drones to be deployed, as well as the number of drones that must be below a certain degree of congestion and within communication range. Furthermore, we show that our algorithm outperforms previous work by a minimum of 20% in terms of memory overflow.

An Efficient Routing Scheme based on Link Quality and Load Balancing for Wireless Sensor Networks (무선 센서 네트워크에서 링크 상태 및 트래픽 분산 정보를 이용한 효과적인 라우팅 방법)

  • Kim, Sun-Myeng;Yang, Yeon-Mo
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.4
    • /
    • pp.11-19
    • /
    • 2010
  • ZigBee is a standard for wireless personal area networks(WPANs) based on the IEEE 802.15.4 standard. It has been developed for low cost and low power consumption. There are two alternative routing schemes that have been proposed for the ZigBee standard: Ad-hoc On-Demand Distance Vector(AODV) and tree routing. The tree routing forwards packets from sensors to a sink node based on the parent-child relationships established by the IEEE 802.15.4 MAC topology formation procedure. In order to join the network, a sensor node chooses an existing node with the strongest RSSI(Received signal strength indicator) signal as a parent node. Therefore, some nodes carry a large amount of traffic load and exhaust their energy rapidly. To overcome this problem, we introduce a new metric based on link quality and traffic load for load balancing. Instead of the strength of RSSI, the proposed scheme uses the new metric to choose a parent node during the topology formation procedure. Extensive simulation results using TOSSIM(TinyOS mote SIMulator) show that the CFR scheme outperforms well in comparison to the conventional tree routing scheme.

Development of A Network loading model for Dynamic traffic Assignment (동적 통행배정모형을 위한 교통류 부하모형의 개발)

  • 임강원
    • Journal of Korean Society of Transportation
    • /
    • v.20 no.3
    • /
    • pp.149-158
    • /
    • 2002
  • For the purpose of preciously describing real time traffic pattern in urban road network, dynamic network loading(DNL) models able to simulate traffic behavior are required. A number of different methods are available, including macroscopic, microscopic dynamic network models, as well as analytical model. Equivalency minimization problem and Variation inequality problem are the analytical models, which include explicit mathematical travel cost function for describing traffic behaviors on the network. While microscopic simulation models move vehicles according to behavioral car-following and cell-transmission. However, DNL models embedding such travel time function have some limitations ; analytical model has lacking of describing traffic characteristics such as relations between flow and speed, between speed and density Microscopic simulation models are the most detailed and realistic, but they are difficult to calibrate and may not be the most practical tools for large-scale networks. To cope with such problems, this paper develops a new DNL model appropriate for dynamic traffic assignment(DTA), The model is combined with vertical queue model representing vehicles as vertical queues at the end of links. In order to compare and to assess the model, we use a contrived example network. From the numerical results, we found that the DNL model presented in the paper were able to describe traffic characteristics with reasonable amount of computing time. The model also showed good relationship between travel time and traffic flow and expressed the feature of backward turn at near capacity.

Development and Application of a Path-Based Trip Assignment Model under Toll Imposition (통행료체계에서의 경로기반 통행배정모형 개발과 적용에 관한 연구)

  • 권용석
    • Proceedings of the KOR-KST Conference
    • /
    • 2000.02a
    • /
    • pp.3-22
    • /
    • 2000
  • 이용자의 경로선택 형태를 모사하는 통행배정모형 결과의 정확도는 교통계획에 상당한 영향을 미친다. 이용자의 경로선택 결정과정에서 가장 중요한 판단기준은 통행시간과 통행요금이다. 그런데 통행요금은 이용자의 경로거리에 따라 다양한 방식으로 부과되므로, 링크를 분석단위로 하는 기존의 통행배정모형은 현실적인 통행요금 반영이 힘들었고 또한 수요예측 결과를 이용한 다양한 분석에서 제약을 받아 왔다. 본 연구는 이러한 배경에서 경로교통량을 도출할 수 있는 경로기반 통행배정모형을 구축하였고, 또한 경로거리에 따라 결정되는 현실적인 통행요금을 반영할 수 있는 알고리즘을 개발하였다. 경로기반 배정모형에서는 GP(Gradient Projection) 알고리즘을 이용하였고, 계산상의 효율성 제고를 위해 K-최단경로 알고리즘 중 MPS(Minimal Path Search) 알고리즘을 이용하였다. 개발된 배정 모형은 현실적인 통행요금을 반영할 수 있으므로 통행배정 결과의 정밀도를 향상시켰을 뿐만 아니라 기존 배정모형에 비해 최적해로의 수렴속도도 개선되는 것으로 나타났다. 본 논문의 배정모형은 경로교통량이 도출되고 통행요금을 반영할 수 있으므로, 통행요금과 통행 거리 관계에 따른 목적함수의 규명과 그에 따른 효과척도를 계량화할 수 있다. 따라서 본 모형은 통행배정에서 실재상황을 보다 현실여건에 맞도록 규명할 수 있고, 기존의 제한적인 효과분석의 문제점을 해결할 수 있으므로 그 활용범위가 넓다. 또한 본 논문은 개발된 배정모형의 적용사례로서 고속도로 수요관리 요금체계 개선방안을 제시하였다. 기존의 고속도로 통행요금 산정 방법은 이론적 근거가 미약했던 반면, 본 논문에서 개발된 배정모형과 고속도로 수요관리 요금체계 개선방안은 고속도로 통행료 결정에 대한 과학적이고 합리적인 분석방법을 제공하였다.한 민감도 분석을 실시한 결과 대안1의 경우 교통량의 변화 및 화물통행의 시간가치의 증가시 사회적 편익이 오히려 감소하였고, 대안2와 3의 경우 사회적 편익이 증가하는 것을 알 수 있었다. 이는 경부고속도로의 화물차량의 구성비에 따라 대안 1의 경우 오히려 화물차의 통행시간이 증가함에 그 원인이 있다 할 것이다. 이상과 같은 결론을 통하여 경부고속도로상의 화물전용차선의 설치시는 수답렬 교통량의 구성비와 구간 평균교통량에 의하여 그 효과가 다르게 나타남을 알 수 있었다. 따라서 물류비용 절감차원에서의 화물전용차선의 설치는 본 연구에서 나타낸 방법과 같이 수단간의 경제적 편익을 고려한 구간별 시간대별 효과분석을 통하여 정책의 시행여부가 결정되어야 할 것이다. 한편, 화물전용차선의 설치로 인한 물류비용의 절감을 보다 효과적으로 달성하기 위해서는 종합류류 전산망의 시급한 구축과 함께 화물차의 적재율을 높이고 공차율을 낮출 수 있는 운송체계의 수립이 필요한 것으로 판단된다. 그라나 이러한 화물전용차선의 효과는 단기적인 치유책일 수밖에 없기 때문에 물류유통 시설의 확충을 위한 사회간접자본의 구축을 서둘러 시행하여야 할 것이다.으로 처리한 Machine oil, Phenthoate EC 및 Trichlorfon WP는 비교적 약효가 낮았다.>$^{\circ}$E/$\leq$30$^{\circ}$NW 단열군이 연구지역 내에서 지하수 유동성이 가장 높은 단열군으로 추정된다. 이러한 사실은 3개 시추공을 대상으로 실시한 시추공 내 물리검층과 정압주입시험에서도 확인된다.. It was resulted from increase of weight of single cocoon. "Manta"2.5ppm produced 22.2kg of co

  • PDF

Developing a Transit Assignment Model Considering Waiting Time Variation and Line Capacity (대기시간변동 및 용량을 고려한 대중교통 통행배정모형)

  • Kim, Jin Howan;Kim, Dong Sun;Kim, Ji Hyun
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.34 no.5
    • /
    • pp.1525-1534
    • /
    • 2014
  • In recent years, the passengers are likely to decide their route on impulse due to the development of the integrated public transport system, and real-time information system. Especially, public transport fare integration in Seoul Metropolitan area, 2004 makes them not to have resistance about changing the modes or routes and their route choice is most effected by the degree of congestion. Assignment model have limitations to describe route changes by congestion. In this study, the concept of a link cost function used in road assignment and Effective frequency is introduced to describe the passengers' behavior when the capacity of public transport is over and the waiting time variation. Two situations, new transit line operation and accident, are set up to validate the model, as a result of the transit assignment by this model, the traffic on networks is not over the capacity. It is expected that this study will be of help to reflect the various behaviors in transit assignments.

Solution Algorithms for Logit Stochastic User Equilibrium Assignment Model (확률적 로짓 통행배정모형의 해석 알고리듬)

  • 임용택
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.2
    • /
    • pp.95-105
    • /
    • 2003
  • Because the basic assumptions of deterministic user equilibrium assignment that all network users have perfect information of network condition and determine their routes without errors are known to be unrealistic, several stochastic assignment models have been proposed to relax this assumption. However. it is not easy to solve such stochastic assignment models due to the probability distribution they assume. Also. in order to avoid all path enumeration they restrict the number of feasible path set, thereby they can not preciously explain the travel behavior when the travel cost is varied in a network loading step. Another problem of the stochastic assignment models is stemmed from that they use heuristic approach in attaining optimal moving size, due to the difficulty for evaluation of their objective function. This paper presents a logit-based stochastic assignment model and its solution algorithm to cope with the problems above. We also provide a stochastic user equilibrium condition of the model. The model is based on path where all feasible paths are enumerated in advance. This kind of method needs a more computing demand for running the model compared to the link-based one. However, there are same advantages. It could describe the travel behavior more exactly, and too much computing time does not require than we expect, because we calculate the path set only one time in initial step Two numerical examples are also given in order to assess the model and to compare it with other methods.