Please use this identifier to cite or link to this item:
http://drsr.daiict.ac.in//handle/123456789/200
Title: | Effect of channel asymmetry on reputation based cooperation mechanisms in mobile ad-hoc networks |
Authors: | Srivastava, Sanjay Vasavada, Tejas |
Keywords: | Peer-to-peer architecture Computer network architectures Cryptography Computer security Signal processing Digital techniques Radio Transmitters and transmission Fading Modulators Electronics digital communications Mobile communication systems |
Issue Date: | 2008 |
Publisher: | Dhirubhai Ambani Institute of Information and Communication Technology |
Citation: | Vasavada, Tejas (2008). Effect of channel asymmetry on reputation based cooperation mechanisms in mobile ad-hoc networks. Dhirubhai Ambani Institute of Information and Communication Technology, viii, 52 p. (Acc.No: T00163) |
Abstract: | Enforced cooperation among MANET nodes is an active research issue. In applications, where the users have different goals and there is no central authority to control them, users may become selfish. These nodes may not forward packets sent by others and thus affect the basic functionality of the network. One proposed class of protocols to handle such scenarios is based on reputation functions. In reputation based schemes, nodes maintain reputation values of other nodes. Reputation value of a node is high for nodes that forward the received packets and low otherwise. Nodes with very low reputation values are identified as selfish nodes and isolated from network operations. In such schemes, every node has to observe whether its neighbour is forwarding packets or not. A node after sending a packet to its neighbour to forward further, increases reputation of neighbour if it overhears the same packet from the neighbour. If it does not overhear the packet, reputation of neighbour is reduced. This is the basic method to observe whether neighbour node is cooperative or not. Here basic assumption is that the channel between two neighbour nodes is always symmetric. This assumption does not hold true due to two reasons: (1) Nodes are moving. Neighbour node may have forwarded the packet but by the time it forwards, either observing node or neighbour or both might move out of each others range. (2) Even if both are in each others range, due to multipath fading, observing node may not overhear the packets forwarded by neighbour node. Thus sometimes even honest nodes may be considered selfish and isolated due to this asymmetry. This reduces throughput of honest nodes. In this thesis work we have examined the probability of channel asymmetry as a function of ratio r(of inter node distance and transmission range), for given values of relative average velocity of nodes V and Ricean parameter K. Ricean parameter K represents type of the environment i.e. obstructed or unobstructed. We have proposed an enhancement of existing reputation protocol OCEAN. In the enhanced protocol, observing node probabilistically updates reputation of neighbour when it does not overhear. This probabilistic update takes into account probability of channel asymmetry. We have tried to minimize false positives, i.e. honest nodes being detected as selfish. We have shown through simulations that false negatives, i.e. selfish nodes being detected as honest, do not increase much. We have also shown that how false positives and false negatives change as degree of dishonesty of selfish nodes change. At last, we have shown that throughput levels of honest nodes in original OCEAN protocol and modified OCEAN protocol are almost same. |
URI: | http://drsr.daiict.ac.in/handle/123456789/200 |
Appears in Collections: | M Tech Dissertations |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
200611026.pdf Restricted Access | 358.32 kB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.