Self-Organizing Networks of Information Gathering Cognitive Agents

In many scenarios, networks emerge endogenously as cognitive agents establish links in order to exchange information. Network formation has been widely studied in economics, but only on the basis of simplistic models that assume that the value of each additional piece of information is constant. In this paper, we present a first model and associated analysis for network formation under the much more realistic assumption that the value of each additional piece of information depends on the type of that piece of information and on the information already possessed: information may be complementary or redundant. We model the formation of a network as a noncooperative game in which the actions are the formation of links and the benefit of forming a link is the value of the information exchanged minus the cost of forming the link. We characterize the topologies of the networks emerging at a Nash equilibrium (NE) of this game and compare the efficiency of equilibrium networks with the efficiency of centrally designed networks. To quantify the impact of information redundancy and linking cost on social information loss we provide estimates for the price of anarchy (PoA), and to quantify the impact on individual information loss we introduce and provide estimates for a measure we call maximum information loss (MIL). Finally, we consider the setting in which agents are not endowed with information, but must produce it. We show that the validity of the well-known “law of the few” depends on how information aggregates, in particular, the “law of the few” fails when information displays complementarities.

[1]  Zhu Han,et al.  Coalitional Games for Distributed Collaborative Spectrum Sensing in Cognitive Radio Networks , 2009, IEEE INFOCOM 2009.

[2]  Shashi Phoha,et al.  Self-organizing sensor networks for integrated target surveillance , 2006, IEEE Transactions on Computers.

[3]  João Barros,et al.  Network information flow with correlated sources , 2005, IEEE Transactions on Information Theory.

[4]  Christophe Diot,et al.  Dissemination in opportunistic social networks: the role of temporal communities , 2012, MobiHoc '12.

[5]  Mihaela van der Schaar,et al.  Strategic Networks: Information Dissemination and Link Formation Among Self-Interested Agents , 2013, IEEE Journal on Selected Areas in Communications.

[6]  Patrick Tague,et al.  Network self-organization in the Internet of Things , 2013, IOT 2013.

[7]  Mihaela van der Schaar,et al.  Network evolution with incomplete information and learning , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[8]  Zhen Zhang,et al.  On Characterization of Entropy Function via Information Inequalities , 1998, IEEE Trans. Inf. Theory.

[9]  Aditya Ramamoorthy,et al.  Minimum Cost Distributed Source Coding Over a Network , 2007, IEEE Transactions on Information Theory.

[10]  Marwan Krunz,et al.  Coordinated Channel Access in Cognitive Radio Networks: A Multi-Level Spectrum Opportunity Perspective , 2009, IEEE INFOCOM 2009.

[11]  H. Vincent Poor,et al.  From Technological Networks to Social Networks , 2013, IEEE Journal on Selected Areas in Communications.

[12]  Leonardo Badia,et al.  Inter-Network Cooperation Exploiting Game Theory and Bayesian Networks , 2013, IEEE Transactions on Communications.

[13]  Zhu Han,et al.  Social Data Offloading in D2D-Enhanced Cellular Networks by Network Formation Games , 2015, IEEE Transactions on Wireless Communications.

[14]  Sajal K. Das,et al.  Routing Correlated Data with Fusion Cost in Wireless Sensor Networks , 2006, IEEE Transactions on Mobile Computing.

[15]  Panganamala Ramana Kumar,et al.  Computing and communicating functions over sensor networks , 2005, IEEE Journal on Selected Areas in Communications.

[16]  Patrick Tague,et al.  Network self-organization in the Internet of Things , 2013, 2013 IEEE International Conference on Sensing, Communications and Networking (SECON).

[17]  GuptaHimanshu,et al.  Efficient gathering of correlated data in sensor networks , 2008 .

[18]  Benny Sudakov,et al.  The phase transition in random graphs: A simple proof , 2012, Random Struct. Algorithms.

[19]  Mihaela van der Schaar,et al.  Dynamic network formation with incomplete information , 2013, ArXiv.

[20]  Mihaela van der Schaar,et al.  Information Production and Link Formation in Social Computing Systems , 2012, IEEE Journal on Selected Areas in Communications.

[21]  A. Galeotti,et al.  The Law of the Few , 2010 .

[22]  Zhu Han,et al.  Interference Aware Routing Using Network Formation Game in Cognitive Radio Mesh Networks , 2013, IEEE J. Sel. Areas Commun..

[23]  Mihaela van der Schaar,et al.  Content pricing in peer-to-peer networks , 2010, NetEcon.

[24]  Aditya Ramamoorthy Minimum Cost Distributed Source Coding Over a Network , 2011, IEEE Trans. Inf. Theory.

[25]  W. Zame,et al.  Efficient online exchange via fiat money , 2013 .

[26]  Ahmed Helmy,et al.  The quest for user similarity in mobile societies , 2014, 2014 IEEE International Conference on Pervasive Computing and Communication Workshops (PERCOM WORKSHOPS).

[27]  Douglas Cochran,et al.  Conjoining Speeds up Information Diffusion in Overlaying Social-Physical Networks , 2011, IEEE Journal on Selected Areas in Communications.

[28]  Mihaela van der Schaar,et al.  A Game Theoretic Analysis of Incentives in Content Production and Sharing Over Peer-to-Peer Networks , 2009, IEEE Journal of Selected Topics in Signal Processing.

[29]  Cong Shen,et al.  Silence is Gold: Strategic Interference Mitigation Using Tokens in Heterogeneous Small Cell Networks , 2015, IEEE Journal on Selected Areas in Communications.

[30]  Zijun Zhao,et al.  Network formation games for the link selection of cooperative localization in wireless networks , 2014, 2014 IEEE International Conference on Communications (ICC).

[31]  Muriel Médard,et al.  Minimum-Cost Subgraphs for Joint Distributed Source and Network Coding , 2006 .

[32]  David Lazer,et al.  Inferring friendship network structure by using mobile phone data , 2009, Proceedings of the National Academy of Sciences.

[33]  H. Vincent Poor,et al.  How Much Information Can One Get From a Wireless Ad Hoc Sensor Network Over a Correlated Random Field? , 2009, IEEE Transactions on Information Theory.

[34]  Zhu Han,et al.  Coalition Formation Games for Distributed Cooperation Among Roadside Units in Vehicular Networks , 2010, IEEE Journal on Selected Areas in Communications.

[35]  Hisayoshi Sugiyama,et al.  Autonomous chain network formation by multi-robot rescue system with ad hoc networking , 2010, 2010 IEEE Safety Security and Rescue Robotics.

[36]  Koushik Kar,et al.  Capacity Allocation Games for Network-Coded Multicast Streaming , 2014, IEEE/ACM Transactions on Networking.

[37]  Matthew O. Jackson,et al.  On the formation of interaction networks in social coordination games , 2002, Games Econ. Behav..

[38]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[39]  J. Nash Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[40]  Farhad Khozeimeh,et al.  Brain-Inspired Dynamic Spectrum Management for Cognitive Radio Ad Hoc Networks , 2012, IEEE Transactions on Wireless Communications.

[41]  Vishnu Navda,et al.  Efficient gathering of correlated data in sensor networks , 2008, TOSN.

[42]  Sanjeev Goyal,et al.  A Noncooperative Model of Network Formation , 2000 .