skip to main content
10.1145/1514274.1514290acmconferencesArticle/Chapter ViewAbstractPublication PageswisecConference Proceedingsconference-collections
research-article

REAct: resource-efficient accountability for nodemisbehavior in ad hoc networks based on random audits

Published: 16 March 2009 Publication History

Abstract

Wireless ad hoc networks rely on multi-hop routes to transport data from source to destination. The routing function is implemented in a collaborative manner, with each node responsible for relaying traffic to the destination. However, an increasingly sophisticated pool of users with easy access to commercial wireless devices, combined with the poor physical and software security of the devices, can lead to node misconfiguration or misbehavior. A misbehaving node may refuse to forward packets in order to conserve its energy (selfishness), or simply degrade network performance (maliciousness).
In this paper, we investigate the problem of uniquely identifying the set of misbehaving nodes who refuse to forward packets. We propose a novel misbehavior identification scheme called REAct that provides resource-efficient accountability for node misbehavior. REAct identifies misbehaving nodes based on a series of random audits triggered upon a performance drop. We show that a source-destination pair using REAct can identify any number of independently misbehaving nodes based on behavioral proofs provided by nodes. Proofs are constructed using Bloom filters which are storage-efficient membership structures, thus significantly reducing the communication overhead for misbehavior detection.

References

[1]
B. Awerbuch, D. Holmer, C.-N. Rotaru, and H. Rubens. An on-demand secure routing protocol resilient to byzantine failures. In WiSe 2002, 2002.
[2]
K. Balakrishnan, J. Deng, and P. K. Varshney. Twoack: Preventing selfishness in mobile ad hoc networks. In WCNC 2005, 2005.
[3]
B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422--426, 1970.
[4]
A. Broder and M. Mitzenmacher. Network applications of Bloom filters: A survey. Internet Mathematics, 1(4):485--509, 2004.
[5]
S. Buchegger and J.-Y. L. Boudec. Performance analysis of the confidant protocol cooperation of nodes: Fairness in dynamic ad-hoc networks. In MobiHOC 2002, June 2002.
[6]
S. Buchegger and J.-Y. L. Boudec. Self-policing mobile ad-hoc networks by reputation systems. IEEE Communications Magazine, pages 101--107, 2005.
[7]
L. Buttyan and J.-P. Hubaux. Stimulating cooperation in self-organizing mobile ad hoc networks. ACM Kluwer Mobile Networks and Applications, 8(5), 2003.
[8]
J. Dyer, M. Lindemann, R. Perez, R. Sailer, and L. van Doorn. Building the ibm 4758 secure coprocessor. IEEE Computer, 34:57--66, October 2001.
[9]
L. M. Feeney and M. Nilsson. Investigating the energy consumption of a wireless network interface in an ad hoc networking environment. In INFOCOM 2001.
[10]
V. Gligor. Handling new adversaries in secure mobile ad-hoc networks. In ESNS 2007, 2007.
[11]
Q. He, D. Wu, and P. Khosla. Sori: A secure and objective reputation-based incentive scheme for ad hoc networks. In WCNC 2004, 2004.
[12]
M. Jakobsson, J.-P. Hubaux, and L. Buttyan. A micropayment scheme encouraging collaboration in multi-hop cellular networks. In Financial Crypto, 2003.
[13]
D. Johnson, D. Maltz, and Y.-C. Hu. The dynamic source routing protocol for mobile ad hoc networks draft-ietf-manet-dsr-09.txt, 2003.
[14]
A. Liu and P. Ning. Tinyecc: A configurable library for elliptic curve cryptography in wireless sensor networks. In IPSN 2008. SPOTS Track, 2008.
[15]
K. Liu, J. Deng, P. Varshney, and K. Balakrishnan. An acknowledgment-based approach for the detection of routing misbehavior in manets. IEEE Transactions on Mobile Computing, 6(5):536--550, May 2006.
[16]
Y. Liu and Y. R. Yang. Reputation propagation and agreement in mobile ad-hoc networks. In WCNC 2003, pages 1510--1515, March 2003.
[17]
S. Marti, T. Giuli, K. Lai, and M. Baker. Mitigating routing misbehavior in mobile ad hoc networks. In MobiCom 2000, pages 255--265, 2000.
[18]
M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow. TCP selective acknowledgment options. RFC 2018.
[19]
P. Michiardi and R. Molva. Core: A collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. In CMS 2002, 2002.
[20]
V.-N. Padmanabhan and D.-R. Simon. Secure traceroute to detect faulty or malicious routing. SIGCOMM Computer Communication, 33(1), 2003.
[21]
K. Paul and D. Westhoff. Context aware detection of selfish nodes in dsr based ad-hoc networks. In IEEE Globecom, 2002.
[22]
Y. Xue and K. Nahrstedt. Providing fault-tolerant ad-hoc routing service in adversarial environments. Wireless Personal Communications, Special Issue on Security for Next Generation Communications, 29(3-4):367--388, 2004.
[23]
S. Zhong, J. Chen, and Y. R. Yang. Sprite: A simple cheat-proof, credit-based system for mobile ad-hoc networks. In INFOCOM 2003, pages 1987--1997.

