• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.4
• /
• pp.246-251
• /
• 2013

In this paper, it is proposed a bandwidth allocation Scheme based on Bankruptcy theory in Distributed Mobile Multimedia Network. The proposed scheme is guaranteed a minimum allocation. So, the minimum quality of each service are guaranteed. Therefore efficient and fairness network can be configured. The performance evaluation results indicate that the proposed scheme has good performance than other existing schemes by the fairness index and the Erlang blocking formular calculation. The minimum bandwidth of the proposed scheme can be applied to other techniques of a priority based bandwidth allocation scheme and dynamic bandwidth allocation scheme.

• ETRI Journal
• /
• v.25 no.4
• /
• pp.211-218
• /
• 2003

This paper presents a dynamic resource allocation algorithm with multi-frequency time-division multiple access for the return link of interactive satellite multimedia networks such as digital video broadcasting return channel via satellite systems. The proposed timeslot assignment algorithm, called the very efficient dynamic timeslot assignment (VEDTA) algorithm, gives an optimal assignment plan within a very short period. The optimality and computational efficiency of this algorithm demonstrate that it will be useful in field applications.

• Journal of Communications and Networks
• /
• v.11 no.2
• /
• pp.157-165
• /
• 2009

In this paper, we investigate a dynamic spectrum sharing problem for the centralized uplink cognitive radio networks using orthogonal frequency division multiple access. We formulate a large-scale joint rate and power allocation as an optimization problem under quality of service constraint for secondary users and interference constraint for primary users. We also suggest admission control to nd a feasible solution to the optimization problem. To implement the resource allocation on a large-scale, we introduce a notion of using the conservative factors $\alpha$ and $\beta$ depending on the outage and violation probabilities. Since estimating instantaneous channel gains is costly and requires high complexity, the proposed algorithm pursues a practical and implementation-friendly resource allocation. Simulation results demonstrate that the large-scale joint rate and power allocation incurs a slight loss in system throughput over the instantaneous one, but it achieves lower complexity with less sensitivity to variations in shadowing statistics.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.63-72
• /
• 2011

Broadcast-based data dissemination has become a widely accepted approach of communication in the mobile computing environment. However, with a large set of data items, the expected delay of receiving a desired data increases due to the sequential nature of the broadcast channel. With the objective of minimizing this wait time, this paper explores the problem of data broadcast over multiple channels. In traditional approaches, data items are partitioned based on their access probabilities and allocated on multiple channels, assuming flat data scheduling per channel. If the data items allocated on the same channel are broadcast in different frequencies based on their access probabilities, the performance will be enhanced further. In this respect, this paper proposes a new broadcast scheduling scheme named two level dynamic programming(TLDP) which can reflect a variation of access probabilities among data items allocated on the same channel.

• Journal of Communications and Networks
• /
• v.14 no.1
• /
• pp.51-62
• /
• 2012

The exponential growth in wireless services has resulted in an overly crowded spectrum. The current state of spectrum allocation indicates that most usable frequencies have already been occupied. This makes one pessimistic about the feasibility of integrating emerging wireless services such as large-scale sensor networks into the existing communication infrastructure. Cognitive radio is an emerging dynamic spectrum access technology that can be used for flexibly and efficiently achieving open spectrum sharing. Cognitive radio is an intelligent wireless communication system that is aware of its radio environment and that is capable of adapting its operation to statistical variations of the radio frequency. In ad hoc cognitive radio networks, a common control channel (CCC) is usually used for supporting transmission coordination and spectrum-related information exchange. Determining a CCC in distributed networks is a challenging research issue because the spectrum availability at each ad hoc node is quite different and dynamic due to the interference between and coexistence of primary users. In this paper, we propose a novel CCC selection protocol that is implemented in a distributed way according to the appearance patterns of primary systems and connectivity among nodes. The proposed protocol minimizes the possibility of CCC disruption by primary user activities and maximizes node connectivity when the control channel is set up. It also facilitates adaptive recovery of the control channel when the primary user is detected on that channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2A
• /
• pp.110-118
• /
• 2006

