Ant-based delay-sensitive query processing for wireless sensor networks

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The sensor networks are often deployed in diverse application specific contexts, which can be treated as distributed databases. The event-involved responses can be obtained by issuing queries to this kind of database. Certain of the applications with real-time requirement have tight constraints on query delay. However, the existing query algorithms are not satisfied with them. Aiming at the special kind of applications, a delay-sensitive query processing algorithm taking advantages of ant colony optimization with the characteristics of self-organization and positive feedback is proposed, in which priority-based multiplering storage scheme and ant-based distributed search mechanism are adopted to improve the integrated performance of the energy-efficiency, delay and query success rate. The simulation results demonstrated that not only the performance of energy-efficiency and query success rate can be improved but also significant smaller query delay can be achieved by the proposed algorithm when comparing with other query processing algorithms.

Cite

CITATION STYLE

APA

Yu, J., Lin, Y., & Hu, Y. (2008). Ant-based delay-sensitive query processing for wireless sensor networks. In Proceedings of International Symposium on Advances in Computer and Sensor Networks and Systems, 2008. Aardvark Global Publishing. https://doi.org/10.1080/15501320802520647

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free