• Title/Summary/Keyword: packet transmission problem

Search Result 204, Processing Time 0.027 seconds

A Traffic Aware Demand-Wakeup MAC(TADW-MAC) Protocol for Wireless Sensor Networks (무선 센서 네트워크에서 트래픽에 적응적인 Demand-Wakeup MAC 프로토콜)

  • Kim, Hye-Yun;Kim, Seong-Cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.1
    • /
    • pp.180-186
    • /
    • 2017
  • In this paper we propose a traffic aware Demand Wakeup MAC(TADW-MAC) protocol, in which low data delay and high throughput can be achieved, for wireless sensor networks. With the TADW-MAC protocol, the problem of the DW-MAC protocol, which schedules only one packet to deliver during the Sleep period in a multi-hop transmission is resolved. DW-MAC is not adequate for the applications such as object tracking and fire detection, in which busty data should be transmitted in a limited time when an event occurs [6-8]. When an event occurs, duty cycle can be adjusted in the TADW-MAC protocol to get less energy consumption and low latency. The duty cycle mechanism has been widely used to save energy consumption of sensor node due to idle listening in wireless sensor networks. But additional delay in packet transmission may be increased in the mechanism. Our simulation results show that TADW-MAC outperforms RMAC and DW-MAC in terms of energy efficiency while achieving low latency.

A Study on the CSMA/CA Performance Improvement based IEEE 802.15.6 (IEEE 802.15.6 기반 CSMA/CA 성능 향상에 관한 연구)

  • Lee, Jung-Jae;Kim, Ihn-Hwan
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.11
    • /
    • pp.1225-1230
    • /
    • 2015
  • MAC protocol for WBAN performs CSMA/CA(:Carrier Sense Multiple Access with Collision Avoidance)algorithm that handles traffic which occurs in emergency with top priority in order to deal with variable data of sensor node for medicine. Emergency message that node sends undergoes collision and delay of transmission by retransmission of emergency message and waste of energy by retransmission. This paper suggests algorithm that minimizes loss of frame caused by collision and applies different backoff parameters by setting order of priority between MAC instruction frame and data frame in CSMA/CA algorithm case which applies order of priority queuing to improve aforementioned problem. According to performance evaluation, it has been found that using suggested MAC protocol showed lower collision probability, higher packet transmission processing ratio and lower packet loss compared with using IEEE 802.15.6.

Slective Buffering Macro Handover Which Applies The F-SNOOP in Hierarchical structure (계층 구조에서 F-SNOOP을 적용한 선택적 버퍼링 매크로 핸드오버)

  • Ahn Chi-Hyun;Kim Dong-Hyun;Kim Hyoung-Chul;Ryou Hwang-Bin;Lee Dae-Young;Jun Kye-Suk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5B
    • /
    • pp.413-420
    • /
    • 2006
  • HMIPv6 is designed to reduce the signaling load to external network and improve handover speed of MN by including Mobility Anchor Point(MAP) in local handover. However in this case of macro handover, it's just used pervious MIPv6 handover algorithm. So, it occurs packet loss and transmission delay problem. In this paper, we propose the mechanism applying the HMIPv6 for Fast Handover to choose suitable to the condition buffering handover. The condition for the selection is result distance measurement between MN and CN, between MN and NAR. Furthermore, using F-SNOOP protocol, it is possible to improve wireless network performance. Wireless network has high Bit Error Rate(BER) characteristic because of path loss, fading, noise and interference. TCP regards such errors as congestion and starts congestion control. This congestion control makes packet transmission rate low. However, F-SNOOP improves TCP performance based on SNOOP and Freeze TCP that use Zero Window Advertisement(ZWA) message when handoff occurs in wireless network.

