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

Search Result 762, Processing Time 0.031 seconds

Design of Multipath Adaptive BISMO-Algorithm in the Underwater Communication (수중 통신시 다중경로 적응 BISMO (Bi-Switch Modulation)알고리즘 설계)

  • Im, Byung-Ook;Shim, Tae-Bo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.27 no.7
    • /
    • pp.342-349
    • /
    • 2008
  • Multipath makes clear message transfer difficult in the underwater communication. To solve this problem, we propose a new method producing proper MFSP (Modulation Frequency Shift Period) which could be obtained by calculating time delay caused by different path from a transmitter to a receiver. At the transmitter end, messages were divided according to the size of the MFSP and transmitted accordingly alternating Frequency. At the receiver end, the received messages were demodulated in order to recover the original message by the adaptive BISMO algorithm which is constructed at the algorithm design stage. Adaptive MFSP and estimated BER (Bit Error Rate) were calculated through simulation test.

Resilient Routing Protocol Scheme for 6LoWPAN (6LoWPAN에서 회복력 있는 라우팅 프로토콜 기법)

  • Woo, Yeon Kyung;Park, Jong Tae
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.11
    • /
    • pp.141-149
    • /
    • 2013
  • IETF 6LoWPAN standard technique has been studied in IoT environment to support the IPv6 packet communication. 6LoWPAN protocol for transmission of packets mainly in the AODV routing protocol and a variety of extended techniques have been investigated. In particular, consisting of nodes with limited resources in a network error occurs when the 6LoWPAN reliable data transfer and fast routing method is needed. To this end, in this paper, we propose resilient routing protocol and extension of IETF LOAD algorithm, for optimal recovery path, More specifically, the optimal recovery path setup algorithm, signal flow, and detailed protocols for the verification of the reliability of packet transmission mathematical model is presented. The proposed protocol techniques to analyze the performance of the NS-3 performance through the simulation results that is end-to-end delay, throughput, packet delivery fraction and control packet overhead demonstrated excellence in comparison with existing LOAD.

A Joint Topology Discovery and Routing Protocol for Self-Organizing Hierarchical Ad Hoc Networks (자율구성 계층구조 애드혹 네트워크를 위한 상호 연동방식의 토폴로지 탐색 및 라우팅 프로토콜)

  • Yang Seomin;Lee Hyukjoon
    • The KIPS Transactions:PartC
    • /
    • v.11C no.7 s.96
    • /
    • pp.905-916
    • /
    • 2004
  • Self-organizing hierarchical ad hoc network (SOHAN) is a new ad-hoc network architecture designed to improve the scalability properties of conventional 'flat' ad hoc networks. This network architecture consists of three tiers of ad-hoc nodes, i.e.. access points, forwarding nodes and mobile nodes. This paper presents a topology discovery and routing protocol for the self-organization of SOHAN. We propose a cross-layer path metric based on link quality and MAC delay which plays a key role in producing an optimal cluster-based hierarchical topology with high throughput capacity. The topology discovery protocol provides the basis for routing which takes place in layer 2.5 using MAC addresses. The routing protocol is based on AODV with appropriate modifications to take advantage of the hierarchical topology and interact with the discovery protocol. Simulation results are presented which show the improved performance as well as scalability properties of SOHAN in terms of through-put capacity, end-to-end delay, packet delivery ratio and control overhead.

Real-Time Transmission Scheme for Ad Hoc Self-Organizing (ASO) TDMA in Multi-Hop Maritime Communication Network (Ad Hoc Self-Organizing (ASO) TDMA 방식 다중-홉 해양통신망에서의 실시간 전송 기법)

  • Cho, Kumin;Yun, Changho;Lim, Yong-Kon;Kang, Chung G.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.5
    • /
    • pp.260-270
    • /
    • 2014
  • In this paper, we first analyze the delay performance of Dynamic Space-time Subframe (DSTS)-based frame structure which has been proposed to support the real-time service as well as non real-time service, using Ad hoc Self-Organizing Time Division Multiple Access (ASO-TDMA) MAC protocol, especially when transmitting a MAC SDU with two or more MAC PDUs, in a multi-hop ad-hoc maritime communication network. We propose two key transmission schemes: contiguous DSTS reservation which guarantees the end-to-end delay for the multiple PDUs, and adaptive transmission probability control schemes to maximize the system throughput. Our simulation results show that the proposed schemes outperform the system throughput of the existing transmission schemes, while supporting the real-time requirement.

A Cluster-Based Multicast Routing for Mobile Ad-hoc Networks (모바일 Ad-hoc 네트워크를 위한 클러스터 기반 멀티캐스트 라우팅)

  • An, Beong-Ku;Kim, Do-Hyeun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.9 s.339
    • /
    • pp.29-40
    • /
    • 2005
  • In this paper, we propose a Cluster-based Multicast Routing (CMR) suitable for mobile ad-hoc networks. The main features that our proposed method introduces are the following: a) mobility-based clustering and group based hierarchical structure in order to effectively support stability and scalability, b) group based mesh structure and forwarding tree concepts in order to support the robustness of the mesh topologies which provides limited redundancy and the efficiency of tree forwarding simultaneously, and c) combination of proactive and reactive concepts which provide low route acquisition delay and low overhead. The performance evaluation of the proposed protocol is achieved via modeling and simulation. The corresponding results demonstrate the Proposed multicast protocol's efficiency in terms of packet delivery ratio, scalability, control overhead, end-to-end delay, as a function of mobility, multicast group size, and number of senders.

