Statistics
| Branch: | Revision:

root / thesis / references.bib @ df1b1a42

History | View | Annotate | Download (18.3 KB)

1
@inproceedings{PuzisZEDB12,
2
  author    = {Rami Puzis and
3
               Polina Zilberman and
4
               Yuval Elovici and
5
               Shlomi Dolev and
6
               Ulrik Brandes},
7
  title     = {Heuristics for Speeding Up Betweenness Centrality Computation},
8
  booktitle = {2012 International Conference on Privacy, Security, Risk and Trust,
9
               {PASSAT} 2012, and 2012 International Confernece on Social Computing,
10
               SocialCom 2012, Amsterdam, Netherlands, September 3-5, 2012},
11
  pages     = {302--311},
12
  year      = {2012},
13
  crossref  = {DBLP:conf/socialcom/2012},
14
  url       = {http://dx.doi.org/10.1109/SocialCom-PASSAT.2012.66},
15
  doi       = {10.1109/SocialCom-PASSAT.2012.66},
16
  timestamp = {Mon, 14 Jan 2013 18:11:28 +0100},
17
  biburl    = {http://dblp2.uni-trier.de/rec/bib/conf/socialcom/PuzisZEDB12},
18
  bibsource = {dblp computer science bibliography, http://dblp.org}
19
}
20

    
21
@inproceedings{Puzis:2008:ONP:1485445.1485471,
22
 author = {Puzis, Rami and Klippel, Marius David and Elovici, Yuval and Dolev, Shlomi},
23
 title = {Optimization of NIDS Placement for Protection of Intercommunicating Critical Infrastructures},
24
 booktitle = {Proceedings of the 1st European Conference on Intelligence and Security Informatics},
25
 series = {EuroISI '08},
26
 year = {2008},
27
 isbn = {978-3-540-89899-3},
28
 location = {Esbjerg, Denmark},
29
 pages = {191--203},
30
 numpages = {13},
31
 url = {http://dx.doi.org/10.1007/978-3-540-89900-6_20},
32
 doi = {10.1007/978-3-540-89900-6_20},
33
 acmid = {1485471},
34
 publisher = {Springer-Verlag},
35
 address = {Berlin, Heidelberg},
36
 keywords = {NIDS placement, communication infrastructure protection, epidemic models},
37
}
38

    
39
@article{Brandes01afaster,
40
    author = {Ulrik Brandes},
41
    title = {A Faster Algorithm for Betweenness Centrality},
42
    journal = {Journal of Mathematical Sociology},
43
    year = {2001},
44
    volume = {25},
45
    pages = {163--177}
46
}
47

    
48
@article{Brandes2008136,
49
title = "On variants of shortest-path betweenness centrality and their generic computation ",
50
journal = "Social Networks ",
51
volume = "30",
52
number = "2",
53
pages = "136 - 145",
54
year = "2008",
55
note = "",
56
issn = "0378-8733",
57
doi = "http://dx.doi.org/10.1016/j.socnet.2007.11.001",
58
url = "http://www.sciencedirect.com/science/article/pii/S0378873307000731",
59
author = "Ulrik Brandes",
60
keywords = "Betweenness centrality",
61
keywords = "Algorithms",
62
keywords = "Valued networks",
63
keywords = "Load centrality ",
64
abstract = "Betweenness centrality based on shortest paths is a standard measure of control utilized in numerous studies and implemented in all relevant software tools for network analysis. In this paper, a number of variants are reviewed, placed into context, and shown to be computable with simple variants of the algorithm commonly used for the standard case. "
65
}
66

    
67
@article{Maccari2014670,
68
title = "Betweenness estimation in OLSR-based multi-hop networks for distributed filtering ",
69
journal = "Journal of Computer and System Sciences ",
70
volume = "80",
71
number = "3",
72
pages = "670 - 685",
73
year = "2014",
74
note = "Special Issue on Wireless Network Intrusion ",
75
issn = "0022-0000",
76
doi = "http://dx.doi.org/10.1016/j.jcss.2013.06.018",
77
url = "http://www.sciencedirect.com/science/article/pii/S002200001300127X",
78
author = "Leonardo Maccari and Renato Lo Cigno",
79
keywords = "Shortest path betweenness",
80
keywords = "OLSR",
81
keywords = "Multi-hop networks",
82
keywords = "Distributed firewall",
83
keywords = "Centrality",
84
keywords = "Multi-point relay ",
85
abstract = "Abstract In traditional networks special efforts are put to secure the perimeter with firewalls: particular routers that analyze and filter the traffic to separate zones with different levels of trust. In wireless multi-hop networks the perimeter is a concept extremely hard to identify, thus, it is much more effective to enforce control on the nodes that will route more traffic. But traffic filtering and traffic analysis are costly activities for the limited resources of mesh nodes, so a trade-off must be reached limiting the number of nodes that enforce them. This work shows how, using the \{OLSR\} protocol, the centrality of groups of nodes with reference to traffic can be estimated with high accuracy independently of the network topology or size. We also show how this approach greatly limits the impact of an attack to the network using a number of firewalls that is only a fraction of the available nodes. "
86
}
87

    
88
@article{Maccari2015175,
89
title = "A week in the life of three large Wireless Community Networks ",
90
journal = "Ad Hoc Networks ",
91
volume = "24, Part B",
92
number = "",
93
pages = "175 - 190",
94
year = "2015",
95
note = "Modeling and Performance Evaluation of Wireless Ad-Hoc Networks ",
96
issn = "1570-8705",
97
doi = "http://dx.doi.org/10.1016/j.adhoc.2014.07.016",
98
url = "http://www.sciencedirect.com/science/article/pii/S1570870514001474",
99
author = "Leonardo Maccari and Renato Lo Cigno",
100
keywords = "Mesh networks",
101
keywords = "Community networks",
102
keywords = "Network topology",
103
keywords = "Privacy",
104
keywords = "Network analysis",
105
keywords = "Centrality metrics "
106
}
107

    
108
@article{Freeman1977,
109
    abstract = {{A Family of new measures of point and graph centrality based on early intuitions of Bavelas (1948) is introduced. These measures define centrality in terms of the degree to which a point falls on the shortest path between others and therefore has a potential for control of communication. They may be used to index centrality in any large or small network of symmetrical relations, whether connected or unconnected.}},
110
    author = {Freeman, Linton C.},
111
    journal = {Sociometry},
112
    keywords = {betweeness, centrality, social-networks, sota},
113
    month = mar,
114
    number = {1},
115
    pages = {35--41},
116
    posted-at = {2007-01-04 16:23:36},
117
    priority = {2},
118
    publisher = {American Sociological Association},
119
    title = {{A Set of Measures of Centrality Based on Betweenness}},
120
    url = {http://links.jstor.org/sici?sici=0038-0431\%28197703\%2940\%3A1\%3C35\%3AASOMOC\%3E2.0.CO\%3B2-H},
121
    volume = {40},
122
    year = {1977}
123
}
124

    
125
@article{Freeman1978215,
126
title = "Centrality in social networks conceptual clarification",
127
journal = "Social Networks",
128
volume = "1",
129
number = "3",
130
pages = "215 - 239",
131
year = "1978",
132
note = "",
133
issn = "0378-8733",
134
doi = "http://dx.doi.org/10.1016/0378-8733(78)90021-7",
135
url = "http://www.sciencedirect.com/science/article/pii/0378873378900217",
136
author = "Linton C. Freeman",
137
abstract = "The intuitive background for measures of structural centrality in social networks is reviewed and existing measures are evaluated in terms of their consistency with intuitions and their interpretability. Three distinct intuitive conceptions of centrality are uncovered and existing measures are refined to embody these conceptions. Three measures are developed for each concept, one absolute and one relative measure of the centrality of positions in a network, and one reflecting the degree of centralization of the entire network. The implications of these measures for the experimental study of small groups is examined."
138
}
139

    
140
@Article{Freeman1980,
141
author="Freeman, Linton C.",
142
title="The gatekeeper, pair-dependency and structural centrality",
143
journal="Quality and Quantity",
144
volume="14",
145
number="4",
146
pages="585--592",
147
abstract="This is a note to introduce a new measure of a kind of structural centrality called pair-dependency. Pair-dependency explicates the centrality-related notion of the gatekeeper. Moreover, it turns out to be a fundamental structural property of communication networks that provides the basis for the derivation of two standard measures of structural centrality.",
148
issn="1573-7845",
149
doi="10.1007/BF00184720",
150
url="http://dx.doi.org/10.1007/BF00184720",
151
year="1980"
152
}
153

    
154

    
155
@article{Freeman1991141,
156
title = "Centrality in valued graphs: A measure of betweenness based on network flow",
157
journal = "Social Networks",
158
volume = "13",
159
number = "2",
160
pages = "141 - 154",
161
year = "1991",
162
note = "",
163
issn = "0378-8733",
164
doi = "http://dx.doi.org/10.1016/0378-8733(91)90017-N",
165
url = "http://www.sciencedirect.com/science/article/pii/037887339190017N",
166
author = {Linton C. Freeman and Stephen P. Borgatti and Douglas R. White},
167
abstract = "A new measure of centrality, CF, is introduced. It is based on the concept of network flows. While conceptually similar to Freeman's original measure, CB, the new measure differs from the original in two important ways. First, CF is defined for both valued and non-valued graphs. This makes CF applicable to a wider variety of network datasets. Second, the computation of CF is not based on geodesic paths as is CB but on all the independent paths between all pairs of points in the network."
168
}
169

    
170
@article{Braem:2013:CRC:2500098.2500108,
171
 author = {Braem, Bart and Blondia, Chris and Barz, Christoph and Rogge, Henning and Freitag, Felix and Navarro, Leandro and Bonicioli, Joseph and Papathanasiou, Stavros and Escrich, Pau and Baig Vi\~{n}as, Roger and Kaplan, Aaron L. and Neumann, Axel and Vilata i Balaguer, Ivan and Tatum, Blaine and Matson, Malcolm},
172
 title = {A Case for Research with and on Community Networks},
173
 journal = {SIGCOMM Comput. Commun. Rev.},
174
 issue_date = {July 2013},
175
 volume = {43},
176
 number = {3},
177
 month = jul,
178
 year = {2013},
179
 issn = {0146-4833},
180
 pages = {68--73},
181
 numpages = {6},
182
 url = {http://doi.acm.org/10.1145/2500098.2500108},
183
 doi = {10.1145/2500098.2500108},
184
 acmid = {2500108},
185
 publisher = {ACM},
186
 address = {New York, NY, USA},
187
 keywords = {community networking},
188
}
189

    
190
@article{Kas2012,
191
  author = {Kas, Miray and Appala, Sandeep and Wang, Chao and Carley, Kathleen M. and Carley, L. Richard and Tonguz, Ozan K.},
192
  biburl = {http://www.bibsonomy.org/bibtex/26aa7a2d921b7e5b26987fb2e4cdf4ed5/dblp},
193
  journal = {IEEE Wireless Commun.},
194
  keywords = {dblp},
195
  number = 6,
196
  pages = {36-43},
197
  timestamp = {2013-01-05T11:34:09.000+0100},
198
  title = {What if wireless routers were social? approaching wireless mesh networks from a social networks perspective.},
199
  url = {http://dblp.uni-trier.de/db/journals/wc/wc19.html#KasAWCCT12},
200
  volume = 19,
201
  year = {2012}
202
}
203

    
204
@inproceedings{Kas:2013:IAU:2492517.2492533,
205
 author = {Kas, Miray and Wachs, Matthew and Carley, Kathleen M. and Carley, L. Richard},
206
 title = {Incremental Algorithm for Updating Betweenness Centrality in Dynamically Growing Networks},
207
 booktitle = {Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining},
208
 series = {ASONAM '13},
209
 year = {2013},
210
 isbn = {978-1-4503-2240-9},
211
 location = {Niagara, Ontario, Canada},
212
 pages = {33--40},
213
 numpages = {8},
214
 url = {http://doi.acm.org/10.1145/2492517.2492533},
215
 doi = {10.1145/2492517.2492533},
216
 acmid = {2492533},
217
 publisher = {ACM},
218
 address = {New York, NY, USA},
219
 keywords = {all-pairs shortest paths, betweenness centrality, dynamic networks, incremental algorithms},
220
}
221

    
222
@article{Katsaros2010,
223
author={Katsaros, D. and Dimokas, N. and Tassiulas, L.},
224
journal={Network, IEEE},
225
title={Social network analysis concepts in the design of wireless Ad Hoc network protocols},
226
year={2010},
227
volume={24},
228
number={6},
229
pages={23-29},
230
keywords={ad hoc networks;protocols;centrality metrics;community formation;cross-layer optimization;network measurement task;social network analysis;structural property;wireless ad hoc network protocol;Ad hoc networks;Measurement;Network topology;Protocols;Routing;Social network services},
231
doi={10.1109/MNET.2010.5634439},
232
ISSN={0890-8044},
233
month={November},}
234

    
235
@article{Newman200539,
236
title = "A measure of betweenness centrality based on random walks ",
237
journal = "Social Networks ",
238
volume = "27",
239
number = "1",
240
pages = "39 - 54",
241
year = "2005",
242
note = "",
243
issn = "0378-8733",
244
doi = "http://dx.doi.org/10.1016/j.socnet.2004.11.009",
245
url = "http://www.sciencedirect.com/science/article/pii/S0378873304000681",
246
author = "M.E. J. Newman",
247
keywords = "Centrality",
248
keywords = "Betweenness",
249
keywords = "Random walks",
250
keywords = "Current flow ",
251
abstract = "Betweenness is a measure of the centrality of a node in a network, and is normally calculated as the fraction of shortest paths between node pairs that pass through the node of interest. Betweenness is, in some sense, a measure of the influence a node has over the spread of information through the network. By counting only shortest paths, however, the conventional definition implicitly assumes that information spreads only along those shortest paths. Here, we propose a betweenness measure that relaxes this assumption, including contributions from essentially all paths between nodes, not just the shortest, although it still gives more weight to short paths. The measure is based on random walks, counting how often a node is traversed by a random walk between two other nodes. We show how our measure can be calculated using matrix methods, and give some examples of its application to particular networks. "
252
}
253

    
254
@book{Brandes:2005:NAM:1062400,
255
 author = {Brandes, Ulrik and Erlebach, Thomas},
256
 title = {Network Analysis: Methodological Foundations (Lecture Notes in Computer Science)},
257
 year = {2005},
258
 isbn = {3540249796},
259
 publisher = {Springer-Verlag New York, Inc.},
260
 address = {Secaucus, NJ, USA},
261
}
262

    
263
@techreport{Anthonisse1971,
264
    address = {Amsterdam},
265
    author = {Anthonisse, J. M.},
266
    institution = {Stichting Mathematisch Centrum},
267
    month = oct,
268
    posted-at = {2012-03-28 15:34:58},
269
    priority = {2},
270
    title = {{The rush in a directed graph}},
271
    url = {http://oai.cwi.nl/oai/asset/9791/9791A.pdf},
272
    year = {1971}
273
}
274

    
275
@article{Barthelemy2004,
276
    author = {Barthelemy, M.},
277
    doi = {10.1140/epjb/e2004-00111-4},
278
    issn = {1434-6028},
279
    journal = {The European Physical Journal B - Condensed Matter},
280
    keywords = {centrality},
281
    month = mar,
282
    number = {2},
283
    pages = {163--168},
284
    publisher = {Springer},
285
    title = {{Betweenness centrality in large complex networks}},
286
    url = {http://dx.doi.org/10.1140/epjb/e2004-00111-4},
287
    volume = {38},
288
    year = {2004}
289
}
290

    
291
@article{Shimblel1953,
292
    author="Shimbel, Alfonso",
293
    title="Structural parameters of communication networks",
294
    journal="The bulletin of mathematical biophysics",
295
    volume="15",
296
    number="4",
297
    pages="501--507",
298
    abstract="Certain parameters are defined which roughly characterize the internal structure of networks. A given network structure uniquely determines the values of the parameters, but the reverse is not true. The parameters therefore define certain classes of networks.",
299
    issn="1522-9602",
300
    doi="10.1007/BF02476438",
301
    url="http://dx.doi.org/10.1007/BF02476438",
302
    year="1953"
303
}
304

    
305
@article{Bavelas1948,
306
    author = {Bavelas, A.},
307
    journal = {Human Organizations},
308
    keywords = {thesis},
309
    pages = {16--30},
310
    priority = {2},
311
    title = {{A mathematical model of Group Structure}},
312
    volume = {7},
313
    year = {1948}
314
}
315

    
316

317
@book{zhang2006wireless,
318
  title={Wireless Mesh Networking: Architectures, Protocols and Standards},
319
  author={Zhang, Y. and Luo, J. and Hu, H.},
320
  isbn={9781420013542},
321
  lccn={2006051791},
322
  series={Wireless Networks and Mobile Communications},
323
  url={https://books.google.it/books?id=7t4szWRwnFkC},
324
  year={2006},
325
  publisher={CRC Press}
326
}
327

    
328
@online{fiedler2006,
329
  title={Wireless Mesh Networks: Introduction - Basic Concepts},
330
  author={Fiedler, Ulrich and May, Martin and Plattner, Bernhard},
331
  year = {2006},
332
  url = {http://www.csg.ethz.ch/education/lectures/ATCN/ws06_07/doc/WMN-BasicsWS0607.pdf},
333
  urldate = {2016-03-02}
334
}
335

    
336
@online{jardin2006,
337
  title={A Wireless Network for 'Little Lhasa'},
338
  author={Jardin, Xeni},
339
  year = {2006},
340
  url={http://www.npr.org/2006/08/10/5631353/a-wireless-network-for-little-lhasa},
341
  urldate = {2006-08-10},
342
}
343

    
344
@INPROCEEDINGS{Suzuki2006,
345
author={H. Suzuki and Y. Kaneko and K. Mase and S. Yamazaki and H. Makino},
346
booktitle={Vehicular Technology Conference, 2006. VTC-2006 Fall. 2006 IEEE 64th},
347
title={An Ad Hoc Network in the Sky, SKYMESH, for Large-Scale Disaster Recovery},
348
year={2006},
349
pages={1-5},
350
keywords={ad hoc networks;disasters;mobile communication;Niigata University campus;SKYMESH;ad hoc network;communication network backbone;emergency communication network;large-scale disaster recovery;Ad hoc networks;Cellular phones;Communication equipment;Communication networks;Earthquakes;Interference;Internet;Large-scale systems;Local government;Spine},
351
doi={10.1109/VTCF.2006.496},
352
month={Sept},}
353

    
354
@INPROCEEDINGS{Ahmed2008,
355
author={H. Ahmed and M. El-Darieby and Y. Morgan and B. Abdulhai},
356
booktitle={Vehicular Technology Conference, 2008. VTC Spring 2008. IEEE},
357
title={A Wireless Mesh Network-Based Platform for ITS},
358
year={2008},
359
pages={3047-3051},
360
keywords={Bluetooth;mobile radio;telecommunication network topology;transportation;Bluetooth wireless technology;intelligent transportation system;mobile device;traffic congestion;traffic network monitoring;wireless municipal mesh network;Bluetooth;Communications technology;Intelligent transportation systems;Prototypes;System performance;Telecommunication traffic;Testing;Urban areas;Wireless mesh networks;Wireless sensor networks},
361
doi={10.1109/VETECS.2008.329},
362
ISSN={1550-2252},
363
month={May},}
364

    
365
@ARTICLE{Jain2003,
366
author={Saurabh Jain and D. P. Agrawal},
367
journal={Computer},
368
title={Wireless community networks},
369
year={2003},
370
volume={36},
371
number={8},
372
pages={90-92},
373
keywords={IEEE standards;Internet;ad hoc networks;directive antennas;internetworking;radio access networks;routing protocols;telecommunication links;wireless LAN;11 WLAN;Internet gateway;WLAN technology;ad hoc wireless community network;data packet;fixed wireless node;omnidirectional antenna;open standard IEEE 802;point-to-multipoint link;point-to-point link;unidirectional antenna;wireless local area networking technology;Application software;Computer networks;Computer vision;Directive antennas;IP networks;Internet telephony;Protocols;Radio broadcasting;Radio frequency;Wireless networks},
374
doi={10.1109/MC.2003.1220588},
375
ISSN={0018-9162},
376
month={Aug},}
377

    
378
@article{Akyildiz2005445,
379
title = "Wireless mesh networks: a survey ",
380
journal = "Computer Networks ",
381
volume = "47",
382
number = "4",
383
pages = "445 - 487",
384
year = "2005",
385
note = "",
386
issn = "1389-1286",
387
doi = "http://dx.doi.org/10.1016/j.comnet.2004.12.001",
388
url = "http://www.sciencedirect.com/science/article/pii/S1389128604003457",
389
author = "Ian F. Akyildiz and Xudong Wang and Weilin Wang",
390
keywords = "Wireless mesh networks",
391
keywords = "Ad hoc networks",
392
keywords = "Wireless sensor networks",
393
keywords = "Medium access control",
394
keywords = "Routing protocol",
395
keywords = "Transport protocol",
396
keywords = "Scalability",
397
keywords = "Security",
398
keywords = "Power management and control",
399
keywords = "Timing synchronization "
400
}