• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.5
• /
• pp.61-69
• /
• 2021

On-demand broadcast is an effective data dissemination technique in mobile computing environments. This paper explores the issues for scheduling multi-data queries in on-demand broadcast environments, and proposes a new broadcast scheduling scheme named CASS. The proposed scheme prioritizes queries by reflecting the characteristics of multi-data queries, and selects the data that has not been broadcast in the query for the longest time as the broadcast data according to the query priority. Simulation is performed to evaluate the performance of CASS. The simulation results show that the proposed scheme outperforms other schemes in terms of the average response time since it can show highly desirable characteristics in the aspects of query data adjacency and data conflict rate.

• International journal of advanced smart convergence
• /
• v.9 no.2
• /
• pp.164-172
• /
• 2020

The interest and importance of the convergence services for healthcare expand more and more as the average life expectancy increases. Convergence of ICT and healthcare technology unfold efficient and quick health services. Recently, healthcare services provide to clients with apps over web. On-demand wireless data broadcast supports any number of clients to access their desired data items dynamically by responding the needs for data items from the clients. In this paper, we propose an on-demand system to broadcast FHIR bundles for efficient healthcare services. We use time-parameterized replacing policy for renewing the bundle items on the wireless broadcast channel. The policy lets the on-demand broadcasting dynamic by controlling the time duration for the bundles to reside over the wireless channel. With simulation studies using an implemented testbed, we evaluate the performances of the proposed system in access time and tuning time. For evaluation, we compare the time-parameterized replacing policy of the proposed system with regular-number replacing policy. The proposed time-parameterized replacing policy shows shorter access time than the regular-number replacing policy because the policy responds more actively and dynamically to the change of the needs of the clients for FHIR bundles.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.394-404
• /
• 2005

Battery capacity of mobile clients in wireless mobile computing environments is one of the important resources that determine the availability of mobile clients. So, data broadcast techniques in mobile computing environments need not only rapid delivery of requested data but also efficient data delivery mechanisms which can reduce battery consumption of mobile clients. This paper proposes organization of an index and broadcast data for on-demand data broadcast. It organizes an index containing broadcast time of each data using some of high-priority data in a broadcast server. By sending such index information prior to the corresponding data, the proposed approach reduces tuning time of mobile clients. It also includes when the next index information will be broadcasted in each data broadcast. This can reduce tuning time of mobile clients waiting for an index to be broadcasted. Experiments show that the proposed approach effectively reduces tuning time of mobile clients.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.691-693
• /
• 2004

Mobile Ad hoc network은 stationary infrastructure의 도움 없이 이동 노드들이 필요 시 multi-hop wireless links network 형태를 구성하여 통신이 이루어지게 하는 network이다. 따라서 효율적인 라우팅 프로토콜의 개발이 중요한 issue인데 최근에는 routing overhead가 적은 on-demand 프로토콜이 주목을 받고 있다. On-demand 프로토콜은 새로운 route을 구성하기 위해서 query packet을 broadcasting하게 되는데, 특히 노드들의 mobility가 많은 mobile ad hoc network(MANET)의 경우에는 더욱더 자주 발생하게 되는데, blind broadcasting은 neighbor 노드들 간의 radio transmission region overlap에 의해 redundancy, contention, collision 같은 broadcast storm 문제를 발생시키게 된다. 본 논문은 on-demand 프로토콜의 broadcast storm 문제를 해결하기 위해 Neighbor Topology을 고려 한 Dynamic Adaptation Query flooding scheme을 제시한다. 또한 Dynamic Adaptive Query flooding scheme은 broadcast storm 문제 해결뿐만 아니라 network의 congestion을 감소시켜 data packet의 성능 향상에도 기여 할 것이다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.3
• /
• pp.149-159
• /
• 2006

To provide on-demand video streaming services through the network, video objects with both high and low client request rates should be served efficiently. In this paper, we propose a dynamic on-demand streaming approach for providing services efficiently regardless of the client request rate. This approach can maintain QoS by transitioning the service scheme according to the request rate. The server provides services by the Heuristic broadcasting approach when the client request rate is low and by Striping broadcast, one of many Periodic broadcast approaches, when the client request rate is high. The server knows the variations of client request rates by the number of service channels and decides the transition to more efficient service schemes on its own. We simulated this scheme transition with various client request intervals and traces from a company providing streaming services. The results show that the performance of our approach is reasonable.

