• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.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.

• Smart Structures and Systems
• /
• v.18 no.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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.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.

• The KIPS Transactions:PartB
• /
• v.17B no.1
• /
• pp.63-68
• /
• 2010

In this paper, we propose a multiresolution stereo matching method based on genetic algorithm using edge information. The proposed approach considers the matching environment as an optimization problem and finds the solution by using a genetic algorithm. A cost function composes of certain constraints which are commonly used in stereo matching. We defines the structure of chromosomes using edge pixel information of reference image of stereo pair. To increase the efficiency of process, we apply image pyramid method to stereo matching and calculate the initial disparity map at the coarsest resolution. Then initial disparity map is propagated to the next finer resolution, interpolated and performed disparity refinement. We valid our approach not only reduce the search time for correspondence but alse ensure the validity of matching.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.1033-1043
• /
• 1998

In this paper, we present an improved multicasting path assignment algorithm based on the minimum cost spanning tree. In the method presented in this paper, a multicasting path is assigned preferentially when a node to be received is found among the next degree nodes of the searching node in the multicasting path assignment of the constrained steiner tree (CST). If nodes of the legacy group exist between nodes of the new group, a new path among the nodes of new group is assigned as long as the nodes may be excluded from the new multicasting path assignment taking into consideration characteristics of nodes in the legacy group. In assigning the multicasting path additionally, where the source and destination nodes which can be set for the new multicasting path exist in the domain of identical network (local area network) and conditions for degree constraint are satisfied, a method of producing and assigning a new multicasting path is used. The results of comparison of CST with MCSTOP, MCSTOp algorithm enhanced performance capabilities about the communication cost, the propagation delay, and the computation time for the multicasting assignment paths more than CST algorithm. Further to this, research activities need study for the application of the international standard protocol(multicasting path assignment technology in the multipoint communication service (MCS) of the ITU-T T.120).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.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}$ .

• The Journal of Korea Robotics Society
• /
• v.6 no.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.

• Journal of the Korea Computer Graphics Society
• /
• v.24 no.5
• /
• pp.21-30
• /
• 2018

In this paper, we use Sound-tracing, a 3D sound technology based on ray-tracing that uses geometric method as auditory technology to enhance realism. The Sound-tracing is costly in the sound propagation stage. In order to reduce the sound propagation cost, we propose a method to calculate the average effective frame number of previous frames using the frame coherence property and to adjust the depth according to the space based on the calculated number. Experimental results show that the path loss rate is 0.72% and the traversal & Intersection test calculation amount is decreased by 85.13% and the frame rate is increased by 4.48% when the sound source is indoors, compared with the result of the case without depth control. When the sound source was outdoors, the path loss was 0% and the traversal & Intersection test calculation amount is decreased by 25.01% and the frame rate increased by 7.85%. This allowed the rendering performance to be increased while minimizing the path loss rate.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.4 no.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.

• ETRI Journal
• /
• v.37 no.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.