IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i11p646781.html
   My bibliography  Save this article

LIRT: A Lightweight Scheme for Indistinguishability, Reachability, and Timeliness in Wireless Sensor Control Networks

Author

Listed:
  • Wei Ren
  • Liangli Ma
  • Yi Ren

Abstract

Wireless sensor control networks (WSCNs) are important scenarios and trends in mobile wireless sensor networks. Compared with traditional wireless sensor networks, WSCNs have two specific characteristics: entities in networks are extended from passive sensors to active sensors (e.g., actuators and actors) and the transmitting messages are extended from data only to data plus (e.g., data and control instructions). Thus new security problems arises. In this paper, we make the first attempt to specify the security requirements for WSCNs, namely, indistinguishability, reachability, and timeliness. In addition, several new attacks in WSCN, distinguishing risks, dropping attacks, and disordering attacks, are pointed out at the first time. A lightweight scheme LIRT is proposed with tailored design to guarantee the indistinguishability, reachability, and timeliness in WSCNs. Extensive and rigorous analysis on LIRT justifies its security strength and performance measures.

Suggested Citation

  • Wei Ren & Liangli Ma & Yi Ren, 2013. "LIRT: A Lightweight Scheme for Indistinguishability, Reachability, and Timeliness in Wireless Sensor Control Networks," International Journal of Distributed Sensor Networks, , vol. 9(11), pages 646781-6467, November.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:11:p:646781
    DOI: 10.1155/2013/646781
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/646781
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/646781?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:9:y:2013:i:11:p:646781. 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.