• 제목/요약/키워드: Cost Propagation Algorithm

검색결과 62건 처리시간 0.029초

Path Loss Exponent Estimation for Indoor Wireless Sensor Positioning

  • Lu, Yu-Sheng;Lai, Chin-Feng;Hu, Chia-Cheng;Huang, Yueh-Min;Ge, Xiao-Hu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제4권3호
    • /
    • pp.243-257
    • /
    • 2010
  • Rapid developments in wireless sensor networks have extended many applications, hence, many studies have developed wireless sensor network positioning systems for indoor environments. Among those systems, the Global Position System (GPS) is unsuitable for indoor environments due to Line-Of-Sight (LOS) limitations, while the wireless sensor network is more suitable, given its advantages of low cost, easy installation, and low energy consumption. Due to the complex settings of indoor environments and the high demands for precision, the implementation of an indoor positioning system is difficult to construct. This study adopts a low-cost positioning method that does not require additional hardware, and uses the received signal strength (RSS) values from the receiver node to estimate the distance between the test objects. Since many objects in indoor environments would attenuate the radio signals and cause errors in estimation distances, knowing the path loss exponent (PLE) in an environment is crucial. However, most studies preset a fixed PLE, and then substitute it into a radio propagation loss model to estimate the distance between the test points; such method would lead to serious errors. To address this problem, this study proposes a Path Loss Exponent Estimation Algorithm, which uses only four beacon nodes to construct a radio propagation loss model for an indoor environment, and is able to provide enhanced positioning precision, accurate positioning services, low cost, and high efficiency.

Stochastic modelling and optimum inspection and maintenance strategy for fatigue affected steel bridge members

  • Huang, Tian-Li;Zhou, Hao;Chen, Hua-Peng;Ren, Wei-Xin
    • Smart Structures and Systems
    • /
    • 제18권3호
    • /
    • pp.569-584
    • /
    • 2016
  • This paper presents a method for stochastic modelling of fatigue crack growth and optimising inspection and maintenance strategy for the structural members of steel bridges. The fatigue crack evolution is considered as a stochastic process with uncertainties, and the Gamma process is adopted to simulate the propagation of fatigue crack in steel bridge members. From the stochastic modelling for fatigue crack growth, the probability of failure caused by fatigue is predicted over the service life of steel bridge members. The remaining fatigue life of steel bridge members is determined by comparing the fatigue crack length with its predetermined threshold. Furthermore, the probability of detection is adopted to consider the uncertainties in detecting fatigue crack by using existing damage detection techniques. A multi-objective optimisation problem is proposed and solved by a genetic algorithm to determine the optimised inspection and maintenance strategy for the fatigue affected steel bridge members. The optimised strategy is achieved by minimizing the life-cycle cost, including the inspection, maintenance and failure costs, and maximizing the service life after necessary intervention. The number of intervention during the service life is also taken into account to investigate the relationship between the service life and the cost for maintenance. The results from numerical examples show that the proposed method can provide a useful approach for cost-effective inspection and maintenance strategy for fatigue affected steel bridges.

Group-Sparse Channel Estimation using Bayesian Matching Pursuit for OFDM Systems

  • Liu, Yi;Mei, Wenbo;Du, Huiqian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권2호
    • /
    • pp.583-599
    • /
    • 2015
  • We apply the Bayesian matching pursuit (BMP) algorithm to the estimation of time-frequency selective channels in orthogonal frequency division multiplexing (OFDM) systems. By exploiting prior statistics and sparse characteristics of propagation channels, the Bayesian method provides a more accurate and efficient detection of the channel status information (CSI) than do conventional sparse channel estimation methods that are based on compressive sensing (CS) technologies. Using a reasonable approximation of the system model and a skillfully designed pilot arrangement, the proposed estimation scheme is able to address the Doppler-induced inter-carrier interference (ICI) with a relatively low complexity. Moreover, to further reduce the computational cost of the channel estimation, we make some modifications to the BMP algorithm. The modified algorithm can make good use of the group-sparse structure of doubly selective channels and thus reconstruct the CSI more efficiently than does the original BMP algorithm, which treats the sparse signals in the conventional manner and ignores the specific structure of their sparsity patterns. Numerical results demonstrate that the proposed Bayesian estimation has a good performance over rapidly time-varying channels.

