• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.1
• /
• pp.57-62
• /
• 2014

The benefits of infrastructure support are shown by analyzing a throughput scaling law of an erasure network in which multiple relay stations (RSs) are regularly placed. Based on suitably modeling erasure probabilities under the assumed network, we show our achievable network throughput in the hybrid erasure network. More specifically, we use two types of physical models, a exponential decay model and a polynomial decay model. Then, we analyze our achievable throughput using two existing schemes including multi-hop transmissions with and without help of RSs. Our result indicates that for both physical models, the derived throughput scaling law depends on the number of nodes and the number of RSs.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.911-916
• /
• 2016

The nearest-neighbor multihop routing with/without infrastructure support is known to achieve the optimal capacity scaling in a large packet-erasure network in which multiple wireless nodes and relay stations are regularly placed and packets are erased with a certain probability. In this paper, a throughput scaling law is shown for an infrastructure-supported erasure network where wireless nodes are randomly distributed, which is a more feasible scenario. We use an exponential decay model to suitably model an erasure probability. To achieve high throughput in hybrid random erasure networks, the multihop routing via highway using the percolation theory is proposed and the corresponding throughput scaling is derived. As a main result, the proposed percolation highway based routing scheme achieves the same throughput scaling as the nearest-neighbor multihop case in hybrid regular erasure networks. That is, it is shown that no performance loss occurs even when nodes are randomly distributed.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2654-2662
• /
• 1998

Maximum single bus throughput of standard IEEE 802.6 DQDB(Distributed Queue Dual Bus) is not obtained over 1. Therefore, lots of studies for improving bus throughput have done by QA slot preuse/reuse. We propose three calculation cethods for network's utilization with preuse/reuse scheme based on erasure nodes. One is calculation method by traffic density function, other is calculation method for obtaining maximum throughput. The other is calculation method using probability concept which follows real DQDB operation mechanisms. The calculated throughputs are compared with each others. The results shows some favorite phenomena. The proposed calculation methods can be casily expanded in mumber of nodes or in number of erasure nodes.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.3
• /
• pp.40-49
• /
• 1989

A variable-state block interference channel model is presented which matches asynchronous multiple-access slow frequency-hopped spread-spectrum systems which suffer from bursts of interference of variable duration. For variable-state block interference channels test pattern techniques combined with interleaving are presented from which the decoder obtain side information about channel states. By examining test patterns the decoder estimates which parts of data blocks are affected by interference and regards the parts of blocks affected by interference as erasures. Since the presence of test patterns reduces the number of bits for data transmission, test patterns are not useful for variable-state block interference channels for small hit probability, It is shown that test patterns increase the capacities of variable-state block interference channels for large hit probability. It is also shown that test patterns provide a almost full side information about channel states for certain values of parameters.

• Journal of the Korea Convergence Society
• /
• v.6 no.4
• /
• pp.161-167
• /
• 2015

It is very difficult to predict time-series data. This is because data obtained from the signal having a non-linear characteristic has an uncertainty. In this paper, By differentiating time-series data is the average of the past data under the premise that change depending on what pattern, and find the soft look of time-series change pattern. This paper also apply the probability variables to generalize time-series data having a specific data according to the reflection ratio of the differentiation. The predicted value is estimated by removing cyclic movement and seasonal fluctuation, and reflect the trend by extracting the irregular fluctuation. Predicted value has demonstrated the superiority of the proposed algorithm and compared with the best results by a simple moving average and the moving average.

• Proceedings of the KSME Conference
• /
• 2003.11a
• /
• pp.1045-1050
• /
• 2003

In this study, to investigate the effects of omitting low-amplitude cycles from a flight-simulation loading, crack growth tests are conducted on 2124-T851 aluminum alloy specimens. Three test spectra are generated by omitting small load ranges as counted by the rain-flow count method. The crack growth test results are compared with the data obtained from the flight-simulation loading. The experimental results show that omission of the load ranges below 5% of the maximum load does not significantly affect crack growth behavior, because these are below the initial stress intensity factor range. However, in the case of omitting the load ranges below 15% of the maximum load, crack growth rates decrease, and therefore crack growth curve deviates from the crack growth data under the flight-simulation loading. To optimize the load range that can be omitted, crack growth curves are simulated by the stochastic crack growth model. The prediction shows that the omission level can be extended to 8% of the maximum load and test time can be reduced by 59%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.5
• /
• pp.951-958
• /
• 2017

In an attack context, the adversary wants to retrieve the message from the intercepted noisy bit stream without any prior knowledge of the channel codes used. The process of finding out the code parameters such as code length, dimension, and generator, for this purpose, is called the blind recognition of channel codes or the reconstruction of channel codes. In this paper, we suggest an improved algorithm of the blind recovery of rate k/n convolutional encoders in a noisy environment. The suggested algorithm improves the existing algorithm by Marazin, et. al. by evaluating the threshold value through the estimation of the channel error probability of the BSC. By applying the soft decision method by Shaojing, et. al., we considerably enhance the success rate of the channel reconstruction.