Betweenness centrality in Delay Tolerant Networks: A survey

Khabbaz, 2012, Disruption-tolerant networking: a comprehensive survey on recent developments and persisting challenges, Commun. Surv. Tutorials, IEEE, 14, 607, 10.1109/SURV.2011.041911.00093

Wei, 2014, A survey of social-aware routing protocols in delay tolerant networks: applications, taxonomy and design-related issues, Commun. Surv. Tutorials, IEEE, 16, 556, 10.1109/SURV.2013.042313.00103

Freeman, 1978, Centrality in social networks conceptual clarification, Soc. Networks, 1, 215, 10.1016/0378-8733(78)90021-7

Borgatti, 2006, A graph–theoretic perspective on centrality, Soc. Networks, 28, 466, 10.1016/j.socnet.2005.11.005

Freeman, 1977, A set of measures of centrality based on betweenness, Sociometry, 35, 10.2307/3033543

Anthonisse, 1971, The rush in a directed graph, Sticht. Math. Centrum. Math. Besliskd. BN, 1

Freeman, 1991, Centrality in valued graphs: a measure of betweenness based on network flow, Soc. Networks, 13, 141, 10.1016/0378-8733(91)90017-N

Stephenson, 1989, Rethinking centrality: methods and examples, Soc. Networks, 11, 1, 10.1016/0378-8733(89)90016-6

Dodds, 2003, An experimental study of search in global social networks, Science, 301, 827, 10.1126/science.1081058

Spyropoulos, 2010, Routing for disruption tolerant networks: taxonomy and design, Wirel. Networks, 16, 2349, 10.1007/s11276-010-0276-9

Zhao, 2004, A message ferrying approach for data delivery in sparse mobile ad hoc networks, 187

Shah, 2003, Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks, Ad Hoc Networks, 1, 215, 10.1016/S1570-8705(03)00003-9

Cao, 2013, Routing in delay/disruption tolerant networks: a taxonomy, survey and challenges, IEEE Commun. Surv. Tutorials, 15, 654, 10.1109/SURV.2012.042512.00053

Boldrini, 2014, Opportunistic networks, Comput. Commun., 48, 1, 10.1016/j.comcom.2014.04.007

Zhu, 2013, A survey of social-based routing in delay tolerant networks: positive and negative social effects, IEEE Commun. Surv. Tutorials, 15, 387, 10.1109/SURV.2012.032612.00004

Zhang, 2011, Encounter-based routing in delay tolerant networks, 338

Luo, 2013, Exploiting intercontact time for routing in delay tolerant networks, Trans. Emerg. Telecommun. Technol., 24, 589, 10.1002/ett.2553

Vendramin, 2011, A Greedy Ant Colony Optimization for routing in delay tolerant networks, 1127

Socievole, 2013, Opportunistic message routing using multi-layer social networks, 39

Yoneki, 2007, A socio-aware overlay for publish/subscribe communication in delay tolerant networks, 225

Patel, 2013, FCER routing using temporal closeness centrality for delay tolerant network, 1

E.M. Daly, M. Haahr, Social network analysis for routing in disconnected delay-tolerant MANETs, in: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networks and Computation – MobiHoc ’07, 2007, p. 32, http://dx.doi.org/10.1145/1288107.1288113.

Ágila, 2009, SimBetAge? Utilizing temporal changes in social networks for pocket switched networks, 13

Hui, 2011, BUBBLE Rap: social-based forwarding in delay-tolerant networks, IEEE Trans. Mob. Comput., 10, 1576, 10.1109/TMC.2010.246

Niu, 2013, A P2P query algorithm based on Betweenness Centrality Forwarding in opportunistic networks, 3433

Li, 2009, LocalCom: a community-based epidemic forwarding scheme in disruption-tolerant networks, 1

Jingwei Miao, O. Hasan, S.B. Mokhtar, L. Brunie, An adaptive routing algorithm for mobile delay tolerant networks, in: 14th International Symposium on Wireless Personal Multimedia Communications (WPMC), 2011, 2011, pp. 1–5.

Kim, 2014, A socially aware routing based on local contact information in delay-tolerant networks, Sci. World J., 2014, 7

Zhuo, 2011, Contact duration aware data replication in Delay Tolerant Networks, 236

Vendramin, 2012, CGrAnt: a swarm intelligence-based routing protocol for delay tolerant networks, 33

Xiao, 2014, Community-aware opportunistic routing in mobile social networks, IEEE Transactions on Computation, 63, 1682, 10.1109/TC.2013.55

Vastardis, 2014, Socially-aware multi-phase opportunistic routing for distributed mobile social networks, Wireless Personal Communications, 79, 1343, 10.1007/s11277-014-1933-6

Yuan, 2013, Opportunistic forwarding with hotspot entropy, 1

Guidi, 2014, Distributed protocols for ego betweenness centrality computation in DOSNs, 539

Wei, 2014, On social delay-tolerant networking: aggregation, tie detection, and routing, IEEE Transactions on Parallel Distributed Systems, 25, 1563, 10.1109/TPDS.2013.264

