File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: On the intruder detection for sinkhole attack in wireless sensor networks

TitleOn the intruder detection for sinkhole attack in wireless sensor networks
Authors
Issue Date2006
Citation
IEEE International Conference on Communications, 2006, v. 8, p. 3383-3389 How to Cite?
AbstractIn a wireless sensor network, multiple nodes would send sensor readings to a base station for further processing. It is well-known that such a many-to-one communication is highly vulnerable to the sinkhole attack, where an intruder attracts surrounding nodes with unfaithful routing information, and then performs selective forwarding or alters the data passing through it. A sinkhole attack forms a serious threat to sensor networks, particularly considering that such networks are often deployed in open areas and of weak computation and battery power. In this paper, we present a novel algorithm for detecting the intruder in a sinkhole attack. The algorithm first finds a list of suspected nodes, and then effectively identifies the intruder in the list through a network flow graph. The algorithm is also robust to deal with cooperative malicious nodes that attempt to hide the real intruder. We have evaluated the performance of the proposed algorithm through both numerical analysis and simulations, which confirmed the effectiveness and accuracy of the algorithm. Our results also suggest that its communication and computation overheads are reasonably low for wireless sensor networks. © 2006 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/281384
ISSN
2023 SCImago Journal Rankings: 0.861

 

DC FieldValueLanguage
dc.contributor.authorNgai, Edith C.H.-
dc.contributor.authorLiu, Jiangchuan-
dc.contributor.authorLyu, Michael R.-
dc.date.accessioned2020-03-13T10:37:44Z-
dc.date.available2020-03-13T10:37:44Z-
dc.date.issued2006-
dc.identifier.citationIEEE International Conference on Communications, 2006, v. 8, p. 3383-3389-
dc.identifier.issn0536-1486-
dc.identifier.urihttp://hdl.handle.net/10722/281384-
dc.description.abstractIn a wireless sensor network, multiple nodes would send sensor readings to a base station for further processing. It is well-known that such a many-to-one communication is highly vulnerable to the sinkhole attack, where an intruder attracts surrounding nodes with unfaithful routing information, and then performs selective forwarding or alters the data passing through it. A sinkhole attack forms a serious threat to sensor networks, particularly considering that such networks are often deployed in open areas and of weak computation and battery power. In this paper, we present a novel algorithm for detecting the intruder in a sinkhole attack. The algorithm first finds a list of suspected nodes, and then effectively identifies the intruder in the list through a network flow graph. The algorithm is also robust to deal with cooperative malicious nodes that attempt to hide the real intruder. We have evaluated the performance of the proposed algorithm through both numerical analysis and simulations, which confirmed the effectiveness and accuracy of the algorithm. Our results also suggest that its communication and computation overheads are reasonably low for wireless sensor networks. © 2006 IEEE.-
dc.languageeng-
dc.relation.ispartofIEEE International Conference on Communications-
dc.titleOn the intruder detection for sinkhole attack in wireless sensor networks-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/ICC.2006.255595-
dc.identifier.scopuseid_2-s2.0-42549138436-
dc.identifier.volume8-
dc.identifier.spage3383-
dc.identifier.epage3389-
dc.identifier.issnl0536-1486-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats