Skip to main content

Centrality Maps for Moving Nodes

  • Conference paper
  • First Online:
Book cover Complex Networks and Their Applications VII (COMPLEX NETWORKS 2018)

Part of the book series: Studies in Computational Intelligence ((SCI,volume 812))

Included in the following conference series:

  • 3109 Accesses

Abstract

In dynamic networks, topology changes require frequent updates of centrality measures. Such perpetual calculations range from computationally hungry to unfeasible before the next topological change happens. On top of this, the centrality may seem unstable or even random from the nodal perspective, making them difficult to predict. In this paper, we propose to shift the focus of centrality estimation from the conventional topological perspective to a geographical perspective. We advocate that some centrality metrics are, depending on the situation, inherently related to the geographic locations of the nodes. Our strategy associates a measure of centrality to coordinates and, consequently, to the nodes that occupy those positions. In a vehicular scenario, the one we consider in this paper, geographical centrality is much more stable than node centrality. Hence, nodes do not have to compute their centralities continuously – it is enough to refer to their geographic coordinates and find the centrality by merely consulting a pre-established table. We evaluate our strategy over two large-scale vehicular datasets and show that, whenever we match a centrality to an area, we correctly estimate the centralities up to 80% of the highest-valued nodes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bader, D.A., Kintali, S., Madduri, K., Mihail, M.: Approximating Betweenness Centrality. In: Algorithms and Models for the Web-Graph, pp. 124–137. Springer, Heidelberg. https://doi.org/10.1007/978-3-540-77004-6_10. http://link.springer.com/10.1007/978-3-540-77004-6_10

  2. Codeca, L., Frank, R., Engel, T.: Luxembourg SUMO Traffic (LuST) Scenario: 24 hours of mobility for vehicular networking research. In: 2015 IEEE Vehicular Networking Conference (VNC), vol. 2016-Janua, pp. 1–8. IEEE (2015). https://doi.org/10.1109/VNC.2015.7385539. http://ieeexplore.ieee.org/document/7385539/

  3. Crucitti, P., Latora, V., Porta, S.: Centrality measures in spatial networks of urban streets. Phys. Rev. E-Stat., Nonlinear, Soft Matter Phys. 73(3), 1–5 (2006). https://doi.org/10.1103/PhysRevE.73.036125

    Google Scholar 

  4. Daly, E.M., Haahr, M.: Social network analysis for routing in disconnected delay-tolerant MANETs. In: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing - MobiHoc 2007, p. 32. ACM Press, New York (2007). https://doi.org/10.1145/1288107.1288113. http://dl.acm.org/citation.cfm?id=1288107.1288113

  5. Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35 (1977). https://doi.org/10.2307/3033543. http://www.jstor.org/stable/3033543?origin=crossref

  6. Kim, H., Anderson, R.: Temporal node centrality in complex networks. Phys. Rev. E 85(2), 026,107 (2012). https://doi.org/10.1103/PhysRevE.85.026107

    Google Scholar 

  7. Riondato, M., Kornaropoulos, E.M.: Fast approximation of betweenness centrality through sampling. Data Min. Knowl. Discov. 30(2), 438–475 (2016). https://doi.org/10.1007/s10618-015-0423-0. https://pdfs.semanticscholar.org/213c/7f8e9a8a046020ebfa2a7aaa194b3c05a87a.pdf. http://link.springer.com/10.1007/s10618-015-0423-0

  8. Strano, E., et al.: Street Centrality Versus Commerce and Service Locations in Cities: a Kernel Density Correlation Case Study in Bologna, Italy pp. 1–14 (2007). http://arxiv.org/abs/physics/0701111

  9. Uppoor, S., Trullols-Cruces, O., Fiore, M., Barcelo-Ordinas, J.M.: Generation and analysis of a large-scale urban vehicular mobility dataset. IEEE Trans. Mob. Comput. 13(5), 1061–1075 (2014). https://doi.org/10.1109/TMC.2013.27.http://ieeexplore.ieee.org/document/6468040/

  10. Wang, W., Xie, F., Chatterjee, M.: Small-scale and large-scale routing in vehicular ad hoc networks. IEEE Trans. Veh. Technol. 58(9), 5200–5213 (2009). https://doi.org/10.1109/TVT.2009.2025652

  11. Wu, H., Fujimoto, R., Guensler, R., Hunter, M.: MDDV. In: Proceedings of the First ACM Workshop on Vehicular Ad Hoc Networks - VANET 2004, p. 47. ACM Press, New York (2004). https://doi.org/10.1145/1023875.1023884. http://dl.acm.org/citation.cfm?id=1023875.1023884. http://portal.acm.org/citation.cfm?doid=1023875.1023884

  12. Ding, Y., Xiao, L.: SADV: Static-Node-Assisted Adaptive Data Dissemination in Vehicular Networks. IEEE Trans. Veh. Technol. 59(5), 2445–2455 (2010). https://doi.org/10.1109/TVT.2010.2045234. http://ieeexplore.ieee.org/document/5431020/

  13. Zhao, J., Zhang, Y., Cao, G.: Data pouring and buffering on the road: A new data dissemination paradigm for vehicular ad hoc networks. IEEE Trans. Veh. Technol. 56(6 I), 3266–3277 (2007). https://doi.org/10.1109/TVT.2007.906412. http://ieeexplore.ieee.org/document/4358489/

  14. Zhao, W., Chen, Y., Ammar, M., Corner, M., Levine, B., Zegura, E.: Capacity enhancement using throwboxes in DTNs. In: 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems, pp. 31–40. IEEE (2006). https://doi.org/10.1109/MOBHOC.2006.278570. http://ieeexplore.ieee.org/document/4053916/

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Clément Bertier .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bertier, C., Benbadis, F., Dias de Amorim, M., Conan, V. (2019). Centrality Maps for Moving Nodes. In: Aiello, L., Cherifi, C., Cherifi, H., Lambiotte, R., Lió, P., Rocha, L. (eds) Complex Networks and Their Applications VII. COMPLEX NETWORKS 2018. Studies in Computational Intelligence, vol 812. Springer, Cham. https://doi.org/10.1007/978-3-030-05411-3_10

Download citation

Publish with us

Policies and ethics