• Title/Summary/Keyword: Ns-2

Search Result 1,725, Processing Time 0.028 seconds

Dynamic Analysis for Base Isolated Structure with Shear Keys (쉬어키를 가진 면진건축물의 동적해석)

  • Han, Duck-Jeon;Kim, Tae-Ho
    • Journal of Korean Association for Spatial Structures
    • /
    • v.7 no.1 s.23
    • /
    • pp.45-53
    • /
    • 2007
  • Recently, high-rise base isolated building structures with shear keys are often constructed in Japan which frequently occurs earthquakes. High-rise buildings are less damaged because those buildings have longer natural period than md or low rise buildings. The shear key is device that prevents the base isolators operating by the wind loads not by the earthquake loads. In case of big base shear force acts on the shear keys by earthquake, this device is broken and base isolator is operated. Therefore, seismic intensities play a role in acting on the shear keys. If wind loads are hither than the earthquake loads, the shear keys designed by wind loads are not operated in earthquakes. So, the requirements of shear keys in high-rise base isolated building structures must be examined in Korea with moderate seismic legions. In this study shear keys are applied with 5 and 15 stories base isolated building structures and investigated their dynamic responses to original and 1/2 scale downed El Centre NS(1940) ground motions. The results show that the yield shear forces of the shear keys affect significantly the dynamic behavior of base isolated building structures

  • PDF

Energy-Efficient Clustering Scheme using Candidates Nodes of Cluster Head (클러스터헤더 후보노드를 이용한 에너지 효율적인 클러스터링 방법)

  • Cho, Young-Bok;Kim, Kwang-Deuk;You, Mi-Kyeong;Lee, Sang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.3
    • /
    • pp.121-129
    • /
    • 2011
  • One of the major challenges of minimum energy consumption for wireless sensor networks(WSN) environment. LEACH protocol is hierarchical routing protocol that obtains energy efficiency by using clustering. However, LEACH protocol in each round, because the new cluster configuration, cluster configuration, whenever the energy consumed shorten the life of the network. Therefore in this paper, the cluster is formed in WSN environment in early stage and the problems with energy waste have been solved by selecting C-node. In the initial round of proposed model uses 26 percent more than traditional LEACH energy consumption. However, as the round is ongoing, it has been proved by the network simulation tool that the waste of energy could be diminished up to 35%.

Performance Evaluation of an Adaptive Collision Avoidance Algorithm for IEEE 802.15.4 (IEEE 802.15.4에서 적응적 충돌 회피 알고리즘의 성능분석)

  • Noh, Ki-Chul;Lee, Seung-Yeon;Shin, Youn-Soon;Ahn, Jong-Suk;Lee, Kang-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.3A
    • /
    • pp.267-277
    • /
    • 2011
  • Like other wireless network protocols, IEEE 802.15.4 adopts CA (Collision Avoidance)algorithm to avoid the early collision of a new packet by randomizing its first transmission time rather than its immediate delivery. The traditional CA scheme of IEEE 802.15.4, however, selects the random access time from the predetermined range without considering the degree of current congestion. It probably causes either a long delay to settle in the suitable range for the current network load or frequent clashes especially during the long lasting heavy traffic period. This paper proposes an ACA(Adaptive Collision Avoidance) algorithm adapting the initial backoff range to the undergoing collision variations. It also introduces a mathematical model to predict the performance of ACA algorithm added to IEEE 802.15.4. With only small deviations from corresponding simulations, our analytical model shows that ACA technique can improve the throughput of IEEE 802.15.4 by up-to 41% maximally in addition to shortening the packet delays.

Filter-Based Collision Resolution Mechanism of IEEE 802.11 DCF in Noisy Environments (잡음 환경을 고려한 IEEE 802.11 DCF의 필터기반 Collision Resolution 메카니즘)

  • Yoo, Sang-Shin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9A
    • /
    • pp.905-915
    • /
    • 2007
  • This paper proposes a filter-based algorithm to adaptively adjust the contention window in IEEE 802.11 DCF. The proposed mechanism is focused on the general and realistic environments that have various conditions regarding to noise, media types and network load. For this flexible adaptation, Filter-based DCF(FDCF) takes a more realistic policy such as median filter concept in the image processing technologies. We can handle these various environments by adjusting the contention window size according to the result of filtering based on history-buffer. We can ignore temporarily and randomly occurred transmission failures due to noise errors and collisions in noisy environments. In addition, by changing the reference number and history-buffer size, FDCF can be extended as a general solution including previous proposed mechanism. We have confirmed that the proposed mechanism can achieve the better performance than those of previous researches in aspects of the throughput and the delay in the realistic environments.

