• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.1
• /
• pp.110-122
• /
• 1993

When voice is transmitted through packet switching network, there needs a overload control, that is, a control for the congestion which lasts short periods and occurrs in local extents. In this thesis, we analyzed the performance of the statistical packet voice multiplexer using the overload control strategy by bit dropping. We assume that the voice is coded accordng to (4,2) embedded ADPCM and that the voice packet is generated and transmitted according to the procedures in the CCITT recomendation G. 764. For the performance analysis, we must model the superposed packet arrival process to the multiplexer as exactly as possible. It is well known that interarrival times of the packets are highly correlated and for this reason MMPP is more suited for the modelling in the viewpoint of accuracy. Hence the packet arrival process in modeled as MMPP and the matrix geometric method is used for the performance analysis. Performance analysis is similar to the MMPP IG II queueing system. But the overload control makes the service time distribution G dependent on system status or queue length in the multiplexer. Through the performance analysis we derived the probability generating function for the queue length and using this we derived the mean and standard deviation of the queue length and waiting time. The numerical results are verified through the simulation and the results show that the values embedded in the departure times and that in the arbitrary times are almost the same. Results also show bit dropping reduces the mean and the variation of the queue length and those of the waiting time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.11
• /
• pp.5354-5369
• /
• 2019

Sensor networks are deployed in unheeded environment to monitor the situation. In view of the unheeded environment and by the nature of their communication channel sensor nodes are vulnerable to various attacks most commonly malicious packet dropping attacks namely blackhole, grayhole attack and sinkhole attack. In each of these attacks, the attackers capture the sensor nodes to inject fake details, to deceive other sensor nodes and to interrupt the network traffic by packet dropping. In all such attacks, the compromised node advertises itself with fake routing facts to draw its neighbor traffic and to plunge the data packets. False routing advertisement play vital role in deceiving genuine node in network. In this paper, behavior based routing misbehavior detection (BRMD) is designed in wireless sensor networks to detect false advertiser node in the network. Herein the sensor nodes are monitored by its neighbor. The node which attracts more neighbor traffic by fake routing advertisement and involves the malicious activities such as packet dropping, selective packet dropping and tampering data are detected by its various behaviors and isolated from the network. To estimate the effectiveness of the proposed technique, Network Simulator 2.34 is used. In addition packet delivery ratio, throughput and end-to-end delay of BRMD are compared with other existing routing protocols and as a consequence it is shown that BRMD performs better. The outcome also demonstrates that BRMD yields lesser false positive (less than 6%) and false negative (less than 4%) encountered in various attack detection.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4B
• /
• pp.255-269
• /
• 2006

The differentiated services(DiffServ) architecture provides packet level service differentiation through the simple and predefined Per-Hop Behaviors(PHBs). The Assured Forwarding(AF) PHB proposed as the assured services uses the RED-in/out(RIO) approach to ensusre the expected capacity specified by the service profile. However, the AF PHB fails to give good QoS and fairness to the TCP flows. This is because OUT(out- of-profile) packet droppings at the RIO buffer are unfair and sporadic during only network congestion while the TCP's congestion control algorithm works with a different round trip time(RTT). In this paper, we propose an Adaptive Regulating Drop(ARD) marker, as a novel dropping strategy at the ingressive edge router, to improve TCP fairness in assured services without a decrease in the link utilization. To drop packets pertinently, the ARD marker adaptively changes a Temporary Permitted Rate(TPR) for aggregate TCP flows. To reduce the excessive use of greedy TCP flows by notifying droppings of their IN packets constantly to them without a decrease in the link utilization, according to the TPR, the ARD marker performs random early fair remarking and dropping of their excessive IN packets at the aggregate flow level. Thus, the throughput of a TCP flow no more depends on only the sporadic and unfair OUT packet droppings at the RIO buffer in the core router. Then, the ARD marker regulates the packet transmission rate of each TCP flow to the contract rate by increasing TCP fairness, without a decrease in the link utilization.

• Journal of Information Processing Systems
• /
• v.15 no.1
• /
• pp.203-216
• /
• 2019

