• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.2
• /
• pp.206-214
• /
• 2003

In this paper, we propose a method to avoid obstacles that have unstable limit cycles in a chaos trajectory surface. We assume all obstacles in the chaos trajectory surface have a Van der Pol equation with an unstable limit cycle. When a chaos robot meets an obstacle in an Arnold equation or Chua's equation trajectory, the obstacle reflects the robot. We also show computer simulation results of Arnold equation and Chua's equation and random walk chaos trajectories with one or more Van der Pol obstacles and compare the coverage rates of each trajectory. We show that the Chua's equation is slightly more efficient in coverage rates when two robots are used, and the optimal number of robots in either the Arnold equation or the Chua's equation is also examined.

• Communications for Statistical Applications and Methods
• /
• v.3 no.1
• /
• pp.73-85
• /
• 1996

In this paper, we consider the distribution-free confidence intervals for the reliability of the stress-strength model when the stress X and strength Y depend linearly on some explanatory variables z and w, respectively. We apply these confidence intervals to the Rocket-Motor data and compare the results to those of Guttman et al. (1988). Some simulation results show that the distribution-free confidence intervals have better performance for nonnormal errors compared to those of Guttman et al. (1988), which are designed for normal random variables in respect that the former yield the coverage levels closer to the nominal coverage level than the latter.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.3
• /
• pp.477-493
• /
• 2011

The IEEE 802.16 mobile multi-hop relay (MMR) task group 'j' (TGj) has introduced the multi-hop relaying concept in the IEEE 802.16 Wireless MAN, wherein a relay station (RS) is employed to improve network coverage and capacity. Several RSs can be deployed between a base station and mobile stations, and configured to form a tree-like multi-hop topology. In such architecture, we consider the problem of a path selection through which the mobile station in and outside the coverage can communicate with the base station. In this paper, we propose a new path selection algorithm that ensures more efficient distribution of resources such as bandwidth among the relaying nodes for improving the overall performance of the network. Performance of our proposed scheme is compared with the path selection algorithms based on loss rate and the shortest path algorithm. Based on the simulation results using ns-2, we show our proposal significantly improves the performance on throughput, latency and bandwidth consumption.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3171-3191
• /
• 2016

Due to growing demand on wireless data traffic, a large number of different types of base stations (BSs) have been installed. However, space-time dependent wireless data traffic densities can result in a significant number of idle BSs, which implies the waste of power resources. To deal with this problem, we propose an active state control algorithm based on semi-Markov decision process (SMDP) for a heterogeneous network. A MDP in discrete time domain is formulated from continuous domain with some approximation. Suboptimal on-line learning algorithm with a random policy is proposed to solve the problem. We explicitly include coverage constraint so that active cells can provide the same signal to noise ratio (SNR) coverage with a targeted outage rate. Simulation results verify that the proposed algorithm properly controls the active state depending on traffic densities without increasing the number of handovers excessively while providing average user perceived rate (UPR) in a more power efficient way than a conventional algorithm.

• Communications for Statistical Applications and Methods
• /
• v.20 no.5
• /
• pp.387-394
• /
• 2013

In this paper, we develop the noninformative priors for the ratio of the scale parameters in the inverted exponential distributions. The first and second order matching priors, the reference prior and Jeffreys prior are developed. It turns out that the second order matching prior matches the alternative coverage probabilities, is a cumulative distribution function matching prior and is a highest posterior density matching prior. In addition, the reference prior and Jeffreys' prior are the second order matching prior. We show that the proposed reference prior matches the target coverage probabilities in a frequentist sense through a simulation study as well as provide an example based on real data is given.

• ETRI Journal
• /
• v.38 no.5
• /
• pp.799-806
• /
• 2016

In this paper, we propose an emergency wake-up alert system (EWAS) for providing accurate and rapid emergency information. The proposed system can provide an emergency wake-up alert service without an additional frequency allotment by utilizing the guard band of the Advanced Television Systems Committee (ATSC) Terrestrial Digital Television (DTV) system. The design target of the proposed system is to match the indoor reception coverage of EWAS with the outdoor reception coverage of the ATSC DTV system. To achieve this, the proposed system should be about 35.65 dB more robust than the ATSC DTV system. The simulation results show that the proposed system offers an emergency wake-up alert service supporting a data rate of up to 23 bps.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.4
• /
• pp.833-841
• /
• 2012

In this paper, we develop the noninformative priors for the ratio of the scale parameters in the half logistic distributions. We develop the first and second order matching priors. It turns out that the second order matching prior matches the alternative coverage probabilities, and is a highest posterior density matching prior. Also we reveal that the one-at-a-time reference prior and Jeffreys' prior are the second order matching prior. We show that the proposed reference prior matches the target coverage probabilities in a frequentist sense through simulation study, and an example based on real data is given.

• Journal of the Korean Statistical Society
• /
• v.32 no.3
• /
• pp.271-288
• /
• 2003

In this paper, when the variance of the normal distribution is related to the mean, we develop noninformative priors such as matching priors and reference priors. We prove that the second order matching prior matches alternative coverage probabilities up to the same order and also it is a HPD matching prior. It turns out that one-at-a-time reference prior satisfies a second order matching criterion. Then using these noninformative priors, we develop a Bayesian test procedure for the equality of the means and variances of two independent normal distributions using fractional Bayes factor. Some simulation study is performed, and a real data example is also provided.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.4177-4190
• /
• 2015

Current research on Internet of Things (IoT) has primarily addressed the means to enhancing smart resource allocation, automatic network operation, and secure service provisioning. In particular, providing satisfactory security service in IoT systems is indispensable to its mission critical applications. However, limited resources prevent full security coverage at all times. Therefore, these limited resources must be deployed intelligently by considering differences in priorities of targets that require security coverage. In this study, we have developed a new application of Cognitive Radio (CR) technology for IoT systems and provide an appropriate security solution that will enable IoT to be more affordable and applicable than it is currently. To resolve the security-related resource allocation problem, game theory is a suitable and effective tool. Based on the Blotto game model, we propose a new strategic power allocation scheme to ensure secure CR communications. A simulation shows that our proposed scheme can effectively respond to current system conditions and perform more effectively than other existing schemes in dynamically changeable IoT environments.

• Annual Conference of KIPS
• /
• 2012.04a
• /
• pp.605-606
• /
• 2012

In this paper, we consider the problem of scheduling sensor activity to prolong the network lifetime while guaranteeing both discrete target coverage and connectivity among all the active sensors and the sink, called connected target coverage (CTC) problem. We proposed a distributed scheme called Distributed Lifetime-Maximizing Scheme (DLMS) to solve the CTC problem. Our proposed scheme significantly reduces the cost of the construction of the connected cover graphs in comparison with the some conventional schemes. In addition, the energy consumption is more balanced so that the network lifetime will be increased. Our simulation results show that DLMS scheme performs much better than the conventional schemes in terms of the network lifetime.