Group Node Contention Algorithm for Avoiding Continuous Collisions in LR-WPAN (무선 저속 PAN에서 연속된 충돌 회피를 위한 그룹 노드 경쟁 알고리즘)

  • Lee, Ju-Hyun;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12B
    • /
    • pp.1066-1074
    • /
    • 2008
  • In this paper, we proposed an efficient algorithm using pulse signal based on group-node-contention in LR-WPAN. The purpose of IEEE 802.15.4 is low speed, low cost and low power consumption. Recently, as applications of LR-WPAN have been extended, there is a strong probability of collision as well and almost collision occurs because of hidden node problem. Moreover, if the collision continuously occurs due to hidden node collision, network performance could be decreased. Nowadays, although several papers focus on the hidden node collision, algorithms waste the channel resource if continuous collisions frequently occur. In this paper, we assume that PAN has been already formed groups, and by using pulse signal, coordinator allocates channel and orders, and then, nodes in the allocated group can compete each other. Hence, contention nodes are reduced significantly, channel wastage caused by collision is decreased, and data transmission rate is improving. Finally, this algorithm can protect the network from disruption caused by frequent collisions. Simulation shows that this algorithm can improve the performance.

Extension of E-LSP for Supporting Differentiated Service in MPLS (MPLS에서 차등화 서비스를 지원하기 위한 E-LSP의 확장)

  • 박기범;정재일
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.12B
    • /
    • pp.1081-1090
    • /
    • 2003
  • NGI(Next Generation Internet) is characterized by QoS(Quality of Service) and high speed transmission. Recently, DiffServ and MPLS become most influential NGI architecture. To guarantee end-to-end QoS, it is essential for NGI to interwork MPLS with DiffServ. Here, MPLS WG(Working Group) in IETF(Internet Engineering Task Force) proposed the method of E-LSP(EXP inferred-PSC LSPs) and L-LSP(Label-Only-Inferred PSC LSPs), but both of them have serious problems to satisfy perfect interworking. In this paper, we proposed an extended E-LSP architecture that supports Perfect DiffServ class and experimental function in MPLS such as ECN(Explicit Congestion Notification) capability. We verify that the proposed E-LSP architecture improves QoS in NGI by using ns2 simulator.

Reclamation of Furan Sand and Its Effect on the Cast (후란 주물사의 재생 및 그의 주물에 미치는 영향)

  • 백고길;최양진;황교현
    • Resources Recycling
    • /
    • v.5 no.1
    • /
    • pp.21-28
    • /
    • 1996
  • Burmng method tn Bnidi-ied beds 101 the effectlvr reclamation of Sunn fi,uadry sand war u~ed lather tl~an rncchan1c;ll or p~~cumatiace thodq. which are co~nmonlyu scd in foundry factoricr in Kojcu In olrlcr to rcrnuvc hlc;~ns and ha~doersi ~nm foundry sand sndaces in the fluidized bcd, the lnnsl sffccuve lcmpemture mge was h00-70W. Sulbcr slab~l~liyn dca and comliresslvc streugtli oL rccla~mcd sand recyclcd by the burning luctllod wcre lalgcr dao those of rcclalmcd a n d by lllc pncumatlc mctllod. Tile energy cost IOIt he bummy mctliod was cstimalcd al SlZ0011'on oi llie iccl;~~rncds md. The coql l~ductlon in pul.chasing nzw s;od as well as the prevenllon or cnv~conmcnl.il contamlnallnn could hc hmefitcrl hy usl~lg Ihc rec1;~rnnl~oonf liisndry siod ~ecycledb y the method rleieloped in thls sludy

  • PDF

Evaluation of Turbidity Removal Efficiency on under Flow Water by Pore Controllable Fiber Filtration (공극제어형 섬유사 여과기를 이용한 복류수의 탁도 제거효율 평가)

  • Kim, Jeong-Hyun;Bae, Chul-Ho;Kim, Chung-Hwan;Park, No-Suk;Lee, Sun-Ju;Anh, Hyo-Won;Huh, Hyun-Chul
    • Journal of Korean Society of Water and Wastewater
    • /
    • v.19 no.2
    • /
    • pp.135-143
    • /
    • 2005
  • It was evaluated that the effect of turbidity removal by Pore Controllable Fiber Filter(PCF) installed in NS(Naksang) small water treatmant plant(system) using under flow water as raw water in the study. The results of the study are as the followings. Firstly, the removal efficiency of turbidity by PCF without coagulation(in operation mode not using coagulants) was mostly below 20 percent. On the other hand, when operation using proper coagulants, that of turbidity was mostly over 80 percent. Secondly, slow sand filtration after PCF, total turbidity removal efficiency of final treated water was 84.3 percent, and the contribution by PCF was 57.1 percent and that of slow sand filtration was 27.7 percent. Therefore the introduction of PCF as pre-treatment process would be helpful to reduce the loading of high turbidity of slow sand filtration. Thirdly, the results of particle counter measurements showed that when operated PCF with coagulants, fine flocs captured or adsorbed at the pore of PCF were flow out into the effluents from 120 minutes after backwashing because of the increase of headloss of PCF. Therefore the decision of backwashing time should made consideration into the outflow of fine flocs from PCF. Fourth, coagulant dosages on PCF at the same turbidity was largely variable because of the effect of the raw water characteristics and the turbidity increase velocity at rainy days, therefore flexible coagulant dosages should be considered rather than fixed coagulant dosage by the influent jar-test result.

