IDEAS home Printed from https://ideas.repec.org/a/wly/intnem/v27y2017i3ne1932.html
   My bibliography  Save this article

On efficient data storage service for IoT

Author

Listed:
  • Konrad Karolewicz
  • Andrzej Beben
  • Jordi Mongay Batalla
  • George Mastorakis
  • Constandinos X. Mavromoustakis

Abstract

The increasing popularity of Internet of Things (IoT) services causes tremendous growth of the amount of produced data. These data must be effectively stored and retrieved by the IoT service providers. The solution is to access the data through application programming interfaces. The paper focuses on the problem of designing an effective data storage service for IoT, which will be available through the universal application programming interface. We propose and analyze eight variants of the distributed data storage service that differ in the database structure, that is, the hierarchical structure based on Data‐Oriented Network Architecture or the flat structure based on distributed hash table, the type of stored records, and the memory management algorithm that decides about using cache or base memory. The proposed solutions have been evaluated in the comprehensive simulation studies. The obtained results confirmed the effectiveness of the preferred solution with Dynamic Routing Records stored in the cache memory. Copyright © 2016 John Wiley & Sons, Ltd.

Suggested Citation

  • Konrad Karolewicz & Andrzej Beben & Jordi Mongay Batalla & George Mastorakis & Constandinos X. Mavromoustakis, 2017. "On efficient data storage service for IoT," International Journal of Network Management, John Wiley & Sons, vol. 27(3), May.
    • Handle: RePEc:wly:intnem:v:27:y:2017:i:3:n:e1932
    DOI: 10.1002/nem.1932
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.1932
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nem.1932?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:wly:intnem:v:27:y:2017:i:3:n:e1932. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .

    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.