• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.263-272
• /
• 2008

Recently, WiBro has been developed to efficiently support real-time broadcasting with wireless system. MBS (Multicast Broadcast Service) based on WiBro has numerous applications such as DMB. Since the current MBS uses only common channel managed by scheduling, it cannot effectively support many users at the same time. This paper proposes a new counting scheme with which the channel mode can be properly switched between common channel and dedicated channel. It thus allows efficient use of limited radio resource in WiBro for the MBS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4C
• /
• pp.364-370
• /
• 2010

In this paper, we propose a cooperative channel sensing scheme in the presence of feedback errors. Accurate local sensing results may not directly be applied to cooperative sensing due to feedback errors. We consider the cooperative channel sensing that utilizes local sensing results in good feedback channel condition. Finally, simulation results show that the proposed scheme can maximize the detection probability while guaranteeing desired false alarm probability.

• Journal of Communications and Networks
• /
• v.6 no.2
• /
• pp.173-181
• /
• 2004

This paper shows a technique for regulating the rate emitted by UWB mobile terminals. This technique is designed to adapt the emission rate to the effects of channel capacity variations. We assume that individual flows are shaped at edge routers by means of dual leaky buckets. The proposal is based on the evaluation of certain parameters, which reflect the channel status, sent to the application layer. This information is generated by the scheduler designed to guarantee appropriate channel sharing for the various traffic components. We describe some results which highlight how performance depends on the specific operating conditions, as well as on the traffic descriptors of the flows, their reciprocal difference, and performance requirements.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.113-116
• /
• 2001

In this paper, a new multicasting scheduling is proposed for WDM single-hop broadcast network. The main idea of traditional multicast scheduling algorithms is partitioning the multicast group into several subgroups to reduce the delay time after receiving previous message. Those partitioning algorithms are grouping method of receivers already tuned to transmitters wavelength. However, multicast scheduling shows better performance by considering the previous status of receivers. Thus, in this paper, a new subgrouping method is proposed to minimize delay through collecting the current status of receivers. This method is operated by using the tunable transceiver in WDM single hop broadcasting network and uses fixed control channel for collecting the status of receivers. In addition, we analyzed the performance of proposed method through the computer simulation and then compared with existing multicast scheduling algorithm.

• Journal of Communications and Networks
• /
• v.16 no.1
• /
• pp.1-9
• /
• 2014

Block diagonalization (BD) has been proposed as a simple and effective technique in multiuser multiple-input multiple-output (MU-MIMO) broadcast channels. However, when channel state information (CSI) knowledge is limited at the transmitter, the performance of the BD may be degraded because inter-user interference cannot be completely eliminated. In this paper, we propose an efficient CSI quantization technique for BD precoded systems with limited feedback where users supported by a base station are selected by dynamic scheduling. First, we express the received signal-to-interference-plus-noise ratio (SINR) when multiple data streams are transmitted to the user, and derive a lower bound expression of the expected received SINR at each user. Then, based on this measure, each user determines its quantized CSI feedback information which maximizes the derived expected SINR, which comprises both the channel direction and the amplitude information. From simulations, we confirm that the proposed SINR-based channel quantization scheme achieves a significant sum rate gain over the conventional method in practical MU-MIMO systems.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.12
• /
• pp.630-640
• /
• 2007

As the range of sensor network's applicability is getting wider, it creates new application areas which is required real-time operation, such as military and detection of radioactivity. However, existing researches are focused on effective management for resources, existing sensor network operating system cannot support to real-time areas. In this paper, we propose the ${\mu}TMO$ model which is lightweight real-time distributed object model TMO. We design the real-time sensor network operation system ${\mu}TMO-NanoQ+$ which is based on ETRI's sensor network operation system Nano-Q+. We modify the Nano-Q+'s timer module to support high resolution and apply Context Switch Threshold, Power Aware scheduling techniques to realize lightweight scheduler which is based on EDF. We also implement channel based communication way ITC-Channel and periodic thread management module WTMT.

• Journal of Advanced Navigation Technology
• /
• v.17 no.4
• /
• pp.435-441
• /
• 2013

This paper proposes a neural net based-predictive connection admission control (CAC) scheme for multiclass users in wireless cognitive radio networks. We classifies cognitive users(cu) into real and non real time services, and then permit only real time services to reserve the demanded resource for spectrum handoff in guard channel for provisioning the desired QoS. Neural net is employed to predict primary user's arrival on time and demanded channels. Resource scheduling scheme is based on $C_IA$(cognitive user I complete access) shown in this paper. For keeping primary users from interference, the CAC is performed on only cognitive user not primary user. Simulation results show that our schemes can guarantee the desired QoS by cognitive real time services.

• Journal of KIISE:Databases
• /
• v.37 no.2
• /
• pp.121-126
• /
• 2010

This paper proposes an efficient index scheduling technique for kNN query processing in multiple wireless broadcast channel environment. Previous works have to wait for the next cycle if the required child nodes of the same parent node are allocated in the same time slot on multiple channel. Our proposed method computes the access frequencies of each node of R tree at the server before the generation of the R-tree index broadcast schedule. If they have high frequencies, we allocate them serially on the single channel. If they have low frequencies, we allocate them in parallel on the multiple channels. As a result, we can reduce the index node access conflicts and the long broadcast cycle. The performance evaluation shows that our scheme gives the better performance than the existing schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2A
• /
• pp.186-195
• /
• 2010

For the fast target base station channel decision in WiMAX networks, fast group scanning scheme was suggested, in which mobile stations in proximity of each other form a group and scan the candidate channels dispersively. However, the previous group scanning scheme does not consider the different QoS requirements of each MS in a group. In this paper we propose the enhanced group scanning scheme, so-called QoS-aware group scan scheduling scheme, that makes mobile stations in a group scan the candidate channels without deteriorating the QoS requirements. We introduce the QoS-aware channel scanning concept of a individual mobile station and show the different scanning latencies due to the different QoS requirements. With the help of the efficient channel allocation by the serving BS, in the proposed scanning scheme, a mobile station with relatively higher QoS in a group scans less amount of candidate channels than the others with relatively lower QoS, while the mobile stations in a group still guarantees the fast target base station decision. The performance results show that our proposed scanning scheme results in the fast target base station decision while considering the QoS requirements of each MS.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1521-1529
• /
• 2009

There is a serious unfairness problem between upstream and downstream flows of AP in IEEE 802.11 Wireless LAN. This problem is because Wireless LAN's DCF MAC protocol provides AP with equal channel access priority to mobile noded. Also, it makes this problem worse that the TCP's Data segment loss is more effective on throughput than the TCP's ACK segment. In this paper, we first make several simulations to analysis the unfairness in the various point of view and to find reasons of the unfairness. Also, this paper presents AP's scheduling scheme to alleviate the unfairness problem and evaluate the scheme through ns2 simulator.