• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.570-577
• /
• 2018

With the increasing number of network nodes, traditional client/server node selection mechanisms are under tremendous pressure. In order to select efficient cooperative nodes in a highly dynamic P2P network topology, this article uses greedy algorithm to translate the overall optimization into multiple local optimal problems, and to quickly select service nodes. Therefore, the service node with the largest comprehensive capacity is selected to reduce the transmission delay and improve the throughput of the service node. The final simulation results show that the node selection strategy based on greedy algorithm can effectively improve the overall performance of P2P streaming media system.

• Journal of information and communication convergence engineering
• /
• v.12 no.4
• /
• pp.199-207
• /
• 2014

A new cooperative MAC protocol called the busy tone cooperative medium access control (BT-COMAC) protocol is proposed to overcome the drawbacks and maximize the advantages of existing schemes. This scheme uses a new metric called decibel power to decide an appropriate helper node. Using received power strength is more efficient in selecting an appropriate helper node, especially in a densely populated network, than the effective transmission rates used in conventional schemes. All communication nodes in a communication service area are assumed to move independently. Two performance metrics are used: System throughput and channel access delay. A performance evaluation of the BT-COMAC protocol is conducted using a computer simulation over a slow fading wireless channel, and its performance results are compared with those of four existing schemes. The numerical results show that the BT-COMAC protocol improves the system throughput by approximately 15% as compared to the best existing scheme.

• Journal of Korea Multimedia Society
• /
• v.6 no.5
• /
• pp.831-841
• /
• 2003

In wireless ATM network, Mobile terminals must offer function and QoS such as terminal of wire ATM network. The fast notification of BS (Base Station) scheduler about ATM cells arriving in mobile terminals is a critical item of the ATM-based centrally controlled MAC protocol. But, Collision is arisen at process that several mobile terminals require data transmission by contention method through uplink and because of re-transmission by collision, throughput of decrease and transmission delay increases. In this paper, We propose the MAC protocol that decide optimized request mini-slot's number considering number of request terminal predicted as statistical and its posterior throughput. According to simulation result, could know that proposed protocol shows high performance delay and throughput.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.302-305
• /
• 2003

3GPP RLC protocol specification adopted an error control scheme based on selective repeat ARQ. In the 3GPP ARQ, distinctive windows are provided at transmitting and receiving stations so that those stations are prohibited to send or receive data PDU's out of window. An increase in window size enhances delay performance. Such an increase, however, raises the occupancy at re-ordering buffer, which results in a long re-ordering time. Aiming at suppressing the occupancy at re-ordering buffer, we propose partial go back N scheme in this paper In the partial go back N scheme, the receiving station regards all data PDU's between the first (lowest sequence numbered) error-detected PDU and last (highest sequence numbered) error-detected PDU. By the employment of the partial go back N scheme, the occupancy at the re-ordering buffer is apparently reduced, while the delay and throughput performance may be degraded due to the remaining properties of go back N. We thus consider peak occupancy of re-ordering buffer, mean sojourn time at re-ordering buffer, mean delay time, and maximum throughput as measures to evaluate tile proposed scheme and investigate such performance by using a simulation method. From numerical examples, we observe a trade-off among performance measures and conclude that the partial go back N scheme is able to effectively reduce the occupancy of re-ordering buffer.

• Journal of KIISE:Information Networking
• /
• v.34 no.3
• /
• pp.203-217
• /
• 2007

