• Communications for Statistical Applications and Methods
• /
• v.22 no.1
• /
• pp.69-80
• /
• 2015

In this paper, the probability that a given point is covered by a random convex hull generated by independent and identically-distributed random points in a plane is studied. It is shown that such probability can be expressed in terms of an integral that can be approximated numerically by function-evaluations over the grid-points in a 2-dimensional space. The new integral representation allows such probability be computed efficiently. The computational burdens under the proposed integral representation and those in the existing literature are compared. The proposed method is illustrated through numerical examples where the random points are drawn from (i) uniform distribution over a square and (ii) bivariate normal distribution over the two-dimensional Euclidean space. The applications of the proposed method in statistics are are discussed.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.400-413
• /
• 2021

This paper theoretically and empirically explores the reliability gain that can be obtained by installing multiple antennas in on-vehicle broadcasting receivers. Analytical derivations reveal that maximal-ratio-combining-based diversity allows a multi-antenna receiver (MR) to achieve significantly better coverage probability than a single-antenna receiver (SR). In particular, the notable MR gains for low-power reception and high-throughput services are highlighted. We also discuss various aspects of mobile MRs, including geometric coverage, volume of the users served, and impact of receiver velocity. To examine the feasibility of MRs in the real world, extensive field experiments were conducted, particularly with on-air ATSC 3.0 broadcast transmissions. Relying on the celebrated erroneous second ratio criterion, MRs with two and four antennas were verified to achieve notable reliability gains over SRs in practice. Furthermore, our results also prove that layered-division multiplexing can cope better with receiver mobility than traditional time-division multiplexing when multiple services are intended in the same radio frequency channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4A
• /
• pp.394-400
• /
• 2010

Mobile Multi-hop Relaying (MMR) system can provide increased system capacity of wireless access network by coverage extension and enhanced transmission rate within the Base Station (BS) coverage area. The previous researches for the MMR system with a non-transparent mode Relay Station (RS) do not consider channel selection procedure of Mobile Station (MS), co-channel interference and Multi-hop Relay Base Station (MR-BS) coverage and RS coverage ratio in MMR system. In this paper, we investigate the performance of MMR uplink system in multicell environments with various topologies. The performance is presented in terms of call blocking probability, channel utilization, outage probability and system throughput by varying offered load. It is found that, for certain system parameters, the MMR uplink system achieve the maximum system throughput when MR-BS coverage to RS coverage ratio is 7.

• Journal of the Korean Data and Information Science Society
• /
• v.10 no.2
• /
• pp.465-472
• /
• 1999

We considered a bootstrap method for constructing confidenc intervals for a one parameter model using multinomial sampling. The convergence rates or the proposed bootstrap method are calculated for model-based maximum likelihood estimators(MLE) using multinomial sampling. Monte Carlo simulation was used to compare the performance of bootstrap methods with normal approximations in terms of the average coverage probability criterion.

• Journal of the Korean Statistical Society
• /
• v.31 no.3
• /
• pp.379-389
• /
• 2002

For two normal distribution with unknown means and unknown variances, a sequential procedure for estimating the difference of two normal means which satisfies both the coverage probability condition and the $\beta$-protection is proposed under some smoothness of variable imprecision function, and the asymptotic normality of the proposed stopping time after some centering and scaling is given.

• Journal of Sensor Science and Technology
• /
• v.22 no.4
• /
• pp.268-275
• /
• 2013

Efficient energy management becomes a critical design issue for complex WSN (Wireless Sensor Network). Most of complex WSN employ the sleep mode to reduce the energy dissipation. However, it should cause the reduction of sensing coverage. This paper presents new wake-up algorithm for reducing energy consumption in complex WSN. The proposed wake-up algorithm is devised using geometric probability. It determined which node will be waked-up among the nodes having overlapped sensing coverage. The only one sensor node will be waked-up and it is ready to sense the event occurred uniformly. The simulation results show that the lifetime is increased by 15% and the sensing coverage is increased by 20% compared to the other scheduling methods. Consequently, the proposed wake-up algorithm can eliminate the power dissipation in the overlapped sensing coverage. Thus, it can be applicable for the various WSN suffering from the limited power supply.

• The Korean Journal of Applied Statistics
• /
• v.19 no.1
• /
• pp.171-181
• /
• 2006

The Wald confidence interval has been considered as a standard method for the difference of proportions. However, the erratic behavior of the coverage probability of the Wald confidence interval is recognized in various literatures. Various alternatives have been proposed. Among them, Agresti-Caffo confidence interval has gained the reputation because of its simplicity and fairly good performance in terms of coverage probability. It is known however, that the Agresti-Caffo confidence interval is conservative. In this note, a confidence interval is developed using the weighted Polya posterior which was employed to obtain a confidence interval for the binomial proportion in Lee(2005). The resulting confidence interval is simple and effective in various respects such as the closeness of the average coverage probability to the nominal confidence level, the average expected length and the mean absolute error of the coverage probability. Practically it can be used for the interval estimation of the difference of proportions for any sample sizes and parameter values.

• Communications for Statistical Applications and Methods
• /
• v.10 no.2
• /
• pp.333-339
• /
• 2003

In this paper, we develop the probability matching priors for the parameters of non-regular Pareto distribution. We prove the propriety of joint posterior distribution induced by probability matching priors. Through the simulation study, we show that the proposed probability matching Prior matches the coverage probabilities in a frequentist sense. A real data example is given.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.6
• /
• pp.1175-1182
• /
• 2011

In this paper, properties of exact confidence interval and some approximate confidence intervals of hyper-geometric parameter, that is the probability of success p in the population is discussed. Usually, binomial distribution is a well known discrete distribution with abundant usage. Hypergeometric distribution frequently replaces a binomial distribution when it is desirable to make allowance for the finiteness of the population size. For example, an application of the hypergeometric distribution arises in describing a probability model for the number of children attacked by an infectious disease, when a fixed number of them are exposed to it. Exact confidence interval estimation of hypergeometric parameter is reviewed. We consider the approximation of hypergeometirc distribution to the binomial and normal distribution respectively. Approximate confidence intervals based on these approximation are also adequately discussed. The performance of exact confidence interval estimates and approximate confidence intervals of hypergeometric parameter is compared in terms of actual coverage probability by small sample Monte Carlo simulation.

• Journal of information and communication convergence engineering
• /
• v.10 no.4
• /
• pp.329-336
• /
• 2012

For designing broadcast protocols in mobile ad hoc networks (MANETs), one of the important goals is to reduce the rebroadcast packets redundancy while reaching all the nodes in network. In this paper, we propose a probabilistic broadcasting mechanism based on selfishness and additional coverage in MANETs. Our approach dynamically adjusts the rebroadcast probability according to the extra covered area and number of neighbor nodes. By these two factors, mobile hosts can be classified into three groups: normal, low selfishness, and high selfishness groups. The nodes in the normal group forward packets for other nodes with high probability, whereas the nodes in the low selfishness group rebroadcast packets with low probability and the nodes in the high selfishness group do not rebroadcast packets. We compared our approach with simple flooding and the fixed probabilistic approach. The simulation results show that the proposed schemes can significantly reduce the number of retransmissions by up to 40% compared simple flooding and fixed probabilistic scheme without significant reduction in the network reachability and end-to-end packet delay.