• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6C
• /
• pp.403-411
• /
• 2011

This paper addresses a cooperative transmission scheme based on Alamouti coding for cognitive radio networks over frequency selective fading channels. In the proposed scheme, the Alamouti coded form at the destination node is constructed through a simple combination of symbols at the source node, instead of the time-reversal operation and the conjugate operation at the relay nodes used in the conventional scheme. Numerical results show that the proposed scheme achieves a higher order cooperative diversity than that of the conventional scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.741-742
• /
• 2013

AODV algorithm is one of the widely used algorithm for wireless ad-hoc environment In AODV, the destination node selects the route with smallest hop count. Since AODV only consider hop count, the selected route could have low capacity link, and degrade QoS. In this paper, we propose a modified AODV algorithm that consider successful transmission rate of each link. Advantage of proposed algorithm is that AODV can support QoS without significant change of the algorithm using modified hop count.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.712-721
• /
• 2012

In this paper, we propose an Enhanced cross-layer Geographic Forwarding (EGF) protocol for wireless sensor networks (WSNs). EGF uses an optimal back-off time to make the packet forwarding decisions using only source and destination's location information and energy cost without information about neighbor nodes' location or the number of one hop neighbor nodes. EGF is also a cross-layer protocol by combining efficient asynchronous MAC and geographic routing protocol. The proposed protocol can find optimal next hop location quickly without broadcasting node's location update and with minimizing overhead. In our performance evaluation, EGF has better performance in terms of packet success ratio, energy efficiency and end-to-end delay in wireless sensor networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.8
• /
• pp.1827-1834
• /
• 2013

The existing PC-based desktop environment is being changed to a server-based virtual desktop environment due to various advantages such as security, mobility, and upgrade cost reduction. In this paper, a virtual computing lab service system which is applicable to the existing computer lab is designed and implemented using both an open source-based cloud computing platform and hypervisor. In addition, a node power scheduler is proposed in order to reduce power consumption in a server farm. The experimental results show that the power scheduler reduces power consumption considerably over the server farm without the power scheduler.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.1188-1191
• /
• 2011

IPTV 방송에서 인터넷 기반 멀티캐스트는 일대다 또는 다대다 통신을 위한 차세대 중요한 서비스로 주목 받고 있다. 멀티캐스트는 네트워크 또는 애플리케이션 레벨에서 서비스할 수 있다. IP 멀티캐스트는 소스노드에서 라우터로 데이터그램을 보내면 라우터가 이를 복제하여 수신노드들에게 전달해 주는 네트워크레벨 서비스로 네트워크 자원을 효율적 사용할 수 있다. 그러나 네트워크에 IP 멀티캐스트 라우터가 설치되어야 하는 등 여러 문제로 인해 널리 사용되지 못하고 있다. 따라서 대안으로 애플리케이션 레벨에서의 오버레이 멀티캐스트가 주목 받고 있다. 오버레이 멀티캐스트는 종단호스트가 라우터처럼 동작하는 것으로 비록 IP 멀티캐스트에 비해서 링크 사용율과 지연 값이 높아질 수 있지만, IP 멀티캐스트의 현실적인 적용의 어려움을 해결할 수 있는 장점을 가지고 있다. 본 논문에서는 IP 멀티캐스트가 제공되지 않는 네트워크에서 효율적인 SVC(Scalable Video Coding) 멀티미디어 방송서비스와 SSENS(SVC Stream Exchange Network Server) 라우팅을 위한 MST(Minimum Spanning tree)를 목적으로 하는 오버레이 멀티캐스트 트리를 구현하는 알고리즘을 설계한다. 제안된 알고리즘의 성능 분석을 위해 시뮬레이션을 통해 패킷 손실 측면에서 Prim 알고리즘에 비해 평균 패킷 손실율이 40% 가까이 향상됨을 증명하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.4
• /
• pp.157-165
• /
• 2024

