The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Bus-Trajectory-Based Street-Centric Routing for Message Delivery in Urban Vehicular Ad Hoc Networks
Open accessAbstract
This paper focuses on the routing algorithm for the communications between vehicles and places in urban vehicular ad hoc networks. As one of the basic transportation facilities in an urban setting, buses periodically run along their fixed routes and cover many city streets. The trajectory of bus lines can be seen as a submap of a city. Based on the characters of bus networks, we propose a bus-trajectory-based street-centric (BTSC) routing algorithm, which uses buses as the main relay to deliver messages. In BTSC, we build a routing graph based on the trajectories of bus lines by analyzing the probability of bus appearing on every street. We propose two novel concepts, i.e., the probability of street consistency and the probability of path consistency, which are used as metrics to determine routing paths for message delivery. This aims to choose the best path with higher density of busses and lower probability of transmission direction deviating from the routing path. In order to improve the bus forwarding opportunity, we design a bus-based forwarding strategy with ant colony optimization to find a reliable and a steady multihop link between two relay buses in order to decrease the end-to-end delay. The BTSC makes improvements in the selection of routing paths and a strategy of message forwarding. Simulation results show that our proposed routing algorithm has a better performance in terms of the transmission ratio, transmission delay, and adaptability to different networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Significant Permission Identification for Machine-Learning-Based Android Malware Detection
Li, J., Sun, L., Yan, Q., Li, Z., Srisa-an, W., & Ye, H. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2017.2789219 · Cited by 607
VANET Routing on City Roads Using Real-Time Vehicular Traffic Information
Nzouonta, J., Rajgure, N., Wang, G., & Borcea, C. (2009) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2009.2014455 · Cited by 470
Du, X., Guizani, M., Xiao, Y., & Chen, H.-H. (2009) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2009.060598 · Cited by 380
Self-citationZhang, Y., Chen, X., Li, J., Wong, D. S., Li, H., & You, I. (2017) · Information Sciences · doi:10.1016/j.ins.2016.04.015 · Cited by 263
Self-citationVerifiable Computation over Large Database with Incremental Updates
Chen, X., Li, J., Weng, J., Ma, J., & Lou, W. (2016) · IEEE Transactions on Computers · doi:10.1109/tc.2015.2512870 · Cited by 257
New Algorithms for Secure Outsourcing of Large-Scale Systems of Linear Equations
Chen, X., Huang, X., Li, J., Ma, J., Lou, W., & Wong, D. S. (2015) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2014.2363765 · Cited by 219
MoZo: A Moving Zone Based Routing Protocol Using Pure V2V Communication in VANETs
Lin, D., Kang, J., Squicciarini, A., Wu, Y., Gurung, S., & Tonguz, O. (2017) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2016.2592915 · Cited by 215
Differentially private Naive Bayes learning over multiple data sources
Li, T., Li, J., Liu, Z., Li, P., & Jia, C. (2018) · Information Sciences · doi:10.1016/j.ins.2018.02.056 · Cited by 190
Privacy-preserving Naive Bayes classifiers secure against the substitution-then-comparison attack
Gao, C.-Z., Cheng, Q., He, P., Susilo, W., & Li, J. (2018) · Information Sciences · doi:10.1016/j.ins.2018.02.058 · Cited by 185
Adaptive Quality-of-Service-Based Routing for Vehicular Ad Hoc Networks With Ant Colony Optimization
Li, G., Boukhatem, L., & Wu, J. (2017) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2016.2586382 · Cited by 172
Cited by
Security and privacy preservation in fog-based crowd sensing on the internet of vehicles
Sun, G., Sun, S., Sun, J., Yu, H., Du, X., & Guizani, M. (2019) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2019.02.018 · Cited by 79
Self-citationVehicle recognition pipeline via DeepSort on aerial image datasets
Hanzla, M., Yusuf, M. O., Al Mudawi, N., Sadiq, T., Almujally, N. A., Rahman, H., Alazeb, A., & Algarni, A. (2024) · Frontiers in Neurorobotics · doi:10.3389/fnbot.2024.1430155 · Cited by 18
Metadata
- Authors
- Sun, G., Zhang, Y., Liao, D., Yu, H., Du, X., & Guizani, M.
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 2018-08
- Volume
- 67
- Issue
- 8
- Pages
- 7550-7563
- ISSN
- 0018-9545 (ISSN-L)
- 1939-9359
- OpenAlex
- W2963943323
- Cited by
- 270
- References
- 28
- FWCI
- 4.61
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Bus-Trajectory-Based Street-Centric Routing for Message Delivery in Urban Vehicular Ad Hoc Networks. https://app.cochat.ai/papers/10.1109/tvt.2018.2828651
- The paper
- Sun, G., Zhang, Y., Liao, D., Yu, H., Du, X., & Guizani, M. (2018). Bus-Trajectory-Based Street-Centric Routing for Message Delivery in Urban Vehicular Ad Hoc Networks. IEEE Transactions on Vehicular Technology. https://doi.org/10.1109/tvt.2018.2828651
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.