In this paper, a performance evaluation model of Networks with the multiple-buffered crossbar switches is proposed and examined. Buffered switch technique is well known to solve the data collision problem of the switch networks. The characteristic of a network with crossbar switches is determined by both the connection pattern of the switches and the limitation of data flow in a each switch. In this thesis, the evaluation models of three different networks : Multistage interconnection network, Fat-tree network, and other ordinary communication network are developed. The proposed evaluation model is developed by investigating the transfer patterns of data packets in a switch with output-buffers. Two important parameters of the network performance, throughput and delay, are evaluated. The proposed model takes simple and primitive switch networks, i.e., no flow control and drop packet, to demonstrate analysis procedures clearly. It, however, can not only be applied to any other complicate modern switch networks that have intelligent flow control but also estimate the performance of any size networks with multiple-buffered switches. To validate the proposed analysis model, the simulation is carried out on the various sizes of networks that uses the multiple buffered crossbar switches. It is shown that both the analysis and the simulation results match closely. It is also observed that the increasing rate of Normalized Throughput is reduced and the Network Delay is getting bigger as the buffer size increased.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.2
• /
• pp.264-270
• /
• 2006

In this paper we verified that the window based TCP performance of throughput can be improved by the traffic connection efficiency. and have studied the performance of traffic congestion control that is controlling transmission rate. In wireless network, the bidirectional node is run by estimating the usage rate of link of error control idle and the throughput is shown by transmitting segments. The throughput rate shows almost no delay due to the bidirectional traffic connection efficiency up to the allowable point as increasing the transport rate by the critical value, depending on the size of end-to-end node queue of the increase of transport rate. This paper reports the performance improvement as the number of feedback connection traffic congestion control increases because of the increase of the number of asynchronous transport TCP connections.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.2
• /
• pp.95-108
• /
• 1999

The CDMA mobile system consists of several subsystems and each subsystem has many processing elements that handle voice messages and control messages for performing CDMA call processing functions through CDMA Interconnection Network(CIN). For assuring a high throughput and a short delay in the CIN, an efficient medium access control protocol should be provided. In this paper, we propose a new access control protocol of CIN for providing real time communications in CDMA mobile system. Also, we evaluate the delay performance of the proposed access control protocol and compare it with that of the existing access control protocol. Through a set of numerical examples, we show that our proposed protocol provides a better delay performance than the existing protocol.

• Journal of Communications and Networks
• /
• v.11 no.4
• /
• pp.406-415
• /
• 2009

In this work, we consider performance modeling of a wireless sensor network with a time division multiple access (TDMA) media access protocol with slot reuse. It is assumed that all the nodes are peers of each other and they have two modes of operation, active and sleep modes. We model the sensor network as a Jackson network with unreliable nodes with on and off states. Active and sleep modes of sensor nodes are modeled with on and off states of unreliable nodes. We determine the joint distribution of the sensor node queue lengths in the network. From this result, we derive the probability distribution of the number of active nodes and blocking probability of node activation. Then, we present the mean packet delay, average sleep period of a node and the network throughput. We present numerical results as well as simulation results to verify the analysis. Finally, we discuss how the derived results may be used in the design of sensor networks.

• Journal of Advanced Information Technology and Convergence
• /
• v.9 no.1
• /
• pp.11-24
• /
• 2019

This paper investigates the performance comparison of a Terahertz (THz) communications for a single-carrier and a multi-carrier single antenna point-to-point communication system. The multi-carrier system and single carrier system consider the orthogonal frequency division multiplexing (OFDM) and the minimum mean square error linear equalizer (MMSE-LE), respectively. We compare the frame-error-rate (FER) and throughput performance of both the systems for a THz communication environment with the carrier frequency of 300GHz and the tapped delay line (TDL) channel models described in 3GPP. It is observed from the simulation results that the OFDM systems outperform the MMSE-LE for various configurations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.10
• /
• pp.2237-2246
• /
• 2010

In this paper, the performance of a RCO-MAC protocol is evaluated using a different traffic model. Data frames are assumed to generate based on an exponential distribution from one source node and then directly to be stored into the input buffer in the source node. System throughput, average access delay and average system delay are used as a performance measure. Performance evaluation is carried out by the computer simulation. Numerical results show that the RCO-MAC scheme offers 18% higher system throughput than the rDCF scheme. In addition, the numerical results show that the RCO-MAC protocol also offers the better average system delay under any traffic load than that by the rDCF scheme, which was not obtained in the previous research due to the saturated traffic model.