• Title/Summary/Keyword: virtual nodes

검색결과 222건 처리시간 0.029초

Virtual lymph node analysis to evaluate axillary lymph node coverage provided by tangential breast irradiation

  • Park, Shin-Hyung;Kim, Jae-Chul;Lee, Jeong Eun;Park, In-Kyu
    • Radiation Oncology Journal
    • /
    • 제33권1호
    • /
    • pp.50-56
    • /
    • 2015
  • Purpose: To investigate the coverage of axillary lymph node with tangential breast irradiation fields by using virtual lymph node (LN) analysis. Materials and Methods: Forty-eight women who were treated with whole breast irradiation after breast-conserving surgery were analyzed. The axillary and breast volumes were delineated according to the Radiation Therapy Oncology Group (RTOG) contouring atlas. To generate virtual LN contours, preoperative fluorodeoxyglucose positron emission tomography/computed tomography (FDG-PET/CT) scans with identifiable LN were fused with the CT scans, and the virtual LN contour were delineated on the CT. Results: The median level I and II axillary volume coverage percentages at the $V_{D95%}$ line were 33.5% (range, 5.3% to 90.4%) and 0.6% (range, 0.0% to 14.6%), respectively. Thirty-one LNs in 18 patients were delineated (26 in level I and 5 in level II). In the level I axilla, 84.6% of virtual LNs were encompassed by the 95% isodose line. In the level II axilla, by contrast, none of the virtual LNs were encompassed by the 95% isodose volumes. There was a substantial discrepancy between the RTOG contouring atlas-based axillary volume analysis and the virtual LN analysis, especially for the level I axillary coverage. The axillary volume coverage was associated with the body mass index (BMI) and breast volume. Conclusion: The tangential breast irradiation did not deliver adequate therapeutic doses to the axillary region, particularly those in the level II axilla. Patients with small breast volumes or lower BMI showed reduced axillary coverage from the tangential breast fields. For axillary LN irradiation, individualized anatomy-based radiation fields for patients would be necessary.

무선 애드 혹 네트워크에서 가상위치정보 기반 라우팅 기법 (Virtual Location Information based Routing Scheme in Wireless Ad-Hoc Networks)

  • 윤주상
    • 한국컴퓨터정보학회논문지
    • /
    • 제18권2호
    • /
    • pp.77-85
    • /
    • 2013
  • 최근 무선 애드 혹 네트워크에서 경로 탐색을 위한 위치정보 기반 라우팅 프로토콜에 관한 연구가 활발히 진행 중이다. 위치정보 기반 라우팅 프로토콜은 모든 노드가 GPS 장치를 통해 자신의 위치정보를 습득하고 이를 이용해 제한적 영역으로만 플러딩을 수행한다. 따라서 기존 IP 기반 라우팅 프로토콜보다 라우팅 메시지 수를 줄일 수 있는 장점을 가지고 있다. 또한 이 프로토콜은 네트워크를 구성하는 모든 노드가 자신의 위치정보를 습득해야만 라우팅에 참여할 수 있도록 가정하고 있다. 하지만 최근 소형화 되고 있는 센서 노드의 경우 GPS 장치가 없는 경우가 있다. 따라서 자신의 위치정보가 없는 센서 노드의 경우 네트워크 구성 및 위치기반 라우팅에 참여가 불가능하다. 따라서 본 논문에서는 GPS 기능을 가진 노드와 그렇지 않은 노드가 서로 공존하는 무선 애드 혹 네트워크에서 GPS 기능을 가지고 있지 않은 노드가 위치정보 기반 라우팅 프로토콜에 참여할 수 있는 가상 위치정보 기반 라우팅 프로토콜을 제안한다. 이 프로토콜은 위치정보를 획득할 수 없는 노드가 자신의 주위 노드의 위치 정보를 획득하여 자신의 위치정보로 활용할 수 있는 기법이다. 따라서 제안하는 프로토콜은 GPS 기능을 가지고 있지 않은 무선 노드가 애드 혹 네트워크 구성에 참여하여 위치정보 기반 라우팅에 참여 할 수 있는 장점을 가지고 있다.

