• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.9
• /
• pp.751-764
• /
• 2013

In cognitive radio ad-hoc networks, common control channel overload and packet collisions are occured due to indiscriminate broadcasting of control packets. So that the path reliability is reduced and control channel is easily saturated. In this paper, we propose a new routing algorithm considering the probability of appearance of primary user and channel status of neighbor nodes. When the source node needs to transmit a data packet to the destination, it performs route discovery process by exchanging control messages using a control channel in ADOV CR Ad-hoc networks. If any intermediate node doesn't have common data channel with previous node to transmit data, it doesn't rebroadcast control packet. And if it has common data channels with previous node, each node determines channel contribution factor with the number of common channels. Based on the channel contribution factor, each node performs different back-off broadcasting. In addition, each node controls control packet flooding by applying to proposed advanced mode using such as number of available channels and channel stability. With the proposed method, the number of control packets to find the data transmission path and the probability of collision among control packets can be decreased. While the path reliability can be increased. Through simulation, we show that our proposed algorithm reduces packet collisions in comparison with the traditional algorithm.

• The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
• /
• v.3 no.2
• /
• pp.22-29
• /
• 1992

In recent years there has been increased interest in a class of multiple-access techniques known as code division multiple-access(CDMA). As the trend for ever increasing data transmission rate and high error performance continues while conserving bandwidth, the needs arise for good highrate R=b/v convolu- tional codes such as punctured codes. In this paper, the packet error propability has been analyzed in code division multiple-access packet radio system which utilize punctured convolutional code and hard-decision Viterbi decoding.

• Journal of Korea Game Society
• /
• v.2 no.1
• /
• pp.23-29
• /
• 2002

Multicast protocols are efficient methods of group communication such as video conference, Internet broadcasting and On-Line Game, but they do not support the various transmission protocol services like a reliability guarantee, FTP, or Telnet that TCPs do. The Purpose or this Paper is to find a method to utilize multicast routers can simultaneously transport multicast packets and TCP packets. For multicast network scalability and error recovery the existing SRM(Scalable Reliable Multicast)method has been used. Three packets per TCP transmission control window site are used for transport and an ACK is used for flow control. A CBR(Constant Bit Rate) and a SRM is used for UDP traffic control. Divided on whether a UDP multicast packet and TCP unicast packet is used simultaneously or only a UDP multicast packet transport is used, the multicast receiver with the longest delay is measured on the number of packets and its data receiving rate. It can be seen that the UDP packet and the TCP's IP packet can be simultaneously used in a server router.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.2
• /
• pp.29-40
• /
• 2005

In this research, we propose packet scheduling algorithm considering different QoS characteristics of real-time traffic and non-real-time traffic in the next generation wireless communication system serving the multimedia traffic and a new efficient framing method cooperated with this packet scheduler. When the selected traffic classes of the selected users are transmitted, our proposed framing method can increase the number of serviced traffic classes by mixing the many different traffic classes within one frame considering data rate decided by the allocated AMC (Adaptive Modulation and Coding) option. Using this proposed method, the fairness among the traffic classes can be achieved and the system performance for total throughput and delay can be enhanced. Simulations are performed to analyze the performance of the proposed framing method. Our proposed packet scheduler and framing method will be applied to the next generation multimedia wireless communication system serving many traffic classes.

• Proceedings of the Korea Technology Innovation Society Conference
• /
• 2001.11a
• /
• pp.3-17
• /
• 2001

In this paper, we compare the market performances under circuit pricing whereby users are charged based on their length of usage time and under packet pricing whereby users are charged based on the amount of information received. We show that, if packet pricing is introduced, the market price rises contrary to the government's expectation but that the overall social welfare is unambiguously increased because packet pricing reflects the social cost properly while circuit pricing does not. Also, we show that, if delivery of multi-media files requires a much higher speed, a move to packet pricing lowers the price of multi-media transmission, thereby increasing the usage of multimedia data in the absence of congestion, which may not be the case in the presence of congestion.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.12
• /
• pp.2448-2457
• /
• 1994

CCITT recommendation X.25 and X.75 have been applied to the PSPDN environment for data communication of packet switching. They have also been used for packet switching in the ISDN exchanges since about the year 1980. This paper presents the throughput of the TDX-10 packet handler as simulating the performance based on memory management and flow control of the resource management algorithm designed originally.

• Journal of Korean Institute of Industrial Engineers
• /
• v.40 no.1
• /
• pp.135-139
• /
• 2014

In a connection-oriented packet switching network, the data communication starts after a virtual circuit is established between source and destination. The virtual circuit establishment time includes the queue waiting times in the direction from source to destination and the other way around. We use this two-way queueing delay to evaluate scheduling policies of a packet switching processor through simulation studies. In this letter, we also suggest user testing functions for the packet switching processor to manage virtual circuits. By detecting error causes, the user testing helps the packet switching processor provide reliable connection-oriented services.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.89-96
• /
• 2002

Handoff is one of the most important factors that ma? degrade the performance of TCP connections in wireless data networks. In this paper, we present a lossless and duplication free handoff scheme called LPM (Last Packet Marking) for improving Cellular If semisoft handoff. LPM signals the safe handoff cue by sending a specially marked packet to mobile hosts. SPM (Semisoft rePly Message) is the only newly introduced control packet. Our performance study shows that LPM achieves lossless packet delivery without duplication and increases TCP throughput significantly.

• Journal of Ocean Engineering and Technology
• /
• v.28 no.6
• /
• pp.552-559
• /
• 2014

In general, the number of underwater transient signals is very limited for research on automatic recognition. Data-dependent feature extraction is one of the most effective methods in this case. Therefore, we suggest WPCC (Wavelet packet ceptsral coefficient) as a feature extraction method. A wavelet packet best tree for each data set is formed using an entropy-based cost function. Then, every terminal node of the best trees is counted to build a common wavelet best tree. It corresponds to flexible and non-uniform filter bank reflecting characteristics for the data set. A GMM (Gaussian mixture model) is used to classify five classes of underwater transient data sets. The error rate of the WPCC is compared using MFCC (Mel-frequency ceptsral coefficients). The error rates of WPCC-db20, db40, and MFCC are 0.4%, 0%, and 0.4%, respectively, when the training data consist of six out of the nine pieces of data in each class. However, WPCC-db20 and db40 show rates of 2.98% and 1.20%, respectively, while MFCC shows a rate of 7.14% when the training data consists of only three pieces. This shows that WPCC is less sensitive to the number of training data pieces than MFCC. Thus, it could be a more appropriate method for underwater transient recognition. These results may be helpful to develop an automatic recognition system for an underwater transient signal.

• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.68-75
• /
• 2000

In this paper, a media access control protocol is proposed for voice/data integrated services in the packet CDMA network, and the performance of the proposed protocol is analyzed. The proposed protocol uses the spreading code sensing and the reservation schemes. This protocol gives higher priority to the delay-sensitive voice traffic than to the data traffic. A voice terminal can reserve an available spreading code during a talkspurt to transmit multiple voice packets. On the other hand, whenever a data packet is generated, the data terminal transmits the packet through one of the available spreading codes that are not used by the voice terminals. In this protocol, the voice packets do not come into collision with the data packets. The numerical results show that this protocol can increase the maximum number of voice terminals. The performance for the data traffic degrades by increasing the voice traffic load because of the low priority. But it shows that the data traffic performance can be increased in proportion to the number of spreading codes.