• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.49-58
• /
• 2006

One of the first decisions that a radio network designer must take is the location of base stations and the distance between them in order to give the best coverage to a region and, possibly, to reduce deployment costs. In this paper, the authors give an insight to this matter by presenting a possible solution to a real problem: Planning the base stations layout for a universal mobile telecommunications system (UMTS) in the city of Barcelona. At the basis of this problem, there is the interdependence between coverage and capacity in a wideband-code division multiple access (W-CDMA) system, which is a new element in the planning of BS layout for mobile communications. This aspect has been first treated with an analytical study of the cell coverage range for a specific environment and service. The achieved results have been checked with the help of snapshot simulations together with a geographical information system (GIS) tool incorporated in the simulator that allows to perform analysis and to visualize results in a useful way. By using the simulator, it is also possible to study a more complex environment, that of a set of base stations providing multiple services to a large number of users.

• Management Science and Financial Engineering
• /
• v.12 no.1
• /
• pp.127-142
• /
• 2006

In this paper, we present a frequency reassignment problem (FRP) that arises when we add new base stations to resolve hot-spots or to expand the coverage of a code division multiple access (CDMA) network. For this problem, we develop an integer programming (IP) model along with some valid inequalities and preprocessing rules. Also, we develop an effective heuristic procedure that solves two sub-problems induced from the original problem in repetition. Computational results show that the proposed heuristic procedure finds a feasible solution of good quality within reasonable computation time. Also, the lower bound by-produced from the heuristic procedure is quite strong.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3921-3944
• /
• 2015

Currently Energy-Saving (ES) methods in cellular networks could be improved, as compensation method for irregular Base Station (BS) deployment is not effective, most regional ES algorithm is complex, and performance decline caused by ES action is not evaluated well. To resolve above issues, a low-complexity energy efficient BS cooperation mechanism for Long Time Evolution (LTE) networks is proposed. The mechanism firstly models the ES optimization problem with coverage, resource, power and Quality of Service (QoS) constraints. To resolve the problem with low complexity, it is decomposed into two sub-problems: BS Mode Determination (BMD) problem and User Association Optimization (UAO) problem. To resolve BMD, regional dynamic multi-stage algorithms with BS cooperation pair taking account of load and geographic topology is analyzed. And then a distributed heuristic algorithm guaranteeing user QoS is adopted to resolve UAO. The mechanism is simulated under four LTE scenarios. Comparing to other algorithms, results show that the mechanism can obtain better energy efficiency with acceptable coverage, throughput, and QoS performance.

• Industrial Engineering and Management Systems
• /
• v.13 no.1
• /
• pp.29-42
• /
• 2014

Extensive research has been conducted on supplier evaluation and selection as a strategic and crucial component of supply chain management in recent years. However, few articles in the previous literature have been dedicated to the use of fuzzy inference systems as an aid in decision-making. Therefore, this essay attempts to demonstrate the application of this method in evaluating suppliers, based on a comprehensive framework of qualitative and quantitative factors besides the effect of gradual coverage distance. The purpose of this study is to investigate the applicability of the numerous measures and metrics in a multi-objective optimization problem of the supply chain network design with the aim of managing the allocation of orders by coordinating the production lines to satisfy customers' demand. This work presents a dynamic non-linear programming model that examines the important aspects of the strategic planning of the manufacturing in supply chain. The effectiveness of the configured network is illustrated using a sample, following which an exact method is used to solve this multi-objective problem and confirm the validity of the model, and finally the results will be discussed and analyzed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3171-3191
• /
• 2016

Due to growing demand on wireless data traffic, a large number of different types of base stations (BSs) have been installed. However, space-time dependent wireless data traffic densities can result in a significant number of idle BSs, which implies the waste of power resources. To deal with this problem, we propose an active state control algorithm based on semi-Markov decision process (SMDP) for a heterogeneous network. A MDP in discrete time domain is formulated from continuous domain with some approximation. Suboptimal on-line learning algorithm with a random policy is proposed to solve the problem. We explicitly include coverage constraint so that active cells can provide the same signal to noise ratio (SNR) coverage with a targeted outage rate. Simulation results verify that the proposed algorithm properly controls the active state depending on traffic densities without increasing the number of handovers excessively while providing average user perceived rate (UPR) in a more power efficient way than a conventional algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.601-602
• /
• 2011

In wireless sensor networks, coverage problem is a fundamental issue that has attracted considerable attention in recent years. Most node scheduling patterns utilize the adjustable range of sensor to minimize the sensing energy consumption. However, a large source of consumption of communication energy of sensor is not strictly taken into account. In this paper, we introduce an energy-efficient pattern that is used to minimize the communication energy consumption of a sensor network. Calculations and extensive simulation are conducted to evaluate the efficiency of the new pattern comparing to existing ones.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.355-368
• /
• 2001

