Loading...
Search for:
ad-hoc-wireless-networks-security
0.005 seconds
Game-theoretic approach to mitigate packet dropping in wireless Ad-hoc networks
, Article 2011 IEEE Consumer Communications and Networking Conference, CCNC'2011, 8 January 2011 through 11 January 2011, Las Vegas, NV ; 2011 , Pages 163-165 ; 9781424487905 (ISBN) ; Farhat, F ; Pakravan, M. R ; Aref, M. R ; Sharif University of Technology
2011
Abstract
Performance of routing is severely degraded when misbehaving nodes drop packets instead of properly forwarding them. In this paper, we propose a Game-Theoretic Adaptive Multipath Routing (GTAMR) protocol to detect and punish selfish or malicious nodes which try to drop information packets in routing phase and defend against collaborative attacks in which nodes try to disrupt communication or save their power. Our proposed algorithm outranks previous schemes because it is resilient against attacks in which more than one node coordinate their misbehavior and can be used in networks which wireless nodes use directional antennas. We then propose a game theoretic strategy, ERTFT, for nodes to...
Locally multipath adaptive routing protocol resilient to selfishness and wormholes
, Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 12 May 2010 through 13 May 2010 ; Volume 6047 LNCS , May , 2010 , Pages 187-200 ; 03029743 (ISSN) ; 9783642128264 (ISBN) ; Pakravan, M. R ; Salmasizadeh, M ; Aref, M. R ; Sharif University of Technology
2010
Abstract
Locally multipath adaptive routing (LMAR) protocol, classified as a new reactive distance vector routing protocol for MANETs is proposed in this paper. LMAR can find an ad-hoc path without selfish nodes and wormholes using a random search algorithm in polynomial-time. Also when the primary path fails, it discovers an alternative safe path if network graph remains connected after eliminating selfish/malicious nodes. The main feature of LMAR to seek safe route free of selfish and malicious nodes in polynomial time is its searching algorithm and flooding stage that its generated traffic is equiloaded compared to single-path routing protocols but its ability to bypass the attacks is much better...