• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1601-1607
• /
• 1999

LMDS(Local Multipoint Distribution Service) is a broadband wireless transmission system in millimeter wave frequency. LMDS system is consisted with relay system to connect between head-end and hub and distribution system to connect between hub and subscribers. In this study, we develop point-to-point relay system to use back-bone system n LMDS network. We develop STM-1 transceiver over 27GHz and analyze the system performance. We can get the similar measurement results comparing the theoretical results and then prove that this system can fit LMDS back-bone network requirement. This is the first system in Korea and we expect this system can apply the various network.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.5
• /
• pp.25-32
• /
• 2010

This paper evaluates the outage probability of cognitive relay networks with cooperation between secondary users based on the underlay approach, when multiple primary receivers coexist with secondary users. Using an appropriate relay selection criterion in cognitive radio networks, we derive the outage probability of secondary user. It is shown that the outage probability increases as the number of primary receivers increases and we quantify the increase. Through the simulation results, we verify that the performance of relaying transmission is varied more sensitively compared to that of direct transmission as the number of primary receivers increases. In addition, the relaying transmission can be less efficient than the direct transmission when multiple primary receiver exist but it can be more efficient than the direct transmission by increasing the relay selection diversity.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.8
• /
• pp.638-651
• /
• 2000

When the bandwidth resources in a packet-switched network are shared among sessions by MAX-MIN flow control each session is required to transmit its data into the network subject to the MAX-MIN fair rate which is solely determined by network loadings. This passive behavior of sessions if fact can cause seri-ous QoS(Quality of Service) degradation particularly for real-time multimedia sessions such as video since the rate allocated by the network can mismatch with what is demanded by each session for its QoS. In order to alleviate this problem we extend the concept of MAX-MIN fair bandwidth allocations as follows: Individual bandwidth demands are guaranteed if the network can accommodate them and only the residual network band-width is shared in the MAX-MIN fair sense. On the other hand if sum of the individual bandwidth demands exceeds the network capacity the shortage of the bandwidth is shared by all the sessions by reducing each bandwidth guarantee by the MAX-MIN fair division of the shortage. we present a novel flow control algorithm to achieve this extended MAX-MIN fairness and show that this algorithm can be implemented by the existing ATM ABR service protocol with minor changes. We not only analyze the steady state asymptotic stability and convergence rate of the algorithm by appealing to control theories but also verify its practical performance through simulations in a variety of network scenarios.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.12
• /
• pp.1125-1134
• /
• 2013

Small cells such as pico or femto cells are promising as a solution to cope with higher traffic explosion and the large number of users. However, the users within small cells are likely to suffer severe inter-cell interference (ICI) from neighboring base stations (BSs). To tackle this, several papers suggest BS transmit power on/off control algorithms which increase edge user throughput. However, these algorithms require centralized coordinator and have high computational complexity. This paper makes a contribution towards presenting fully distributed and low complex joint BS on/off control and user scheduling algorithm (FDA) by selecting on/off pattern of BSs. Throughput the extensive simulations, we verify the performance of our algorithm as follows: (i) Our FDA provides better throughput performance of cell edge users by 170% than the algorithm without the ICI management. (ii) Our FDA catches up with the performance of optimal algorithm by 88-96% in geometric average throughput and sufficiently small gap in edge user throughput.

• Journal of KIISE:Information Networking
• /
• v.29 no.5
• /
• pp.553-561
• /
• 2002

We present a novel service discipline, called linear service discipline, to serve multiple QoS queues sharing a resource and analyze its properties. The linear server makes the output traffic and the queueing dynamics of individual queues as a linear function of its input traffic. In particular, if input traffic is Gaussian, the distributions of queue length and output traffic are also Gaussian with their mean and variance being a function of input mean and input power spectrum (equivalently, autocorrelation function of input). Important QoS measures including buffer overflow probability and queueing delay distribution are also expressed as a function of input mean and input power spectrum. This study explores a new direction for network-wide traffic management based on linear system theories by letting us view the queueing process at each node as a linear filter.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6A
• /
• pp.839-847
• /
• 2000

A digital subscriber line(DSL) has been introduced recently in home and abroad to deliver high speed Internet access services with the large channel and the sheer number of subscribers. It has been processed to standardize the DSL in our country, but the analysis on the DSL is limited to the field trials. Therefore, in this paper we have proposed the techniques related to analysis on the performances of DSL, and estimated its S/N and BER performances. In particular, the channel capacity gained from S/N values was compared with the field trial results in Japn and it was known that the results from this study was proved to be valid. Also, the S/N performance of DSL is degraded due to only Gaussian noise, and BER performance degraded greatly with both the higher frequency and the longer distance. However, results of this analysis can be used as the basic data in specifying the standardization of DSL in the future.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6A
• /
• pp.609-616
• /
• 2011

The Delay/Disruption Tolerant Network (DTN) is a network designed to operate effectively using the mobility and storage of intermediate nodes under no end-to-end guaranteed network. This new network paradigm is well-suited for networks which have unstable path and long latencies (e.g. interplanetary network, vehicular network). In this paper, we first found that each taxi has its own regularly visiting area and define this property as spatial regularity. We analyze 4000 taxi trace data in Shanghai and show the existence of spatial regularity experimentally. Based on a spatial regularity in urban environment, we present a new DTN routing method. We introduce a Weighted Center (WC) which represents spatial regularity of each node. Through the association with evenly distributed access points (APs) in urban environment, most of vehicles get their grid locations and calculate their WCs. Since our routing method only uses neighbors' WCs for building routing paths, it can be regarded as distributed and practical protocols. Our experiments involving realistic network scenarios created by the traces of about 1500 Shanghai taxies show that our routing method achieves the higher performance compared to ECT, LET by 10%~110%.