• Convergence Security Journal
• /
• v.12 no.6
• /
• pp.69-75
• /
• 2012

MANET(Mobile Ad-hoc Network) is target of many attacks because of dynamic topology and hop-by-hop data transmission method. In MANET, location setting of intrusion detection system is difficult and attack detection using information collected locally is more difficult. The amount of traffic grow, intrusion detection performance will be decreased. In this paper, MANET is composed of zone form and we used random projection technique which reduces dimension without loss of information in order to perform stable intrusion detection in even massive traffic. Global detection node is used to detect attacks which are difficult to detect using only local information. In the global detection node, attack detection is performed using received information from IDS agent and pattern of nodes. k-NN and ZBIDS were experimented to evaluate performance of the proposed technique in this paper. The superiority of performance was confirmed through the experience.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9B
• /
• pp.563-568
• /
• 2007

This paper proposes a routing establishment method for improving path stability in mobile ad-hoc networks. In mobile ad-hoc networks, the network topology is highly dynamic due to the node mobility unlike wired networks. Since the existing methods are based on the shortest path algorithm with the minimum hop count regardless of the path stability, it could lead to packet loss and path disconnection in mobile ad-hoc networks. In particular, if control packets and critical data are transmitted on the unstable path, it causes serious problems. Therefore, this paper proposes one approach in order to minimize packet loss and path disconnection by considering the node mobility. After the destination node receives multiple RREQ messages, it selects the stable path through the proposed MinMax algorithm according to the node speed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.8
• /
• pp.660-666
• /
• 2014

In this paper, we consider a classification criteria of sensor nodes based on equipment function, and propose a routing search algorithm between node when an IP-USN is applied inside a ship. whereas a tree-type routing algorithm is applied to the limited mobile enviroment, such as engine room or machine room, a mesh-type routing alogrithm is to free mobile enviroment, such as passager corridor liviing quarters or restanrats areas. For mesh-type routing, it is necessary to maintain a seamless route path between a sink node and sensor nodes for which we consider a novel message exchange periodically. We proposed a new message, RDES message, which is issued periodically to update the topology of sensor node and check a connectivity between nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.11
• /
• pp.939-954
• /
• 2013

Korean military is developing the next generation military satellite communications system in order to achieve the requirements of future military satellite communication such as high speed, high capacity, survivability, all IP networking, and on-the-move. In this paper, we survey and analyze the research interests about optimal resource allocation and IP networking such as MF-TDMA, random access, satellite IP routing, and PEP. Conventional researches have focused on the increase in channel throughput and efficiency. In addition to these measurements, we consider heterogeneous satellite terminals, full mesh topology, distributed network, anti-jamming, and the like which are the special characteristics of the next generation military satellite communications system. Based on this, we present key research issues and evaluation on the issues by simulation.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.12
• /
• pp.247-255
• /
• 2011

Most existing clustering protocols have been aimed to provide balancing the residual energy of each node and maximizing life-time of wireless sensor networks. In this paper, we present the adaptive clustering strategy related to sink position for clustering protocols in wireless sensor networks. This protocol allows networks topology to be adaptive to the change of the sink position by using symmetrical clustering strategy that restricts the growth of clusters based on depth of the tree. In addition, it also guarantees each cluster the equal life-time, which may be extended compared with the existing clustering protocols. We evaluated the performance of our clustering scheme comparing to LEACH and EEUC, and observe that our protocol is observed to outperform existing protocols in terms of energy consumption and longevity of the network.

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.75-76
• /
• 2008

