Replica allocation for correlated data items in ad hoc sensor networks

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.

REFERENCES

• 1: Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
• 2: 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.
• 3: Josh Broch , David A. Maltz , David B. Johnson , Yih-Chun Hu , Jorjeta Jetcheva, A performance comparison of multi-hop wireless ad hoc network routing protocols, Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking, p.85-97, October 25-30, 1998, Dallas, Texas, United States [doi>10.1145/288235.288256]
• 4: T. Hara, "Effective replica allocation in ad hoc networks for improving data accessibility," Proc. IEEE Infocom 2001, pp. 1568--1576, 2001.
• 5: Takahiro Hara, Replica allocation methods in ad hoc networks with data update, Mobile Networks and Applications, v.8 n.4, p.343-354, August 2003 [doi>10.1023/A:1024523411884]
• 6: Chalermek Intanagonwiwat , Ramesh Govindan , Deborah Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, Proceedings of the 6th annual international conference on Mobile computing and networking, p.56-67, August 06-11, 2000, Boston, Massachusetts, United States [doi>10.1145/345910.345920]
• 7: D. B. Johnson, "Routing in ad hoc networks of mobile hosts," Proc. IEEE Workshop on Mobile Computing Systems and Applications, pp. 158--163, 1994.
• 8: Goutham Karumanchi , Srinivasan Muralidharan , Ravi Prakash, Information Dissemination in Partitionable Mobile Ad Hoc Networks, Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems, p.4, October 18-21, 1999
• 9: Jun Luo , Jean-Pierre Hubaux , Patrick Th. Eugster, PAN: providing reliable storage in mobile ad hoc networks with probabilistic quorum systems, Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, June 01-03, 2003, Annapolis, Maryland, USA [doi>10.1145/778415.778417]
• 10: Charles E. Perkins , Pravin Bhagwat, Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers, Proceedings of the conference on Communications architectures, protocols and applications, p.234-244, August 31-September 02, 1994, London, United Kingdom
• 11: Charles E. Perkins , Elizabeth M. Royer, Ad-hoc On-Demand Distance Vector Routing, Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications, p.90, February 25-26, 1999