• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10A
• /
• pp.956-963
• /
• 2008

In a multi-hop wireless ad hoc network broadcasting is an elementary operation to support route discovery, address resolution and other application tasks. Broadcasting by flooding may cause serious redundancy, contention, and collision in the network which is referred to as the broadcast storm problem. Many broadcasting schemes have been proposed to give better performance than simple flooding in wireless ad hoc network. How to decide whether re-broadcast or not also poses a dilemma between reachability and efficiency under different host densities. In this paper, we propose enhanced broadcasting schemes, which can reduce re-broadcast packets without loss of reachability. Simulation results show that proposed schemes can offer better reachability as well as efficiency as compared to other previous schemes.

• Journal of IKEEE
• /
• v.14 no.4
• /
• pp.312-316
• /
• 2010

We describe in this paper how to facilitate ad hoc routing with a particle filter in a hostile radio environment for multi-hop wireless ad hoc networks that connect multi-robots. The proposed scheme increases a connection's throughput by exploiting alternative links without going through the procedure of route discovery when link failure happens among multi-robots' networking. The scheme is implemented by using a particle filter to find strongly connected nodes. The filter estimates the probability distribution function in a sample-based manner with N particles. The particles are associated with a weight which represents the probability of the corresponding node to be the node with the best link. At every step of the estimation, the weights of particles are calculated and particles are resampled based on the weights. Since a node with the strongest link status possesses the largest number of particles, we take this node to forward the packets.

• Parasites, Hosts and Diseases
• /
• v.54 no.5
• /
• pp.565-572
• /
• 2016

Whilst archaeological evidence for many aspects of life in ancient China is well studied, there has been much less interest in ancient infectious diseases, such as intestinal parasites in past Chinese populations. Here, we bring together evidence from mummies, ancient latrines, and pelvic soil from burials, dating from the Neolithic Period to the Qing Dynasty, in order to better understand the health of the past inhabitants of China and the diseases endemic in the region. Seven species of intestinal parasite have been identified, namely roundworm, whipworm, Chinese liver fluke, oriental schistosome, pinworm, Taenia sp. tapeworm, and the intestinal fluke Fasciolopsis buski. It was found that in the past, roundworm, whipworm, and Chinese liver fluke appear to have been much more common than the other species. While roundworm and whipworm remained common into the late 20th century, Chinese liver fluke seems to have undergone a marked decline in its prevalence over time. The iconic transport route known as the Silk Road has been shown to have acted as a vector for the transmission of ancient diseases, highlighted by the discovery of Chinese liver fluke in a 2,000 year-old relay station in northwest China, 1,500 km outside its endemic range.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.9
• /
• pp.1799-1805
• /
• 2007

Wireless Ad-hoc networks may contain nodes of various types of which many can have limited power capabilities. A failure of a node due to energy exhaustion may impact the performance of the whole network hence, energy must be conserved. In this paper, we propose a Delay and Energy-Aware Routing (DEAR) algorithm a multiple metric path cost routing algorithm which considers not only the energy consumed by the node during transmission and reception but as well as the residual energy of the node and the delay incurred during route discovery. Based on our results, DEAR algorithm performs well and maximizes network lifetime by routing flows to nodes with sufficient energy such that the energy consumption is balanced among nodes in proportion to their energy reserves.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.10
• /
• pp.2658-2681
• /
• 2023

In edge computing scenarios, IoT end devices play a crucial role in relaying and forwarding data to significantly improve IoT network performance. However, traditional routing mechanisms are not applicable to this scenario due to differences in network size and environment. Therefore, it becomes crucial to establish an effective and reliable data transmission path to ensure secure communication between devices. In this paper, we propose a trusted path selection strategy that comprehensively considers multiple attributes, such as link stability and edge cooperation, and selects a stable and secure data transmission path based on the link life cycle, energy level, trust level, and authentication status. In addition, we propose the Stability-based On-demand Multipath Distance Vector (STAOMDV) protocol based on the Ad hoc AOMDV protocol. The STAOMDV protocol implements the collection and updating of link stability attributes during the route discovery and maintenance process. By integrating the STAOMDV protocol with the proposed path selection strategy, a dependable and efficient routing mechanism is established for IoT networks in edge computing scenarios. Simulation results validate that the proposed STAOMDV model achieves a balance in network energy consumption and extends the overall network lifespan.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.7
• /
• pp.1313-1329
• /
• 2015

In MANET, frequent route breaks lead to repeated route discovery process and this increases control packet overhead and packet drop. AODV-I improves performance of AODV by using the event driven approach which removes periodic Hello message. Unlike the Hello message, Interrupt message which is sent for each event can detect and predict the link failure because it allows node to know the status of the neighbor node. From this characteristics of Interrupt message, performance of AODV-I can be further improved by adding a processing procedures for each type of Interrupt message and it is also possible to improve AODV-I by adding the Backup path scheme because it originally has problems due to a single path of AODV. In this paper, we propose AODV-IB that combines improved Backup path scheme and Interrupt message approach of AODV-I in order to reduce transmission delay and the number of route discoveries. AODV-IB improves AODV-I by adding proper processing procedures for the link failure prediction and detection for each Interrupt message. We also implement improved Backup path strategy in AODV-IB by minimizing delay without additional Control packet. Simulation results, using the simulator QualNet 5.0, indicate that proposed AODV-IB performs better than AODV-I.

