Sybil-Resistant Meta Strategies for the Forwarder's Dilemma

Date

2014-09-12

Author

Durmus, Yunus
Loukas, Andreas
Langendoen, Koen
Onur, Ertan

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

80
views

0
downloads

Cooperation is the foundation of wireless ad hoc networks with nodes forwarding their neighbors' packets for the common good. However, energy and bandwidth constraints combined with selfish behavior lead to collapsed networks where all nodes defect. Researchers have tried to incentivize or enforce the nodes for cooperation in various ways. However, these techniques do not consider the heterogeneous networks in which a diverse set of nodes with different cognitive capabilities exist. Furthermore, in ad hoc networks identity is a fuzzy concept. It is easy to forge multiple identities and hide defective behavior. Moreover, the nature of the wireless medium is always ambiguous due to collisions, interference and asymmetric links. In all this uncertainty, having complete information about the intentions of the nodes and acting on it is not straightforward. Backed by evolutionary game theory and multi-agent systems research, we adapt and modify two meta strategies to embrace this uncertainty. These modified meta strategies, Win Stay Loose Shift and Stochastic Imitate Best Strategy, do not require strict identity information and only depend on nodes' own capabilities. Nodes monitor the traffic in their neighborhood by using a two-hop overhearing method, and decide whether they should be cooperative or defective. We show that nodes are able to discover and use the best strategy in their locality and protect themselves against the exploitation by free riders who devise Sybil attacks by changing their identities.

Subject Keywords

Wireless ad hoc networks, Forwarder's dilemma, Cooperation, Evolutionary game theory, Network reciprocity, Win stay loose shift, Imitate best strategy

URI

https://hdl.handle.net/11511/41279

DOI

https://doi.org/10.1109/saso.2014.21

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Imitation as the Simplest Strategy for Cooperation Durmus, Yunus; Onur, Ertan (2012-01-01) Ad hoc networks comprise independent cooperative nodes which work together to constitute a system having a value greater than the sum of the values of the individual components. The nodes cooperate to gain access to the medium or to establish a messaging infrastructure by relaying foreign packets. However, when nodes in an ad hoc network operate autonomously without a central authority, they tend to defect, e.g., do not forward each other's packets following the game theoretic analysis. External mechanisms ...
Analysis of the performance of network coding using the sampling property of Q-function Ǎg Kodlama için q-fonksiyonun örnek alma özellǐginden yararlanarak başarim analizi Aktaş, Tǔgcan; Yılmaz, Ali Özgür; Aktaş, Emre (2013-08-05) In the area of cooperative and network coded communication that naturally arises from cooperation, which become increasingly important in wireless communications, the expected end-to-end bit error rate (BER) values are frequently required to compare the proposed coding, relaying, and decoding techniques. Instead of obtaining these values through time consuming Monte Carlo simulations, deriving the closed form expressions via approximations is also crucial. In this work, we make use of the sampling property ...
The road to dynamic Future Internet via content characterization Al-Turjman, Fadi; GÜNAY, MELİH; Kucukoglu, Irem (2017-04-01) The Internet evolved from a network with a few terminals to an intractable network of millions of nodes. Recent interest in information-centric networks (ICNs) is gaining significant momentum as a Future Internet paradigm. The key question is, hence, how to model the massive amount of connected nodes with their content requests in dynamic paradigm. In this paper, we present a novel method to characterize data requests based on content demand ellipse (CDE), focusing on efficient content access and distributi...
A simple and effective mechanism for stored video streaming with TCP transport and server-side adaptive frame discard Gurses, E; Akar, Gözde; Akar, N (Elsevier BV, 2005-07-15) Transmission control protocol (TCP) with its well-established congestion control mechanism is the prevailing transport layer protocol for non-real time data in current Internet Protocol (IP) networks. It would be desirable to transmit any type of multimedia data using TCP in order to take advantage of the extensive operational experience behind TCP in the Internet. However, some features of TCP including retransmissions and variations in throughput and delay, although not catastrophic for non-real time data...
Throughput analysis of UDP and VPN traffic in 802.11g networks Ikiz, Suheyla; Erten, Y. M. (2006-11-03) In this study the effects of using VPNs on the throughput of wireless LANs are investigated. To this end we have set up a test bed and based our observations on the actual measurements obtained from the experiments performed using this test bed. The wireless LAN we have used is an IEEE 802.11g network and we compared the throughput values obtained by employing IPSec in this network with the calculated ones. We performed the tests using periodically generated traffic with 1ms and 5 ms intervals between succe...

Citation Formats

Y. Durmus, A. Loukas, K. Langendoen, and E. Onur, “Sybil-Resistant Meta Strategies for the Forwarder’s Dilemma,” 2014, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/41279.