• Title/Summary/Keyword: End-to-End Delay

Search Result 762, Processing Time 0.032 seconds

A Range-based Relay Node Selecting Algorithm for Vehicular Ad-hoc Network (차량 애드혹 네트워크를 위한 영역 기반 릴레이 노드 선택 알고리즘)

  • Kim Tae-Hwan;Kim Hie-Cheol;Hong Won-Kee
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.9 s.351
    • /
    • pp.88-98
    • /
    • 2006
  • VANET has several different characteristics from MANET such as high mobility of nodes and frequent change of node density and network topology. Due to these characteristics, the network topology based protocol, often used in MANET, can not be applied to VANET. In this paper, we propose an emergency warning message broadcast protocol using range based relay node selecting algorithm which determines the minimal waiting time spent by a given node before rebroadcasting the received warning message. Because the time is randomly calculated based on the distance between sender node and receiver node, a node chosen as a relay node is assured to have a minimal waiting time, even though it is not located at the border of radio transmission range. The proposed emergency warning message broadcast protocol has low network traffic because it does not need to exchange control messages for message broadcasting. In addition, it can reduce End-to-End delay under circumstances of low node density and short transmission range in VANET.

Modeling of RC shear walls strengthened by FRP composites

  • Sakr, Mohammed A.;El-khoriby, Saher R.;Khalifa, Tarek M.;Nagib, Mohammed T.
    • Structural Engineering and Mechanics
    • /
    • v.61 no.3
    • /
    • pp.407-417
    • /
    • 2017
  • RC shear walls are considered one of the main lateral resisting members in buildings. In recent years, FRP has been widely utilized in order to strengthen and retrofit concrete structures. A number of experimental studies used CFRP sheets as an external bracing system for retrofitting of RC shear walls. It has been found that the common mode of failure is the debonding of the CFRP-concrete adhesive material. In this study, behavior of RC shear wall was investigated with three different micro models. The analysis included 2D model using plane stress element, 3D model using shell element and 3D model using solid element. To allow for the debonding mode of failure, the adhesive layer was modeled using cohesive surface-to-surface interaction model at 3D analysis model and node-to-node interaction method using Cartesian elastic-plastic connector element at 2D analysis model. The FE model results are validated comparing the experimental results in the literature. It is shown that the proposed FE model can predict the modes of failure due to debonding of CFRP and behavior of CFRP strengthened RC shear wall reasonably well. Additionally, using 2D plane stress model, many parameters on the behavior of the cohesive surfaces are investigated such as fracture energy, interfacial shear stress, partial bonding, proposed CFRP anchor location and using different bracing of CFRP strips. Using two anchors near end of each diagonal CFRP strips delay the end debonding and increase the ductility for RC shear walls.

Performance Analysis of Position Based Routing Protocol for UAV Networks (UAV 네트워크 환경에 적합한 위치기반 라우팅 프로토콜의 성능 분석)

  • Park, Young-Soo;Jung, Jae-Il
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.2C
    • /
    • pp.188-195
    • /
    • 2012
  • Many systems are developing for the realization of NCW(Network Centric Warfare). UAV(Unmanned Aerial Vehicle) Network is attracting attention in a lot of military applications. In general, UAVs have the potential to create an ad-hoc network and greatly reduce the hops from source to destination. However, UAV networks exhibit unique properties such as high mobility, high data rate, and real time service. The routing protocols are required to design the multi-hop routing protocols that can dynamically adapt to the requirements of UAV network. In this paper we analyse Geographic Routing Protocol is based on geographical distance between source and destination for efficient and reliable transmission. Geographic Routing Protocol is evaluated in video service scenarios with TDMA model in our simulation. The simulation results show that the performance of Geographic Routing Protocol is better than the MANET Routing Protocol in terms of packet received ratio, end to end delay, and routing traffic sent.

