Skip to main content

A Node Placement Heuristic to Encourage Resource Sharing in Mobile Computing

  • Conference paper
Computational Science and Its Applications - ICCSA 2011 (ICCSA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6784))

Included in the following conference series:

Abstract

Advances in wireless communication systems and mobile devices allow nomad users to participate in mobile collaborative activities. However the availability of hardware resources of the mobile devices that are participating in the collaboration process is a crucial factor that can enhance or jeopardize such activity. This paper studies how the network topology and the hardware resources distributed into a network influence the collaboration among the participants in the activities. The results obtained from simulating the strategy of resource sharing in an overlay network allowed us to observe two clear implications: (1) it is important to maximize the number of links between Desktop PC and mobile devices and (2) the mobile devices have to be placed within the network topology in the nodes with higher degree. According to these observations we have proposed an heuristic for node placement in order to maximize the cooperation level in terms of resource sharing.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sarmenta, L.F.G., Hirano, S.: Bayanihan: building and studying web-based volunteer computing systems using Java. Future Generation Computer Systems 15, 675–686 (1999)

    Article  Google Scholar 

  2. Anderson, D.P.: BOINC: A System for public-resource computing and storage. In: IEEE/ACM Grid Computing (GRID), pp. 4–10. IEEE Computer Society, Los Alamitos (2004)

    Chapter  Google Scholar 

  3. Cassar, A.: Coordination and cooperation in local, random and small world networks: experimental evidence. Games and Economic Behavior 58, 209–230 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  4. Vega, D.: Design and implementation of a simulator to explore cooperation in distributed environments. Master thesis, Universitat Politècnica de Catalunya, Spain (2010)

    Google Scholar 

  5. Cusack, C., Martens, C., Mutreja, P.: Volunteer Computing Using Casual Games. Future of Game Design and Technology, FuturePlay (2006)

    Google Scholar 

  6. Santos, F.C., Rodrigues, J.F., Pacheco, J.M.: Graph topology plays a determinant role in the evolution of cooperation. Proceedings of the Royal Society B: Biological Sciences 273, 51–55 (2006)

    Article  Google Scholar 

  7. Lozano, S., Arenas, A., Sánchez, A.: Mesoscopic Structure Conditions the Emergence of Cooperation on Social Networks. PLoS ONE, Public Library of Science 3, e1892 (2008)

    Article  Google Scholar 

  8. Nowak, M.A.: Five Rules for the Evolution of Cooperation. Science 314, 1560–1563 (2006)

    Article  Google Scholar 

  9. Chevaleyre, Y., Endriss, U., Lang, J., Maudet, N., van Leeuwen, J., Italiano, G.: A Short Introduction to Computational Social Choice. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 51–69. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Feldman, M., Lai, K., Zhang, L.: The Proportional-Share Allocation Market for Computational Resources. IEEE Transactions on Parallel and Distributed Systems 20, 1075–1088 (2009)

    Article  Google Scholar 

  11. Roy, S., Pucha, H., Zhang, Z., Hu, Y., Qiu, L.: Overlay Node Placement: Analysis, Algorithms and Impact on Applications. Distributed Computing Systems 53 (2007)

    Google Scholar 

  12. Guerrero, L., Ochoa, S., Pino, J., Collazos, C.: Selecting Devices to Support Mobile Collaboration. Group Decision and Negotiation 15(3), 243–271 (2006)

    Article  Google Scholar 

  13. Pinelle, D., Gutwin, C.: Loose Coupling and Healthcare Organizations: Deployment Strategies for Groupware. Computer Supported Cooperative Work Journal 15(5-6), 537–572 (2006)

    Article  Google Scholar 

  14. Cornuejols, G.P., Nemhauser, G.L., Wolsey, L.A.X.: The uncapacitated facility location problem. In: Discrete Location Theory, pp. 119–171. Wiley, Chichester (1990)

    Google Scholar 

  15. Coppens, J., Wauters, T., De Turck, F., Dhoedt, B., Demeester, P.: Evaluation of replica placement and retrieval algorithms in self-organizing CDNs. In: Proc of IFIP/IEEE International Workshop on Self-Managed Systems & Services SelfMan (2005)

    Google Scholar 

  16. Karlsson, M., Mahalingam, M.: Do We Need Replica Placement Algorithms in Content Delivery Networks? In: Proc Web Content Caching and Distribution Workshop (2002)

    Google Scholar 

  17. Herrmann, K.: Self-organized service placement in ambient intelligence environments. ACM Trans. Auton. Adapt. Syst. 5, 6:1–6:39 (2010)

    Article  Google Scholar 

  18. Tang, X., Chi, H., Chanson, S.T.: Optimal Replica Placement under TTL-Based Consistency. IEEE Transactions on Parallel and Distributed Systems 18, 351–363 (2007)

    Article  Google Scholar 

  19. Lee, B.-D., Weissman, J.: Dynamic replica management in the service grid. In: Proc. High Performance Distributed Computing (HPDC), pp. 433–434 (2001)

    Google Scholar 

  20. Graupner, S., Andrzejak, A., Kotov, V., Trinks, H., Brueckner, S.A.: Adaptive Service Placement Algorithms for Autonomous Service Networks. In: Brueckner, S.A., Di Marzo Serugendo, G., Karageorgos, A., Nagpal, R. (eds.) ESOA 2005. LNCS (LNAI), vol. 3464, pp. 280–297. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  21. Liu, K.Y., Lui, J.C., Zhang, Z.-L., Mitrou, N.: Distributed algorithm for service replication in service overlay network. In: Mitrou, N.M., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol. 3042, pp. 1156–1167. Springer, Heidelberg (2004)

    Google Scholar 

  22. Choi, S., Shavitt, Y.: Placing servers for session-oriented services. Department of Computer Science, Washington University. Tech. rep. WUCS-2001-41 (2001)

    Google Scholar 

  23. Legout, A.: Clustering and sharing incentives in bittorrent systems. In: SIGMETRICS 2007, pp. 301–312 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vega, D., Medina, E., Messeguer, R., Royo, D., Freitag, F. (2011). A Node Placement Heuristic to Encourage Resource Sharing in Mobile Computing. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds) Computational Science and Its Applications - ICCSA 2011. ICCSA 2011. Lecture Notes in Computer Science, vol 6784. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21931-3_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21931-3_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21930-6

  • Online ISBN: 978-3-642-21931-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics