• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.69-85
• /
• 2006

Broadcast has been often used to disseminate the frequently requested data efficiently to a large volume of mobile clients over a single or multiple channels. Conventional concurrency control protocols for mobile transactions are not suitable for the wireless broadcast environments due to the limited bandwidth of the up-link communication channel. In wireless broadcast environments, the server often broadcast different data items with different frequency to incorporate the data access patterns of mobile transactions. The previously proposed concurrency control protocols for mobile transactions in wireless broadcast environments are focused on the mobile transactions with uniform data access patterns. However, these protocols perform poorly when the data access pattern of update mobile transaction are not uniform but skewed. The update mobile transactions with skewed data access patterns will be frequently aborted and restarted due 4o the update conflict of the same data items with a high access frequency. In this paper, we propose an energy-efficient concurrence control protocol for mobile transactions with skewed data access as well as uniform data access patterns. Our protocol use a random back-off technique to avoid the frequent abort and restart of update mobile transactions. We present in-depth experimental analysis of our method by comparing it with existing concurrency control protocols. Our performance analysis show that it significantly decrease the average response time, the amount of upstream and downstream bandwidth usage over existing protocols.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.6
• /
• pp.1113-1132
• /
• 2011

In wireless sensor networks (WSNs), most energy saving asynchronous MAC protocols are custom tailored for unicast communications only. However, broadcast protocols are very commonly used in WSNs for a variety of functionalities, such as gathering network topology information, event monitoring and query processing. In this paper, we propose a novel low-power asynchronous broadcast MAC protocol called Alarm Broadcast (A-CAST). A-CAST employs the strobe preamble that specifies the residual waiting time for the following data transmission. Each receiver goes back to sleep upon hearing the strobe preamble for the residual time duration, to conserve energy and to wake up just before data transmission starts. We compute the energy consumption of A-CAST via rigorous mathematical analysis. The analytic results show that A-CAST outperforms B-CAST, a simple broadcast extension of the well-known B-MAC. We also implement A-CAST on sensor motes and evaluated its performance through real experiments. Our experimental results show that A-CAST reduces the energy consumption by up to 222% compared to the previously proposed protocols.

• International Journal of Advanced Culture Technology
• /
• v.6 no.4
• /
• pp.65-70
• /
• 2018

Wireless data broadcasting system that can support any number of clients is the effective alternative for the challenge of scalability in ubiquitous computing in IoT environment. In the system, it is important to evaluate quickly the performance parameter, the access time that means how quickly the client access desired data items. In this paper, we derive the mathematical model for the access time in the wireless data broadcast system adopting two-tier indexing scheme. The derived model enables to evaluate the access time without the complicated simulation. In order to evaluate the model, we compare the access time by the model with the access time by the simulation.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.476-493
• /
• 2003

Data broadcast is an effective data transmission method from a data base server to numerous mobile clients due to the restrictions on mobile environment such as low wireless communication bandwidth and energy shortage of mobile devices. There are various broadcast methods based on clients' data access frequencies or semantic relationship of data. The broadcast schedule based only on the access frequencies does not consider semantic relations of data, so that when a client needs to access a series of semantically related data, the client has to listen to the wireless channel for a long time. On the other hand, the broadcast schedule based only on semantic relationship of data makes data access time longer when clients highly request specific data which are not semantically related but frequently accessed. In this paper, we present an efficient data broadcast method based on not only data access frequencies but also semantic relationship to improve mobile clients' query response time. The new hybrid broadcast method we propose creates a data broadcast schedule according to the data access frequencies and then the schedule is adjusted to reflect semantic relationship of data. We show our method is efficient by experimental performance analysis.

• Journal of KIISE:Databases
• /
• v.36 no.1
• /
• pp.50-62
• /
• 2009

