• Title/Summary/Keyword: Multiple node

Search Result 790, Processing Time 0.024 seconds

Rhabdomyosarcoma of the tongue base, its recurrence, and multiple lymph node metastases with imaging evidence

  • Kim, Young-Ho;Choi, Bo-Ram;Huh, Kyung-Hoe;Yi, Won-Jin;Lee, Sam-Sun
    • Imaging Science in Dentistry
    • /
    • v.38 no.4
    • /
    • pp.225-228
    • /
    • 2008
  • Rhabdomyosarcoma (RMS) is an aggressive and fast-growing malignant tumor. RMS predominantly arises in the head and neck of infancy and children. Metastasis is usually via the blood vessel. We report a case of a recurred RMS of the tongue base with the metastasis to multiple lymph nodes in a 37-year-old female. On the follow-up examination using advanced imaging modalities after surgical treatment of RMS, the lymph nodes should be carefully evaluated like in other malignancies, such as a carcinoma, showing frequent lymph node metastasis. (Korean J Oral Maxillofac Radiol 2008; 38 : 225-8)

  • PDF

Source-based Multiple Gateway Selection Routing Frotocol in Ad-hoc Networks (애드 흑 네트워크에서 소스 기반 다중 게이트웨이 선출 라우팅 프로토콜)

  • Lee Byung-Jin;Yoo Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.8A
    • /
    • pp.679-687
    • /
    • 2005
  • A mobile ad-hoc network (MANET) is one consisting of a set of mobile hosts capable of communicating with each other without the assistance of base stations. It is necessary to use bandwidth effectively because MANET has limited bandwidth. In this paper, we propose SMGS (source based multiple gateway selection routing protocol). In SMGS, each node estimates its expected life time (ELT) and if its ELT is larger than that of current gateway it becomes a candidate node. When a source node establishes a path, in each grid the candidate node will take the route request and be a gateway node for the each source node. The node that is expected to stay the longest time in the grid is selected so that we can reduce frequent gateway handoff, packet loss, and handoff delay.

P2P Streaming Media Node Selection Strategy Based on Greedy Algorithm

  • Gui, Yiqi;Ju, Shuangshuang;Choi, Hwangkyu
    • Journal of IKEEE
    • /
    • v.22 no.3
    • /
    • pp.570-577
    • /
    • 2018
  • With the increasing number of network nodes, traditional client/server node selection mechanisms are under tremendous pressure. In order to select efficient cooperative nodes in a highly dynamic P2P network topology, this article uses greedy algorithm to translate the overall optimization into multiple local optimal problems, and to quickly select service nodes. Therefore, the service node with the largest comprehensive capacity is selected to reduce the transmission delay and improve the throughput of the service node. The final simulation results show that the node selection strategy based on greedy algorithm can effectively improve the overall performance of P2P streaming media system.

A MPLS Group Restoration using an Aggregation Tree (집성 트리를 이용한 MPLS 그룹 복구)

  • Lee, Kil-Hung
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.3
    • /
    • pp.358-364
    • /
    • 2007
  • This paper suggests MPLS restoration method that use an aggregation tree. For the restoration of the MPLS network, this paper presents a scheme that reconstruct multiple path through aggregation tree that grow from many node to a target node. Contrary to a multicast tree where a message that send at one node is passed to a group of node, an aggregation tree is a tree that data is passed from many node to one destination node. Through an experiment we confirmed that the restoration scheme that uses aggregation tree shows taster speed comparing with the existing other restoration scheme.

  • PDF

Design of Inner Section Displacement Measurement System Using Multiple Node Networks (다중 노드 네트워크를 이용한 내공변위 계측 시스템)

  • 서석훈;우광준
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.15 no.6
    • /
    • pp.20-26
    • /
    • 2001
  • In this paper, we design tunnel inner section displacement measurement system which is composed of potentiometer-type displacement sensors, microcontroller-based intelligent sensing head and host computer for the management system and acquisition data. Multiple node communication bus connects the intelligent sensing heads with the host computer. For safe and re1iab1e network operation we use daisy-chain configuration, termination resistor, fail-safe biasing circuit. For tole enhancement of system utilization, we use modbus protocol. The acquisition data are transmitted to host computer and managed by database. Several data request conditions and sorting conditions are provided by management software. The utilization of designed system is confirmed by experiment.

  • PDF

Analysis of Energy Consumption and Sleeping Protocols in PHY-MAC for UWB Networks

  • Khan, M.A.;Parvez, A.Al;Hoque, M.E.;An, Xizhi;Kwak, Kyung-Sup
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.12B
    • /
    • pp.1028-1036
    • /
    • 2006
  • Energy conservation is an important issue in wireless networks, especially for self-organized, low power, low data-rate impulse-radio ultra-wideband (IR-UWB) networks, where every node is a battery-driven device. To conserve energy, it is necessary to turn node into sleep state when no data exist. This paper addresses the energy consumption analysis of Direct-Sequence (DS) versus Time-Hopping (TH) multiple accesses and two kinds of sleeping protocols (slotted and unslotted) in PHY-MAC for Un networks. We introduce an analytical model for energy consumption or a node in both TH and DS multiple accesses and evaluate the energy consumption comparison between them and also the performance of the proposed sleeping protocols. Simulation results show that the energy consumption per packet of DS case is less than TH case and for slotted sleeping is less than that of unslotted one for bursty load case, but with respect to the load access delay unslotted one consumes less energy, that maximize node lifetime.

