• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9B
• /
• pp.803-810
• /
• 2006

Mobile ad hoc nodes are supposed to be equipped with a number of operation modules including a specific routing operation module in heterogeneous MANET environment. It is not possible for a mobile node to carry all the necessary operation modules due to the limited resources. This paper proposes a scheme to reconfiguring mobile ad hoc nodes using smart packets in heterogeneous routing domains. The smart packet protocol has a capability to transfer a binary execution module to a mobile node, by which a node can be equipped with any necessary routing modules in any MANET environment. The proposed smart packet agent is designed to be suitable to a light weight terminal owing to its simple architecture. The utility of the proposed scheme was demonstrated through an example of DYMO scenario in the wireless network.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.100-109
• /
• 2005

A Mobile Ad-Hoc Network (MANET) supports a multi-hop wireless network without any prepared base station (BS). The MANET is capable of building a mobile network automatically without any help from DHCP servers for address allocation or routers to forward or route messages. Many routing protocols have been proposed for the MANET, but these specify the most optimized or shortest path from a source to a destination, and they assume that nodes are pre-configured before communication. To make up for this, address allocation algorithms, such as MANETConf [1] and prophet address allocation algorithm [2], have been proposed. Especially, MANETConf proposes address allocation algorithm with duplication address check. In this paper, we present a dynamic node configuration protocol based on 2-tierd hierarchical network architecture for mobile ad-hoc network, modified from [1]. Especially, it reduces the number of broadcast message exchange between nodes when a new node somes into a network, which lessens network overhead, remarkably. This protocol is based on two-tired structure, and it ensures address allocation with simple duplication address defection mechanism.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.2
• /
• pp.143-150
• /
• 2014

In this paper, we propose the delivery problem on trees and two algorithms for the problem. The delivery problem on trees is that of minimizing the object delivery time from one node to another node using n various speed robots. Our first algorithm generates an optimal solution with some restrictions in handover places. In this algorithm, we assume that the handover can be made at a vertex of given tree. We try to find the handover places and the robots participate in handover from the start node to the destination node. The second algorithm extends the first one to remove the restriction about the handover places. The second algorithm still generates an optimal solution. The time complexities of both algorithms are $O((n+m)^2)$ where n is the number of robots and m is the number of nodes.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.5
• /
• pp.49-56
• /
• 2004

An Internet draft, named RR(Return Routability) protocol, proposed to IETF mobileip WG, in order to establish an optimal path to MN(Mobile Node) by securely sending the BU(Binding Update) message to CN(Correspondent Node). However, it has some problems with initiating the protocol by the MN: it causes to increases in communication load in the home network, to increases communication delay between MN and CN, and increases in communication load due to unnecessary message exchanges. To resolve the problems, this paper proposes an alternative scheme for the RR protocol in MIPv6. The proposed scheme is devised to start the protocol by HA on receiving the first packet from CN. It decreases the route optimization overhead by reducing the number of BU messages as well as the communication time. Beside these advantages, this scheme provides the same security grade as the original RR protocol.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.167-179
• /
• 2005

In hierarchical Mobile IPv4 Networks the highest FA(Foreign Agent) may experience serious congestion and delay since the highest FA plays a role of CoA(Care of Address) for all mobile nodes in the domain, In this paper, we propose mechanism called 'HRFA(Hierarchical Root Foreign Agent)', which distributes the load imposed on the highest FA. In the proposed HRFA scheme, multiple HRFAs are selected to provide the similar service that is provided by the highest FA. According to which entity determines HRFAs, HRFA scheme is categorized into 'Active' and 'Passive' approaches. HRFA scheme is further categorized into 'All MN(Mobile Node)s' and 'New MNs' approaches, depending on which mobile nodes are assigned to a newly elected HRFA. Through a course of simulations, we investigate the performance of 4 possible combinations of HRFA schemes. We also compare the performance of the proposed HRFA schemes with the LMSP(Local Multicast Service Provider) scheme, which is a scheme to distribute the load of FA for multicast service in hierarchical wireless network domain. The simulation results show that the Passive & New MN approach performs best with respect to both the overhead and the load balancing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11B
• /
• pp.960-968
• /
• 2006

HMIPv6 improved the handover management of basic MIPv6 by introducing the new protocol agent MAP. In this new protocol, MAP instead of the Mobile Node intercepts all packets and redirects the packets to CoA of the Mobile Node. However, this process may degrade the network performance due to the centralization phenomenon of registration occurring in the hierarchical MAP structure. ffe propose two schemes to improve real time traffic performance. First proposal is a MAP selection mettled in which MAP is selected based on traffic characteristics. And we also propose differentiated traffic processing scheme with multi-level queues when Home Agent or Correspondent Nodes process Binding Update messages. Performances of the proposed scheme are analyzed. Analysis result shows that our model has good performance in the respect of location update cost and total cost of Mobile Nodes.

• Journal of Internet Computing and Services
• /
• v.6 no.5
• /
• pp.11-25
• /
• 2005

