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

In this paper, we propose a CPLD low power algorithm considering the structure. The proposed algorithm is implemented CPLD circuit FC(Feasible Cluster) for generating a problem occurs when the node being split to overcome the area and power consumption can reduce the algorithm. CPLD to configure and limitations of the LE is that the number of OR-terms. FC consists of an OR node is divided into mainly as a way to reduce the power consumption with the highest number of output nodes is divided into a top priority. The highest number of output nodes with the highest number of switching nodes become a cut-point. Division of the node is the number of OR-terms of the number of OR-terms LE is greater than adding the input and output of the inverter converts the AND. Reduce the level, power consumption and area. The proposed algorithm to MCNC logic circuits by applying a synthetic benchmark experimental results of 13% compared to the number of logical blocks decreased. 8% of the power consumption results in a reduced efficiency of the algorithm represented been demonstrated.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.3
• /
• pp.79-94
• /
• 2001

This paper presents a new algorithm for the K shortest paths Problem which develops initial K shortest paths, and repeat to expose hidden shortest paths with dual approach and to replace the longest path in the present K paths. The initial solution comprises K shortest paths among shortest paths to traverse each arc in a Double Shortest Arborescence which is made from bidirectional Dijkstra algorithm. When a crossing node that have two or more inward arcs is found at least three time by turns in this K shortest paths, there may be some hidden paths which are shorter than present k-th path. To expose a hidden shortest path, one inward arc of this crossing node is chose by means of minimum detouring distance calculated with dual variables, and then the hidden shortest path is exposed with joining a detouring subpath from source to this inward arc and a spur of a feasible path from this crossing node to sink. If this exposed path is shorter than the k-th path, the exposed path replaces the k-th path. This algorithm requires worst case time complexity of O(Kn$^2$), and O(n$^2$) in the case k$\leq$3.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.40 no.4
• /
• pp.107-121
• /
• 2015

Diffusion of innovation is the process in which an innovation is communicated through certain channels over time among the members of a social system. The literatures have emphasized the importance of interpersonal network influences on individuals in convincing them to adopt innovations and thereby promoting its diffusion. In particular, the behavior of opinion leaders who lead in influencing others' opinion is important in determining the rate of adoption of innovation in a system. Centrality has been recognized as a good indicator that quantifies a node's influences on others in a given network. However, recent studies have questioned its relevance on various different types of diffusion processes. In this regard, this study aims at examining the effect of a node exhibiting high centrality on expediting diffusion of innovations. In particular, we considered the situation where two innovations compete with each other to be adopted by potential adopters who are personally connected with each other. In order to analyze this competitive diffusion process, we developed a simulation model and conducted regression analyses on the outcomes of the simulations performed. The results suggest that the effect of a node with high centrality can be substantially reduced depending upon the type of a network structure or the adoption thresholds of potential adopters in a network.

• ETRI Journal
• /
• v.33 no.5
• /
• pp.791-801
• /
• 2011

Security in wireless sensor networks (WSNs) is an upcoming research field which is quite different from traditional network security mechanisms. Many applications are dependent on the secure operation of a WSN, and have serious effects if the network is disrupted. Therefore, it is necessary to protect communication between sensor nodes. Key management plays an essential role in achieving security in WSNs. To achieve security, various key predistribution schemes have been proposed in the literature. A secure key management technique in WSN is a real challenging task. In this paper, a novel approach to the above problem by making use of elliptic curve cryptography (ECC) is presented. In the proposed scheme, a seed key, which is a distinct point in an elliptic curve, is assigned to each sensor node prior to its deployment. The private key ring for each sensor node is generated using the point doubling mathematical operation over the seed key. When two nodes share a common private key, then a link is established between these two nodes. By suitably choosing the value of the prime field and key ring size, the probability of two nodes sharing the same private key could be increased. The performance is evaluated in terms of connectivity and resilience against node capture. The results show that the performance is better for the proposed scheme with ECC compared to the other basic schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4B
• /
• pp.386-390
• /
• 2011