Optimizations for Mobile MIMO Relay Molecular Communication via Diffusion with Network Coding

  • Cheng, Zhen;Sun, Jie;Yan, Jun;Tu, Yuchun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.4
    • /
    • pp.1373-1391
    • /
    • 2022
  • We investigate mobile multiple-input multiple-output (MIMO) molecular communication via diffusion (MCvD) system which is consisted of two source nodes, two destination nodes and one relay node in the mobile three-dimensional channel. First, the combinations of decode-and-forward (DF) relaying protocol and network coding (NC) scheme are implemented at relay node. The adaptive thresholds at relay node and destination nodes can be obtained by maximum a posteriori (MAP) probability detection method. Then the mathematical expressions of the average bit error probability (BEP) of this mobile MIMO MCvD system based on DF and NC scheme are derived. Furthermore, in order to minimize the average BEP, we establish the optimization problem with optimization variables which include the ratio of the number of emitted molecules at two source nodes and the initial position of relay node. We put forward an iterative scheme based on block coordinate descent algorithm which can be used to solve the optimization problem and get optimal values of the optimization variables simultaneously. Finally, the numerical results reveal that the proposed iterative method has good convergence behavior. The average BEP performance of this system can be improved by performing the joint optimizations.

Adaptive Power Control based Efficient Localization Technique in Mobile Wireless Sensor Networks (모바일 무선 센서 네트워크에서 적응적 파워 조절 기반 효율적인 위치인식 기법)

  • Lee, Joa-Hyoung;Jung, In-Bum
    • The KIPS Transactions:PartC
    • /
    • v.16C no.6
    • /
    • pp.737-746
    • /
    • 2009
  • Given the increased interest in ubiquitous computing, wireless sensor network has been researched widely. The localization service which provides the location information of mobile user, is one of important service provided by sensor network. Many methods to obtain the location information of mobile user have been proposed. However, these methods were developed for only one mobile user so that it is hard to extend for multiple mobile users. If multiple mobile users start the localization process concurrently, there could be interference of beacon or ultrasound that each mobile user transmits. In the paper, we propose APL(Adaptive Power Control based Resource Allocation Technique for Efficient Localization Technique), the localization technique for multiple mobile nodes based on adaptive power control in mobile wireless sensor networks. In APL, collision of localization between sensor nodes is prevented by forcing the mobile node to get the permission of localization from anchor nodes. For this, we use RTS(Ready To Send) packet type for localization initiation by mobile node and CTS(Clear To Send) packet type for localization grant by anchor node. NTS(Not To Send) packet type is used to reject localization by anchor node for interference avoidance and STS(Start To Send) for synchronization between 모anchor nodes. At last, the power level of sensor node is controled adaptively to minimize the affected area. The experimental result shows that the number of interference between nodes are increased in proportion to the number of mobile nodes and APL provides efficient localization.

Multiple Identities Node Detection in Zigbee Home Network (지그비 홈 네트워크에서의 다중신원(Multiple Identities)노드 탐지)

  • Lee Kyu-Ho;Lim Jae-Sung;Kim Dong-Kyoo;Jeon Sang-Kyoo;Yang Sung-Hyun
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 2006.06a
    • /
    • pp.423-426
    • /
    • 2006
  • 홈서비스를 위한 지그비 센서 네트워크는 특정 대상이나 환경으로부터 데이터를 수집하여 그 데이터를 정보 분석이나 서비스 결정 수단으로 이용하기 때문에 데이터수집 과정에서의 효과적인 보안이 요구되어 진다. 지그비 센서 네트워크에의 공격은 정상적인 홈서비스를 방해하여 사용자의 불편을 초래할 수 있다. 이 중 다중신원을 가지는 공격자 노드의 침입은 비정상적인 정보 수집을 초래하여 서비스에서의 잘못된 결정을 유발할 수 있다. 이 다중신원노드의 탐지를 위해 본 논문에서는 DMIN(Detection of Multiple ID Node)이란 기법을 제안한다. 이 기법은 일처리 능력이 제한되어 있는 하나의 센서노드가 여러 신원의 역할을 수행할 때에 생기는 지연시간을 이용하며 이 기법을 이용하여 네트워크의 다중신원노드를 탐지한다.

  • PDF

Compressed Sensing-based Multiple-target Tracking Algorithm for Ad Hoc Camera Sensor Networks

  • Lu, Xu;Cheng, Lianglun;Liu, Jun;Chen, Rongjun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.3
    • /
    • pp.1287-1300
    • /
    • 2018
  • Target-tracking algorithm based on ad hoc camera sensor networks (ACSNs) utilizes the distributed observation capability of nodes to achieve accurate target tracking. A compressed sensing-based multiple-target tracking algorithm (CSMTTA) for ACSNs is proposed in this work based on the study of camera node observation projection model and compressed sensing model. The proposed algorithm includes reconfiguration of observed signals and evaluation of target locations. It reconfigures observed signals by solving the convex optimization of L1-norm least and forecasts node group to evaluate a target location by the motion features of the target. Simulation results show that CSMTTA can recover the subtracted observation information accurately under the condition of sparse sampling to a high target-tracking accuracy and accomplish the distributed tracking task of multiple mobile targets.