Capacity of wireless networks with social behavior

IEEE Transactions on Wireless Communications

Volumn 12, Issue 1, 2013, Pages 60-69

  Azimdoost, Bita ^a   Sadjadpour, Hamid R ^a   Garcia Luna Aceves, J J ^a,b  

^a University of California Santa Cruz   (United States)

^b PALO ALTO RESEARCH CENTER   (United States)

Author keywords

Social networks; throughput capacity; wireless networks

Indexed keywords

DOMINANT FACTOR; EUCLIDEAN DISTANCE; MULTI-HOP PATH; NETWORK SIZE; POWER LAW DISTRIBUTION; SOCIAL BEHAVIOR; SOCIAL GROUPS; SOCIAL NETWORKS; THROUGHPUT CAPACITIES; TRANSMISSION RANGES;

COMMUNICATION; SOCIAL NETWORKING (ONLINE); THROUGHPUT;

WIRELESS NETWORKS;

EID: 84873085724     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2012.121112.111581     Document Type: Article

References (16)

1. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
2. B. Latané, J. H. Liu, A. Nowak, M. Bonevento, and L. Zheng, "Distance matters: physical space and social impact," Personality and Social Psychology Bulletin, vol. 21, no. 8, pp. 795-805, Aug. 1995.
3. L. Backstrom, E. Sun, and C. Marlow, "Find me if you can: improving geographical prediction with social and spatial proximity," in Proc. 2010 International Conference on World Wide Web, pp. 61-70.
4. S. Milgram, "The small world problem," Psychology Today, vol. 2, pp. 60-67, 1967.
5. D. J. Watts and S. H. Strogatz, "Collective dynamics of 'small-world' networks," Nature, vol. 393, no. 6684, pp. 440-442, June 1998. (Pubitemid 28292183)
6. M. Dietzfelbinger and P. Woelfel, "Tight lower bounds for greedy routing in uniform small world rings," in Proc. 2009 ACM Symposium on Theory of Computing, pp. 591-600.
7. P. Fraigniaud and G. Giakkoupis, "On the searchability of small-world networks with arbitrary underlying structure," in Proc. 2010 ACM Symposium on Theory of Computing, pp. 389-398.
8. J. Kleinberg, "The small-world phenomenon: an algorithm perspective," in Proc. 2000 ACM Symposium on Theory of Computing, pp. 163-170.
9. J. Li, C. Blake, D. S. J. De Couto, H. I. Lee, and R. Morris, "Capacity of ad hoc wireless networks," in Proc. 2001 International Conference on Mobile Computing and Networking, pp. 61-69.
10. B. Azimdoost, H. R. Sadjadpour, and J. J. Garcia Luna-Aceves, "Capacity of composite networks: combining social and wireless ad hoc networks," in Proc. 2011 IEEE Wireless Communications and Networking Conference, pp. 464-468.
11. M. D. Penrose, "The longest edge of the random minimal spanning tree," The Annals of Applied Probability, vol. 7, no. 2, pp. 340-361, 1997.
12. F. Xue and P. R. Kumar, "Scaling laws for ad hoc wireless networks: an information theoretic approach," in Foundations and Trends in Networking, 2006, pp. 16-47.
13. T. P. Mitev, "New inequalities between elementary symmetric polynomials," J. Inequalities in Pure and Applied Mathematics, vol. 4, no. 2, 2003.
14. Z. Wang, H. R. Sadjadpour, and J. J. Garcia-Luna-Aceves, "Fundamental limits of information dissemination in wireless ad hoc networks-part II: multi-packet reception," IEEE Trans. Wireless Commun., vol. 10, no. 3, pp. 803-813, Mar. 2011.
15. P. Gupta and P. R. Kumar, "Internets in the sky: the capacity of three dimensional wireless networks," in Commun. in Inf. and Syst., 2001, pp. 33-50.
16. B. Liu, D. Towsley, and A. Swami, "Data gathering capacity of large scale multihop wireless networks," in Proc. 2008 IEEE International Conference on Mobile Ad Hoc and Sensor Systems, pp. 124-132.