Misbehavior resilient multi-path data transmission in mobile ad-hoc networks

Kefayati, M.; Rabiee, Hamid R.; Miremadi, Seyed Ghassem; Khonsari, Ahmad

doi:10.1145/1180345.1180357

Cited by 27 publications

(14 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The idea is either sending multiple copies of the same data through different paths to destination (Karlof and Wagner, 2003;Bhuse et al, 2005;Kefayati et al, 2006;Mavropodi et al, 2007;Pavithra and Reddy, 2015) or splitting the data into N shares and sending the N shares through different paths to destination (Shu et al, 2010;Liu et al, 2012;Li et al, 2014). Destination needs to collect and merge at least M out of N shares to make meaningful data.…”

Section: Related Workmentioning

confidence: 99%

SFAD2H: Selective Forwarding or Dropping Attack Detection with 2-Hop Acknowledgment Support in Wireless Sensor Networks

Uppara¹,

Krishnappa²,

Punjalkatte³

et al. 2017

American Journal of Engineering and Applied Sciences

View full text Add to dashboard Cite

Security in wireless sensor networks is critical due to its way of open communication. In this study we have proposed a technique based on a sensor node having alternate path knowledge and 2-hop acknowledgement mechanism to detect adversary nodes which perform selective forwarding and dropping attacks. In selective forwarding attack nodes on the forwarding path refuses to transfer packets selectively. The proposed approach starts with network initialization where every node decides the list of parent nodes through which Sink can be reached with equal distance. Each node chooses a parent node among selected parents to forward the data and establishes pairwise keys with 2-hop parent nodes. During data forwarding, child forwards the packet to 1-hop distance parent, handles acknowledgement from 2-hop distance node and decides the number of packets forwarded and dropped based on successful and unsuccessful transactions. Every node sends a transaction report containing observations on the parent via alternate path to Sink at a particular interval of time called an evaluation period. Sink identifies the malicious node by comparing report received from each node with number of data packets received. Simulated the algorithm in NS-3 and performance analysis compared with other recently proposed approach. Simulation results show that proposed method detects the malicious nodes efficiently and early.

show abstract

Section: Related Workmentioning

confidence: 99%

SFAD2H: Selective Forwarding or Dropping Attack Detection with 2-Hop Acknowledgment Support in Wireless Sensor Networks

Uppara¹,

Krishnappa²,

Punjalkatte³

et al. 2017

American Journal of Engineering and Applied Sciences

View full text Add to dashboard Cite

show abstract

“…To handle the packet droppers and modifiers, multi-path routing [6], [7], [8], [9] approach is widely adopted in which copies of a packet are forwarded along multiple paths to the destination Sink. Neighbor node observation or monitoring is another approach [10], [11], [12] used to find the packet modifiers, droppers and routing misbehavior in sensor networks.…”

Section: Related Workmentioning

confidence: 99%

CMNTS: Catching malicious nodes with trust support in wireless sensor networks

Prathap

Shenoy

Venugopal

2016

2016 IEEE Region 10 Symposium (TENSYMP)

View full text Add to dashboard Cite

Abstract-Security in wireless sensor networks is critical due to its way of open communication. In this paper we have considered suite of attacks -packet modification, packet dropping, sybil attack, packet misrouting, and bad mouthing attack, and provided a solution to detect attacks. In literature, many schemes have been proposed to mitigate such attacks but very few detect the malicious nodes effectively and also no single solution detects all attacks. In the proposed approach, each node chooses the parent node for forwarding the packet towards sink. Each node adds its identity and trust on parent as a routing path marker and encrypts only the bytes added by node in packet before forwarding to parent. Sink can identify the malicious node based on trust value and node identities marked in packet. Child node observes the parent and decides the trust on parent based on successful and unsuccessful transactions. Data transmission is divided into multiple rounds of equal time duration. Each node chooses the parent node at the beginning of a round based on its own observation on parent. Simulated the algorithm in NS-3 and performance analysis is discussed by comparing the results with other two recently proposed approaches. With the combination of trust factor and fixed path routing to detect malicious activity, simulation results show that proposed method detect malicious nodes efficiently and early, and also with low percentage of false detection.

show abstract

“…To handle the packet droppers and modifiers, multi-path routing [4], [5], [6], [7] approach is widely adopted in which copies of a packet are forwarded along multiple paths to the destination sink. Neighbor node observation or monitoring is another approach [8], [9], [10] used to find the packet modifiers, droppers and routing misbehavior in sensor networks.…”

Section: Related Workmentioning

confidence: 99%

CPMTS: Catching packet modifiers with trust support in wireless sensor networks

Prathap

Shenoy

Venugopal

2015

2015 IEEE International WIE Conference on Electrical and Computer Engineering (WIECON-ECE)

View full text Add to dashboard Cite

Abstract-Security in wireless sensor networks is critical due to its way of open communication. Packet modification is a common attack in wireless sensor networks. In literature, many schemes have been proposed to mitigate such an attack but very few detect the malicious nodes effectively. In the proposed approach, each node chooses the parent node for forwarding the packet towards sink. Each node adds its identity and trust on parent as a routing path marker and encrypts only the bytes added by node in packet before forwarding to parent. Sink can determine the modifiers based on trust value and node identities marked in packet. Child node observes the parent and decides the trust on parent based on successful and unsuccessful transactions. Data transmission is divided into multiple rounds of equal time duration. Each node chooses the parent node at the beginning of a round based on its own observation on parent. Simulated the algorithm in NS-3 and performance analysis is discussed. With the combination of trust factor and fixed path routing to detect malicious activity, analytical results show that proposed method detect modifiers efficiently and early, and also with low percentage of false detection.

show abstract

Misbehavior resilient multi-path data transmission in mobile ad-hoc networks

Cited by 27 publications

References 19 publications

SFAD2H: Selective Forwarding or Dropping Attack Detection with 2-Hop Acknowledgment Support in Wireless Sensor Networks

SFAD2H: Selective Forwarding or Dropping Attack Detection with 2-Hop Acknowledgment Support in Wireless Sensor Networks

CMNTS: Catching malicious nodes with trust support in wireless sensor networks

CPMTS: Catching packet modifiers with trust support in wireless sensor networks

Contact Info

Product

Resources

About