Conference Paper

MUTON: Detecting Malicious Nodes in Disruption-Tolerant Networks

Dept. of ECE, Stevens Inst. of Technol., Hoboken, NJ, USA
DOI: 10.1109/WCNC.2010.5506574 Conference: Wireless Communications and Networking Conference (WCNC), 2010 IEEE
Source: IEEE Xplore

ABSTRACT The Disruption Tolerant Networks (DTNs) are vulnerable to insider attacks, in which the legitimate nodes are compromised and the adversary modifies the delivery metrics of the node to launch harmful attacks in the networks. The traditional detection approaches of secure routing protocols can not address such kind of insider attacks in DTNs. In this paper, we propose a mutual correlation detection scheme (MUTON) for addressing these insider attacks. MUTON takes into consideration of the transitive property when calculating the packet delivery probability of each node and correlates the information collected from other nodes. We evaluated our approach through extensive simulations using both Random Way Point and Zebranet mobility models. Our results show that MUTON can detect insider attacks efficiently with high detection rate and low false positive rate.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Secure group communication is a paradigm that primarily designates one-to-many communication security. The proposed works relevant to secure group communication have predominantly considered the whole network as being a single group managed by a central powerful node capable of supporting heavy communication, computation and storage cost. However, a typical Wireless Sensor Network (WSN) may contain several groups, and each one is maintained by a sensor node (the group controller) with constrained resources. Moreover, the previously proposed schemes require a multicast routing support to deliver the rekeying messages. Nevertheless, multicast routing can incur heavy storage and communication overheads in the case of a wireless sensor network. Due to these two major limitations, we have reckoned it necessary to propose a new secure group communication with a lightweight rekeying process. Our proposal overcomes the two limitations mentioned above, and can be applied to a homogeneous WSN with resource-constrained nodes with no need for a multicast routing support. Actually, the analysis and simulation results have clearly demonstrated that our scheme outperforms the previous well-known solutions.
    Ad Hoc Networks 09/2012; 10(7):2012. DOI:10.1016/j.adhoc.2012.03.003 · 1.94 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Routing in delay tolerant networks (DTNs) is challenging due to their unique characteristics of intermittent node connectivity. Different protocols (single-copy, multi-copy, erasure-coding-based etc.) utilizing store-carry-and-forward paradigm are proposed to achieve routing of messages in such environments by opportunistic message exchanges between nodes that are in the communication range of each other. The sparsity and distributed nature of these networks together with the lack of stable connectivity between source destination pairs make these networks vulnerable to malicious nodes which might attempt to learn the content of the messages being routed between the nodes. In this paper, we consider DTNs in which malicious nodes are present, to which we refer to as compromised DTNs. We discuss and analyze the effects of presence of malicious nodes in the compromised DTN on routing of messages. We propose a two period routing approach which aims to achieve desired delivery ratio by a given delivery deadline in presence of malicious nodes. Our results show that, with proper parameter setting, the desired delivery ratio by a given delivery deadline can be achieved most of the time by the proposed method.
    Computer Communications and Networks (ICCCN), 2011 Proceedings of 20th International Conference on; 09/2011
  • [Show abstract] [Hide abstract]
    ABSTRACT: Unlike the conventional routing techniques in the Internet where routing privileges are given to trustworthy and fully authenticated nodes, Delay Tolerant Networks (DTNs) allow any node to participate in routing due to the lack of consistent infrastructure and central administration. This creates new security challenges as even authorized nodes in DTNs could inject several malicious threats against the network. This paper investigates novel solutions based on the Spray-and-Wait (SnW) routing protocol for mitigating black hole attacks in DTNs. A new knowledge-based routing scheme, called Trust-Based Spray- and-Wait protocol (TB-SnW), is proposed. The routing decisions in TB-SnW protocol are made based on the trust levels that are computed at each node using its historic routing records. Simulation results show that the TB-SnW protocol can achieve better performance in terms of mitigating Byzantine attacks and reducing message delivery delay compared with the Spray-and-Wait protocol.
    Parallel and Distributed Computing, Applications and Technologies (PDCAT), 2012 13th International Conference on; 01/2012

Full-text (2 Sources)

Available from
Aug 22, 2014