• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.205-215
• /
• 2002

In this paper the Dynamic Minislot Reservation Protocol(DMRP) in which the control channel is divided into contention-less and contention minislots in order to reduce re-transmission probability in multicasting is proposed. In the network, earth node has two pairs of transceivers. A transceiver consisting of a fixed transmitter and a fixed receiver is used to control packet registration and the other transceiver is used to transmit data. Two types f transceivers for data transmission are considered : one is FT-TR(Fixed Transmitter-Tunable Receiver) and the other is TT-TR(Tunable Transmitter-Tunable Receiver). In the analysis, FT-TR and TT-TR single-hop passive star networks are compared. As results, we conclude that the DMRP protocol with dynamically divided control channel has improved the system performance such as throughput and system delay regardless of traffic type or network structure.

• Journal of Internet Computing and Services
• /
• v.15 no.4
• /
• pp.1-8
• /
• 2014

In wireless body sensor system(WB-SNSs), unlike existing sensor network system, the size of device is small and amount of battery is considerably limited. And various channel environments can be made by link channel characteristic, human movements, sensor placements, transmission power control(TPC) algorithms and so on. In this paper, therefore we take diverse experiments with totally considerated environments to overcome these restrictions and to manage the energy efficiently and find the value of target received signal strength indicator(RSSI) based on diverse factors such as human movements, sensor placements, and TPC algorithms. And we conduct analysis in terms of energy consumption and packet delivery rate(PDR) based on the experimental results. Through these analysis, we compare and evaluate the efficiency according to setup values of Target RSSI and Target RSSI range suitable for wireless body sensor network system.

• Journal of Communications and Networks
• /
• v.11 no.5
• /
• pp.518-528
• /
• 2009

IEEE 802.11 wireless local area network (WLAN) has become the prevailing solution for wireless Internet access while transport control protocol (TCP) is the dominant transport-layer protocol in the Internet. It is known that, in an infrastructure-based WLAN with multiple stations carrying long-lived TCP flows, the number of TCP stations that are actively contending to access the wireless channel remains very small. Hence, the aggregate TCP throughput is basically independent of the total number of TCP stations. This phenomenon is due to the closed-loop nature of TCP flow control and the bottleneck downlink (i.e., access point-to-station) transmissions in infrastructure-based WLANs. In this paper, we develop a comprehensive analytical model to study TCP dynamics in infrastructure-based 802.11 WLANs. We calculate the average number of active TCP stations and the aggregate TCP throughput using our model for given total number of TCP stations and the maximum TCP receive window size. We find out that the default minimum contention window sizes specified in the standards (i.e., 31 and 15 for 802.11b and 802.11a, respectively) are not optimal in terms of TCP throughput maximization. Via ns-2 simulation, we verify the correctness of our analytical model and study the effects of some of the simplifying assumptions employed in the model. Simulation results show that our model is reasonably accurate, particularly when the wireline delay is small and/or the packet loss rate is low.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.2A
• /
• pp.191-197
• /
• 2008

For the efficient transmission of burst data in the time varying wireless channel, opportunistic scheduling is one of the important techniques to maximize multiuser diversity gain. In this paper, we propose a distributed opportunistic scheduling scheme for wireless LAN network. A proportional fair scheduling, which is one of the opportunistic scheduling schemes, is used for centralized networks, whereas we design distributed proportional fair scheduling (DPFS) scheme and medium access control with distributed manner. In the proposed DPFS scheme, each receiver estimates channel condition and calculates independently its own priority with probabilistic manner, which can reduce excessive probing overhead required to gather the channel conditions of all receivers. We evaluate the proposed DPFS using extensive simulation and simulation results show that DPFS obtains higher network throughput than conventional scheduling schemes and has a flexibility to control the fairness and throughput by controlling the system parameter.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.387-395
• /
• 2005

In this paper, we propose an end-to-end mobility management and TCP flow control scheme which considers different link characteristics for vertical handover environments. The end-to-end mobility management is performed by using SIP protocol. When a mobile node moves to a new network, it informs its movement of the correspondent node by sending SIP INFO message containing a new IP address which will be used in the new network. And then the corresponding node encapsulates all packets with the new IP address and sends them to the mobile node. in general, RTT of WLAN is shorter than RTT of cdma2000. when the MN moves from WLAN network to cdma2000 network, TCP retransmission timeout will be occurred in spite of non congestion situations. Thus, TCP congestion window size will be decreased and TCP throughput will be also decreased. To prevent this phenomenon, we propose a method using probe packets after handover to estimate a link delay of the new network. We also propose a method using bandwidth ratio of each network to update RTT. It is shown through NS-2 simulations that the proposed schemes can have better performance than the previous works.

• The KIPS Transactions:PartC
• /
• v.16C no.3
• /
• pp.407-416
• /
• 2009

Recently, various application services in wireless sensor networks are more considered than before, and thus reliable and secure communication of sensor network is turning out as one of essential issues. This paper studies such communication in IEEE 802.15.4 based sensor network. We present IMHRS (IEEE 802.15.4 MAC-based Hybrid hop-by-hop Reliability Scheme) employing EHHR (Enhanced Hop-by-Hop Reliability), which uses Hop-cache and Hop-ack and ALC (Adaptive Link Control), which considers link status and packet type. Also, by selecting security suite depending on network and application type, energy efficiency is considered based on HAS (Hybrid Adaptive Security) Framework. The presented schemes are evaluated by simulations and experiments. Besides, the prototype system is developed and tested to show the potential efficiency.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.437-447
• /
• 2003

In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection) algorithm. However, RED algorithm simple but does not protect traffic from high-bandwidth flows, which include not only flows that fail to use end-to-end congestion control such as UDP flow, but also short round-trip time TCP flows. In this paper, in order to solve this problem, we propose a simple fairness queue management scheme, called AFQM(Approximate Fair Queue Management) algorithm, that discriminate against the flows which submit more packets/sec than is allowed by their fair share. By doing this, the scheme aims to approximate the fair queueing policy Since it is a small overhead and easy to implement, AFQM algorithm controls unresponsive or misbehaving flows with a minimum overhead.

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

Transmission Control Protocol (TCP) [1] has been tuned as a reliable transfer protocol for traditional networks comprising wired links and stationary hosts with same link characteristics. TCP assumes that congestion in the network be a primary cause for packet losses and unusual delays. TCP performs welt over such networks adapting to end-to-end delays and congestion losses, by standard congestion control mechanisms, such as slow-start, congestion avoidance, fast retransmit and recovery. However, networks with wireless and other lossy links suffer from significant losses due to bit errors and handoffs. An asymmetry network such as ADSL has different bandwidth for both directions. As a result, TCP's standard mechanisms incur end-to-end performance degradation in various links. In this paper, we analyze the TCP problems in wireless, satellite, and asymmetry links, and measure the new TCP mechanisms that are recommended by IETF Performance Implications of Link Characteristics (PILC) WG[2], by using Network Simulator 2 (NS-2).

• Journal of KIISE
• /
• v.42 no.9
• /
• pp.1162-1174
• /
• 2015

These days, the networks have exhibited HBDP (High Bandwidth Delay Product) characteristics. The legacy TCP slowly increases the size of the congestion window and drastically decreases the size of a congestion window. The legacy TCP has been found to be unsuitable for HBDP networks. TCP mechanisms for solving the problems of the legacy TCP can be categorized into the loss-based TCP and the delay-based TCP. Most of the TCP mechanisms use the standard slow start phase, which leads to a heavy packet loss event caused by the overshoot. Also, in the case of congestion avoidance, the loss-based TCP has shown problems of wastage in terms of the bandwidth and RTT (Round Trip Time) fairness. The delay-based TCP has shown a slow increase in speed and low occupancy of the bandwidth. In this paper, we propose a new scheme for improving the over shoot, increasing the speed of the bandwidth and overcoming the bandwidth occupancy and RTT fairness issues. By monitoring the buffer condition in the bottleneck link, the proposed scheme does congestion control and solves problems of slow start and congestion avoidance. By evaluating performance, we prove that our proposed scheme offers better performance in HBDP networks compared to the previous TCP mechanisms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5179-5202
• /
• 2018

Transmission Control Protocol (TCP) is the most widely used protocol in the cloud data centers today. However, cloud data centers using TCP experience many issues as TCP was designed based on the assumption that it would primarily be used in Wide Area Networks (WANs). One of the major issues with TCP in the cloud data centers is the Incast issue. This issue arises because of the many-to-one communication pattern that commonly exists in the modern cloud data centers. In many-to-one communication pattern, multiple senders simultaneously send data to a single receiver. This causes packet loss at the switch buffer which results in TCP throughput collapse that leads to high Flow Completion Time (FCT). Recently, Software-Defined Networking (SDN) has been used by many researchers to mitigate the Incast issue. In this paper, a detailed survey of various SDN based solutions to the Incast issue is carried out. In this survey, various SDN based solutions are classified into four categories i.e. TCP Receive Window based solutions, Tuning TCP Parameters based solutions, Quick Recovery based solutions and Application Layer based solutions. All the solutions are critically evaluated in terms of their principles, advantages, and shortcomings. Another important feature of this survey is to compare various SDN based solutions with respect to different performance metrics e.g. maximum number of concurrent senders supported, calculation of delay at the controller etc. These performance metrics are important for deployment of any SDN based solution in modern cloud data centers. In addition, future research directions are also discussed in this survey that can be explored to design and develop better SDN based solutions to the Incast issue.