• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4A
• /
• pp.369-379
• /
• 2011

During the routing process between nodes on the CR(Cognitive Radio) network conducting for efficient use of limited frequency resources, spectrum handover process due to the appearance of the PU occupies most of the routing latency, and also decreases the reliability of the path. In this paper, a cooperative routing protocol in a multi-channel environment is proposed. The source node broadcasts a message with available channel lists and probability of PU appearance during its route guidance. The intermediate nodes re-transmit the message, received from the source node, and update and maintain the information, status table of the path. The destination node determines the optimal path and sends a reply message to the selected path after it receives the messages from the intermediate nodes. The average probability of the PU appearance and the average time of the PU appearance are updated while transferring data. During data transmission the channel with the lowest probability of appearance of the PU is selected dynamically and if a PU appears on the current channel partial repairment is performed. It is examined that reliability of the selected path considerably is improved and the routing cost is reduced significantly compared to traditional routing methods.

• Convergence Security Journal
• /
• v.13 no.4
• /
• pp.41-46
• /
• 2013

Routing protocol using in the existing wire network cannot be used as it is for efficient data transmission in MANET. Because it consists of only mobile nodes, network topology is changing dynamically. Therefore, each mobile node must perform router functions. Variety of routing attack like DoS in MANET is present owing to these characteristic. In this paper, we proposed cooperative-based detection method to improve detection performance of flooding attack which paralyzes network by consuming resource. Accurate attack detection is done as per calculated adaptively threshold value considered the amount of all network traffic and the number of nodes. All the mobile nodes used a table called NHT to perform collaborative detection and apply cluster structure to the center surveillance of traffic.

• Korean Management Science Review
• /
• v.26 no.3
• /
• pp.23-35
• /
• 2009

This study deals with the location management in WCDMA (Wideband Code Division Multiple Access) networks. The new location management method is the one of the many techniques used to provide the packet switched (PS) services effectively in WCDMA networks. WCDMA introduces RA (routing area) for the PS services in addition to LA (location area) for the circuit switched (CS) services. WCDMA system also adopts the cooperative paging and the combined area update which are to decrease signaling traffic using the PS network resources for the CS services. Considering the characteristics of the WCDMA networks, this study formulate into the mathematical programming problem for the location management. Rather than the existing researches which consider the single MSC/SGSN networks, we deal with the multi MSC/SGSN networks, where both MSC area and SGSN area should be determined as well. Fairness between traffic loads of MSC/SGSN and the system cost incurred to MSC/SGSN are also incorporated into our model, which make the model more realistic. We propose greedy algorithms for the problems, which consists of the merger of two neighboring areas and the movement of an area. Extensive experiment has been done based on the realistic problem examples. Followed by the analysis of parameter effect on the final solutions and the quality of final solutions obtained by our greedy algorithms. Our proposed model and analysis result can be used to determine WCDMA system areas and to predict the system performance measures by the determination.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.196-198
• /
• 2014

Wireless Sensor Networks(WSN) 기반의 Border Surveillance Networks(BSN)는 다양한 제한조건을 동반하며 침입 혹은 환경 등을 감시함을 목적으로 하고 있기 때문에 이벤트 발생시 신뢰적인 데이터 전송은 매우 중요한 부분을 차치하게 된다. 본 논문에서 적용한 대표적인 요구기반 라우팅 방법인 Ad hoc On-demand Distance Vector Routing(AODV)는 BSN 에 적용하였을 경우 홉 수(Hop Count)를 메트릭으로 최적의 경로를 계산하고 선택하여 Uni-Path 로 데이터를 전송하게 된다. 이때 AODV 는 Uni-path 로 데이터 전송을 진행하게 되며 링크의 단절이 빈번히 발생하는 BSN 의 환경적 요인으로 데이터 전송의 신뢰성이 감소하게 될 것이며 이는 비효과적인 데이터 전송을 야기하게 된다. 따라서 본 논문에서는 Multi-path 개념을 도입하여 데이터 전송 시 링크단절에 의해 발생하는 시간의 지연을 줄이고 더욱 신뢰성 있게 데이터를 전송할 수 있는 방법을 제안한다. 제안하는 방법은 송, 수신하는 두 노드의 전송범위에 공통으로 속한 노드들이 전송되는 데이터를 중복 전송하게 된다. 그리하여 링크의 단절이 일어날 경우 발생하는 경로 재 탐색 및 경로복구의 발생 빈도를 줄이고 동시에 데이터 전송률을 증가시켜 신뢰적인 데이터 전송을 하게 된다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.1100-1103
• /
• 2008

