• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.7
• /
• pp.1394-1399
• /
• 2007

In this paper we propose a Hybrid MAC(HMAC) to enhance the transmission throughput in Wireless Sensor Networks(WSNs). In the proposed HMAC, sender nodes send transmission request packets to the receiver nodes using CSMA/CA MAC protocol. And the receiver node assigns slots according to the network topology and the amount of traffics using TDMA. Using HMAC we get the enhanced throughput by lowering the duplicated slot assignment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7B
• /
• pp.642-651
• /
• 2006

In ad-hoc network, the most of existing packet scheduling schemes provides throughput-based fairness. To provide throughput-based fairness, it basically supposes that the channel capacity is fixed. But, the supposing that the channel capacity is fixed is not appropriate because IEEE 802.11b and 802.11g which are normally used for organizing ad-hoc network can provide various data rate according to channel conditions. So, we define time-based fairness for each flow to consider multi-rate and suggest the MRADPS reaching the defined time-based fairness. Simulation result shows that MRADPS improves the total network throughput in ad-hoc network with providing time-based fairness to each flow.

• The Journal of the Korea Contents Association
• /
• v.11 no.2
• /
• pp.69-78
• /
• 2011

Recently, the bandwidth available to an end user has been dramatically increasing with the advancing of network technologies. This high-speed network naturally requires faster and/or stable data transmission techniques. The UDT(UDP based Data Transfer protocol) is a UDP based transport protocol, and shows more efficient throughput than TCP in the long RTT environment, with benefit of rate control for a SYN time. With a NAK event, however, it is difficult to expect an optimum performance due to the increase of fixed sendInterval and the flow control based on the previous RTT. This paper proposes a rate control method on following a NAK, by adjusting the sendInterval according to some degree of RTT period which calculated from a set of experimental results. In addition, it suggests an improved flow control method based on the TCP vegas, in order to predict the network congestion afterward. An experimental results show that the revised flow control method improves UDT's throughput about 20Mbps. With combining the rate control and flow control proposed, the UDT throughput can be improved up to 26Mbps in average.

• Journal of Computing Science and Engineering
• /
• v.8 no.2
• /
• pp.107-118
• /
• 2014

One interesting problem regarding wireless local area network (WLAN) ad-hoc networks is the effective mitigation of hidden nodes. The WLAN standard IEEE 802.11 provides request to send/clear to send (RTS/CTS) as mitigation for the hidden node problem; however, this causes the exposed node problem. The first 802.11 standard provided only two transmission rates, 1 and 2 Mbps, and control frames, such as RTS/CTS assumed to be sent at 1 Mbps. The 802.11 standard has been enhanced several times since then and now it supports multi-rate transmission up to 65 Mbps in the currently popular 802.11n (20 MHz channel, single stream with long guard interval). As a result, the difference in transmission rates and coverages between the data frame and control frame can be very large. However adjusting the RTS/CTS transmission rate to optimize network throughput has not been well investigated. In this paper, we propose a method to decrease the number of exposed nodes by increasing the RTS transmission rate to decrease RTS coverage. Our proposed method, Asymmetric Range by Multi-Rate Control (ARMRC), can decrease or even completely eliminate exposed nodes and improve the entire network throughput. Experimental results by simulation show that the network throughput in the proposed method is higher by 20% to 50% under certain conditions, and the proposed method is found to be effective in equalizing dispersion of throughput among nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8B
• /
• pp.839-845
• /
• 2009

The Vehicular Ad-hoc Network (VANET) has two main problems to be overcome due to high mobility and frequently changing density: one is short link duration time and the other is high packet loss ratio. To solve the problems, there have been many studies to predict vehicular mobility. Most of the studies try to enhance link expire time and link reliability, however the distance between two relay nodes becomes too short to have high network throughput. In this paper, we propose a new routing algorithm that considers both link expire time and network throughput in the VANET. The proposed algorithm aims to find path with long link expire time and high throughput. Our simulation results show that the proposed algorithm outperforms the legacy greedy algorithm and its variants.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.10
• /
• pp.1290-1300
• /
• 2016

Recently, various middle box services have been developed and applied to provide network functions to end nodes of the network. Especially, network virtualization is increasingly proceeding by applying the virtualization technologies of cloud computing field to network field, and network platforms for various flexible services are being developed to connect among the virtual network devices. Carrier-grade Network Address Translation (CGNAT) is also one of these flexible network services. This paper designs and implements the DPDK-based CGNAT framework that provides flexibility and maximizes address translation throughput. Our framework achieves 15.5 times higher throughput than the address translation service by Linux kernel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7A
• /
• pp.611-619
• /
• 2005

The present paper proposes two different packet scheduling algorithms in the IEEE 802.16e type TDD-OFDMA downlink, which are the weighted fair scheduling(WFS) and the throughput guarantee scheduling(TGS). The performance of proposed scheduling algorithms are compared to some of conventional schedulers such as round robin(RR), proportional fair(PF), fast fair throughput(FFTH), and fair throughput(FH) in terms of service coverage, effective throughput and fairness at 64 kbps and 128 kbps minimum user throughput requirements. For a relatively smaller throughput(64 kbps) requirement, the proposed algorithms provide higher improvement in the number of users per sector within 95$\%$ service coverage while satisfying the lxEV-DV fairness criterion. For a relatively larger throughput(128 kbps) requirement, the proposed algorithms provide higher coverage enhancement while maintaining the same effective aggregate throughput over PF scheduler.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.2
• /
• pp.33-40
• /
• 2008

Streaming video has become a popular form of transferring media over the wired/wireless network. TCP-friendly rate control (TFRC) is used as a streaming media transport protocol. Using the TCP congestion response function and current network conditions, TFRC adjusts its sending rate to yield the maximum TCP-friendly throughput. Since TFRC was designed for applications that would prefer to maintain a slowly-changing sending rate, it is less responsive to changes in handover between wireless heterogeneous networks such as 3G network, WLAN, and so on. This paper shows a new TFRC method for vertical handover over wireless heterogeneous network. The proposed TFRC method has features of low quality interruption and fast rate adaptation to a new target network. The simulation results show that the proposed one provides better QoS and throughput support than the traditional TFRC scheme during vertical handover.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.9
• /
• pp.734-740
• /
• 2012

In this paper, we propose a method for throughput improvement in multirate multihop wireless networks with intra-session network coding. A multirate transmission supports several rates so that it has a tradeoff between transmission rate and transmission range, therefore multirate can cope with the performance degradation. We present the rate selection method with intra-session network coding in multirate nodes. The effective transmission rate is calculated by using intra-session network coding, and then its maximum effective transmission rate is selected. Concurrent transmission set is determined by selected transmission rate and then the linear programming is formulated for throughput calculation in multihop wireless networks. We evaluate the performance by using MATLAB and lp_solve programs in two topologies. It is shown that the throughput of the proposed method is improved.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.3
• /
• pp.1-10
• /
• 1996

In this paper, the problem of simultaneously allocating servers and loadings of stations in a class of manufacturing systems modelled as network of queues is considered. The throughput function of the closed network of queues is demonstrated as a Schur convex function of server allocation, that is, increasing the server allocation vector under majorization increases the performance in the ship in terms of the throughput. It also reduces the congestion in the open network of queues in terms of reducing the total number of jobs in the sense of likelihood ratio ordering. These are the extentions of the numerical results of Green and Guha (1995) in the service system with independent M/M/c systems to the network of queues. The results can be used to support production planning in certain manufacturing systems.