• Journal of KIISE:Information Networking
• /
• v.29 no.5
• /
• pp.510-523
• /
• 2002

The routers in an active network perform customized computations on the messages flowing through them, while the role of routers in the traditional packet network, such as the Internet, is to passively forward packets as fast as possible. In contrast to the Internet, the processing in active networks can be customized on a per user or per application basis. Active networks allow users to inject information into the network, where the information describes or controls a program to be executed for the users by the routers as well as the end hosts. So the network users can realize the active networks by "programming" the network behavior via the programming interface exposed to them. In this paper, we devise a network protocol model and present a verification technique for reasoning about the correctness of an active application defined using the model. The technique is developed in a platform- and language-independent way, and it is algorithmic and can be automated by computer program. We give an example dealing with network auction to illustrate the use of the model and the verification technique.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.1
• /
• pp.105-112
• /
• 2014

The utilization of Wireless Ad Hoc Network which can build easily network using wireless device in difficult situation to build network is very good. However, it has security threat element because it transfers data by only forwarding of wireless devices. The measures against this should be prepared because damage by especially routing attack can affect the entire network. It is hard to distinguish malicious node and normal node among nodes composing network and it is not easy also to detect routing attack and respond to this. In this paper, we propose new method which detect routing attack and can respond to this. The amount of traffic in all nodes is measured periodically to judge the presence or absence of attack node on the path set. The technique that hides inspection packet to suspected node and transmits is used in order to detect accurately attack node in the path occurred attack. The experiment is performed by comparing SRAODA and SEAODV technique to evaluate performance of the proposed technique and the excellent performance can be confirmed.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.1059-1062
• /
• 2005

A hybrid ad-hoc network consists of a wired network and a mobile ad-hoc network connected by the internet gateway. To provide seamless service for internet user in hybrid ad-hoc network, an efficient internet gateway selection technique and a fast handover technique are needed. In this paper, we propose a seamless handoff technique for providing mobility of mobile hosts in hybrid ad-hoc networks. The proposed technique improves general handoff performance by an internet gateway re-registration algorithm for ad-hoc networks. Moreover, it reduces handoff processing time in the range of certain region by using mobility management agent (MMA) and also the packet loss when handoff occurs out of the range of MMA by tunneling technique.

• Journal of the Korean Geophysical Society
• /
• v.6 no.1
• /
• pp.1-11
• /
• 2003

There are numerous adjustment techniques that deal with the adjustment of geodetic networks but the least squares adjustment is the most common one. During the network adjustment procedure two techniques can be used, the free network adjustment technique and the constrained network adjustment technique. In order to determine the optimum technique for adjusting the geodetic networks, which used for the geodynamical purposes, data from two different geodetic networks "Sinai geodetic network, Egypt, and HGN network, South Korea" had been examined. The used networks had a different configuration and located in different areas with different seismic activity. The results show that both techniques have a high accuracy and no remarkable differences in terms of RMS. On the contrary, the resulted coordinates shows that the constrained network adjustment technique not only cause a remarkable distortion in the station final coordinates but also if the fixed points that define the datum parameters are changed different solutions for the coordinates will be determined. This distortion affect not only in the determination of point displacement but also in the estimation of the deformation parameters, which play a significant role in the geodynamical interpretation of results. Comparing the results which obtained from both techniques with the widely known geodynamical models of the area reviles that the free network adjustment technique results are clearly match with these models, while those obtained from the constrained technique didn’t match at all. By considering the results it seams to be that the free network adjustment technique is the optimum technique, which can be used for the geodetic network adjustment.

• Journal of information and communication convergence engineering
• /
• v.9 no.6
• /
• pp.625-628
• /
• 2011