Cognitive Virtual Network Embedding Algorithm Based on Weighted Relative Entropy

  • Su, Yuze;Meng, Xiangru;Zhao, Zhiyuan;Li, Zhentao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권4호
    • /
    • pp.1845-1865
    • /
    • 2019
  • Current Internet is designed by lots of service providers with different objects and policies which make the direct deployment of radically new architecture and protocols on Internet nearly impossible without reaching a consensus among almost all of them. Network virtualization is proposed to fend off this ossification of Internet architecture and add diversity to the future Internet. As an important part of network virtualization, virtual network embedding (VNE) problem has received more and more attention. In order to solve the problems of large embedding cost, low acceptance ratio (AR) and environmental adaptability in VNE algorithms, cognitive method is introduced to improve the adaptability to the changing environment and a cognitive virtual network embedding algorithm based on weighted relative entropy (WRE-CVNE) is proposed in this paper. At first, the weighted relative entropy (WRE) method is proposed to select the suitable substrate nodes and paths in VNE. In WRE method, the ranking indicators and their weighting coefficients are selected to calculate the node importance and path importance. It is the basic of the WRE-CVNE. In virtual node embedding stage, the WRE method and breadth first search (BFS) algorithm are both used, and the node proximity is introduced into substrate node ranking to achieve the joint topology awareness. Finally, in virtual link embedding stage, the CPU resource balance degree, bandwidth resource balance degree and path hop counts are taken into account. The path importance is calculated based on the WRE method and the suitable substrate path is selected to reduce the resource fragmentation. Simulation results show that the proposed algorithm can significantly improve AR and the long-term average revenue to cost ratio (LTAR/CR) by adjusting the weighting coefficients in VNE stage according to the network environment. We also analyze the impact of weighting coefficient on the performance of the WRE-CVNE. In addition, the adaptability of the WRE-CVNE is researched in three different scenarios and the effectiveness and efficiency of the WRE-CVNE are demonstrated.

Energy Efficient Routing in Wireless Sensor Networks

  • Cho, Seongsoo;Shrestha, Bhanu;Shrestha, Surendra;Lee, Jong-Yong;Hong, Suck-Joo
    • International journal of advanced smart convergence
    • /
    • 제3권2호
    • /
    • pp.1-5
    • /
    • 2014
  • Sensor nodes depend on batteries for energy source in Wireless Sensor Networks (WSNs). Low Energy Adaptive Clustering Hierarchy (LEACH) is a representative cluster-based routing protocol designed to ensure energy use efficiency whereas the virtual cluster exchange routing (VCR) information only with its closest node to build a network. In this paper, a protocol scheme was proposed wherein member nodes are designed to compare the currently sensed data with the previously sensed one and to switch to sleep mode when a match is achieved. The design is to help improve the transmission energy efficiency too.

Wavelength Assignment Algorithms fora Multihop Lightwave Network

  • Seo, Jun-Bae;Seo, Hyun-Hwa;Lee, Hyong-Woo;Cho, Choong-Ho
    • 한국통신학회논문지
    • /
    • 제28권6B호
    • /
    • pp.523-532
    • /
    • 2003
  • GENMET(GEneralized Multihop Network) which is based on Wavelength-Division Multiplexsing(WDM) and can be used in order to construct the next generation lightwave network is a logical(virtual), packet-switched and multihop topology network. GENMET is a regular multihop network which is a generalization of Shuffle network and do Bruijn network As such, it has the advantage of simple routing which is critical in a high speed network Given a physical topology, different logical topologies can be derived for assigning wavelengths to the UserNodes. By appropriately assigning wavelengths, performance of the network, such as mean hop count, maximum throughput and mean packet delay can be improved. In this paper, we propose heuristic algorithms for effectively assigning a limited number of wavelengths to the given UserNodes. The Performance of proposed algorithm is compared with the random assignment and the lower bounds.

Void Less Geo-Routing for Wireless Sensor Networks

  • Joshi, Gyanendra Prasad;Lee, Chae-Woo
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
    • /
    • pp.433-435
    • /
    • 2007
  • Geographic wireless sensor networks use position information for Greedy routing. Greedy routing works well in dense network where as in sparse network it may fail and require the use of recovery algorithms. Recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costlier for resource constrained position based wireless sensor type networks. In the present work, we propose a Void Avoidance Algorithm (VAA); a novel idea based on virtual distance upgrading that allows wireless sensor nodes to remove all stuck nodes by transforming the routing graph and forward packet using greedy routing only without recovery algorithm. In VAA, the stuck node upgrades distance unless it finds next hop node which is closer to the destination than itself. VAA guarantees the packet delivery if there is a topologically valid path exists. NS-2 is used to evaluate the performance and correctness of VAA and compared the performance with GPSR. Simulation results show that our proposed algorithm achieves higher delivery ratio, lower energy consumption and efficient path.

  • PDF

