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

A Multimodel Based Range Query Processing Algorithm for Information Collection in CPS

Author

Listed:
  • Guilin Li
  • Xing Gao
  • Longjiang Guo
  • JunCong Lin
  • Ying Gao
  • Minghong Liao

Abstract

A multimodel based range query processing algorithm is proposed to solve the information collection task for the CPSs, which utilizes multiple probability models to depict the data distribution of a sensor node. The execution of the multimodel based algorithm consists of two phases, which are the preprocessing phase and the query processing phase. During the preprocessing phase, multiple models are constructed for each node according to their historical data. During the query processing phase, a suitable model is selected from the multiple models with the help of a sampling based algorithm, which is used to process the query. As the multimodel based algorithm needs to sample data from the network, it can waste energy more than that of the single model based algorithm in some cases, which does not sample data from the network. The cost of the multimodel based and single model based algorithm is analyzed. A cost model based algorithm is proposed to select a better algorithm to process a query from the two algorithms. Experimental results show that the cost model based algorithm can save 13.3% energy consumption more than that of the single model based algorithm.

Suggested Citation

  • Guilin Li & Xing Gao & Longjiang Guo & JunCong Lin & Ying Gao & Minghong Liao, 2015. "A Multimodel Based Range Query Processing Algorithm for Information Collection in CPS," International Journal of Distributed Sensor Networks, , vol. 11(8), pages 403267-4032, August.
    • Handle: RePEc:sae:intdis:v:11:y:2015:i:8:p:403267
    DOI: 10.1155/2015/403267
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/403267
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/403267?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:11:y:2015:i:8:p:403267. 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.