ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Social optimum in social groups with give-and-take criterion

Aggarwal, Saurabh and Kuri, Joy and Vaze, Rahul (2016) Social optimum in social groups with give-and-take criterion. In: INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 29 (7). pp. 1219-1234.

[img] PDF
Int_Jou_Com_Sys_29-7_1219_2016.pdf - Published Version
Restricted to Registered users only

Download (1MB) | Request a copy
Official URL: http://dx.doi.org/10.1002/dac.3089


We consider a Social Group' of networked nodes, seeking a universe' of segments. Each node has a subset of the universe and access to an expensive resource for downloading data. Nodes can also acquire the universe by exchanging copies of segments among themselves, at low cost, using inter-node links. While exchanges over inter-node links ensure minimum cost, some nodes in the group try to exploit the system. We term such nodes as non-reciprocating nodes' and prohibit such behavior by proposing the give-and-take' criterion, where exchange is allowed if each node has segments unavailable with the other. Under this criterion, we consider the problem of maximizing the number of nodes with the universe at the end of local exchanges. First, we present a randomized algorithm that is shown to be optimal in the asymptotic regime. Then, we present greedy links algorithm, which performs well for most of the scenarios and yields an optimal result when the number of nodes is four. The polygon algorithm is proposed, which yields an optimal result when each of the nodes has a unique segment. After presenting some intuitive algorithms (e.g., greedy incremental algorithm and rarest first algorithm), we compare the performances of all proposed algorithms with the optimal. Copyright (c) 2015 John Wiley & Sons, Ltd.

Item Type: Journal Article
Additional Information: Copy right for this article belongs to the WILEY-BLACKWELL, 111 RIVER ST, HOBOKEN 07030-5774, NJ USA
Keywords: device-to-device communication; peer-to-peer networking; social groups; free riding
Department/Centre: Division of Electrical Sciences > Electronic Systems Engineering (Formerly Centre for Electronic Design & Technology)
Date Deposited: 28 Apr 2016 05:04
Last Modified: 28 Apr 2016 05:04
URI: http://eprints.iisc.ac.in/id/eprint/53706

Actions (login required)

View Item View Item