The evolution of the Distributed Denial of Service Attack(DDoS Attack) method has increased the difficulty in the detection process. One of the solutions to overcome the problems caused by the limitations of the existing victim-side detection method was the source-side detection technique. However, there was a problem of performance degradation due to network traffic irregularities. In order to solve this problem, research has been conducted to detect attacks using a collaborative network between several nodes based on artificial intelligence. Existing methods have shown limitations, especially in nonlinear traffic environments with high Burstness and jitter. To overcome this problem, this paper presents a collaborative source-side DDoS attack detection technique introduced with an attention mechanism. The proposed method aggregates detection results from multiple sources and assigns weights to each region, and through this, it is possible to effectively detect overall attacks and attacks in specific few areas. In particular, it shows a high detection rate with a low false positive of about 6% and a high detection rate of up to 4.3% in a nonlinear traffic dataset, and it can also confirm improvement in attack detection problems in a small number of regions compared to methods that showed limitations in the existing nonlinear traffic environment.

• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.505-510
• /
• 2009

Sensor networks are composed of a great number of sensor nodes. Since all sensor nodes are energy-restricted and hard to recharge, it is very important.However, the energy consumption may significantly increase if mobile sources or sinks exist in sensor networks. The reason is that the routing information for mobile sources and sinks needs to be update frequently for efficientdata delivery. The routing algorithm supporting mobile sinks should consider not only continuous data delivery but also the energy consumption of sensor nodes. However, most of the existing research focuses on even energy consumption while the mobility of sinks and sources is rarely consider. In this paper, we propose an efficient routing protocol with multiple virtual grids to reduce energy consumption and improve packets delivery efficiency. Then this paper considers the mobility. Simulation results show that our algorithm can guarantee high data delivery ratio and lower average delivery delay, while consuming lower energy than existing routing protocols in sensor networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6A
• /
• pp.617-625
• /
• 2011

In wireless sensor networks, data dissemination protocols have been proposed for mobile sink groups that are characterized by geographically staying closely and collective movement. They usually exploit flooding technology for mobility supporting and data delivery guarantee. However, it causes the excessive energy consumption of all sensor nodes in the group region due to data delivery participation. Moreover, the costs of the flooding would become higher in proportional to the group region. In this paper, we propose an energy efficient data dissemination scheme that resolves these problems. The virtual infrastructure called a 'pipe' is used as a rendezvous area. A source delivers data to the pipe, from which member sinks in the group retrieve it directly. Simulation results showed that this solution has better performance than existing protocols in terms of energy consumption as it reduces the number of regional flooding and eliminates unnecessary data flooding.

• Journal of KIISE:Information Networking
• /
• v.33 no.2
• /
• pp.165-174
• /
• 2006

Data dissemination using either flooding or legacy ad-hoc routing protocol is not realistic approach in the wireless sensor networks, which are composed of sensor nodes with very weak computing power, small memory and limited battery. In this paper, we propose the ELF(Energy-efficient Localized Flooding) protocol. The ELF is energy-efficient data dissemination protocol for wireless sensor networks. In the ELF protocol, there are two data delivery phases between fixed source and mobile sink node. The first phase, before the tracking zone, sensing data are forwarded by unicasting. After that, within the tracking zone, sensing data are delivered by localized flooding. Namely, the ELF Properly combines advantages from both unicasting and flooding. According to evaluation results by simulation, the proposed ELF protocol maintains very high data delivery ratio with using a little energy. Also, the property of average delay is better than others. From our research results, the ELF is very effective data dissemination protocol for wireless sensor networks.

• Journal of KIISE
• /
• v.44 no.11
• /
• pp.1165-1177
• /
• 2017

Many developers utilize specific APIs to develop software, and to identify the use of a particular API, a developer can refer to a website that provides the API or can retrieve the API from the web. However, the site that provides the API does not necessarily provide guidance on how to use it while it can be partially provided in many other cases. In this paper, we propose a novel system JACE (Java AST collocation-pattern extractor) as a method to reuse commonly-used code as a supplement. The JACE extracts the API call nodes, collocation patterns and analyzes the relations between the collocations to extract significant API patterns from the source code. The following experiment was performed to verify the accuracy of a defined pattern: 794 open source projects were analyzed to extract about 15M API call nodes. Then, the Eclipse plug-in test program was utilized to retrieve the pattern using the top 10 classes of API call nodes. Finally, the code search results from reference pages of the API classes and the Searchcode [1] were compared with the test program results.