• Tuberculosis and Respiratory Diseases
• /
• 제71권3호
• /
• pp.180-187
• /
• 2011

Background: In mediastinal lymph node sampling in non-small cell lung cancer (NSCLC) it is important to determine the appropriate treatment as well as to predict an outcome. Endobronchial ultrasound-guided transbronchial needle aspiration (EBUS-TBNA) is a recently developed, accurate, safe technique in patients with NSCLC for sampling mediastinal lymph nodes. We sought to determine the usefulness of EBUS-TBNA in mediastinal staging with NSCLC considered to be operable. Methods: We retrospectively reviewed the records of 142 patients who underwent EBUS-TBNA for mediastinal staging in the Asan Medical Center, Korea from July 2008 to July 2010. If patients were in an operable state, they underwent subsequent surgical staging. Diagnoses based on biopsy results were compared with those based on surgical results. Results: We performed EBUS-TBNA in 184 mediastinal lymph nodes in 142 NSCLC patients. Almost all of the EBUS-TBNA samples were from the lower paratracheal (112, 60.9%) and subcarinal (57, 31.0%) lymph nodes. In 142 patients, 51 patients (35.9%) were confirmed with malignant invasion of the mediastinal lymph node by EBUS-TBNA and 91 (64.1%) patients were not confirmed. Among the 91 patients, 64 patients (70.3%) underwent surgical staging. 3 patients (4.7%) who were misdiagnosed by the EBUS-TBNA were confirmed by surgery. After Diagnostic sensitivity of EBUS-TBNA, the prediction of mediastinal metastatsis was 94.4% and specificity was 100%. The procedures were performed safely and no serious complications were observed. Conclusion: We demonstrated the high diagnostic value of EBUS-TBNA for mediastinal staging.

• 한국통신학회논문지
• /
• 제32권9B호
• /
• pp.563-568
• /
• 2007

본 논문에서는 대규모 무선 이동 애드혹 네트워크에서 소스 노드에서 목적지 노드로의 데이터 전송을 위한 경로 설정 시 안정적 경로 유지를 위한 경로 설정 방식을 제안한다. 이동 애드혹 네트워크에서 경로 설정 방법은 유선 네트워크의 경로 설정 방법과는 달리 노드의 이동성을 고려한 라우팅 알고리즘을 통해 경로를 설정하고, 설정된 경로를 통하여 데이터를 전송하게 된다. 하지만, 경로 설정 시 목적지에 가장 먼저 도달한 경로 설정 메시지만을 고려한 경로 설정 방법은 노드의 이동성으로 인한 경로 단절이 발생할 확률이 높고, 패킷 전송 시 패킷 손실이나 지연이 발생할 확률이 크다. 특히 노드의 제어 및 안정적 데이터를 전송하기 위한 경로가 불안정적 일 경우 큰 문제가 발생될 수 있다. 그래서 본 논문에서는 소스 노드에서 목적지 노드로의 경로 설정 시 노드의 이동성을 고려함으로써 패킷 전송 시 발생할 수 있는 노드 간 경로 단절 및 패킷 손실 등을 최소화 하는 방식을 제안 한다. 제안한 프로토콜은 노드의 이동 속도를 바탕으로 목적지에서 다수의 RREQ 메시지를 수신하고, MinMax 알고리즘을 통하여 적합한 경로를 선정하게 된다.

• 한국정밀공학회지
• /
• 제31권11호
• /
• pp.1031-1040
• /
• 2014

In this paper, a new condition diagnosis algorithm for the lens injection molding process using various features extracted from cavity pressure, nozzle pressure and screw position signals is developed with the aid of probability neural network (PNN) method. A new feature extraction method is developed for identifying five (5), seven (7) and two (2) critical features from cavity pressure, nozzle pressure and screw position signals, respectively. The node energies extracted from cavity and nozzle pressure signals are also considered based on wavelet packet decomposition (WPD). The PNN method is introduced to build the condition diagnosis model by considering the extracted features and node energies. A series of the lens injection molding experiments are conducted to validate the model, and it is demonstrated that the proposed condition diagnosis model is useful with high diagnosis accuracy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권5호
• /
• pp.1077-1093
• /
• 2013

This paper proposes a new network coordinator node design to select the most suitable wireless technology for WBANs by using fuzzy logic. Its goal is to select a wireless communication technology available considering the user/application requirements and network conditions. A WBAN is composed of a set of sensors placed in, on, or around human body, which monitors the human body functions and the surrounding environment. In an effort to send sensor readings from human body to medical center or a station, a WBAN needs to stay connected to a local or a wide area network by using various wireless communication technologies. Nowadays, several wireless networking technologies may be utilized in WLANs and/or WANs each of which is capable of sending WBAN sensor readings to the desired destination. Therefore, choosing the best serving wireless communications technology has critical importance to provide quality of service support and cost efficient connections for WBAN users. In this work, we have developed, modeled, and simulated some networking scenarios utilizing our fuzzy logic-based NCN by using OPNET and MATLAB. Besides, we have compared our proposed fuzzy logic based algorithm with widely used RSSI-based AP selection algorithm. The results obtained from the simulations show that the proposed approach provides appropriate outcomes for both the WBAN users and the overall network.

• ETRI Journal
• /
• 제39권2호
• /
• pp.275-283
• /
• 2017