Neighbor-Based Probabilistic Rebroadcast Routing Protocol for Reducing Routing Overhead in Mobile Ad Hoc Networks

  • Harum, Norharyati;Hamid, Erman;Bahaman, Nazrulazhar;Ariff, Nor Azman Mat;Mas'ud, Mohd Zaki
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.12
    • /
    • pp.1-8
    • /
    • 2021
  • In Mobile Ad-Hoc Network (MANET) Application, routing protocol is essential to ensure successful data transmission to all nodes. Ad-hoc On-demand Distance Vector (AODV) Protocol is a reactive routing protocol that is mostly used in MANET applications. However, the protocol causes Route Request (RREQ) message flooding issue due to the broadcasting method at the route request stage to find a path to a particular destination, where the RREQ will be rebroadcast if no Request Response (RREP) message is received. A scalable neighbor-based routing (SNBR) protocol was then proposed to overcome the issue. In the SNBR protocol, the RREQ message is only rebroadcast if the number of neighbor nodes less than a certain fix number, known as drop factor. However, since a network always have a dynamic characteristic with a dynamic number of neighbor nodes, the fix drop factor in SNBR protocol could not provide an optimal flooding problem solution in a low dense network environment, where the RREQ message is continuously rebroadcast RREQ message until reach the fix drop factor. To overcome this problem, a new broadcasting method as Dynamic SNBR (DSNBR) is proposed, where the drop factor is determined based on current number of neighbor nodes. This method rebroadcast the extra RREQ messages based on the determined dynamic drop factor. The performance of the proposed DSNBR is evaluated using NS2 and compared with the performance of the existing protocol; AODV and SNBR. Simulation results show that the new routing protocol reduces the routing request overhead, energy consumption, MAC Collision and enhances end-to-end delay, network coverage ratio as a result of reducing the extra route request messages.

Cryo-Compression Therapy After Elective Spinal Surgery for Pain Management: A Cross-Sectional Study With Historical Control

  • Nabiyev, Vugar Nabi;Ayhan, Selim;Adhikari, Prashant;Cetin, Engin;Palaoglu, Selcuk;Acaroglu, R. Emre
    • Neurospine
    • /
    • v.15 no.4
    • /
    • pp.348-352
    • /
    • 2018
  • Objective: Postoperative dynamic cryo-compression (DC) therapy has been proposed as a method of reducing pain and the inflammatory response in the early postoperative period after orthopedic joint reconstruction surgery. Our aim was to analyze the analgesic efficacy of DC therapy after adult lumbar spinal surgery. Methods: DC was applied for 30 minutes every 6 hours after surgery. Pain was measured by a visual analogue scale (VAS) in the preoperative period, immediately after surgery, and every 6 hours postoperatively for the first 72 hours of the hospital stay. Patients' pain medication requirements were monitored using the patient-controlled analgesia system and patient charts. Twenty patients who received DC therapy were compared to 20 historical controls who were matched for demographic and surgical variables. Results: In the postanesthesia care unit, the mean VAS back pain score was $5.87{\pm}0.9$ in the DC group and $6.95{\pm}1.0$ (p=0.001) in the control group. The corresponding mean VAS scores for the DC vs. control groups were $3.8{\pm}1.1$ vs. $5.4{\pm}0.7$ (p < 0.001) at 6 hours postoperatively, and $2.7{\pm}0.7$ vs. $6.25{\pm}0.9$ (p<0.001) at discharge, respectively. The cumulative mean analgesic consumption of paracetamol, tenoxicam, and tramadol in the DC group vs. control group was $3,733.3{\pm}562.7mg$ vs. $4,633.3{\pm}693.5mg$ (p<0.005), $53.3{\pm}19.5mg$ vs. $85.3{\pm}33.4mg$ (p<0.005), and $63.3{\pm}83.4mg$ vs. $393.3{\pm}79.9mg$ (p<0.0001), respectively. Conclusion: The results of this study demonstrated a positive association between the use of DC therapy and accelerated improvement in patients during early rehabilitation after adult spine surgery compared to patients who were treated with painkillers only.