• Title/Summary/Keyword: Critical Node

Search Result 284, Processing Time 0.028 seconds

Improvement of OLSR Through MIMC's Decreased Overhead in MANET (모바일 애드 혹 네트워크 환경 하에서 멀티인터페이스 멀티채널의 오버헤드 감소를 통한 OLSR의 성능 개선)

  • Jang, Jae-young;Kim, Jung-ho
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.3
    • /
    • pp.55-70
    • /
    • 2016
  • The most critical research issue in MANET environment is on supporting reliable communication between various devices. Various Multi-Hop Routing Protocol studies have proceeded. However, some problems you might have found when you use the existing link state routing technique are that it increases Control Message Overhead and it is unstable when node moves in CR circumstance which has transformation of using channel and MIMC circumstance which uses a number of interfaces. This essay offers a technique which is based on On-Demand Hello and the other technique which used Broadcast Interface of optimization as a solution to decrease Control Message Overhead. Also it proposes Quick Route Restoration technique which is utilized by GPS and MPR Selection technique which consider mobility as a solution of stable communication when node moves. Those offered Routing Protocol and OPNET based simulator result will be expected to be an excellent comparison in related research fields.

Efficient Flash Memory Access Power Reduction Techniques for IoT-Driven Rare-Event Logging Application (IoT 기반 간헐적 이벤트 로깅 응용에 최적화된 효율적 플래시 메모리 전력 소모 감소기법)

  • Kwon, Jisu;Cho, Jeonghun;Park, Daejin
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.14 no.2
    • /
    • pp.87-96
    • /
    • 2019
  • Low power issue is one of the most critical problems in the Internet of Things (IoT), which are powered by battery. To solve this problem, various approaches have been presented so far. In this paper, we propose a method to reduce the power consumption by reducing the numbers of accesses into the flash memory consuming a large amount of power for on-chip software execution. Our approach is based on using cooperative logging structure to distribute the sampling overhead in single sensor node to adjacent nodes in case of rare-event applications. The proposed algorithm to identify event occurrence is newly introduced with negative feedback method by observing difference between past data and recent data coming from the sensor. When an event with need of flash access is determined, the proposed approach only allows access to write the sampled data in flash memory. The proposed event detection algorithm (EDA) result in 30% reduction of power consumption compared to the conventional flash write scheme for all cases of event. The sampled data from the sensor is first traced into the random access memory (RAM), and write access to the flash memory is delayed until the page buffer of the on-chip flash memory controller in the micro controller unit (MCU) is full of the numbers of the traced data, thereby reducing the frequency of accessing flash memory. This technique additionally reduces power consumption by 40% compared to flash-write all data. By sharing the sampling information via LoRa channel, the overhead in sampling data is distributed, to reduce the sampling load on each node, so that the 66% reduction of total power consumption is achieved in several IoT edge nodes by removing the sampling operation of duplicated data.

A Group Key based Authentication Protocol Providing Fast Handoff in IEEE 802.11 (IEEE 802.11 환경에서 빠른 핸드오프를 제공하는 그룹키 기반의 인증 프로토콜)

  • Lee, Chang-Yong;Kim, Sang-Jin;Oh, Hee-Kuck;Park, Choon-Sik
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.5
    • /
    • pp.103-113
    • /
    • 2008
  • Reducing handoff latency is essential in providing seamless multimedia service in Wireless LAN based on the IEEE 802.11 standard. Reducing authentication delay is critical in reducing handoff latency. To this end, several authentication protocols for fBst handoff have been proposed. Mishra et al. used proactive key distribution to improve the authentication delay incurred in the current standard and Park et al. proposed a new authentication protocol based on Blom's key pre-distribution scheme. In this paper, we propose an enhanced authentication protocol based on Bresson et al.'s group key protocol. If a mobile node has previously access the network, our proposed protocol only requires simple hash operations in providing mutual authentication between a mobile node and access points. Our protocol is more efficient than Park et al.'s and Mishra et al.'s technique can be used in our protocol to further enhance our protocol.

Analyses of Security into End-to-End Point Healthcare System based on Internet of Things (사물인터넷 기반의 헬스케어 시스템의 종단간 보안성 분석)

  • Kim, Jung Tae
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.7 no.6
    • /
    • pp.871-880
    • /
    • 2017
  • Recently, service based on internet is inter-connected and integrated with a variety of connection. This kind of internet of things consist of heterogenous devices such as sensor node, devices and end-to end equipment which used in conventional protocols and services. The representative system is healthcare system. From healthcare appliance used by IoT, patient and doctor can utilize healthcare information with safety and high speed management. It is very convenient management to operate mobility. But it induced security and vulnerability issues because it has small memory capacity, low power supply and low computing power. This made impossible to implement security algorithm with embedded engine based on hardware. Nowdays, we can't realize conventional standard algorithm due to these kinds of reasons. From the critical issues, it occurred security and vulnerability issues. Therefore, we analysed and compared with conventional method and proposed techniques. Finally, we evaluated security issues and requirement for end-to-end point healthcare system based on internet of things.

