• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.266-274
• /
• 2003

One of the major issues in current on-demand routing protocols for ad hoc networks is the high resource consumed by route discovery traffic. In these protocols, flooding is typically used by the source to broadcast a route request (RREQ) packet in search of a route to the destination. Such network-wide flooding potentially disturbs many nodes unnecessarily by querying more nodes than is actually necessary, leading to rapid exhaustion of valuable network resources such as wireless bandwidth and battery power. In this paper, a simple optimization technique for efficient route discovery is proposed. The technique proposed herein is location-based and can be used in conjunction with the existing Location-Aided Routing (LAR) scheme to further reduce the route discovery overhead. A unique feature of our technique not found in LAR and most other protocols is the selective use of unicast instead of broadcast for route request/query transmission made possible by a novel reuse of routing and location information. We refer to this new optimization as the UNIQUE (UNIcast QUEry) technique. This paper studies the efficacy of UNIQUE by applying it to the route discovery of the Dynamic Source Routing (DSR) protocol. In addition, a comparative study is made with a DSR protocol optimized with only LAR. The results show that UNIQUE could further reduce the overall routing overhead by as much as 58% under highly mobile conditions. With less congestion caused by routing traffic, the data packet delivery performance also improves in terms of end-to-end delay and the number of data packets successfully delivered to their destinations.

• Journal of Internet Computing and Services
• /
• v.13 no.2
• /
• pp.73-86
• /
• 2012

This paper theoretically derives an algorithm to discover a new type of social networks from workflow models, which is termed workflow-based social network intelligence. In general, workflow intelligence (or business process intelligence) technology consists of four types of techniques that discover, analyze, monitor and control, and predict from workflow models and their execution histories. So, this paper proposes an algorithm, which is termed ICN-based workflow-based social network intelligence discovery algorithm, to be classified into the type of discovery techniques, which are able to discover workflow-based social network intelligence that are formed among workflow performers through a series of workflow models and their executions, In order particularly to prove the correctness and feasibility of the proposed algorithm, this paper tries to apply the algorithm to a specific workflow model and to show that it is able to generate its corresponding workflow-based social network intelligence.

• Journal of Communications and Networks
• /
• v.17 no.6
• /
• pp.558-567
• /
• 2015

In recent years, we have seen a proliferation of mobile-network-enabled smart objects, such as smart-phones and smart-watches, that form a cyber-physical integrated network to connect the cyber and physical worlds through the capabilities of sensing, communicating, and computing. Discovery of the relationship between smart objects is a critical and nontrivial task in cyber-physical integrated network applications. Aiming to find the most stable relationship in the heterogeneous and dynamic cyber-physical network, we propose a distributed and efficient relationship-discovery algorithm, called dynamically maximizing remaining unchanged time with minimum connected dominant set (DMRUT-MCDS) for constructing a backbone with the smallest scale infrastructure. In our proposed algorithm, the impact of the duration of the relationship is considered in order to balance the size and sustain time of the infrastructure. The performance of our algorithm is studied through extensive simulations and the results show that DMRUT-MCDS performs well in different distribution networks.

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

Recently, the rapid growth of Internet technology and the deployment of high speed networks make many kinds of multimedia services possible. Preexisting multimedia services are designed based on the client/server model which has the problems such as the network failure and the low speed communication due to the high load on the central server. In order to solve these problems, peer-to-peer networks are introduced and expanded through Internet environments. In this paper, we propose a pure peer-to-peer network based resource discovery mechanism for multimedia services. In the proposed scheme, each host maintains the location information of resources which are recently requested by other hosts as well as that oi the replicas of local resources. The proposed scheme has the faster response time and incurs the smaller traffic than the preexisting discovery schemes in pure peer-to-peer network environments. Also, by decentralizing the location information and differentiating the reply path, our proposed scheme can solve the search result loss problem that occurs when the network is unsettled.

• Journal of Internet Computing and Services
• /
• v.13 no.2
• /
• pp.109-118
• /
• 2012

