• The Journal of the Korea Contents Association
• /
• v.10 no.1
• /
• pp.46-58
• /
• 2010

The user valence of VoIP services with SIP protocol is increasing rapidly because of cheap communication cost and its conveniency. But attacker can easily modify the packet contents of SIP protocol as SIP header is transmitted by using UDP methods in text form. The reason is that SIP protocols does not provide an authentication function on the transmission session. Therefore, existing SIP protocol is very weak on SIP Packet Flooding attack etc. In order to solve like this kinds of SIP vulnerabilities, we used SIP status codes under the monitoring module for detecting SIP Flooding attacks and additionally proposed an advanced protocol where the authentication and security function is strengthened about SIP packet. We managed SIP session spontaneously in order to strengthen security with SIP authentication function and to solve the vulnerability of SIP protocol. The proposed mechanism can securely send SIP packet to solves the security vulnerability with minimum traffic transmission. Also service delay in SIP proxy servers will be minimized to solve the overload problem on SIP proxy server.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.12
• /
• pp.99-108
• /
• 2014

WBAN(Wireless Body Area Network) is network to support medical and non-medical services. It is susceptible to loss and delay of data. WBAN is required to satisfy many kinds of demands such as a variety of data rate and a data priority for providing various service. In this paper scheduling algorithm, considering a data priority and transmission delay time, is proposed to improve service quality of WBAN. The proposed algorithm operates by allocating a channel to a flow with longer transmission delay. When a packet, in a queue of herb, is left within a certain period, the packet is assigned a channel and transmitted according to a data priority. Through the comparison with other existing scheduling algorithms, it is confirmed that QoS is improved due to higher arrival probability of medical data and less delay time in the proposed algorithm.

• 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.

• International Journal of Computer Science & Network Security
• /
• v.22 no.10
• /
• pp.191-200
• /
• 2022

Constrained Application Protocol (CoAP) is a standardized protocol by the Internet Engineering Task Force (IETF) for the Internet of things (IoT). IoT devices have limited computation power, memory, and connectivity capabilities. One of the significant problems in IoT networks is congestion control. The CoAP standard has an exponential backoff congestion control mechanism, which may not be adequate for all IoT applications. Each IoT application would have different characteristics, requiring a novel algorithm to handle congestion in the IoT network. Unnecessary retransmissions, and packet collisions, caused due to lossy links and higher packet error rates, lead to congestion in the IoT network. This paper presents an adaptive congestion control protocol for CoAP, Adaptive Congestion Control with a Backoff algorithm (ACCB). AACB is an extension to our earlier protocol AdCoCoA. The proposed algorithm estimates RTT, RTTVAR, and RTO using dynamic factors instead of fixed values. Also, the backoff mechanism has dynamic factors to estimate the RTO value on retransmissions. This dynamic adaptation helps to improve CoAP performance and reduce retransmissions. The results show ACCB has significantly higher goodput (49.5%, 436.5%, 312.7%), packet delivery ratio (10.1%, 56%, 23.3%), and transmission rate (37.7%, 265%, 175.3%); compare to CoAP, CoCoA+ and AdCoCoA respectively in linear scenario. The results show ACCB has significantly higher goodput (60.5%, 482%,202.1%), packet delivery ratio (7.6%, 60.6%, 26%), and transmission rate (40.9%, 284%, 146.45%); compare to CoAP, CoCoA+ and AdCoCoA respectively in random walk scenario. ACCB has similar retransmission index compare to CoAp, CoCoA+ and AdCoCoA respectively in both the scenarios.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.82.2-82
• /
• 2001

In this paper, when we design and implement an internet-based teleoperation control, some important points that should be considered (e.g., transmission characteristics, time delay prediction and transmission protocol are inspected and simulated. First, we will investigate data transmission characteristics at the Internet, and build a model for the transmission delay and packet loss through the characteristics of that effect. And then, we inspect how to predict transmission delay, and examine transmission protocols which are proper for the control-oriented Internet protocol. Finally, we apply it to a force-reflective teleoperation control system that consists of a six d.o.f haptic interface and a five d.o.f manipulator via the Internet.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.4
• /
• pp.274-280
• /
• 2011

Due to their rapid growth and new paradigm applications, wireless sensor networks(WSNs) are morphing into low power personal area networks(LoWPANs), which are envisioned to grow radically. The fragmentation and reassembly of IP data packet is one of the most important function in the 6LoWPAN based communication between Internet and wireless sensor network. However, since the 6LoWPAN data unit size is 102 byte for IPv6 MTU size is 1200 byte, it increases the number of fragmentation and reassembly. In order to reduce the number of fragmentation and reassembly, this paper presents a new scheme that can be applicable to 6LoWPAN. When a fragmented packet header is constructed, we can have more space for data. This is because we use 8-bits routing table ill instead of 16-bits or 54-bits MAC address to decide the destination node. Analysis shows that our design has roughly 7% or 22% less transmission number of fragmented packets, depending on MAC address size(16-bits or 54-bits), compared with the previously proposed scheme in RFC4944. The reduced fragmented packet transmission means a low power consumption since the packet transmission is the very high power function in wireless sensor networks. Therefore the presented fragmented transmission scheme is well suited for low-power wireless sensor networks.

• ETRI Journal
• /
• v.26 no.6
• /
• pp.535-544
• /
• 2004

With video compression standards such as MPEG-4, a transmission error happens in a video-packet basis, rather than in a macroblock basis. In this context, we propose a semantic error prioritization method that determines the size of a video packet based on the importance of its contents. A video packet length is made to be short for an important area such as a facial area in order to reduce the possibility of error accumulation. To facilitate the semantic error prioritization, an efficient hardware algorithm for face tracking is proposed. The increase of hardware complexity is minimal because a motion estimation engine is efficiently re-used for face tracking. Experimental results demonstrate that the facial area is well protected with the proposed scheme.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.6 no.6
• /
• pp.513-520
• /
• 2005

High-speed Portable Internet system provides 1-3 Mbps data transmission speed to terminals moving up to 60 km/sec. Since High-speed Portable Internet system supports services requiring different QoS, it needs an efficient scheduling method based on those different QoSs. This paper shows the performance comparisons of several different packet scheduling schemes for minimizing the mean delay over the downlink of High-speed Portable Internet system to support the packet data service. Simulation results show that proposed scheme superior to other schemes at side throughput and data loss rate.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.145-162
• /
• 1997

This paper an analytical model for estimating packet waiting times at stations in the DQDB network, where the most upstream station is saturated. This model is useful in comparing the extreme unfairness which downstream stations experience due to their geographical locations in accessing the medium. Each station is modeled as an M/G/1, where the service time is defined to be the time a packet spends in the transmission buffer. The service time is decomposed into five components, and in turn, the first and second moment of each component are derived in three different modes of operation. Simulation experiments are presented for model validation and results are discussed.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.10
• /
• pp.1462-1470
• /
• 1989

This paper aims at investigating the Demand Assigned Multiple Access(DAMA) system for the packet-switched Satellite Communication. An onboard processor of the multisport beam satellite incorporates the ground controller to macimize the packet transmissions for each slot. 'Request Following' trnasmission mode is introduced as a transmission strategy of ground station under the control of its zone controller. The combined scheme of reservation channel access and contention channel access was proposed by Lee & Mark[3] for improving the Delay-Throughput performance. Our scheme provides less communication delay of approximately max. 200msec for achieving the corresponding throughput than the Lee & Mark's work does. Delay versus Throughput curves as well as Delay versus Traffic parameter curves are obtained. Numerical results obtained through the analysis and by the computer simulation show that the proposed scheme provides the low average packer delay even under the condition that the number of transponders (M)is below the half of the number of zones(N).