Bala Srinivasan

Bala Srinivasan

Auto-generated profile, based on publicly available information

Bala Srinivasan

Monash University

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2005 in Mobile Information Systems
Verified
Journal Article
Open access
PDF file
AWAgustinus Borgy Waluyo
Agustinus Borgy Waluyo
BSBala Srinivasan
Bala Srinivasan
DTDavid Taniar
David Taniar
The emergence of mobile computing provides the ability to access information at any time and place. However, as mobile computing environments have inherent factors like power, storage, asymmetric communication cost, and bandwidth limitations, efficient query processing and minimum query response time are definitely of great interest. This survey groups a variety of query optimization and processing mechanisms in mobile databases into two main categories, namely: (i) query processing strategy, and (ii) caching management strategy. Query processing includes both pull and push operations (broadcast mechanisms). We further classify push operation into on-demand broadcast and periodic broadcast. Push operation (on-demand broadcast) relates to designing techniques that enable the server to accommodate multiple requests so that the request can be processed efficiently. Push operation (periodic broadcast) corresponds to data dissemination strategies. In this scheme, several techniques to improve the query performance by broadcasting data to a population of mobile users are described. A caching management strategy defines a number of methods for maintaining cached data items in clients' local storage. This strategy considers critical caching issues such as caching granularity, caching coherence strategy and caching replacement policy. Finally, this survey concludes with several open issues relating to mobile query optimization and processing strategy.

1 September 2007
Verified
Conference Paper
Closed access
FSFlora Dilys Salim
Flora Dilys Salim
SLSeng Wai Loke
Seng Wai Loke
ARAndry Rakotonirainy
Andry Rakotonirainy
BSBala Srinivasan
Bala Srinivasan
SKShonali Krishnaswamy
Shonali Krishnaswamy
The crash rate in road intersection demonstrates the need for a fast and accurate collision detection system. Ubiquitous computing research provides a significant opportunity to develop novel ways of improving road intersection safety. The existing intersection collision warning or avoidance systems are mostly built to suit a particular intersection. We suggest that an intersection collision detection system should be able to adapt to different types of intersections by acquiring the collision patterns of the intersection through data mining. Collision patterns that are specific to that intersection are stored in a knowledge base to select vehicles which are exposed to a high risk of collision. This algorithm increases the speed of collision detection calculation, as detection is not applied on all possible pairs in an intersection. The performance and accuracy of the algorithm are evaluated. This evaluation is done on a developed simulation bed and the results are presented.

26 March 2010 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
KXKefeng Xuan
Kefeng Xuan
GZGeng Zhao
Geng Zhao
DTDavid Taniar
David Taniar
MSMaytham Safar
Maytham Safar
BSBala Srinivasan
Bala Srinivasan

4 November 2010 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
KXKefeng Xuan
Kefeng Xuan
GZGeng Zhao
Geng Zhao
DTDavid Taniar
David Taniar
MSMaytham Safar
Maytham Safar
BSBala Srinivasan
Bala Srinivasan

1 October 2005 in International Journal of Business Data Communications and Networking
Verified
Journal Article
Closed access
PDF file
AWAgustinus Borgy Waluyo
Agustinus Borgy Waluyo
GGGabriel Goh
Gabriel Goh
DTDavid Taniar
David Taniar
BSBala Srinivasan
Bala Srinivasan
Data broadcasting is a scalable mechanism to disseminate information to a large number of mobile clients in a wireless environment. This paper concerns the development of a data broadcast system in a wireless environment. The broadcast data is retrieved from a central database server. We apply three different data broadcast schemes in the following order: first, we implement a filtering technique for a mobile device to select and display the desired data from incoming broadcast data items; second, the index broadcasting scheme is designed to predict the arrival of the desired data to appropriately execute the power conserving mode; third, we incorporate multiple channel environments to allow a mobile device to tune into multiple broadcast channels in order to receive the desired data. The proposed model uses a shared indices price context to demonstrate the effective use of these data broadcast schemes in order to provide efficient data retrieval. In order to develop this model, a wireless ad-hoc network infrastructure is used.

29 November 2012 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
AWAgustinus Borgy Waluyo
Agustinus Borgy Waluyo
DTDavid Taniar
David Taniar
WRWenny Rahayu
Wenny Rahayu
BSBala Srinivasan
Bala Srinivasan
This paper introduces a novel clustering-based broadcast scheduling technique for mobile nearest-neighbor (NN) query processing in cyber physical systems. An efficient index structure is presented to guide mobile clients to the NN-objects. The proposed broadcast scheduling and indexing is aimed at minimizing query access time and energy consumption of the clients when retrieving NN-objects through wireless channels. We have experimentally studied the proposed scheme and its comparison with the state-of-the-art methods. The results suggest the efficacy of our proposed approach in offering minimum latency and energy consumption, which is critically important especially for resource-constrained wireless environments.