• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.871-878
• /
• 2004

Recenty, there has been great interest in MANET from various areas. In this paper we focus on performance analysis of on demand routing protocols surf as DSR, AODV, and TORA in MANET. We have conducted several simulations concerned with application service data such as sensor, text. voice, and video data. And then, we have evaluated the performance of three protocols in a pre-designed ad hoc network, which is consisted of 20 nodes. As a result, we have obtained quantitative data for packet delivery fraction, average end to-end delay, routing load, channel utilization from upper layer and supportable routing protocol for application service data. The results can be used for designing specific-purposed ad-hoc networks.

• The KIPS Transactions:PartC
• /
• v.17C no.1
• /
• pp.81-88
• /
• 2010

Sensors in sensor networks are operated by their embedded batteries and they can not work any more if the batteries run out. The data collected by sensors should be transferred to a sink node through the efficient routes. Many energy efficient routing algorithms were proposed. However, the previous algorithms consume more energy since they did not consider the transmission range and direction. In this paper we propose an algorithm TDRP(Transmission range and Direction Routing Protocol) that considers the transmission range and direction for the efficient data transmission. Since TDRP does not produce clusters or grids but four quadrants and send data to the nodes in one quadrant in the direction of the sink node, it has less network overhead. Furthermore since the proposed algorithm sends data to the smaller number of nodes compared to the previous algorithms, the energy efficiency is better than other algorithms in communication node fields that are located in packet transmit directions.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.240-243
• /
• 2007

Geographic routing has been considered as an efficient simple, and scalable routing protocol for wireless sensor networks since it exploits pure location information instead of global topology information to route data packets. Geographic routing requires the sources nodes to be aware of the location of the sinks. In this paper, we propose a scheme named Sink Location Service for geographic routing in wireless Sensor Networks, in which the source nodes can get and update the location of sinks with low overhead. In this scheme, a source and a sink send data announcement and query messages along two paths respectively by geographic routing. The node located on the crossing point of the two paths informs the source about the location of the sink. Then the source can send data packet to the sink by geographic routing. How to guarantee that these two paths have at least one crossing point in any irregular profile of sensor network is the challenge of this paper.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.692-697
• /
• 2003

The researches on the Internet based tole-operation have received increased attention for the past few years. In this paper, we implement the Internet based tele-operating system. In order to transmit robustly the surroundings and control information of the robot, we make a data as a packet type. Also in order to transmit a very large image data, we use PEG compressive algorithm. The central problem in the Internet based tele-operation is the data transmission latency or data-loss. For this specific problem, we introduce an autonomous mobile robot with a 2-layer fuzzy controller. Also, we implement the color detection system and the robot can perceive the object. We verify the efficacy of the 2-layer fuzzy controller by applying it to a robot that is equipped with various input sensors. Because the 2-layer fuzzy controller can control robustly the robot with various inputs and outputs and the cost of control is low, we hope it will be applied to various sectors.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.858-861
• /
• 2011

In this paper, we present a RFID system by using a wireless sensor network. The proposed system is installed in glove for activity monitoring. The RFID reader, to send data by using sensor network platform and RFID tag are small size, the shape of quadrangle, and operate in the frequency of 13.56 MHz. The sensor node can read RFID tags on the various objects used in daily living such as furniture, medicines, and kitchenwares. The sensor node reads the data of RFID tags, it transmits wireless packets to the sink node. The sink node sends the received packet immediately to a server system. The data from each RFID system is collected into a database, and then the data are processed to visualize the measurement of daily living activities of users. We provide a web-based monitoring system, and can see the number of RFID tag readings per day as bar charts. The result of experiments demonstrates that the way we propose can help to check the situation of life for people who live alone.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.12
• /
• pp.1328-1336
• /
• 2012

