• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.9
• /
• pp.675-684
• /
• 2009

Internet worm can cause a traffic problem through DDoS(Distributed Denial of Services) or other kind of attacks. In those manners, it can compromise the internet infrastructure. In addition to this, it can intrude to important server and expose personal information to attacker. However, current detection and response mechanisms to worm have many vulnerabilities, because they only use local characteristic of worm or can treat known worms. In this paper, we propose a new framework to detect unknown worms. It uses macroscopic characteristic of worm to detect unknown worm early. In proposed idea, we define the macroscopic behavior of worm, propose a worm detection method to detect worm flow directly in IP packet networks, and show the performance of our system with simulations. In IP based method, we implement the proposed system and measure the time overhead to execute our system. The measurement shows our system is not too heavy to normal host users.

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.694-699
• /
• 2014

In mobile ad-hoc networks (MANET), the network topology and neighboring nodes change frequently, since MANET is composed of nodes that have mobility without a fixed network infrastructure. The AODV routing protocol is advantageous for MANET, but AODV has a delay in the transmission of data packets because AODV can not transmit data during route recovery. This paper proposes solving the above problem of AODV by using a bypass generation mechanism for data transmission during route recovery. For further improvement, additional mechanisms that coordinate the reception threshold of a hello packet are proposed in order to improve the accuracy of the information obtained from the neighboring nodes when the bypass is generated due to a link failure and the immediacy of the route recovery. Simulation results show that the proposed technique improves the performance in terms of the delay in transmission compared to traditional AODV.

• Journal of Korean Library and Information Science Society
• /
• v.36 no.1
• /
• pp.415-440
• /
• 2005

This paper analyses meta-data systems for serials in order to provide the fundamental infrastructure for serials-sharing systems based on semantic interoperability. According to the primitive features of serials information, meta-data for serials are classified into 3 main subsystems: serial identification Information, serial bibliographic information and serial holding information. The serial identification information that play the important role of the primary key in library management systems should be refined to accommodate serials with digital formats. Although MARC formats have been commonly used for the description of serial bibliographic information, a new meta-data format for serial bibliographic information that harmonize with the abundance of meta-data elements in MARC and the simplicity of DCMI. For serial holding information, the newly proposed standards such as ANSI/NSIO Z39.50 are adequate to grasp the varieties of serial holding patterns. It should be able to differentiate the level of description by means of the types of serial information services. As the current computing technology generally uses XML for the representation and Process of information, the meta-data system for serials should be based on XML.

• Journal of Computing Science and Engineering
• /
• v.2 no.3
• /
• pp.249-273
• /
• 2008

Epidemic protocols have two fundamental assumptions. One is the availability of a mechanism that provides each node with a set of log(N) (fanout) nodes to gossip with at each cycle. The other is that the network size N is known to all member nodes. While it may be trivial to support these assumptions in small systems, it is a challenge to realize them in large open dynamic systems, such as peer-to-peer (P2P) systems. Technically, since the most fundamental parameter of epidemic protocols is log(N), without knowing the system size, the protocols will be limited. Further, since the network churn, frequently observed in P2P systems, causes rapid membership changes, providing a different set of log(N) at each cycle is a difficult problem. In order to support the assumptions, the fanout nodes should be selected randomly and uniformly from the entire membership. This paper investigates one possible solution which addresses both problems; providing at each cycle a different set of log(N) nodes selected randomly and uniformly from the entire network under churn, and estimating the dynamic network size in the number of nodes. This solution improves the previously developed distributed algorithm called Shuffle to deal with churn, and utilizes the Shuffle infrastructure to estimate the dynamic network size. The effectiveness of the proposed solution is evaluated by simulation. According to the simulation results, the proposed algorithms successfully handle network churn in providing random log(N0 fanout nodes, and practically and accurately estimate the network size. Overall, this work provides insights in designing epidemic protocols for large scale open dynamic systems, where the protocols behave autonomically.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.2
• /
• pp.1-8
• /
• 2011

Traffic congestion is a source of significant economic and social costs in urban areas. Intelligent Transportation Systems (ITS) are a promising means to help alleviate congestion by utilizing advanced sensing, computing, and communication technologies. This paper proposes and investigates a basic and advanced ITS framework Advanced Traveler Information System (ATIS) using wireless Vehicle to Roadside (Centralized ATIS model: CA model) and Vehicle to Vehicle (DeCentralized ATIS model: DCA model) communication and assuming an ideal communication environment in the typical $6{\times}6$ urban grid traffic network. Results of this study indicate that an ATIS using wireless communication can save travel time given varying combinations of system characteristics: traffic flow, communication radio range, and penetration ratio. Also, all tested metrics of the CA and DCA models indicate that the system performance of both models is almost identical regardless of varying traffic demand and penetration ratios. Therefore, DCA model can be a reasonable alternative to the fixed infrastructure based ATIS model (CA model).

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.2
• /
• pp.439-448
• /
• 2015

IoT (Internet of Things) propels current networked communities into a advanced hyper-connected society/world where uniquely identifiable embedded computing devices are associated with the existing internet infrastructure. Therefore, the IoT services go beyond mere M2M (Machine-to-Machine communications) and should be able to empower users with more flexible communication capabilities over protocols, domains, and applications. In addition, The access control in IoT need a differentiated methods from the traditional access control to increase a security and dependability. In this paper, we describe implementation and design of the capability token based system for secure access control in IoT environments. In the proposed system, Authorities are symbolized into concepts of the capability tokens, and the access control systems manage the tokens, creation, (re)delegation and revocation. The proposed system is expected to decrease the process time of access control by using capability tokens.

• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.38-43
• /
• 2017

Sensor Networks (WSNs) can be defined as a self-configured and infrastructure-less wireless networks to monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants and to cooperatively pass their data through the network to a main location or base-station where the data can be observed and analyzed. Typically a wireless sensor network contains hundreds of thousands of sensor nodes. The sensor nodes can communicate among themselves using radio signals. A wireless sensor node is equipped with sensing and computing devices, radio transceivers and power components. The individual nodes in a wireless sensor network (WSN) are inherently resource constrained: they have limited processing speed, storage capacity, communication bandwidth and limited-battery power. At present time, most of the research on WSNs has concentrated on the design of energy- and computationally efficient algorithms and protocols In order to extend the network life-time, in this paper we are looking into a routing protocol, especially LEACH and LEACH-related protocol. LEACH protocol is a representative routing protocol and improves overall network energy efficiency by allowing all nodes to be selected to the cluster head evenly once in a periodic manner. In LEACH, in case of movement of sensor nodes, there is a problem that the data transmission success rate decreases. In order to overcome LEACH's nodes movements, LEACH-Mobile protocol had proposed. But energy consumption increased because it consumes more energy to recognize which nodes moves and re-transfer data. In this paper we propose the new routing protocol considering nodes' mobility. In order to simulate the proposed protocol, we make a scenario, nodes' movements randomly and compared with the LEACH-Mobile protocol.

• The Journal of Society for e-Business Studies
• /
• v.15 no.3
• /
• pp.85-98
• /
• 2010

The prevailing infrastructure of ubiquitous computing paradigm on the one hand making significant development for integrating technology in the daily life but on the other hand raising concerns for privacy and confidentiality. This research presents a new privacy-preserving spatio-temporal query processing technique, in which location based services (LBS) can be serviced without revealing specific locations of private users. Existing location cloaking techniques are based on a grid-based structures such as a Quad-tree and a multi-layered grid. Grid-based approaches can suffer a deterioration of the quality in query results since they are based on pre-defined size of grids which cannot be adapted for variations of data distributions. Instead of using a grid, we propose a location-cloaking algorithm which uses the R-tree, a widely adopted spatio-temporal index structure. The proposed algorithm uses the MBRs of leaf nodes as the cloaked locations of users, since each leaf node guarantees having not less than a certain number of objects. Experimental results show the superiority of the proposed method.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.3
• /
• pp.95-100
• /
• 2011

Due to rapid growth and development of telecommunication information technology, interest has been amplified regarding ubiquitous network computing and user-oriented service. Also, the rapid development of related technologies has been a big spotlight. Smart phone, with features such as a PC with advanced features is a mobile phone. According to environment and infrastructure development, a variety of mobile-based application software to provide various kinds of information and services has been released. However, most of them are provider-driven information systems and aim to provide large amounts of information simply to an unspecified number of users. Therefore, customized or personalized provision of information and service explained earlier for individual users has been hardly come true. According to background and need, this study wants to design and implement recommendations system for personalization and customization in mobile environments. To acquire more accurate recommendation results, recommendation system shall be composed using the Hybrid Filtering. Effective information recommendation according to user's situation by using user's context-information of purpose and location that are available in mobile devices before running the filtering of the information to improve the quality of recommendations.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.1-7
• /
• 2013

Big data management is becoming increasingly important in both industry and academia of information science community. One of the important categories of big data generated from software systems is log data. Log data is generally used for better services in various service providers and can also be used as information for qualification. This paper presents a big data management architecture specialized for log data. Specifically, it provides the aggregation of log messages sent from multiple clients and provides intelligent functionalities such as analyzing log data. The proposed architecture supports an asynchronous process in client-server architectures to prevent the potential bottleneck of accessing data. Accordingly, it does not affect the client performance although using remote data store. We implement the proposed architecture and show that it works well for processing big log data. All components are implemented based on open source software and the developed prototypes are now publicly available.