• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.204-206
• /
• 2009

Opportunistic scheduling is one of the important techniques to maximize multiuser diversity gain. In this paper, we propose a distributed opportunistic scheduling scheme for ad-hoc network. In the proposed distributed scheduling 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 scheduling using extensive simulation and simulation results show that proposed scheduling obtains higher network throughput than conventional scheduling schemes and has a flexibility to control the fairness and throughput by controlling the system parameter.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.12
• /
• pp.2262-2264
• /
• 2007

In this paper, we propose a distributed opportunistic scheduling scheme for wireless LAN network. Proportional fair scheduling is one of the opportunistic scheduling schemes and used for centralized networks, whereas we design distributed proportional fair scheduling (DPFS). 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 up to 23% higher throughput than conventional scheduling schemes and has a flexibility to control the fairness and throughput by controlling the system parameter.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.117-120
• /
• 2000

As the use of real-time multimedia applications increases, a considerable amount of “greedy” UDP traffic would easily dominate network bandwidth and packet loss. As a result, bandwidth available to TCP connections is oppressed and their performance extremely deteriorates. In or-der that both TCP and UDP sessions fairly co-exist in the Internet, it is vital that we consider the fairness among both protocols. In this work, we implement a “TCP-friendly” rate control mechanism suitable to video applications and con-sider its applicability to a real system through observation of the video quality at the receiver and the connection state. It is shown that we can achieve high-quality and stable video transfer fairly sharing the network bandwidth with TCP by applying our rate control at a control interval of 32 times as long as RTT.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.2
• /
• pp.452-458
• /
• 2014

In Wireless Sensor Networks the Medium access control (MAC) protocol has many challenges to solve such as reducing energy consumption, supporting QoS(quality of service) fairness, and reducing delivery delay. This paper proposed a low-delay supporting MAC protocol in multi-hop Wireless Sensor Networks. The proposed protocol uses the RB(rapid beacon) frame for reducing delivery delay. The RB frame is a modified IEEE 802.15.4 beacon frame. For sender adaptive-wakeup, the RB frame includes a seed number for determining of a receiver wakeup time. And for next hop receiver adaptive-wakeup, the RB frame includes the length of remaining data packet information. Results showed that our LD-MAC protocol outperformed other protocol in terms of data packet delivery delay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2323-2340
• /
• 2012

Recent advances in cognitive radio technology have drawn immense attention to higher layer protocols above medium access control, such as transmission control protocol (TCP). Most proposals to improve the TCP performance in cognitive radio (CR) networks have assumed that either all nodes are in CR networks or the TCP sender side is in CR links. In those proposals, lower layer information such as the CR link status could be easily exploited to adjust the congestion window and improve throughput. In this paper, we consider a TCP network in which the TCP sender is located remotely over the Internet while the TCP receiver is connected by a CR link. This topology is more realistic than the earlier proposals, but the lower layer information cannot be exploited. Under this assumption, we propose an enhanced TCP protocol for CR networks called TCP for cognitive radio (TCP-CR) to improve the existing TCP by (1) detection of primary user (PU) interference by a remote sender without support from lower layers, (2) delayed congestion control (DCC) based on PU detection when the retransmission timeout (RTO) expires, and (3) exploitation of two separate scales of the congestion window adapted for PU activity. Performance evaluation demonstrated that the proposed TCP-CR achieves up to 255% improvement of the end-to-end throughput. Furthermore, we verified that the proposed TCP does not deteriorate the fairness of existing TCP flows and does not cause congestions.

• Journal of KIISE:Information Networking
• /
• v.36 no.6
• /
• pp.492-504
• /
• 2009

The delivery of multimedia that efficiently adapts its bit-rate to changing network characteristics and conditions is one of the important challenging tasks in the design of today's real-time multimedia streaming systems such as IPTV, Mobile IPTV and so on. In these work, the primary focus is on network congestion, to improve network stability and inter-protocol fairness. However, these existing works have problems which do not support QoE (Quality of Experience), because they did not consider essential characteristics of contents playback such as the media continuity. In this paper, we propose a novel rate control scheme for improving the QoE of multimedia streaming service in the Internet congestion, called NCAR (Network and Client-Aware Rate control), which is based on network-aware congestion control and client-aware flow control scheme. Network-aware congestion control of the NCAR offers an improving reliability and fairness of multimedia streaming, and reduces the rate oscillation as well as keeping high link utilization. Client-aware flow control of NCAR offers a removing the media discontinuity and a suitable receiver buffer allocation, and provides a good combination of low playback delay. Simulation results demonstrate the effectiveness of our proposed schemes.

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

In this paper, we consider a WDM based metro ring connecting broadband access networks by using FT-TR (Fixed Transmitter-Tunable Receiver) type access nodes and a new MAC protocol for fair transmission is proposed. The basic channel access scheme is CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance) and the transferred optical slot is changed to be empty slot by SS(Source-Stripping) which drops a packet from ring-rotated slot. This empty slot can be either used to send head-of-line packet in buffer or transmitted to next access node. In former cases, there is the improvement of network throughput, but latter case leads unfairness problem of transmission. Thus the proposed MAC protocol exploits the advantages form tow cases. It gives downstream access nodes chance to use empty slots and limits the unconditional usage of empty slots at upstream access nodes with probability as called p-Persistent MAC protocol. We use a numerical analysis to evaluate bandwidth efficiency and maximum node throughput and compares simulation results in terms of node throughput, fairness factor, transfer delay depending on probability. Under two different FT-TR type architectures for metro ring network the proposed MAC protocol is evaluated and compared.

• Journal of KIISE
• /
• v.43 no.2
• /
• pp.246-255
• /
• 2016

The orthogonal frequency-division multiple access (OFDMA) systems are well suited to multi-rate multicast transmission, as they allow flexible resource allocation across both frequency and time, and provide adaptive modulation and coding schemes. Unlike layered video coding, the multiple description coding (MDC) enables flexible decomposition of the raw video stream into two or more substreams. The quality of the video stream is expected to be roughly proportional to data rate sustained by the receiver. This paper describes a mathematical model of resource allocation and throughput in the multi-rate video multicast for the OFDMA wireless and mobile networks. The impact on mean opinion score (MOS), as a measurement of user-perceived quality (by employing a variety of scheduling disciplines) is discussed in terms of utility maximization and proportional fairness. We propose a pruning algorithm to ensure a minimum video quality even for a subset of users at the resource limitation, and show the optimal number of substreams and their rates can sustain.

• 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.