An Improved Coyote Optimization Algorithm-Based Clustering for Extending Network Lifetime in Wireless Sensor Networks

  • Venkatesh Sivaprakasam;Vartika Kulshrestha;Godlin Atlas Lawrence Livingston;Senthilnathan Arumugam
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.7
    • /
    • pp.1873-1893
    • /
    • 2023
  • The development of lightweight, low energy and small-sized sensors incorporated with the wireless networks has brought about a phenomenal growth of Wireless Sensor Networks (WSNs) in its different fields of applications. Moreover, the routing of data is crucial in a wide number of critical applications that includes ecosystem monitoring, military and disaster management. However, the time-delay, energy imbalance and minimized network lifetime are considered as the key problems faced during the process of data transmission. Furthermore, only when the functionality of cluster head selection is available in WSNs, it is possible to improve energy and network lifetime. Besides that, the task of cluster head selection is regarded as an NP-hard optimization problem that can be effectively modelled using hybrid metaheuristic approaches. Due to this reason, an Improved Coyote Optimization Algorithm-based Clustering Technique (ICOACT) is proposed for extending the lifetime for making efficient choices for cluster heads while maintaining a consistent balance between exploitation and exploration. The issue of premature convergence and its tendency of being trapped into the local optima in the Improved Coyote Optimization Algorithm (ICOA) through the selection of center solution is used for replacing the best solution in the search space during the clustering functionality. The simulation results of the proposed ICOACT confirmed its efficiency by increasing the number of alive nodes, the total number of clusters formed with the least amount of end-to-end delay and mean packet loss rate.

Delayed Reduction of Nasal Bone Fractures

  • Yoon, Han Young;Han, Dong Gil
    • Archives of Craniofacial Surgery
    • /
    • v.17 no.2
    • /
    • pp.51-55
    • /
    • 2016
  • Background: Nasal bone fractures are managed by closed reduction within the 2-week period, and are managed by secondary correction after this time. There is little literature on the delayed reduction for nasal bone fractures beyond the 2-week duration. We report our experience with nasal fractures, which were reduced beyond this period. Methods: A retrospective review was performed for all patients who had undergone closed reduction of isolated nasal bone fracture. Patients were included for having undergone reduction of nasal bone fractures at or more than 2 weeks after the injury. Medical records were reviewed for demographic information, injury mechanism, fracture type, delay in treatment, and cause for delay. Postoperative outcomes were evaluated using computed tomography images. Results: The review identified 10 patients. The average reduction time was 22.1 days. Five of patients underwent reduction between days 15 and 20, and the remaining five patients underwent reduction between days 21 and 41. The postoperative outcomes were excellent in 8 patients and good in 2 patients. Conclusion: Outcomes were superior for nasal fractures with displaced end plates and multiple fracture segments. Our study results appears to support delayed reduction of isolated nasal fractures in the presence of factors that delay bony reunion.

Routing Method based on Prediction of Link State between UAVs in FANET (FANET에서 UAV간 링크 상태 예측에 기반한 라우팅 기법)

  • Hwang, HeeDoo
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.11
    • /
    • pp.1829-1836
    • /
    • 2016
  • Today, the application area and scope of FANET(Flying Ad Hoc Network) has been extended. As a result, FANET related research are actively conducted, but there is no decision yet as the routing protocol for FANET. In this paper, we propose the OLSR-Pds (Prediction with direction and speed) which is added a method to predict status of link for OLSR protocol. The mobility of nodes are modeled using Gauss-Markov algorithm, and relative speed between nodes were calculated by derive equation of movement, and thereby we can predict link status. An experiment for comparing AODV, OLSR and, OLSR-Pds was conducted by three factors such as packet delivery ratio, end to end delay, and routing overhead. In experiment result, we were confirm that OLSR-Pds performance are superior in these three factors. OLSR-Pds has the disadvantage that requires time-consuming calculations for link state and required for computing resources, but we were confirm that OLSR-Pds is suitable for routing to the FANET environment because it has all the characteristics of proactive protocol and reactive protocol.

An Optimal Multicast Routing Protocol for Guaranting Host Mobility in IPv6-Based Mobile Networks (IPv6 기반 이동망에서 호스트 이동성 보장을 위한 최적화된 멀티캐스트 라우팅 프로토콜)

  • 양승제;강명규;박성한
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.5
    • /
    • pp.1-9
    • /
    • 2004
  • In this paper, we propose a multicast routing protocol for the seamless delivery of multicast data to mobile hosts through the optimal route in IPv6-Based mobile networks. The proposed multicast routing protocol reduces the tree reconstruction overhead by limiting the tunneling length according to the mobility of mobile hosts. In this way, our protocol satisfies the bound of the end-to-end delay and supports the seamless handoff. Analytical and simulation results show that the proposed protocol has better performance in terms of the tree reconstruction, tunneling service and multicast packet loss than the previous protocols does.

An Effective Cross Layer-based Multimedia Transmission Algorithm over Multi-hop Mobile Ad Hoc Network (다중 홉 이동 애드 혹 네트워크에서 크로스레이어 기반의 효과적인 멀티미디어 전송 알고리즘)

  • Lee, Gyeong-Cheol;Kim, Wan;Song, Hwang-Jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.5A
    • /
    • pp.474-481
    • /
    • 2010
  • In this paper, we present an effective cross layer-based video transmission algorithm over multi-hop mobile ad hoc networks. The proposed algorithm selects the most efficient PHY mode of wireless LAN multi-rate service at each node in a distributed way based on the available information at application, MAC, and physical layers in order to minimize end-to-end delay and maintain packet loss rate in tolerable range at the receiver. Finally, experimental results are provided to show superior performance of the proposed algorithm.