Impact of Social Relation and Group Size in Multicast Ad Hoc Networks

This paper investigates the multicast capacity of static wireless social networks. We adopt the two-layer network model, which includes the social layer and the networking layer. In the social layer, the social group size of each source node is modeled as power-law distribution. Moreover, the rank-based model is utilized to describe the relation between source and destinations in the networking layer. Based on the two-layer network model, the probability density function (PDF) of the destination positions is analyzed and verified by numerical simulation, which is different from the traditional ad hoc networks. According to the PDF, the bound of the network capacity is derived, and we propose a Euclidean minimum-spanning-tree-based transmission scheme, which is proved to achieve the order of capacity bound for most cases. Finally, the capacity of social networks is compared to the traditional multicast ad hoc networks, which indicates that the capacity scaling performs better in social networks than traditional ones. To our best knowledge, this is the first work of analyzing the impact on the capacity of social relation and group size in multicast ad hoc networks for the rank-based model.

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

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

[3]  Social Network Analysis in Organizations , 2014, Encyclopedia of Social Network Analysis and Mining.

[4]  Jasmine Novak,et al.  Geographic routing in social networks , 2005, Proc. Natl. Acad. Sci. USA.

[5]  Oriana Riva,et al.  Demo Abstract-Ad Hoc Social Networking using MAND , 2008 .

[6]  Seungyeop Han,et al.  Analysis of topological characteristics of huge online social networking services , 2007, WWW '07.

[7]  George Giakkoupis,et al.  The effect of power-law degrees on the navigability of small worlds: [extended abstract] , 2009, PODC '09.

[8]  Hayder Radha,et al.  A distributed and privacy preserving algorithm for identifying information hubs in social networks , 2011, 2011 Proceedings IEEE INFOCOM.

[9]  J. Steele Growth Rates of Euclidean Minimal Spanning Trees With Power Weighted Edges , 1988 .

[10]  Jasmine Novak,et al.  Theoretical Analysis of Geographic Routing in Social Networks , 2005 .

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

[12]  H. Vincent Poor,et al.  Average Message Delivery Time for Small-World Networks in the Continuum Limit , 2010, IEEE Transactions on Information Theory.

[13]  Hamid R. Sadjadpour,et al.  The impact of social groups on the capacity of wireless networks , 2011, 2011 IEEE Network Science Workshop.

[14]  R. Srikant,et al.  The Multicast Capacity of Large Multihop Wireless Networks , 2007, IEEE/ACM Transactions on Networking.

[15]  Shaojie Tang,et al.  Relationship classification in large scale online social networks and its impact on information propagation , 2011, 2011 Proceedings IEEE INFOCOM.

[16]  Jin Li,et al.  SocialTube: P2P-Assisted Video Sharing in Online Social Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

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

[18]  Xiang-Yang Li Multicast Capacity of Wireless Ad Hoc Networks , 2009, IEEE/ACM Transactions on Networking.

[19]  SujinP. Jose SocialTube : P 2 P-Assisted Video Sharing in Online Social Networks , 2014 .

[20]  Hamid R. Sadjadpour,et al.  A Unifying Perspective on the Capacity of Wireless Ad Hoc Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[21]  Ronald F. Boisvert,et al.  NIST Handbook of Mathematical Functions , 2010 .

[22]  Charles Ofria,et al.  Distributed Cooperative Caching in Social Wireless Networks , 2013, IEEE Transactions on Mobile Computing.

[23]  Wan Choi,et al.  Bit Concatenation Based User Relaying in MIMO Broadcast Channels , 2012, IEEE Transactions on Communications.