Kourtellis, 2012, Identifying high betweenness centrality nodes in large social networks, Soc. Netw. Anal. Min., 3, 899, 10.1007/s13278-012-0076-6

Goh, 2003, Betweenness centrality correlation in social networks, Phys. Rev. E, 67, 017101, 10.1103/PhysRevE.67.017101

Liljeros, 2001, The web of human sexual contacts, Nature, 411, 907, 10.1038/35082140

Ortiz, 2004, The social networks of academic performance in a student context of poverty in Mexico, Soc. Networks, 26, 175, 10.1016/j.socnet.2004.01.010

Jeong, 2001, Lethality and centrality in protein networks, Nature, 411, 41, 10.1038/35075138

Macskassy, 2011, Contextual linking behavior of bloggers: leveraging text mining to enable topic-based analysis, Soc. Netw. Anal. Min., 1, 355, 10.1007/s13278-011-0026-8

Maglaras, 2011, New measures for characterizing the significance of nodes in wireless ad hoc networks via localized path-based neighborhood analysis, Soc. Netw. Anal. Min., 2, 97, 10.1007/s13278-011-0029-5

Hua, 2012, A network analysis of an online expertise sharing community, Soc. Netw. Anal. Min., 2, 291, 10.1007/s13278-012-0047-y

Catanese, 2012, Forensic analysis of phone call networks, Soc. Netw. Anal. Min., 3, 15, 10.1007/s13278-012-0060-1

Ang, 2011, Interaction networks and patterns of guild community in massively multiplayer online games, Soc. Netw. Anal. Min., 1, 341, 10.1007/s13278-011-0025-9

Singh, 2005, Congestion and decongestion in a communication network, Phys. Rev. E, 71, 055103, 10.1103/PhysRevE.71.055103

Zhang, 2007, Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing, 195

Piorkowski, 2009, A parsimonious model of mobile partitioned networks with clustering, 1

Chaintreau, 2008, Opportunistic spatial gossip over mobile social networks, 73

Chierichetti, 2008, Gossiping (via mobile?) in social networks, 27

Miluzzo, 2008, Sensing meets mobile social networks, 337

Beach, 2008, WhozThat? Evolving an ecosystem for context-aware mobile social networks, IEEE Netw., 22, 50, 10.1109/MNET.2008.4579771

Dong, 2009, An experimental study of large-scale mobile social network, 1175

Palazzi, 2012, Social-aware delay tolerant networking for mobile-to-mobile file?sharing, Int. J. Commun. Syst., 25, 1281, 10.1002/dac.1324

Hui, 2005, Pocket switched networks and human mobility in conference environments, 244

Gaito, 2012, Bus switched networks: an ad hoc mobile platform enabling urban-wide communications, Ad Hoc Networks, 10, 931, 10.1016/j.adhoc.2011.12.005

Liu, 2015, A sociality-aware approach to computing backbone in mobile opportunistic networks, Ad Hoc Networks, 24, 46, 10.1016/j.adhoc.2014.07.007

Barbera, 2011, VIP delegation: enabling VIPs to offload data in wireless social mobile networks, 1

Boldrini, 2013, Data dissemination in opportunistic networks, 453

Greede, 2012, RDD: repository-based data dissemination protocol for opportunistic networks, 101

Galati, 2013, Analyzing temporal metrics of public transportation for designing scalable delay-tolerant networks, 37

Pantazopoulos, 2010, Efficient social-aware content placement in opportunistic networks, 17

Brandes, 2005

Harris, 2008

Casteigts, 2010, Time-varying graphs and dynamic networks, 1

Tang, 2010, Analysing information flows and key mediators through temporal centrality metrics categories and subject descriptors, 1

Milgram, 1967, The small world problem, Psychol. Today., 2, 60

Newman, 2005, A measure of betweenness centrality based on random walks, Soc. Networks., 27, 39, 10.1016/j.socnet.2004.11.009

Cormen, 2009

Everett, 2005, Ego network betweenness, Soc. Networks, 27, 31, 10.1016/j.socnet.2004.11.007

Burt, 1995

Geisberger, 2008, Better approximation of betweenness centrality, ALENEX, 90

T. Carpenter, G. Karakostas, D. Shallcross, S. Street, Practical issues and algorithms for analyzing terrorist networks, in: Proceedings of the Western Simulation MultiConference, 2002.

Garreau, 2001, Disconnect the dots, Washington Post., 17, C1

Stewart, 2001, Six degrees of Mohamed Atta, Business, 2, 10

Ressler, 2006, Social network analysis as an approach to combat terrorism: past, present, and future research, Homel. Secur. Aff., 2, 1

Demetrescu, 2001, Fully dynamic all pairs shortest paths with real edge weights, 260

Demetrescu, 2004, A new approach to dynamic all pairs shortest paths, J. ACM, 51, 968, 10.1145/1039488.1039492

Brandes, 2008, On variants of shortest-path betweenness centrality and their generic computation, Soc. Networks, 30, 136, 10.1016/j.socnet.2007.11.001

