Date on Master's Thesis/Doctoral Dissertation
5-2007
Document Type
Master's Thesis
Degree Name
M. Eng.
Department
Computer Engineering and Computer Science
Committee Chair
Kumar, Anup
Subject
Computer networks--Quality control; Internetworking (Telecommunication)
Abstract
This thesis will focus on the topic of Selfish Nodes within a Mobile Ad-Hoc Networks (MANET), specifically sensor networks due to their lower power and bandwidth. The approach used is a reputation based algorithm to isolate the selfish nodes from communication by using past history to determine how reliable the node is. The reputation of each node is determined by their behavior within the network. As a node continuously acts selfishly, their reputation is decreased, until finally meeting the minimum threshold; therefore they are determined to be malicious. A node's reputation is increased for successfully participation and communication with neighboring nodes, but once a node is determined to be malicious, they are ignored and cannot regain positive reputation. Once a node is isolated, the remaining nodes must find alternate paths to send their data to avoid any and all selfish nodes, regardless of the increase in distance. The method could easily be transformed to expand such routing protocols as Destination-Sequenced Distance Vector (DSDV). By using the proposed algorithm within DSDV, functionality and performance will be increased in the MANET. As a result of the isolation, retransmission is decreased and throughput increased, therefore conserving power consumption of individual nodes and creating a more reliable network by having less error rate and spare bandwidth.
Recommended Citation
Probus, Michael, "Selfish node isolation in Mobile Ad-Hoc Networks." (2007). Electronic Theses and Dissertations. Paper 1158.
https://doi.org/10.18297/etd/1158