• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2037-2051
• /
• 2012

Cognitive radio (CR) is envisioned as a promising paradigm of exploiting intelligence for enhancing efficiency of underutilized spectrum bands. In CR, the main concern is to reliably sense the presence of primary users (PUs) to attain protection against harmful interference caused by potential spectrum access of secondary users (SUs). In this paper, evolutionary algorithms, namely, particle swarm optimization (PSO) and genetic algorithm (GA) are proposed to minimize the total sensing decision error at the common soft data fusion (SDF) centre of a structurally-centralized cognitive radio network (CRN). Using these techniques, evolutionary operations are invoked to optimize the weighting coefficients applied on the sensing measurement components received from multiple cooperative SUs. The proposed methods are compared with each other as well as with other conventional deterministic algorithms such as maximal ratio combining (MRC) and equal gain combining (EGC). Computer simulations confirm the superiority of the PSO-based scheme over the GA-based and other conventional MRC and EGC schemes in terms of detection performance. In addition, the PSO-based scheme also shows promising convergence performance as compared to the GA-based scheme. This makes PSO an adequate solution to meet real-time requirements.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.16 no.2
• /
• pp.235-242
• /
• 1998

This study aims to detect and to reduce the multipath errors which are main errors source in high precious surveying such as GPS-aided aerial triangulation and Car Navigation. which reference receivers being fixed, when kinematic receivers move continuously, multipath is performed using smoothed code measurement and pure code measurement in the network. Through this methods, 3D RMS errors are reduced into about 30% in the single differential code solution to the kinematic receiver. This is based on the fact that the network adjustment are performed at multiple reference receivers, but positioning is carried out by the single differential methods between a reference receiver and a kinematic receiver. So it was supposed that this methods reduced the correlation errors including the atmospheric errors using the nearest receivers and can be mixed with another methods.

• Journal of Korean society of Dental Hygiene
• /
• v.16 no.5
• /
• pp.751-758
• /
• 2016

Objectives: The purpose of the study is to investigate the influence of emotional labor on job burnout in dental hygienists based on the moderating effect of employee support. Methods: A self-reported questionnaire by Likert 5 point scale was completed by 219 dental hygienists in Ulsan and Gyeongbuk from March 15 to April 9, 2016. The study instruments consisted of emotional labor, job burnout og Maslach Burnout Inventory, and employee support. Data were analyzed by descriptive analysis, Pearson's correlation, multiple regression analysis, and hierarchical regression analysis using SPSS 18.0 program. Results: Surface acting had a positive influence on achievement and negative influence on impersonal chemistry. Inner acting had a positive influence on emotional burnout and achievement. Employee support had a moderating effect on emotional labor and job burnout. Conclusions: The strategy of emotional labor management for dental hygienists is very important for job burnout solution.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.44 no.7
• /
• pp.620-628
• /
• 2016

The homotopy algorithm provides a robust method for determining optimal control, in some cases the global minimum solution, as a continuation parameter is varied gradually to regulate the contributions of the nonlinear terms. In this paper, the Successive Backward Sweep (SBS) method, which is insensitive to initial guess, augmented with a homotopy algorithm is suggested. This approach is effective for highly nonlinear problems such as low-thrust trajectory optimization. Often, these highly nonlinear problems have multiple local minima. In this case, the SBS-homotopy method enables one to steadily seek a global minimum.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.522-541
• /
• 2016

Network virtualization provides an effective way to overcome the Internet ossification problem. As one of the main challenges in network virtualization, virtual network embedding refers to mapping multiple virtual networks onto a shared substrate network. However, existing heuristic embedding algorithms evaluate the embedding potential of the nodes simply by the product of different resource attributes, which would result in an unbalanced embedding. Furthermore, ignoring the hops of substrate paths that the virtual links would be mapped onto may restrict the ability of the substrate network to accept additional virtual network requests, and lead to low utilization rate of resource. In this paper, we introduce and extend five node attributes that quantify the embedding potential of the nodes from both the local and global views, and adopt the technique for order preference by similarity ideal solution (TOPSIS) to rank the nodes, aiming at balancing different node attributes to increase the utilization rate of resource. Moreover, we propose a novel two-stage virtual network embedding algorithm, which maps the virtual nodes onto the substrate nodes according to the node ranks, and adopts a shortest path-based algorithm to map the virtual links. Simulation results show that the new algorithm significantly increases the long-term average revenue, the long-term revenue to cost ratio and the acceptance ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5212-5230
• /
• 2016

How to determine the right number of small base stations to activate in multi-cell uplinks to match traffic from a fixed quantity of K users is an open question. This paper analyses the uplink cooperative that jointly receives base stations activation to explore this question. This paper is different from existing works only consider transmitting power as optimization objective function. The global objective function is formulated as a summation of two terms: transmitting power for data and coordinated overhead for control. Then, the joint base stations activation and beamforming problem is formulated as a mixed integer second order cone optimization. To solve this problem, we develop two polynomial-time distributed methods. Method one is a two-stage solution which activates no more than K small base stations (SBSs). Method two is a heuristic algorithm by dual decomposition to MI-SOCP that activates more SBSs to obtain multiple-antennae diversity gains. Thanks to the parallel computation for each node, our methods are more computationally efficient. The strengths and weaknesses of these two proposed two algorithms are also compared using numerical results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5191-5211
• /
• 2016

It is essential to satisfy class-specific QoS constraints to provide broadband services for new generation networks. The present study proposes a QoS-driven multicast scheme for wireless networks in which the transmission rate and end-to-end delay are assumed to be bounded during a multiple multicast session. A distributed algorithm was used to identify a cost-efficient sub-graph between the source and destination which can satisfy QoS constraints of a multicast session. The model was then modified as to be applied for wireless networks in which satisfying interference constraints is the main challenge. A discrete power control scheme was also applied for the QoS-aware multicast model to accommodate the effect of transmission power level based on link capacity requirements. We also proposed random power allocation (RPA) and gradient power allocation (GPA) algorithms to efficient resource distribution each of which has different time complexity and optimality levels. Experimental results confirm that the proposed power allocation techniques decrease the number of unavailable links between intermediate nodes in the sub-graph and considerably increase the chance of finding an optimal solution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2C
• /
• pp.255-261
• /
• 2004

The problem of geolocation using multiple satellites is to determine the position of a transmitter located on the Earth by processing received signals. The specific problem addressed in this paper is that of estimating the position of a stationary transmitter located on or above the Earth's surface from measured time difference of arrivals (TDOA) by a geostationary orbiting (GSO) satellite and a low earth orbiting (LEO) satellite. The proposed geolocation method is based on the total least squares (TLS) algorithm. Under erroneous positions of the satellites together with noisy TDOA measurements, the TLS algorithm provides a better solution. By running Monte-Carlo simulations, the proposed method is compared with the ordinary least squares (LS) approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10C
• /
• pp.929-936
• /
• 2009

In this paper, we consider designing a multi-input multi-output (MIMO) overlay system for fixed MIMO wireless link, where a frequency flat narrowband channel is shared by multiple transmitter and receiver pairs. Assuming the perfect knowledge of the second-order statistics of the received legacy signals and the composite channels from the overlay transmitter to the legacy receivers, the jointly optimal linear precoder and decoder matrices of the MIMO overlay system is derived to minimize the total mean squared error (MSE) of the data symbol vector, subject to total average transmission power and zero interference induced to legacy MIMO systems already existing in the frequency band of interest. Furthermore, the necessary and sufficient condition for the existence of the optimal solution is also derived.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.5 s.43
• /
• pp.29-37
• /
• 2006

The distributed system is used that it's features of the fault tolerance and good performances. One of the distributed systems, a peer-to-peer tech, has high availability to share resources. However when peers wanna share resources, it isn't online like the peer using resources of the search time. Therefore we usually use the re-transmission method to download all resources. It's not good at the performance of the peer-to-peer system so we need to good solution. In this study, we wanna use the peer-to-peer system with the partner peer that works same download method simultaneously. We wanna have the effective performance to reduce the search stage additionally.