Revision c6e2ce5a thesis/references.bib

View differences:

thesis/references.bib
6 6
               Ulrik Brandes},
7 7
  title     = {Heuristics for Speeding Up Betweenness Centrality Computation},
8 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},
9
               {PASSAT} 2012},
11 10
  pages     = {302--311},
12 11
  year      = {2012},
13 12
  crossref  = {DBLP:conf/socialcom/2012},
14
  url       = {http://dx.doi.org/10.1109/SocialCom-PASSAT.2012.66},
15 13
  doi       = {10.1109/SocialCom-PASSAT.2012.66},
16 14
  timestamp = {Mon, 14 Jan 2013 18:11:28 +0100},
17
  biburl    = {http://dblp2.uni-trier.de/rec/bib/conf/socialcom/PuzisZEDB12},
18 15
  bibsource = {dblp computer science bibliography, http://dblp.org}
19 16
}
20 17

  
......
28 25
 location = {Esbjerg, Denmark},
29 26
 pages = {191--203},
30 27
 numpages = {13},
31
 url = {http://dx.doi.org/10.1007/978-3-540-89900-6_20},
32 28
 doi = {10.1007/978-3-540-89900-6_20},
33 29
 acmid = {1485471},
34 30
 publisher = {Springer-Verlag},
......
55 51
note = "",
56 52
issn = "0378-8733",
57 53
doi = "http://dx.doi.org/10.1016/j.socnet.2007.11.001",
58
url = "http://www.sciencedirect.com/science/article/pii/S0378873307000731",
59 54
author = "Ulrik Brandes",
60 55
keywords = "Betweenness centrality",
61 56
keywords = "Algorithms",
......
74 69
note = "Special Issue on Wireless Network Intrusion ",
75 70
issn = "0022-0000",
76 71
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",
72
author = "Leonardo Maccari and Renato {Lo Cigno}",
79 73
keywords = "Shortest path betweenness",
80 74
keywords = "OLSR",
81 75
keywords = "Multi-hop networks",
......
95 89
note = "Modeling and Performance Evaluation of Wireless Ad-Hoc Networks ",
96 90
issn = "1570-8705",
97 91
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",
92
author = "Leonardo Maccari and Renato {Lo Cigno}",
100 93
keywords = "Mesh networks",
101 94
keywords = "Community networks",
102 95
keywords = "Network topology",
......
117 110
    priority = {2},
118 111
    publisher = {American Sociological Association},
119 112
    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 113
    volume = {40},
122 114
    year = {1977}
123 115
}
......
132 124
note = "",
133 125
issn = "0378-8733",
134 126
doi = "http://dx.doi.org/10.1016/0378-8733(78)90021-7",
135
url = "http://www.sciencedirect.com/science/article/pii/0378873378900217",
136 127
author = "Linton C. Freeman",
137 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."
138 129
}
......
147 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.",
148 139
issn="1573-7845",
149 140
doi="10.1007/BF00184720",
150
url="http://dx.doi.org/10.1007/BF00184720",
151 141
year="1980"
152 142
}
153 143

  
......
162 152
note = "",
163 153
issn = "0378-8733",
164 154
doi = "http://dx.doi.org/10.1016/0378-8733(91)90017-N",
165
url = "http://www.sciencedirect.com/science/article/pii/037887339190017N",
166 155
author = {Linton C. Freeman and Stephen P. Borgatti and Douglas R. White},
167 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."
168 157
}
......
179 168
 issn = {0146-4833},
180 169
 pages = {68--73},
181 170
 numpages = {6},
182
 url = {http://doi.acm.org/10.1145/2500098.2500108},
183 171
 doi = {10.1145/2500098.2500108},
184 172
 acmid = {2500108},
185 173
 publisher = {ACM},
......
196 184
  pages = {36-43},
197 185
  timestamp = {2013-01-05T11:34:09.000+0100},
198 186
  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 187
  volume = 19,
201 188
  year = {2012}
202 189
}
......
211 198
 location = {Niagara, Ontario, Canada},
212 199
 pages = {33--40},
213 200
 numpages = {8},
214
 url = {http://doi.acm.org/10.1145/2492517.2492533},
215 201
 doi = {10.1145/2492517.2492533},
216 202
 acmid = {2492533},
217 203
 publisher = {ACM},
......
242 228
note = "",
243 229
issn = "0378-8733",
244 230
doi = "http://dx.doi.org/10.1016/j.socnet.2004.11.009",
245
url = "http://www.sciencedirect.com/science/article/pii/S0378873304000681",
246 231
author = "M.E. J. Newman",
247 232
keywords = "Centrality",
248 233
keywords = "Betweenness",
......
268 253
    posted-at = {2012-03-28 15:34:58},
269 254
    priority = {2},
270 255
    title = {{The rush in a directed graph}},
271
    url = {http://oai.cwi.nl/oai/asset/9791/9791A.pdf},
272 256
    year = {1971}
273 257
}
274 258

  
......
283 267
    pages = {163--168},
284 268
    publisher = {Springer},
285 269
    title = {{Betweenness centrality in large complex networks}},
286
    url = {http://dx.doi.org/10.1140/epjb/e2004-00111-4},
287 270
    volume = {38},
288 271
    year = {2004}
289 272
}
......
298 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.",
299 282
    issn="1522-9602",
300 283
    doi="10.1007/BF02476438",
301
    url="http://dx.doi.org/10.1007/BF02476438",
302 284
    year="1953"
303 285
}
304 286

  
......
320 302
  isbn={9781420013542},
321 303
  lccn={2006051791},
322 304
  series={Wireless Networks and Mobile Communications},
323
  url={https://books.google.it/books?id=7t4szWRwnFkC},
324 305
  year={2006},
325 306
  publisher={CRC Press}
326 307
}
......
329 310
  title={Wireless Mesh Networks: Introduction - Basic Concepts},
330 311
  author={Fiedler, Ulrich and May, Martin and Plattner, Bernhard},
331 312
  year = {2006},
332
  url = {http://www.csg.ethz.ch/education/lectures/ATCN/ws06_07/doc/WMN-BasicsWS0607.pdf},
333 313
  urldate = {2016-03-02}
334 314
}
335 315

  
336 316
@online{jardin2006,
337
  title={A Wireless Network for 'Little Lhasa'},
317
  title={A Wireless Network for ``Little Lhasa''},
338 318
  author={Jardin, Xeni},
339
  year = {2006},
340 319
  url={http://www.npr.org/2006/08/10/5631353/a-wireless-network-for-little-lhasa},
341 320
  urldate = {2006-08-10},
342 321
}
......
385 364
note = "",
386 365
issn = "1389-1286",
387 366
doi = "http://dx.doi.org/10.1016/j.comnet.2004.12.001",
388
url = "http://www.sciencedirect.com/science/article/pii/S1389128604003457",
389 367
author = "Ian F. Akyildiz and Xudong Wang and Weilin Wang",
390 368
keywords = "Wireless mesh networks",
391 369
keywords = "Ad hoc networks",
......
398 376
keywords = "Power management and control",
399 377
keywords = "Timing synchronization "
400 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

  

Also available in: Unified diff