A Distributed Wireless Local Area Network (WLAN) Access Scheme for Efficient WLAN Communication in Busy Train Stations (혼잡 철도 역사에서 효율적인 무선랜 통신을 위한 무선랜 분산 접속 방법)

  • Koh, Seoung-Chon;Choi, Kyu-Hyoung;Kim, Ronny Yongho
    • Journal of the Korean Society for Railway
    • /
    • v.17 no.6
    • /
    • pp.402-409
    • /
    • 2014
  • Wireless local area network (WLAN) is a widely used wireless access method due to its easy usability and excellent performance. However, its performance degrades significantly as the number of users increases. In busy train stations, where the number of WLAN users are large and, more importantly the number of simultaneous packet transmission attempts is extremely large due to the time synchronization upon train arrival, the packet transmission delay problem is very severe and almost impossible for WLAN stations to initiate communication with WLAN networks. In this paper, a novel distributed WLAN access scheme for efficient WLAN communication in busy train stations is proposed. Using the proposed scheme, WLAN access delay can be significantly reduced under highly congested traffic environments. Therefore, a significant performance enhancement for the WLAN performance used in the Communication Based Train Control (CBTC) can be achieved.

An Improvement of Fast Handoff Protocol using Modified Local Registration in Mobile Computing Environment (이동 컴퓨팅 환경에서 수정된 지역 위치등록을 이용한 고속 핸드오프 프로토콜 개선)

  • Han, Seung-Jin;Choe, Seong-Yong;Lee, Jeong-Hyeon
    • The KIPS Transactions:PartC
    • /
    • v.9C no.2
    • /
    • pp.267-276
    • /
    • 2002
  • By using wireless terminal, User that want to transmit multimedia traffic as well as simple text and voice have a tendency to increase. This paper proposes a fast handoff protocol that is suitable transmission for real-tim of multimedia traffic by using modified local registration. The proposed protocol solves the Triangle Routing Protocol that is one of existing opened issues without modifying protocol of CN, and we propose the method that MN is able to received a packet by real-time, even if MN is being handoff. We compare fast handoff protocol proposed in this paper with existing method n the registration cost and data packet transmission cost. As a result, we showed that fast handoff protocol proposed in this paper outperforms existing method.

Performance Analysis of QUIC Protocol for Web and Streaming Services (웹 및 스트리밍 서비스에 대한 QUIC 프로토콜 성능 분석)

  • Nam, Hye-Been;Jung, Joong-Hwa;Choi, Dong-Kyu;Koh, Seok-Joo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.10 no.5
    • /
    • pp.137-144
    • /
    • 2021
  • The IETF has recently been standardizing the QUIC protocol for HTTP/3 services. It is noted that HTTP/3 uses QUIC as the underlying protocol, whereas HTTP/1.1 and HTTP/2 are based on TCP. Differently from TCP, the QUIC uses 0-RTT or 1-RTT transmissions to reduce the connection establishment delays of TCP and SCTP. Moreover, to solve the head-of-line blocking problem, QUIC uses the multi-streaming feature. In addition, QUIC provides various features, including the connection migration, and it is available at the Chrome browser. In this paper, we analyze the performance of QUIC for HTTP-based web and streaming services by comparing with the existing TCP and Streaming Control Transmission Protocol (SCTP) in the network environments with different link delays and packet error rates. From the experimental results, we can see that QUIC provides better throughputs than TCP and SCTP, and the gaps of performances get larger, as the link delays and packet error rates increase.

Mobility Support Scheme Based on Machine Learning in Industrial Wireless Sensor Network (산업용 무선 센서 네트워크에서의 기계학습 기반 이동성 지원 방안)

  • Kim, Sangdae;Kim, Cheonyong;Cho, Hyunchong;Jung, Kwansoo;Oh, Seungmin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.11
    • /
    • pp.256-264
    • /
    • 2020
  • Industrial Wireless Sensor Networks (IWSNs) is exploited to achieve various objectives such as improving productivity and reducing cost in the diversity of industrial application, and it has requirements such as low-delay and high reliability packet transmission. To accomplish the requirement, the network manager performs graph construction and resource allocation about network topology, and determines the transmission cycle and path of each node in advance. However, this network management scheme cannot treat mobile devices that cause continuous topology changes because graph reconstruction and resource reallocation should be performed as network topology changes. That is, despite the growing need of mobile devices in many industries, existing scheme cannot adequately respond to path failure caused by movement of mobile device and packet loss in the process of path recovery. To solve this problem, a network management scheme is required to prevent packet loss caused by mobile devices. Thus, we analyse the location and movement cycle of mobile devices over time using machine learning for predicting the mobility pattern. In the proposed scheme, the network manager could prevent the problems caused by mobile devices through performing graph construction and resource allocation for the predicted network topology based on the movement pattern. Performance evaluation results show a prediction rate of about 86% compared with actual movement pattern, and a higher packet delivery ratio and a lower resource share compared to existing scheme.

