Abstract
Various issues on network routing in a mobile ad-hoc network (MANET) have been studied with outstanding results. However, there is still room for improvement with regard to data accessibility, especially when the number of nodes increases in the network. To enhance the data accessibility in a MANET, a few replica allocation schemes have been proposed. In these schemes, the nodes are partitioned into groups so that each group has as many different data items as possible. However, grouping in a MANET requires an enormous amount of communication cost, since the network topology is changed dynamically. In this paper, we propose a scalable replica allocation scheme in which the nodes are grouped based on the mobility of the nodes. Grouping in the proposed scheme is done with one-hop communications in a fully distributed manner. Within each group, replicas are allocated to the group nodes based on the estimated data access frequencies that are computed periodically by the allocator of the group. It turns out that grouping with mobility and utilizing the estimated access frequency information enhances the stability of the topology of each group as well as the data accessibility. We evaluate the proposed scheme by simulations with the Network Simulator NS-3 along with the analytical evaluations. The results of simulations and analytical evaluations demonstrate the effectiveness of the proposed scheme in terms of communication cost. The proposed scheme reduces the communication cost by 347.1 % on average over the existing replica allocation scheme, while achieving comparable data accessibility.
Similar content being viewed by others
References
Hara, T., & Madria, S. K. (2006). Data replication for improving data accessibility in ad hoc networks. IEEE Transactions on Mobile Computing, 5(11), 1515–1532.
Derhab, A., & Badache, N. (2009). Data replication protocols for mobile ad-hoc network. IEEE Communications Surveys and Tutorials, 11(2), 33–51.
Choi, J.-H., Shim, K.-S., Lee, S., & Wu, K.-L. (2012). Handling selfishness in replica allocation over a mobile ad hoc network. IEEE Transactions on Mobile Computing, 11(2), 278–291.
Moustafa, H., & Labiod, H. (2004). Multicast routing in mobile ad hoc networks. Telecommunication Systems, 25(1–2), 65–88.
Badonnelradu, R., State, R., & Festor, O. (2005). Self-organizing monitoring in ad-hoc networks. Telecommunication Systems, 30(1–3), 143–160.
Padmanabhan, P., Gruenwald, L., Vallur, A., & Atiquzzaman, M. (2008). A survey of data replication techniques for mobile ad hoc network databases. The International Journal on Very Large Data Bases, 17(5), 1143–1164.
Xu, K., Hong, X., & Gerla, M. (2003). Landmark routing in ad hoc networks with mobile backbones. Journal of Parallel and Distributed Computing, 63(2), 110–122.
Karumanchi, G., Muralidharan, G., & Prkash, R. (1999). Information dissemination in partitionable mobile ad hoc networks. In Proceedings of International Symposium Reliable Distributed Systems (pp. 4–13).
Luo, J., Eugster, P.T., & Hubaux, J. P. (2003). Route driven gossip: Probabilistic reliable multicast in ad hoc networks. In Proceedings of IEEE INFOCOM (pp. 2229–2239).
Chiang, C., Wu, H., Liu, W., & Gerla, M. (1997). Routing in clustered multihop, mobile wireless network with fading channel. In Proceedings of IEEE Singapore International Conference on Networks (pp. 197–211).
Lin, C. R., & Gerla, M. (1997). Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas in Communication, 15(7), 1265–1275.
Bao, L., & Garcia-Luna-Aceves, J. J. (2003). Topology management in ad hoc networks. In Proceedings of ACM MobiCom (pp. 129–140).
Basagni, S., Chlamtac, I., Syrotiuk V.R., & Woodward., B.A. (1998). A distance routing effect algorithm for mobility (DREAM). In Proceedings of MobiCom (pp. 76–88).
Karp, B., & Kung, H.T. (2000). Greedy perimeter stateless routing (GPSR) for wireless networks. In Proceedings of MobiCom (pp. 243–254).
Ko, Y.B., & Vaidya, N.H (1998). Location-aided routing(LAR) in mobile ad hoc network. In Proceedings of MobiCom (pp. 66–75).
Kim, C., & Wu, M. (2011). Leader election on tree-based centrality in ad hoc networks. Telecommunication Systems, online published.
The network simulator NS-3, http://www.nsnam.org.
Broch, J., Maltz, D. A., Johnson, D. B., Cun Hu, Y., & Jetcheva, J. (1998). A performance comparison of multi-hop wireless ad hoc network routing protocols. In Proceedings of ACM MobiCom (pp. 85–97).
Lee, K.-H. (2011). Authentication scheme based on cluster for mobile ad hoc game. Journal of Future Game Technology, 1(1), 35–42.
Acknowledgments
This research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (2011-0002851).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kim, SK., Yoon, JH., Lee, KJ. et al. A scalable mobility-based replica allocation scheme in a mobile ad-hoc network. Telecommun Syst 60, 239–250 (2015). https://doi.org/10.1007/s11235-015-0026-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11235-015-0026-5