Protocol conformance test is used to promote interoperability of protocol implementatons developed by venders. Non-interopcrability between protocol implementations may be caused by ambiguity and/or misintellJretation of the protocol specifications by vendors. Conventional method on protocol conformance test has been standardized by IS0;IEC JTCI with the purpose of whether a protocol implementation conforms to its specification. However, sometimes the conventional method gives wrong test results because the test is based on static test sequences. This problem is caused by the fact as some failed transitions of a protocol FSM included in test sequences have an effect on the test result of transitions to be tested. In this paper, a new approach called Dynamic Conformance Test Method (DCTM) is proposed to solve this problem. DCTM dynamically selects test sequence durng testing depending on an information showing an alternative path without failed tranistions. As a result, the fault coverage of the DCTM is better than that of the conventional test method. In order to demonstrate the fault coverage of DCTM compared to that of the conventional method. a testing tool is implemented and appied to the TCP protocol.

• Communications for Statistical Applications and Methods
• /
• v.16 no.2
• /
• pp.363-372
• /
• 2009

The difference of two independent binomial proportions is frequently of interest in biomedical research. The interval estimation may be an important tool for the inferential problem. Many confidence intervals have been proposed. They can be classified into the class of exact confidence intervals or the class of approximate confidence intervals. Ore may prefer exact confidence interval s in that they guarantee the minimum coverage probability greater than the nominal confidence level. However, someone, for example Agresti and Coull (1998) claims that "approximation is better than exact." It seems that when sample size is large, the approximate interval is more preferable to the exact interval. However, the choice is not clear when sample, size is small. In this note, an exact confidence and an approximate confidence interval, which were recommended by Santner et al. (2007) and Lee (2006b), respectively, are compared in terms of the coverage probability and the expected length.

• Journal of the Korean Data and Information Science Society
• /
• v.15 no.4
• /
• pp.743-752
• /
• 2004

In this paper, we develop the Bayesian model selection procedure using the reference prior for comparing two nested model such as the independent and intraclass models using the distance or divergence between the two as the basis of comparison. A suitable criterion for this is the power divergence measure as introduced by Cressie and Read(1984). Such a measure includes the Kullback -Liebler divergence measures and the Hellinger divergence measure as special cases. For this problem, the power divergence measure turns out to be a function solely of $\rho$, the intraclass correlation coefficient. Also, this function is convex, and the minimum is attained at $\rho=0$. We use reference prior for $\rho$. Due to the duality between hypothesis tests and set estimation, the hypothesis testing problem can also be solved by solving a corresponding set estimation problem. The present paper develops Bayesian method based on the Kullback-Liebler and Hellinger divergence measures, rejecting $H_0:\rho=0$ when the specified divergence measure exceeds some number d. This number d is so chosen that the resulting credible interval for the divergence measure has specified coverage probability $1-{\alpha}$. The length of such an interval is compared with the equal two-tailed credible interval and the HPD credible interval for $\rho$ with the same coverage probability which can also be inverted into acceptance regions of $H_0:\rho=0$. Example is considered where the HPD interval based on the one-at- a-time reference prior turns out to be the shortest credible interval having the same coverage probability.

• Journal of Periodontal and Implant Science
• /
• v.42 no.3
• /
• pp.105-109
• /
• 2012

Purpose: Soft tissue recessions frequently cause esthetic disharmony and dissatisfaction. Compared with soft tissue coverage around a tooth, the coverage of an implant site is obviously unpredictable. Particularly in the cases of thin mucosa, a significant greater amount of recession takes place compared to thick mucosa. To overcome this problem, this case report demonstrates a two-step mucosal dehiscence coverage technique for an endosseous implant. Methods: A 33-year-old female visited us with the chief complaint of dissatisfaction with the esthetics of an exposed implant in the maxillary left cental incisor region. A partial-thickness pouch was constructed around the dehiscence. A subepithelial connective tissue graft was positioned in the apical site of the implant and covered by a mucosal flap with normal tension. At 12 months after surgery, the recipient site was partially covered by keratinized mucosa. However, the buccal interdental papilla between implant on maxillary left central incisor region and adjacent lateral incisor was concave in shape. To resolve the mucosal recession after the first graft, a second graft was performed with the same technique. Results: An esthetically satisfactory result was achieved and the marginal soft tissue level was stable 9 months after the second graft. Conclusions: The second graft was able to resolve the mucosal recession after first graft. This two-step approach has the potential to improve the certainty of esthetic results.