Regrowth Patterns of the Perennial Weeds Treated with Sulfonylureas and Starch Degradation in the Rhizome (Sulfonylurea계 제초제가 처리된 다년생 잡초의 재생양상과 저장전분량의 변화)

  • Hwang, I.T.;Lee, K.H.;Hong, K.S.;Kim, J.S.;Lee, B.H.;Cho, K.Y.
    • The Korean Journal of Pesticide Science
    • /
    • v.6 no.1
    • /
    • pp.36-41
    • /
    • 2002
  • Characteristics of regrowth and starch degradation in perennial weed rhizomes were investigated in a greenhouse. Cyperus serotinus started regrowth at 24 days after treatment of 1.25 g ai/ha of pyrazosulfuron-ethyl. The regrowth of Sagittaria trifolia, Eleocharis kuroguwai, and S. pygmaea required $30{\sim}39$ days, and Potamogeton distinctus regrew at 55 days after treatment of 1.25 g ai/ha of pyrazosulfuron-ethyl. However, all of 5 perennial weeds hardly regrew until 45 days after treatment more than 5 g ai/ha of pyrazosulfuron-ethyl. Regrowth of C. serotinus 4-node rhizomes was 2 times higher than 2-node rhizomes, and $1{\sim}1.5g$ of E. kuroguwai large tubers regrew faster than $0.3{\sim}0.5g$ of small tubers treated with bensulfuron-methyl. Regrowth of C. serotinus was enhanced with delayed application of bensulfuron-methyl, however, 2-leaf stage of E. kuroguwai plants regrew better than 3 leaf stage of plants when treated with equal volume of bensulfuron-methyl. The critical periods of S. trifolia and E. kuroguwai growth depending upon the rhizome detachment were 12 and 18 days after sprouting, respectively. The starch stacked in the S. trifolia and E. kuroguwai tubers were exhausted at 18 and 27 days after sprouting, respectively. The highest level of sugar contents was showed at 9 days after sprouting in S. trifolia, and 18 days after sprouting in E. kuroguwai.

Finding the First K Shortest Loopless Paths in a Transportation Network (교통망에 적합한 K 비루프 경로 탐색 알고리즘)

  • Shin, Seong-Il
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.6
    • /
    • pp.121-131
    • /
    • 2004
  • The K-shortest path algorithms are largely classified into two groups: oneis for finding loopless path (simple path), another loop paths. In terms of cimputational complexities, in general the loop-paths-finding ones are considered more efficient and easier to be handled than the loopless-paths-finding. The entire path deletion methods have been known as the best efficient algorithms among the proposed K-shortest path algorithms. These algorithms exploit the K-th network transformation to prevent the same path, which was already selected as the (K-1)th path, from being redetected. Nevertheless, these algorithms have a critical limitationto be applied in the practical traffic networks because the loops, in which the same modes and links can be unlimitedly repeated, are not preventable. This research develops a way to be able to selectively control loop-paths by applying link-label. This research takes an advantage of the link-based shortest path algorithms that since the algorithms can take care of two links simultaneouslyin the searching process, the generation of loops can be controlled in the concatenation process of the searched link and the preceded link. In concatenation of two links, since the precede link can be treated a sub-shortest to this link from the origination, whether both the node and the link of the searched link were already existed or not can be evaluated. Terefore, both the node-loopless path, in which the same node is not appeared, and the link-loopless, in which the same link is not appeared, can be separately controlled. Especially, the concept of the link-loopless path is expended to take into consideration reasonable route choice behaviors such as U-Turn, P-Turn, and Turn-Penalty, which are frequently witnessed in urban traffic network with intersections. The applicability of the proposed method is verified through case studies.

