Skip to main content

Multi-agent ERA Model Based on Belief Interaction Solves Wireless Sensor Networks Routing Problem

  • Conference paper
Hybrid Artificial Intelligence Systems (HAIS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5271))

Included in the following conference series:

Abstract

ERA is the acronym of environment, reactive rules and agent. The model is a new effective multi-agent cooperation framework, which has been successfully applied in a wide range of fields. This paper presents the concept of belief into multi agent system. Each agent stands for a feasible routing, it moves according to its own belief matrix in the sensor networks environment. Agent has the ability to evaluate and adjust its belief matrix according to the historical routing. Agents will interact their believes to each other when they meet at the same sensor node. This paper employs a large number of data and other classical models to evaluate the algorithm, the experimental results show that this model prolongs the lifetime of wireless sensor network by reducing energy dissipation, which validates the algorithm’s feasibility and availability.

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 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 179.00
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. Weiss, G.: Multi-agent systems: A modern approach to distributed artificial intelligence. MIT Press, Cambridge (1999)

    Google Scholar 

  2. Petrie, C.J.: Agent-based engineering: the web and intelligence. IEEE Intelligent Systems and Their Applications, 24–29 (1996)

    Google Scholar 

  3. Jennings, N.R., Corera, J.M., Laresgoiti: Developing industrial multi-agent systems. In: Proceedings of the First International Conference on multi-agent Systems, ICMAS, pp. 423–430

    Google Scholar 

  4. Neves, M.C., Oliveira, E.: A Control Architecture for an Autonomous Mobile Robot. In: Agents 1997. ACM, New York (1997)

    Google Scholar 

  5. Ljungberg, M., Lucas, A.: The OASIS air-traffic management system. In: Proceedings of the Second Pacific Rim International conference on Artificial Intelligence, PRI-CAI 1992, Seul, Korea (1992)

    Google Scholar 

  6. Julian, V., Carrascosa, C., Soler, J.: Una Arquitectura de Sistema Multi-Agente para laRecuperacióny Presentación de Información. In: IV Congreso ISKO-España, EOCONSID 1999, pp. 291–296 (1999)

    Google Scholar 

  7. Liu, J., Jing, H., Tang, Y.Y.: Multi-agent oriented constraint satisfaction. Artificial Intelligence, S0004-3702(01)00174-6/FLA, 1–41 (2004)

    Google Scholar 

  8. Akyildiz, I.F., et al.: Wireless sensor networks: a survey. Computer Networks 38, 393–422 (2002)

    Article  Google Scholar 

  9. Wei, Z.X., Bin, L., Ping, Q.B.: Research on Routing Algorithm for wireless Sensor Network. Chinese journal of sensors and actuators 19(2), 463–467 (1999)

    Google Scholar 

  10. Feng-Yuan, R., Hai-Ning, H., Chuang, L.: Wireless Sensor Networks. Journal of Software 7, 1282–1292 (2003)

    Google Scholar 

  11. Mainwaring, A.: Wireless Sensor Networks for Habitat Monitoring. In: WSNA 2002, Atlanta, Georgia, USA (2002)

    Google Scholar 

  12. Park, J., Sahni, S.: An Online Heuristic for Maximum Lifetime Routing in Wireless Sensor Networks. IEEE Transactions On Computers 55(8), 1048–1057 (2006)

    Article  Google Scholar 

  13. Karlof, C., Wagner, D.: Secure routing in wireless sensor networks: attacks and countermeasures. Ad Hoc Networks, 293–315 (2003)

    Google Scholar 

  14. Tao, C.Y., Chen, H., Jun, W., Quasn, W.W.: An Energy Efficient Routing Algorithm for Mobile Agents in Wireless Sensor Networks. Journal of shanghai jiao tong university 40(3), 520–523 (2006)

    Google Scholar 

  15. Swarm Development Group, Swarm simulation system, http://www.swarm.org/index.html

  16. Rao, A.S., Georgeff, M.P.: BDI Agents, From Theory to Practice. In: The Proceedings of the First International Conference on Multi-Agent-System (ICMAS), SanFrancisco (1995)

    Google Scholar 

  17. Rao, A.S., Georgeff, M.P.: Modeling rational agents within a BDI-architecture. In: Proceedings of the 2rd International Conference on Principles of Knowledge Representation and Reasoning, pp. 473–484. Morgan Kaufmann Publishers, San Mateo (1991)

    Google Scholar 

  18. Current, J.T., Schilling, D.A.: The covering salesman problem. Transportation Science 24(3), 208–213 (1989)

    Article  MathSciNet  Google Scholar 

  19. Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374–387 (1998)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, Y., Zhou, C., Wang, K., Li, D., Guo, D. (2008). Multi-agent ERA Model Based on Belief Interaction Solves Wireless Sensor Networks Routing Problem. In: Corchado, E., Abraham, A., Pedrycz, W. (eds) Hybrid Artificial Intelligence Systems. HAIS 2008. Lecture Notes in Computer Science(), vol 5271. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87656-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87656-4_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87655-7

  • Online ISBN: 978-3-540-87656-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics