• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.201-203
• /
• 2009

In the VANET, density is a most important factor for reception rate of packet. So, we have to find solutions to reduce packet collision. There are two approaches. First, packet collision avoid by controlling transmission interval. Second, packet collision avoid by controlling transmission power. In this paper, we propose a simple method to reduce a packet collision by controlling transmission power. It uses the number of neighbors and adaptive controlling method. This method have better performance about packet reception rate.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.118-123
• /
• 2009

In this paper, we propose packet selection and significance based interval allocation algorithm for real-time streaming service. In real-time streaming of inter-frame (and layer) coded video, minimizing packet loss does not imply maximizing QoS. It is true that packet loss adversely affects the QoS but one single packet can have more impact than several other packets. We exploit the fact that the significance of each packet loss is different from the frame type it belongs to and its position within GoP. Using packet dependency and PSNR degradation value imposed on the video from the corresponding packet loss, we find each packet's significance value. Based on the packet significance, the proposed algorithm determines which packets to send and when to send them. The proposed algorithm is tested using publicly available MPEG-4 video traces. Our scheduling algorithm brings significant improvement on user perceivable QoS. We foresee that the proposed algorithm manifests itself in last mile connection of the network where intervals between successive packets from the source and to the destination are well preserved.

• Journal of Korea Multimedia Society
• /
• v.8 no.1
• /
• pp.71-78
• /
• 2005

When a PDA is used as a mobile terminal in an infrastructure network based on 802.11b standard wireless LAN, we measured and evaluated the performance of multimedia data transmission. In general, PDAs are mainly used tot receiving bulk data like multimedia data. However, while a PDA as a mobile host transfers multimedia data to a desktop PC as a fixed host in such a network, the time taken to receive data from the PC to the PDA is always longer than the time taken to send data from the PDA to the PC by at least 53%. Thus, we consider some critical factors that affect the time taken to receive Our experimental results show that with the PDA the time taken to access a file for writing is longer than the time taken to access a file for reading of to 4.11 times. In addition, a dramatic change of the site of the receiver window, from 686 bytes to 32,383 bytes, prolongs the time taken to receive. To transfer data without any inter-packet interval for the PDA and to increase the size of the TCP receive buffer will be effective in improving the delay to receive data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.1866-1883
• /
• 2019

As the youngest branch of information hiding, network covert timing channels conceal the existence of secret messages by manipulating the timing information of the overt traffic. The popular model-based framework for constructing covert timing channels always utilizes cumulative distribution function (CDF) of the inter-packet delays (IPDs) to modulate secret messages, whereas discards high-order statistics of the IPDs completely. The consequence is the vulnerability to high-order statistical tests, e.g., entropy test. In this study, a rich security model of covert timing channels is established based on IPD chains, which can be used to measure the distortion of multi-order timing statistics of a covert timing channel. To achieve rich security, we propose two types of covert timing channels based on nested lattices. The CDF of the IPDs is used to construct dot-lattice and interval-lattice for quantization, which can ensure the cell density of the lattice consistent with the joint distribution of the IPDs. Furthermore, compensative quantization and guard band strategy are employed to eliminate the regularity and enhance the robustness, respectively. Experimental results on real traffic show that the proposed schemes are rich-secure, and robust to channel interference, whereas some state-of-the-art covert timing channels cannot evade detection under the rich security model.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.8
• /
• pp.3-11
• /
• 2017

Research and development are being conducted to apply low-power Bluetooth (BLE) technology to IoT (Internet of Things) applications. The characteristic of this application environment is that many piconets can operate in the same space. Therefore, interference between homogeneous networks is likely to occur. In the BLE data channel, adaptive frequency hopping (AFH) scheme is used among the 37 frequency channels, and the master and the slave communicate while changing the carrier frequency. If there are multiple BLE piconets in the same space, there is a risk of frequency collision and packet errors will occur. In this paper, we analyze the packet collision probability due to cochannel interference in multiple asynchronous BLE piconet environments. Specifically, we analyzed packet collision probability according to the number of concurrently operating BLE piconets with the ratio of connection interval to connection event length as the main parameters. The analysis result can be used to set connection event related parameters for a desired packet collision probability according to the number of users having BLE devices in a given space.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.3
• /
• pp.19-27
• /
• 2011

Due to the growth of optical fiber network technologies, most networks recently support several tens of Gb/s bandwidth. UDT(UDP-based Data Transfer protocol) is an optimized protocol for bulk data transmission on the network, which has the high bandwidth and long delay time. It periodically controls the sending rate on the fixed sync-interval, 0.01 sec. Here, if the network traffic status varies quickly, available network bandwidth is not able to be properly utilized in-between the sync-intervals. In this paper, we propose an adaptive rate control method with considering the network traffic status in-between the sync-interval periods. The network traffic status is determined based on the RTT variances. With dividing the network status into four classes, the proposed method performs a new rate control by adjusting the inter-packet sending period for a corresponding class. As a simulation result, the proposed method improves the message delivery throughput as well as stability than that of the existing UDT Protocol.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1031-1046
• /
• 2018

Vehicular ad hoc network (VANET) is a dedicated network to connect vehicles without any centralized administration or infrastructure. The wireless access in vehicular environments (WAVE) protocol leveraging IEEE 1609/802.11p is widely implemented for VANETs. However, in congested traffic situation, the performance of the WAVE system degrades significantly due to serious collision, especially for safety related broadcast services on the control channel (CCH) interval due to the inherent drawback of its collision avoidance mechanisms called carrier sense multiple access with collision avoidance (CSMA/CA). In this paper, we propose a method that can decrease the number of frame collisions in CCH with a few modifications to the IEEE 802.11p protocol. In the paper, vehicles still employ CSMA/CA to compete for the channel access opportunity. However, by taking advantage of periodicity of synchronization interval, a two-state switching scheme introducing two new inter frame space (IFS) is proposed to reduce the number of competing vehicles substantially and as a result, the collision probability is significantly decreased. The simulation results demonstrate the superiority of the proposed method in packet collision rate.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.24-30
• /
• 2002

Label switching technology is currently emerging as a solution for the rapidly growing of Internet traffic demand. Multiprotocol label switching(MPLS) is one of the standards made by the Internet Engineering Task Force(IETE) intended to enhance speed, scalability, and inter-opearability between label switching technologies. In MPLS, utilization of label space is a very important factor of network performance because labels are basic unit in packet switching. We propose a algorithm to effectively use label space by a multiple disconnect timer at the label switching router. Our algorithm is based on multiple utilization of the connection release timer over the MPLS network with multiple domains. In our algorithm, a relatively linger timeout interval is assigned to the traffic with higher class by the aid of the packet classifier. This reduces delay for making a new connection and also reduces the amount of packets which will be routed to the layer 3. Simulation results shows that reduction of required label number in MPLS network and this indicate our algorithm offers better performance than the existing ones in term of utilization of label space.