A Geographic Routing based Data Delivery Scheme for Void Problem Handling in Wireless Sensor Networks (무선 센서 네트워크에서 보이드 문제 해결을 위한 위치 기반 데이터 전송 기법)

  • Kim, Seog-Gyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.4
    • /
    • pp.59-67
    • /
    • 2009
  • In wireless sensor networks (WSNs), geographic greedy forwarding fails to move a packet further towards its destination if the sender does not have any closer node to the destination in its one hop transmission region. In this paper, we propose a enhanced geographic routing, called CGR(Cost based Geographic Routing) for efficient data delivery against void problem environment. CGR first establishes Shadow Bound Region and then accomplishes Renewing Cost Function Algorithm for effective greedy forwarding data delivery. Our simulation results show significant improvements compared with existing schemes in terms of routing path length, success delivery ratio and energy efficiency.

Optimal Transmission Scheduling for All-to-all Broadcast in WDM Optical Passive Star Networks) (수동적인 스타형 파장 분할 다중 방식인 광 네트워크에서의 전방송을 위한 최적 전송 스케쥴링)

  • Jang, Jong-Jun;Park, Young-Ho;Hong, Man-Pyo;Wee, Kyu-Bum;Yeh, Hong-Jin
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.1
    • /
    • pp.44-52
    • /
    • 2000
  • This paper is contented with packet transmission scheduling problem for repeating all-to-all broadcasts in WDM optical passive-star networks in which there are N nodes and k wavelengths. It is assumed that each node has one tunable transmitter and one fixed-tuned receiver, and each transmitter can tune to k different wavelengths. The tuning delay represents the time taken for a transmitter to tune from one wavelength to another and represented as ${\delta}$(>0) in units of packet durations. We define all-to-all broadcast as the one where every node transmits packets to all the other nodes except itself. So, there are in total N(N-1) packets to be transmitted for an all-to-all broadcast. The optimal transmission scheduling is to schedule In such a way that all packets can be transmitted within the minimum time. In this paper, we propose the condition for optimal transmission schedules and present an optimal transmission scheduling algorithm for arbitrary values of N, k, and ${\delta}$ The cycle length of the optimal schedules is $max{[\frac{N}{k}](M-1)$, $k{\delta}+N-1$}.

  • PDF

Low Delay Data Transmission Mechanism for Military Surveillance in Wireless Sensor Networks (무선 센서 네트워크에서 군 감시 정찰을 위한 저 지연 데이터 전송 메커니즘)

  • Jeon, Jun-heon;Lee, Sung-choon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.4
    • /
    • pp.855-860
    • /
    • 2017
  • One of the most important issues in Wireless Sensor Networks is to save energy of the sensor node. But transmission latency is also the problem to solve for some applications such as military surveillance, object tracking. In these applications sensor node needs to send lots of data in limited time when an even such as object appearance occurs. So a delay efficient data transmission method is required. In this paper we propose a MAC protocol adequate for those applications. This paper proposed a low delay data transmission mechanism for military surveillance in wireless sensor networks. In the MAC protocol, a receiver node sends another beacon frame to sender node after receiving data packet. Using this second beacon frame, fast hop-to-hop transmission can be performed. Results have shown that the proposed MAC control mechanism outperformed RI-MAC protocol in the terms of latency.