IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v11y2006i2d10.1007_s10878-006-7140-y.html
   My bibliography  Save this article

On optimal placement of relay nodes for reliable connectivity in wireless sensor networks

Author

Listed:
  • Hai Liu

    (City University of Hong Kong)

  • Pengjun Wan

    (City University of Hong Kong
    Illinois Institute of Technology)

  • Xiaohua Jia

    (City University of Hong Kong)

Abstract

The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in Euclidean plane, our objective is to place minimum number of relay nodes to forward data packets from sensor nodes to the sink, such that: 1) the network is connected, 2) the network is 2-connected. For case one, we propose a (6+ε)-approximation algorithm for any ε > 0 with polynomial running time when ε is fixed. For case two, we propose two approximation algorithms with (24+ε) and (6/T+12+ε), respectively, where T is the ratio of the number of relay nodes placed in case one to the number of sensors. We further extend the results to the cases where communication radiuses of sensor nodes and relay nodes are different from each other.

Suggested Citation

  • Hai Liu & Pengjun Wan & Xiaohua Jia, 2006. "On optimal placement of relay nodes for reliable connectivity in wireless sensor networks," Journal of Combinatorial Optimization, Springer, vol. 11(2), pages 249-260, March.
    • Handle: RePEc:spr:jcomop:v:11:y:2006:i:2:d:10.1007_s10878-006-7140-y
    DOI: 10.1007/s10878-006-7140-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-006-7140-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-006-7140-y?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:jcomop:v:11:y:2006:i:2:d:10.1007_s10878-006-7140-y. 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.