VANET(Vehicle Ad-hoc Network) 환경은 도로위의 차량을 노드로 하여 구성하는 애드혹 네트워크로써 최근 들어 그 연구가 활발히 진행되고 있는 분야이다. 일반적인 애드혹 환경과 마찬가지로 VANET 환경에서도 보안적인 문제가 중요한 이슈로 대두되고 있다. VANET 환경에서 가장 중요하게 요구되는 보안요소는 차량의 익명성을 통한 위치 프라이버시와 협력 운전(cooperative driving) 단계에서 사용되는 메시지에 대한 인증, 무결성, 부인방지 등이다. 본 논문에서는 익명 아이디(pseudonym), 그룹화 등을 통해 차량의 위치 프라이버시를 제공하고 또한 이를 이용해 VANET 환경에서 사용할 수 있는 라우팅 프로토콜을 제안하고자 한다. RA(Registration Authority)에서 발급되는 익명 아이디의 집합과 차량의 전송 범위를 고려해서 구성되는 그룹화는 그룹에 속한 차량에 대해 익명성을 제공하고, 또한 그룹리더에 의해 생성되는 그룹키를 통해 효율적인 협력 운전 메시지 전달을 할 수 있게 된다. 그리고 각각의 그룹리더를 라우터로 이용해 전달되는 라우팅 프로토콜은 노드가 매우 유동적으로 움직이는 VANET 환경에서 효과적으로 메시지를 전달할 수 있도록 해줄 것이다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.437-441
• /
• 2006

Wireless sensor network consists of sensor nodes which are disseminated closely to each other to collect informations for the various requests of a sensor application applied for sensing phenomenons in real world. Each sensor node delivers sensing informations to an end user by conducting cooperative works such as processing and communicating between sensor nodes. In general, the power supply of a sensor node is depends on a battery so that the power consumption of a sensor node decides the entire life time of a sensor network. To resolve the problem, optimal routing algorithm can be used for prolong the entire life time of a sensor network based on the information on the energy level of each sensor node. In this paper, different from the existing Directed Diffusion and SPTN method, we presents a data dissemination protocol based on lower-power consumption that effectively maximizes the whole life time of a sensor network using the informations on the energy level of a sensor node and shortest-path hops. With the proposed method, a data transfer path is established using the informations on the energy levels and hops, and the collected sensing information from neighboring nodes in the event-occurring area is merged with others and delivered to users through the shortest path.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.2
• /
• pp.164-172
• /
• 2014

Recently, as the number of IoT (Internet of Things) devices for personal or home intelligence increases, the need for unified control and cooperative utilization is required. This paper presents a novel idea, proposes methods for virtualizing Internet of Things (IoT) devices and hosting them on the home AP instead of relying on a cloud service or purchasing a new device to do so. For this, the process and profile of the IoT gadgets need to be virtualized into JavaScript-based objects. Then, to execute and control the instances of the virtualized IoT objects on the wireless AP, a novel instance management method and their interfaces are designed. The implementation and performance section demonstrates the proposed system's stability and operability by showing the stress test results while the wireless AP is running for its wireless routing.

• Convergence Security Journal
• /
• v.14 no.7
• /
• pp.53-58
• /
• 2014

MANET can quickly build a network because it is configured with only the mobile node and it is very popular today due to its various application range. However, MANET should solve vulnerable security problem that dynamic topology, limited resources of each nodes, and wireless communication by the frequent movement of nodes have. In this paper, we propose a domain-based distributed cooperative intrusion detection techniques that can perform accurate intrusion detection by reducing overhead. In the proposed intrusion detection techniques, the local detection and global detection is performed after network is divided into certain size. The local detection performs on all the nodes to detect abnormal behavior of the nodes and the global detection performs signature-based attack detection on gateway node. Signature DB managed by the gateway node accomplishes periodic update by configuring neighboring gateway node and honeynet and maintains the reliability of nodes in the domain by the trust management module. The excellent performance is confirmed through comparative experiments of a multi-layer cluster technique and proposed technique in order to confirm intrusion detection performance of the proposed technique.