• DocumentCode
    2539447
  • Title

    Self-* distributed query region covering in sensor networks

  • Author

    Datta, Ajoy K. ; Gradinariu, Maria ; Linga, Preethi ; Raipin-Parvédy, Philippe

  • Author_Institution
    Sch. of Comput. Sci., Nevada Univ., Las Vegas, NV, USA
  • fYear
    2005
  • fDate
    26-28 Oct. 2005
  • Firstpage
    50
  • Lastpage
    59
  • Abstract
    In this paper, we design self-* novel solutions to the minimal connected sensor cover problem. The concept of self-* is used to include fault-tolerant properties like self-configuring, self-reconfiguring/self-healing, etc. We present two self-stabilizing, fully distributed, strictly localized, and scalable solutions, and show that these solutions are both self-configuring and self-healing. The proposed solutions are space optimal in terms of the number of states used per node. Another feature of the proposed algorithms is that the faults are contained only within the neighborhood of the faulty nodes. This paper also includes a comparison of the performance of the two proposed solutions in terms of the stabilization time, cover size metrics, and ability to cope with transient and permanent faults.
  • Keywords
    distributed algorithms; fault tolerant computing; wireless sensor networks; fault-tolerant property; minimal connected sensor cover problem; self-* distributed query region covering problem; self-configuring property; self-healing property; sensor network; Batteries; Computer science; Computer vision; Fault tolerance; Intelligent networks; Military computing; Personal digital assistants; Pervasive computing; Ubiquitous computing; Wireless sensor networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Reliable Distributed Systems, 2005. SRDS 2005. 24th IEEE Symposium on
  • Print_ISBN
    0-7695-2463-X
  • Type

    conf

  • DOI
    10.1109/RELDIS.2005.27
  • Filename
    1541184