In wireless and mobile environments, data broadcasting is recognized as an effective way for data dissemination due to its benefits to bandwidth efficiency, energy-efficiency, and scalability. In this paper, we address the problem of delayed query processing raised by tree-based index structures in wireless broadcast environments, which increases the access time of the mobile clients. We propose a novel distributed index structure and a clustering strategy for streaming XML data which enable energy and latency-efficient broadcast of XML data. We first define the DIX node structure to implement a fully distributed index structure which contains tag name, attributes, and text content of an element as well as its corresponding indices. By exploiting the index information in the DIX node stream, a mobile client can access the wireless stream in a shorter latency. We also suggest a method of clustering DIX nodes in the stream, which can further enhance the performance of query processing over the stream in the mobile clients. Through extensive performance experiments, we demonstrate that our approach is effective for wireless broadcasting of XML data and outperforms the previous methods.

• International Journal of Internet, Broadcasting and Communication
• /
• v.15 no.2
• /
• pp.22-30
• /
• 2023

The portable mobile devices with high performance and high speed 5G network activate and explode the demands for ubiquitous information services that remove the limitations of time for the communication and places to request for the information. NN (Nearest Neighbor) search is one of the most important types of queries to be processed efficiently in the information services. Various indexes have been proposed to support efficient NN search in the wireless broadcast system. The indexes adopting Hilbert curve, grid partition or Voronoi diagram enable the clients to search for NN quickly in the wireless broadcast channel. It is necessary that an efficient means to evaluate the performances of various indexes. In this paper, we propose an open framework that can adopt a variety of indexing schemes and evaluate and compare the performances of them. The proposed framework is organized with open and flexible structure that can adopt hybrid indexing schemes extensible to Voronoi diagram as well as simple indexing schemes. With the implemented framework, we demonstrate the efficiency and scalability and flexibility of the proposed framework by evaluating various indexing schemes for NN query.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.56-63
• /
• 2009

The IEEE 802.11 standard has been used for wireless data networks such as wireless LAN, ad-hoc network, and vehicular ad-hoc network. Thus, the performance analysis of the IEEE 802.11 specification has been one of the hottest issues for network optimization and resource management. Most of the analysis studies were performed in a data plane of the IEEE 802.11 unicast. However, IEEE 802.11 broadcast is widely used for topology management, path management, and data dissemination. Thus, it is important to understand the performance of the broadcast scheme for the design of efficient wireless data network. In this contort, we analyze the IEEE 802.11 broadcast scheme in terms of the broadcast frame reception probability according to the distance from a sending node. Unlike the other works, our analysis framework includes not only the system parameters of the IEEE 802.11 specification such as transmission range, data rate, minimum contention window but also the networking environments such as the number of nodes, network load, and the radio propagation environments. Therefore, our analysis framework is expected to be used for the development of protocols and algorithms in a dynamic wireless data network.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.535-542
• /
• 2005

A data broadcast is an efficient technique to deliver data to a number of clients in wireless computing environments. In data broadcast systems, which generally have a narrow bandwidth, a caching is introduced to reduce contention for the bandwidth so that the response time can be decreased. In this paper, unlike previous works that use information maintained by clients, we propose several caching strategies using information on data requests of clients maintained by a server. Then, we evaluate the performance of proposed strategies by using simulation approach. According to the results, the strategy that considers both popularity and waiting time maintained by a server generally shows better performance than other strategies.

• Journal of KIISE:Databases
• /
• v.36 no.1
• /
• pp.30-43
• /
• 2009

Broadcast in the wireless environment has drawn much attention because it is capable of sending data to clients regardless of the number of clients. Most previous researches have aimed at obtaining an independent data item in a minimum time. But, they have not been researched on simultaneously receiving dependent data items in a query. In addition, these papers have only researched allocation problem that have not been came out data items in a query in same time and different channels. The access probability of each data item based on query request probability have not been reflected. This paper proposes a new method of allocating data items and simultaneously minimizing average response time required in receiving all the dependent data items in a query. Our performance analysis shows that our proposed method gives better average response time over the existing methods.