Defense against packet collusion attacks in opportunistic networks

Alajeely, Majeed; Doss, Robin; Ahmad, Asma'a; Mak‐Hau, Vicky

doi:10.1016/j.cose.2016.12.001

Cited by 16 publications

(7 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors in [167], [169], [196] propose a Merkle-Hash-Tree to detect a malicious nodes which drop packet and add fake packets. It calculates root hash, and then appends it with every packets.…”

Section: Review Of Literaturementioning

confidence: 99%

A taxonomy on misbehaving nodes in delay tolerant networks

Khalid

Ullah

Ahmed

et al. 2018

Computers & Security

View full text Add to dashboard Cite

Delay Tolerant Networks (DTNs) are type of Intermittently Connected Networks (ICNs) featured by long delay, intermittent connectivity, asymmetric data rates and high error rates. DTNs have been primarily developed for InterPlanetary Networks (IPNs), however, have shown promising potential in challenged networks i.e. DakNet, ZebraNet, KioskNet and WiderNet. Due to unique nature of intermittent connectivity and long delay, DTNs face challenges in routing, key management, privacy, fragmentation and misbehaving nodes. Here, misbehaving nodes i.e. malicious and selfish nodes launch various attacks including flood, packet drop and fake packets attack, inevitably overuse scarce resources (e.g., buffer and bandwidth) in DTNs. The focus of this survey is on a review of misbehaving node attacks, and detection algorithms. We firstly classify various of attacks depending on the type of misbehaving nodes. Then, detection algorithms for these misbehaving nodes are categorized depending on preventive and detective based features. The panoramic view on misbehaving nodes and detection algorithms are further analyzed, evaluated mathematically through a number of performance metrics. Future directions guiding this topic are also presented.

show abstract

Section: Review Of Literaturementioning

confidence: 99%

A taxonomy on misbehaving nodes in delay tolerant networks

Khalid

Ullah

Ahmed

et al. 2018

Computers & Security

View full text Add to dashboard Cite

show abstract

“…This raises the requirement of using ML techniques to preemptively predict the attacks based on the past behavior of nodes and some statistical analysis approach, so that such attacks can be avoided. This requirement justifies our motivation in proposing a RFC-based secured routing protocol (called (RFCSec)) for OppIoT to protect against packet collusion, 9 hypernova, supernova, and wormhole attacks. 10…”

Section: Design Of the Rfcsec Protocol For Oppiotmentioning

confidence: 93%

Random forest classifier‐based safe and reliable routing for opportunistic IoT networks

Kandhoul

Dhurandher

Woungang

2020

Int J Communication

View full text Add to dashboard Cite

SummaryDesigning a safe and reliable way for communicating the messages among the devices and humans forming the Opportunistic Internet of Things network (OppIoT) has been a challenge since the broadcast mode of message sharing is used. To contribute toward addressing such challenge, this paper proposes a Random Forest Classifier (RFC)‐based safe and reliable routing protocol for OppIoT (called RFCSec) which ensures space efficiency, hash‐based message integrity, and high packet delivery, simultaneously protecting the network against safety threats viz. packet collusion, hypernova, supernova, and wormhole attacks. The proposed RFCSec scheme is composed of two phases. In the first one, the RFC is trained on real data trace, and based on the output of this training, the second phase consists in classifying the encountered nodes of a given node as belonging to one of the output classes of nodes based on their past behavior in the network. This helps in proactively isolating the malicious nodes from participating in the routing process and encourages the participation of the ones with good message forwarding behavior, low packet dropping rate, high buffer availability, and a higher probability of delivering the messages in the past. Simulation results using the ONE simulator show that the proposed RFCSec secure routing scheme is superior to the MLProph, RLProph, and CAML routing protocols, chosen as benchmarks, in terms of legitimate packet delivery, probability of message delivery, count of dropped messages, and latency in packet delivery. The out‐of‐bag error obtained is also minimal

show abstract

“…When the nodes meet each other, they are required to exchange their encounter record histories, based on which other nodes can evaluate their forwarding behaviors. Alajeely et al [3] present the detection attack and trace back mechanisms based on the Merkle tree, where the legitimate nodes can detect attack based on the received packets and then trace back and identify the malicious nodes. Zhu et al [7] exploit a trusted authority (TA) to judge the forwarding behavior of nodes based on the collected delegation task evidence, forwarding history evidence, and contact history evidence.…”

Section: Related Workmentioning

confidence: 99%

“…However, these routing schemes are inefficient in the DTNs environment with malicious or selfish nodes. To mitigate the impact of selfish or malicious nodes on DTNs, some detection attacks schemes are proposed in [3,6,7], which make use of the history forwarding evidences and encounter records of each node to analyze its forwarding behavior. However, these detection schemes are independent of specific routing protocols and require more computing capability, network bandwidth, and storage resources to work well.…”

Section: Security and Communication Networkmentioning

confidence: 99%

“…Different from the traditional wireless networks, DTNs are the challenging networks characterized by open medium, long delay and frequent disruption, and lack of fixed and guaranteed end-to-end communication links [3]. DTNs make use of the store-carry-and-forward strategy to forward the message packets (also named bundle) when two nodes appear with contact opportunity.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Security and Efficient Routing Scheme with Misbehavior Detection in Delay-Tolerant Networks

Feng

Lü

et al. 2017

Security and Communication Networks

View full text Add to dashboard Cite

Due to the unique network characteristics, the security and efficient routing in DTNs are considered as two great challenges. In this paper, we design a security and efficient routing scheme, called SER, which integrates the routing decision and the attacks detection mechanisms. In SER scheme, each DTNs node locally maintains a one-dimensional vector table to record the summary information about the contact with other nodes and the trust degree of other nodes. To obtain the global status and the contact relationship among all nodes, the trusted routing table consisting of vectors of all nodes is built in each DTNs node. The method for detecting malicious nodes and selfish nodes is proposed, which exploits the global summary information to analyze the history forwarding behavior of node and judge whether it is a malicious node or selfish node. The routing decision method is proposed based on trust degree of forwarding messages between nodes, which adopts trust degree as relay node selection strategy. Simulation results show that compared with existing schemes SER scheme could detect the attacks behavior of malicious nodes and selfish nodes, at the same time, with higher delivery rate and lower average delivery delay.

show abstract

Defense against packet collusion attacks in opportunistic networks

Cited by 16 publications

References 2 publications

A taxonomy on misbehaving nodes in delay tolerant networks

A taxonomy on misbehaving nodes in delay tolerant networks

Random forest classifier‐based safe and reliable routing for opportunistic IoT networks

A Security and Efficient Routing Scheme with Misbehavior Detection in Delay-Tolerant Networks

Contact Info

Product

Resources

About