• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.439-450
• /
• 2001

Mobile agent is one of the promising ways of overcoming network load and latency. It is also a new software paradigm including those concepts of client/server, applet/servelet, and code-on-demand. In this paper, a new mobile agent concept with flexible replay scheme is proposed, which can deal with embarrassing situation when replying results should be accomplished in various distributed applications. For example, they are 1) a burden of bulky result, 2) a need of different replay scheme dependent on work type, 3) connection failure to the target node, and 4) a need of fast migration to next node to keep the itinerary. Regarding the source node, there may be another situation that it wants to be aware of whether its wi가 is completed or not. Three kinds of reply schemes are proposed for dealing flexibly with such situations. They are based on priority reply list where nodes to be replied are stored according to their priorities. An experimental supply chain management model using the proposed reply schemes is designed and implemented. It is one of good distributed applications appropriate for our reply schemes, because it requires different reply schemes according to work types and it is important to gather required information in time.

• Journal of the Korean Society for Railway
• /
• v.6 no.4
• /
• pp.215-220
• /
• 2003

In this paper the dynamic characteristics of a Swing Motion Bogie, such as a critical speed and a carbody vibration, are investigated in reply to the request of the Meridian Rail Corporation in the United States. Also described are experimental results of the maximum speed, the derailment coefficient, the lateral force, the vertical force, the vibration acceleration and steady state lateral acceleration measured from main line tests.

• Journal of information and communication convergence engineering
• /
• v.12 no.3
• /
• pp.154-160
• /
• 2014

The address resolution protocol (ARP) provides dynamic mapping between two different forms of addresses: the 32-bit Internet protocol (IP) address of the network layer and the 48-bit medium access control (MAC) address of the data link layer. A host computer finds the MAC address of the default gateway or the other hosts on the same subnet by using ARP and can then send IP packets. However, ARP can be used for network attacks, which are one of the most prevalent types of network attacks today. In this study, a new ARP algorithm that can prevent IP spoofing attacks is proposed. The proposed ARP algorithm is a broadcast ARP reply and an ARP notification. The broadcast ARP reply was used for checking whether the ARP information was forged. The broadcast ARP notification was used for preventing a normal host's ARP table from being poisoned. The proposed algorithm is backward compatible with the current ARP protocol and dynamically prevents any ARP spoofing attacks. In this study, the proposed ARP algorithm was implemented on the Linux operating system; here, we present the test results with respect to the prevention of ARP spoofing attacks.

• 한국정보통신설비학회:학술대회논문집
• /
• 2003.08a
• /
• pp.244-248
• /
• 2003

DHCP를 이용한 동적 IP주소 할당방식에서 클라이언트가 네트워크 접속을 해제하면서 IP 주소를 자동적으로 반납하지 않음으로 인해 IP 주소 회수가 즉각 이루어지지 않아 IP 주소 재활용을(reusability)이 저하된다. IP 주소의 재활용율을 증가시키면서 DHCP 서버의 부하증가 및 네트워크의 트래픽 증가 최소화를 위한 두 가지 기법으로 DHCP 서버에서 IP 주소의 임대시간을 적응적으로 조정하는 기법과 ICMP echo request 및 reply 메시지를 통한 클라이언트의 동작유무 확인을 통해 비동작 클라이언트의 IP 주소 회수 기법을 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4508-4528
• /
• 2016

Widespread use of wireless networks has drawn attention to ascertain confidential communication and proper authentication of an entity before granting access to services over insecure channels. Recently, Truong et al. proposed a modified dynamic ID-based authentication scheme which they claimed to resist smart-card-theft attack. Nevertheless, we find that their scheme is prone to smart-card-theft attack contrary to the author's claim. Besides, anyone can impersonate the user as well as service provider server and can breach the confidentiality of communication by merely eavesdropping the login request and server's reply message from the network. We also notice that the scheme does not impart user anonymity and forward secrecy. Therefore, we present another authentication scheme keeping apart the threats encountered in the design of Truong et al.'s scheme. We also prove the security of the proposed scheme with the help of widespread BAN (Burrows, Abadi and Needham) Logic.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.5
• /
• pp.1354-1372
• /
• 2012

Route establishment in Mobile Ad Hoc Network (MANET) is the key mechanism to a successful connection between a pair of source and destination nodes. An efficient routing protocol constructs routing path with minimal time, less routing overhead and capable of utilizing all possible link connectivity. In general, most on-demand MANET routing protocols operates over symmetrical and bidirectional routing path, which is infeasible due to the inherent heterogeneous properties of wireless devices. Simulation results show that the presence of unidirectional links on a network severely affect the performance of a routing protocol. In this paper, a robust protocol independent scheme is proposed, which enable immediate rediscovery of alternative route for a path blocked by a unidirectional link. The proposed scheme is efficient; route rediscovery is locally computed, which results in significant minimization of multiple route packets flooding. Nodes may exploit route information of immediate neighbors using the local reply broadcast technique, which then redirect the control packets around the unidirectional links, therefore maintaining the end-to-end bidirectional connection. The proposed scheme along with Ad Hoc On-demand Distance Vector (AODV) and AODV-Blacklist routing protocol is investigated over three types of mobility models. Simulation results show that the proposed scheme is extremely reliable under poor network conditions and the route connectivity can be improved by as much as 75%.

• Korean Journal of Community Nutrition
• /
• v.9 no.4
• /
• pp.464-471
• /
• 2004

For the purpose of developing ‘Web-Based Nutritional Education Program’, this study did instructional analysis, analysis of entry behaviors and learner characteristics to select instructional contents for nutritional education program for junior/senior high school students. Survey questionnaires were distributed from October 21, 2002 to October 26, 2002 to a total of 564 junior/senior high school students in Seoul. The total number of questionnaires collected and used in our study was 479, which is 84.9% of the total questionnaires distributed. As a result of the curriculum analysis of ‘Technology-Home economics’, subjects related with ‘food and nutrition’ in the 7$^{th}$ educational course study result, lessons including the contents of food and nutrition were ‘nutrition and meal of adolescent’ in 7th grade, ‘family meal management’ in 9th grade and ‘practice of home life’ in 10th grade. According to the curriculum analysis, ‘nutrition’ and ‘food’ were chosen for the superior subjects of nutrition education program and four subordinate subjects per superior one were developed. Then, entry behaviors and learner characteristics were analyzed： life characteristics, internet usage, anthropometrics data and nutritional knowledge. Students were interested in using computer and preferred passive activity to dynamic activity. According. to the analysis of internet usage, WBI for students should composed active parts such as game, moving image, immediate reply and follow-up bye-mail, bulletin board and com- munity activity. Students’ BMI were in normal range but they were lacked nutritional knowledge. We wrote performance objectives that were specific behavior skills to be learned, the conditions under which they must be performed and the criteria for successful performance. The next step for developing the WBI nutrition education program would be based on the results mentioned above.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.11
• /
• pp.831-835
• /
• 2009

Volunteer computing is a computing paradigm in which the operations of a large-scale application are processed using idle resources of Internet-connected computers. The redundant-work distribution techniques used in the volunteer computing environment cause some problems like delay of the work completion time or inefficiency of the work execution due to continuous requests of the work redistribution because the techniques do not consider the characteristics of works and dynamic resources. To cope with such problems this paper suggests a P2P based regional matchmaking technique which can redistribute works in consideration of the characteristics of the works and the participant resources. The techniques consist of the profiles for works/resources, the module for monitoring the available resources spaces, the protocols for the matching request/reply, the module for match-ratio calculation, and so on.