Modem warfares have changed from PCW (platform Centric Warfare) to NCW (Network Centric Warfare). Therefore, it is more important to operate and manage the network. This paper proposed a node management scheme in military wireless networks. In military wireless networks, nodes can join and leave the networks easily. It causes a degradation of network capacity. This paper figured out a problem caused by node which is leaving the network. This paper proposed a RSSI based method of estimating and detecting the leaving nodes in the networks. Finally, an experimental result was demonstrated to show the efficiency of the proposed method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.233-236
• /
• 2010

This paper describes the packet traffic management of the Ubiquitous Healthcare System. In this system, ECG signal and accelerometer signal is transmitted from a wearable health shirt (WHS) to the base station. However, with the increment of users in this system, traffic over-load issue occurs. The main aim of this paper is to reduce the traffic over-load issue between sensor nodes by only transmitting the required signals to the base station when irregular activities are observed. In order to achieve this, in-network processing is adapted where the process of observation is conducted inside the sensor node of WHS. Results shows that irregular activities such as fall can be detected on real-time inside the sensor node and thus resolves traffic over-load issue.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.18 no.4
• /
• pp.13-21
• /
• 2022

Recently, in wireless video sensor networks(WVSN), various schemes for efficient video data transmission have been studied. In this paper, a layer based cooperative relaying(LCR) algorithm is proposed for minimizing scalable video transmission distortion from packet loss in WVSN. The proposed LCR algorithm consists of two modules. In the first step, a parameter based error propagation metric is proposed to predict the effect of each scalable layer on video quality degradation at low complexity. In the second step, a layer-based cooperative relay algorithm is proposed to minimize distortion due to packet loss using the proposed error propagation metric and channel information of the video sensor node and relay node. In the experiment, the proposed algorithm showed that the improvement of peak signal-to-noise ratio (PSNR) in various channel environments, compared to the previous algorithm(Energy based Cooperative Relaying, ECR) without considering the metric of error propagation.The proposed LCR algorithm minimizes video quality degradation from packet loss using both the channel information of relaying node and the amount of layer based error propagation in scalable video.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.40-42
• /
• 2004

Access Grid는 상호공동작업을 위하여 대용량의 컨텐츠 파일들을 주고받으며 공유한다. 특별히 중앙의 집중된 관리서버가 없는 Access Grid환경에서는 컨텐츠의 위치추적의 어려움, 부재, 병목 등의 현상이 발생하는데 이를 본 논문에서 1. 중앙 Hybrid서버의 구현 2. 집중컨텐츠의 거점노드복제 3. 중요컨텐츠의 24시간 공유보장 등의 기법으로 해결방안을 제안하였다. 그리고 이에 대한 효율성을 시뮬레이션 자료로 증명하였다.

• Journal of Chest Surgery
• /
• v.54 no.4
• /
• pp.263-265
• /
• 2021

Intraoperative events can occur during video-assisted thoracoscopic surgery (VATS) lobectomy due to unfavorable surgical anatomy, such as dense adhesions or calcifications around the pulmonary arteries. Troubleshooting intraoperative complications is essential for performing safe and successful VATS pulmonary resection and lymph node dissection. If continuous bleeding occurs or VATS does not proceed despite all measures, conversion to open thoracotomy should not be delayed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3B
• /
• pp.526-535
• /
• 2010

In this paper, we propose the fault-tolerant network-based mobility management scheme for supporting multimedia services of broadcasting & communications convergence in fixed mobile convergence (FMC) networks. The proposed scheme is based on AIMS (Access Independent Mobility Service) which is developed for the mobility support among heterogeneous access networks. To support stable location management and handover control for a MN, the proposed scheme supports stable management of binding information by sensing network attachment and detachment of a mobile node (MN). In addition, the proposed fault-tolerant (FT) AIMS supports a function of message retransmission for the support of handover control message and a function of heartbeat message transmission for the support of stable access network environments to a mobile node. We evaluate and analyze the performance of the proposed scheme through the implementation of AIMS system test-bed.