Abstract
In the area of development of AI/ML applications in Vehicular Adhoc Networks (VANET), a highly dynamic environment, efficient algebraic distributed computations are of utmost importance. On the other hand, there is a growing concern about privacy of users/drivers. One of the solutions is to perform computations assuming anonymity of the users. There is already a large amount of work on this topic in the general Anonymous Dynamic Network model, however the obtained theoretical guarantees are not suitable for very large-scale networks, such as VANET. In this work, we propose an anonymous algebraic computation framework tailored for VANET, called Anonymous Vehicular Adhoc Networks (A-VANET). We introduce heuristic changes to the Restricted Methodical Counting (RMC) protocol aiming to speed up performance in A-VANET with respect to the theoretical bounds in general Anonymous Dynamic Networks. We evaluate this protocol on traces of taxi trips in New York City extracted from publicly available data from 2013, and on a highway traffic environment modeled by a set of path graphs. Both inputs are highly dynamic including also recurrent disconnections.
Our results show that, for the parameter combinations tested and for networks with good expansion, RMC is sub-quadratic and even linear under some conditions. Therefore, even the theoretical upper bound proved as a function of connectivity parameters is loose by a factor of more than \(n^7\). These results show the promise of further exploring the question of what is the optimal running time for algebraic computations in A-VANET and other practically-motivated Anonymous Dynamic Networks with limited messages, memory and disconnections.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
By “simple” we mean that the algorithm does not require complex data structures or complex calculations over them. In a nutshell, RMC is a simple arithmetic calculation to update a value (the potential) repeated iteratively, followed by conditionals to decide when that value has reached some range. This type of algorithm is sometimes called a “light implementation”.
- 2.
In case of VANET, these could be even static access points located in selected places, or company cars.
- 3.
Mobility and anonymity prevent the nodes from sending destination-oriented messages.
- 4.
In practice, more memory and more communication may become available as nodes require them, but keeping them below the limit n in all rounds is the job of the algorithm.
References
Almeida, P.S., Baquero, C., Farach-Colton, M., Jesus, P., Mosteiro, M.A.: Fault-tolerant aggregation: flow-updating meets mass-distribution. Distrib. Comput. 30(4), 281–291 (2017). https://doi.org/10.1007/S00446-016-0288-5
Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE/ACM Trans. Networking 14(SI), 2508–2530 (2006)
Cooper, C., Franklin, D., Ros, M., Safaei, F., Abolhasan, M.: A comparative survey of VANet clustering techniques. IEEE Commun. Surv. Tutorials 19(1), 657–681 (2016)
Di Luna, G.A., Baldoni, R.: Investigating the cost of anonymity on dynamic networks. CoRR arXiv:1505.03509 (2015)
Eclipse Foundation: Simulation of urban mobility (2024). https://eclipse.dev/sumo/
Fernández Anta, A., Mosteiro, M.A., Thraves, C.: An early-stopping protocol for computing aggregate functions in sensor networks. J. Parallel Distrib. Comput. 73(2), 111–121 (2013)
Fiore, M., Härri, J.: The networking shape of vehicular mobility. In: Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 261–272 (2008)
Ghosh, B., Muthukrishnan, S.: Dynamic load balancing by random matchings. J. Comput. Syst. Sci. 53(3), 357–370 (1996)
Gozalvez, J., Sepulcre, M., Bauza, R.: Impact of the radio channel modelling on the performance of VANet communication protocols. Telecommun. Syst. 50(3), 149–167 (2012)
Hasrouny, H., Samhat, A.E., Bassil, C., Laouiti, A.: VANet security challenges and solutions: a survey. Veh. Commun. 7, 7–20 (2017)
Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 482–491 (2003)
Kowalski, D.R., Mosteiro, M.A.: Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations. J. ACM 67(2), 1–7 (2020)
Kowalski, D.R., Mosteiro, M.A.: Efficient distributed computations in anonymous dynamic congested systems with opportunistic connectivity. CoRR arXiv:2202.07167 (2022)
Kowalski, D.R., Mosteiro, M.A.: Polynomial anonymous dynamic distributed computing without a unique leader. J. Comput. Syst. Sci. 123, 37–63 (2022). https://doi.org/10.1016/J.JCSS.2021.07.002
Kowalski, D.R., Nussbaum, E., Segal, M., Milyeykovski, V.: Scheduling problems in transportation networks of line topology. Optim. Lett. 8(2), 777–799 (2014). https://doi.org/10.1007/s11590-013-0613-x
Kowalski, D., Nutov, Z., Segal, M.: Scheduling of vehicles in transportation networks. In: Vinel, A., Mehmood, R., Berbineau, M., Garcia, C.R., Huang, C.-M., Chilamkurti, N. (eds.) Nets4Cars/Nets4Trains 2012. LNCS, vol. 7266, pp. 124–136. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29667-3_11
Meireles, R., Ferreira, M., Barros, J.: Vehicular connectivity models: from single-hop links to large-scale behavior. In: 2009 IEEE 70th Vehicular Technology Conference Fall, pp. 1–5. IEEE (2009)
Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Naming and counting in anonymous unknown dynamic networks. In: Higashino, T., Katayama, Y., Masuzawa, T., Potop-Butucaru, M., Yamashita, M. (eds.) SSS 2013. LNCS, vol. 8255, pp. 281–295. Springer, Cham (2013). https://doi.org/10.1007/978-3-319-03089-0_20
NYC Taxi & Limousine Commission: TLC trip record data (2024). https://www.nyc.gov/site/tlc/about/tlc-trip-record-data.page
Pallis, G., Katsaros, D., Dikaiakos, M.D., Loulloudes, N., Tassiulas, L.: On the structure and evolution of vehicular networks. In: 2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems, pp. 1–10. IEEE (2009)
Protzmann, R., Schu, B., Radusch, I.: The influences of communication models on the simulated effectiveness of v2x applications. In: 2010 IEEE Vehicular Networking Conference, pp. 102–109. IEEE (2010)
Rabani, Y., Sinclair, A., Wanka, R.: Local divergence of markov chains and the analysis of iterative load-balancing schemes. In: Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science, pp. 694–703 (1998)
Viriyasitavat, W., Bai, F., Tonguz, O.K.: Dynamics of network connectivity in urban vehicular networks. IEEE J. Sel. Areas Commun. 29(3), 515–533 (2011)
Acknowledgments
This study was partially funded by Pace Univ. SRC and Kenan Awards.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Ethics declarations
Disclosure of Interests
The authors have no competing interests to declare that are relevant to the content of this article.
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Kowalski, D.R., Mosteiro, M.A., Powlette, A. (2024). Algebraic Computations in Anonymous VANET. In: Castañeda, A., Enea, C., Gupta, N. (eds) Networked Systems. NETYS 2024. Lecture Notes in Computer Science, vol 14783. Springer, Cham. https://doi.org/10.1007/978-3-031-67321-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-031-67321-4_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-67320-7
Online ISBN: 978-3-031-67321-4
eBook Packages: Computer ScienceComputer Science (R0)