Advanced Detection of Selfish or Malicious Nodes in Ad Hoc Networks

Kargl, Frank; Klenk, Andreas; Schlott, Stefan; Weber, Michael

doi:10.1007/978-3-540-30496-8_13

Cited by 88 publications

(52 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We use the concept of a 'position cheating detection system' similar to intrusion detection systems in MANETs, for example, Reference [20]. In these systems, every node uses multiple algorithms (so-called sensors) to detect malicious or selfish behavior of other nodes in the network.…”

Section: Position Verification Approachmentioning

confidence: 99%

Decentralized position verification in geographic ad hoc routing

Leinmüller

Schoch

Kargl

et al. 2008

Security Comm Networks

Self Cite

View full text Add to dashboard Cite

SummaryInter-vehicle communication is regarded as one of the major applications of mobile ad hoc networks (MANETs). Compared to MANETs or wireless sensor networks (WSNs), these so-called vehicular ad hoc networks (VANETs) have unique requirements on network protocols. The requirements result mainly from node mobility and the demands of position-dependent applications. On the routing layer, those requirements are well met by geographic routing protocols. Functional research on geographic routing has already reached a considerable level, whereas security aspects have only been recently taken into account. Position information dissemination has been identified as being crucial for geographic routing since forged position information has severe impact regarding both performance and security.In this work, we first summarize the problems that arise from falsified position data. We then propose a framework that contains different detection mechanisms in order to mitigate or lessen these problems. Our developed mechanisms are capable of recognizing nodes cheating about their position in beacons (periodic position dissemination in most single-path geographic routing protocols, e.g., GPSR). Unlike other proposals described in the literature, our detection system does not rely on additional hardware or special nodes, which would contradict the ad hoc approach. Instead, we use a number of different independent sensors to quickly give an estimation of the trustworthiness of other nodes' position claims. The different sensors run either autonomously on every single node, or they require cooperation between neighboring nodes.The simulation evaluation proves that the combination of autonomous and cooperative position verification mechanisms successfully discloses most nodes disseminating false position information, and thereby widely prevents attacks using position cheating.

show abstract

Section: Position Verification Approachmentioning

confidence: 99%

Decentralized position verification in geographic ad hoc routing

Leinmüller

Schoch

Kargl

et al. 2008

Security Comm Networks

Self Cite

View full text Add to dashboard Cite

show abstract

“…Faulty links are given decreased rating and are consequently avoided. Just and Kranakis [18] and Kargl et al [19] proposed schemes for detecting selfish or malicious nodes in an ad hoc network. The schemes involve probing mechanisms which are similar in functionality to that of Awerbuch et al [6] above Patwardhan and Lorga [20] presented a secure routing protocol called Sec AODV.…”

Section: Schemes Which Employ Detection and Isolation Mechanismsmentioning

confidence: 99%

Literature Review on Existing Schemes on Basic Secure Routing Protocols in MANETs

Vani¹

2017

IJRASET

View full text Add to dashboard Cite

Mobile Ad hoc Network (MANET) is assembled as a self-organized network with mobile nodes with a dynamic infrastructure. Designing of secure routing protocols is very difficult because of its characteristics. Moreover, protocols are designed with assumption of no malicious or selfish nodes in network. Hence, to design robust and secured routing protocols several effects made from researchers. In this paper, review on literature survey on basic secure routing protocols presented. The survey is categorized to Basic Routing Security Schemes, Trust-Based Routing Schemes, Incentive-base schemes, Schemes which employ detection and isolation mechanisms.

show abstract

“…Accordingly, we need to require that node i can reliably observe the actions of node j; see, e.g., [19], [30] for details about how to obtain this information.…”

Section: A Single Stagementioning

confidence: 99%

Reinforcement Learning for Routing in Ad Hoc Networks

Nurmi

2007

2007 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops

View full text Add to dashboard Cite

Abstract-We show how routing in ad hoc networks can be modeled as a sequential decision making problem with incomplete information. More precisely, we show how to map routing into a reinforcement learning problem involving a partially observable Markov decision process, and present an algorithm for optimizing the performance of the nodes in this model. We also present simulation results with our model.

show abstract

Advanced Detection of Selfish or Malicious Nodes in Ad Hoc Networks

Cited by 88 publications

References 14 publications

Decentralized position verification in geographic ad hoc routing

Decentralized position verification in geographic ad hoc routing

Literature Review on Existing Schemes on Basic Secure Routing Protocols in MANETs

Reinforcement Learning for Routing in Ad Hoc Networks

Contact Info

Product

Resources

About