Advertisement

Opportunistic Databank: A context Aware on-the-fly Data Center for Mobile Networks

  • Osman Khalid
  • Samee U. Khan
  • Sajjad A. Madani
  • Khizar Hayat
  • Lizhe Wang
  • Dan Chen
  • Rajiv Ranjan
Chapter

Abstract

In recent years, significant advancement in the wireless communication technologies, such as Bluetooth, 802.11/WiFi, and ZigBee, has been seen in mobile ad hoc networks (MANETs). Such technologies enable mobile devices to form on-the-fly data centers where nodes opportunistically participate in data storage and sharing applications. In such a setup, the basic assumption is that there must exist an end-to-end communication path between a source and a destination node. Every mobile host acts as a router and communicates with other mobile hosts. Even if source and destination mobile hosts are not in each other’s communication range, data is still forwarded to the destination mobile host by relaying transmission through other mobile hosts that exist between the source and the destination nodes. The scenarios when there are frequent disruptions and delays in message transfer due to network partitioning, higher degree of variation in network topology, and sparsity of nodes, such network environments are known as Delay Tolerant Networks (DTNs). The DTNs lack end-to-end communication paths between source and destination nodes. Numerous DTN scenarios that correspond to opportunistic data storage/sharing applications include: (a) disaster/emergency response systems, (b) battlefield networks, (c) sensor networks, (d) road traffic information dissemination systems, (e) content dissemination systems, and (f) cellular traffic data offloading. In the aforementioned scenarios, the cellular 3G infrastructure may usually be unavailable, or if available, provide too limited bandwidth to transmit data traffic. Instead, mobile users rely on their opportunistic contacts for storing, sharing, and accessing data. For instance, nodes may participate in forming an on-the-fly network to store information extracted from sensors, which may be the information regarding live weather data, road traffic condition, or about any upcoming disaster

Keywords

Mobile Node Data Item Delivery Ratio Mobile Host Replication Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    M. Archetti, “Cooperation as a volunteer’s dilemma and the strategy of conflict in public.” Journal of Evolutionary Biology, vol. 22, no. 11, page. 2192, 2009.CrossRefGoogle Scholar
  2. 2.
    A. Balasubramanian, B. Levine, and A. Venkataramani, “Replication Routing in DTNs: A Resource Allocation Approach,” IEEE/ACM Transactions on Networking, vol. 18, no. 2, pp. 596–609, 2010.CrossRefGoogle Scholar
  3. 3.
    M. Conti and M. Kumar, “Opportunities in Opportunistic Computing,” IEEE Computer, vol. 43, no. 1, pp. 42–50, Jan. 2010.CrossRefGoogle Scholar
  4. 4.
    D. Grosu and A. T. Chronopoulos, “Algorithmic mechanism design for load balancing in distributed systems,” IEEE Transactions on Systems, Man, and Cybernetics, Part B, vol. 34, no. 1, pp. 77–84, January 2004.CrossRefGoogle Scholar
  5. 5.
    T. Hara, “Effective replica allocation in ad hoc networks for improving data accessibility,” In Proceedings of IEEE INFOCOM, 2001, pp. 1568–1576.Google Scholar
  6. 6.
    T. Hara, “Replica allocation in ad hoc networks with data update,” Mobile Network Applications, vol. 8, pp. 343–354.Google Scholar
  7. 7.
    T. Hara and S. K. Madria, “Dynamic data replication using aperiodic updates in mobile ad hoc networks,” In Proceedings of 9th international conference on database systems for advance applications, 2004, pp. 869–881.Google Scholar
  8. 8.
    D. Hirsch and S. Madria, “Data Replication in Cooperative Mobile Ad-Hoc Networks,” Mobile Networks and Applications, vol. 18, no. 2, pp. 237–252, 2013.CrossRefGoogle Scholar
  9. 9.
    Infocom06 connectivity traces on CRAWDAD website. [Online] http://crawdad.cs.dartmouth.edu/meta.php?name=cambridge/haggle#N100C4, 2013.
  10. 10.
    A. Keränen, J. Ott, and T. Kärkkäinen, “The ONE simulator for DTN protocol evaluation,” in Proc. of 2nd International Conference on Simulation Tools and Techniques, 2009, doi.10.4108.Google Scholar
  11. 11.
    M. J. Khabbaz, C. M. Assi, and W. F. Fawaz, “Disruption-tolerant networking: A comprehensive survey on recent development and persisting challenges,” IEEE Communications Surveys Tutorials, vol. 14, no. 2, pp. 607–640, Second Quarter, 2012.CrossRefGoogle Scholar
  12. 12.
    O. Khalid, S. U. Khan, J. Kolodziej, L. Zhang, J. Li, K. Hayat, S. A. Madani, L. Wang, and D. Chen, “A checkpoint based message forwarding approach for opportunistic communication,” European Conference of Modeling and Simulation, 2012.Google Scholar
  13. 13.
    S. U. Khan, “Mosaic-Net: A Game Theoretical Method for Selection and Allocation of Replicas in Ad Hoc Networks,” Journal of Supercomputing, vol. 55, no. 3, pp. 321–366, 2011.CrossRefGoogle Scholar
  14. 14.
    S. U. Khan and I. Ahmad, “Replicating Data Objects in Large Distributed Database Systems: An Axiomatic Game Theoretical Mechanism Design Approach,” Distributed and Parallel Databases, vol. 28, nos. 2–3, pp. 187–218, 2010.CrossRefGoogle Scholar
  15. 15.
    S. U. Khan and I. Ahmad, “A Pure Nash Equilibrium based Game Theoretical Method for Data Replication across Multiple Servers,” IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 4, pp. 537–553, 2009.CrossRefMathSciNetGoogle Scholar
  16. 16.
    S. U. Khan and C. Ardil, “A Frugal Bidding Procedure for Replicating WWW Content,” International Journal of Information Technology, vol. 5, no. 1, pp. 67–80, 2009.Google Scholar
  17. 17.
    S. U. Khan, A. A. Maciejewski, and H. J. Siegel, “Robust CDN Replica Placement Techniques,” in 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), Rome, Italy, May 2009.Google Scholar
  18. 18.
    S. U. Khan, “A Multi-Objective Programming Approach for Resource Allocation in Data Centers,” in International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), Las Vegas, NV, USA, July 2009, pp. 152–158.Google Scholar
  19. 19.
    S. U. Khan, “On a Game Theoretical Methodology for Data Replication in Ad Hoc Networks,” in International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), Las Vegas, NV, USA, July 2009, pp. 232–238.Google Scholar
  20. 20.
    S. U. Khan, “A Frugal Auction Technique for Data Replication in Large Distributed Computing Systems,” in International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), Las Vegas, NV, USA, July 2009, pp. 17–23.Google Scholar
  21. 21.
    S. U. Khan, “A Game Theoretical Resource Allocation Technique for Large Distributed Computing Systems,” in International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), Las Vegas, NV, USA, July 2009, pp. 48–54.Google Scholar
  22. 22.
    S. U. Khan and C. Ardil, “A Fast Replica Placement Methodology for Large-scale Distributed Computing Systems,” in International Conference on Parallel and Distributed Computing Systems (ICPDCS), Oslo, Norway, July 2009, pp. 121–127.Google Scholar
  23. 23.
    S. U. Khan and C. Ardil, “A Competitive Replica Placement Methodology for Ad Hoc Networks,” in International Conference on Parallel and Distributed Computing Systems (ICPDCS), Oslo, Norway, July 2009, pp. 128–133.Google Scholar
  24. 24.
    S. U. Khan and I. Ahmad, “Comparison and Analysis of Ten Static Heuristics-based Internet Data Replication Techniques,” Journal of Parallel and Distributed Computing, vol. 68, no. 2, pp. 113–136, 2008.CrossRefMATHGoogle Scholar
  25. 25.
    S. U. Khan, A. A. Maciejewski, H. J. Siegel, and I. Ahmad, “A Game Theoretical Data Replication Technique for Mobile Ad Hoc Networks,” in 22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS), Miami, FL, USA, April 2008.Google Scholar
  26. 26.
    H. S. Kia and S. U. Khan, “Server Replication in Multicast Networks,” in 10th IEEE International Conference on Frontiers of Information Technology (FIT), Islamabad, Pakistan, December 2012, pp. 337–341.Google Scholar
  27. 27.
    Y. Li, M. Qian, D. Jin, P. Hui, Z. Wang, and S. Chen, “Multiple Mobile Data Offoading Through Disruption Tolerant Networks,” IEEE Transactions on Mobile Computing, vol. PP, no. 99, page. 1.Google Scholar
  28. 28.
    A. Lindgren, A. Doria, A. Davies, and S. Grasic, “Probabilistic Routing Protocol for Intermittently Connected Networks,” http://tools.ietf.org/html/rfc6693, 2012, accessed on March 2014.
  29. 29.
    S. Lee, D. Levin, V. Gopalakrishnan, B. Bhattacharjee, “Backbone construction in selfish wireless networks.” In ACM SIGMETRICS, New York, 2007, pp. 121–132.Google Scholar
  30. 30.
    J. Ott, A. Keränen, and E. Hyytiä, “BeachNet: Propagation-based Information Sharing in Mostly Static Networks,” in Proc. of ACM ExtremeCom, 2011.Google Scholar
  31. 31.
    J. Taheri, A. Y. Zomaya, P. Bouvry, and S. U. Khan, “Hopfield Neural Network for Simultaneous Job Scheduling and Data Replication in Grids,” Future Generation Computer Systems, vol. 29, no. 8, pp. 1885–1900, 2013.CrossRefGoogle Scholar
  32. 32.
    J. Taheri, A. Y. Zomaya, and S. U. Khan, “Grid Simulation Tools for Job Scheduling and Datafile Replication,” in Scalable Computing and Communications: Theory and Practice, S. U. Khan, L. Wang, and A. Y. Zomaya, Eds., John Wiley & Sons, Hoboken, NJ, USA, 2013, ISBN: 978–1–1181–6265–1, Chapter 35.Google Scholar
  33. 33.
    A. Vahdat and D. Becker, “Epidemic routing for partially connected ad hoc networks,” Technical Report CS-200006, Duke University, 2000.Google Scholar
  34. 34.
    A. G. Voyiatzis, “A Survey of Delay- and Disruption-Tolerant Networking Applications,” Journal of Internet Engineering, vol. 5, no. 1, pp. 331–344, 2012.Google Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  • Osman Khalid
    • 1
  • Samee U. Khan
    • 1
  • Sajjad A. Madani
    • 2
  • Khizar Hayat
    • 3
  • Lizhe Wang
    • 4
  • Dan Chen
    • 5
  • Rajiv Ranjan
    • 6
  1. 1.Department of Computer SciencesCOMSATS Institute of Information Technology, Abbottabad, PakistanCOMSATSPakistan
  2. 2.COMSATS Institute of Information TechnologyIslamabadPakistan
  3. 3.Computer Sciences SectionUniversity of NizwaBirkat Al MawzOman
  4. 4.Center for Earth Observation and Digital EarthChinese Academy of SciencesBeijingChina
  5. 5.School of Computer ScienceChina University of GeosciencesWuhanChina
  6. 6.Computer and Information Technology BuildingAustralian National UniversityCanberraAustralia

Personalised recommendations