Takahiro Hara
Abstract
To improve data accessibility in ad hoc networks, in our previous work we proposed three methods of replicating data items by considering the data access frequencies from mobile nodes to each data item and the network topology. In this paper, we extend our previously proposed methods to consider the correlation among data items. Under these extended methods, the data priority of each data item is de-fined based on the correlation among data items, and data items are replicated at mobile nodes with the data priority. We employ simulations to show that the extended methods are more efficient than the original ones.
- A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974. Google Scholar
Digital Library
- I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "A survey o sensor networks," IEEE Communication Magazine, Vol. 40, No. 8, pp. 102--114, 2002. Google ScholarDigital Library
- J. Broch, D. A. Maltz, D. B. Johnson, Y. C. Hu, and J. Jetcheva, "A performance comparison of multi-Hop wireless ad hoc network routing protocols," Proc. Mobicom'98, pp. 159--164, 1998. Google ScholarDigital Library
- T. Hara, "Effective replica allocation in ad hoc networks for improving data accessibility," Proc. IEEE Infocom 2001, pp. 1568--1576, 2001.Google Scholar
- T. Hara, "Replica allocation methods in ad hoc networks with data update," ACM-Kluwer Journal on Mobile Networks and Applications, Vol. 8, No. 4, pp. 343--354, 2003. Google ScholarDigital Library
- C. Intanagonwiwat, R. Govindan, D. Estrin, "Directed diffusion: a scalable and robust communication paradigm for sensor networks," Proc. Mobicom 2000, pp. 56--67, 2000. Google ScholarDigital Library
- D. B. Johnson, "Routing in ad hoc networks of mobile hosts," Proc. IEEE Workshop on Mobile Computing Systems and Applications, pp. 158--163, 1994.Google Scholar
- G. Karumanchi, S. Muralidharan, and R. Prakash, "Information dissemination in partitionable mobile ad hoc networks," Proc. Symposium on Reliable Distributed Systems (SRDS'99), pp. 4--13, 1999. Google ScholarDigital Library
- J. Luo, J. P. Hubaux, and P. Eugster, "PAN: Providing reliable storage in mobile ad hoc networks with probabilistic quorum systems," Proc. ACM MobiHoc 2003, pp. 1--12, 2003. Google ScholarDigital Library
- C. E. Perkins and P. Bhagwat, "Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers," Proc. ACM SIGCOMM'94, pp. 234--244, 1994. Google ScholarDigital Library
- C. E. Perkins and E. M. Royer, "Ad hoc on demand distance vector routing," Proc. IEEE Workshop on Mobile Computing Systems and Applications, pp. 90--100, 1999. Google ScholarDigital Library
Recommendations
Replica allocation methods in ad hoc networks with data update
In ad hoc networks, since mobile hosts move freely, network division occurs frequently, and thus data accessibility is lower than that in conventional fixed networks. In this paper, assuming an environment where each data item is periodically updated, ...
An Enhanced EDCG Replica Allocation Method in Ad Hoc Networks
EEE '04: Proceedings of the 2004 IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE'04)The maturity of wireless technology has led to anever-increasing interest in mobile ad hoc networks(MANETs). Many applications are expected to bedeveloped using MANETs. However, the connectivityamong mobile hosts may change due to their mobilitywhich ...
Replica dissemination and update strategies in cluster-based mobile ad hoc networks
A mobile ad hoc network (MANET) is a collection of wireless mobile nodes that forms a temporary network without the aid of a fixed communication infrastructure. Since every node can be mobile and network topology changes can occur frequently, node ...
Comments