• 디지털융복합연구
• /
• 제9권1호
• /
• pp.25-36
• /
• 2011

This paper examines user's loyalty to social network sites (SNS) from switching costs (SC) incurred by both technology and social factors. We propose a research model specifying that the perceived values of resources of the factors affect the SC and the SC determine user's loyalty. Empirical results show that technology variables of ease of use and privacy controllability, and social variables such as network size, usefulness of SNS activities, and awareness of network status have significant effect on SC. In particular, ease of use is negatively associated with SC. Since it is shown that in overall the impact of social factors is stronger than that of technology factors, we can interpret that technological superiority itself does not lead to the success of SNS. Contributions of this paper are: 1) application of SC in SNS research from the resource based perspective, which can be used for developing strategies of sustainable SNS, and 2) provision of different perspective toward the variable of ease of use, which has been considered an important factor of technology acceptance.

• Journal of Electrical Engineering and Technology
• /
• 제5권1호
• /
• pp.45-53
• /
• 2010

This paper presents an improved parallel particle swarm optimization approach (IPPSO) based decomposed network for economic power dispatch with discontinuous fuel cost functions. The range of partial power demand corresponding to the partial output powers near the global optimal solution is determined by a flexible decomposed network strategy and then the final optimal solution is obtained by parallel Particle Swarm Optimization. The proposed approach tested on 6 generating units with smooth cost function, and to 26-bus (6 generating units) with consideration of prohibited zone effect, the simulation results compared with recent global optimization methods (Bee-OPF, GA, MTS, SA, PSO). From the different case studies, it is observed that the proposed approach provides qualitative solution with less computational time compared to various methods available in the literature survey.

• 산업경영시스템학회지
• /
• 제34권1호
• /
• pp.33-41
• /
• 2011

This paper considers a topological optimization of a network design with mean packet delay and node connectivity constraints. The objective is to find the topological layout of links, at minimal cost. This Problem is known to be NP-hard. To efficiently solve the problem, a scatter search algorithm is proposed. An illustrative example is used to explain and test the proposal approach. Experimental results show evidence that the proposal approach performs more efficiently for finding a good solution or near optimal solution in comparison with a genetic approach.

• Journal of information and communication convergence engineering
• /
• 제10권4호
• /
• pp.329-336
• /
• 2012

For designing broadcast protocols in mobile ad hoc networks (MANETs), one of the important goals is to reduce the rebroadcast packets redundancy while reaching all the nodes in network. In this paper, we propose a probabilistic broadcasting mechanism based on selfishness and additional coverage in MANETs. Our approach dynamically adjusts the rebroadcast probability according to the extra covered area and number of neighbor nodes. By these two factors, mobile hosts can be classified into three groups: normal, low selfishness, and high selfishness groups. The nodes in the normal group forward packets for other nodes with high probability, whereas the nodes in the low selfishness group rebroadcast packets with low probability and the nodes in the high selfishness group do not rebroadcast packets. We compared our approach with simple flooding and the fixed probabilistic approach. The simulation results show that the proposed schemes can significantly reduce the number of retransmissions by up to 40% compared simple flooding and fixed probabilistic scheme without significant reduction in the network reachability and end-to-end packet delay.

• Korean Journal of Hydrosciences
• /
• 제10권
• /
• pp.47-58
• /
• 1999

Protection of groundwater resources from contamination has been of increasing concern throughout the past decades. In practice, however, groundwater monitoring is performed based on the experience and intuition of experts or on the convenience. In dealing with groundwater contamination, we need to know what contaminants have the potential to threat the water quality and the distribution and concentration of the plumes. Monitoring of the subsurface environment through remote geophysical techniques or direct sampling from wells can provide such information. Once known, the plume can be properly menaged. Evaluation of existing methodologies for groundwater monitoring network design revealed that one should select an appropriate design method based on the purpose of the network and the avaliability of field information. Integer programming approach, one of the general purpose network design tools, and a cost-to-go function evaluation approach for special purpose network design were tested for field applicability. For the same contaminated aquifer, two approaches resulted in different well locations. The amount of information, however, was about the same.

• 한국국방경영분석학회지
• /
• 제26권1호
• /
• pp.56-69
• /
• 2000

A frequency assignment problem on time division duplex system is considered. Republic of Korea Army (ROKA) has been establishing an infrastructure of tactical communication (SPIDER) system for next generation and it will be a core network structure of system. VHF system is the backbone network of SPIDER, that performs transmission of data such as voice, text and images. So, it is a significant problem finding the frequency assignment with no interference under very restricted resource environment. With a given arbitrary configuration of communications network, we find a feasible solution that guarantees communication without interference between sites and relay stations. We formulate a frequency assignment problem as an Integer Programming model, which has NP-hard complexity. To find the assignment results within a reasonable time, we take a genetic algorithm approach which represents the solution structure with available frequency order, and develop a genetic operation strategies. Computational result shows that the network configuration of SPIDER can be solved efficiently within a very short time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권10호
• /
• pp.2529-2547
• /
• 2012

In this paper, we use a quadrotor-based mobile sink to gather sensor data from the terrestrial deployed wireless sensor network. By analyzing the flight features of the mobile sink node, we theoretically study the flight constraints of height, velocity, and trajectory of the mobile sink node so as to communicate with the terrestrial wireless sensor network. Moreover, we analyze the data amount which the mobile sink can send when it satisfies these flight constraints. Based on these analysis results, we propose a data acquisition approach for the mobile sink node, which is discussed detailed in terms of network performance such as the transmission delay, packet loss rate, sojourning time and mobile trajectory when given the flying speed and height of the mobile sink node. Extensive simulation results validate the efficiency of the proposed scheme.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.2498-2501
• /
• 2003

In this paper, we present a wavelet neural network (WNN) approach to the solution of the path tracking problem for mobile robots that possess complexity, nonlinearity and noise. First, we discuss a WNN based control system where the control signals are directly obtained by minimizing the difference between the reference track and the pose of a mobile robot. This compact network structure is helpful to determine the number of hidden nodes and the initial value of weights. Then, the data with various noises provided by odometric and external sensors are here fused together by means of an Extended Kalman Filter (EKF) approach for the pose estimation problem of mobile robots. This control process is a dynamic on-line process that uses the wavelet neural network trained via the gradient-descent method with estimates from EKF. Finally, we verify the effectiveness and feasibility of the proposed control system through simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권11호
• /
• pp.5673-5691
• /
• 2019

Information centric mobile network can significantly improve the data retrieving efficiency by caching contents at mobile edge. However, the cache pollution attack can affect the data obtaining process severely by requiring unpopular contents deliberately. To tackle the problem, we design an algorithm of mitigating cache pollution attacks in information centric mobile network. Particularly, the content popularity distribution statistic is proposed to detect abnormal behavior. Then a probabilistic caching strategy based on abnormal behavior is applied to dynamically maintain the steady-state distribution for content visiting probability and achieve the purpose of defense. The experimental results show that the proposed scheme can achieve higher request hit ratio and smaller latency for false locality content pollution attack than the CacheShield approach and the baseline approach where no mitigation approach is applied.

• ETRI Journal
• /
• 제18권3호
• /
• pp.127-145
• /
• 1996

A new analytic framework based on a linear algebra approach is proposed for examining the performance of a direct sequence spread spectrum (DS/SS) slotted ALOHA wireless communication network systems with delay capture. The discrete-time Markov chain model has been introduced to account for the effect of randomized time of arrival (TOA) at the central receiver and determine the evolution of the finite population network performance in a single-hop environment. The proposed linear algebra approach applied to the given Markov problem requires only computing the eigenvector ${\prod}$ of the state transition matrix and then normalizing it to have the sum of its entries equal to 1. MATLAB computation results show that systems employing discrete TOA randomization and delay capture significantly improves throughput-delay performance and the employed analysis approach is quite easily and staightforwardly applicable to the current analysis problem.