IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v56y2013i4p1653-1666.html
   My bibliography  Save this article

Constant-approximation for optimal data aggregation with physical interference

Author

Listed:
  • Hongwei Du
  • Zhao Zhang
  • Weili Wu
  • Lidong Wu
  • Kai Xing

Abstract

In this paper, we study the aggregation problem with power control under the physical interference. The maximum power is bounded. The goal is to assign power to nodes and schedule transmissions toward the sink without physical interferences such that the total number of time slots is minimized. Under the assumption that the unit disk graph G δ r with transmission range δ r is connected for some constant 0 > δ ≤ 1/3 1/α , where r is the maximum transmission range determined by the maximum power, an approximation algorithm is presented with at most b 3 (log 2 n + 6) + (R−1)(μ 1 + μ 2 ) time slots, where n is the number of nodes, R is the radius of graph G δ r with respect to the sink, and b, μ 1 , μ 2 are constants. Since both R and log 2 n are lower bounds for the optimal latency of aggregation in the unit disk graph G δ r , our algorithm has a constant-approximation ratio for the aggregation problem in G δ r . Copyright Springer Science+Business Media, LLC. 2013

Suggested Citation

  • Hongwei Du & Zhao Zhang & Weili Wu & Lidong Wu & Kai Xing, 2013. "Constant-approximation for optimal data aggregation with physical interference," Journal of Global Optimization, Springer, vol. 56(4), pages 1653-1666, August.
    • Handle: RePEc:spr:jglopt:v:56:y:2013:i:4:p:1653-1666
    DOI: 10.1007/s10898-012-9939-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-012-9939-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-012-9939-7?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:jglopt:v:56:y:2013:i:4:p:1653-1666. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.