Browsing by Author "Sriprajna, K.J."

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    A linear hash based indexing scheme for location dependent data broadcast
    (IEEE Computer Society, 2009) Sriprajna, K.J.; Santhi Thilagam, P.S.
    Location based data dissemination in mobile wireless environment essentially requires some kind of indexing so that mobile clients can energy-efficiently access required data. Existing Location based indexing scheme (LBIS) for Location Dependent Data (LDD) follows tree based indexing mechanism and builds two levels of indices. But, LBIS spends considerable amount of time in fetching indices leading to increase in tuning time. On the other hand, LBIS records too much of index information making broadcast cycle short. In this paper we propose a hash based indexing scheme for LDD.Proposed scheme has a very compact structure because it binds the hashing parameters along with data and thereby eliminates the index overhead. This method also keeps mobile unit active for maximum three time units, thus decreasing the tuning time drastically. Even when the size of the broadcast data is increased, tuning time remains fairly stable. Through analysis and experiments; the effectiveness of the proposed method is shown. © 2009 IEEE.
  • No Thumbnail Available
    Item
    A linear hash based indexing scheme for location dependent data broadcast
    (2009) Sriprajna, K.J.; Santhi Thilagam, P.
    Location based data dissemination in mobile wireless environment essentially requires some kind of indexing so that mobile clients can energy-efficiently access required data. Existing Location based indexing scheme (LBIS) for Location Dependent Data (LDD) follows tree based indexing mechanism and builds two levels of indices. But, LBIS spends considerable amount of time in fetching indices leading to increase in tuning time. On the other hand, LBIS records too much of index information making broadcast cycle short. In this paper we propose a hash based indexing scheme for LDD.Proposed scheme has a very compact structure because it binds the hashing parameters along with data and thereby eliminates the index overhead. This method also keeps mobile unit active for maximum three time units, thus decreasing the tuning time drastically. Even when the size of the broadcast data is increased, tuning time remains fairly stable. Through analysis and experiments; the effectiveness of the proposed method is shown. � 2009 IEEE.