Towards social-aware routing in dynamic communication networks

Many communication networks such as Mobile Ad Hoc Networks (MANETs) involve in human interactions and exhibit properties of social networks. Hence, it is interesting to see how knowledge from social networks can be used to enhance the communication processes. We focus on the use of identifying modular structure in social networks to improve the efficiency of routing strategies. Since nodes mobility in a network often alters its modular structure and requires recomputing of modules from scratch, updating the modules is the main bottleneck in current social-aware routing strategies where nodes often have limited processing speed. Towards real-time routing strategies, we develop an adaptive method to efficiently update modules in a dynamic network in which a novel compact representation of the network is used to significantly reduces the network size while preserving essential network structure.

[1]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

[2]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[3]  Pan Hui,et al.  CRAWDAD dataset cambridge/haggle (v.2009-05-29) , 2009 .

[4]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[5]  Philip S. Yu,et al.  GraphScope: parameter-free mining of large time-evolving graphs , 2007, KDD '07.

[6]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Mads Haahr,et al.  Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.

[9]  Pan Hui,et al.  How Small Labels Create Big Improvements , 2006, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[10]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[11]  Gergely Palla,et al.  Preferential attachment of communities: The same principle, but a higher level , 2006 .

[12]  A. Arenas,et al.  Community analysis in social networks , 2004 .

[13]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Mario Gerla,et al.  A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks , 1999, IEEE Netw..

[15]  Bart Selman,et al.  Tracking evolving communities in large linked networks , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[16]  A. Barabasi,et al.  Quantifying social group evolution , 2007, Nature.

[17]  Zongkai Yang,et al.  A Survey on Mobile Ad Hoc Wireless Network , 2004 .

[18]  Liang Qin,et al.  Survey on Mobile Ad Hoc Network Routing Protocols and Cross-Layer Design , 2004 .

[19]  Claudio Castellano,et al.  Community Structure in Graphs , 2007, Encyclopedia of Complexity and Systems Science.

[20]  Nathan Eagle,et al.  CRAWDAD dataset mit/reality (v.2005-07-01) , 2005 .