R-CAT: Resilient Capacity-Aware Multicast Tree Construction Scheme (R-CAT : P2P기반 스트리밍 환경에서 노드의 능력을 고려한 내구적 멀티캐스트 트리 생성 기법)

  • Kim Eun-Seok;Han Sae-Young;Park Sung-Yong
    • The KIPS Transactions:PartA
    • /
    • v.13A no.2 s.99
    • /
    • pp.147-156
    • /
    • 2006
  • Recently, streaming service accounts for large part of internet traffic and it is becoming the most popular service. Because of P2P's scalability, P2P-based streaming system is proposed. There are frequent leave and join of a node. To overcome the group dynamics, Multiple Multicast Trees Methods were suggested. However, since they did not consider discrepancy in peers' capacity, it may cause the trees to be long and unstable. So we suggest Resilient Capacity-Aware Multicast Tree construction scheme (R-CAT) that promotes superior peer to upper position in the tree and construct more stable and short multicast trees. By simulation we can show that R-CAT cost more overhead packets for tree joining process, but it reduce the end-to-end delay of the resulting tree and the number of packets lost during the node joining and leaving processes much more than SplitStream.

Comparison of anxiety and pain perceived with conventional and computerized local anesthesia delivery systems for different stages of anesthesia delivery in maxillary and mandibular nerve blocks

  • Aggarwal, Kamal;Lamba, Arundeep Kaur;Faraz, Farrukh;Tandon, Shruti;Makker, Kanika
    • Journal of Dental Anesthesia and Pain Medicine
    • /
    • v.18 no.6
    • /
    • pp.367-373
    • /
    • 2018
  • Background: Fear of local anesthesia (LA) is a significant impediment to dental care as many patients delay or avoid treatment to avert pain. Computer-controlled local anesthetic delivery system (CCLAD), with constant and controlled rate of flow, present a painless alternative. The present study aimed to compare anxiety and pain perceived with conventional and computerized systems, for different stages of anesthesia delivery when administering various nerve blocks. Methods: One hundred patients requiring bilateral LA participated in the study. One side was anesthetized using one system and the contralateral side was anesthetized using the other, in two separate appointments. Patients assigned anxiety scores on a 5-point scale and used the visual analogue scale (VAS) for pain determination at needle insertion, during delivery of anesthetic solution, immediately after injection, and at the end of the periodontal procedure. Each patient's preference for the delivery system of future injections was also recorded. Results: Patients reported significantly lower anxiety levels with CCLAD compared to the syringe. Significantly lower mean VAS scores for anesthesia deposition, pain immediately after, and at the end of the periodontal procedure were also noted. However, pain at needle insertion was comparable between the two systems, with no statistical significance. Overall, 64.4% patients preferred CCLAD for future anesthesia. Conclusion: Lower pain perceived with CCLAD and higher preference for the system suggest that CCLAD should replace conventional syringes to allow pain-free dental treatment.

Hybrid Spray and Wait Routing Protocol in DTN (DTN에서 Hybrid Spray and Wait 라우팅 프로토콜)

  • Hyun, Sung-Su;Jeong, Hyeon-Jin;Choi, Seoung-Sik
    • Journal of Internet Computing and Services
    • /
    • v.15 no.3
    • /
    • pp.53-62
    • /
    • 2014
  • DTN is the next generation network that is used in not guaranteed end-to-end connection such as communication between planet and satellite, frequent connection severance, and not enough for qualified network infrastructure. In this paper, we propose the hybrid Spray-and-Wait algorithm to predict the node contact time by monitoring the periodic contacts information between the nodes. Based on this method, we select one node on the basis of prediction time and copy a message for spray and wait algorithm. In order to verify the the hybrid Spray and Wait algorithm, we use the ONE(Opportunistic Network Environment) Simulator of Helsinki University. The delivery probability of the proposed algorithm is compared to the Binary Spray and Wait algorithm, it is showed that it has 10% less overhead than Binary Spray and Wait routing. It has also shown that it reduces unnecessary copying of this message.

