• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.3
• /
• pp.341-345
• /
• 2010

WMN is one of efficient solutions to provide Internet services for users by forming wireless backbone networks with wireless links. The dominant technology for WMNs is the IEEE 802.11, which provides multi-channel and multi-rate capabilities. One of important issues in WMNs is the network capacity and it is essential to design a multi-channel protocol that leverages the network capacity. However, when wireless links that use different data rates operate on the common channel, the performance of high-rate links is severely degraded by the presence of the low-rate links, which is often referred as performance anomaly. In this paper, we propose a Tree-based Channel Assignment (TreeCA) protocol to mitigate the performance anomaly problem by distributing data rates over multiple channels. TreeCA performs channel assignments based on the tree WMN architecture to accommodate the Internet traffics efficiently. Parent nodes on the tree distribute their child nodes over multiple channels so that the performance anomaly is reduced. Through simulations, we observed that the proposed TreeCA outperforms the existing multi-channel protocols for WMNs.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1370-1376
• /
• 2000

Consider the problem to updata breadth-First Spanning Tree in response to topology change of the network. The paper proposes an efficient distributed algorithm that solves such a problem after several processors and links are added and deleted. Its message complexity and its ideal-time complexity are O(p√q+q+a+n') respectively, where n' is the number fo processors in the network after the topology change, a is the number of added links, p is the total number of links in the biconnected component (of the network before the topology change) including the detected links or added links, and q is the total number of processors in the biconnected component (of the network before the topology change) including the deleted links or added links, and q is the total number of processors in the biconnected component including the deleted links or added links.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4C
• /
• pp.273-281
• /
• 2002

Recently, demand for real-time data and multimedia data is rapidly increasing, and it is impossible for mobile Ad Hoc networks with only best effort service to efficiently transfer such data. So, we absolutely need the QoS service which reserves the communication resources in advance. The existing routing protocols, which assume that the links between nodes are bidirectional, provide the convenience for the route discovery and maintenance, but can not support the routing function for the unidirectional links due to the wireless link property easily changing with time under the real wireless environment. In order to solve such problems, in this dissertation we suggested a unidirectional QoS routing a waste of communication resources. The waste of protocol that supports unidirectional links and reduces communication resources is reduced by establishing the shortest route suitable to QoS support, considering in advance the usable communication resources at each node.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4B
• /
• pp.394-402
• /
• 2009

In this paper, we present a new analytical model for estimating the blocking performance of multi-fiber WDM networt:s with sparse and limited wavelength conversion (SLWC). The proposed model is a reduced-load approximation model that can obtain accurate estimates of blocking probability of such networks. Our model employs three new recurrence formulae to obtain the free wavelength distribution on a multi-fiber link, the free wavelength distribution after limited-range wavelength conversion and the end-to-end blocking probability of a multi-hop path, respectively. From the numerical results on the NSFNET, we demonstrate that the blocking performance of two-fiber NSFNET with three wavelength-convertible nodes, each of which translates an input wavelength to its adjacent output wavelengths, closely approximates the blocking performance of full wavelength conversion.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.4
• /
• pp.572-580
• /
• 2021

In order to reduce transmission delay and increase reliability in networks, mainly high-performance and high-power network equipment is used to guarantee network quality. In this paper, we propose an optimization algorithm to minimize the energy consumed when transmitting traffic in networks with a bundle link composed of multiple physical cables. The proposed optimization algorithm is a meta-heuristic method, which uses tabu search algorithm. In addition, it is designed to minimize transmission energy by minimizing the cables on the paths of the source and destination nodes for each traffic. In the proposed optimization algorithm, performance evaluation was performed in terms of the number of cables used in the transmission and the link utilization for all traffic on networks, and the performance evaluation result confirmed the superior performance than the previously proposed method.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.10
• /
• pp.949-954
• /
• 2016

The usage of Social Network in business environment is now processing various methods. The purpose of this paper is doing a simulation about how each node of social network reacts to a special input, and how a specific node have an effect to other nodes. Also, when we change weight of node in the same input, we can trace about change of node status in real time. So, we can use this model for identification of important person in social network, and we can use it for checking the reaction of person in specific input. we use VENSIM program for modeling and simulation process.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2780-2785
• /
• 1997

Although KBANN(knowledge-based artificial neural network) has been shown to be more effective than other machine learning algorithms, KBANN doesn't have the theory refinement capability because the topology of the network can't be altered dynamically. Although TopGen algorithm was proposed to extend the ability of KABNN in this respect, it also had some defects due to the connection of hidden nodes from all input nodes and the use of beam search. An algorithm, which could solve this TopGen's defects by adding the hidden nodes connected from only related input nodes and using hill-climbing search with backtracking, is proposed.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.599-602
• /
• 2005

무선네트워크 TCP는 패킷손실을 혼잡에 의한 것으로 보고 전송률을 감소시키는데, 고대역폭 연결의 효율성을 높이기 위해 M-TCP에서의 링크이용율에 따른 트래픽 처리를 연구한다. M-TCP는 무선네트워크에서 연결 중단이 자주 발생하고 동적으로 변하는 대역폭으로 인한 비트율이 낮은 무선 링크에 효과적인 프로토콜이다. 연견 중단 시 송신노드가 인접한 경우나 멀리 떨어져 있는 경우 유리하며, M-TCP가 링크 계층 솔루션과 함께 사용될 경우 TCP 성능이 향상된다. 본 논문에서는 백그라운드 트래픽 흐름은 그대로 유지하여 M-TCP상에서 연결의 개수를 늘린 후 그 결과 발생하는 대역폭 공유 반응 및 링크 이용율로 M-TCP 연결로부터 생긴 트래픽 처리를 분석한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.578-580
• /
• 2009

Wireless Sensor Networks(WSNs) has been used for various applications. It is optimized to low power operation than various function and transmission reliability because of limited power by batteries. but it is necessary to guarantee of reliability for using exact data for more diversity purpose. In WSNs environment composed by multi-hop, it is guarantee to end-to-end transmission reliability based hop-by-hop reliability. however, IEEE 802.15.4 standard is not consider link-layer reliability. in this paper, we propose energy efficient Reliable Link-layer Protocol for Wireless Sensor Networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2533-2540
• /
• 2013

In multihop cellular network environments, the mobility of nodes is a major obstacle to find a reliable routing path between a mobile node (MN) and the access node (AN). Therefore, in this paper, we propose a fast and reliable neighbor discovery protocol that enables the fast and reliable neighbor discovery by considering the node mobility in the multihop cellular network. The proposed neighbor discovery protocol inhibits the transmission of unnecessary control messages to quickly find a suitable neighbor node (NN) and performs a priority-based access control to transmit control messages without collision in the order of NN desirable to be selected. Simulation results show that the proposed neighbor discovery protocol can discover the NNs faster than the conventional scheme and select a more reliable relay node although the number of neighbor nodes increases and the node mobility increases.