Several intrusion detection approaches have been proposed for mobile adhoc networks. Many of the approaches assume that there are sufficient neighbors to help monitor the transmissions and receptions of data packets by other nodes to detect abnormality. However, in a sparsely connected adhoc network, nodes usually have very small number of neighbors. In addition, new history based routing schemes e.g. Prophet have been proposed because traditional adhoc routing schemes do not work well in sparse ad hoc networks. In this paper, we propose a ferry-based intrusion detection and mitigation (FBIDM) scheme for sparsely connected ad hoc networks that use Prophet as their routing scheme. Via simulations, we study the effectiveness of the FBIDM scheme when malicious nodes launch selective data dropping attacks. Our results with different mobility models, ferry speed, traffic load scenarios indicate that the FBIDM scheme is promising in reducing the impact of such malicious attacks.
Abstract-Mobile nodes in some challenging network scenarios suffer from intermittent connectivity and frequent partitions e.g. battlefield and disaster recovery scenarios. Disruption Tolerant Network (DTN) technologies are designed to enable nodes in such environments to communicate with one another. In an earlier work, we studied information retrieval schemes for singleattribute queries in DTNs. Our schemes disseminate replicated data copies and queries to local-neighborhood. However, data items often have multiple attributes and not every node can be trusted to store replicated data or queries. Thus, in this paper, we study the scenario where the queries have multiple attributes. In addition, we compare the effectiveness of using opportunistically encountered nodes or specially deployed index and storage points (ISPs) for storing replicated data items or indices of the data items. Specifically, we conduct extensive simulation studies to evaluate three information retrieval schemes namely (a) the Predetermined ISP advertisement (PISA) scheme where ISPs advertise indices of data items with attribute values that fall within some pre-determined ranges, (b) the Opportunistic Regular Node Advertisement with Index Duplication (ORNA-ID) scheme which uses opportunistically encountered nodes for advertising replicated indices, and (c) the Opportunistic Regular Node Advertisement with Data Duplication (ORNA-DD) scheme which uses opportunistically encountered nodes for storing replicated data items. Our results indicate that the ORNA-ID scheme and the PISA scheme achieve similar performance. This shows that either architecture can be used. In addition, the ORNA-DD scheme provides 91% more query success rate and 128% more overall success rate in the sparsest network scenario (40 nodes distributed over 4000x4000m 2 ).Index Terms-disruption tolerant networking, content-based routing, multi-attribute queries, information retrieval.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.