-
Notifications
You must be signed in to change notification settings - Fork 0
/
bibliografia.bib
executable file
·732 lines (670 loc) · 52.4 KB
/
bibliografia.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
@book{Kurose2013,
abstract = {Certain data-communication protocols hog the spotlight, but all of them have a lot in common. Computer Networking: A Top-Down Approach Featuring the Internet explains the engineering problems that are inherent in communicating digital information from point to point. The top-down approach mentioned in the subtitle means that the book starts at the top of the protocol stack--at the application layer--and works its way down through the other layers, until it reaches bare wire. The authors, for the most part, shun the well-known seven-layer Open Systems Interconnection (OSI) protocol stack in favor of their own five-layer (application, transport, network, link, and physical) model. It's an effective approach that helps clear away some of the hand waving traditionally associated with the more obtuse layers in the OSI model. The approach is definitely theoretical--don't look here for instructions on configuring Windows 2000 or a Cisco router--but it's relevant to reality, and should help anyone who needs to understand networking as a programmer, system architect, or even administration guru.The treatment of the network layer, at which routing takes place, is typical of the overall style. In discussing routing, authors James Kurose and Keith Ross explain (by way of lots of clear, definition-packed text) what routing protocols need to do: find the best route to a destination. Then they present the mathematics that determine the best path, show some code that implements those algorithms, and illustrate the logic by using excellent conceptual diagrams. Real-life implementations of the algorithms--including Internet Protocol (both IPv4 and IPv6) and several popular IP routing protocols--help you to make the transition from pure theory to networking technologies. --David WallTopics covered: The theory behind data networks, with thorough discussion of the problems that are posed at each level (the application layer gets plenty of attention). For each layer, there's academic coverage of networking problems and solutions, followed by discussion of real technologies. Special sections deal with network security and transmission of digital multimedia. },
added-at = {2010-02-04T15:36:38.000+0100},
address = {USA},
author = {Kurose, James F. and Ross, Keith W.},
biburl = {https://www.bibsonomy.org/bibtex/2dbdb2b09c92e570de0e3ae3a3d6eb6b4/lysander07},
description = {Computer Networking},
edition = {6th},
interhash = {bb096c0cd46e1cad21b47ba08899d310},
intrahash = {dbdb2b09c92e570de0e3ae3a3d6eb6b4},
isbn = {0136079679, 9780136079675},
keywords = {internet networking www02 wwwbook wwwkap4},
publisher = {Addison-Wesley Publishing Company},
timestamp = {2010-02-04T15:36:38.000+0100},
title = {Computer Networking: A Top-Down Approach},
year = 2013
}
@book{Li2008,
address = {Cambridge},
author = {Li, Xiang-Yang},
doi = {10.1017/CBO9780511754722},
isbn = {9780511754722},
mendeley-groups = {Tesis de maestr{\'{i}}a/MANET/VANET},
publisher = {Cambridge University Press},
title = {{Wireless Ad Hoc and Sensor Networks}},
url = {http://ebooks.cambridge.org/ref/id/CBO9780511754722},
year = {2008}
}
@article{Al-Sultan2014,
abstract = {Vehicular ad hoc networks (VANETs) are classified as an application of mobile ad hoc network (MANET) that has the potential in improving road safety and in providing travellers comfort. Recently VANETs have emerged to turn the attention of researchers in the field of wireless and mobile communications, they differ from MANET by their architecture, challenges, characteristics and applications. In this paper e present aspects related to this field to help researchers and developers to understand and distinguish the main features surrounding VANET in one solid document, ithout the need to go through other relevant papers and articles starting from VANET architecture and ending up ith the most appropriate simulation tools to simulate VANET protocols and applications. {\textcopyright} 2013 Elsevier Ltd.},
author = {Al-Sultan, Saif and Al-Doori, Moath M. and Al-Bayatti, Ali H. and Zedan, Hussien},
doi = {10.1016/j.jnca.2013.02.036},
file = {:C$\backslash$:/Users/comec/Google Drive/master/referencias/articulos/A{\_}comprehensive{\_}survey{\_}on{\_}vehicular{\_}Ad{\_}Hoc{\_}network.pdf:pdf},
issn = {10958592},
journal = {Journal of Network and Computer Applications},
keywords = {Challenges in VANET,Safety applications,VANET,VANET simulation},
mendeley-groups = {Tesis de maestr{\'{i}}a/Estado del arte,Tesis de maestr{\'{i}}a/MANET/VANET},
number = {1},
pages = {380--392},
publisher = {Elsevier},
title = {{A comprehensive survey on vehicular Ad Hoc network}},
url = {http://dx.doi.org/10.1016/j.jnca.2013.02.036},
volume = {37},
year = {2014}
}
@book{Härri2015,
abstract = {DSRC has been allocated (three in EU, seven in US) dedicated channels at 5.9 GHz for vehicular communications. Although resource allocations on the commoncontrol channel (CCH) reserved for safety-related applications have been well investigated, efficient usage of the other SCHs is less developed. With new ITS safety-related applications appearing, such as autonomous driving or truck platooning, as well as the expected coexistence between ITS and non-ITS technologies for smart mobility applications, operating on multiple channels and efficiently sharing the ITS spectrum become critical. First, multi-channel operations aim at mitigating the communication load on specific channels by offloading part of traffic to alternate channels. Second, multi-channel operations aim at providing mechanisms to dynamically change channels and fit to the service requirements as function of external interferences or to varying traffic conditions. In this chapter, we describe the regulations and mechanisms for ITS multi-channel operation and coexistence in the US and in the EU. We first provide an overview of the frequency allocations and access restrictions for ITS, and then describe the protocols available in standards and R{\&}D for multi-channel operations.},
address = {Cham},
author = {Härri, Jérôme and Kenney, John},
booktitle = {Vehicular Ad Hoc Networks Standards, Solutions, and Research},
doi = {10.1007/978-3-319-15497-8},
editor = {Campolo, Claudia and Molinaro, Antonella and Scopigno, Riccardo},
file = {:C$\backslash$:/Users/comec/Google Drive/libros/redes-de-computadoras/redes-ad-hoc/vanet/Vehicular{\_}ad{\_}hoc{\_}Networks-Standards{\_}Solutions{\_}and{\_}Research.pdf:pdf},
isbn = {978-3-319-15496-1},
keywords = {Coexistence,ETSI,ETSI EN 302 571,ETSI TS 102 636-4-2,ETSI TS 102 724,ETSI TS 103 165,Multi-channel,Multi-channel congestion control,Offloading,Service management,Spectrum allocation,VANET,WAVE,WAVE 1609.3,WAVE 1609.4},
mendeley-groups = {Tesis de maestr{\'{i}}a/Marco te{\'{o}}rico,Tesis de maestr{\'{i}}a/MANET/VANET},
pages = {193--218},
publisher = {Springer International Publishing},
title = {{Vehicular ad hoc Networks}},
url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84943791358{\&}partnerID=tZOtx3y1 http://link.springer.com/10.1007/978-3-319-15497-8},
year = {2015}
}
@book{Meneguette2018,
abstract = {This book presents a timely description of currently used and proposed technologies that involve the intelligent transport system to assist the manager of large cities. Therefore, it describes all concepts and technologies that address the challenges, bringing up a top-down approach, which begins from the vehicular network and central infrastructure to a distributed structure. For scientists and researchers, this book will bring together the state-of-the-art of the main techniques that involve intelligent transport systems to assist the manager of big cities. For practitioners and professionals, this book will describe techniques which can be put into practice and use to aid the development of new applications and services. Concerning postgraduate students, this book will provide highlights of main concerns and concepts and explain techniques that can assist students to identify challenges that they can explore, contribute to, and advance the current status of technology.},
address = {Cham},
author = {{I. Meneguette}, Rodolfo and {E. De Grande}, Robson and {A. F. Loureiro}, Antonio},
doi = {10.1007/978-3-319-93332-0},
file = {:C$\backslash$:/Users/comec/Google Drive/libros/redes-de-computadoras/redes-ad-hoc/vanet/2018{\_}Book{\_}IntelligentTransportSystemInSm.pdf:pdf},
isbn = {978-3-319-93331-3},
mendeley-groups = {Tesis de maestr{\'{i}}a/MANET/VANET},
publisher = {Springer International Publishing},
series = {Urban Computing},
title = {{Intelligent Transport System in Smart Cities}},
url = {http://link.springer.com/10.1007/978-3-319-93332-0},
year = {2018}
}
@inproceedings{Brendha2017,
abstract = {Vehicular Ad Hoc Networks (VANETs) is an essential and emerging area of research in the field of Ad Hoc Networks. The main objective of deploying VANET is to improve the road safety and reduce the number of accidents. In VANET, routing is a difficult task because of the high mobility of nodes, which causes rapid changes of topology and to deliver a packet within a minimum period of time. Existing routing protocols are not sufficient to meet all the issues in routing. To provide best routing protocol, it is necessary to make an analysis of routing protocols in VANET. This paper starts with the basic architecture of VANET and provides a detailed description of various existing routing techniques with its advantages and disadvantages. Finally, this paper discusses an overview of the existing routing protocols for VANET.},
author = {Brendha, R. and Prakash, V. Sinthu Janita},
booktitle = {2017 4th International Conference on Advanced Computing and Communication Systems (ICACCS)},
doi = {10.1109/ICACCS.2017.8014615},
file = {:C$\backslash$:/Users/comec/AppData/Local/Mendeley Ltd./Mendeley Desktop/Downloaded/Brendha, Prakash - 2017 - A survey on routing protocols for vehicular Ad Hoc networks.pdf:pdf},
isbn = {978-1-5090-4559-4},
keywords = {Architecture,Merits and Demerits,Routing Protocols,Vehicular Ad Hoc Networks (VANETs)},
mendeley-groups = {Tesis de maestr{\'{i}}a,Tesis de maestr{\'{i}}a/Enrutamiento,Tesis de maestr{\'{i}}a/Estado del arte},
month = {jan},
pages = {1--7},
publisher = {IEEE},
title = {{A survey on routing protocols for vehicular Ad Hoc networks}},
url = {http://ieeexplore.ieee.org/document/8014615/},
year = {2017}
}
@article{Purohit2017,
abstract = {Vehicular ad hoc network (VANET) is emerging as one of the challenging research area because of the heavy dependency of human being into vehicles which tends to develop an intelligent transport system. VANET is treated as an extension of mobile ad hoc network (MANET) due to its behavior and its working mode. VANET is emerging as a new powerful tool to provide safety and security to the human beings during the time of traveling from one place to another. Routing is one of the challenging tasks for both MANET and VANET due to the frequent change in the topology. In this paper, we are evaluating the adaptability of existing MANET routing protocols for VANET. This paper analyze that what is the impact the vehicle density and speed on the packet delivery ratio, normalized routing load, average end-to-end delay, average throughput, average path length and average loss rate, which will help to design a new routing protocol or to have some improvement in the existing routing protocols.},
author = {Purohit, Kamlesh Chandra and Dimri, Sushil Chandra and Jasola, Sanjay},
doi = {10.1007/s13198-016-0507-2},
file = {:C$\backslash$:/Users/comec/AppData/Local/Mendeley Ltd./Mendeley Desktop/Downloaded/Purohit, Dimri, Jasola - 2017 - Performance evaluation of various MANET routing protocols for adaptability in VANET environment.pdf:pdf},
issn = {09764348},
journal = {International Journal of Systems Assurance Engineering and Management},
keywords = {Density,End{\_}to{\_}End delay,ITS,MANET,Mobility,Packet delivery ratio,Routing,Routing-load and path-length,Throughput,Topology,VANET},
mendeley-groups = {Tesis de maestr{\'{i}}a/Enrutamiento},
month = {nov},
pages = {690--702},
publisher = {Springer India},
title = {{Performance evaluation of various MANET routing protocols for adaptability in VANET environment}},
volume = {8},
year = {2017}
}
@inproceedings{Korichi2018,
author = {Korichi, Afaf and Zafoune, Youcef},
booktitle = {2018 International Conference on Smart Communications in Network Technologies (SaCoNeT)},
doi = {10.1109/SaCoNeT.2018.8585450},
file = {:C$\backslash$:/Users/comec/Google Drive/master/referencias/articulos/MAAC{\_}Protocol{\_}Mobile{\_}Agents{\_}based{\_}Address{\_}Auto{\_}Configuration{\_}Protocol{\_}for{\_}MANET.pdf:pdf},
isbn = {978-1-5386-9493-0},
keywords = {cluster,component,ip address auto-configuration,mobile ad hoc network,mobile agent,multi-agent},
mendeley-groups = {Tesis de maestr{\'{i}}a/Direccionamiento IP},
month = {oct},
pages = {194--199},
publisher = {IEEE},
title = {{MAAC Protocol: Mobile Agents based Address Auto-Configuration Protocol for MANET}},
url = {https://ieeexplore.ieee.org/document/8585450/},
year = {2018}
}
@article{Sun2018,
abstract = {BACKGROUND AND AIM: Colonic perforation is the serious accidental$\backslash$ncomplication. The aim of this study is to analyze the clinical presentation$\backslash$nand management of recent iatrogenic perforations during therapeutic$\backslash$ncolonoscopy. METHODS: Consecutive patients referred to four academic$\backslash$ncancer centers in Japan were retrospectively reviewed using each$\backslash$ncenter's endoscopy database of medical records. Data was obtained$\backslash$nby means of an extensive data collection sheet. Since we evaluated$\backslash$nthe data including iatrogenic perforation during newly developed$\backslash$ntherapeutic procedure such as endoscopic submucosal dissection (ESD)$\backslash$nor hemoclips, the collection of patient data was set from the period$\backslash$nof the beginning of ESD technique in each hospital in this study.$\backslash$nRESULTS: The overall rate of occurrence of perforation was 0.15$\backslash${\%}$\backslash$n(23/15, 160). Perforation rate for EMR (0.58$\backslash${\%}) showed a significantly$\backslash$nhigher rate (P {\textless} 0.0001) than that for hot biopsy and polypectomy.$\backslash$nThe rate for ESD (14$\backslash${\%}) showed a markedly higher rate (P {\textless} 0.0001)$\backslash$nthan that for other standard procedures. Of those perforations, endoscopic$\backslash$nclipping was performed in 56.5$\backslash${\%} of the patients, and conservative$\backslash$ntreatment was successful in 100$\backslash${\%} of the patients with successful$\backslash$nclosure. Both CT scan findings and serology results (WBC, CRP) after$\backslash$nperforation were poor predictors for need for surgery as opposed$\backslash$nto conservative management. CONCLUSIONS: Further improvements in$\backslash$nEMR with special knife techniques are required to simply and safely$\backslash$nremove large colorectal neoplasms, because perforation rate for ESD$\backslash$nshows a markedly higher. Conservative management may be possible$\backslash$nin patients who have undergone complete endoscopic clipping.},
author = {Sun, Gang and Zhang, Yijing and Liao, Dan and Yu, Hongfang and Du, Xiaojiang and Guizani, Mohsen},
doi = {10.1109/TVT.2018.2828651},
file = {:C$\backslash$:/Users/comec/Google Drive/master/estado-del-arte/Bus-Trajectory-Based{\_}Street-Centric{\_}Routing{\_}for{\_}Message{\_}Delivery{\_}in{\_}Urban{\_}Vehicular{\_}Ad{\_}Hoc{\_}Networks.pdf:pdf},
issn = {00189545},
journal = {IEEE Transactions on Vehicular Technology},
keywords = {VANETs,ant colony optimization,bus trajectory-based graph,street-centric routing},
mendeley-groups = {Tesis de maestr{\'{i}}a/Estado del arte},
number = {8},
pages = {7550--7563},
publisher = {IEEE},
title = {{Bus-Trajectory-Based Street-Centric Routing for Message Delivery in Urban Vehicular Ad Hoc Networks}},
volume = {67},
year = {2018}
}
@article{Mezher2017,
abstract = {One of the most important goals of vehicular ad hoc networks (VANETs) in smart cities is the efficient management of accidents, specially to prevent them. Our research lies on a promising smart service, which soon might be available in our cities. After the occurrence of an accident, a vehicle could make a light and short video of the situation and send it through the VANET till reaching an access point in the infrastructure of the city to alert the emergencies service (e.g., 911 or 112). With a video message, the level of seriousness of the accident could be better interpreted by the authorities (i.e., health care unit, police, ambulance drivers) than with a simple text message. In this way, vehicles could participate in reporting a situation in the city using the ad hoc network so it would be possible to have a quick reaction of the emergency units and even prevent further accidents. The deployment of an efficient routing protocol to manage video-reporting messages in VANETs has important benefits by enabling a fast warning of the incident, which potentially might save lives. To contribute with this goal, we propose a multimedia multimetric map-aware routing protocol to provide video-reporting messages over VANETs in smart cities. Furthermore, a realistic scenario is created by using real maps with SUMO including buildings that may interfere the signal between sender and receiver. Also, we use our REVsim tool that allows vehicles to avoid choosing vehicles behind buildings to be chosen as next forwarding nodes. Simulations show the benefits of our proposal, taking into account the mobility of the nodes and the presence of interfering buildings.},
author = {{Mohamad Mezher}, Ahmad and {Aguilar Igartua}, Mónica},
doi = {10.1109/TVT.2017.2715719},
file = {:C$\backslash$:/Users/comec/Google Drive/master/referencias/articulos/Multimedia{\_}Multimetric{\_}Map{\_}Aware{\_}Routing{\_}Protocol{\_}to{\_}Send{\_}Video{\_}Reporting{\_}Messages{\_}Over{\_}VANETs{\_}in{\_}Smart{\_}Cities.pdf:pdf},
issn = {00189545},
journal = {IEEE Transactions on Vehicular Technology},
keywords = {Building attenuation,Realistic urban scenarios,Smart cities,Vehicular ad hoc networks,Video-streaming services},
mendeley-groups = {Tesis de maestr{\'{i}}a/Enrutamiento},
number = {12},
pages = {10611--10625},
title = {{Multimedia multimetric map-Aware routing protocol to send video-Reporting messages over VANETs in smart cities}},
volume = {66},
year = {2017}
}
@book{Hagen2006,
author = {Hagen, Silvia},
title = {IPv6 Essentials},
year = {2006},
isbn = {0596001258},
publisher = {O’Reilly \& Associates, Inc.},
address = {USA}
}
@book{Marsic2013,
address = {New Brunswick, New Jersey},
author = {Marsic, Ivan},
booktitle = {Vasa},
doi = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.8479},
file = {:C$\backslash$:/Users/comec/Google Drive/libros/redes-de-computadoras/Computer{\_}Networks-Performance{\_}and{\_}Quality{\_}of{\_}Service.pdf:pdf},
mendeley-groups = {Tesis de maestr{\'{i}}a/Marco te{\'{o}}rico},
pages = {585},
publisher = {Rutgers University},
title = {{Computer Networks, Performance and Quality of Service}},
url = {http://eceweb1.rutgers.edu/~marsic/books/CN/},
year = {2013}
}
@book{Dordal2014,
author = {Dordal, Peter},
edition = {1.9},
file = {:C$\backslash$:/Users/comec/Google Drive/libros/redes-de-computadoras/An{\_}Introduction{\_}to{\_}Computer{\_}Networks.pdf:pdf},
mendeley-groups = {Tesis de maestr{\'{i}}a/Marco te{\'{o}}rico},
publisher = {Loyola University Chicago},
title = {{An Introduction to Computer Networks}},
year = {20014}
}
@article{CiscoIpv62011,
abstract = {Este libro contiene los comandos de configuracion y ejemplos utilizados en el IOS de Cisco},
author = {Cisco},
file = {:C$\backslash$:/Users/comec/Google Drive/libros/redes-de-computadoras/IPv6{\_}Configuration{\_}Guide{\_}Cisco{\_}IOS.pdf:pdf},
mendeley-groups = {Tesis de maestr{\'{i}}a/Direccionamiento IP},
number = {6387},
title = {{Cisco IOS IPv6 Configuration Guide}},
url = {http://www.cisco.com/en/US/docs/ios/ipv6/configuration/guide/12_4/ipv6_12_4_book.pdf},
year = {2011}
}
@techreport{RFC5498,
author = {I. Chakeres},
title = {IANA Allocations for Mobile Ad Hoc Network (MANET) Protocols},
howpublished = {Internet Requests for Comments},
type = {RFC},
number = {5498},
year = {2009},
month = {March},
issn = {2070-1721},
publisher = {RFC Editor},
institution = {RFC Editor},
}
@misc{wiki:Geohash,
author = "Wikipedia",
title = "{Geohash} --- {W}ikipedia{,} The Free Encyclopedia",
year = "2020",
howpublished = {\url{http://en.wikipedia.org/w/index.php?title=Geohash{\&}oldid=961717533}},
note = "[Online; accessed 12-June-2020]"
}
@misc{GeohashBolivia,
mendeley-groups = {Tesis de maestr{\'{i}}a/Geohash},
title = {{Geohash - GeoBolivia}},
url = {https://geo.gob.bo/portal/?Geohash},
urldate = {2020-06-12},
year = {2014}
}
@misc{Geocoding,
mendeley-groups = {Tesis de maestr{\'{i}}a/Geohash},
title = {{Geocoding | The Public Health Disparities Geocoding Project Monograph | Harvard T.H. Chan School of Public Health}},
url = {https://www.hsph.harvard.edu/thegeocodingproject/geocoding/},
urldate = {2020-06-12}
}
@article{Grajzer2019,
abstract = {The growing complexity of the Internet of Things (IoT) solutions along with highly increased application needs call for more complex and robust networking solutions. Especially the importance of autonomic, self-configuration capabilities becomes particularly significant. The IPv6-based mobile ad hoc networks are envisioned to be a good candidate technology for the IoT networks. However, they lack efficient address auto-configuration mechanisms, which could extend the IPv6 to cover the requirements of such a demanding networking environment. To address this challenge, we have proposed the Neighbor Discovery ++ (ND++) solution for the enhanced stateless address auto-configuration. The ND++ incorporates a well-performing flooding control mechanism to the basic IPv6 ND design, which results in a very low protocol overhead in the order of few messages per node. The presented simulation-based evaluation, performed under diversified mobile scenarios, confirms the scalability and robustness of this approach with regard to the key identified metrics - reliability, overhead, and latency.},
author = {Grajzer, Monika and Glabowski, Mariusz},
doi = {10.1109/ACCESS.2019.2916175},
file = {:C$\backslash$:/Users/comec/Google Drive/master/referencias/articulos/Neighbour{\_}Discovery++{\_}a{\_}Sacalable{\_}and{\_}Robust{\_}Address{\_}Auto{\_}Configuration{\_}for{\_}Future{\_}Internet{\_}of{\_}Things{\_}Networks.pdf:pdf},
issn = {21693536},
journal = {IEEE Access},
keywords = {IPv6,ND++,Neighbor Discovery,Neighbor Discovery++,address auto-configuration,flooding optimization,mobile ad hoc networks,multipoint relays,stateless address auto-configuration},
mendeley-groups = {Tesis de maestr{\'{i}}a/Direccionamiento IP},
pages = {61083--61108},
title = {{Neighbor Discovery ++- a Scalable and Robust Address Auto-Configuration for Future Internet of Things Networks}},
volume = {7},
year = {2019}
}
@article{Nesargi2002,
abstract = {A mobile ad hoc network (MANET) is a multi-hop wireless network capable of autonomous operation. The mobility of MANET nodes can lead to frequent and unpredictable topology changes. Most MANET literature assumes that network related information of a node (such as its IP address, netmask, etc.) is configured statically, prior to the node joining the MANET. However, not all nodes have IP addresses permanently assigned to them. Such nodes rely on a centralized server and use a dynamic host configuration protocol, like DHCP [1], to acquire an IP address. Such a solution cannot be employed in MANETs due to the unavailability of any centralized DHCP server. In this paper, we first present a survey of possible solutions approaches, and discuss their limitations. Then, we present a distributed dynamic host configuration protocol designed to configure nodes in a MANET. We show that the proposed protocol works correctly and does not have the limitations of earlier approaches. Finally, we evaluate the performance of the solution through simulation experiments, and conclude with a discussion of related security issues.},
author = {Nesargi, Sanket and Prakash, Ravi},
doi = {10.1109/INFCOM.2002.1019354},
file = {:C$\backslash$:/Users/comec/Google Drive/master/referencias/articulos/MANETconf{\_}Configuration{\_}of{\_}Hosts{\_}in{\_}a{\_}Mobile{\_}Ad{\_}Hoc{\_}Network.pdf:pdf},
isbn = {0780374762},
issn = {0743166X},
journal = {Proceedings - IEEE INFOCOM},
keywords = {DHCP,Dynamic host configuration,IP-networks,MANET,Network configuration,Security},
mendeley-groups = {Tesis de maestr{\'{i}}a/Direccionamiento IP},
number = {c},
pages = {1059--1068},
publisher = {IEEE},
title = {{MANETconf: Configuration of hosts in a mobile ad hoc network}},
volume = {2},
year = {2002}
}
@inproceedings{Munjal2014,
author = {Munjal, Amit and Singh, Yatindra Nath},
booktitle = {2014 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)},
doi = {10.1109/ANTS.2014.7057256},
file = {:C$\backslash$:/Users/comec/Google Drive/master/referencias/articulos/An{\_}improved{\_}autoconfiguration{\_}protocol{\_}variation{\_}by{\_}improvising{\_}MANETconf.pdf:pdf},
isbn = {978-1-4799-5868-9},
mendeley-groups = {Tesis de maestr{\'{i}}a/Direccionamiento IP},
month = {dec},
pages = {1--3},
publisher = {IEEE},
title = {{An improved autoconfiguration protocol variation by improvising MANETconf}},
url = {http://ieeexplore.ieee.org/document/7057256/},
year = {2014}
}
@phdthesis{Munjal2015,
author = {Munjal, Amit},
file = {:C$\backslash$:/Users/comec/Google Drive/master/referencias/tesis/Address{\_}Auto{\_}Configuration{\_}Protocols{\_}and{\_}their{\_}message{\_}complexity{\_}in{\_}Mobile{\_}Adhoc{\_}Networks.pdf:pdf},
mendeley-groups = {Tesis de maestr{\'{i}}a/Direccionamiento IP},
school = {Indian Institute of Technology Kanpur},
title = {{Address Auto-Configuration Protocols and their message complexity in Mobile Adhoc Networks}},
url = {http://home.iitk.ac.in/~ynsingh/phd/11104162.pdf},
year = {2015}
}
@article{Kim2007,
abstract = {Every node must configure its network interface with a unique address in order to communicate with other nodes. If a centralized DHCP server exists, it would easily and automatically provide addresses to nodes in a network. However, in a mobile ad hoc network, difficulties exist in supporting address autoconfiguration due to the lack of centralized servers. Therefore, we propose a distributed address autoconfiguration approach for a mobile ad hoc network using address reservation and optimistic duplicated address detection. The reserved address helps to reduce allocation latency, and the optimistic DAD guarantees the uniqueness of addresses with smaller communication overhead. Through our simulation study, we show that AROD guarantees the uniqueness of allocated addresses and considerably improves allocation latency and communication overheads. {\textcopyright} 2007 Elsevier B.V. All rights reserved.},
author = {Kim, Namhoon and Ahn, Soyeon and Lee, Younghee},
doi = {10.1016/j.comcom.2007.03.002},
file = {:C$\backslash$:/Users/comec/Google Drive/master/referencias/articulos/AROD{\_}An{\_}address{\_}autoconfiguration{\_}with{\_}address{\_}reservation{\_}and{\_}optimistic{\_}duplicated{\_}address{\_}detection{\_}for{\_}mobile{\_}ad{\_}hoc{\_}networks.pdf:pdf},
issn = {01403664},
journal = {Computer Communications},
keywords = {Address reservation,Autoconfiguration,Mobile ad hoc network,Optimistic DAD},
mendeley-groups = {Tesis de maestr{\'{i}}a/Direccionamiento IP},
number = {8},
pages = {1913--1925},
title = {{AROD: An address autoconfiguration with address reservation and optimistic duplicated address detection for mobile ad hoc networks}},
volume = {30},
year = {2007}
}
@article{Karp2000,
abstract = {We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Dynamic Source Routing. Our simulations demonstrate GPSR's scalability on densely deployed wireless networks.},
author = {Karp, Brad and Kung, H. T.},
file = {:C$\backslash$:/Users/comec/Google Drive/master/referencias/apoyo-protocolos-de-enrutamiento/GPSR-Greedy{\_}Perimeter{\_}Stateless{\_}Routing{\_}for{\_}Wireless{\_}Networks.pdf:pdf},
journal = {Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM},
mendeley-groups = {Tesis de maestr{\'{i}}a/Enrutamiento},
number = {MobiCom},
pages = {243--254},
title = {{GPSR: Greedy Perimeter Stateless Routing for wireless networks}},
year = {2000}
}
@article{Perkins1994,
abstract = {An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an innovative design for the operation of such ad-hoc networks. The basic idea of the design is to operate each Mobile Host as a specialized router, which periodically advertises its view of the interconnection topology with other Mobile Hosts within the network. This amounts to a new sort of routing protocol. We have investigated modifications to the basic Bellman-Ford routing mechanisms, as specified by RIP [5], to make it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad hoc networks. Our modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile Hosts. Finally, we describe the ways in which the basic network-layer routing can be modified to provide MAC-layer support for ad-hoc networks.},
author = {Perkins, Charles E. and Bhagwat, Pravin and {E. Perkins}, Charles and Bhagwat, Pravin and Perkins, Charles E. and Bhagwat, Pravin},
doi = {10.1145/190809.190336},
file = {:C$\backslash$:/Users/comec/Google Drive/master/referencias/articulos/Highly{\_}Dynamic{\_}Destination{\_}Sequenced{\_}Distance{\_}Vector{\_}Routing{\_}for{\_}Mobile{\_}Computers.pdf:pdf},
isbn = {0-89791-682-4},
issn = {01464833},
journal = {Proceedings of the ACM SIGCOMM94, London, UK},
mendeley-groups = {Tesis de maestr{\'{i}}a/Enrutamiento},
number = {4},
pages = {234--244},
title = {{Highly Dynamic (DSDV) for Mobile Computers Routing}},
url = {http://portal.acm.org/citation.cfm?doid=190809.190336},
volume = {24},
year = {1994}
}
@book{Wenden2005,
address = {Boston, MA},
author = {Wenden, Anita L},
doi = {10.1007/b99485},
editor = {Mohapatra, Prasant and Krishnamurthy, Srikanth V.},
file = {:C$\backslash$:/Users/comec/Google Drive/libros/redes-de-computadoras/redes-ad-hoc/Ad{\_}Hoc{\_}Networks-Technologies{\_}and{\_}Protocols.pdf:pdf},
isbn = {978-0-387-22689-7},
mendeley-groups = {Tesis de maestr{\'{i}}a/Marco te{\'{o}}rico,Tesis de maestr{\'{i}}a/MANET/VANET},
number = {September},
publisher = {Springer US},
title = {{Ad Hoc Networks}},
url = {http://link.springer.com/10.1007/b99485},
volume = {3},
year = {2005}
}
@article{Perkins1999,
abstract = {An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. In this paper we present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Each Mobile Host operates as a specialized router, and routes are obtained as needed (i.e., on-demand,) with little or no reliance on periodic advertisements. Our new routing algorithm is quite suitable for a dynamic self-starting network, as required by users wishing to utilize ad-hoc networks. AODV provides loop-free routes even while repairing broken links. Because the protocol does not require global periodic routing advertisements, the demand on the overall bandwidth available to the mobile nodes is substantially less than in those protocols that do necessitate such advertisements. Nevertheless we can still maintain most of the advantages of basic distance-vector routing mechanisms. We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm.},
author = {Perkins, Charles E. and Royer, Elizabeth M.},
doi = {10.1109/MCSA.1999.749281},
file = {:C$\backslash$:/Users/comec/Google Drive/master/referencias/articulos/Ad{\_}hoc{\_}On{\_}Demand{\_}Distance{\_}Vector{\_}Routing.pdf:pdf},
isbn = {0769500250},
journal = {Proceedings - WMCSA'99: 2nd IEEE Workshop on Mobile Computing Systems and Applications},
keywords = {Ad-hoc networking,Distance vector routing,Dynamic routing,Mobile networking,Wireless networks},
mendeley-groups = {Tesis de maestr{\'{i}}a/Enrutamiento},
pages = {90--100},
publisher = {IEEE},
title = {{Ad-hoc on-demand distance vector routing}},
year = {1999}
}
@incollection{Johnson1996,
doi = {10.1007/978-0-585-29603-6_5},
url = {https://doi.org/10.1007/978-0-585-29603-6_5},
publisher = {Springer {US}},
pages = {153--181},
author = {David B. Johnson and David A. Maltz},
title = {Dynamic Source Routing in Ad Hoc Wireless Networks},
booktitle = {The Kluwer International Series in Engineering and Computer Science},
year = {1996}
}
@book{DeMoraisCordeiro2006,
title={Ad Hoc \& Sensor Networks: Theory and Applications},
author={De Morais Cordeiro, C. and Agrawal, D.P.},
isbn={9789812566812},
lccn={2006284941},
url={https://books.google.com.mx/books?id=D24L4ygKFngC},
year={2006},
publisher={World Scientific Publishing Company}
}
@inproceedings{Basagni1998,
author = {Basagni, Stefano and Chlamtac, Imrich and Syrotiuk, Violet R. and Woodward, Barry A.},
title = {A Distance Routing Effect Algorithm for Mobility (DREAM)},
year = {1998},
isbn = {158113035X},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/288235.288254},
doi = {10.1145/288235.288254},
booktitle = {Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking},
pages = {76–84},
numpages = {9},
location = {Dallas, Texas, USA},
series = {MobiCom ’98}
}
@article{Mauve2001,
author={M. {Mauve} and J. {Widmer} and H. {Hartenstein}},
journal={IEEE Network},
title={A survey on position-based routing in mobile ad hoc networks},
year={2001},
volume={15},
number={6},
pages={30-39},
}
@article{Haas1999,
author={Z. J. {Haas} and B. {Liang}},
journal={IEEE/ACM Transactions on Networking},
title={Ad hoc mobility management with uniform quorum systems},
year={1999},
volume={7},
number={2},
pages={228-240},
}
@inproceedings{Li2000,
author = {Li, Jinyang and Jannotti, John and De Couto, Douglas S. J. and Karger, David R. and Morris, Robert},
title = {A Scalable Location Service for Geographic Ad Hoc Routing},
year = {2000},
isbn = {1581131976},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {http://doi.org.conricyt.remotexs.co/10.1145/345910.345931},
doi = {10.1145/345910.345931},
booktitle = {Proceedings of the 6th Annual International Conference on Mobile Computing and Networking},
pages = {120–130},
numpages = {11},
location = {Boston, Massachusetts, USA},
series = {MobiCom ’00}
}
@inproceedings{Ko1998,
author = {Ko, Young-Bae and Vaidya, Nitin H.},
title = {Location-Aided Routing (LAR) in Mobile Ad Hoc Networks},
year = {1998},
isbn = {158113035X},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/288235.288252},
doi = {10.1145/288235.288252},
booktitle = {Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking},
pages = {66–75},
numpages = {10},
location = {Dallas, Texas, USA},
series = {MobiCom ’98}
}
@article{Blaevi2002,
doi = {10.1023/a:1013998030317},
url = {https://doi.org/10.1023/a:1013998030317},
title = {Self Organized Terminode Routing},
year = {2002},
publisher = {Springer Science and Business Media {LLC}},
volume = {5},
number = {2},
pages = {205--218},
author = {Ljubica Bla{\v{z}}evi{\'{c}} and Silvia Giordano and Jean-Yves Le Boudec},
journal = {Cluster Computing}
}
@article{Yang2018,
abstract = {In a vehicular ad hoc network (VANET), vehicles always move in high-speed which may cause the network topology changes frequently. This is challenging for routing protocols of VANET. Greedy Perimeter Stateless Routing (GPSR) is a representative routing protocol of VANET. However, when constructs routing path, GPSR selects the next hop node which is very easily out of the communication range in greedy forwarding, and builds the path with redundancy in perimeter forwarding. To solve the above-mentioned problems, we proposed Maxduration-Minangle GPSR (MM-GPSR) routing protocol in this paper. In greedy forwarding of MM-GPSR, by defining cumulative communication duration to represent the stability of neighbor nodes, the neighbor node with the maximum cumulative communication duration will be selected as the next hop node. In perimeter forwarding of MM-GPSR when greedy forwarding fails, the concept of minimum angle is introduced as the criterion of the optimal next hop node. By taking the position of neighbor nodes into account and calculating angles formed between neighbors and the destination node, the neighbor node with minimum angle will be selected as the next hop node. By using NS-2 and VanetMobiSim, simulations demonstrate that compared with GPSR, MM-GPSR has obvious improvements in reducing the packet loss rate, decreasing the end-to-end delay and increasing the throughput, and is more suitable for VANET.},
author = {Yang, Xiaoping and Li, Mengjie and Qian, Zhihong and Di, Te},
doi = {10.1109/ACCESS.2018.2853112},
file = {:C$\backslash$:/Users/comec/Google Drive/master/referencias/articulos/Improvement{\_}of{\_}GPSR{\_}Protocol{\_}in{\_}Vehicular{\_}Ad{\_}Hoc{\_}Network.pdf:pdf},
issn = {21693536},
journal = {IEEE Access},
keywords = {GPSR,NS-2,Vehicular ad hoc network,greedy forwarding,perimeter forwarding,routing protocols},
mendeley-groups = {Tesis de maestr{\'{i}}a/Enrutamiento},
pages = {39515--39524},
title = {{Improvement of GPSR Protocol in Vehicular Ad Hoc Network}},
volume = {6},
year = {2018}
}
@article{Ji2019,
abstract = {Vehicular ad hoc network (VANET) is an emerging technology for the
future intelligent transportation systems (ITS). How to design an
efficient routing protocol for VANET is a challenging task due to the
high mobility and uneven distribution of vehicles in urban areas. This
paper proposes a backbone-based approach to providing the optimal
inner-street relaying strategy. The virtual backbone is created
distributively in each road segment based on the newly introduced
stability index, which considers the link stability between vehicles and
the mobility of vehicles. We also deploy the roadside unit (RSU) at
intersections to determine the next path for forwarding data. The RSU
gathers a global view of backbone vehicles on each road connected to the
junction and analyzes the performance of the backbone as a basis of
routing path selection. Simulation results show that the proposed
protocol outperforms the conventional protocols in terms of packet
delivery ratio and end-to-end delay.},
author = {Ji, Xiang and Yu, Huiqun and Fan, Guisheng and Fu, Wenhao},
doi = {10.1587/transcom.2017EBP3343},
file = {:C$\backslash$:/Users/comec/Google Drive/master/estado-del-arte/A{\_}Reliable{\_}adn{\_}Efficient{\_}Routing{\_}Protocol{\_}Based{\_}on{\_}Virtual{\_}Backbone{\_}in{\_}Vehicular{\_}Ad{\_}Hoc{\_}Networks.pdf:pdf},
issn = {17451345},
journal = {IEICE Transactions on Communications},
keywords = {Backbone,ITS,RSU,Routing,VANET},
mendeley-groups = {Tesis de maestr{\'{i}}a/Estado del arte,Tesis de maestr{\'{i}}a/Enrutamiento},
number = {2},
pages = {298--305},
title = {{A reliable and efficient routing protocol based on virtual backbone in vehicular ad hoc networks}},
year = {2019}
}
@article{Zhang2016,
abstract = {In a vehicular ad hoc network (VANET), high mobility and uneven distribution of vehicles are important factors affecting the performance of routing protocols. The high mobility may cause frequent changes of network topology, whereas the uneven distribution of vehicles may lead to routing failures due to network partition; even high density of vehicles may cause severe wireless channel contentions in an urban environment. In this paper, we propose a novel concept called the microtopology (MT), which consists of vehicles and wireless links among vehicles along a street as a basic component of routing paths and even the entire network topology. We abstract the MT model reflecting the dynamic routing-related characteristics in practical urban scenarios along streets, including the effect of mobility of vehicles, signal fading, wireless channel contention, and existing data traffic. We first analyze the endside-to-endside routing performance in an MT as a basis of routing decision. Then, we propose a novel street-centric routing protocol based on MT (SRPMT) along the streets for VANETs. Simulation results show that our proposed SRPMT protocol achieves higher data delivery rate and shorter average end-to-end delay compared with the performance of greedy perimeter stateless routing (GPSR) and greedy traffic-aware routing (GyTAR).},
author = {Zhang, Xin Ming and Chen, Kai Heng and Cao, Xu Lei and Sung, Dan Keun},
doi = {10.1109/TVT.2015.2456952},
file = {:C$\backslash$:/Users/comec/Google Drive/master/estado-del-arte/A{\_}Street-Centric{\_}Routing{\_}Potocol{\_}Based{\_}on{\_}Microtopology{\_}in{\_}Vehicular{\_}Ad{\_}Hoc{\_}Networks.pdf:pdf},
issn = {00189545},
journal = {IEEE Transactions on Vehicular Technology},
keywords = {Microtopology (MT),routing,street centric,vehicular ad hoc network (VANET)},
mendeley-groups = {Tesis de maestr{\'{i}}a/Enrutamiento},
number = {7},
pages = {5680--5694},
publisher = {IEEE},
title = {{A Street-Centric Routing Protocol Based on Microtopology in Vehicular Ad Hoc Networks}},
volume = {65},
year = {2016}
}
@article{Lochert2003,
abstract = {Routing of data in a vehicular ad hoc network is a challenging task due to the high dynamics of such a network. Recently, it was shown for the case of highway traffic that position-based routing approaches can very well deal with the high mobility of network nodes. However, baseline position-based routing has difficulties to handle two-dimensional scenarios with obstacles (buildings) and voids as it is the case for city scenarios. In this paper we analyze a position-based routing approach that makes use of the navigational systems of vehicles. By means of simulation we compare this approach with non-position-based ad hoc routing strategies (dynamic source routing and ad-hoc on-demand distance vector routing). The simulation makes use of highly realistic vehicle movement patterns derived from Daimler-Chrysler's Videlio traffic simulator. While DSR's performance is limited due to problems with scalability and handling mobility, both AODV and the position-based approach show good performances with the position-based approach outperforming AODV.},
author = {Lochert, Christian and Hartenstein, Hannes and Tian, Jing and F{\"{u}}bler, Holger and Hermann, Dagmar and Mauve, Martin},
doi = {10.1109/IVS.2003.1212901},
file = {:C$\backslash$:/Users/comec/Google Drive/master/referencias/articulos/A{\_}Routing{\_}Strategy{\_}for{\_}Vehicular{\_}Ad{\_}Hoc{\_}Networks{\_}in{\_}City{\_}Environments.pdf:pdf},
isbn = {0780378482},
journal = {IEEE Intelligent Vehicles Symposium, Proceedings},
mendeley-groups = {Tesis de maestr{\'{i}}a/Enrutamiento},
number = {01},
pages = {156--161},
title = {{A routing strategy for vehicular ad hoc networks in city environments}},
volume = {2000},
year = {2003}
}
@article{Vincenty1975,
doi = {10.1179/sre.1975.23.176.88},
url = {https://doi.org/10.1179/sre.1975.23.176.88},
year = {1975},
month = apr,
publisher = {Informa {UK} Limited},
volume = {23},
number = {176},
pages = {88--93},
author = {T. Vincenty},
title = {{DIRECT} {AND} {INVERSE} {SOLUTIONS} {OF} {GEODESICS} {ON} {THE} {ELLIPSOID} {WITH} {APPLICATION} {OF} {NESTED} {EQUATIONS}},
journal = {Survey Review}
}
@techreport{RFC2460,
author = {Stephen E. Deering and Robert M. Hinden},
title = {Internet Protocol, Version 6 (IPv6) Specification},
howpublished = {Internet Requests for Comments},
type = {RFC},
number = {2460},
year = {1998},
month = {December},
issn = {2070-1721},
publisher = {RFC Editor},
institution = {RFC Editor},
url = {http://www.rfc-editor.org/rfc/rfc2460.txt},
note = {\url{http://www.rfc-editor.org/rfc/rfc2460.txt}},
}
@book{cormen2001,
title={Introduction To Algorithms},
author={Cormen, T.H. and Cormen, T.H. and Leiserson, C.E. and Books24x7, Inc and MIT Press and Massachusetts Institute of Technology and Rivest, R.L. and McGraw-Hill Publishing Company and Stein, C.},
isbn={9780262032933},
lccn={00103127},
series={Introduction to Algorithms},
url={https://books.google.com.mx/books?id=NLngYyWFl\_YC},
year={2001},
publisher={MIT Press}
}
@article{Nishat2011,
author = {Nishat, Humaira and Pothalaiah, Sake and Rao, D},
year = {2011},
month = {04},
pages = {},
title = {Performance Evaluation of Routing Protocols in MANETs},
volume = {3},
journal = {International Journal of Wireless \& Mobile Networks},
doi = {10.5121/ijwmn.2011.3206}
}
@misc{SUMO,
description = {Open source, microscopic and continuous multi-modal traffic simulation package},
keywords = {SUMO, Eclipse SUMO, Traffic Simulation, Mobility},
title = {Eclipse SUMO - Simulation of Urban MObility},
howpublished = {\url{https://www.eclipse.org/sumo/}},
note = {Accessed: 2021-02-01 12:48:39}
}
@misc{OMNeT,
description = {OMNeT++ public website},
title = {OMNeT++ Discrete Event Simulator},
howpublished = {\url{https://omnetpp.org/}},
note = {Accessed: 2021-02-03 09:52:12}
}
@misc{INET,
title = {INET Framework - INET Framework},
howpublished = {\url{https://inet.omnetpp.org/}},
note = {Accessed: 2021-02-03 09:53:21}
}
@misc{Veins,
title = {Veins},
howpublished = {\url{https://veins.car2x.org/}},
note = {Accessed: 2021-02-03 09:54:32}
}
@misc{JOSM,
title = {JOSM},
howpublished = {\url{https://josm.openstreetmap.de/}},
note = {Accessed: 2021-02-03 09:55:42}
}
@misc{QGIS,
title = {Welcome to the QGIS project!},
howpublished = {\url{https://www.qgis.org/en/site/}},
note = {Accessed: 2021-02-03 09:59:23}
}
@misc{CompilacionSUMO,
title = {Installing - SUMO Documentation},
howpublished = {\url{https://sumo.dlr.de/docs/Installing.html}},
note = {Accessed: 2021-02-03 09:49:48}
}
@misc{CompilacionOMNeT,
description = {OMNeT++ public website},
title = {OMNeT++ Documentation},
howpublished = {\url{https://omnetpp.org/documentation/}},
note = {Accessed: 2021-02-04 03:54:30}
}
@misc{Cookiecutter,
title = {Cookiecutter: Better Project Templates — cookiecutter 1.7.2 documentation},
howpublished = {\url{https://cookiecutter.readthedocs.io/en/1.7.2/}},
note = {Accessed: 2021-02-04 04:06:18}
}
@misc{TutorialVeins,
title = {Tutorial - Veins},
howpublished = {\url{https://veins.car2x.org/tutorial/}},
note = {Accessed: 2021-02-04 04:16:25}
}
@misc{InstalacionQGIS,
title = {QGIS Installers},
howpublished = {\url{https://www.qgis.org/en/site/forusers/alldownloads.html}},
note = {Accessed: 2021-02-04 04:19:40}
}
@misc{DescargaJOSM,
title = {Download – JOSM},
howpublished = {\url{https://josm.openstreetmap.de/wiki/Download}},
note = {Accessed: 2021-02-04 08:43:56}
}
@misc{OpenStreetMap,
description = {OpenStreetMap is the free wiki world map.},
title = {OpenStreetMap},
howpublished = {\url{https://www.openstreetmap.org/}},
note = {Accessed: 2021-02-05 08:53:22}
}
@misc{Boost,
title = {The Boost Graph Library - 1.75.0},
howpublished = {\url{https://www.boost.org/doc/libs/1_75_0/libs/graph/doc/index.html}},
note = {Accessed: 2021-02-06 09:53:27}
}
@misc{SUMOTrafico,
title = {Introduction to demand modelling in SUMO - SUMO Documentation},
howpublished = {\url{https://sumo.dlr.de/docs/Demand/Introduction_to_demand_modelling_in_SUMO.html}},
note = {Accessed: 2021-02-01 12:55:27}
}
@article{Nishat2011,
title = {Performance {Evaluation} of {Routing} {Protocols} in {MANETs}},
volume = {3},
doi = {10.5121/ijwmn.2011.3206},
abstract = {In wireless ad hoc networks mobile stations or nodes are free to move around. The transmission range of the nodes is fixed in mobile ad hoc networks (MANETs) whereas the network topology changes in a different fashion. Due to dynamic nature of network topology some of the network links are destroyed while some new links are established. The routing protocols developed for wired networks cannot be used efficiently for wireless networks. For wireless ad hoc networks there are a few new routing protocols suitable for the dynamically changing ad hoc wireless environment. In this paper we compare the performance of two on-demand routing protocols (AODV and DSR) in terms of QoS parameters such as throughput, minimum, maximum \& average delay and packet delivery ratio. We performed extensive simulations using NS-2 simulator using both conventional TCP and TCP Vegas traffic sources. Keywords AODV, DSR, MANET routing protocols, TCP \& TCP Vegas.},
journal = {International Journal of Wireless \& Mobile Networks},
author = {Nishat, Humaira and Pothalaiah, Sake and Rao, D},
month = apr,
year = {2011},
file = {Full Text PDF:/home/adrian/Zotero/storage/W47CGFCG/Nishat et al. - 2011 - Performance Evaluation of Routing Protocols in MAN.pdf:application/pdf},
}
@article{Oubbati2019,
title = {On-{Demand} {Routing} for {Urban} {VANETs} using {Cooperating} {UAVs}},
url = {http://arxiv.org/abs/1908.05905},
doi = {10.1109/SaCoNeT.2018.8585453},
abstract = {Vehicular ad hoc networks (VANETs) are characterized by frequent routing path failures due to the high mobility caused by the sudden changes of the direction of vehicles. The routing paths between two different vehicles should be established with this challenge in mind. Stability and connectedness are a mandatory condition to ensure a robust and reliable data delivery. The idea behind this work is to exploit a new reactive routing technique to provide regulated and well-connected routing paths. Unmanned Aerial Vehicles (UAVs) or what are referred to as drones can be both involved in the discovery process and be full members in these discovered paths in order to avoid possible disconnections on the ground when the network is sparsely connected. The different tests of this technique are performed based on NS-2 simulator and the outcomes are compared with those of related on-demand routing protocols dedicated for VANETs. Interesting results are distinguished showing a reduced end-to-end delay and a high delivery ratio, which proving that this heterogeneous communication between vehicles and UAVs is able to extend the network connectivity.},
language = {en},
urldate = {2021-04-15},
journal = {arXiv:1908.05905 [cs, math]},
author = {Oubbati, Omar Sami and Chaib, Noureddine and Lakas, Abderrahmane and Bitam, Salim},
month = aug,
year = {2019},
note = {arXiv: 1908.05905},
keywords = {Computer Science - Information Theory, Computer Science - Networking and Internet Architecture, Computer Science - Social and Information Networks, evaluacion},
file = {Oubbati et al. - 2019 - On-Demand Routing for Urban VANETs using Cooperati.pdf:/home/adrian/Zotero/storage/GZC622X6/Oubbati et al. - 2019 - On-Demand Routing for Urban VANETs using Cooperati.pdf:application/pdf},
}