• Title/Summary/Keyword: Packet transmission period

Search Result 50, Processing Time 0.027 seconds

Packet Transmission Scheme for Collecting Traffic Information based on Vehicle Speed in u-TSN system (u-TSN 시스템의 교통정보 수집을 위한 차량 이동속도에 따른 패킷 전송 방안)

  • Bae, Jeong-Kyu;Han, Dong-Seog
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.6
    • /
    • pp.35-41
    • /
    • 2010
  • The ubiquitous-transportation sensor network (u-TSN) system is a next generation transportation system that provides traffic information through analysis and processing periodic information from vehicles. In this paper, we propose the adequate transmission scheme from vehicles for collecting vehicular information. The conventional scheme is transmitting each vehicle information every 0.1s. A variable transmission period scheme is proposed in this paper according to vehicle speed. The proposed and conventional schemes are compared with computer simulations.

Throughput Analysis and Optimization of Distributed Collision Detection Protocols in Dense Wireless Local Area Networks

  • Choi, Hyun-Ho;Lee, Howon;Kim, Sanghoon;Lee, In-Ho
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.502-512
    • /
    • 2016
  • The wireless carrier sense multiple access with collision detection (WCSMA/CD) and carrier sense multiple access with collision resolution (CSMA/CR) protocols are considered representative distributed collision detection protocols for fully connected dense wireless local area networks. These protocols identify collisions through additional short-sensing within a collision detection (CD) period after the start of data transmission. In this study, we analyze their throughput numerically and show that the throughput has a trade-off that accords with the length of the CD period. Consequently, we obtain the optimal length of the CD period that maximizes the throughput as a closed-form solution. Analysis and simulation results show that the throughput of distributed collision detection protocols is considerably improved when the optimal CD period is allocated according to the number of stations and the length of the transmitted packet.

A Study of Data Transmission Rate Measurement in 5 GHz Band Wireless LAN under the Influence of the Indoor Interference (5 GHz 대역 무선 랜의 실내 간섭 영향에 따른 데이터 전송률 측정 연구)

  • 송홍종;박유식;신용섭
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.13 no.5
    • /
    • pp.416-425
    • /
    • 2002
  • In this Paper, It is analysed 5 GHz frequency characteristics that carry out interference experimental under the indoor environments for understanding propagation interference between existing 5 GHz band wireless communication system and 5 GHz band wireless LAN system. The interference signal which was generated by signal generator injected to 5 GHz Wireless LAN communication system measured interference characteristics and This radio propagation main interference factors were classified received power level separation by interference source frequency and interference source frequency pulse period & width separation. It is measured transmission rate according to variable data and packet size for conforming the quality of 5 GHz band wireless LAN system. We measured the packet data loss rate and power level of received signal and analyzed its frequency characteristics effected by interference signal.

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.

Improved ErtPS Scheduling Algorithm for AMR Speech Codec with CNG Mode in IEEE 802.16e Systems (IEEE 802.16e 시스템에서의 CNG 모드 AMR 음성 코덱을 위한 개선된 ErtPS 스케줄링 알고리즘)

  • Woo, Hyun-Je;Kim, Joo-Young;Lee, Mee-Jeong
    • The KIPS Transactions:PartC
    • /
    • v.16C no.5
    • /
    • pp.661-668
    • /
    • 2009
  • The Extended real-time Polling Service (ErtPS) is proposed tosupport QoS of VoIP service with silence suppression which generates variable size data packets in IEEE 802.16e systems. If the silence is suppressed, VoIP should support Comfort Noise Generation (CNG) which generates comfort noise for receiver's auditory sense to notify the status of connection to the user. CNG mode in silent-period generates a data with lower bit rate at long packet transmission intervals in comparison with talk-spurt. Therefore, if the ErtPS, which is designed to support service flows that generate data packets on a periodic basis, is applied to silent-period, resources of the uplink are used inefficiently. In this paper, we proposed the Improved ErtPS algorithm for efficient resource utilization of the silent-period in VoIP traffic supporting CNG. In the proposed algorithm, the base station allocates bandwidth depending on the status of voice at the appropriate interval by havingthe user inform the changes of voice status. The Improved ErtPS utilizes the Cannel Quality Information Channel (CQICH) which is an uplink subchannel for delivering quality information of channel to the base station on a periodic basis in 802.16e systems. We evaluated the performance of proposed algorithm using OPNET simulator. We validated that proposed algorithm improves the bandwidth utilization of the uplink and packet transmission latency

An Efficient Collision Resolution Method in Wireless Sensor Networks Based on IEEE 802.15.4 Slotted CSMA/CA (IEEE 802.15.4 Slotted CSMA/CA 기반 무선 센서 네트워크의 효율적인 충돌 해결 기법)

  • Jung, Kyoung-Hak;Suh, Young-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.9
    • /
    • pp.750-759
    • /
    • 2012
  • This paper addresses the collision resolution issue to enhance the performance of wireless sensor networks based on IEEE 802.15.4 slotted CSMA/CA. Some solutions in existing work try to solve this issue by adjusting Backoff Exponent (BE) value or Backoff Period (BP). In contrast to the existing solutions, the proposed scheme in this paper aims at providing high system throughput, but also achieving efficient energy consumption of sensor nodes by using Preamble Address (PA). For this, in the proposed scheme, only one sensor node begins data packet transmission by performing PA contention phase with other nodes before sending each data packet. Our simulation results show that the proposed scheme outperforms existing algorithms in terms of energy consumption and throughput.

