• Convergence Security Journal
• /
• v.7 no.3
• /
• pp.7-13
• /
• 2007

Finite failure NHPP models presented in the literature exhibit either constant, monotonic increasing or monotonic decreasing failure occurrence rates per fault. Accurate predictions of software release times, and estimation of the reliability and availability of a software product require quantification of a critical element of the software testing process : test coverage. This model called Enhanced non-homogeneous poission process (ENHPP). In this paper, exponential coverage and S-shaped model was reviewed, proposes the superposition model, which maked out efficiency application for software reliability. Algorithm to estimate the parameters used to maximum likelihood estimator and bisection method, model selection based on SSE statistics for the sake of efficient model, was employed.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.89-96
• /
• 2007

Finite failure NHPP models presented in the literature exhibit either constant. monotonic increasing or monotonic decreasing failure occurrence rates per fault. Accurate predictions of software release times. and estimation of the reliability and availability of a software product require quality of a critical element of the software testing process : test coverage. This model called Enhanced non-homogeneous Poission process(ENHPP). In this paper, exponential coverage and S-type model was reviewed, proposes modified(the superosition and mixture) model, which make out efficiency application for software reliability. Algorithm to estimate the parameters used to maximum likelihood estimator and bisection method. model selection based on SSE statistics for the sake of efficient model, was employed.

• Journal of the Korea Society for Simulation
• /
• v.21 no.2
• /
• pp.51-58
• /
• 2012

In IEEE 802.16j MMR protocol, two modes about usage of RS are proposed; one is transparent mode to enhance data throughput and the other is non-transparent mode to extend coverage. In this paper, we focus on non-transparent mode and find that the mode can also improve data throughput. Therefore, we analyze data throughput on various RS topology and their extended coverage area by simulation in IEEE 802.16j non-transparent mode. We also compare the simulation results with the single MR-BS system of which coverage is extended by higher transmission power. From the comparisons of simulation results, we see that higher throughput can be obtained in the proposed non-transparent mode.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.1
• /
• pp.183-189
• /
• 2018

This paper proposes distributed file placement and coverage expansion techniques for mitigating the traffic bottleneck in backhaul for small-cell networks. In order to minimize the backhaul load with limited memory space, the proposed scheme controls the coverage and file placement of base station according to file popularity distribution and memory space of base stations. In other words, since the cache hit ratio is low when there is small memory capacity or widespread file popularity distribution, the base stations expand its coverage and cache different set of files for the user located in overlapped area to exploit multiple cached file sets of base stations. Our simulation results show that the proposed scheme outperforms the conventional cache strategy in terms of network throughput when there is small memory capacity or widespread file popularity distribution.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.8
• /
• pp.63-71
• /
• 2014

This paper proposes an algorithm that forms the clusters on the basis of hop distance in order to improve the actor coverage and connectivity in the sink-based wireless sensor and actor networks. The proposed algorithm forms the clusters that are distributed evenly in the target area by electing the CHs(Cluster Heads) at regular hop intervals from a sink. The CHs are elected sequentially from the sink in order to ensure the connectivity between the sink and the actors that are located on the CHs. Additionally, the electing are achieved from the area of the higher rate of the sensors density in order to improve the actor coverage. The number of clusters that are created in the target area and the number of the actors that are placed on the positions of the CHs are reduced by forming the clusters with regular distribution and minimizing the overlap of them through the proposed algorithm. Simulations are performed to verify that the proposed algorithm constructs the actor network that is connected to the sink. Moreover, we shows that the proposed algorithm improves the actor coverage and, therefore, reduces the amount of the actors that will be deployed in the region by 9~20% compared to the IDSC algorithm.

• Electronics and Telecommunications Trends
• /
• v.27 no.6
• /
• pp.31-37
• /
• 2012

Hierarchical network 기술은 다양한 크기의 이동통신 셀들이 서로 중첩된 환경에서 무선 용량 증대 및 셀 커버리지 확대를 위한 차세대 통신 기술이다. 모바일 IPTV는 IPTV에 이동성이 더해진 기술로서 이동통신망을 이용하여 언제, 어디서나 고품질의 TV 및 VoD, 데이터 서비스를 제공한다. 본고에서는 IEEE 802.16 기반의 hierarchical network 및 모바일 IPTV 기술의 연구동향을 살펴보고 두 기술의 공존 가능성 측면에서의 고려 사항에 대해 기술한다.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2001.10a
• /
• pp.147-151
• /
• 2001

본 연구에서는 항공 레이저 지형 매퍼(Airborne Laser Terrain Mapper 혹은 간단히 ALTM)을 이용하여 제작된 DTM의 정확도 분석을 위해 500m 간격으로 측점지역을 선정하고 검증 측점의 GPS 측량을 실시하여 다양한 방법을 통해 정확도를 검증하였다. ALTM의 DTM 각 점 사이의 고도 값 추정을 위해 TIN을 제작하고, GPS를 이용한 측점들의 커버리지를 제작하여 TIN과 중첩한 다음 정확도를 분석하는 방법과 GPS 측점 주변에 분포하는 DTM 자료를 평균하여 RMSE를 구하는 방법을 병행하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.11
• /
• pp.682-689
• /
• 2014

Due to explosive growth of mobile data traffic, many kind of techniques based on small cell is proposed as solution for phenomenon. However, those techniques essentially demands increase of backhaul capacity and causes performance degradation if not satisfied. Based on that, the approach applying the storage capacity in place of backhaul capacity, which is known as femto-caching, is proposed to reduce data downloading delay of users in system. In this paper, we expanded previous research by proposing file placement strategy with distribution of user position, which is more practical scenario. Simulation results verify that our proposed scheme has better performance gains mainly because when coverage of helpers are overlapped, users get more opportunity to connect various helpers which enables users to download a variety kind of files from helpers, not base station.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.7
• /
• pp.32-38
• /
• 2009

In this paper, we consider the overlaid system of single frequency network broadcast service and cellular-based unicast data service. In general, broadcast service and unicast data service were considered as a separate services so that different frequency resources have been allocated for each. As the frequency resource get more expensive, however, there were some efforts to provide both the broadcast and unicast service over the same frequency resource by employing the so-called superposition coding. In fact, such an service overlay system has already been accepted as a standards in 3GPP long-term evolution (LTE). In this paper, we specifically investigate such overlay system within 3GPP framework and evaluate their performance in terms of BC coverage and UC data throughput.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.37-46
• /
• 2007

In wireless sensor networks, one of the most important goals of designing protocols is to extend the network lifetime. A node has lots of duplication in sensing and communication range with surrounding nodes after many of nodes are randomly scattered. Such a heavy duplication overhead affects on the network lifetime seriously so usually all nodes need not activated constantly to carry out sensing and communication operation. One of the optimal methods of prolonging the network lifetime is finding the number of surrounding nodes necessary to maintain the network coverage and connectivity. It has been studied till the current date in wireless networks. If the neighbor necessary can be acquired to satisfy the probability using the ideal number of neighbors necessary and the acquired number of neighbors m to guarantee network coverage and connectivity. We use the result that F. Xue et al and S. Song et al derive previously in finding the neighbor necessary to guarantee the network connectivity and cany out the computer simulation to verify the necessary number. We present that our scheme satisfy the network coverage and connectivity. We present the simulation results compared with constant probability scheme through computer simulation.