Using Bayesian network and Intuitionistic fuzzy Analytic Hierarchy Process to assess the risk of water inrush from fault in subsea tunnel

  • Song, Qian;Xue, Yiguo;Li, Guangkun;Su, Maoxin;Qiu, Daohong;Kong, Fanmeng;Zhou, Binghua
    • Geomechanics and Engineering
    • /
    • v.27 no.6
    • /
    • pp.605-614
    • /
    • 2021
  • Water inrush from fault is one of the most severe hazards during tunnel excavation. However, the traditional evaluation methods are deficient in both quantitative evaluation and uncertainty handling. In this paper, a comprehensive methodology method combined intuitionistic fuzzy AHP with a Bayesian network for the risk assessment of water inrush from fault in the subsea tunnel was proposed. Through the intuitionistic fuzzy analytic hierarchy process to replace the traditional expert scoring method to determine the prior probability of the node in the Bayesian network. After the field data is normalized, it is classified according to the data range. Then, using obtained results into the Bayesian network, conduct a risk assessment with field data which have processed of water inrush disaster on the tunnel. Simultaneously, a sensitivity analysis technique was utilized to investigate each factor's contribution rate to determine the most critical factor affecting tunnel water inrush risk. Taking Qingdao Kiaochow Bay Tunnel as an example, by predictive analysis of fifteen fault zones, thirteen of them are consistent with the actual situation which shows that the IFAHP-Bayesian Network method is feasible and applicable. Through sensitivity analysis, it is shown that the Fissure development and Apparent resistivity are more critical comparing than other factor especially the Permeability coefficient and Fault dip. The method can provide planners and engineers with adequate decision-making support, which is vital to prevent and control tunnel water inrush.

Seismic Response on Thin Shell as Structural Foundation (기초구조물로서 얇은 쉘 구조물의 지진응답)

  • Yee Hooi Min;Azizah Abdul Nassir;Kim Jae Yeol
    • Journal of Korean Association for Spatial Structures
    • /
    • v.24 no.2
    • /
    • pp.31-41
    • /
    • 2024
  • This study aims to investigate the seismic response of a large span thin shell structures and assess their displacement under seismic loads. The study employs finite element analysis to model a thin shell structure subjected to seismic excitation. The analysis includes eigenvalue analysis and time history analysis to evaluate the natural frequencies and displacement response of the structure under seismic loads. The findings show that the seismic response of the large span thin shell structure is highly dependent on the frequency content of the seismic excitation. The eigenvalue analysis reveals that the tenth mode of vibration of the structure corresponds to a large-span mode. The time history analysis further demonstrates, with 5% damping, that the displacement response of the structure at the critical node number 4920 increases with increasing seismic intensity, reaching a maximum displacement of 49.87mm at 3.615 seconds. Nevertheless, the maximum displacement is well below the allowable limit of the thin shell. The results of this study provide insight into the behaviour of complex large span thin shell structures as elevated foundations for buildings under seismic excitation, based on the displacement contours on different modes of eigenvalues. The findings suggest that the displacement response of the structure is significant for this new application of thin shell, and it is recommended to enhance the critical displacement area in the next design phase to align with the findings of this study to resist the seismic impact.

An EIBS Algorithm for Wireless Sensor Network with Life Time Prolongation (수명 연장 기능의 무선 센서 네트워크용 EIBS 알고리즘)

  • Bae, Shi-Kyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.9
    • /
    • pp.65-73
    • /
    • 2014
  • Since Time synchronization is also critical in Wireless Sensor Networks (WSN) like other networks, a time synchronization protocol for WSN called IBS(Indirect-Broadcast Synchronization) has been already proposed in 2012. As IBS operates in cluster tree topology, network lifetime may be mainly shortened by cluster head node[s], which usually consumes more power than cluster member (i.e. non-cluster head) nodes. In this paper, I propose enhanced version of IBS (called EIBS) which saves overall energy and prolongs network lifetime by re-constructing partial cluster tree locally. Compared with other tree construction approaches, this tree reconstruction algorithm is not only simpler, but also more efficient in the light of overall power consumption and network lifetime.

An Advanced Embedded SRAM Cell with Expanded Read/Write Stability and Leakage Reduction

  • Chung, Yeon-Bae
    • Journal of IKEEE
    • /
    • v.16 no.3
    • /
    • pp.265-273
    • /
    • 2012
  • Data stability and leakage power dissipation have become a critical issue in scaled SRAM design. In this paper, an advanced 8T SRAM cell improving the read and write stability of data storage elements as well as reducing the leakage current in the idle mode is presented. During the read operation, the bit-cell keeps the noise-vulnerable data 'low' node voltage close to the ground level, and thus producing near-ideal voltage transfer characteristics essential for robust read functionality. In the write operation, a negative bias on the cell facilitates to change the contents of the bit. Unlike the conventional 6T cell, there is no conflicting read and write requirement on sizing the transistors. In the standby mode, the built-in stacked device in the 8T cell reduces the leakage current significantly. The 8T SRAM cell implemented in a 130 nm CMOS technology demonstrates almost 100 % higher read stability while bearing 20 % better write-ability at 1.2 V typical condition, and a reduction by 45 % in leakage power consumption compared to the standard 6T cell. The stability enhancement and leakage power reduction provided with the proposed bit-cell are confirmed under process, voltage and temperature variations.