Statistics
| Branch: | Revision:

root / thesis / references.bib @ c6e2ce5a

History | View | Annotate | Download (18.1 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},
10
  pages     = {302--311},
11
  year      = {2012},
12
  crossref  = {DBLP:conf/socialcom/2012},
13
  doi       = {10.1109/SocialCom-PASSAT.2012.66},
14
  timestamp = {Mon, 14 Jan 2013 18:11:28 +0100},
15
  bibsource = {dblp computer science bibliography, http://dblp.org}
16
}
17

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

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

    
44
@article{Brandes2008136,
45
title = "On variants of shortest-path betweenness centrality and their generic computation ",
46
journal = "Social Networks ",
47
volume = "30",
48
number = "2",
49
pages = "136 - 145",
50
year = "2008",
51
note = "",
52
issn = "0378-8733",
53
doi = "http://dx.doi.org/10.1016/j.socnet.2007.11.001",
54
author = "Ulrik Brandes",
55
keywords = "Betweenness centrality",
56
keywords = "Algorithms",
57
keywords = "Valued networks",
58
keywords = "Load centrality ",
59
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. "
60
}
61

    
62
@article{Maccari2014670,
63
title = "Betweenness estimation in OLSR-based multi-hop networks for distributed filtering ",
64
journal = "Journal of Computer and System Sciences ",
65
volume = "80",
66
number = "3",
67
pages = "670 - 685",
68
year = "2014",
69
note = "Special Issue on Wireless Network Intrusion ",
70
issn = "0022-0000",
71
doi = "http://dx.doi.org/10.1016/j.jcss.2013.06.018",
72
author = "Leonardo Maccari and Renato {Lo Cigno}",
73
keywords = "Shortest path betweenness",
74
keywords = "OLSR",
75
keywords = "Multi-hop networks",
76
keywords = "Distributed firewall",
77
keywords = "Centrality",
78
keywords = "Multi-point relay ",
79
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. "
80
}
81

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

    
101
@article{Freeman1977,
102
    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.}},
103
    author = {Freeman, Linton C.},
104
    journal = {Sociometry},
105
    keywords = {betweeness, centrality, social-networks, sota},
106
    month = mar,
107
    number = {1},
108
    pages = {35--41},
109
    posted-at = {2007-01-04 16:23:36},
110
    priority = {2},
111
    publisher = {American Sociological Association},
112
    title = {{A Set of Measures of Centrality Based on Betweenness}},
113
    volume = {40},
114
    year = {1977}
115
}
116

    
117
@article{Freeman1978215,
118
title = "Centrality in social networks conceptual clarification",
119
journal = "Social Networks",
120
volume = "1",
121
number = "3",
122
pages = "215 - 239",
123
year = "1978",
124
note = "",
125
issn = "0378-8733",
126
doi = "http://dx.doi.org/10.1016/0378-8733(78)90021-7",
127
author = "Linton C. Freeman",
128
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."
129
}
130

    
131
@Article{Freeman1980,
132
author="Freeman, Linton C.",
133
title="The gatekeeper, pair-dependency and structural centrality",
134
journal="Quality and Quantity",
135
volume="14",
136
number="4",
137
pages="585--592",
138
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.",
139
issn="1573-7845",
140
doi="10.1007/BF00184720",
141
year="1980"
142
}
143

    
144

    
145
@article{Freeman1991141,
146
title = "Centrality in valued graphs: A measure of betweenness based on network flow",
147
journal = "Social Networks",
148
volume = "13",
149
number = "2",
150
pages = "141 - 154",
151
year = "1991",
152
note = "",
153
issn = "0378-8733",
154
doi = "http://dx.doi.org/10.1016/0378-8733(91)90017-N",
155
author = {Linton C. Freeman and Stephen P. Borgatti and Douglas R. White},
156
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."
157
}
158

    
159
@article{Braem:2013:CRC:2500098.2500108,
160
 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},
161
 title = {A Case for Research with and on Community Networks},
162
 journal = {SIGCOMM Comput. Commun. Rev.},
163
 issue_date = {July 2013},
164
 volume = {43},
165
 number = {3},
166
 month = jul,
167
 year = {2013},
168
 issn = {0146-4833},
169
 pages = {68--73},
170
 numpages = {6},
171
 doi = {10.1145/2500098.2500108},
172
 acmid = {2500108},
173
 publisher = {ACM},
174
 address = {New York, NY, USA},
175
 keywords = {community networking},
