• Title/Summary/Keyword: Coverage Simulation

Search Result 466, Processing Time 0.027 seconds

Prolonging Network Lifetime by Optimizing Actuators Deployment with Probabilistic Mutation Multi-layer Particle Swarm Optimization

  • Han, Yamin;Byun, Heejung;Zhang, Liangliang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.8
    • /
    • pp.2959-2973
    • /
    • 2021
  • In wireless sensor and actuator networks (WSANs), the network lifetime is an important criterion to measure the performance of the WSAN system. Generally, the network lifetime is mainly affected by the energy of sensors. However, the energy of sensors is limited, and the batteries of sensors cannot be replaced and charged. So, it is crucial to make energy consumption efficient. WSAN introduces multiple actuators that can be regarded as multiple collectors to gather data from their respective surrounding sensors. But how to deploy actuators to reduce the energy consumption of sensors and increase the manageability of the network is an important challenge. This research optimizes actuators deployment by a proposed probabilistic mutation multi-layer particle swarm optimization algorithm to maximize the coverage of actuators to sensors and reduce the energy consumption of sensors. Simulation results show that this method is effective for improving the coverage rate and reducing the energy consumption.

Sequential Percentile Estimation for Sequential Steady-State Simulation (순차적 시뮬레이션을 위한 순차적인 Percentile 추정에 관한 연구)

  • Lee, Jong-Suk;Jeong, Hae-Duck
    • The KIPS Transactions:PartD
    • /
    • v.10D no.6
    • /
    • pp.1025-1032
    • /
    • 2003
  • Percentiles are convenient measures of the entire range of values of simulation outputs. However, unlike means and standard deviations, the observations have to be stored since calculation of percentiles requires several passes through the data. Thus, percentile (PE) requires a large amount of computer storage and computation time. The best possible computation time to sort n observations is (O($nlog_{2}n$)), and memory proportional to n is required to store sorted values in order to find a given order statistic. Several approaches for extimating percentiles in RS(regenerative simulation) and non-RS, which can avoid difficulties of PE, have been proposed in [11, 12, 21]. In this paper, we implemented these three approaches known as : leanear PE, batching PE, spectral $P^2$ PE in the context of sequential steady-state simulation. Numerical results of coverage analysis of these PE approachs are present.

Coverage Evaluation of mmWave Small Cell in Outdoor Environment (실외환경에서 밀리미터파 소형 셀의 커버리지 측정)

  • Nguyen, Thanh Ngoc;Jeon, Taehyun
    • Journal of Satellite, Information and Communications
    • /
    • v.12 no.4
    • /
    • pp.162-165
    • /
    • 2017
  • In an effort to compensate the rising of the data throughput demand nowadays, there have been many research works to optimize the radio resource and increase the capacity of the network. At the present, small cell network, mmWave band and beamforming technology are leading the trend and becoming the core solutions of the fifth generation (5G) cellular networks. Since the propagation characteristics of radio wave in the mmWave band is quite different from the conventional bands, the communication systems which work in these bands have to be redesigned. In this paper, a 3D simulation model is discussed for cellular network at 60 GHz in outdoor environments. Coverage analysis and system performance is carried out for a small cell system in the typical urban environment including street canyon simulation scenario. In addition, the beamforming technique is considered to evaluate the throughput improvement. Simulation results show that the mmWave small cell systems is expected to be one of the major candidate technologies to satisfy the requirements of 5G in terms of data rate.

Implementation of deductive fault simulation using counting method (카운팅 방법을 사용한 연역적 고장 시뮬레이션의 구현)

  • 강신영;김규철
    • Proceedings of the IEEK Conference
    • /
    • 2000.11b
    • /
    • pp.176-179
    • /
    • 2000
  • Fault simulation is often necessary to determine the fault coverage of a given test, that is, to find all the faults detected by test. In this paper we implement a deductive fault simulation using counting method. Counting method uses f$\sub$i/ of fault table and Search list to compute set operation. f$\sub$i/ was counted by fault list of input gate. And we propagate fault list from primary inputs toward primary output by comparing with controling sum. It improved performance by reducing search of faults.

  • PDF

A Queueing Model for Mobile Communication Systems with Hierarchical Cell Structure (계층적 셀 구조를 갖는 이동 통신 시스템의 큐잉 모델)

  • 김기완
    • Journal of the Korea Society for Simulation
    • /
    • v.7 no.2
    • /
    • pp.63-78
    • /
    • 1998
  • The hierarchical cell structure consists of the macrocell and microcells to increase the system capacity and to achieve broad coverage. The hierarchical cell structure provides services for users in different mobility. In this paper, an analytical queueing model in mobile networks is proposed for the performance evaluation of the hierarchical cell structure. The model for networks with the multiple levels can simplify multi-dimensional ones into one-dimensional queueing model. The computational advantage will be growing as the layers are constructed in multiple levels. The computer simulation is provided for validating the proposed analytical model.

  • PDF

