• Title/Summary/Keyword: packet data

Search Result 1,644, Processing Time 0.033 seconds

Development of Advanced DSRC Packet Communication Technology (차세대 DSRC 패킷 통신 기술 개발)

  • Lee Hyun;Park In-Seong;Shin Chang-Sub;Oh Hyun-Seo;Yim Choon-Sik;Cho Kyoung-Rok
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.2 no.1 s.2
    • /
    • pp.93-100
    • /
    • 2003
  • In this farer, An ADSRC(Advanced Dedicated Short Range Communication) packet communication system developed by ETRI is introduced. The ADSRC system has been developed to provide high-speed, short-range wireless racket communication in roadside environment for mobile office services. The requirements of the ADSRC system for mobile office services and the system design specification to meet them with regard to mobile of nce environment are discussed. The ADSRC packet communication systems consist of the MAC(Medium Access Control) Processor block the OFDM() modem block and the RF block. The MAC processor block handles medium access control. The OFDM modem transmits data packets at up to 24Mbps adaptively and recovers the data from RF block. The ADSRC packet communication system architecture is described.

  • PDF

Effects of Packet-Scatter on TCP Performance in Fat-Tree (Fat-Tree에서의 패킷분산이 TCP 성능에 미치는 영향)

  • Lim, Chansook
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.6
    • /
    • pp.215-221
    • /
    • 2012
  • To address the bottleneck problem in data center networks, there have been several proposals for network architectures providing high path-diversity. In devising new schemes to utilize multiple paths, one must consider the effects on TCP performance because packet reordering can make TCP perform poorly. Therefore most schemes prevent packet reordering by sending packets through one of multiple available paths. In this study we show that packet reordering does not occur severely enough to have a significant impact on TCP performance when scattering packets through all available paths between a pair of hosts in Fat-Tree. Simulation results imply that it is possible to find a low-cost solution to the TCP performance problem for Fat-Tree-like topologies.

Efficient Data Distribution Method in a Wireless P2P Network (무선 P2P 네트워크에서 Peer 사이의 효율적 자료 분배 방법에 대한 연구)

  • Kang, Seung-Seok
    • Journal of the Korea Society for Simulation
    • /
    • v.15 no.4
    • /
    • pp.97-105
    • /
    • 2006
  • Popular content stored within the Internet may be convenient to download via modern 3G connections, but costly due to a fee charged by telecommunication providers on the basis of the amount of data transferred. This paper presents a network in which several mobile devices, called the peers, cooperate to download their assigned portion of the content using a 3G connection in order to reduce the overall cost. Then, the peers exchange their assigned portion of the content with other peers via a wireless ad hoc network and the peers reconstruct the whole content using the exchanged portion. This paper focuses on the per-peer based distribution method, and presents the performance comparison with a similar method, called the per-packet distribution method. Both methods are designed to reduce packet collisions while content is exchanged. The simulation result indicates that the per-peer based method outperforms the per-packet based method, and approximately 90% of the telecommunication cost is saved with as few as 10 peers.

  • PDF

A Study on MAC Protocol for Packet Data Services in Next-Generation Wireless Networks (차세대 무선망에서 패킷 데이터 서비스를 위한 MAC 프로토콜 연구)

  • 임인택
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.6
    • /
    • pp.1115-1120
    • /
    • 2004
  • In this paper, a CSSMA/AI MAC protocol for data services in packet CDMA network is presented. The main features of this protocol are the code status sensing and code reservation for reducing the packet collision. The base station broadcasts the code status on a frame-by-frame basis just before the beginning of each preamble transmission, and the mobile station transmits a preamble for reserving a randomly selected code based on the received code status. After having transmitted the preamble, the mobile station listens to the downlink of the selected code and waits for the base station reply. If this reply indicates that the code has been correctly acquired, it continues the packet transmission for the rest of the frame. If there are other packets waiting for transmission, the base station broadcasts the status of the code as reserved, and the mobile station transmits a packet on a reserved code for the successive frames.

Packet Drop Technique for Differentiated Services in Wired Ship Area Networks (선박 내 유선망에서 차등화 서비스 지원을 위한 패킷 폐기 기술)

  • Lee, Seong Ro;Kwon, Jang-Woo;Jeong, Min-A;Hur, Kyeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.11
    • /
    • pp.1177-1184
    • /
    • 2014
  • An wired ship area network has functionality of remote control and autonomous management of various sensors and instruments embedded or boarded in a ship. For such environment, the DiffServ (Differentiated Services) realizes that the high-speed real-time flow with the higher priority has the guaranteed minimum data rate and is delivered faster. As a result of this DiffServ effect, the intelligent Ship Area Networks can be implemented. In this paper, an packet drop technique is proposed to outperform the previous RIO (RED In and Out) drop mechanism for DiffServ in ship area networks. the proposed packet drop technique does not manage the individual flows and divides them into several flow groups according to a criterion. And it guarantees the fairness between individual flows in the same QoS class through the group-based control. In simulation results of the proposed packet drop technique, the link utilization decreases than RIO. But it guarantees more data rates to DiffServ flows passing multiple bottleneck links.

