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

Data transmission optimization algorithm for network utility maximization in wireless sensor networks

Author

Listed:
  • Chengtie Li
  • Jinkuan Wang
  • Mingwei Li

Abstract

We provide a joint scheme for rate control, scheduling, routing, and power control protocol for wireless sensor networks based on compressive sensing. Using a network utility maximization formulation, we present cross-layer optimization solutions using Lagrangian multipliers in the transport, network, media access control, and physical layers. Inspired by compressive sensing, we focus on the construction of utility functions based on the constraints of the link capacity, rate, routing, and power to decrease the computational cost, accelerate the convergence rate, and degrade the error ratio. The optimization solutions are developed by solving the optimization model of network utility maximization. We prove the effectiveness by the theory analysis at the stability of the transmission rate and error ratio. Finally, simulation results demonstrate the performance in terms of stability of the error ratio of compressive sensing, energy consumption, and transmission delay in wireless sensor networks.

Suggested Citation

  • Chengtie Li & Jinkuan Wang & Mingwei Li, 2016. "Data transmission optimization algorithm for network utility maximization in wireless sensor networks," International Journal of Distributed Sensor Networks, , vol. 12(9), pages 15501477166, September.
    • Handle: RePEc:sae:intdis:v:12:y:2016:i:9:p:1550147716670646
    DOI: 10.1177/1550147716670646
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147716670646
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147716670646?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
    ---><---

    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:12:y:2016:i:9:p:1550147716670646. 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.