• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.5
• /
• pp.323-325
• /
• 2014

The consensus algorithm has a faster convergence speed as the number of cooperating neighbors increases, but the information sharing delay in the wireless network increases due to access collisions as the number of cooperating neighbors increases. Therefore, there exists a tradeoff between these two performances according to node's coverage. In this paper, we present a method of coverage control that minimizes consensus time according to network scale.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.23 no.4
• /
• pp.407-416
• /
• 2020

Recent complex battle field demands Network Centric Warfare(NCW) ability to control various parts into a cohesive unit. In path planning filed, the NCW ability increases complexity of path planning algorithm, and it has to consider a communication coverage map as well as traditional parameters such as minimum radar exposure and survivability. In this paper, pros and cons of various propagation models are summarized, and we suggest a coverage map generation method using a Longley-Rice propagation model. Previous coverage map based on line of sight has significant discontinuities that limits selection of path planning algorithms such as Dijkstra and fast marching only. If there is method to remove discontinuities in the coverage map, optimization based path planning algorithms such as trajectory optimization and Particle Swarm Optimization(PSO) can also be used. In this paper, the Longley-Rice propagation model is used to calculate continuous RF strengths, and convert the strength data using smoothed leaky BER for the coverage map. In addition, we also suggest other types of rough coverage map generation using a lookup table method with simple inputs such as terrain type and antenna heights only. The implemented communication coverage map can be used various path planning algorithms, especially in the optimization based algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1133-1141
• /
• 2009

In this paper, we present a distributed fault-tolerant topology control protocol that configure a wireless sensor network to achieve k-connectivity and (k+1)-coverage. One fundamental issue in sensor networks is to maintain both sensing coverage and network connectivity in order to support different applications and environments, while some least active nodes are on duty. Topology control algorithms have been proposed to maintain network connectivity while improving energy efficiency and increasing network capacity. However, by reducing the number of links in the network, topology control algorithms actually decrease the degree of routing redundancy. Although the protocols for resolving such a problem while maintaining sensing coverage were proposed, they requires accurate location information to check the coverage, and most of active sensors in the constructed topology maintain 2k-connectivity when they keep k-coverage. We propose the fault-tolerant topology control protocol that is based on the theorem that k-connectivity implies (k+1)-coverage when the sensing range is at two times the transmission range. The proposed distributed algorithm does not need accurate location information, the complexity is O(1). We demonstrate the capability of the proposed protocol to provide guaranteed connectivity and coverage, through both geometric analysis and extensive simulation.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.9
• /
• pp.2378-2387
• /
• 1998

This thesis proposes a design algorithm of an efficient space response compactor for Built-In Self-Testing of VLSI circuits. The proposed design algorithm of space compactors can be applied independently from the structure of Circuit Cnder Test. There are high hardware overhead cost in conventional space response compactors and the fault coverage is reduced by aliasing which maps faulty circuit's response to fault-free one. However, the proposed method designs space response compactors with reduced hardware overheads and does not reduce the fault coverage comparing to conventional method. Also, the proposed method can be extended to general N -input logic gate and design the most efficient space response L'Ompactors according to the characteristies of output sequence from CUT. The prolxlsed design algorithm is implemented by C language on a SUN SPARC Workstation, and some experiment results of the simulation applied to ISCAS'85 benchmark circuits with pseudo random patterns generated bv LFSR( Linear Feedback Shift Register) show the efficiency and validity of the proposed design algorithm.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1414-1428
• /
• 1999

ATM/B-ISDN 신호 프로토콜과 같은 통신 프로토콜의 상호운용성을 시험하기 위한 시험경우를 생성하는 알고리즘이 제안되었다 1]. 현재까지 상호운용성 시험경우 도출을 자동화하거나 이에 대한 커버리지를 분석한 경우는 없다. 본 논문은 1]에서 제안한 알고리즘을 프로그램으로 구현하여 TCP 연결설정 프로토콜에 적용하고 결과를 분석한다. 이 과정에서 (1) TCP 연결설정 프로토콜의 3방향 핸드 쉐이킹 부분을 다루지 못했던 기존의 알고리즘을 개선하고, (2) 개선된 알고리즘을 프로그램으로 구현하여 TCP 연결설정 프로토콜의 상호운용성 시험경우를 도출하고, (3) 생성된 상호운용성 시험경우를 트랜지션 커버리지 관점에서 분석하고, (4) 향상된 트랜지션 커버리지를 얻기 위하여 알고리즘 확장 방안을 제시한다.Abstract A test derivation method suitable for testing interoperability for the class of communication protocols like the ATM/B-ISDN signaling protocol was proposed 1]. Up to now, there is no work on automating derivation of the interoperability test suite and analyzing its coverage. In this paper, we implement the algorithm proposed by 1], apply it to the Transmission Control Protocol (TCP), and analyze its results. In this process, we (1) improve the algorithm that is not applicable to the TCPs three-way handshaking, (2) implement the improved algorithm as a program and derive an interoperability test suite automatically from a given pair of TCP FSMs, (3) analyze generated interoperability test suite in view of transition coverage, and (4) present a method in order to extend the algorithm for better transition coverage.

• Journal of Communications and Networks
• /
• v.16 no.3
• /
• pp.335-343
• /
• 2014

This paper considers the crucial problem of deploying wireless relays for achieving a connected wireless sensor network in indoor environments, an important aspect related to the management of the sensor network. Several algorithms have been proposed for ensuring full sensing coverage and network connectivity. These algorithms are not applicable to indoor environments because of the complexity of indoor environments, in which a radio signal can be dramatically degraded by obstacles such as walls. We first prove theoretically that the indoor relay placement problem is NP-hard. We then predict the radio coverage of a given relay deployment in indoor environments. We consider two practical scenarios; wire-connected relays and radio-connected relays. For the network with wire-connected relays, we propose an efficient greedy algorithm to compute the deployment locations of relays for achieving the required coverage percentage. This algorithm is proved to provide a $H_n$ factor approximation to the theoretical optimum, where $H_n=1+{\frac{1}{2}}+{\cdots}+{\frac{1}{n}}={\ln}(n)+1$, and n is the number of all grid points. In the network with radio-connected relays, relays have to be connected in an ad hoc mode. We then propose an algorithm based on the previous algorithm for ensuring the connectivity of relays. Experimental results demonstrate that the proposed algorithms achieve better performance than baseline algorithms.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.11
• /
• pp.463-468
• /
• 2017

To sense a wide area with mobile nodes, the uniformity of node deployment is a very important issue. In this paper, we consider the coverage problem to sense big data in sparse mobile ad hoc networks. In most existing works on the coverage problem, it has been assumed that the number of nodes is large enough to cover the area in the network. However, the coverage problem in sparse mobile ad hoc networks differs in the sense that a long-distance between nodes should be formed to avoid the overlapping coverage areas. We formulate the sensor coverage problem in sparse mobile ad hoc networks and provide the solution to the problem by a self-organized approach without a central authority. The experimental results show that our approach is more efficient than the existing ones, subject to both of coverage areas and energy consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.1
• /
• pp.18-25
• /
• 2013

In this paper, we propose a self-optimization scheme for indoor femtocell coverage in heterogeneous networks. If the femtocell coverage is larger than indoor area, neighbor cell users passing by the outer area of the femtocell coverage may request an unnecessary handover which incurs wasteful signaling overhead. On the other hand, if the coverage is smaller than the indoor area, some of indoor users might not be connected to the indoor femtocell. Therefore, we propose the method by which the femtocell coverage attains the exact indoor area employing self-organized scheme. Autonomous self TX power adjustment of the femtocell is possible because the proposed method utilizes handover request events and membership information of users that can be obtained by the femtocell itself. We show that the TX power obtained by the proposed algorithm converges to the optimal TX power that can be obtained analytically to attain the indoor coverage area.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.96-116
• /
• 2016

Sensing coverage is a fundamental issue for Wireless Sensor Networks (WSNs). Several coverage configuration protocols have been developed; most of them presume the availability of precise knowledge about each node location via GPS receivers. However, equipping each sensor node with a GPS is very expensive in terms of both energy and cost. On the other hand, several GPS-less localization algorithms that aim at obtaining nodes locations with a low cost have been proposed. Although their deep correlation, sensing coverage and localization have long been treated separately. In this paper, we analyze, design and evaluate a novel integrated framework providing both localization and coverage guarantees for WSNs. We integrate the well-known Coverage Configuration Protocol CCP with an improved version of the localization algorithm AT-Dist. We enhanced the original specification of AT-Dist in order to guarantee the necessary localization accuracy required by CCP. In our proposed framework, a few number of nodes are assumed to know their exact positions and dynamically vary their transmission ranges. The remaining sensors positions are derived, as accurately as possible, using this little initial location information. All nodes positions (exact and derived) are then used as an input for the coverage module. Extensive simulation results show that, even with a very low anchor density, our proposal reaches the same performance and efficiency as the ideal CCP based on complete and precise knowledge of sensors coordinates.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.4
• /
• pp.33-42
• /
• 2007

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 Kappa coverage 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 and Kolmogorov distance, for the sake of efficient model, was employed. From the analysis of mission time, the result of this comparative study shows the excellent performance of Burr coverage model rather than exponential coverage and S-shaped model using NTDS data. This analysis of failure data compared with the Kappa coverage model and the existing model(using arithmetic and Laplace trend tests, bias tests) is presented.