In MIPv6 environment, an important design consideration for public key based binding update protocols is to minimize asymmetric cryptographic operations in mobile nodes with constraint computational power, such as PDAs and cellular phones, For that, public key based protocols such as CAM-DH. SUCV and Deng-Zhou-Bao's approach provides an optimization to offload asymmetric cryptographic operations of a mobile node to its home agent. However, such protocols have some problems in providing the optimization. Especially, CAM-DH with this optimization does not unload all asymmetric cryptographic operations from the mobile node, while resulting in the home agent's vulnerability to denial of service attacks. In this paper, we improve the drawbacks of CAM-DH. Furthermore, we adopt Aura's two hash-based CGA scheme to increase the cost of brute-force attacks searching for hash collisions in the CGA method. The comparison of our protocol with other public key based protocols shows that our protocol can minimize the MN's computation overhead, in addition to providing better manageability and stronger security than other protocols.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.93-106
• /
• 2011

In this paper we describe an efficient and easy to use internet stopper, which is called AINS (Automatic Internet Stopper), which uses ARP spoofing scheme. Instead of forwarding packets to router for the case of hacking, in ARP spoofing, the AINS ignores all the packets so that internet stopping operates. The AINS program needs to be installed only in manager computer that does not require additional agent program. In addition to setting manually the stopping computer list, it is able to indentify network nodes automatically by analyzing broadcasting packets. The experimental results show that less than 4 secs for spoofing interval is enough for blocking internet usage regardless the number of computers and therefore network overhead is negligible. The AINS can indentify and control network nodes not only on same subnet but also on different subnet only if they are connected onto same ethernet switch physically. It is being used for an efficient tool for controling internet usage of university computer laboratory and also for an efficient network management.

• Korean Journal of Veterinary Service
• /
• v.24 no.1
• /
• pp.51-68
• /
• 2001

The result of studying the epidemiological characteristics of Salmonella strains which have been isolated from the domestic animals in Gyeongbuk province from February 1998 to August 2000 were summarized as follows. The isolation rates of Salmonella strains were 2.0% from cattle feces, 6.3% from cattle lymph node, 9.5% from pig feces, and 25.1% from pig lymph node. In poultry, the isolation rates were 30.3%. The isolates of Salmonella showed positive reaction for MUCAP test, methyl red test, but showed negative reaction for urea test, indole test, Voges Proskauer test. On TSI agar, the isolates showed acid butt, alkaline slant. Also, the isolates were identified as Salmonella strain by API 20E kit. Non H$_2$S Production Salmonella strains isolated from poultry were identified as S gallinarum. As a result of serotyping, B group were the most common in cattle and pig, Dl in chickens. 21 serovars were found. the common serovar from the domestic animals was S typhimurium, S derby, S agona, S schwarzenground, S enteritidis and S gallinarum. The most commonly encountered serovars in cattle were S agona and S typhirimurium in pig, S gallinarum in chicken. As a result of antimicrobial susceptibility test, all Salmonella isolates were susceptible to amikacin, ciprofloxacin, norfloxacin; cefotaxime and polumcin B. The resistance rates to tetracycline and streptomycin was 58% and 56%, respectively. 69.3% of all isolates were resistant to more than one antimicrobial agent. Out of the resistant isolates, the isolates resistant to streptomycin and tetracycline was 36%. There were 24 strains of multiresistant isolates resistant to more than 5 antimicrobial agents. S typhimurium were resistant to all antimicrobial agents, also had a lot of multiresistant strains. Therefore, S typhimurium was considered as a major agent of antimicrobial resistance.

• Korean Journal of Bronchoesophagology
• /
• v.16 no.2
• /
• pp.109-114
• /
• 2010

Background: The aim of this study was to compare a novel mannose receptor-binding agent(Technetium-99m human serum albumin, $^{99m}Tc$-MSA) with $^{99m}Tc$-phytate for sentinel node mapping in patients with esophageal cancer. Material and Method: Twenty patients with clinical stage T1N0m0 or T2N0M0 esophageal cancer that were candidates for esophagectomy were enrolled. Endoscopic injection of $^{99m}Tc$-MSA or $^{99m}Tc$-phytate was administered at the peri-tumor region before surgery in 10 patients. The radioactive lymph nodes were identified with a handheld gamma probe after lymph node dissection. Results: The patient's age and the sex ratio of both groups were similar. The clinical stage, tumor location, and operative technique did not differ. The total number of dissected lymph nodes did not differ ($28.5{\pm}9.12$ in MSA group, $32.2{\pm}11.24$ in phytate group, p=0.430). The sentinel node was identified in all cases in both groups. The number of sentinel nodes per patient was $2.7{\pm}1.57$ in the MSA group, which was significantly greater than the $1.7{\pm}0.88$ in the phytate group (p=0.036). Five out of 20 patients whose sentinel nodes could be identified had metastases; however, neither group had any false-negative results for sentinel node identification. Conclusion: Sentinel nodes were detected more frequently with MSA than with phytate.