• Title/Summary/Keyword: Node Area

Search Result 853, Processing Time 0.028 seconds

A distributed relay selection algorithm for two-hop wireless body area networks

  • Kim, Seung-Ku;Joo, Yang-Ick
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.41 no.2
    • /
    • pp.156-162
    • /
    • 2017
  • This paper investigates two-hop extension communication in wireless body area networks. Many previous studies have demonstrated that two-hop extended topology outperforms single-hop topology. Although many researchers have proposed using two-hop extension communication to improve link reliability, no one has considered using a relay selection algorithm or provided a suitable solution for wireless body area networks. The design goal of the proposed algorithm is selecting a proper relay node to retransmit failed packets distributively. The proposed algorithm configures the carrier sensing period to choose one relay node promptly without requiring additional interaction. We analyze the link conditions corresponding to various body postures and investigate which factors are proper to determine the carrier sensing period. The empirical results show that the proposed algorithm reduces the expected number of transmissions required to deliver a packet successfully.

A Study on the Determination of Contact Area of a Plate on Elastic Half-Space (탄성지반 위에 놓인 평판의 접촉영역 결정에 관한 연구)

  • 정진환;이외득;김동석
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1998.10a
    • /
    • pp.405-412
    • /
    • 1998
  • According to the relative stiffness between the half-space and plate or loading condition, some parts of the plate can be separated from the half-space. The finite element procedure to determine the contact area by considering the distribution of contact pressure between plate and the elastic half-space is developed. The vertical surface displacements of the elastic half-space can be obtained through the integrations of the Boussinesq's solution for a point load. The rectangular plate on the elastic half-space is modeled by the 8-node rectangular and 6-node triangular elements and the Mindlin plate theory is used in oder to consider the transverse shear effect. In this study, the contact area may be determined approximately by the analysis with rectangular elements. From this results, the mesh pattern is modified by using triangular and rectangular elements. The contact area can be determined by the new mesh pattern with a relatively sufficient accuracy.

  • PDF

The Parameter Identification for Localization Scheme of the Optics-Based Micro Sensor Node (광신호 기반의 마이크로 센서 노드 위치 인식 시스템을 위한 파라미터 식별)

  • Jeon, Ji-Hun;Lee, Min-Su;Park, Chan-Gook
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.19 no.2
    • /
    • pp.81-86
    • /
    • 2013
  • In this paper, the parameter identification for localization scheme for the optics-based micro sensor node is conducted. We analyzed short measurement range problem which can be occurred in optical based micro sensor node localization method using a time of flight. And we set up the theory for distance and maximum reflected laser power to overcome the problem by identifying hardware parameters like laser power, effective area of MEMS CCR, sensitivity of photodetector, and so on. Experimental results of measurement of maximum reflected laser power were compared with results of the theory. By using the theory, we can identify hardware parameters of localization scheme to measure particular position of the optics-based micro sensor node.

Application of the Hamiltonian circuit Latin square to a Parallel Routing Algorithm on Generalized Recursive Circulant Networks

  • Choi, Dongmin;Chung, Ilyong
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.9
    • /
    • pp.1083-1090
    • /
    • 2015
  • A generalized recursive circulant network(GR) is widely used in the design and implementation of local area networks and parallel processing architectures. In this paper, we investigate the routing of a message on this network, that is a key to the performance of this network. We would like to transmit maximum number of packets from a source node to a destination node simultaneously along paths on this network, where the ith packet traverses along the ith path. In order for all packets to arrive at the destination node securely, the ith path must be node-disjoint from all other paths. For construction of these paths, employing the Hamiltonian Circuit Latin Square(HCLS), a special class of (n x n) matrices, we present O(n2) parallel routing algorithm on generalized recursive circulant networks.

A Study on Security Attribute Design in Security Plan of The Design Phase (설계단계의 보안 방안에서 보안 속성 설계에 대한 연구)

  • Shin, Seong-Yoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.5
    • /
    • pp.1125-1130
    • /
    • 2015
  • In this paper, a method to identify components per unit task system is expressed with node, module, and interface. We define security subject per unit task system and explain node, module, and interface per component. According to the defined security standard in design phase, we also perform to design and elaborate security attributes for node and module as identified security subjects in their defined tables. And then we describe the composition standard for security attribute design with some examples, after classifying it into security subject, access subject, access control area, identification or verification area, and encryption.

Neighbor Cooperation Based In-Network Caching for Content-Centric Networking

  • Luo, Xi;An, Ying
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.5
    • /
    • pp.2398-2415
    • /
    • 2017
  • Content-Centric Networking (CCN) is a new Internet architecture with routing and caching centered on contents. Through its receiver-driven and connectionless communication model, CCN natively supports the seamless mobility of nodes and scalable content acquisition. In-network caching is one of the core technologies in CCN, and the research of efficient caching scheme becomes increasingly attractive. To address the problem of unbalanced cache load distribution in some existing caching strategies, this paper presents a neighbor cooperation based in-network caching scheme. In this scheme, the node with the highest betweenness centrality in the content delivery path is selected as the central caching node and the area of its ego network is selected as the caching area. When the caching node has no sufficient resource, part of its cached contents will be picked out and transferred to the appropriate neighbor by comprehensively considering the factors, such as available node cache, cache replacement rate and link stability between nodes. Simulation results show that our scheme can effectively enhance the utilization of cache resources and improve cache hit rate and average access cost.

A CPLD Low Power Algorithm considering the Structure (구조를 고려한 CPLD 저전력 알고리즘)

  • Kim, Jae Jin
    • 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.

Prophylactic extended-field irradiation with concurrent chemotherapy for pelvic lymph node-positive cervical cancer

  • Oh, Jinju;Seol, Ki Ho;Lee, Hyun Joo;Choi, Youn Seok;Park, Ji Y.;Bae, Jin Young
    • Radiation Oncology Journal
    • /
    • v.35 no.4
    • /
    • pp.349-358
    • /
    • 2017
  • Purpose: This study aimed to evaluate whether prophylactic extended-field pelvic radiotherapy (EF-PRT) yields better results than standard whole pelvic radiotherapy (WPRT) in patients with pelvic lymph node-positive cervical cancer treated with concurrent chemoradiotherapy (CCRT). Materials and Methods: A total of 126 cases of stage IB-IVA cervical cancer that had pelvic lymph node involvement in magnetic resonance imaging and were treated with CCRT between 2000 and 2016 were reviewed. None of the patients had para-aortic lymph node (PALN) metastases. The patients were classified to two groups, namely, those treated with EF-PRT, including prophylactic para-aortic radiotherapy, and those treated only with WPRT. The median dose to the PALN area in patients treated with EF-PRT was 45 Gy. All patients received concurrent cisplatin-based chemotherapy. Results: Overall, 52 and 74 patients underwent EF-PRT and WPRT, respectively. Patient characteristics and irradiated dose were not significantly different, except the dose to the para-aortic area, between the two groups. The median follow-up period was 75.5 months (range, 5 to 195 months). The 10-year cumulative recurrence rate of PALN for EF-PRT vs. WPRT was 6.9% and 10.1% (p = 0.421), respectively. The 10-year disease-free survival and overall survival for EF-PRT vs. WPRT were 69.7% vs. 66.1% (p = 0.748) and 71.7% vs. 72.3% (p = 0.845), respectively. Acute gastrointestinal complications were significantly higher in EF-PRT (n = 21; 40.4%) than WPRT (n = 26; 35.1%) (p = 0.046). Late toxicities were not significantly different in both groups. Conclusion: In this study, prophylactic radiotherapy for PALN does not have an additional benefit in patients with pelvic lymph node-positive cervical cancer treated with CCRT.

A study of set route path avoiding traffic concentration in Mobile Ad hoc Network (MANET에서 트래픽 집중현상을 회피하는 경로설정에 관한 연구)

  • Oh, Dong-keun;Oh, Young-jun;Lee, Kang-whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.05a
    • /
    • pp.781-783
    • /
    • 2014
  • Mobile ad hoc network(MANET) consists of node that has mobility. MANET has increased overhead that caused by frequent topology changes. For reducing overhead, hierarchical network that communicates through cluster head node has been researched. When traffic is concentrated on cluster head node, cluster member node can't send message. To solve this problem, we proposed Step Parent algorithm. Proposed algorithm, cluster member node checks traffic of cluster head node using route path of other cluster head node in efficient coverage area. When cluster head node has increased traffic, cluster member node make a new route path by route path by routing path to another cluster head node. So cluster member node sends a message to destination node, we check improving delivery ratio.

  • PDF

A Node Positioning Method for Minimizing the Node Sensing Energy in Sensor Networks with Adjustable Sensing Ranges (가변감지영역을 갖는 센서네트워크에서 노드감지에너지의 최소화를 위한 노드위치방법)

  • Seong, Ki-Taek;Sung, Kil-Young;Woo, Chong-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.11
    • /
    • pp.2099-2106
    • /
    • 2006
  • In this paper, we addressed the node positioning method for minimizing the sensing energy consumption in wireless sensor networks with adjustable sensing ranges. It is necessary for minimizing the sensing energy consumption to minimize the overlapped sensing area by neighboring nodes. To find a optimal node position, we derived a optimal equations by using the overlapped areas, each node's radiuses and expended angles of opposite neighboring nodes. Based on it, we devised a new node positioning method, called as ASRC(Adjustable Sensing Ranges Control). Unlike existing condition based model, our proposed method was derived from mathematical formula, and we confirmed its validity of sensing energy consumption through simulations.