IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v26y2013i3d10.1007_s10878-012-9451-5.html
   My bibliography  Save this article

Relay node placement in two-tiered wireless sensor networks with base stations

Author

Listed:
  • Guangting Chen

    (Hangzhou Dianzi University)

  • Suhui Cui

    (Hangzhou Dianzi University)

Abstract

This paper addresses the relay node placement problem in two-tiered wireless sensor networks with base stations, which aims to deploy a minimum number of relay nodes to achieve certain coverage and connectivity requirement. Under the assumption that the communication range of the sensor nodes is no more than that of the relay node, we present a polynomial time (5+ϵ)-approximation algorithm for the 1-coverage 1-connected problem. Furthermore, we consider the fault tolerant problem in the network, we present a polynomial time (20+ϵ)-approximation algorithm for the 2-coverage 2-connected problem, where ϵ is any given positive constant. For the k-coverage 2-connected situation, we present a polynomial time (15k−10+ϵ)-approximation algorithm.

Suggested Citation

  • Guangting Chen & Suhui Cui, 2013. "Relay node placement in two-tiered wireless sensor networks with base stations," Journal of Combinatorial Optimization, Springer, vol. 26(3), pages 499-508, October.
  • Handle: RePEc:spr:jcomop:v:26:y:2013:i:3:d:10.1007_s10878-012-9451-5
    DOI: 10.1007/s10878-012-9451-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-012-9451-5
    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-012-9451-5?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jing Gao & Jianzhong Li & Yingshu Li, 2016. "Approximate event detection over multi-modal sensing data," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1002-1016, November.
    2. Yan Zhang & Hongzhi Wang & Hong Gao & Jianzhong Li, 2016. "Efficient accuracy evaluation for multi-modal sensed data," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1068-1088, November.
    3. Ran Bi & Jianzhong Li & Hong Gao & Yingshu Li, 2016. "$$(\alpha , \tau )$$ ( α , τ ) -Monitoring for event detection in wireless sensor networks," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 985-1001, November.

    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:26:y:2013:i:3:d:10.1007_s10878-012-9451-5. 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.