Abstract

In our previous work, we proposed few updated data dissemination methods to refresh old replicas efficiently in mobile ad hoc networks. These methods disseminate updated data items every time when owners of original data items update the items or every time two mobile hosts are newly connected with each other and this causes heavy traffic in the entire network. In this paper, we assume applications that periodically execute read operations with strict deadlines to data items and propose few alternative updated data dissemination methods. These methods reduces the traffic for data dissemination while keeping a high success ratio for read operations.

Meeting Name

22nd IEEE International Conference on Advanced Information Networking and Application

Department(s)

Computer Science

Sponsor(s)

International Communications Foundation

Keywords and Phrases

Data Dissemination; Time Constraints; Data Items; Mobile Ad Hoc Networks; Traffic

Document Type

Article - Conference proceedings

Document Version

Final Version

File Type

text

Language(s)

English

Rights

© 2008 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.

Full Text Link

Share

 
COinS