Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/20275
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Premm, Raj H | - |
dc.contributor.author | Ranganathan, Kavitha | - |
dc.date.accessioned | 2018-02-07T06:31:59Z | - |
dc.date.available | 2018-02-07T06:31:59Z | - |
dc.date.issued | 2016-03-04 | - |
dc.identifier.uri | http://hdl.handle.net/11718/20275 | - |
dc.description.abstract | Government interventions on usage of free speech for communication has been rising of late. The government of Iraq’s ban on the Internet, ban of mobile communications in Hong Kong student protests highlight the same. Applications like Firechat which use mobile ad hoc networks (MANETs) to enable off the grid communication between mobile users, have gained popularity in these regions. However, there have been limited studies on selfish user behavior in community data sharing networks. We wish to study these data sharing communities using game theoretic principles and propose a normal form game. We model selfishness in community data sharing MANETs and define the rationality for selfishness in these networks. We also look at the impact of altruism in community data sharing MANETs and address the issue of minimum number of altruistic users needed to sustain the MANET. We validate the novel model using exhaustive simulations and empirically derive important observations. | en_US |
dc.language.iso | en_US | en_US |
dc.publisher | Indian Institute of Management Ahmedabad | en_US |
dc.relation.ispartofseries | W.P.;2016_03_02 | - |
dc.subject | Game Theoretic | en_US |
dc.subject | Mobile Ad hoc networks | en_US |
dc.title | A game theoretic approach to community based data sharing in mobile ad hoc networks | en_US |
dc.type | Working Paper | en_US |
Appears in Collections: | Working Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
WP_2016_03_02.pdf | WP_2016_3_2 | 139.62 kB | Adobe PDF | View/Open |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.