IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i9p464703.html
   My bibliography  Save this article

Hybrid Ant Algorithm Based Query Processing with Multiagents in Sensor Networks

Author

Listed:
  • Jianping Yu
  • Lianming Zhang
  • Ming Chen
  • Xingting Liu

Abstract

The wireless sensor networks are usually deployed in various application-specific contexts, which can be treated as distributed databases with big data. The event-involved query responses can be obtained by issuing query requests to this kind of database. However, the constraints of the energy and delay have had a great impact on the operation of wireless sensor networks. How to design the query-involved network model and the corresponding query processing algorithms is extremely challenging. This work investigates query processing problem in resource-constrained wireless sensor networks with the two-tier architecture and multiple query agents, where the multiple nodes of query agents are configured in the networks and the corresponding source cluster-heads send collected events to only one optimum query agent. To reduce the energy consumption and shorten the delivery delay, an efficient query processing algorithm inspired by the swarm intelligence of ants is proposed, which takes advantage of the beneficial clustering and routing emerging in a hybrid self-organized way from the positive interaction of ants. The experimental results demonstrated that the proposed algorithm can deliver collected events to the optimum query agents efficiently. Not only is the energy cost reduced but also the delivery delay is shortened significantly when transmitting the named events to the appropriate query agents.

Suggested Citation

  • Jianping Yu & Lianming Zhang & Ming Chen & Xingting Liu, 2013. "Hybrid Ant Algorithm Based Query Processing with Multiagents in Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 9(9), pages 464703-4647, September.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:9:p:464703
    DOI: 10.1155/2013/464703
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/464703
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/464703?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:9:y:2013:i:9:p:464703. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.