• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.726-730
• /
• 2009

The proliferation of the web and digital photography has drastically increased multimedia data and has resulted in the need of the high quality internet service based on the moving picture like user generated contents(UGC). The keyword-based search on large scale images and video collections is too expensive and requires much manual intervention. Therefore the web search engine may provide the content-based retrieval on the multimedia data for search accuracy and customer satisfaction. In this paper, we propose a novel distributed index structure based on multiple length signature files according to data distribution. In addition, we describe how our scalable index technique can be used to find the nearest neighbors in the cluster environments.

• Journal of Internet of Things and Convergence
• /
• v.5 no.2
• /
• pp.73-79
• /
• 2019

Research is underway on services and systems that provide real-time alerts for suffocating gases and potentially explosive materials, but currently smart bend type services are lacking. This study supports real-time identification of explosion hazards due to static electricity in the workplace and immediate elimination of accident occurrence factors, real-time monitoring of worker status and workplace hazards (oxygen, hazardous chemical concentration), and immediate warning and data in case of danger. We propose a method of establishing an accident prevention system through analysis. In this way, various accidents that may occur in industrial sites are monitored using IoT-based intelligent sensor nodes, wireless network technology, data processing middleware, and integrated control system, and real-time risk information at the industrial sites is prevented and accidents are prevented. By supporting a safe working environment, the company can significantly reduce costs compared to post-procurement costs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.72-84
• /
• 2005

Optical burst switching networks usually employ one-way reservation by sending a burst control packet with a specific offset time, before transmitting each data burst Same. Due to such a Property, burst-contentions occur when multiple bursts contend for the same wavelength in the same output link simultaneously in a node, leading to burst losses, eventually degrading the quality of service. Therefore, in this paper, we propose a dynamic routing algorithm using minimum local state information in order to decrease burst-contentions. In this proposed scheme, if burst loss rate exceeds a threshold value at a certain node, a new alternative routing path is chosen according to burst priority and location of burst generation, which enables the contending bursts to detour around the congested link. Moreover, for reducing the effect of sending bursts on the primary path due to the alternative path, we also apply a minimum path-cost based routing on link-cost concept. Our simulation results show that proposed scheme improves the network performance in terms of burst loss probability and throughput by comparing with conventional one.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12B
• /
• pp.1037-1043
• /
• 2006

There has been proposed an algorithm to reduce data burst processing delay in group scheduling in core nodes of optical burst switching networks. Since, in this algorithm, look-up tables containing all the void time information in scheduling windows are generated as soon as the primary group scheduling session terminates, it becomes faster to reassign dropped data bursts to proper voids in different data channels by referring to the tables. The group scheduling with this algorithm showed almost the same channel utilization as the one without using the algorithm but performed a little better in both burst loss probability and wavelength conversion rate. On the other hand, per-burst processing time has been reduced dramatically in the load region of higher than 0.8, showing a factor of 2.1 reduction at 0.9.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.6
• /
• pp.1058-1069
• /
• 2015

In wireless sensor networks, geographic routing is known as an efficient method to transmit the data packet using the location information. Geographic routing relies on two techniques: greedy forwarding and face routing. Face routing helps to recover from greedy routing fail and is based on the planar graph in which does not cross each edge. However, the planarization causes frequently short transmission of data packet because it removes other edges except the shortest one. In other words, since the planarization removes the long edges, face routing could not exploit the efficient removed edges of communication graph. This problem brings about the excessive energy consumption of nodes. In this paper, we propose an energy efficient face routing protocol in wireless sensor networks. This proposed protocol searches the removed edges and transmits them via the edges. Simulation shows that the proposed protocol is more efficient in terms of energy consumption than the previous face routing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1B
• /
• pp.11-16
• /
• 2007

This paper describes the design and performance of a secure routing protocol with time-space cryptography for mobile ad-hoc networks. The proposed time-space scheme works in the time domain for key distribution between source and destination as well as in the space domain for intrusion detection along the route between them. For data authentication, it relies on the symmetric key cryptography due to high efficiency and a secret key is distributed using a time difference from the source to the destination. Also, a one-way hash chain is formed on a hop-by-hop basis to prevent a compromised node or an intruder from manipulating the routing information. In order to evaluate the performance of our routing protocol, we compare it with the existing AODV protocol by simulation under the same conditions. The proposed protocol has been validated using the ns-2 network simulator with wireless and mobility extensions.

• Proceedings of the Korea Information Assurance Society Conference
• /
• 2004.05a
• /
• pp.29-34
• /
• 2004

As the number of internet users grows rapidly, the services which users required becomes various. However, for fulfilling these various user requirements, the existing passive network should be standardized for a long time. To resolve the delay on providing services, active network as a new technology was suggested. Its router or switch with DARPA as center has the program running ability, so user oriented network can be composed. However, active network's architecture can resolve the user required service using mobile code on the network node, but it is more complex, easy-to-attack, various than the passive network. Many researchers have tried to resolve this problem. So, this paper studied the mobile code security service in active network environment to provide user's convenience and accommodation, and introduced ANASP system as an alternative.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.6
• /
• pp.85-91
• /
• 2014

Nowadays, Dynamic lighting control and management skills are studied and used. If the system which is to manage multiple intelligent spot applied ubiquitous service technology is built with decision making and used in the complex intelligent space like a apartment then will improve energy efficiency and provide comfortability in optimal conditions. To solve this problem distributed autonomous control middleware and energy management system which process data gathering by zigbee mesh network and search proper services to save energy by the existing state of things is necessary. In paper we designed DDLEMS (Distributed Dynamic Lighting Energy Management System) that is to service duplex communication embedded by software based home server platform to provide mobile services in the smart place and support decision making about energy saving to the best use of wireless censor node and controled network, energy display devices.

• Information and Communications Magazine
• /
• v.11 no.2
• /
• pp.77-89
• /
• 1994

High speed optical fiber transmission technology has been remarkably improved during the past 20 years. This paper presents recent research status and future technological issues for the future information society, that is, the Tb/s transmission by frequency division multiplexing and the ultra long-distance by optical soliton transmission. Erbium-doped fiber amplifier and recent optical technology have brought optical transmission system of up to 10 Gb/s to the point of commercialization. Taking into account the future super information highway, that is, B-ISDN network, ultra wide-band picture-based information can be provided for many subscribers via existing optical fiber cables. However, to achieve the high speed transmission, the technologies must be developed not only for transmission lines but also for transmission nodes. Since the conventional signal transmission/processing technique using electronics has the limit in its speed, novel photonic technology is being developed for this purpose. On the other hand, optical solitons propagate stably through optical fibers, without pulse broadening effect of the fiber dispersion. Since the pulse broadening effect becomes serious as the transmission speed increases, optical solitons is the important technologies to realize the high speed, long distance transmission.

• Convergence Security Journal
• /
• v.16 no.5
• /
• pp.3-9
• /
• 2016

The wireless sensor networks have become an economically viable monitoring solution for a wide variety of civilian and military applications. The main challenge in wireless sensor networks is the secure transmission of information through the network, which ensures that the network is secure, energy-efficient and able to identify and prevent intrusions in a hostile or unattended environment. In that correspondence, this paper proposes a distributed clustering process that integrates the necessary measures for secure wireless sensors to ensure integrity, authenticity and confidentiality of the aggregated data. We use the notion of pre-distribution of symmetric and asymmetric keys for a secured key management scheme, and then describe the detailed scheme which each sensor node within its cluster makes use of the pre-distribution of cryptographic parameters before deployment. Finally, we present simulation results for the proposed scheme in wireless sensor network.