에지 정보를 이용한 유전 알고리즘 기반의 다해상도 스테레오 정합 (A Multiresolution Stereo Matching Based on Genetic Algorithm using Edge Information)

  • 홍석근;조석제
    • 정보처리학회논문지B
    • /
    • 제17B권1호
    • /
    • pp.63-68
    • /
    • 2010
  • 본 논문은 스테레오 시각에서 에지 정보를 이용한 유전 알고리즘 기반의 다해상도 스테레오 영상 정합 방법을 제안하고자 한다. 정합 환경을 최적화 문제로 간주하여 유전 알고리즘을 이용하여 해를 찾는다. 비용함수는 스테레오 정합에서 주로 고려할 수 있는 제약 조건으로 구성하였다. 처리의 효율성을 높이기 위해, 영상 피라미드 방벙을 적용하여 최저해상도에서 최초 변위도를 계산한다. 그리고 최초 변위도는 다음 해상도로 전파되고, 보간된 후 변위 정제를 수행한다. 실험을 통해 제안한 방법이 변위 탐색 시간을 감소시킬 뿐만 아니라 정합의 타당성을 보증함을 확인하고자 한다.

최적 경로 생성 및 최소 비용 신장 트리를 이용한 멀티캐스트 경로 배정 알고리즘 : MCSTOP (The MCSTOP Algorithm about the Minimum Cost Spanning Tree and the Optimum Path Generation for the Multicasting Path Assignment)

  • 박문성;김진석
    • 한국정보처리학회논문지
    • /
    • 제5권4호
    • /
    • pp.1033-1043
    • /
    • 1998
  • 본 논문에서는 최소 비용 신장 트리(minimum cost spanning tree를 기반으로 최적 경로를 지원할 수 있는 새로운 멀티케스트 경로 배정 알고리즘을 제안하였다 본 논문에서 제안한 MCSTOP(Multicasting Path Assignment using the MInimum Cost Spanning Tree and the Optimum Path Generation) 알고리즘은 송신 노드나 이미 선정된 노드의 하위 노드들 중에서 새로운 그룹의 수신 노드가 발견되면 우선적으로 멀티캐스트 경로를 배정하는 방법을 적용하였다. 새로운 그룹의 멀티캐스트 배정과정에서 새로운 그룹의 수신 노드들 사이에 타 그룹의 노드가 발생될 수 있다. 이러한 경우가 발생되면, MCSTOP 알고리즘에서는 새로운 그룹의 송신 노드와 수신 노드가 동일한 네트워크 영역(예. LAN 영역)과 치수 제한조건이 만족되면 새로운 가상 경로를 생성하여 최적 경로를 배정하도록 하였다. MCSTOP 알고리즘은 가상 경로로 설정된 노드들 사이에 존재하는 타 그룹 노드가 네트워크에서 탈퇴하여도 영향을 받지 않게 되므로, 새로운 그룹에 대한 멀티캐스트 경로의 재구성을 최소화 시킬 수 있었다. 또한, 검증 결과 MCSTOP알고리즘은 멀티 캐스트 배정 경로를 위한 계산시간, 통신비용 그리고 데이터 전달지연시간 등이 CST(Constrained Steiner Tree) 알고리즘보다 성능 향상을 보였다. 추후 연구 사항으로는 데이터 회의를 지원하기 위한 그룹 통신 프로토콜로써 ITU-TT.120 시리즈의 MCS(Multipoint Communication Service)와 같은 국제 표준 프로토콜에 적용하기 위한 연구가 필요하다.

  • PDF

MPEG-2 동영상 표준방식에 대한 채널 오차의 검출 및 은폐 기법 (Channel Error Detwction and Concealment Technqiues for the MPEG-2 Video Standard)

  • 김종원;박종욱;이상욱
    • 한국통신학회논문지
    • /
    • 제21권10호
    • /
    • pp.2563-2578
    • /
    • 1996
  • In this paper, channel error characteristics are investigated to alleviate the channel error propagation problem of the digital TV transmission systems. First, error propagation problems, which are mainly caused by the inter-frame dependancy and variable length coding of the MPEG-2 baseline encoder, are intensively analyzed. Next, existing channel resilient schemes are systematically classified into two kinds of schemes; one for the encoder and the other for the decoder. By comparing the performance and implementation cost, the encoder side schemes, such as error localization, layered coding, error resilience bit stream generation techniques, are described in this paper. Also, in an effort to consider the parcticality of the real transmission situation, an efficient error detection scheme for a decoder system is proposed by employing a priori information of the bit stream syntas, checking the encoding conditions at the encoder stage, and exploiting the statistics of the image itself. Finally, subsequent error concealment technique based on the DCT coefficient recovery algorithm is adopted to evaluate the performance of the proposed error resilience technique. The computer simulation results show that the quality of the received image is significantly improved when the bit error rate is as high as 10$^{-5}$ .

  • PDF

에어노드 기반 무선센서네트워크 구축을 위한 적응형 오르막경사법 기반의 자율무인비행로봇제어 (Autonomous Unmanned Flying Robot Control for Reconfigurable Airborne Wireless Sensor Networks Using Adaptive Gradient Climbing Algorithm)

  • 이덕진
    • 로봇학회논문지
    • /
    • 제6권2호
    • /
    • pp.97-107
    • /
    • 2011
  • This paper describes efficient flight control algorithms for building a reconfigurable ad-hoc wireless sensor networks between nodes on the ground and airborne nodes mounted on autonomous vehicles to increase the operational range of an aerial robot or the communication connectivity. Two autonomous flight control algorithms based on adaptive gradient climbing approach are developed to steer the aerial vehicles to reach optimal locations for the maximum communication throughputs in the airborne sensor networks. The first autonomous vehicle control algorithm is presented for seeking the source of a scalar signal by directly using the extremum-seeking based forward surge control approach with no position information of the aerial vehicle. The second flight control algorithm is developed with the angular rate command by integrating an adaptive gradient climbing technique which uses an on-line gradient estimator to identify the derivative of a performance cost function. They incorporate the network performance into the feedback path to mitigate interference and noise. A communication propagation model is used to predict the link quality of the communication connectivity between distributed nodes. Simulation study is conducted to evaluate the effectiveness of the proposed reconfigurable airborne wireless networking control algorithms.

사운드 트레이싱을 위한 적응형 깊이 조절 알고리즘 (Adaptive depth control algorithm for sound tracing)

  • 김은재;윤주원;정우남;김영식;박우찬
    • 한국컴퓨터그래픽스학회논문지
    • /
    • 제24권5호
    • /
    • pp.21-30
    • /
    • 2018
  • 본 논문에서는 현실감을 높이기 위한 청각적 기술로 기하학적 방법을 사용하는 광선 추적(ray-tracing) 기반의 3D Sound rendering기술인 Sound-tracing을 사용한다. Sound-tracing은 사운드 전파(sound propagation)단계에서 많은 비용이 든다. 사운드 전파 비용을 감소시키기 위해 제안하는 알고리즘은 이전 프레임들의 평균 유효 frame 수를 계산하고 그 수치를 기반으로 공간에 따른 depth를 조절하는 방법이다. 실험 결과 depth를 조절하지 않은 결과와 비교하면 음원이 실내에 있었을 때 path 손실률은 0.72%이고 탐색 및 충돌검사 단계(traversal & Intersection test)가 85.13%의 계산량 감소를 보이고 전체 frame rate는 4.48% 증가하였다. 음원이 실외에 있었을 때 path 손실률은 0%이고 탐색 및 충돌검사 단계가 25.01%의 계산량 감소를 보이고 전체 frame rate가 7.85% 증가하였다. 이는 path 손실률을 최소화하면서 렌더링 성능을 올릴 수 있었다.

NLOS Mitigation for TOA Location Based on Pattern Matching Algorithm

  • Hur, Soojung;Akbarov, Dilshod;Park, Yongwan
    • 대한임베디드공학회논문지
    • /
    • 제4권2호
    • /
    • pp.63-68
    • /
    • 2009
  • The location of mobile terminals in cellular networks is an important problem in the field of information technology with applications in resource allocation, location sensitive browsing, and emergency communications. Finding location estimation techniques that are robust to non-line of light (NLOS) propagation is a key problem in this area. Time of arrival (TOA) and pattern matching (PM) measurements can be made simultaneously by CDMA cellular networks at low cost. The different sources of errors for each measurement type cause TOA and PM measurements to contain independent information about mobile station (MS) locations. This paper combines the information of PM and TOA measurements to calculate a superior location estimate. The proposed location estimator is robust, provides lower error than the estimators based on the individual measurements, and has low implementation costs.

  • PDF

Improved Reliability-Based Iterative Decoding of LDPC Codes Based on Dynamic Threshold

  • Ma, Zhuo;Du, Shuanyi
    • ETRI Journal
    • /
    • 제37권4호
    • /
    • pp.736-742
    • /
    • 2015
  • A serial concatenated decoding algorithm with dynamic threshold is proposed for low-density parity-check codes with short and medium code lengths. The proposed approach uses a dynamic threshold to select a decoding result from belief propagation decoding and order statistic decoding, which improves the performance of the decoder at a negligible cost. Simulation results show that, under a high SNR region, the proposed concatenated decoder performs better than a serial concatenated decoder without threshold with an Eb/N0 gain of above 0.1 dB.