Synchronous Reservation Protocol for Variable-sized Messages in a WDM-based Local Network (WDM 망에서 가변 길이의 메시지 전송을 위한 동기 예약 프로토콜)

  • Lee, Jae-Hwoon;Rim, Min-Joong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.38 no.6
    • /
    • pp.1-10
    • /
    • 2001
  • In this paper, we propose a synchronous reservation protocol that is efficient for supporting variable sized messages in a wavelength division multiplexing (WDM) based local network using a passive star topology. A. control channel is used to coordinate transmission on data channels. Time is slotted with fixed-sized slots. The network can accommodate a variable number of nodes, and can operate independently of the change of the number of nodes. So, any 'new' node can join the network anytime without network re-initialization. Moreover, with the protocol, we can avoid data channel and destination conflicts. We analyze the performance by using EPA method according to the variation of the end to end propagation delay with respect to one slot time, and validate the results by simulation.

  • PDF

Multi-channel QoS scheduling algorithm in IEEE 802.15.4e (IEEE 802.15.4e 멀티 채널 QoS 스케줄링 알고리즘)

  • Wu, Hyuk;Kim, Hak-Kyu;Lee, Dong-Jun;Kang, Ho-Yong
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.5
    • /
    • pp.764-773
    • /
    • 2011
  • IEEE 802.15.4 is a standard for LWPAN based on TDMA. IEEE 802.15.4 has not been used widely because of restrictions on the QoS, scalability, and reliability. IEEE 802.15.4 utilizes GTS for one-hop QoS transmission. However GTS is not an effective method to satisfy QoS in multi-hop environments. Currently IEEE 802.15.4e, an extended version of IEEE 802.15.4 MAC sub-layer, is being developed to satisfy more diverse performance requirements than IEEE 802.15.4. IEEE 802.15.4e provides muti-hop QoS transmission functionality and uses multiple frequency channels. In this paper, a multi-channel TDMA scheduling scheme is proposed to satisfy end-to-end transmission delay in IEEE 802.15.4e. The performance of the proposed scheme is evaluated using simulation.

An Improved Decoding Scheme of LCPC Codes (LCPC 부호의 개선된 복호 방식)

  • Cheong, Ho-Young
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.4
    • /
    • pp.430-435
    • /
    • 2018
  • In this paper, an improved decoding scheme for low-complexity parity-check(LCPC) code with small code length is proposed. The LCPC code is less complex than the turbo code or low density parity check(LDPC) code and requires less memory, making it suitable for communication between internet-of-things(IoT) devices. The IoT devices are required to have low complexity due to limited energy and have a low end-to-end delay time. In addition, since the packet length to be transmitted is small and the signal processing capability of the IoT terminal is small, the LCPC coding system should be as simple as possible. The LCPC code can correct all single errors and correct some of the two errors. In this paper, the proposed decoding scheme improves the bit error rate(BER) performance without increasing the complexity by correcting both errors using the soft value of the modulator output stage. As a result of the simulation using the proposed decoding scheme, the code gain of about 1.1 [dB] was obtained at the bit error rate of $10^{-5}$ compared with the existing decoding method.

An Event Data Delivery Scheme in GTS-based Wireless Sensor Network (GTS 기반 무선 센서 네트워크에서 이벤트 데이터 전달 방안)

  • Lee, Kil-hung
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.14 no.6
    • /
    • pp.125-132
    • /
    • 2015
  • This paper presents an event data delivery scheme for wireless sensor networks that use a GTS-based channel allocation scheme. Many sensor nodes can share a GTS channel for sending their normal data to the sink node. When there is an event at a node, the node makes a temporal route to the sink node and the nodes of the route can use the GTS channel in a privileged access. This scheme controls the backoff number effectively so the data delivery priority is given to the nodes of that route. Simulation results show that the event data delivery of the proposed scheme outperforms at the end-to-end transfer delay and jitter characteristics. The proposed scheme can effectively gather the event data using the guaranteed GTS channel of the route in proposed scheme.