A Study on User Authentication for Wireless Communication Security in the Telematics Environment (텔레메틱스 환경에서 무선통신 보안을 위한 사용자 인증에 관한 연구)

  • Kim, Hyoung-Gook
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.9 no.2
    • /
    • pp.104-109
    • /
    • 2010
  • In this paper, we propose a user authentication technology to protect wiretapping and attacking from others in the telematics environment, which users in vehicle can use internet service in local area network via mobile device. In the proposed user authentication technology, the packet speech data is encrypted by speech-based biometric key, which is generated from the user's speech signal. Thereafter, the encrypted data packet is submitted to the information communication server(ICS). At the ICS, the speech feature of the user is reconstructed from the encrypted data packet and is compared with the preregistered speech-based biometric key for user authentication. Based on implementation of our proposed communication method, we confirm that our proposed method is secure from various attack methods.

Integrated Packet Scheduling Algorithm for real-time and non-real-time packet service (실시간 및 비실시간 패킷서비스를 위한 통합 패킷 스케줄링)

  • Lee, Eun-Yong;Park, Hyung-Kun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.5
    • /
    • pp.967-973
    • /
    • 2009
  • Recently, as 3rd-generation mobile communication services using high-speed data rate system are widely employed, the demand for a variety of real-time data services such as VoIP service are also increased. Unlike typical data packets, VoIP packets have delay bound and low loss rate requirement. In this paper we propose a new scheduling algorithm that schedule two deferent kinds of packets efficiently, considering the characteristics of VoIP. Basically this algorithm considers both time delay and channel condition and gives priority depending on the time delay. Simulation results show that the proposed algorithm works more efficiently than conventional algorithms.

A Study on Packet Transmissions using overhearing and Time-Interval in WMSNs (WMSN에서 엿듣기와 시간 지연을 이용한 패킷 전송에 관한 연구)

  • Ha, IlKyu;Byeon, Seokjin;Ahn, ByoungChul
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.4
    • /
    • pp.464-471
    • /
    • 2013
  • With the advance of wireless sensor networks, WMSN(Wireless Multimedia Sensor Networks) researches to transfers multimedia data have been studied actively. First of all, three basic protocols, End-to-end, Hop-by-hop, and Unreliable transmission method, are compared to transfer multimedia data using simulations. This paper presents an efficient protocol to transfer multimedia data by overhearing messages of nodes and by transmitting next packets during the unused time interval. The proposed method is verified its performance by simulations and experiments. The results shows that the transmission rate of the proposed method 22% higher than that of End-to-end protocol with half of transmission time. Also the performance of the proposed method is compared with that of PIGAB(Packet Interval Gap based on Adaptive Backoff).

Decimation Chain Modeling for Dual-Band Radio Receiver and Its Operation for Continuous Packet Connectivity

  • Park, Chester Sungchung;Park, Sungkyung
    • Journal of information and communication convergence engineering
    • /
    • v.13 no.4
    • /
    • pp.235-240
    • /
    • 2015
  • A decimation chain for multi-standard reconfigurable radios is presented for 900-MHz and 1,900-MHz dual-band cellular standards with a data interpolator based on the Lagrange method for adjusting the variable data rate to a fixed data rate appropriate for each standard. The two proposed configurations are analyzed and compared to provide insight into aliasing and the signal bandwidth by means of a newly introduced measure called interpolation error. The average interpolation error is reduced as the ratio of the sampling frequency to the signal BW is increased. The decimation chain and the multi-rate analog-to-digital converter are simulated to compute the interpolation error and the output signal-to-noise ratio. Further, a method to operate the above-mentioned chain under a compressed mode of operation is proposed in order to guarantee continuous packet connectivity for inter-radio-access technologies. The presented decimation chain can be applied to LTE, WCDMA, GSM multi-mode multi-band digital front-end which will ultimately lead to the software-defined radio.

Energy efficient watchman based flooding algorithm for IoT-enabled underwater wireless sensor and actor networks

  • Draz, Umar;Ali, Tariq;Zafar, Nazir Ahmad;Alwadie, Abdullah Saeed;Irfan, Muhammad;Yasin, Sana;Ali, Amjad;Khattak, Muazzam A. Khan
    • ETRI Journal
    • /
    • v.43 no.3
    • /
    • pp.414-426
    • /
    • 2021
  • In the task of data routing in Internet of Things enabled volatile underwater environments, providing better transmission and maximizing network communication performance are always challenging. Many network issues such as void holes and network isolation occur because of long routing distances between nodes. Void holes usually occur around the sink because nodes die early due to the high energy consumed to forward packets sent and received from other nodes. These void holes are a major challenge for I-UWSANs and cause high end-to-end delay, data packet loss, and energy consumption. They also affect the data delivery ratio. Hence, this paper presents an energy efficient watchman based flooding algorithm to address void holes. First, the proposed technique is formally verified by the Z-Eves toolbox to ensure its validity and correctness. Second, simulation is used to evaluate the energy consumption, packet loss, packet delivery ratio, and throughput of the network. The results are compared with well-known algorithms like energy-aware scalable reliable and void-hole mitigation routing and angle based flooding. The extensive results show that the proposed algorithm performs better than the benchmark techniques.