In part-I of the paper, two sub-channel structures, either contiguous or distributed, were considered. Modeling the SNR distribution over a sub-channel as Ricean in general, the statistical chracteristics were investigated. In this part of the paper, we develop a generalized two step channel/resource allocation algorithm, which incorporates the two statistical measurements, and analyze the spectral efficiency of OFDMA in terms of average frequency utilization for the two sub-channel structures. In OFDMA with distributed structure, the key design parameter would be the sub-channel bandwidth. To give an insight into the impact on this parameter, we show in the numerical results the frequency utilization as a function of sub-channel bandwidth normalized to coherence bandwidth. As confirmed by numerical results, for contiguous sub-channel structure, we obtain the nominal multiuser diversity gain when the sub-channel bandwidth is smaller than the coherence bandwidth and lose the gain as it is getting larger.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.1
• /
• pp.18-22
• /
• 2003

The new realtime applications like multimedia and realtime services in a wireless network will be dramatically increased. However, many realtime services of mobile hosts in a cell cannot be continued because of insufficiency of useful channels. Conventional channel assignment approaches didn't properly consider the problem to serve realtime applications in a cell. This paper proposes a new realtime channel assignment algorithm based on time constraint analysis of channel requests. The proposed algorithm dynamically borrows available channels from neighboring cells. It also supports a smooth handoff which continuously serves realtime applications of the mobile hosts.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.691-708
• /
• 2010

An important issue of supporting multi-users with diverse quality-of-service (QoS) requirements over wireless networks is how to optimize the systematic scheduling by intelligently utilizing the available network resource while, at the same time, to meet each communication service QoS requirement. In this work, we study the problem of a variety of communication services over multi-media heterogeneous cognitive OFDM system. We first divide the communication services into two parts. Multimedia applications such as broadband voice transmission and real-time video streaming are very delay-sensitive (DS) and need guaranteed throughput. On the other side, services like file transmission and email service are relatively delay tolerant (DT) so varying-rate transmission is acceptable. Then, we formulate the scheduling as a convex optimization problem, and propose low complexity distributed solutions by jointly considering channel assignment, bit allocation, and power allocation. Unlike prior works that do not care computational complexity. Furthermore, we propose the FAASA (Fairness Assured Adaptive Sub-carrier Allocation) algorithm for both DS and DT users, which is a dynamic sub-carrier allocation algorithm in order to maximize throughput while taking into account fairness. We provide extensive simulation results which demonstrate the effectiveness of our proposed schemes.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.2940-2947
• /
• 2000

In the wireless ATM networks, a Medium Access Control (MAC) protocol is required to support an integrated mix of multimedia traffic services. The MAC protocol should be designed in a way that the limited wireless bandwidth can be efficiently utilized maximizing the Quality of Service (QoS) guarantees for various traffic service classes. In this paper, a Dynamic Resource Allocation-based MAC protocol, which satisfies QoS of each traffic service class in the wireless ATM environment, is proposed. The proposed MAC protocol adopts the dynamic channel allocation schemes for a mix of different traffic service classes. The suggested MAC protocol is designed to provide the QoS guarantees for Constant Bit Rate (CBR) or real-time Variable Bit Rate (VBR) traffic through fixed or dynamic reservation. For Available Bit Rate (ABH) traffic, which has the lowest priority among the traffic classes, large improvement in delay by reserving the minimum bandwidth is shown. And for real-time VBR traffic, increase in throughput of transmission is demonstrated because of bandwidth, which is allocated through contention at the initial phase and without contention thereafter.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1A
• /
• pp.24-33
• /
• 2007

In this paper, two different dynamic cell coordination strategies for frequency flat and selective fading are proposed for efficient subcarrier allocation in the joint consideration of adaptive modulation and variable frequency reuse in the channel-aware OFDMA downlink multicellular environment. Compared to a conventional OFDMA system without cell coordination, where system throughput may become degraded due to the persistent interference from other cells, the proposed system dynamically allows RNC to apply different reuse factors on each subchannel and scheduling in consideration of channel and interference conditions of individual users so as to increase the system throughput and guarantee QoS of each user. In a frequency flat fading, the dynamic scheme with the proposed scheduling achieves on average three times larger throughput than the conventional dynamic scheme [8]. In a selective fading channel, the proposed schemes showed 2.6 times as large throughput as that of a single reuse factor of one for all subchannels.