• Proceedings of the Korea Water Resources Association Conference
• /
• 2009.05a
• /
• pp.1211-1214
• /
• 2009

The goal of this research is to apply the neural networks models for the disaggregation of the pan evaporation (PE) data, Republic of Korea. The neural networks models consist of generalized regression neural networks model (GRNNM) and multilayer perceptron neural networks model (MLP-NNM), respectively. The disaggregation means that the yearly PE data divides into the monthly PE data. And, for the performances of the neural networks models, they are composed of training and test performances, respectively. The training data consist of the generated data using PARMA (1,1). And, the testing data consist of the historic data, respectively. From this research, we evaluate the impact of GRNNM and MLP-NNM for the disaggregation of the nonlinear time series data. We should, furthermore, construct the credible data of the monthly PE data from the disaggregation of the yearly PE data, and can suggest the methodology for the irrigation and drainage networks system.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.8
• /
• pp.666-671
• /
• 2000

With the current advances in optical WDM (Wavelength Division Multiplexing) networking technologies and the increasing demand for network bandwidth the Next Generation Internet is expected to be a network that runs IP(Internet Protocol) directly over WDM-based optical networks. The network control architecture for the IP over WDM networks is different from that of traditional Internet since the underlying WDM devices have more constraints than electronic IP routers such as the lack of optical buffers and wavelength continuity property etc. In this paper we introduce several architectural models for implementing IP over WDM networks and propose an integrated network control framework for the IP over WDM networks. This framework leverages the traffic engineering control architecture for the MPLS (Multi-Protocol Label Switching) networks and is mainly developed for the IP over packet-switched WDM networks. We also report several preliminary simulation results of contention resolution schemes in the packet-switched WDM networks.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.35 no.2
• /
• pp.53-69
• /
• 2010

This paper proposes an ant-based routing algorithm, Ant System-Routing in wireless Senor Networks(AS-RSN), for wireless sensor networks. Using a transition rule in Ant System, sensors can spread data traffic over the whole network to achieve energy balance, and consequently, maximize the lifetime of sensor networks. The transition rule advances one of the original Ant System by re-defining link cost which is a metric devised to consider energy-sufficiency as well as energy-efficiency. This metric gives rise to the design of the AS-RSN algorithm devised to balance the data traffic of sensor networks in a decentralized manner and consequently prolong the lifetime of the networks. Therefore, AS-RSN is scalable in the number of sensors and also robust to the variations in the dynamics of event generation. We demonstrate the effectiveness of the proposed algorithm by comparing three existing routing algorithms: Direct Communication Approach, Minimum Transmission Energy, and Self-Organized Routing and find that energy balance should be considered to extend lifetime of sensor network and increase robustness of sensor network for diverse event generation patterns.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.3
• /
• pp.225-231
• /
• 1992

In this paper, queuing networks with open chains are considerd to analyze the performance of packet switching networks. Networks are classified into backbone and local access networks. Networks for performance analysis are distributed to twelve regions and DNS is the backbone. Analysis was conducted using the real values from the input to existing networks and mathematical estimation values. As the result of analysis, the mean of end-to-and delay for each chain was presented. Except special regions, we found that there was a little difference between real values and mathematical estimation values. However, there could be a performance problem in total networks due to the increase of communication volumes in each region. So we proposed some solutions to this problem.

• Journal of Korea Multimedia Society
• /
• v.20 no.12
• /
• pp.1940-1950
• /
• 2017

The security threat types in underwater communication networks environment are almost the same as the terrestrial, but the security of mechanisms the terrestrial RF-based networks environment can not be directly applied due to not only the limited resources of each node but also unsafe channel such as low propagation delay, high bit error rate etc. Nevertheless there has not been much research on the security of underwater acoustic communication networks. Therefore, in this paper analyzes the differences between the terrestrial communication networks and underwater acoustic communication networks, and identifies issues that are the starting points of underwater communication networks security research.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.411-414
• /
• 2006

Topology information can be aggregated in the network constructed hierarchically and aggregating topology information is known as TA(Topology Aggregation) and TA is very important for scalability in networks. It is a very important elements to extend networks and routing in networks. In paticular, routing and TA algorithm are much influence on networks performance in PNNI. Therefore, in this paper, we design and implement routing simulator for TA in PNNI.

• Journal of Internet Computing and Services
• /
• v.18 no.4
• /
• pp.7-17
• /
• 2017

Despite various types of online social networks having different topological and functional characteristics, the kinds of online social networks considered in social recommendations are highly restricted. The pervasiveness of social networks has brought scholarly attention to expanding the scope of social recommendations into more diverse and less explored types of online social networks. As a preliminary attempt, this study examined the information-sharing patterns of a new type of online social network - unilateral (directed) network - and assessed the feasibility of the network as a useful information source. Specifically, this study mainly focused on the presence of shared interests in unilateral networks, because the shared information is the inevitable condition for utilizing the networks as a feasible source of personalized recommendations. As the results, we discovered that user pairs with direct and distant links shared significantly more similar information than the other non-connected pairs. Individual users' social properties were also significantly correlated with the degree of their information similarity with social connections. We also found the substitutability of online social networks for the top cohorts anonymously chosen by the collaborative filtering algorithm.

• 한국정보통신설비학회:학술대회논문집
• /
• 2003.08a
• /
• pp.307-309
• /
• 2003

In the initial deployment stage of optical access networks, optical network systems and optical fiber cables have been provided mainly for commercial buildings or users in KT. According to the demand of residential users who expect to subscribe broadband multimedia services as high bit rate services, the optical access networks get closer to the residential users as FTTCab or FTTH So, it is very important to install optical access networks economically and effectively because that the total cost and usability of optical fiber cables depends on that. Especially, one of characteristics in access networks is the possibility of variation on services demands and technology evolution. Also access networks must be prepared for the final deployment, FTTH. Therefore, the designing and planning of optical access networks are coming to be very important activity for most of telecommunications service providers.

• ETRI Journal
• /
• v.28 no.1
• /
• pp.99-102
• /
• 2006

In this letter, we study the protection problem in wavelength division multiplexing (WDM) optical networks, and propose a novel dynamic heuristic algorithm called differentiated reliable segment protection (DRSP). Differing from previous work, DRSP can effectively avoid the trap problem and is able to find a feasible solution for each connection request. Therefore, DRSP outperforms the previous work. Simulation results have shown to be promising.

• ETRI Journal
• /
• v.34 no.4
• /
• pp.591-601
• /
• 2012

Unstructured peer-to-peer (p2p) networks usually employ flooding search algorithms to locate resources. However, these algorithms often require a large storage overhead or generate massive network traffic. To address this issue, previous researchers explored the possibility of building efficient p2p networks by clustering peers into communities based on their social relationships, creating social-like p2p networks. This study proposes a social relationship p2p network that uses a measure based on Hebbian theory to create a social relation weight. The contribution of the study is twofold. First, using the social relation weight, the query peer stores and searches for the appropriate response peers in social-like p2p networks. Second, this study designs a novel knowledge index mechanism that dynamically adapts social relationship p2p networks. The results show that the proposed social relationship p2p network improves search performance significantly, compared with existing approaches.