skip to main content
10.1145/1141277.1141303acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

A distributed stand-in agent based algorithm for opportunistic resource allocation

Authors Info & Claims
Published:23 April 2006Publication History

ABSTRACT

Mobile ad-hoc networks (MANET) are expected to form the basis of future mission critical applications such as combat and rescue operations. In this context, communication and computational tasks required by overlying applications will rely on the combined capabilities and resources provided by the underlying network nodes. This paper introduces an integrated FlexFeed/A-globe technology and distributed algorithm for opportunistic resource allocation in resource-and policy-constrained mobile ad-hoc networks. The algorithm is based on agent negotiation for the bidding, contract and reservation of resources, relying primarily on the concept of remote presence. In the proposed algorithm, stand-in Agents technology is used to create a virtual, distributed co-ordination component for opportunistic resource allocation in mobile ad-hoc networks.

References

  1. G. L. Alexanderson. The random walks of George Pólya. The Mathematical Association of America, 2000.Google ScholarGoogle Scholar
  2. J. M. Bradshaw. Kaos: Toward an industrial-strength generic agent architecture. In Software Agents, AAAI Press/MIT Press, pages 375--418, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. M. Bradshaw, M. Greaves, H. Holmback, T. Karygiannis, W. Jansen, B. G. Silverman, N. Suri, and A. Wong. Agents for the masses? IEEE Intelligent Systems (March/April), 14(2):53--63, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. Carvalho, F. Bertele, and N. Suri. The ulm algorithm for centralized coordination in flexfeed. In Proceedings of the 9th World Multi-Conference on Systemivcs, Cybernetics and Informatics - Orlando, USA, 2005.Google ScholarGoogle Scholar
  5. M. Carvalho and M. R. Breedy. Supporting flexible data feeds in dynamic sensor grids through mobile agents. In MA '02: Proceedings of the 6th International Conference on Mobile Agents, pages 171--185, London, UK, 2002. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. C. Cordeiro, S. Das, and D. Agrawal. Copas: Dynamic contention-balancing to enhance the performance of tcp over multi-hop wireless net-works. In Proceedings of IC3N'02, Miami, FL, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  7. A. Gupta, I. Wormsbecker, and C. Williamson. Experimental evaluation of tcp performance in multi-hop wireless ad hoc networks. In The IEEE Computer Societys 12th Annual International Symposium on Modelin, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS04), pages 3--11, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. ISO. Open Systems Interconnection Reference Model. http://en.wikipedia.org/wiki/OSI_model, 2005.Google ScholarGoogle Scholar
  9. M. Pěchouček, V. Mařík, D. Šišlák, M. Rehák, J. Lažanský, and J. Tožička. Inaccessibility in multi-agent systems. final report to Air Force Research Laboratory AFRL/EORD research contract (FA8655-02-M-4057), 2004.Google ScholarGoogle Scholar
  10. C. Perkins. Ad hoc on-demand distance vector (aodv) routing. IETF - IETF Request for Comments (RFC3561), 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. Rollo, P. Novák, and P. Jisl. Simulation of underwater surveillance by a team of autonomous robots. In Mařík, Brennan, and Pěchouček, editors, Holonic and Multi-Agent Systems for Manufacturing, number 3593 in LNAI, pages 25--34. Springer-Verlag, Heidelberg, 2005.Google ScholarGoogle Scholar
  12. D. Šišlák, M. Rehák, M. Pěchouček, and P. Benda. Optimizing agents operation in partially inaccessible and disruptive environment. In Intelligent Agent Technology, 2005 IEEE/WIC/ACM International Conference, number P2416 in IEEE, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. D. Šišlák, M. Rollo, and M. Pěchouček. A-globe: Agent platform with inaccessibility and mobility support. In M. Klusch, S. Ossowski, V. Kashyap, and R. Unland, editors, Cooperative Information Agents VIII, number 3191 in LNAI. Springer-Verlag, Heidelberg, September 2004.Google ScholarGoogle Scholar
  14. K. Sycara, J. Lu, M. Klusch, and S. Widoff. Dynamic service matchmaking among agents in open information environments. ACM SIGMOID Record, 28(1):211--246, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. V. Thomas, C. Bourjot, V. Chevrier, and D. Desor. Hamelin: A model for collective adaptation based on internal stimuli. In S. Schaal, A. Ijspeert, A. Billard, S. Vijayakumar, J. Hallam, and J.-A. Meyer, editors, From animal to animats 8 - Eighth International Conference on the Simulation of Adaptive Behaviour 2004 - SAB'04, Los Angeles, USA, pages 425--434, Jul 2004.Google ScholarGoogle Scholar
  1. A distributed stand-in agent based algorithm for opportunistic resource allocation

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SAC '06: Proceedings of the 2006 ACM symposium on Applied computing
      April 2006
      1967 pages
      ISBN:1595931082
      DOI:10.1145/1141277

      Copyright © 2006 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 23 April 2006

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      Overall Acceptance Rate1,650of6,669submissions,25%
    • Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader