• DocumentCode
    2669071
  • Title

    Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms

  • Author

    Zhang, Weiyi ; Xue, Guoliang ; Misra, Satyajayant

  • Author_Institution
    Arizona State Univ., Tempe
  • fYear
    2007
  • fDate
    6-12 May 2007
  • Firstpage
    1649
  • Lastpage
    1657
  • Abstract
    Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to prolong sensor network lifetime is to deploy some relay nodes whose main function is to communicate with the sensor nodes, other relay nodes, and the basestations. It is desirable to deploy a minimum number of relay nodes to achieve certain connectivity requirement. In this paper, we study four related fault-tolerant relay node placement problems, each of which has been previously studied only in some restricted form. For each of them, we discuss its computational complexity and present a polynomial time O(1)-approximation algorithm with a small approximation ratio. When the problem reduces to a previously studied form, our algorithm either improves the previous best algorithm or reduces to the previous best algorithm.
  • Keywords
    approximation theory; computational complexity; fault tolerance; wireless sensor networks; computational complexity; fault-tolerant relay node placement; polynomial time approximation algorithm; prolong sensor network lifetime; wireless sensor network; Approximation algorithms; Communications Society; Computational complexity; Fault tolerance; Peer to peer computing; Polynomials; Relays; Routing; Tin; Wireless sensor networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE
  • Conference_Location
    Anchorage, AK
  • ISSN
    0743-166X
  • Print_ISBN
    1-4244-1047-9
  • Type

    conf

  • DOI
    10.1109/INFCOM.2007.193
  • Filename
    4215775