scholarly journals Balancing the tradeoffs between data accessibility and query delay in ad hoc networks

Author(s):  
Liangzhong Yin ◽  
Guohong Cao
2006 ◽  
Vol 07 (01) ◽  
pp. 75-89 ◽  
Author(s):  
TAKAHIRO HARA

To improve data accessibility in ad hoc networks, we have proposed a few methods of replicating data items on mobile hosts by considering the data access frequencies from mobile hosts to each data item and the network topology. In this paper, we address techniques to manage locations of data items or replicas and efficiently forward access requests to the locations. In order to manage locations of data items efficiently, a key issues is predicting the locations of data items that dynamically change. To predict the locations of data items, we use the information on replica allocation at every relocation time and the logs of past data accesses.


Author(s):  
Mr. M. Karthikeyan ◽  
Mrs P. Shanmuga Priya ◽  
Mrs S. Kiruthika

File searching turns out to be difficult since nodes in MANETs move around freely and can exchange information only when they are within the communication range. Broadcasting can quickly discover files, but it leads to the broadcast storm problem with high energy consumption. File sharing applications in mobile ad hoc networks (MANETs) have attracted more and more attention in recent years. The efficiency of file querying suffers from the distinctive properties of such networks including node mobility and limited communication range and resource. An intuitive method to alleviate this problem is to create file replicas in the network. However, despite the efforts on file replication, no research has focused on the global optimal replica creation with minimum average querying delay. Specifically, current file replication protocols in mobile ad hoc networks have two shortcomings.


Sign in / Sign up

Export Citation Format

Share Document