Cited By

View all
  • (2022)A Bio inspired optimization with Reliable QoS Routing through Efficient Packet Transmission in Mobile ad-hoc NetworkRenewable Energy Focus10.1016/j.ref.2022.03.00341(188-197)Online publication date: Jun-2022
  • (2020)Preventing Collaborative Black Hole Attack in IoT Construction Using a CBHA–AODV Routing ProtocolInternational Journal of Grid and High Performance Computing10.4018/IJGHPC.202004010212:2(25-46)Online publication date: Apr-2020
  • (2020)IPHDBCMCryptography10.4018/978-1-7998-1763-5.ch005(72-97)Online publication date: 2020
  • Show More Cited By
  1. REAct: resource-efficient accountability for nodemisbehavior in ad hoc networks based on random audits

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    WiSec '09: Proceedings of the second ACM conference on Wireless network security
    March 2009
    280 pages
    ISBN:9781605584607
    DOI:10.1145/1514274
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 16 March 2009

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. ad hoc networks
    2. bloom filter
    3. misbehavior
    4. routing

    Qualifiers

    • Research-article

    Conference

    WISEC '09
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 98 of 338 submissions, 29%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)8
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 20 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)A Bio inspired optimization with Reliable QoS Routing through Efficient Packet Transmission in Mobile ad-hoc NetworkRenewable Energy Focus10.1016/j.ref.2022.03.00341(188-197)Online publication date: Jun-2022
    • (2020)Preventing Collaborative Black Hole Attack in IoT Construction Using a CBHA–AODV Routing ProtocolInternational Journal of Grid and High Performance Computing10.4018/IJGHPC.202004010212:2(25-46)Online publication date: Apr-2020
    • (2020)IPHDBCMCryptography10.4018/978-1-7998-1763-5.ch005(72-97)Online publication date: 2020
    • (2020)A Comprehensive Survey of Routing Attacks in Wireless Mobile Ad hoc Networks2020 International Conference on Inventive Computation Technologies (ICICT)10.1109/ICICT48043.2020.9112588(396-402)Online publication date: Feb-2020
    • (2019)An Efficient Routing Algorithm for Handling Selfish Behavior of Nodes in WSN's: By Using Prisoner's Dilemma Problem2019 4th International Conference on Information Systems and Computer Networks (ISCON)10.1109/ISCON47742.2019.9036222(738-741)Online publication date: Nov-2019
    • (2018)Efficient Transmission and Trust Based Protocol in Mobile Ad Hoc Networks2018 International Conference on Soft-computing and Network Security (ICSNS)10.1109/ICSNS.2018.8573673(1-7)Online publication date: Feb-2018
    • (2018)Behaviour Analysis and Detection of Blackhole Attacker Node under Reactive Routing Protocol in MANETs2018 International Conference on Networking, Embedded and Wireless Systems (ICNEWS)10.1109/ICNEWS.2018.8903972(1-5)Online publication date: Dec-2018
    • (2018)SQMAA: Security, QoS and Mobility Aware ACO Based Opportunistic Routing Protocol for MANET2018 4th International Conference for Convergence in Technology (I2CT)10.1109/I2CT42659.2018.9058022(1-6)Online publication date: Oct-2018
    • (2018)An Enhanced AODV Protocol for Avoiding Black Holes in MANETProcedia Computer Science10.1016/j.procs.2018.07.196134(371-376)Online publication date: 2018
    • (2018)Leveraging fog computing and software defined systems for selective forwarding attacks detection in mobile wireless sensor networksTransactions on Emerging Telecommunications Technologies10.1002/ett.318329:4Online publication date: 6-Apr-2018
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media