연속 접촉 처리를 고려한 실린더 벤딩 성형 공정의 유한요소해석 (Finite Element Analysis of the Unconstrained Cylindrical Bending Process Considering Continuous Contact Treatment)

  • 김태정;양동열
    • 소성∙가공
    • /
    • 제14권6호
    • /
    • pp.547-552
    • /
    • 2005
  • In general, the sheet metal and die are described by finite elements for the simulation of the metal forming processes. Because the characteristics as continuum of the sheet metal are represented with triangles and rectangles, the errors occur inevitably in finite element analysis. Many contact schemes to describe the deformation modes exactly have been introduced in order to decrease these errors. In this study, a scheme for continuous contact treatment is proposed in order to consider the realistic behavior of contact phenomena during the forming process. The discrete mesh causes stepwise propagation of contact nodes of the sheet even though the contact region of the real forming process is altered very smoothly. It gives rise to convergence problem in case that the process, for example bending process, is sensitive to the contact between the sheet and the tools. The analysis of the unconstrained cylindrical bending process without blank holder is also presented in order to investigate the effect of the proposed algorithm.

A new method to detect attacks on the Internet of Things (IoT) using adaptive learning based on cellular learning automata

  • Dogani, Javad;Farahmand, Mahdieh;Daryanavard, Hassan
    • ETRI Journal
    • /
    • 제44권1호
    • /
    • pp.155-167
    • /
    • 2022
  • The Internet of Things (IoT) is a new paradigm that connects physical and virtual objects from various domains such as home automation, industrial processes, human health, and monitoring. IoT sensors receive information from their environment and forward it to their neighboring nodes. However, the large amounts of exchanged data are vulnerable to attacks that reduce the network performance. Most of the previous security methods for IoT have neglected the energy consumption of IoT, thereby affecting the performance and reducing the network lifetime. This paper presents a new multistep routing protocol based on cellular learning automata. The network lifetime is improved by a performance-based adaptive reward and fine parameters. Nodes can vote on the reliability of their neighbors, achieving network reliability and a reasonable level of security. Overall, the proposed method balances the security and reliability with the energy consumption of the network.

Design and Analysis of Lightweight Trust Mechanism for Accessing Data in MANETs

  • Kumar, Adarsh;Gopal, Krishna;Aggarwal, Alok
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권3호
    • /
    • pp.1119-1143
    • /
    • 2014
  • Lightweight trust mechanism with lightweight cryptographic primitives has emerged as an important mechanism in resource constraint wireless sensor based mobile devices. In this work, outlier detection in lightweight Mobile Ad-hoc NETworks (MANETs) is extended to create the space of reliable trust cycle with anomaly detection mechanism and minimum energy losses [1]. Further, system is tested against outliers through detection ratios and anomaly scores before incorporating virtual programmable nodes to increase the efficiency. Security in proposed system is verified through ProVerif automated toolkit and mathematical analysis shows that it is strong against bad mouthing and on-off attacks. Performance of proposed technique is analyzed over different MANET routing protocols with variations in number of nodes and it is observed that system provide good amount of throughput with maximum of 20% increase in delay on increase of maximum of 100 nodes. System is reflecting good amount of scalability, optimization of resources and security. Lightweight modeling and policy analysis with lightweight cryptographic primitives shows that the intruders can be detection in few milliseconds without any conflicts in access rights.

소형 반도체 센서모듈 기반 방사선정보 원격 가시화기술 연구 (Remote Visualization of Radiation Information based on small Semiconductor Sensor Modules)

  • 이남호;황영관;허용석
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2012년도 춘계학술대회
    • /
    • pp.876-879
    • /
    • 2012
  • 본 논문에서는 고준위 방사선구역의 방사능준위 분포를 원격에서 안전하게 측정할 수 있는 방사선량 측정기술의 구현에 관해 논하였다. 설계된 방사선량 매핑장치는 고준위 방사선환경에 위치하는 방사선 노드와 원격 전송된 방사선 정보를 그래픽화된 공간위치상에 가시화하는 방사선 스테이션으로 구성된다. 다수의 방사선 노드는 사고환경의 방사선량 정보를 pMOSFET 센서로 센싱하여 무선정보로 송신하는 기능을 수행하고 방사선 스테이션에서는 방사선 노드로 부터 수신된 방사선량 정보와 위치정보를 결합하여 현장을 모사한 그래픽 공간상에 실측 방사선분포 정보 가시화하게 된다. 제작된 방사선 노드를 실험실 공간에 부착하고 원격 방사선 정보가시화 프로그램을 통하여 방사선정보 매핑하는 실험을 통하여 원격방사선가시화 장치의 기능을 검증하였다.

  • PDF