176
}
177

    
178
@article{Kas2012,
179
  author = {Kas, Miray and Appala, Sandeep and Wang, Chao and Carley, Kathleen M. and Carley, L. Richard and Tonguz, Ozan K.},
180
  biburl = {http://www.bibsonomy.org/bibtex/26aa7a2d921b7e5b26987fb2e4cdf4ed5/dblp},
181
  journal = {IEEE Wireless Commun.},
182
  keywords = {dblp},
183
  number = 6,
184
  pages = {36-43},
185
  timestamp = {2013-01-05T11:34:09.000+0100},
186
  title = {What if wireless routers were social? approaching wireless mesh networks from a social networks perspective.},
187
  volume = 19,
188
  year = {2012}
189
}
190

    
191
@inproceedings{Kas:2013:IAU:2492517.2492533,
192
 author = {Kas, Miray and Wachs, Matthew and Carley, Kathleen M. and Carley, L. Richard},
193
 title = {Incremental Algorithm for Updating Betweenness Centrality in Dynamically Growing Networks},
194
 booktitle = {Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining},
195
 series = {ASONAM '13},
196
 year = {2013},
197
 isbn = {978-1-4503-2240-9},
198
 location = {Niagara, Ontario, Canada},
199
 pages = {33--40},
200
 numpages = {8},
201
 doi = {10.1145/2492517.2492533},
202
 acmid = {2492533},
203
 publisher = {ACM},
204
 address = {New York, NY, USA},
205
 keywords = {all-pairs shortest paths, betweenness centrality, dynamic networks, incremental algorithms},
206
}
207

    
208
@article{Katsaros2010,
209
author={Katsaros, D. and Dimokas, N. and Tassiulas, L.},
210
journal={Network, IEEE},
211
title={Social network analysis concepts in the design of wireless Ad Hoc network protocols},
212
year={2010},
213
volume={24},
214
number={6},
215
pages={23-29},
216
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},
217
doi={10.1109/MNET.2010.5634439},
218
ISSN={0890-8044},
219
month={November},}
220

    
221
@article{Newman200539,
222
title = "A measure of betweenness centrality based on random walks ",
223
journal = "Social Networks ",
224
volume = "27",
225
number = "1",
226
pages = "39 - 54",
227
year = "2005",
228
note = "",
229
issn = "0378-8733",
230
doi = "http://dx.doi.org/10.1016/j.socnet.2004.11.009",
231
author = "M.E. J. Newman",
232
keywords = "Centrality",
233
keywords = "Betweenness",
234
keywords = "Random walks",
235
keywords = "Current flow ",
236
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. "
237
}
238

    
239
@book{Brandes:2005:NAM:1062400,
240
 author = {Brandes, Ulrik and Erlebach, Thomas},
241
 title = {Network Analysis: Methodological Foundations (Lecture Notes in Computer Science)},
242
 year = {2005},
243
 isbn = {3540249796},
244
 publisher = {Springer-Verlag New York, Inc.},
245
 address = {Secaucus, NJ, USA},
246
}
247

    
248
@techreport{Anthonisse1971,
249
    address = {Amsterdam},
250
    author = {Anthonisse, J. M.},
251
    institution = {Stichting Mathematisch Centrum},
252
    month = oct,
253
    posted-at = {2012-03-28 15:34:58},
254
    priority = {2},
255
    title = {{The rush in a directed graph}},
256
    year = {1971}
257
}
258

    
259
@article{Barthelemy2004,
260
    author = {Barthelemy, M.},
261
    doi = {10.1140/epjb/e2004-00111-4},
262
    issn = {1434-6028},
263
    journal = {The European Physical Journal B - Condensed Matter},
264
    keywords = {centrality},
265
    month = mar,
266
    number = {2},
267
    pages = {163--168},
268
    publisher = {Springer},
269
    title = {{Betweenness centrality in large complex networks}},
270
    volume = {38},
271
    year = {2004}
272
}
273

    
274
@article{Shimblel1953,
275
    author="Shimbel, Alfonso",
276
    title="Structural parameters of communication networks",
277
    journal="The bulletin of mathematical biophysics",
278
    volume="15",
279
    number="4",
280
    pages="501--507",
281
    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.",
282
    issn="1522-9602",
283
    doi="10.1007/BF02476438",
284
    year="1953"
285
}
286

    
287
@article{Bavelas1948,
288
    author = {Bavelas, A.},
289
    journal = {Human Organizations},
290
    keywords = {thesis},
291
    pages = {16--30},
292
    priority = {2},
293
    title = {{A mathematical model of Group Structure}},
294
    volume = {7},
295
    year = {1948}
296
}
297

    
298

299
@book{zhang2006wireless,
300
  title={Wireless Mesh Networking: Architectures, Protocols and Standards},
301
  author={Zhang, Y. and Luo, J. and Hu, H.},
302
  isbn={9781420013542},
303
  lccn={2006051791},
304
  series={Wireless Networks and Mobile Communications},
305
  year={2006},
306
  publisher={CRC Press}
307
}
308

    
309
@online{fiedler2006,
310
  title={Wireless Mesh Networks: Introduction - Basic Concepts},
311
  author={Fiedler, Ulrich and May, Martin and Plattner, Bernhard},
312
  year = {2006},
313
  urldate = {2016-03-02}
314
}
315

    
316
@online{jardin2006,
317
  title={A Wireless Network for ``Little Lhasa''},
318
  author={Jardin, Xeni},
319
  url={http://www.npr.org/2006/08/10/5631353/a-wireless-network-for-little-lhasa},
320
  urldate = {2006-08-10},
321
}
322

    
323
@INPROCEEDINGS{Suzuki2006,
324
author={H. Suzuki and Y. Kaneko and K. Mase and S. Yamazaki and H. Makino},
325
booktitle={Vehicular Technology Conference, 2006. VTC-2006 Fall. 2006 IEEE 64th},
326
title={An Ad Hoc Network in the Sky, SKYMESH, for Large-Scale Disaster Recovery},
327
year={2006},
328
pages={1-5},
329
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},
330
doi={10.1109/VTCF.2006.496},
331
month={Sept},}
332

    
333
@INPROCEEDINGS{Ahmed2008,
334
author={H. Ahmed and M. El-Darieby and Y. Morgan and B. Abdulhai},
335
booktitle={Vehicular Technology Conference, 2008. VTC Spring 2008. IEEE},
336
title={A Wireless Mesh Network-Based Platform for ITS},
337
year={2008},
338
pages={3047-3051},
339
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},
340
doi={10.1109/VETECS.2008.329},
341
ISSN={1550-2252},
342
month={May},}
343

    
344
@ARTICLE{Jain2003,
345
author={Saurabh Jain and D. P. Agrawal},
346
journal={Computer},
347
title={Wireless community networks},
348
year={2003},
349
volume={36},
350
number={8},
351
pages={90-92},
352
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},
353
doi={10.1109/MC.2003.1220588},
354
ISSN={0018-9162},
355
month={Aug},}
356

    
357
@article{Akyildiz2005445,
358
title = "Wireless mesh networks: a survey ",
359
journal = "Computer Networks ",
360
volume = "47",
361
number = "4",
362
pages = "445 - 487",
363
year = "2005",
364
note = "",
365
issn = "1389-1286",
366
doi = "http://dx.doi.org/10.1016/j.comnet.2004.12.001",
367
author = "Ian F. Akyildiz and Xudong Wang and Weilin Wang",
368
keywords = "Wireless mesh networks",
369
keywords = "Ad hoc networks",
370
keywords = "Wireless sensor networks",
371
keywords = "Medium access control",
372
keywords = "Routing protocol",
373
keywords = "Transport protocol",
374
keywords = "Scalability",
375
keywords = "Security",
376
keywords = "Power management and control",
377
keywords = "Timing synchronization "
378
}
379

    
380
@article {Baldesi2016,
381
author={Luca Baldesi and Leonardo Maccari},
382
title={NePA TesT: Network Protocol and Application Testing Toolchain for Community Networks},
383
year={2016},
384
journal={WONS}
385
}
386

    
387

    
388
@phdthesis{Pisa2013,
389
  author       = {Claudio Pisa},
390
  title        = {Improving Service Support in Wireless Community Networks},
391
  school       = {Università degli studi di Roma "Tor Vergata"},
392
  year         = 2013,
393
  url          = {http://netgroup.uniroma2.it/wp-content/uploads/2010/01/tesi_Claudio_Pisa_submitted.pdf}
394
}
395

    
396

    
397
@inproceedings{Vazquez-Rodas:2013:TCW:2507248.2507257,
398
 author = {V\'{a}zquez-Rodas, Andr{\'e}s and de la Cruz Llopis, Luis J.},
399
 title = {Topology Control for Wireless Mesh Networks Based on Centrality Metrics},
400
 booktitle = {Proceedings of the 10th ACM Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, \&\#38; Ubiquitous Networks},
401
 series = {PE-WASUN '13},
402
 year = {2013},
403
 isbn = {978-1-4503-2360-4},
404
 location = {Barcelona, Spain},
405
 pages = {25--32},
406
 numpages = {8},
407
 url = {http://doi.acm.org/10.1145/2507248.2507257},
408
 doi = {10.1145/2507248.2507257},
409
 acmid = {2507257},
410
 publisher = {ACM},
411
 address = {New York, NY, USA},
412
 keywords = {centrality metrics, connected dominating set, social network analysis, topology control, wireless mesh networks},
413
}
414