Many trust-aware routing algorithms have been proposed in order to reliably deliver data packets from sensor nodes to the base station in wireless sensor networks (WSNs) where there exist inside attackers. In these approaches, a trust mechanism is adopted for each node to measure its neighbors' trustworthiness so the node can send data packets only to the trustworthy neighbors. A false alarm occurs when a good node is considered as untrustworthy. We propose a False Alarm DEtection and Recovery (FADER) technique which enables us to identify and reuse these false alarmed nodes. By doing so, we can improve the performance of the trust-aware routing protocol in terms of many metrics such as the network lifetime, the packet delivery rate, and many routing performance measures. We have conducted extensive OPNET simulations and the results confirm these claimed advantages of our proposed FADER approach over a representative trust-aware routing algorithm. The results show that FADER is able to recover 60–70% of the false alarms without recovering any of the attackers.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    FADER: False alarm detection and recovery for trust-aware routing in wireless sensor networks


    Beteiligte:
    Cho, Youngho (Autor:in) / Qu, Gang (Autor:in)


    Erscheinungsdatum :

    01.12.2013


    Format / Umfang :

    135063 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Activity-aware & energy balance based routing protocol for wireless sensor networks

    Chengliang, W. / Qiang, W. | British Library Online Contents | 2014



    Buried fiber intrusion detection sensor with minimal false alarm rates [3489-05]

    Bush, I. J. / Davis, C. A. / Davis, P. G. et al. | British Library Conference Proceedings | 1998


    On false alarm mitigation

    Bock, J.R. / Brotherton, T. / Grabill, P. et al. | IEEE | 2006