Introduction - Social Group Utility Maximization - page 3

In contrast to selfish users, for a network where nodes are controlled by a central
authority (e.g., sensor networks), all nodes are fully cooperative and aim to achieve
the same system-wide goal. In this case, a widely used objective is network utility
maximization (NUM), which is to maximize the total utility of all nodes. NUM has
been widely studied for resource allocation in wireless networks [ 21 ].
Although there exists a significant body of work on NCG and NUM, very little
attention has been paid to the continuum between these two extreme paradigms, espe-
cially in the context of mobile social networking. Recent work [ 22 , 23 ] have studied
the impact of altruistic behavior in a routing game. [ 24 ] has recently investigated a
random access game between two symmetrically altruistic players.
References
1. Gartner: Worldwide PC, tablet and mobile phone shipments to grow 4.5 percent in 2013 (2013),
http://www.gartner.com/newsroom/id/2610015
2. Cisco White paper: Global mobile data traffic data forecast update (2013-2018). (2014)
3. eMarketer: Social networking reaches nearly one in four around the world (2013), http://www.
emarketer.com/Article/Social-Networking-Reaches-Nearly-One-Four-Around-World/1009976
4. P. Costa, C. Mascolo, M. Musolesi, G.P. Picco, Socially-aware routing for publish-subscribe
in delay-tolerant mobile ad hoc networks. IEEE JSAC 26 (5) 748-760 (2008)
5. N. Kayastha, D. Niyato, P. Wang, E. Hossain, Applications, architectures, and protocol design
issues for mobile social networks: A survey. Proc. IEEE 99 (12), 1439-1450 (2011)
6. W. Gao, Q. Li, B. Zhao, G. Cao, Multicasting in delay tolerant networks: A social network
perspective. ACM MOBIHOC (2009)
7. X. Chen, B. Proulx, X. Gong, J. Zhang, Social trust and social reci-procity based cooperative
D2D communications. ACM MOBIHOC (2013)
8. V. Srinivasan, P. Nuggehalli, C.-F. Chiasserini, R.R. Rao, Cooperation in wireless ad hoc
networks. IEEE INFOCOM (2003)
9. W.H. Yuen, R.D. Yates, S.-C. Mau, Exploiting data diversity and multiuser diversity in non-
cooperative mobile infostation networks. IEEE INFOCOM (2003)
10. P. Ganesan, M. Seshadri, On cooperative content distribution and the price of barter. IEEE
ICDCS (2005)
11. U. Shevade, H.H. Song, L. Qiu, Y. Zhang, Incentive-aware routing in DTNs. IEEE ICNP (2008)
12. S. Zhong, J. Chen, Y.R. Yang, Incentive-aware routing in DTNs. IEEE INFOCOM (2003)
13. W. Wang, S. Eidenbenz, Y. Wang, X.-Y. Li, OURS: Optimal unicast routing systems in non-
cooperative wireless networks. ACM MOBICOM (2006)
14. S. Zhong, F. Wu, On designing collusion-resistant routing schemes for non-cooperative wireless
ad hoc networks. ACM MOBICOM (2007)
15. C. Zhang, X. Zhu, Y. Song, Y. Fang, C4: A new paradigm for providing incentives in multi-hop
wireless networks. IEEE INFOCOM (2011)
16. Bitcoin: An open source P2P digital currency (2014), http://bitcoin.org/en/
17. S. Marti, T.J. Giuli, K. Lai, M. Baker, Mitigating routing misbehavior in mobile ad hoc
networks. ACM MOBICOM (2000)
18. S. Buchegger, J.-Y.L. Boudec, Performance analysis of the CONFIDANT protocol. ACM
MOBIHOC (2002)
19. J. Jaramillo, R. Srikant, DARWIN: Distributed and adaptive reputation mechanism for wireless
networks. ACM MOBICOM (2007)
20. E. Altman, T. Boulogne, R. El-Azouzi, T. Jimenez, L. Wynter, A survey on networking games
in telecommunications. Comput. Oper. Res. 33 , 286-311 (2006)