• Title/Summary/Keyword: Coverage Simulation

Search Result 466, Processing Time 0.031 seconds

Base Station Placement for Wireless Sensor Network Positioning System via Lexicographical Stratified Programming

  • Yan, Jun;Yu, Kegen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4453-4468
    • /
    • 2015
  • This paper investigates optimization-based base station (BS) placement. An optimization model is defined and the BS placement problem is transformed to a lexicographical stratified programming (LSP) model for a given trajectory, according to different accuracy requirements. The feasible region for BS deployment is obtained from the positioning system requirement, which is also solved with signal coverage problem in BS placement. The LSP mathematical model is formulated with the average geometric dilution of precision (GDOP) as the criterion. To achieve an optimization solution, a tolerant factor based complete stratified series approach and grid searching method are utilized to obtain the possible optimal BS placement. Because of the LSP model utilization, the proposed algorithm has wider application scenarios with different accuracy requirements over different trajectory segments. Simulation results demonstrate that the proposed algorithm has better BS placement result than existing approaches for a given trajectory.

A Confidence Interval for Median Survival Time in the Additive Risk Model

  • Kim, Jinheum
    • Journal of the Korean Statistical Society
    • /
    • v.27 no.3
    • /
    • pp.359-368
    • /
    • 1998
  • Let ξ$_{p}$(z$_{0}$) be the pth quantile of the distribution of the survival time of an individual with time-invariant covariate vector z$_{0}$ in the additive risk model. We propose an estimator of (ξ$_{p}$(z$_{0}$) and derive its asymptotic distribution, and then construct an approximate confidence interval of ξ$_{p}$(z$_{0}$) . Simulation studies are carried out to investigate performance of the proposed estimator far practical sample sizes in terms of empirical coverage probabilities. Also, the estimator is illustrated on small cell lung cancer data taken from Ying, Jung, and Wei (1995) .d Wei (1995) .

  • PDF

Estimation of Geometric Mean for k Exponential Parameters Using a Probability Matching Prior

  • Kim, Hea-Jung;Kim, Dae Hwang
    • Communications for Statistical Applications and Methods
    • /
    • v.10 no.1
    • /
    • pp.1-9
    • /
    • 2003
  • In this article, we consider a Bayesian estimation method for the geometric mean of $textsc{k}$ exponential parameters, Using the Tibshirani's orthogonal parameterization, we suggest an invariant prior distribution of the $textsc{k}$ parameters. It is seen that the prior, probability matching prior, is better than the uniform prior in the sense of correct frequentist coverage probability of the posterior quantile. Then a weighted Monte Carlo method is developed to approximate the posterior distribution of the mean. The method is easily implemented and provides posterior mean and HPD(Highest Posterior Density) interval for the geometric mean. A simulation study is given to illustrates the efficiency of the method.

Research on the Energy Hole Problem Based on Non-uniform Node Distribution for Wireless Sensor Networks

  • Liu, Tang;Peng, Jian;Wang, Xiao-Fen;Yang, Jin;Guo, Bing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.9
    • /
    • pp.2017-2036
    • /
    • 2012
  • Based on the current solutions to the problem of energy hole, this paper proposed a nonuniform node distribution clustering algorithm, NNDC. Firstly, we divide the network into rings, and then have an analysis and calculation on nodes' energy consumption in each ring of the network when clustering algorithm is applied to collect data. We also put forward a scheme of nonuniform node distribution on the basis of the proportion of nodes' energy consumption in each ring, and change nodes' active/hibernating states under density control mechanism when network coverage is guaranteed. Simulation shows NNDC algorithm can satisfyingly balance nodes' energy consumption and effectively avoid the problem of energy hole.

Energy Efficient Adaptive Relay Station ON/OFF Scheme for Cellular Relay Networks

  • Kim, Se-Jin
    • Journal of Internet Computing and Services
    • /
    • v.19 no.2
    • /
    • pp.9-15
    • /
    • 2018
  • This paper proposes an energy efficient adaptive relay station ON/OFF scheme with different frequency reuse factors (FRFs) to enhance the system throughput and reduce the transmission energy consumption for the transparent mode of 2-hop cellular relay networks (CRNs) based on orthogonal frequency division multiple access and time division duplex. In the proposed scheme, the base station turns on or off the relay stations (RSs) when they are overutilized and undertuilized based on the traffic density of the cell coverage, respectively. Through the simulation results, we show that the proposed scheme outperforms the conventional CRN in terms of the energy consumption with the same system throughput. Further, in order to increase the system throughput with low energy consumption, the best way is FRF 1 when the number of operating RSs is up to 4 and FRF 2 otherwise.

Service Block Based Resource Allocation Scheme for Macrocell-Femtocell Networks

  • Lee, Jong-Chan;Lee, Moon-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.6
    • /
    • pp.29-35
    • /
    • 2015
  • The heterogeneous LTE (Long Term Evolution)-Advanced networks comprising a macrocell and femtocells can provide an efficient solution not only to extend macrocell coverage but also to deal with packet traffics increasing explosively within macrocells. An efficient resource management scheme is necessary to maintain the QoS (Quality of Service) of mobile multimedia services because the LTE-Advanced system should support not only voice but also mobile applications such as data, image and video. This paper proposes a resource management scheme to guarantee QoS continuity of multimedia services and to maximize the resource utilization in OFDMA (Orthogonal Frequency Division Multiple Access) based LTE-Advanced systems. This scheme divides the resources into several service blocks and allocates those resources based on the competition between macrocell and femtocell. Simulation results show that it provides better performances than the conventional one in respect of handover failure rate and blocking rate.

Bootstrap Confidence Intervals of Precision-to-Tolerance Ratio (PTR의 붓스트랩 신뢰구간)

  • Chang, Mu-Seong;Kim, Sang-Boo
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.30 no.2
    • /
    • pp.37-43
    • /
    • 2007
  • ANOVA is widely used for measurement system analysis. It assumes that the measurement error is normally distributed, which may not be seen in certain industrial cases. In this study, the exact and bootstrap confidence intervals for precision-to-tolerance ratio (PTR) are obtained for the cases where the measurement errors are normally and non-normally distributed and the reproducibility variation can be ignored. Lognormal and gamma distributions are considered for non-normal measurement errors. It is assumed that the quality characteristics have the same distributions of the measurement errors. Three different bootstrap methods of SB (Standard Bootstrap), PB (Percentile Bootstrap), and BCPB (Biased-Corrected Percentile Bootstrap) are used to obtain bootstrap confidence intervals for PTR. Based on a coverage proportion of PTR, a comparative study of exact and bootstrap methods is performed. Simulation results show that, for non-normal measurement error cases, the bootstrap methods of SB and BCPB are superior to the exact one.

RETRACTED: Double-Dwell Hybrid Acquisition in a DS-UWB System

  • Wang, Yupeng;Chang, Kyung-Hi
    • ETRI Journal
    • /
    • v.29 no.1
    • /
    • pp.1-7
    • /
    • 2007
  • In this paper, we analyze the performance of double-dwell hybrid initial acquisition in a direct sequence ultra-wideband (DS-UWB) system via detection, miss, false alarm probabilities, and mean acquisition time. In the analysis, we consider the effect of the acquisition sequence as well as the deployment scenario of the abundant multipath components over small coverage of the piconet in the DS-UWB system. Based on the simulation, we obtain various performance measures for the mean acquisition time by varying parameters such as the total number of hypotheses to be searched, subgroup size, and dwell time. We thereupon suggest the optimum parameter set for the initial acquisition in the DS-UWB system.

  • PDF

Implementation of ATPG for IdDQ testing in CMOS VLSI (CMOS VLSI의 IDDQ 테스팅을 위한 ATPG 구현)

  • 김강철;류진수;한석붕
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.3
    • /
    • pp.176-186
    • /
    • 1996
  • As the density of VLSI increases, the conventional logic testing is not sufficient to completely detect the new faults generated in design and fabrication processing. Recently, IDDQ testing becomes very attractive since it can overcome the limitations of logic testing. In this paper, G-ATPG (gyeongsang automatic test pattern genrator) is designed which is able to be adapted to IDDQ testing for combinational CMOS VLSI. In G-ATPG, stuck-at, transistor stuck-on, GOS (gate oxide short)or bridging faults which can occur within priitive gate or XOR is modelled to primitive fault patterns and the concept of a fault-sensitizing gate is used to simulate only gates that need to sensitize the faulty gate because IDDQ test does not require the process of fault propagation. Primitive fault patterns are graded to reduce CPU time for the gates in a circuit whenever a test pattern is generated. the simulation results in bench mark circuits show that CPU time and fault coverage are enhanced more than the conventional ATPG using IDDQ test.

  • PDF

A Study On The Optimum Node Deployment In The Wireless Sensor Network System (무선센서 네트워크의 최적화 노드배치에 관한 연구)

  • Choi, Weon-Gab;Park, Hyung-Moo
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.99-100
    • /
    • 2006
  • One of the fundamental problems in sensor networks is the deployment of sensor nodes. The Fuzzy C-Means(FCM) clustering algorithm is proposed to determine the optimum location and minimum number of sensor nodes for the specific application space. We performed a simulation using two dimensional L shape model. The actual length of the L shape model is about 100m each. We found the minimum number of 15 nodes are sufficient for the complete coverage of modeled area. We also found the optimum location of each nodes. The real deploy experiment using 15 sensor nodes shows the 95.7%. error free communication rate.

  • PDF