• Journal of Broadcast Engineering
• /
• v.14 no.2
• /
• pp.189-196
• /
• 2009

We propose a hybrid broadcast scheduling based on a combination of periodic and on-demand data scheduling methods for mobile data broadcasting in convergence networks from communication and broadcasting. We consider an environment in which the forward channel is for data broadcasting and the reverse channel is for sending data requests via cellular phones, WLAN, WiBro, etc. Collecting statistics of requests from clients, the server partitions the data items into hot-item and cold-item sets. Hot items are sent based on a push-based scheduling. An on-demand scheduling method is applied to cold items. Performance evaluation from simulations shows that our proposed scheduling algorithm yields small response time with high successful response ratio.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1999.06b
• /
• pp.149-155
• /
• 1999

방송과 통신산업의 융합현상이 가속화됨에 따라, CATV망을 이용하여 다양한 영상, 음성, 데이터 통신을 위한 새로운 기술과 서비스의 요구가 증가하고 있다. 디지털 방식의 CATV를 위한 세계적 표준화 작업이 선진국을 중심으로 진행되고 있으며, 국내에서도 이에 따른 기술개발의 목표 및 규격설정을 통한 호환성 보장 체계가 필요함에 이를 위한 연구개발을 수행하였다. CATV의 디지털화는 MoD, 화상전화, 고속 인터넷 와 같은 다양한 디지털 서비스를 CATV사업자가 가입자에게 제공함으로써 서비스 폭을 넓히는 FSN(Full Service Network)의 기반으로 활용할 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.3896-3915
• /
• 2014

The Reverse k Nearest Neighbor (RkNN) query is valuable for finding objects influenced by a specific object and is widely used in both scientific and commercial systems. However, the influence level of each object is unknown, information that is critical for some applications (e.g. target marketing). In this paper, we propose a new query type, Ordered Reverse k Nearest Neighbor (ORkNN), and make efforts to adapt it in an on-demand scenario. An Order-k Voronoi diagram based approach is used to answer ORkNN queries. In particular, for different values of k, we pre-construct only one Voronoi diagram. Algorithms on both the server and the clients are presented. We also present experimental results that suggest our proposed algorithms may have practical applications.

• Journal of Information Processing Systems
• /
• v.6 no.4
• /
• pp.575-596
• /
• 2010

Video-on-Demand services are increasing rapidly nowadays. The load on servers can be very high, even exceeding their capacity. For popular contents, we can use a Periodic Broadcast (PB) strategy using multicast to serve all clients. Recent development of PB uses multiple channels broadcasting for segments of movies in certain patterns, so that users only need to wait for a small segment to start the service. However, users need higher download capacity to download multiple segments at a time. In order to compensate for this, a proxy server can help to reduce download bandwidth requirements by holding some segments for a certain time. This research will focus on more recent PB schemes that couldn't be covered by previous Proxy-Assisted Periodic Broadcast strategies.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.422-431
• /
• 2004

In recent years, different models in data delivery have been explored in mobile computing systems. Particularly, there were a lot of research efforts in the periodic push model where the server repetitively disseminates information without explicit request. However, average waiting time per data operation highly depends on the length of a broadcast cycle and different access pattern among clients may deteriorate the response time considerably. In this case, clients are preferably willing to send a data request to the server explicitly through backchannel in order to obtain optimal response time. We call the broadcast model supporting backchannel as hybrid broadcast. In this paper, we devise a new transaction processing algorithm(O-PreH) in hybrid broadcast environments. The data objects which the server maintains are divided into Push_Data for periodic broadcasting and Pull_Data for on-demand processing. Clients tune in broadcast channel or demand the data of interests according to the data type. Periodic invalidation reports from the server support maintaining transactional consistency. If one or more conflicts are found, conflict orders are determined not to violate the consistency(pre-reordering) and then the remaining operations have to be executed pessimistically. Through extensive simulations, we demonstrate the improved throughput of the proposed algorithm.