The nature of wireless transmission has made wireless sensor networks defenseless against various attacks. This paper presents warning message counter method (WMC) to detect blackhole attack, grayhole attack and sinkhole attack in wireless sensor networks. The objective of these attackers are, to draw the nearby network traffic by false routing information and disrupt the network operation through dropping all the received packets (blackhole attack), selectively dropping the received packets (grayhole and sinkhole attack) and modifying the content of the packet (sinkhole attack). We have also attempted light weighted symmetric key cryptography to find data modification by the sinkhole node. Simulation results shows that, WMC detects sinkhole attack, blackhole attack and grayhole attack with less false positive 8% and less false negative 6%.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.11
• /
• pp.1-8
• /
• 2001

Adaptive and Strict Packet Dropping mechanism we proposed in this paper drops adaptively packets for the congestion control, as predicting traffic pattern between each cycle. Therefore the proposed mechanism makes up for the drawback of RIO mechanism and minimizes the wastes of the bandwidth being capable of predicting in Dynamic and Strict Packet Dropping (DSPD) mechanism. And we executed a simulation and analyzed the throughput and packet drop rate based on the Sending Drop Precedence changing dynamically depending on the network traffic and compared RIO and the DSPD. The results show that the proposed mechanism provides better performance on drop precedence levels and stricter drop precedence policy for AF class than RIO and the DSPD mechanism.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.221-226
• /
• 2002

Cycling Packet Dropping mechanism we proposed in this paper adaptively drops packets, as predicting traffic pattern between each cycle. Therfore the proposed mechanism makes up for the drawback of RIO mechanism and minimizes errors being capable of predicting in Dynamic and Strict Packet Dropping mechanism. And we executed a simulation and analyzed the throughput and packet drop rate based on the Sending Drop Precedence changing dynamically depending on the network traffic. The results show that the proposed mechanism provides better performance on drop precedence levels and stricter drop precedence policy for AF class.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.2
• /
• pp.59-68
• /
• 2002

In this paper, we compared and analyzed two new models of cyclic packet dropping algorithm, Adaptive Cyclic Packet Dropping algorithm (ACPD), and Non-adaptive Cyclic Packet Dropping algorithm (NCPD) with RIO. The ACPD algorithm drops adaptively packets for the congestion control, as predicting traffic pattern between each cycle. Therefore the ACPD algorithm makes up for the drawback of RIO algorithm and minimizes the wastes of the bandwidth being capable of predicting in the NCPD algorithm. We modelled two cyclic packet drop algorithms and executed a simulation and analyzed the throughput and packet drop rate based on Sending Priority changing dynamically depending on network traffic. In this algorithm, applying the strict drop precedence policy, we get better performance on priority levels. The results show that two new algorithms may provide more efficient and stricter drop precedence policy as compared to RIO independent of traffic load. The ACPD algorithm can provide better performance on priority levels and keep stricter drop policy than other algorithms.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.473-480
• /
• 2002

Although many researches on IDS (Intrusion Detection System) have been performed, the most of them are limited to the algorithm of detection software. However, even an IDS with superior algorithm can not detect intrusion, if it loses packets which nay have a clue of intrusions. In this paper, we suggest an efficient wav to improve the performance of IDS by reducing packet losses occurred due to hardware limitation and abundant processing overhead introduced by massive detection software itself. The reduction in packet losses is achieved by dropping hacking-free packets. The result shows that this decrease of packet losses leads an IDS to improve the detection rate of real attack.

• Journal of information and communication convergence engineering
• /
• v.8 no.5
• /
• pp.513-518
• /
• 2010

This paper proposes a medium access control protocol for integrated voice and data services in slotted CDMA systems. The proposed protocol, which is named as RCSSMA (Reservation Code and Status Sensing Multiple Access), adopts a code reservation and status sensing schemes. RCSSMA protocol gives higher access priority to the voice traffic than data traffic for reducing the packet dropping probability. The voice terminal reserves an available spreading code to transmit voice packets during a talkspurt, whereas the data terminal transmits a packet over one of the available spreading codes that are not reserved by the voice terminals. In this protocol, the voice packets never contend with the data packets. Packet dropping probability and average data packet transmission delay are analyzed using a Markov chain model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2A
• /
• pp.187-194
• /
• 2004

We propose priority-based reservation code multiple access (P-RCMA) which can enhance voice traffic quality of the previous RCMA. The proposed protocol maintains two power levels and consider traffic characteristics in contending shared available codes to transmit packets. P-RCMA gives priority to the voice request packets rather than data packets by capture effect at the receiver part of base station. We show numerical results from EPA (equilibrium point analysis) analysis and simulation study in terms of voice packet dropping probability and average data packet transmission delay.