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

MIDAS: A Data Aggregation Scheduling Scheme for Variable Aggregation Rate WSNs

Author

Listed:
  • Jun Long
  • An He
  • Jinhuan Zhang
  • Hao Zhang

Abstract

Data aggregation scheduling for variable aggregation rate model has wide application and should take network lifetime and energy efficiency into consideration. In this paper, the time-slot scheduling problem for the variable aggregation rate model is presented, and a time-slot scheduling integrating consideration of minimizing the energy consumption named Makeup Integer based Data Aggregation Scheduling (MIDAS) is proposed. The proposed MIDAS scheme integrates two core phases, namely, data aggregation set construction and aggregation set based scheduling algorithm. The key idea of MIDAS is to minimize the number of receiving and sending data packets in hotspot and to reduce the number of aggregated packets in network for better scheduling performance in network lifetime. Furthermore, it is also essential to increase energy utilization efficiency of the nodes in the middle layer by exploiting the remaining energy of peripheral nodes. A series of experiments are simulated to demonstrate that the proposed scheme has significantly increased the network lifetime and the energy utilization efficiency under the different aggregation rates and different network scales. Comparing with the SDAS, the lifetime can be increased by as much as 25%. The energy utilization efficiency can be improved by as much as 30%.

Suggested Citation

  • Jun Long & An He & Jinhuan Zhang & Hao Zhang, 2015. "MIDAS: A Data Aggregation Scheduling Scheme for Variable Aggregation Rate WSNs," International Journal of Distributed Sensor Networks, , vol. 11(10), pages 631937-6319, October.
  • Handle: RePEc:sae:intdis:v:11:y:2015:i:10:p:631937
    DOI: 10.1155/2015/631937
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/631937
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/631937?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:10:p:631937. 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.