Enhanced TCP Congestion Control Mechanism for Networks with Large Bandwidth Delay Product (대역폭과 지연의 곱이 큰 네트워크를 위한 개선된 TCP 혼잡제어 메카니즘)

  • Park Tae-Joon;Lee Jae-Yong;Kim Byung-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.3 s.345
    • /
    • pp.126-134
    • /
    • 2006
  • Traditional TCP implementations have the under-utilization problem in large bandwidth delay product networks especially during the startup phase. In this paper, we propose a delay-based congestion control(DCC) mechanism to solve the problem. DCC is subdivided into linear and exponential growth phases. When there is no queueing delay, the congestion window grows exponentially during the congestion avoidance period. Otherwise, it maintains linear increase of congestion window similar to the legacy TCP congestion avoidance algorithm. The exponential increase phase such as the slow-start period in the legacy TCP can cause serious performance degradation by packet losses in case the buffer size is insufficient for the bandwidth-delay product, even though there is sufficient bandwidth. Thus, the DCC uses the RTT(Round Trip Time) status and the estimated queue size to prevent packet losses due to excessive transmission during the exponential growth phase. The simulation results show that the DCC algorithm significantly improves the TCP startup time and the throughput performance of TCP in large bandwidth delay product networks.

A high speed processing method of web server cluster through round robin load balancing (라운드로빈 부하균형을 통한 웹 서버 클러스터 고속화 처리기법)

  • Sung Kyung;Kim Seok-soo;Park Gil-cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.7
    • /
    • pp.1524-1531
    • /
    • 2004
  • This study analyzes a load balancing technique using Round Robin Algorithm. The study uses two software packages (Packet Capture and Round Robin Test Package) to check packet volume from Virtual Network structure (data generator, virtual server, Server1,2,3), and finds out traffic distribution toward Server1,2 and 3. The functions of implemented Round Robin Load Balancing Monitoring System include round robin testing, system monitoring, and graphical indication of data transmission and packet volume. As the result of the study shows, Round Robin Algorithm allows servers to ensure definite traffic distribution, unless incoming data loads differ much. Although error levels are high in some cases, they were eventually alleviated by repeated tests for a long period of time.

Traffic Distributed Processing System Implementation on the Web Sever Networking (웹서버 네트워킹에서의 트래픽분산 처리 시스템 구현)

  • Park, Gil-Cheol;Sung, Kyung;Kim, Seok-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.4
    • /
    • pp.846-853
    • /
    • 2004
  • This paper introduces implementation of a traffic distributed processing system on the Web Sever Networking. The study used two software packages (Packet Capture and Round-Robin Test Package) to check packet quantity from Virtual Network Structure (data generator, virtual server, Serve. 1, 2, 3), and could find out traffic distribution toward Server 1, 2, and 3. The functions of implemented Round-Robin Load Balancing Monitoring System include Round-Robin testing, system monitoring, and graphical indication of data transmission/packet quantity (figures & diagram). As the result of the study shows, Round-Robin Algorithm ensured definite traffic distribution, unless incoming data loads differ much. Although error levels were high in some cases, they were eventually alleviated by repeated tests for a long period of time.

A Novel Hitting Frequency Point Collision Avoidance Method for Wireless Dual-Channel Networks

  • Quan, Hou-De;Du, Chuan-Bao;Cui, Pei-Zhang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.3
    • /
    • pp.941-955
    • /
    • 2015
  • In dual-channel networks (DCNs), all frequency hopping (FH) sequences used for data channels are chosen from the original FH sequence used for the control channel by shifting different initial phases. As the number of data channels increases, the hitting frequency point problem becomes considerably serious because DCNs is non-orthogonal synchronization network and FH sequences are non-orthogonal. The increasing severity of the hitting frequency point problem consequently reduces the resource utilization efficiency. To solve this problem, we propose a novel hitting frequency point collision avoidance method, which consists of a sequence-selection strategy called sliding correlation (SC) and a collision avoidance strategy called keeping silent on hitting frequency point (KSHF). SC is used to find the optimal phase-shifted FH sequence with the minimum number of hitting frequency points for a new data channel. The hitting frequency points and their locations in this optimal sequence are also derived for KSHF according to SC strategy. In KSHF, the transceivers transmit or receive symbol information not on the hitting frequency point, but on the next frequency point during the next FH period. Analytical and simulation results demonstrate that unlike the traditional method, the proposed method can effectively reduce the number of hitting frequency points and improve the efficiency of the code resource utilization.