A green technology for reducing energy consumption has become a critical factor in ICT industries. However, for the telecommunications sector in particular, most network elements are not usually optimized for power efficiency. Here, we propose a novel energy-efficient packet switching method for use in an IP network for reducing unnecessary energy consumption. As a green networking approach, we first classify the network nodes into either header or member nodes. The member nodes then put the routing-related module at layer 3 to sleep under the assumption that the layer in the OSI model can operate independently. The entire set of network nodes is then partitioned into clusters consisting of one header node and multiple member nodes. Then, only the header node in a cluster conducts IP routing and its member nodes conduct packet switching using a specially designed identifier, a tag. To investigate the impact of the proposed scheme, we conducted a number of simulations using well-known real network topologies and achieved a more energy- efficient performance than that achieved in previous studies.

• Journal of Communications and Networks
• /
• 제16권4호
• /
• pp.371-377
• /
• 2014

Localized topology control is attractive for obtaining reduced network graphs with desirable features such as sparser connectivity and reduced transmit powers. In this paper, we focus on studying how to prolong network lifetime in the context of localized topology control for wireless multi-hop networks. For this purpose, we propose an energy efficient localized topology control algorithm. In our algorithm, each node is required to maintain its one-hop neighborhood topology. In order to achieve long network lifetime, we introduce a new metric for characterizing the energy criticality status of each link in the network. Each node independently builds a local energy-efficient spanning tree for finding a reduced neighbor set while maximally avoiding using energy-critical links in its neighborhood for the local spanning tree construction. We present the detailed design description of our algorithm. The computational complexity of the proposed algorithm is deduced to be O(mlog n), where m and n represent the number of links and nodes in a node's one-hop neighborhood, respectively. Simulation results show that our algorithm significantly outperforms existing work in terms of network lifetime.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2010년도 춘계학술대회
• /
• pp.860-863
• /
• 2010

센서 네트워크는 무선 네트워킹 기능이 있는 작고, 독립적인 장치이다. 실제 응용에서의 적응성을 향상시키기 위해서 에너지 소모를 최소화하는 것이 중요한 문제 중의 하나이다. 그러므로 무선 센서 네트워크를 평가하기 위해서는 정확한 에너지 모델이 필요하다. 센서 노드의 수명을 추정하기 위해 TinyOS로 동작하는 Telosb 플래폼 기반의 센서 노드의 에너지 특성을 측정하였다. 제안한 모델을 사용하면 배터리로 구동되는 센서 노드는 1시간 동안 10번 움직임을 감지한다면 약 6.925개월을 사용할 수 있다.

• Journal of Communications and Networks
• /
• 제14권4호
• /
• pp.451-460
• /
• 2012

Natural disasters often lead to regional failures that can cause network nodes and links co-located in a large geographical area to fail. Novel approaches are required to assess the network vulnerability under such regional failures. In this paper, we investigate the vulnerability of networks by considering the geometric properties of regional failures and network nodes. To evaluate the criticality of node locations and determine the critical areas in a network, we propose the concept of ${\alpha}$-critical-distance with a given failure impact ratio ${\alpha}$, and we formulate two optimization problems based on the concept. By analyzing the geometric properties of the problems, we show that although finding critical nodes or links in a pure graph is a NP-complete problem, the problem of finding critical areas has polynomial time complexity. We propose two algorithms to deal with these problems and analyze their time complexities. Using real city-level Internet topology data, we conducted experiments to compute the ${\alpha}$-critical-distances for different networks. The computational results demonstrate the differences in vulnerability of different networks. The results also indicate that the critical area of a network can be estimated by limiting failure centers on the locations of network nodes. Additionally, we find that with the same impact ratio ${\alpha}$, the topologies examined have larger ${\alpha}$-critical-distances when the network performance is measured using the giant component size instead of the other two metrics. Similar results are obtained when the network performance is measured using the average two terminal reliability and the network efficiency, although computation of the former entails less time complexity than that of the latter.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1995년도 추계학술대회발표논문집; 서울대학교, 서울; 30 Sep. 1995
• /
• pp.202-210
• /
• 1995

Given a tree T with a root node 0 having the capacity H and a profit $c_{v}$ and a demand $d_{v}$ on each node v of T, the capacitated subtree of a tree problem(CSTP) is to find a subtree of T containing the root that has the maximum total profit, the sum of profits over the subtree, and also satisfies the constraint of which the sum of demands over the subtree must be less than or equal to H. We first define the so-called critical item for CSTP and find an upper bound on the linear programming relaxation of CSTP. We then present our branch and bound algorithm for solving CSTP and finally report the computational results on a set of randomly generated test problems.s.s.

• Journal of Communications and Networks
• /
• 제16권6호
• /
• pp.620-626
• /
• 2014

In this paper, we propose a parallel collaborative sphere decoder with a scalable architecture promising quasi-maximum likelyhood performance with a relatively small amount of computational resources. This design offers a hardware-friendly algorithm using a modified node operation through fixing the variable complexity of the critical path caused by the sequential nature of the conventional sphere decoder (SD). It also reduces the computational complexity compared to the fixed-complexity sphere decoder (FSD) algorithm by tree pruning using collaboratively operated node operators. A Monte Carlo simulation shows that our proposed design can be implemented using only half the parallel operators compared to the approach using an ideal fully parallel scheme such as FSD, with only about a 7% increase of the normalized decoding time for MIMO dimensions of $16{\times}16$ with 16-QAM modulation.