• Journal of KIISE:Software and Applications
• /
• v.26 no.9
• /
• pp.1085-1094
• /
• 1999

이동 분산 환경에서는 무선 데이타 전송 기법을 통하여 사용자들에게 다양한 정보들을 전달하게 된다. 본 논문은 균등 무선 데이타 방송 환경에서, 빠른 시간에 방송데이타를 접근할 수 있는 방법에 대하여 기술한다. 이를 위하여 무선 방송 데이타의 스케쥴링 문제를 정의하고, 어떤 질의가 접근하는 데이타들의 응집 정도를 나타내는 `질의 거리(Query Distance: QD)'라는 측정 기준을 제시한다. 제안한 질의 거리를 사용하여 각 질의의 우선 순위에 따라 해당 질의가 접근하는 데이타 집합을 방송 스케쥴에 추가하면서 스케쥴을 구성하는 데이타 스케쥴링 기법을 제시한다. 데이타 집합의 스케쥴 구성 과정에서 우선 순위가 높은 질의의 질의 거리를 최소화하면서 낮은 우선 순위 질의들의 질의 거리를 줄이는 스케쥴 확장 규칙들을 사용한다. 예를 이용하여 제안하는 방법에 대하여 설명한 후, 실험을 통해 제안한 방법의 성능을 평가한다.Abstract In mobile distributed systems the data on the air can be accessed by a lot of clients. This paper describes the way clients access the broadcast data in short latency in uniform wireless broadcasting environment. We define the problem of wireless data scheduling and propose a measure, named Query Distance(QD), which represents the coherence degree of data set accessed by a query. By using the measure, we give a data scheduling method that constructs the broadcast schedule by appending each query's data set in greedy way. When constructing the schedule, we use schedule expansion rules that reduce the QD's of lower-frequency queries while minimizing the QD's of the higher-frequency ones. With the use of examples we illustrate the mechanism of the proposed method and we test the performance of our method.

• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.285-296
• /
• 2005

In mobile distributed systems the data on the air can be accessed by a lot of mobile clients. And, we need an indexing scheme in order to energy-efficiently access the data on the wireless broadcast stream. In conventional indexing schemes, they use the values of primary key attributes and construct tree-structured index. Therefore, the conventional indexing schemes do not support content-based retrieval queries such as partial-match queries. In this paper we propose an indexing scheme, called B2V-Tree, which supports partial match queries on wireless broadcast data stream. For this purpose, we construct a tree-structured index which is composed of bit-vectors, where the bit-vectors are generated from data records through multi-attribute hashing.

• Journal of Advanced Navigation Technology
• /
• v.21 no.4
• /
• pp.359-364
• /
• 2017

Since the existing analog village broadcasting system has some technical problems in applying and degradations in performance due to its old equipments, it had been required recently to be changed to a wireless digital system and to develop the standardization. However, it is important to analyze the interference between villages in deploying the efficient digital wireless village broadcasting system. In this paper, simulations for co-channel and adjacent channel interference have been carried out considering digital private mobile radio(dPMR) and digital mobile radio(DMR) systems as a representative mobile radio. These results for frequency reuse and channel separation drawn from the separation distance between villages in co-channel interference and the frequency offset in adjacent interference can be helpful to establish a standard and the testing service in the near future.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.3
• /
• pp.327-331
• /
• 2010

The 21.4-22.0GHz frequency band is used to broadcast satellite services in Region 1 and Region 3 in frequency distribution area. The use of this frequency band is according to the provision of the resolution 525 of WRC-03, this frequency band broadcasting service system transmits broadband radio-frequency signals. The trend of the Satellite launching plans for an using this frequency band is growing in worldwide. This frequency band requires fairly more transmit power than the Ku-band because of the rain attenuation of this frequency band is very extreme. An appropriable sharing criteria is required for this broadcast service to be operational.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.404-415
• /
• 2002

In this paper, we address the issue of ensuring consistency of multiple data items requested in a certain order by read-only transactions in a wireless data broadcast environment. To handle the inherent property in a data broadcast environment that data can only be accessed strictly sequential by users, we explore a predeclaration-based query optimization and devise two practical transaction processing methods in the context of local caching. We also evaluate the performance of the proposed methods by an analytical study Evaluation results show that the predeclaration technique we introduce reduces response time significantly and adapts to dynamic changes in workload.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.7
• /
• pp.1308-1313
• /
• 2008

Neighbor knowledge in wireless ad hoc networks provides important functionality for a number of protocols. The neighbor knowledge is acquired via Hello packets. Hello packets are periodically broadcasted by the nodes which want to advertise their existence. Usage of periodic Hello packet, however, is a big burden on the wireless ad hoc networks. This paper deals with an approach where each node acquires neighbor knowledge by observing not only Hello packets but also broadcasting packets. Analysis and computer simulation results show that the method using broadcast packets offers significant improvement over the method using Hello packet only. When the required hello packet transmission interval and the average broadcasting interval are equal, the overhead reduction is about 42%.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.2
• /
• pp.19-24
• /
• 2010

This paper analyzes potential interference effect of DTV service on Radio Microphone in adjacent channel. For analysis, we assume that DTV operates on CH 51(692 MHz ~ 698 MHz) and radio microphone operates on CH 52 (698 MHz ~ 704 MHz) according to the Korea Communications Commission policy. Minimum Coupling Loss(MCL) method is used to determine the required protection distance and Monte Carlo method is used to determine guard band to meet interference probability of 0 % below. In conclusions, protection distance of 1.71 km and guard band of 2.4 MHz are required for indoor and protection distance of 18.86 km and guard band of 5.7 MHz are required for outdoor.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.209-216
• /
• 2011

For Effective and systematic response to disasters, needs of broadband multimedia services in wireless communication of PPDR(public protection and disaster relief) is increasing gradually. Recently in Korea, by the digital television transition, Korea Communications Commission is considering whether the freed spectrum can assign additional spectrum of PPDR or not. In this paper, we were defined the input parameters, were estimated the spectrum of requirements for Korean wireless communication of PPDR based on M.1390 methodology recommended by ITU-R.

• The KIPS Transactions:PartC
• /
• v.19C no.3
• /
• pp.209-214
• /
• 2012

Time synchronization is important role in a network, especially in Wireless Sensor Network (WSN) which is required for time-critical applications such as surveillance, tracking, data fusion and scheduling. Time synchronization in WSN should meet the other different requirements than the one in other networks because WSN has critical resource constraints, especially power consumption. This paper presents a new time synchronization scheme for WSN, which is energy efficient by reducing communication overhead. Simulation test shows this new scheme has better energy efficiency and performance of accuracy than existing schemes proposed previously.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.145-150
• /
• 2010

In this paper, the performance of cognitive radio network is analyzed in terms of Erlang capacity. To improve the Erlang capacity with respect to primary user (PU) and secondary user (SU) traffic, we propose an efficient radio resource management scheme utilizing the buffer for new SUs and interrupted SUs. Markov model is developed, and analyzed to derive the performances of the proposed spectrum sharing scheme in both primary system and secondary system. To determine the Erlang capacity region, the blocking probability, the forced termination probability and the non-completion probability are calculated. Simulation results provide insight into the advantages of the buffer utilization. It is observed that the supportable traffic loads of PU and SU can be increased significantly according to the buffer length.