IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v1y2005i3-4p305-327.html
   My bibliography  Save this article

An Architecture for Robust Sensor Network Communications

Author

Listed:
  • Ossama Younis

    (Department of Electrical & Computer Engineering, University of Arizona, USA)

  • Sonia Fahmy

    (Department of Computer Science, Purdue University, USA)

  • Paolo Santi

    (Instituto di Informatica e Telematica, CNR, Pisa, Italy)

Abstract

Node clustering in sensor networks increases scalability, robustness, and energy-efficiency. In hostile environments, unexpected failures or attacks on cluster heads (through which communication takes place) may partition the network or degrade application performance. We propose REED (Robust Energy-Efficient Distributed clustering), for clustering sensors deployed in hostile environments in an interleaved manner with low complexity. Our primary objective is to construct a k -fault-tolerant (i.e., k -connected) clustered network, where k is a constant determined by the application. Fault tolerance is achieved by selecting k independent sets of cluster heads (i.e., cluster head overlays) on top of the physical network, so that each node can quickly switch to other cluster heads in case of failures. The independent cluster head overlays also give multiple vertex-disjoint routing paths for load balancing and security. Network lifetime is prolonged by selecting cluster heads with high residual energy and low communication cost, and periodically re-clustering the network. We prove that REED asymptotically achieves k -connectivity if certain conditions on node density are met. We also discuss inter-cluster routing and MAC layer considerations, and investigate REED clustering properties via extensive simulations.

Suggested Citation

  • Ossama Younis & Sonia Fahmy & Paolo Santi, 2005. "An Architecture for Robust Sensor Network Communications," International Journal of Distributed Sensor Networks, , vol. 1(3-4), pages 305-327, July.
  • Handle: RePEc:sae:intdis:v:1:y:2005:i:3-4:p:305-327
    DOI: 10.1080/15501320500330786
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1080/15501320500330786
    Download Restriction: no

    File URL: https://libkey.io/10.1080/15501320500330786?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
    ---><---

    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:sae:intdis:v:1:y:2005:i:3-4:p:305-327. 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: SAGE Publications (email available below). General contact details of provider: .

    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.