• The KIPS Transactions:PartC
• /
• v.14C no.5
• /
• pp.425-430
• /
• 2007

Without the aid of stationary infrastructure, maintaining routing information for all nodes is inefficient in the Mobile Ad hoc Networks(MANET). It is more efficient when every time routing information is necessary that the source node broadcasts a query message to neighbour nodes. The source node using Ad hoc On-Demand distance Vector(AODV), which is one of the routing protocols of MANET, uses the Expanding Ring Search(ERS) algorithm which finds a destination node efficiently. In order to reduce the congestion of the network, ERS algorithm does not broadcast Route REQuest(RREQ) messages in the whole network. When the timer expires, if source node does not receive Route REPly(RREP) messages from the destination node, it gradually increases TTL value and broadcasts RREQ messages. Existing AODV cost a great deal to find a destination node because it uses a fixed NODE_TRAVERSAL_TIME value. Without the message which is added in existing AODV protocols, this paper measures delay time among the neighbours' nodes by making use of HELLO messages. We propose Adaptive ERS(AERS) algorithm that makes NET_TRAVERSAL_TIME optimum which apply to the measured delay time to NODE_TRAVERSAL_TIME. AERS suppresses the unnecessary messages, making NET_TRAVERSAL_TIME optimum in this paper. So we will be able to improve a network performance. We prove the effectiveness of the proposed method through simulation.

• Journal of the Korean Chemical Society
• /
• v.54 no.1
• /
• pp.77-87
• /
• 2010

Hospital-acquired methicillin-resistant Staphylococcus aureus (MRSA) has been an increasing problem worldwide since the initial reports over 40 years ago. To examine new drug leads with potential antibacterial activities, Various N'-[(-3-substituted-4-oxo-1,3-thiazolidin-2-ylidene]-4-hydroxy benzohydrazide (4a-4.i) and N'-[-(3,4-disubstituted)-1,3-thiazolidin-2ylidene)]-4-hydroxybenzohydrazide from (5.a-5.i) to (10.a-10.i) were synthesized using appropriate synthetic route. The entire test compounds (4.a-4.i) and from (5.a-5.i) to (10.a-10.i) were assayed in vitro against s. aureus strain. The minimum inhibitory concentration (MIC) was determined for test compounds and for reference standards. The test compounds showed significant antibacterial activity against the strains used, when tested in vitro. In general, p-hydroxybenzohydrazide ring and substituted thiazoline ring are essential for antimicrobial activity. Among the compounds tested, compounds 6.f, 7.g, 9.f and 10.f, 10 i were found to be most potent. The test compounds were found nontoxic upto the dose level of 2000 ${\mu}g$/mL. The intact compounds were then subjected for 3D-QSAR studies. 3D-QSAR study based on the principal of alignment of pharmacophoric features by Schrodinger PHASE module. The 3D-QSAR study allowed us to confirm the preferential binding mode of p-hydroxybenzohydrazide inside the active site.

• Journal of KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.673-684
• /
• 2004

As the wireless mobile communication is being widespread, mobile technologies will have important roles in the communication with the explosive growth of demanding for wireless portable devices. Among the mobile technologies, a great deal of interest has been taken in mobile ad hoc network (MANET), which is a collection of wireless mobile nodes forming a temporary network without the aid of stationary infrastructure in recent. Furthermore, considering characteristic of ad hoc networks, the design of efficient routing protocols is an important issue. In recent years, on-demand protocols among routing protocols have noticed because of the low routing overhead. However, on-demand protocols suffer from production of the enormous query Packets by broadcasting in order to setup routes, that is, a flooding scheme. The flooding scheme is very costly and results in serious problem, which we refer as the broadcast storm problem. In this paper, we propose a Dynamic Adaptation Query flooding Using Neighbor Topology (NT-DAQ) scheme, in order to resolve the broadcast storm Problem. When a route discovery is in progress, each mobile node decides on the basis of neighbor topology information whether discovery process participates or not. Therefore, our proposed scheme enables to improve network performance in which minimize the number of query rackets. We evaluate the efficiency of our proposed scheme through simulation.

• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.259-266
• /
• 2005

Recently data centric routing or application dependent routing protocols are emerged in mobile ad hoc networks. In this paper, we propose a routing method for query processing in MANET(Mobile Ad hoc NETwork) environment, called road-based query routing, with consideration on real time traffic information of large number of vehicles. In particular, we focus on the method that process arrival time dependent shortest path query in MANET without a central server on the road networks. The main idea of our approach lies in a routing message that includes query predicates based on the road connectivity and on data gathering method in real time from vehicles on the road by ad-hoc network. We unify route discovery phase and data delivery(query processing) phase in our mechanism and reduce unnecessary flooding messages by pruning mobile nodes which are not on the same or neighboring road segments. In order to evaluate the performances of the proposed method, we established a model of road networks and mobile nodes which travel along the roads. The measurement factor is the number of nodes to whom route request is propagated according to each pruning strategy. Simulation result shows that road information is a dominant factor to reduce the number of messages.