This paper theoretically derives an algorithm to discover a new type of workflow-based knowledge from workflow models, which is termed workflow-based affiliation network knowledge. In general, workflow intelligence (or business process intelligence) technology consists of four types of techniques that discover, analyze, monitor and control, and predict a series of workflow-based knowledge from workflow models and their execution histories. So, this paper proposes a knowledge discovery algorithm which is able to discover workflow-based affiliation networks that represent the association and participation relationships between activities and performers defined in ICN-based workflow models. In order particularly to prove the correctness and feasibility of the proposed algorithm, this paper tries to apply the algorithm to a specific workflow model and to show that it is able to derive its corresponding workflow-based affiliation network knowledge.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.3
• /
• pp.30-37
• /
• 2005

Ad hoc network is a collection of mobile nodes without using any infrastructure, it , is using in the various fields. Because ad hoc network is vulnerable to attacks such as routing disruption and resource consumption, it is in need of routing protocol security. In this paper, we propose two secure route-discovery protocols. One is a protocol using hash function. This protocol is weak in active attack but has some merits such as small data of transmission packet and small computation at each hop. The other is a protocol using hash function and public key cryptography. This protocol is strong in active attack.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9B
• /
• pp.1342-1349
• /
• 2010

Full-mesh IPSec tunnels, which constitute a black network, are required so that the dynamically changing PT (Plain Text) networks can be reachable across the black network in military environments. In the secure and mobile black networks, dynamically re-configuring IPSec tunnels and security policy database (SPD) is very difficult to manage. In this paper, for the purpose of solving mobility and security issues in military networks, we suggest the relating main technologies in association with DMIDP (Dynamic Multicast-based IPSec Discovery Protocol) based on existing IPSec ESP (Encapsulating Security Payload) tunnels and IPSec key managements. We investigate the main parameters of the proposed DMIDP techniques and their operational schemes which have effects on mobility and analyze operational effectivemess of the DMIDP with proposed parameters.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.11
• /
• pp.1076-1080
• /
• 2010

EPCglobal Network is based on the Electronic Product Code(EPC) and rapidly opening up to many enterprises that have close relationships with each other. Since a huge amount of logistics Information is distributed in the EPCglobal Network, it needs to manage them effectively. Global logistics companies and institutes are studying and setting up the standards about EPC Information Service(EPCIS), Object Name Service (ONS) and EPC Discovery Service(EPCDS) in the RFID and EPC-based logistics information network. In this paper, we propose expanded EPCIS and EPCDS that are satisfy EPCglobal standards and enable more effective logistics information management.

• Genomics & Informatics
• /
• v.14 no.1
• /
• pp.2-11
• /
• 2016

The advances in mass spectrometry-based proteomics technologies have enabled the generation of global proteome data from tissue or body fluid samples collected from a broad spectrum of human diseases. Comparative proteomic analysis of global proteome data identifies and prioritizes the proteins showing altered abundances, called differentially expressed proteins (DEPs), in disease samples, compared to control samples. Protein biomarker candidates that can serve as indicators of disease states are then selected as key molecules among these proteins. Recently, it has been addressed that cellular pathways can provide better indications of disease states than individual molecules and also network analysis of the DEPs enables effective identification of cellular pathways altered in disease conditions and key molecules representing the altered cellular pathways. Accordingly, a number of network-based approaches to identify disease-related pathways and representative molecules of such pathways have been developed. In this review, we summarize analytical platforms for network-based protein biomarker discovery and key components in the platforms.

• Journal of Information Processing Systems
• /
• v.11 no.1
• /
• pp.125-133
• /
• 2015

The Remote Device Management (RDM) protocol is used to manage the devices in the lighting control networks. RDM provides bi-directional communications between a controller and many lighting devices over the DMX512-A network. In RDM, using a simple binary search scheme, which is based on the 48-bit unique ID (UID) of each device, discovers the lighting devices. However, the existing binary search scheme tends to require a large delay in the device discovery process. In this paper, we propose a novel partition-based discovery scheme for fast device discovery in RDM. In the proposed scheme, all devices are divided into several partitions as per the device UID, and the controller performs device discovery for each partition by configuring a response timer that each device will use. From numerical simulations, we can see that there is an optimal number of partitions to minimize the device discovery time for a given number of devices in the proposed scheme, and also that the proposed partition-based scheme can reduce the device discovery time, as compared to the existing binary search scheme.