• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.1
• /
• pp.82-91
• /
• 2009

Routing (or path selection) is one of the key issues of multi-hop relay networks such as the IEEE 802.16j. Moreover, the allocation of appropriate resource such as bandwidth should not only be made in accordance with the paths selected, but the utilization of radio resource of an entire cell should also be maximized. Due to this interdependency between the problems of resource allocation and routing, it is desired these two problems are addressed simultaneously. In this paper, we propose a joint resource allocation and routing scheme for an OFDMA-based multi-hop cellular system. This scheme uses a polynomial time heuristic algorithm called Multi-Dimensional Multi-choice Knapsack Problem (MMKP) in order to find an approximate solution maximizing the total downlink throughput. In the simulation results, we show that the proposed scheme finds a sub-optimal solution which is superior to a link quality-based routing scheme, but slightly worse than the optimal solution.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.267-268
• /
• 2008

TD-SCDMA is considered as an innovative Chinese 3G technology adopted by the ITU for the IMT-2000 family. TD-SCDMA combines TDMA and CDMA components to provide more efficient use of radio resources. According to the traffic volume and activity level, the operation mode of a mobile terminal can change from one state to other states. This paper focuses on the problem of recovery delay from inactive states, and proposes a resource management algorithm, which holds some resources for rapid recovery of service after the service determines to release the dedicated resources.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.68-86
• /
• 2015

Future wireless network aims to integrate different radio access networks (RANs) to provide a seamless access and service continuity. In this paper, a new resource denotation method is proposed in the WLAN and LTE heterogeneous networks based on a concept of spectral bandwidth mapping. This method simplifies the denotation of system resources and makes it possible to calculate system residual capacity, upon which an economic model-based network selection algorithm is designed in both under-loaded and over-loaded scenarios in the heterogeneous networks. The simulation results show that this algorithm achieves better performance than the utility function-based access selection (UFAS) method proposed in [12] in increasing system capacity and system revenue, achieving load balancing and reducing the new call blocking probability in the heterogeneous networks.

• IE interfaces
• /
• v.21 no.2
• /
• pp.177-188
• /
• 2008

Recently, due to emerging technologies such as radio frequency identification(RFID), global positioning system(GPS), and wireless mobile communication technologies, it is possible to build up the infrastructure for tracking and tracing product logistics data at any place and at any time. However, for implementing the infrastructure, it is necessary to develop a suitable management method for product logistics data. To this end, this study deals with a resource description framework(RDF) based modeling and application method for product logistics data in the ubiquitous environment. It will give us the capability to control product logistics data, which leads to streamline logistics operations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1638-1653
• /
• 2014

A sequential optimization algorithm (SOA) for resource allocation in a cyclic-prefixed single-carrier cognitive relay system is proposed in this study. Both subcarrier pairing (SP) and power allocation are performed subject to a primary user interference constraint to minimize the mean squared error of frequency-domain equalization at the secondary destination receiver. Under uniform power allocation at the secondary source and optimal power allocation at the secondary relay, the ordered SP is proven to be asymptotically optimal in maximizing the matched filter bound on the signal-to-interference-plus-noise ratio. SOA implements the ordered SP before power allocation optimization by decoupling the ordered SP from the power allocation. Simulation results show that SOA can optimize resource allocation efficiently by significantly reducing complexity.

• ETRI Journal
• /
• v.19 no.3
• /
• pp.98-115
• /
• 1997

The architecture of the CDMA mobile system (CMS) is developed based on three function groups - service resource, service control, and service management groups. In this paper, the CMS architecture is discussed from the point of view of implementing these functions. The variable length packets are used for transmission. The synchronization clock signals are derived form the GPS receiver. The open loop and closed loop techniques are used for the power control. The internationally accepted signaling and network protocols are employed. The call control for the primary services in designed to provide efficient mobile telecommunication services. The softer handoff is implemented in one card. The mobile assisted handoff and the network assisted handoff are employed in the soft and hard handoffs. The authentication is based on the secret data which includes random numbers. The management functions, which include the location management, resource management, cell boundary management and OAM management, are implemented to warrant the system efficiency, maximum capacity and high reliability. The architecture ensures that the CMS is flexible and expandable to provide subscribers with economic and efficient system configuration. The dynamic power control, adaptive channel allocation. and dynamic cell boundary management are recommended for future work.

• ETRI Journal
• /
• v.42 no.6
• /
• pp.846-858
• /
• 2020

The non-orthogonal multiple access (NOMA) technique offers throughput improvement to meet the demands of the future generation of wireless communication networks. The objective of this work is to further improve the throughput by including an underlay cognitive radio network with an existing multi-carrier NOMA network, using cooperative communication. The throughput is maximized by optimal resource allocation, namely, power allocation, subcarrier assignment, relay selection, user pairing, and subcarrier pairing. Optimal power allocation to the primary and secondary users is accomplished in a way that target rate constraints of the primary users are not affected. The throughput maximization is a combinatorial optimization problem, and the computational complexity increases as the number of users and/or subcarriers in the network increases. To this end, to reduce the computational complexity, a dynamic network resource allocation algorithm is proposed for combinatorial optimization. The simulation results show that the proposed network improves the throughput.

• ETRI Journal
• /
• v.24 no.3
• /
• pp.251-254
• /
• 2002

We developed a method for optimal superframe design in the multi-frequency time division multiple access (MF-TDMA) return-link of a satellite multimedia interactive network called a digital video broadcasting return channel over satellite (DVB-RCS) sub-network. To find the optimal superframe pattern with the maximum data throughput, we formulated the design problem as a non-linear combinatorial optimization problem. We also devised the proposed simple method so that it would have field applicability for improving radio resource utilization in the MF-TDMA return link.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1721-1723
• /
• 2002

In 3rd-generation mobile communication systems providing packet service, optimal scheduling algorithms we needed to increase service efficiency. In this paper, three scheduling algorithms (SP, EDF, and RPQ) which have been studied in the field of computer networks are applied with transmit power constraint to an interference-limited CDMA system, proving to be efficient.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.373-373
• /
• 2004