Compared to terrestrial RF communications, underwater acoustic communications have several limitations such as limited bandwidth, high level of fading effects, and a large underwater propagation delay. In this paper, in order to tackle those limitations of underwater communications and to make it possible to form a large underwater monitoring systems, we propose a hierarchical underwater network architecture, which consists of underwater sensors, clusterheads, underwater/surface sink nodes, autonomous underwater vehicles (AUVs). In the proposed architecture, for the maximization of packet delivery ratio and the minimization of underwater sensor's energy consumption, a hybrid routing protocol is used. More specifically, cluster members use Tree based routing to transmit sensing data to clusterheads. AUVs on optimal trajectory movements collect the aggregated data from clusterhead and finally forward the data to the sink node. Also, in order to minimize the maximum travel distance of AUVs, an Integer Linear Programming based algorithm is employed. Performance analysis through simulations shows that the proposed architecture can achieve a higher data delivery ratio and lower energy consumption than existing routing schemes such as gradient based routing and geographical forwarding. Start after striking space key 2 times.

• The KIPS Transactions:PartC
• /
• v.10C no.6
• /
• pp.717-726
• /
• 2003

In this paper, we analyze the associated rule based deductive algorithm which creates the rules automatically for intrusion detection from the vast packet data. Based on the result, we also suggest the deductive algorithm which creates the rules of intrusion pattern fast in order to apply the intrusion detection systems. The deductive algorithm proposed is designed suitable to the concept of clustering which classifies and deletes the large data. This algorithm has direct relation with the method of pattern generation and analyzing module of the intrusion detection system. This can also extend the appication range and increase the detection speed of exiting intrusion detection system as the rule database is constructed for the pattern management of the intrusion detection system. The proposed pattern generation technique of the deductive algorithm is used to the algorithm is used to the algorithm which can be changed by the supporting rate of the data created from the intrusion detection system. Fanally, we analyze the possibility of the speed improvement of the rule generation with the algorithm simulation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.7
• /
• pp.45-51
• /
• 2009

We have presented a routing mechanism that selects a route by considering channel statuses in order to fast transfer delay-sensitive data in WSNs (Wireless Sensor Networks). The existing methods for real-time data transfer select a path whose latency is the shortest or the number of hops is the smallest. An algorithm to select a real-time transfer path based on link error rates according to the characteristic of wireless medium was also suggested. However, the propagation delay and retransmission timeout affected by link error rates are shorter than channel assessment time and backoff time. Therefore, the mechanism proposed in this paper estimated the time spent in using a clear channel and sending out a packet, which is based on channel backoff rates. A source node comes to select a route with the shortest end-to-end delay as a fast transfer path for real-time traffic, and sends data along the path chosen. We found that this proposed mechanism improves the speed of event-to-sink data transfer by performing experiments under different link error and channel backoff rates.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.7
• /
• pp.49-56
• /
• 2009

In this paper, we present a daily activity monitoring system by using a wireless sensor network. The proposed system is installed in glove for activity monitoring. The RFID reader, to send data by using sensor network platform and RFID tag are small size, the shape of quadrangle, and operate in the frequency of 13.56 MHz. The sensor node can read RFID tags on the various objects used in daily living such as furniture, medicines, and kitchenwares. The sensor node reads the data of RFID tags, it transmits wireless packets to the sink node. The sink node sends the received packet immediately to a server system. The data from each RFID system is collected into a database, and then the data are processed to visualize the measurement of daily living activities of users. We provide a web-based monitoring system, and can see the number of RFID tag readings per day as bar charts. The result of experiments demonstrates that the way we propose can help to check the situation of life for people who live alone.

• Journal of the Institute of Convergence Signal Processing
• /
• v.15 no.4
• /
• pp.183-191
• /
• 2014

This paper describes the development of the observational data transmission algorithm for high-speed network in radio astronomy. For the preprocessing of VLBI data observed by radio telescope, data transmission algorithm uses the VDIF specification, VDIFCP, and UDP protocol by transferring VLBI data stored in a massive storage server with one-to-one correspondence between the server and the RVDB of Daejeon correlator. A transmission method is proposed, which reads the recorded data in Mark5B VSI format and trnasmits 2048 Mbps VLBI data by software through UDP packet transmission, while RVDB system is waiting for the transmitting data from the server. In order to check the effectiveness of the proposed method, the data transmission between the massive storage server and RVDB is conducted and the transmitted data is correlated by Daejeon correlator for the accurate comparison concerning the data before and after. The transmitted data is shown to be completely the same as the original data without any data transmission loss. Henceforth, the developed data transmission algorithm in this research is expected to be applied effectively as e-VLBI for KaVA network.