Capacity of Wireless Networks with Social Behavior

The capacity of a wireless network is studied when nodes communicate with one another in the context of social groups. All the nodes are assumed to have the same number of independent long-range social contacts, one of which each selects randomly as its destination. The Euclidean distance between a source and its social group members follows a power-law distribution and communication between any two nodes takes place only within the physical transmission range resulting in communication over multi-hop paths. The capacity order of such a composite network is derived as a function of the number of nodes, the social-group concentration, and the size of social groups. Our results demonstrate that when each node has constant number of contacts which does not increase with network size growth, and are geographically concentrated, then the network behaves similar to social networks and communication network does not have any effect on the throughput capacity. On the other hand, when the social contact population grows in time, or social connectivity among nodes is highly distributed, then the communication network is the dominant factor and the composite network behaves similar to wireless networks, i.e., the capacity is the same as Gupta and Kumar results. When neither social connectivity nor communication network is dominant, then the throughput capacity results are between these two extreme cases.

[1]  M. Penrose The longest edge of the random minimal spanning tree , 1997 .

[2]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[3]  Lars Backstrom,et al.  Find me if you can: improving geographical prediction with social and spatial proximity , 2010, WWW '10.

[4]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[5]  George Giakkoupis,et al.  On the searchability of small-world networks with arbitrary underlying structure , 2010, STOC '10.

[6]  Martin Dietzfelbinger,et al.  Brief announcement: tight lower bounds for greedy routing in uniform small world rings , 2009, PODC '09.

[7]  James H. Liu,et al.  Distance Matters: Physical Space and Social Impact , 1995 .

[8]  Hamid R. Sadjadpour,et al.  Fundamental Limits of Information Dissemination in Wireless Ad Hoc Networks—Part II: Multi-Packet Reception , 2011, IEEE Transactions on Wireless Communications.

[9]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[10]  Robert Tappan Morris,et al.  Capacity of Ad Hoc wireless networks , 2001, MobiCom '01.

[11]  Todor P. Mitev,et al.  NEW INEQUALITIES BETWEEN ELEMENTARY SYMMETRIC POLYNOMIALS , 2003 .

[12]  Donald F. Towsley,et al.  Data gathering capacity of large scale multihop wireless networks , 2008, 2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[13]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[14]  Hamid R. Sadjadpour,et al.  Capacity of composite networks: Combining social and wireless ad hoc networks , 2011, 2011 IEEE Wireless Communications and Networking Conference.

[15]  P. R. Kumar,et al.  Internets in the sky: The capacity of three-dimensional wireless networks , 2001, Commun. Inf. Syst..

[16]  Panganamala Ramana Kumar,et al.  Scaling Laws for Ad Hoc Wireless Networks: An Information Theoretic Approach , 2006, Found. Trends Netw..