The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Routing in Sparse Vehicular Ad Hoc Wireless Networks
Abstract
A vehicular ad hoc network (VANET) may exhibit a bipolar behavior, i.e., the network can either be fully connected or sparsely connected depending on the time of day or on the market penetration rate of the wireless communication devices. In this paper, we use empirical vehicle traffic data measured on 1-80 freeway in California to develop a comprehensive analytical framework to study the disconnected network phenomenon and its network characteristics. These characteristics shed light on the key routing performance metrics of interest in disconnected VANETs, such as the average time taken to propagate a packet to disconnected nodes (i.e., the re-healing time). Our results show that, depending on the sparsity of vehicles or the market penetration rate of cars using Dedicated Short Range Communication (DSRC) technology, the network re-healing time can vary from a few seconds to several minutes. This suggests that, for vehicular safety applications, a new ad hoc routing protocol will be needed as the conventional ad hoc routing protocols such as Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector Routing (AODV) will not work with such long re-healing times. In addition, the developed analytical framework and its predictions provide valuable insights into the VANET routing performance in the disconnected network regime.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ad hoc On-Demand Distance Vector (AODV) Routing
Perkins, C., Belding-Royer, E., & Das, S. (2003) · doi:10.17487/rfc3561 · Cited by 10,686
Dynamic Source Routing in Ad Hoc Wireless Networks
Johnson, D. B., & Maltz, D. A. (2007) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-0-585-29603-6_5 · Cited by 8,518
Epidemic routing for partially-connected ad hoc networks
Vahdat, A. M. (2000) · Cited by 4,133
The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR)
Johnson, D. B. (2004) · Medical Entomology and Zoology · Cited by 3,290
A delay-tolerant network architecture for challenged internets
Fall, K. (2003) · Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/863955.863960 · Cited by 3,082
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005) · doi:10.1145/1080139.1080143 · Cited by 2,649
Routing in a delay tolerant network
Jain, S., Fall, K., & Patra, R. K. (2004) · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) · doi:10.1145/1015467.1015484 · Cited by 1,779
Delay-tolerant networking: an approach to interplanetary Internet
Burleigh, S., Hooke, A., Torgerson, L., Fall, K., Cerf, V., Durst, B., Scott, K., & Weiss, H. (2003) · IEEE Communications Magazine · doi:10.1109/mcom.2003.1204759 · Cited by 1,416
Bai, F., Sadagopan, N., & Helmy, A. (2003) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1208920 · Cited by 997
Self-citationUrban multi-hop broadcast protocol for inter-vehicle communication systems
Korkmaz, G., Ekici, E., Özgüner, F., & Özgüner, Ü. (2004) · Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks · doi:10.1145/1023875.1023887 · Cited by 672
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks
Zhao, J., & Cao, G. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.298 · Cited by 486
Two lane traffic simulations using cellular automata
Rickert, M., Nagel, K., Schreckenberg, M., & Latour, A. (1996) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/0378-4371(95)00442-4 · Cited by 474
Broadcast reception rates and effects of priority access in 802.11-based vehicular ad-hoc networks
Torrent-Moreno, M., Jiang, D., & Hartenstein, H. (2004) · Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks · doi:10.1145/1023875.1023878 · Cited by 384
Role-based multicast in highly mobile but sparsely connected ad hoc networks
Briesemeister, L., & Hommel, G. (2002) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1109/mobhoc.2000.869212 · Cited by 219
Cited by
Bidirectionally Coupled Network and Road Traffic Simulation for Improved IVC Analysis
Sommer, C., German, R., & Dressler, F. (2011) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2010.133 · Cited by 1,553
Ucar, S., Ergen, S. C., & Ozkasap, O. (2016) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2015.2421277 · Cited by 429
Task Offloading in Vehicular Edge Computing Networks: A Load-Balancing Solution
Zhang, J., Guo, H., Liu, J., & Zhang, Y. (2020) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2019.2959410 · Cited by 421
Impact of Vehicles as Obstacles in Vehicular Ad Hoc Networks
Boban, M., Vinhoza, T. T. V., Ferreira, M., Barros, J., & Tonguz, O. K. (2011) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2011.110103 · Cited by 351
Self-citationD2D for Intelligent Transportation Systems: A Feasibility Study
Cheng, X., Yang, L., & Shen, X. (2015) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2014.2377074 · Cited by 345
Metadata
- Authors
- Wisitpongphan, N., Bai, F., Mudalige, P., Sadekar, V., & Tonguz, O.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2007-10
- Volume
- 25
- Issue
- 8
- Pages
- 1538-1556
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2132987094
- Cited by
- 524
- References
- 14
- FWCI
- 27.41
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.