Opsahl, 2010, Node centrality in weighted networks: generalizing degree and shortest paths, Soc. Networks, 32, 245, 10.1016/j.socnet.2010.03.006

Brandes, 2001, A faster algorithm for betweenness centrality, J. Math. Sociol., 25, 163, 10.1080/0022250X.2001.9990249

Newman, 2001, Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality, Phys. Rev. E, 64, 016132, 10.1103/PhysRevE.64.016132

Dijkstra, 1959, A note on two problems in connexion with graphs, Numer. Math., 1, 269, 10.1007/BF01386390

Brandes, 2007, Centrality estimation in large networks, Int. J. Bifurc. Chaos., 17, 2303, 10.1142/S0218127407018403

M. Riondato, E.M. Kornaropoulos, Fast approximation of betweenness centrality through sampling, in: Proceedings of the 7th ACM International Conference on Web Search Data Minig – WSDM ’14, 2014, pp. 413–422, http://dx.doi.org/10.1145/2556195.2556224.

Bader, 2007, Approximating betweenness centrality, Algorithms Model. Web-Graph., 124, 10.1007/978-3-540-77004-6_10

Hinne, 2011

Fredman, 1987, Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM, 34, 596, 10.1145/28869.28874

Eppstein, 2004, Fast approximation of centrality, Graph Algorithms Appl., 8, 39, 10.7155/jgaa.00081

Hoeffding, 1963, Probability inequalities for sums of bounded random variables, Am. Stat. Assoc., 58, 13, 10.1080/01621459.1963.10500830

Har-Peled, 2010, Relative (p,ε)-approximations in geometry, Discrete Comput. Geom., 45, 462, 10.1007/s00454-010-9248-1

Li, 2000, Improved bounds on the sample complexity of learning, 309

Marsden, 2002, Egocentric and sociocentric measures of network centrality, Soc. Networks, 24, 407, 10.1016/S0378-8733(02)00016-3

Okasha, 2005, Altruism, group selection and correlated interaction, Br. J. Philos. Sci., 56, 703, 10.1093/bjps/axi143

Adamic, 2001, Search in power-law networks, Phys. Rev. E, 64, 046135, 10.1103/PhysRevE.64.046135

Winters, 1960, Forecasting sales by exponentially weighted moving averages, Manage. Sci., 6, 324, 10.1287/mnsc.6.3.324

Palla, 2005, Uncovering the overlapping community structure of complex networks in nature and society, Nature, 435, 814, 10.1038/nature03607

Newman, 2004, Analysis of weighted networks, Phys. Rev. E, 70, 056131, 10.1103/PhysRevE.70.056131

Dorigo, 1999, The ant colony optimization meta-heuristic, 11

Bonabeau, 1999

Goss, 1989, Self-organized shortcuts in the Argentine ant, Naturwissenschaften, 76, 579, 10.1007/BF00462870

Kim, 2013, Betweenness of expanded ego networks in sociality-aware delay tolerant networks, 499

Bulut, 2010, Friendship based routing in delay tolerant mobile social networks, 1

Chaintreau, 2007, Impact of human mobility on opportunistic forwarding algorithms, IEEE Trans. Mob. Comput., 6, 606, 10.1109/TMC.2007.1060

Luxburg, 2007, A tutorial on spectral clustering, Stat. Comput., 17, 395, 10.1007/s11222-007-9033-z

Wu, 2013, Homing spread: community home-based multi-copy routing in mobile social networks, 2319

Ibrahim, 2009, Analysis of relay protocols for throwbox-equipped DTNs, 1

Mtibaa, 2010, PeopleRank: social opportunistic forwarding, 1

Gao, 2010, Fine-grained mobility characterization, 61

K. Lee, S. Hong, S.J. Kim, I. Rhee, S. Chong, Demystifying Levy Walk Patterns in Human Walks, CS Dept., NCSU, Raleigh, NC, USA, Tech. Rep, 2008.

Allport, 1921, Personality traits: their classification measurement, J. Abnorm. Psychol. Soc. Psychol., 16, 6, 10.1037/h0069790

Cover, 2012

Anand, 2009, Entropy measures for networks: toward an information theory of complex topologies, Phys. Rev. E, 80, 045102, 10.1103/PhysRevE.80.045102

Jelasity, 2011, Gossip, 139

Hwang, 2008, Bridging centrality: graph mining from element level to group level, 336

N. Eagle, A. Pentland, CRAWDAD data set mit/reality (v. 2005-07-01), 2005 <http://crawdad.cs.dartmouth.edu/mit/reality>.

D. Kotz, T. Henderson, I. Abyzov, J. Yeo, CRAWDAD data set dartmouth/campus (v. 2009-09-09), 2009 <http://crawdad.cs.dartmouth.edu/dartmouth/campus>.

Ford, 1987, Maximal flow through a network, 243

Baldoni, 2005, Content-based routing in highly dynamic mobile ad hoc networks, Int. J. Pervasive Comput. Commun., 1, 277, 10.1108/17427370580000131

A. Vahdat, D. Becker, Epidemic Routing for Partially Connected Ad Hoc Networks, Technical Report CS-200006, Duke University, 2000.