You are not logged in.

Defense against packet dropping attacks in opportunistic networks

Ahmad, Asma'a, Alajeely, Majeed and Doss, Robin 2014, Defense against packet dropping attacks in opportunistic networks, in ACCI 2014 : Proceedings of the 2014 International Conference on Advances in Computing, Communications and Informatics, IEEE, Piscataway, N.J., pp. 1608-1613.

Attached Files
Name Description MIMEType Size Downloads

Title Defense against packet dropping attacks in opportunistic networks
Author(s) Ahmad, Asma'a
Alajeely, Majeed
Doss, RobinORCID iD for Doss, Robin orcid.org/0000-0001-6143-6850
Conference name Advances in Computing, Communications and Informatics. Conference (2014 : Delhi, India)
Conference location New Delhi, India
Conference dates 2014/9/24 - 2014/9/27
Title of proceedings ACCI 2014 : Proceedings of the 2014 International Conference on Advances in Computing, Communications and Informatics
Editor(s) [Unknown]
Publication date 2014
Conference series Advances in Computing, Communications and Informatics Conference
Start page 1608
End page 1613
Total pages 6
Publisher IEEE
Place of publication Piscataway, N.J.
Summary Opportunistic networks (OppNets) are an interesting topic that are seen to have a promising future. Many protocols have been developed to accommodate the features of OppNets such as frequent partitions, long delays, and no end-to-end path between the source and destination nodes. Embedding security into these protocols is challenging and has taken a lot of attention in research. One of the attacks that OppNets are exposed to is the packet dropping attack, where the malicious node attempts to drop some packets and forwards an incomplete number of packets which results in the distortion of the message. To increase the security levels in OppNets, this paper presents an algorithm developed to detect packet dropping attacks, and finds the malicious node that attempted the attack. The algorithm detects the attack by using an indicative field in the header section of each packet; the indicative field has 3 sub fields - the identification field, the flag field, and the offset field. These 3 fields are used to find if a node receives the complete original number of packets from the previous node. The algorithm will have the advantage of detecting packets dropped by each intermediate node, this helps solve the difficulties of finding malicious nodes by the destination node only.
ISBN 9781479930784
Language eng
Field of Research 080303 Computer System Security
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category E1 Full written paper - refereed
ERA Research output type E Conference publication
Copyright notice ©2014, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30070306

Document type: Conference Paper
Collection: School of Information Technology
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 1 times in TR Web of Science
Scopus Citation Count Cited 2 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 135 Abstract Views, 2 File Downloads  -  Detailed Statistics
Created: Fri, 06 Mar 2015, 08:25:22 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.