본 논문에서는 한국형 에너지 관리 시스템의 계통 해석용 프로그램을 위한 공통 데이터 모델의 구축에 대해 다루었다. 공통 데이터 모델이란 다양한 어플리케이션이 공유하여 사용할 수 있는 계통 모델의 데이터베이스를 가리키며 본 논문에서는 토폴로지 프로세서(topology processor, TP), 상태추정(state estimator, SE), 급전원 조류계산(dispatcher power flow, DPF), 휴전계획(outage scheduler, OS), 부하 분포계수(bus load distribution factor, BLDF), 송전 손실 민감도 계수(transmission loss sensitivity factor, TLSF) 등을 위한 공통 모델에 대해 다루었다. 공통 모델의 구축을 위해 각 어플리케이션에서 필요한 정보를 수집하여 전력계통의 토폴로지 구조과 계통 설비를 모델링 하였다. 최종적으로 계층적(hierarchy) 구조와 비계층적(non-hierarchy) 구조로 나뉘어진 직접(direct) 및 간접(indirect) 인덱스 코드를 사용하여 데이터로의 빠른 접근이 가능한 실시간 데이터베이스 형태를 제시하였다.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.110-122
• /
• 2005

Bluetooth has been reputed as a wireless networking technology supplying ad-hoc networks between digital devices. In particular, bluetooth scatternet is a most essential part for dynamic ad-hoc networks. But past researches on bluetooth scatternet has hardly treated dynamic scatternet environment. In this paper, we proposed a scatternet reformation algorithm for the case that some nodes escape from the scatternet. The proposed algorithm is a general algorithm which can be applied to many types of bluetooth scatternet regardless of the topology. The proposed algorithm has short reformation time delay because the process has only page process (not including inquiry process ). The algorithm is operated based on Recovery Node Vector which is composed of Recovery Master and Recovery Slave. In this paper, we performed the real hardware experiments for evaluating the performance of the proposed algorithm. In that experiments, we measured the reformation time and reformation probability. In comparison with the case including inquiry process, the proposed algorithm had the improvement in reformation time delay and we obtained high success rate over 97%.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.336-345
• /
• 2012

Autonomous system (AS) business relationships and their inference have been widely studied by network researchers in the past. An important application of inferred AS relationships can be the prediction of AS paths between a source and destination AS within a model. However, besides knowing the topology and inferred AS relationships, AS path prediction within a model needs to be understood in order for us to know how we can derive border gateway protocol (BGP) policies from AS relationships. In this paper, we shed light onto the predictive capabilities of AS relationships by investigating whether they can be translated into BGP policies such that inferred AS paths are consistent with real AS paths, e.g., paths observed from BGP routing tables. Our findings indicate that enforcing constraints such as the well-known valley-free property and the widely assumed preference of customer routes always results in a very low consistency for AS path inference. In addition, this is true irrespective of whether customer, peer, or provider routes are preferred. Apparently, applying such constraints eliminates many "correct" paths that are observed in BGP routing tables and that are propagated in a simple shortest path model where AS relationships are ignored. According to our findings, deriving BGP routing policies for predicting with high accuracy AS paths in a model directly from AS relationships is still difficult.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.7
• /
• pp.1390-1406
• /
• 1994

This study deals with the DMCLP(Delay constrained Minimum Cost Loop Problem)-one of problems arising in the design of local access computer networks. The problem consists of finding a set of rings to satisfy the traffic requirements of end user terminals. In the problem, the objective is to minimize the total link cost. This paper presents heuristic algorithm which consists of two phases for this problem, under the constraints that the number of nodes served by a single ring is limited and network mean delay is dropped within the desired time. The algorithm is derived using the clusters obtained by the existing MCLP(Minimum Cost Loop Problem) algorithm and a trade-off criterion explained in the paper. Actually, simulation results in that the proposed algorithm in this paper produces better solution than the existing MCLP algorithm modified. In addition, the algorithm has the relatively short running time.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.189-198
• /
• 2009

Unstructured peer-to-peer systems are most commonly used in today's internet. But file placement is random in these systems and no correlation exists between peers and their contents. There is no guarantee that flooding queries will find the desired data. In this paper, we propose to cluster nodes in unstructured P2P systems using the agglomerative hierarchical clustering algorithm to improve the search method. We compared the delay time of clustering the nodes between our proposed algorithm and the k-means clustering algorithm. We also simulated the delay time of locating data in a network topology and recorded the overhead of the system using our proposed algorithm, k-means clustering, and without clustering. Simulation results show that the delay time of our proposed algorithm is shorter compared to other methods and resource overhead is also reduced.