A Cluster-Based Relay Station Deployment Scheme for Multi-Hop Relay Networks

  • Chang, Jau-Yang;Chen, Yun-Wei
    • Journal of Communications and Networks
    • /
    • v.17 no.1
    • /
    • pp.84-92
    • /
    • 2015
  • Multi-hop relay networks have been widely considered as a promising solution to extend the coverage area and to reduce the deployment cost by deploying the relay stations (RSs) in mobile communication systems. Suitable deployment for the RSs is one of the most important features of the demand nodes (DNs) to obtain a high data transmission rate in such systems. Considering a tradeoff among the network throughput, the deployment budget, and the overall coverage of the systems, efficient RS deployment schemes and corresponding algorithms must be developed and designed. A novel cluster-based RS deployment scheme is proposed in this paper to select the appropriate deployment locations for the relay stations from the candidate positions. To make an ideal cluster distribution, the distances between the DNs are calculated when deploying the RSs. We take into account the traffic demands and adopt a uniform cluster concept to reduce the data transmission distances of the DNs. On the basis of the different candidate positions, the proposed scheme makes an adaptive decision for selecting the deployment sites of the RSs. A better network throughput and coverage ratio can be obtained by balancing the network load among the clusters. Simulation results show that the proposed scheme outperforms the previously known schemes in terms of the network throughput and the coverage ratio. Additionally, a suitable deployment budget can be implemented in multi-hop relay networks.

Modeling & Simulation Software Design for Coverage Analysis of Multiple Radio Positioning Integration System

  • Koo, Moonsuk;Kim, YoungJoon;So, Hyoungmin;Oh, Sang Heon;Kim, Seong-Cheol;Hwang, Dong-Hwan
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.5 no.2
    • /
    • pp.47-57
    • /
    • 2016
  • Since the Global Navigation Satellite System (GNSS) may not provide navigation information due to external interferences, many countries have plans to prepare a backup system for this situation. One of the possible GNSS backup systems is a multiple radio positioning integration system in combination with the terrestrial radio navigation system. Before constructing such a GNSS backup system, M&S software is needed to analyze if the system satisfies the performance the required navigation performance. This study presents requirements of M&S software for coverage analysis of the navigation system, and proposes an M&S software design scheme on the basis of the requirements. The M&S software is implemented, and coverage analysis is performed to verify the validity of the proposed design scheme.

Mobile Sensor Relocation to Prolong the Lifetime of Wireless Sensor Networks (무선 센서망의 수명 연장을 위한 센서 재배치)

  • Yoo, Young-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.4B
    • /
    • pp.338-348
    • /
    • 2009
  • The Wireless Sensor Network (WSN) has recently attracted considerable attention due to the low price and ease to deploy it. In particular, in a hostile or harsh regions where sensors cannot be deployed manually, WSNs can be established just by dropping sensors from the air. In this case, however, most likely sensors are not placed at optimal positions, although the location of sensors does have a drastic impact on the WSN performance. Moreover, randomized deployment algorithm can leave holes in terms of coverage in the sensing area. This paper proposes a sensor relocation scheme where mobile sensors move to patch up the holes by appropriate coverage. Simulation results show that the proposed algorithm outperforms prior existing schemes in terms of coverage and lifespan of WSNs.

A Comparison of Confidence Intervals for the Difference of Proportions (모비율 차이의 신뢰구간들에 대한 비교연구)

  • 정형철;전명식;김대학
    • The Korean Journal of Applied Statistics
    • /
    • v.16 no.2
    • /
    • pp.377-393
    • /
    • 2003
  • Several confidence interval estimates for the difference of two binomial proportions were introduced. Bootstrap confidence interval is also suggested. We examined the over estimation property of approximate intervals and under estimation trend of exact intervals for the difference of proportions. We compared these confidence intervals based on the average coverage probability, expected width and skewness measure. Particularly actual coverage probability were calculated by using the prior distribution of parameters. Monte Carlo simulation for small sample size is conducted. Some interesting contour plots of average coverage probability and marginal plots for several interval estimates are presented.

Push-Pull Distributed Movement Algorithm toy An Optimized Coverage of Mobile Base Station in Topology-less Wireless Networks

  • Unhawiwat, Mallika;Wipusitwarakun, Komwut
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1936-1939
    • /
    • 2002
  • Much recent attention on wireless technologies s put on topology-less wireless network, in which all nodes an be mobile and can communicate over wireless links, due to its ease of deployment, high flexibility and low expenses. One key in topology-less wireless network is mobile base stations (MBSs), which provides access points or mobile terminals (MTs) to wireless backbone network. MBSs can move to anywhere in accordance with changes in geographical distribution of MTs. They serve as dynamic odes. However, in order to utilize network resources and take full advantage of this topology-less network, MBSs must move to suitable position according to the current tate of network use. Moreover, MBSs have to consider the distance among them to avoid the crash and gap area of MBSs. Therefore, this paper proposes MBS movement algorithm by implementing push-pull method to fulfill the corporation of MBSs and considering the center of covered MTs or centroid to satisfy the MT coverage. From the simulation results, the proposed algorithm increases the performance of system when comparing with the centroid-based algoriom〔7〕, such as coverage area, MT coverage and call drops rate.

  • PDF