Flooding in Secure Wireless Sensor Networks

Bondu J.; Laxmi V.; Mishra A.; Gaur M.S.

Full metadata record

DC Field	Value	Language
dc.contributor.author	Bondu J.	en_US
dc.contributor.author	Laxmi V.	en_US
dc.contributor.author	Mishra A.	en_US
dc.contributor.author	Gaur M.S.	en_US
dc.date.accessioned	2023-11-30T07:35:45Z	-
dc.date.available	2023-11-30T07:35:45Z	-
dc.date.issued	2017	-
dc.identifier.isbn	978-1450353038	-
dc.identifier.other	EID(2-s2.0-85042094838)	-
dc.identifier.uri	https://dx.doi.org/10.1145/3136825.3136867	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/133	-
dc.description.abstract	The flooding algorithm remains one of the simplest and most effective ways to quickly disseminate information across all nodes in a Wireless Sensor Network. Though fast, this algorithm remains unsecure as the packets can be intercepted by malice agents to reveal the information. In this paper, simulations of a flooding algorithm in Sensor Networks secured by a Random Key Pre-distribution model are presented. We conducted these simulations on ns-3 over a theoretical Peer-to-peer and a standard based IEEE 802.15.4 network. This is followed by a demonstration of the robustness of the network through a random black hole attack. © 2017 Copyright held by the owner/author(s).	en_US
dc.language.iso	en	en_US
dc.publisher	Association for Computing Machinery	en_US
dc.source	ACM International Conference Proceeding Series	en_US
dc.subject	Blackhole attack	en_US
dc.subject	Flooding algorithm	en_US
dc.subject	Network simulator-3	en_US
dc.subject	Wireless Sensor Networks	en_US
dc.title	Flooding in Secure Wireless Sensor Networks	en_US
dc.type	Conference Paper	en_US
Appears in Collections:	Conference Paper