Dynamic sensor network(DSN) technology which is based on swarming flight type air node offers analyzed and acquired information on target data gathered by air nodes in rotation flight or 3 dimension array flight. Efficient operation of dynamic sensor network based on air node is possible when problems of processing time, data transmission reliability, power consumption and intermittent connectivity are solved. Delay tolerant network (DTN) can be a desirable alternative to solve those problems. DTN using store-and-forward message switching technology is a solution to intermittent network connectivity, long and variable delay time, asymmetric data rates, and high error rates. However, all processes are performed at the bundle layer, so high power consumption, long processing time, and repeated reliability technique occur. DSN based on swarming flight type air node need to adopt store-and-forward message switching technique of DTN, the cancelation scheme of repeated reliability technique, fast processing time with simplified layer composition.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.11a
• /
• pp.271-274
• /
• 1997

This paper presents the optimization technique for design of a CMAC network by using an evolution strategies(ES). The proposed technique is designed to find the optimal parameters of a CMAC network, which can minimize the learning error between the desired output and the CMAC network's as well as the number of memory used in the CMAC network. Computer simulations demonstrate the effectiveness of the proposed design method.

• ETRI Journal
• /
• v.38 no.6
• /
• pp.1145-1152
• /
• 2016

Because the nodes in a wireless sensor network (WSN) are mobile and the network is highly dynamic, monitoring every node at all times is impractical. As a result, an intruder can attack the network easily, thus impairing the system. Hence, detecting anomalies in the network is very essential for handling efficient and safe communication. To overcome these issues, in this paper, we propose a rule-based anomaly detection technique using roaming honeypots. Initially, the honeypots are deployed in such a way that all nodes in the network are covered by at least one honeypot. Honeypots check every new connection by letting the centralized administrator collect the information regarding the new connection by slowing down the communication with the new node. Certain predefined rules are applied on the new node to make a decision regarding the anomality of the node. When the timer value of each honeypot expires, other sensor nodes are appointed as honeypots. Owing to this honeypot rotation, the intruder will not be able to track a honeypot to impair the network. Simulation results show that this technique can efficiently handle the anomaly detection in a WSN.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.3
• /
• pp.91-98
• /
• 2013

Node which plays the role of cache server does not exist in the wireless ad-hoc network consisting of only mobile nodes. Even if it exists, it is difficult to provide cache services due to the movement of nodes. Therefore, the cooperative cache technique is necessary in order to improve the efficiency of information access by reducing data access time and use of bandwidth in the wireless ad-hoc network. In this paper, the whole network is divided into zones which don't overlap and master node of each zone is elected. General node of each zone has ZICT and manages cache data to cooperative cache and gateway node use NZCT to manage cache information of neighbor zone. We proposed security structure which can accomplish send and receive in the only node issued id key in the elected master node in order to prepare for cache consistent attack which is vulnerability of distributed caching techniques. The performance of the proposed method in this paper could confirm the excellent performance through comparative experiments of GCC and GC techniques.

• Proceedings of the KIEE Conference
• /
• 2000.11a
• /
• pp.223-225
• /
• 2000

Network congestion is important problem that must be managed for active power contracts in deregulated power industry. Existing network partition technique is based on statistical method don't suggest clear network partition criterion. So in this paper we proposed a new network partition technique using the marginal cost sensitivity to fairly allocate congestion cost to network user.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.5
• /
• pp.444-460
• /
• 2009

In this paper, we propose an expanded patching technique in order to reduce the server network bandwidth requirements to support true VoD services in VoD Systems. Double Patching, which is a typical multicast technique, ensures that a long patching stream delivers not only essential video data for the current client but also extra video data for future clients. Since the extra data may include useless data, it results in server network bandwidth wastage. In order to prevent a server from transmitting useless data, the proposed patching technique uses a new kind of stream called a linking stream. A linking stream is transmitted to clients that have received short patching streams, and it plays a linking role between a patching stream and a regular stream. The linking stream enables a server to avoid transmitting unnecessary data delivered by a long patching stream in Double Patching, so the server never wastes its network bandwidth. Mathematical analysis shows that the proposed technique requires less server network bandwidth to support true VoD services than Double Patching. Moreover, simulation results show that it has better average service latency and client defection rate compared with Double Patching.