Simulation of Vehicular Ad-hoc Network Routing Protocols with a Performance Analysis

Vehicular Ad-hoc Network (VANET), a subset of Mobile Ad-hoc networks (MANETs), is one of the emerging technologies of Road Transportation system. In recent years, the aspect of Vehicular Ad-hoc Network (VANET) is becoming an interesting research area as it is characterized as self-configured wireless network. The design of routing protocols in VANETs is play a vital role and necessary issue for the Vehicle to Vehicle Communication Technology. The existing routing protocols of MANETs are suitable for VANET with changes in configuration of protocol. The routing protocols fall into two major categories of topology-based and position-based routing. We discussed different kinds of existing routing protocols with two major categories, the advantages and limitations of each which will helps to enhance the existing routing protocols for the suitability of Vehicular Ad-hoc Networks. We implemented three existing routing protocols and the testing results stated that the performance of each in aspects of various parameters such as Packet Delivery Ratio, Throughput and End-End Delay using Network Simulator

Evaluation of efficient vehicular ad hoc networks based on a maximum distance routing algorithm

Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-hop basis based on the maximum distance toward the destination from the sender and sufficient communication lifetime, which guarantee the completion of the data transmission process. Moreover, communication overhead is minimized by finding the next hop and forwarding the packet directly to it without the need to discover the whole route first. A comparison is performed between MDORA and ad hoc on-demand distance vector (AODV) protocol in terms of throughput, packet delivery ratio, delay, and communication overhead. The outcome of the proposed algorithm is better than that of AODV

GSAR: Greedy Stand-Alone Position-Based Routing protocol to avoid hole problem occurance in Mobile Ad Hoc Networks

The routing process in a Mobile Ad Hoc Network (MANET) poses critical challenges because of its features such as frequent topology changes and resource limitations. Hence, designing a reliable and dynamic routing protocol that satisfies MANET requirements is highly demanded. The Greedy Forwarding Strategy (GFS) has been the most used strategy in position-based routing protocols. The GFS algorithm was designed as a high-performance protocol that adopts hop count in soliciting shortest path. However, the GFS does not consider MANET needs and is therefore insufficient in computing reliable routes. Hence, this study aims to improve the existing GFS by transforming it into a dynamic stand-alone routing protocol that responds swiftly to MANET needs, and provides reliable routes among the communicating nodes. To achieve the aim, two mechanisms were proposed as extensions to the current GFS, namely the Dynamic Beaconing Updates Mechanism (DBUM) and the Dynamic and Reactive Reliability Estimation with Selective Metrics Mechanism (DRESM). The DBUM algorithm is mainly responsible for providing a node with up-to-date status information about its neighbours. The DRESM algorithm is responsible for making forwarding decisions based on multiple routing metrics. Both mechanisms were integrated into the conventional GFS to form Greedy Stand-Alone Routing (GSAR) protocol. Evaluations of GSAR were performed using network simulator Ns2 based upon a defined set of performance metrics, scenarios and topologies. The results demonstrate that GSAR eliminates recovery mode mechanism in GFS and consequently improve overall network performance. Under various mobility conditions, GSAR avoids hole problem by about 87% and 79% over Greedy Perimeter Stateless Routing and Position-based Opportunistic Routing Protocol respectively. Therefore, the GSAR protocol is a reasonable alternative to position-based unicast routing protocol in MANET

Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks

This book presents collective works published in the recent Special Issue (SI) entitled "Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks”. These works expose the readership to the latest solutions and techniques for MANETs and VANETs. They cover interesting topics such as power-aware optimization solutions for MANETs, data dissemination in VANETs, adaptive multi-hop broadcast schemes for VANETs, multi-metric routing protocols for VANETs, and incentive mechanisms to encourage the distribution of information in VANETs. The book demonstrates pioneering work in these fields, investigates novel solutions and methods, and discusses future trends in these field

Contribution to the design of VANET routing protocols for realistic urban environments

One of the main concerns of the cities' administration is mobility management. In Intelligent Transportation Systems (ITS), pedestrians, vehicles and public transportation systems could share information and react to any situation in the city. The information sensed by vehicles could be useful for other vehicles and for the mobility authorities. Vehicular Ad hoc Networks (VANETs) make possible the communication between vehicles (V2I) and also between vehicles and fixed infrastructure (V2I) managed by the city's authorities. In addition, VANET routing protocols minimize the use of fixed infrastructure since they employ multi-hop V2V communication to reach reporting access points of the city. This thesis aims to contribute in the design of VANET routing protocols to enable reporting services (e.g., vehicular traffic notifications) in urban environments. The first step to achieve this global objective has been the study of components and tools to mimic a realistic VANET scenario. Moreover, we have analyzed the impact of the realism of each one of those components in the simulation results. Then, we have improved the Address Resolution procedure in VANETs by including it in the routing signaling messages. Our approach simplifies the VANET operation and increases the packet delivery ratio as consequence. Afterwards, we have tackled the issue of having duplicate packets in unicast communications and we have proposed routing filters to lower their presence. This way we have been able to increase the available bandwidth and reduce the average packet delay with a slight increase of the packet losses. Besides, we have proposed a Multi-Metric Map aware routing protocol (MMMR) that incorporates four routing metrics (distance, trajectory, vehicle density and available bandwidth) to take the forwarding decisions. With the aim of increasing the number of delivered packets in MMMR, we have developed a Geographical Heuristic Routing (GHR) algorithm. GHR integrates Tabu and Simulated Annealing heuristic optimization techniques to adapt its behavior to the specific scenario characteristics. GHR is generic because it could use any geographical routing protocol to take the forwarding decisions. Additionally, we have designed an easy to implement forwarding strategy based on an extended topology information area of two hops, called 2-hops Geographical Anycast Routing (2hGAR) protocol. Results show that controlled randomness introduced by GHR improves the default operation of MMMR. On the other hand, 2hGAR presents lower delays than GHR and higher packet delivery ratio, especially in high density scenarios. Finally, we have proposed two mixed (integer and linear) optimization models to detect the best positions in the city to locate the Road Side Units (RSUs) which are in charge of gathering all the reporting information generated by vehicles.Una de las principales preocupaciones en la administración de las ciudades es la gestión de la movilidad de sus vehículos, debido a los problemas de tráfico como atascos y accidentes. En los sistemas inteligentes de transporte (SIT), peatones, vehículos y transporte público podrán compartir información y adaptarse a cualquier situación que suceda en la ciudad. La información obtenida por los sensores de los vehículos puede ser útil para otros vehículos y para las autoridades de movilidad. Las redes ad hoc vehiculares (VANETs) hacen posible la comunicación entre los propios vehículos (V2V) y entre vehículos y la infraestructura fija de la red de la ciudad (V2I). Asimismo, los protocolos de encaminamiento para redes vehiculares minimizan el uso de infraestructura fija de red, ya que los protocolos de encaminamiento VANET emplean comunicaciones multisalto entre vehículos para encaminar los mensajes hasta los puntos de acceso de la red en la ciudad. El objetivo de esta tesis doctoral es contribuir en el diseño de protocolos de encaminamiento en redes ad hoc vehiculares para servicios de notificaciones (p.ej. reportes del estado del tráfico) en entornos urbanos. El primer paso para alcanzar este objetivo general ha sido el estudio de componentes y herramientas para simular un escenario realista de red ad hoc vehicular. Además, se ha analizado el impacto del nivel de realismo de cada uno de los componentes de simulación en los resultados obtenidos. Así también, se ha propuesto un mecanismo de resolución de direcciones automático y coherente para redes VANET a través del uso de los propios mensajes de señalización de los protocolos de encaminamiento. Esta mejora simplifica la operación de una red ad hoc vehicular y como consecuencia aumenta la tasa de recepción de paquetes. A continuación, se ha abordado el problema de la aparición inesperada de paquetes de datos duplicados en una comunicación punto a punto. Para ello, se ha propuesto el filtrado de paquetes duplicados a nivel del protocolo de encaminamiento. Esto ha producido un incremento del ancho disponible en el canal y una reducción del retardo medio en la trasmisión de un paquete, a costa de un mínimo aumento de la pérdida de paquetes. Por otra parte, hemos propuesto un protocolo de encaminamiento multi-métrica MMMR (Multi-Metric Map-aware Routing protocol), el cual incorpora cuatro métricas (distancia al destino, trayectoria, densidad de vehículos y ancho de banda) en las decisiones de encaminamiento. Con el objetivo de aumentar la tasa de entrega de paquetes en MMMR, hemos desarrollado un algoritmo heurístico de encaminamiento geográfico denominado GHR (Geographical Heuristic Routing). Esta propuesta integra las técnicas de optimización Tabu y Simulated Annealing, que permiten a GHR adaptarse a las características específicas del escenario. Adicionalmente, hemos propuesto 2hGAR (2-hops Geographical Anycast Routing), un protocolo de encaminamiento anycast que emplea información de la topología de red a dos saltos de distancia para tomar la decisión de encaminamiento de los mensajes. Los resultados muestran que la aleatoriedad controlada de GHR en su operación mejora el rendimiento de MMMR. Asimismo, 2hGAR presenta retardos de paquete menores a los obtenidos por GHR y una mayor tasa de paquetes entregados, especialmente en escenarios con alta densidad de vehículos. Finalmente, se han propuesto dos modelos de optimización mixtos (enteros y lineales) para detectar los mejores lugares de la ciudad donde ubicar los puntos de acceso de la red, los cuales se encargan de recolectar los reportes generados por los vehículos.Postprint (published version

Performance analysis of V2V dynamic anchor position-based routing protocols

Recently, vehicular ad hoc networks (VANETs) have received more attention in both academic and industry settings. One of the challenging issues in this domain is routing protocols. VANETs unique characteristics such as high mobility with the constraint of road topology, fast network topology changes, frequently disconnected networks, and time-sensitive data exchange makes it difficult to design an efficient routing protocol for routing data in vehicle-to-vehicle (V2V) and vehicle-toinfrastructure communications. Designing routing protocols for V2V commutations are more challenging due to the absence of infrastructure nodes in the communication procedure. They become even more challenging, when they get benefit from dynamic anchor computation method in which the anchor nodes (junctions or basic nodes for routing) are dynamic in their routing procedure. Positionbased routing protocols have been proven to be superior and outperform the other protocols since there is no requirement to establish and save a route between source and destination during the routing process which is suitable for dynamic nature of vehicular networks. In this paper, the performance of V2V dynamic anchor position-based routing protocols, which are proposed for the most challenging condition of packet routing in VANET, are investigated and evaluated under two different scenarios (i.e. various vehicle densities and velocities) through NS-2. The obtained results are then illustrated based on average delay, packet delivery ratio and routing overhead as routing performance indicators. Our objective is to provide a quantitative assessment of the applicability of these protocols in different vehicular scenarios. The comparison provided in this paper makes the research contribution of this survey paper quite higher than a regular survey paper only with explanations.This research is supported by UM High Impact Research MoE Grant UM.C/625/1/HIR/MOHE/FCSIT/09 from the Ministry of Education Malaysia.Jabbarpour, MR.; Marefat, A.; Jalooli, A.; Noor, RM.; Khokhar, RH.; Lloret, J. (2015). Performance analysis of V2V dynamic anchor position-based routing protocols. Wireless Networks. 21(3):911-929. doi:10.1007/s11276-014-0825-8S911929213Jalooli, A., Shaghaghi, E., Jabbarpour, M.R., Md Noor, R., Yeo, H., & Jung, J.J. (2014). Intelligent advisory speed limit dedication in highway using VANET. The Scientific World Journal, 2014, 629412.Jalooli, A., Hussin, N., Noor, R.M, & Jung, J.J. (2014). Public alerts on landslide natural disaster using vehicular communications. International Journal of Distributed Sensor Networks. doi: 10.1155/2014/969864 .Vasilakos, A.V. (2008). Special issue: Ambient Intelligence. Information Sciences, 178(3), 585–587.Sattari, M. R. J., Noor, R. M., & Ghahremani, S. (2013). Dynamic congestion control algorithm for vehicular ad hoc networks. International Journal of Software Engineering and Its Applications, 7(3), 95–108.Cheng, X., Wang, C.-X., Laurenson, D. I., Salous, S., & Vasilakos, A. V. (2009). An adaptive geometry-based stochastic model for non-isotropic MIMO mobile-to-mobile channels. IEEE Transactions on Wireless Communications, 8(9), 4824–4835.Li, M., Li, Z., & Vasilakos, A.V. (2013). A survey on topology control in wireless sensor networks: Taxonomy, comparative study, and open issues. Proceedings of the IEEE, 101(12), 2538–2557.Cheng, X., Wang, C.X., Laurenson, D.I., Salous, S., Vasilakos, A.V. (2011). New deterministic and stochastic simulation models for non isotropic scattering mobile to mobile Rayleigh fading channels. Wireless Communications and Mobile Computing, 11(7), 829–842.Jiang, D., & Delgrossi, L. (2008). IEEE 802.11 p: Towards an international standard for wireless access in vehicular environments. In IEEE Vehicular Technology Conference (pp. 2036–2040). VTC Spring 2008.Lloret, J., Canovas, A., Catalá, A., & Garcia, M. (2013). Group-based protocol and mobility model for VANETs to offer internet access. Journal of Network and Computer Applications, 36(3), 1027–1038.Whaiduzzaman, M., Sookhak, M., Gani, A., Buyya, R. (2014). A survey on vehicular cloud computing. Journal of Network and Computer Applications, 40, 325–344.Bilal, S. M., Khan, S. U., Madani, S. A., Nazir, B., Othman, M. (2014). Road oriented traffic information system for vehicular ad hoc networks. Wireless Personal Communications, 77(4), 2497–2515.Cho, K.-H., & Ryu, M.-W. (2012). A survey of greedy routing protocols for vehicular ad hoc networks. Smart CR, 2(2), 125–137.Sharef, B. T., Alsaqour, R. A., & Ismail, M. (2014). Vehicular communication ad hoc routing protocols: A survey. Journal of Network and Computer Applications, 40, 363–396.Ghafoor, K. Z., Mohammed, M. A., Lloret, J., Bakar, K. A., & Zainuddin, Z. M. (2013). Routing protocols in vehicular ad hoc networks: Survey and research challenges. Network Protocols and Algorithms, 5(4), 39–83.Perkins, C.E., & Royer, E.M. (1999). Ad hoc on-demand distance vector routing. In Proceeding of Second IEEE Workshop on Mobile computing systems and applications, WMCSA’99 (pp. 90–100).Johnson, D.B., & Maltz, D.A. (1996). Dynamic source routing in ad hoc wireless networks. In Mobile computing (pp. 153–181). Heidelberg: Springer.Liu, G., Lee, B-S., Seet, B-C., Foh, C-H., Wong, K-J., & Lee, K-K. (2004). A routing strategy for metropolis vehicular communications. In Information networking. networking technologies for broadband and mobile networks (Lecture notes in computer science, pp. 134–143, Vol. 3090). Berlin, Heidelberg: Springer.Füßler, H., Mauve, M., Hartenstein, H., Käsemann, M., & Vollmer, D. (2003). Mobicom poster: Location-based routing for vehicular ad-hoc networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7(1), 47–49.Hui, F. (2005). A survey on the characterization of Vehicular Ad Hoc Networks routing solutions. In ECS (pp. 1–15).Jabbarpour, M. R., Md Noor, R., Khokhar, R. H., & Ke, C.-H. (2014). Cross-layer congestion control model for urban vehicular environments. Journal of Network and Computer Applications, 44, 1–16.Khokhar, R.H., Zia, T., Ghafoor, K.Z., Lloret, J., Shiraz, M. (2013). Realistic and Efficient Radio Propagation Model for V2X Communications. KSII Transactions on Internet & Information Systems, 7(8). doi: 10.1007/978-3-319-04283-1 .Fonseca, A., & Vazão, T. (2013). Applicability of position-based routing for VANET in highways and urban environment. Journal of Network and Computer Applications, 36(3), 961–973.Nikumbh, M. D., & Bhoi, M. A. (2013). A survey of positioned based routing protocol in VANET. International Journal of Modern Engineering Research (IJMER), 3(2), 1015–1018.da Silva Camões, A. R. (2013). Geographic location and routing in vehicular networks. Master, tecnicolisboa.Raw, R. S., & Das, S. (2011). Performance comparison of Position based routing Protocols in vehicle-to-vehicle (V2V) Communication. International Journal of Engineering Science and Technology, 3(1), 435–444.Hassan, A. N., Abdullah, A. H., Sheet, D. K., & Qureshi, K. N. (2014). Comparison of position based routing protocols of vehicular AD HOC network. World Applied Sciences Journal, 31(3), 341–345.He, G. (2002). Destination-sequenced distance vector (DSDV) protocol. Networking Laboratory: Helsinki University of Technology.Karp, B., & Kung, H-T. (2000). GPSR: Greedy perimeter stateless routing for wireless networks. In Proceedings of the 6th annual international conference on Mobile computing and networking (pp. 243–254). ACM.Gerls, M. (2002). Fisheye State Routing (FSR) for Ad Hoc Networks. Internet Draft, draft-ietf-manet-fsr-03 txt.Clausen, T., Jacquet, P., Adjih, C., Laouiti, A., Minet, P., Muhlethaler, P., Qayyum, A., & Viennot, L. (2003). Optimized link state routing protocol (OLSR).Attar, A., Tang, H., Vasilakos, A. V., Yu, F. R., & Leung, V. C. (2012). A survey of security challenges in cognitive radio networks: solutions and future research directions. Proceedings of the IEEE, 100(12), 3172–3186.Park, V., & Corson, M.S. (1997). Temporally-ordered routing algorithm (TORA) version 1 functional specification. Internet-Draft, draft-ietf-manet-tora-spec-00. Txt.Namboodiri, V., Agarwal, M., & Gao, L. (2004). A study on the feasibility of mobile gateways for vehicular ad-hoc networks. In Proceedings of the 1st ACM International Workshop on Vehicular ad hoc networks (pp. 66–75). ACM.Patel, V. J., & Anuradha, P. G. (2012). A review on routing overhead in broadcast based protocol on VANET. International Journal of Engineering and Innovative Technology (IJEIT), 2(5), 109–113.Beijar, N. (2002). Zone routing protocol (ZRP). Finland: Networking Laboratory, Helsinki University of Technology.Nikaein, N., Bonnet, C., & Nikaein, N. (2001). Harp-hybrid ad hoc routing protocol. In Proceedings of International Symposium on Telecommunications (IST) (pp 56–67).Mauve, M., Widmer, J., & Hartenstein, H. (2001). A survey on position-based routing in mobile ad hoc networks. IEEE Network, 15(6), 30–39.Krishna, P., Vaidya, N. H., Chatterjee, M., & Pradhan, D. K. (1997). A cluster-based approach for routing in dynamic networks. ACM SIGCOMM Computer Communication Review, 27(2), 49–64.Song, T., Xia, W., Song, T., Shen, L. (2010). A cluster-based directional routing protocol in VANET. In 12th IEEE International Conference on Communication Technology (ICCT) (pp. 1172–1175).Zeng, Y., Xiang, K., Li, D., & Vasilakos, A. V. (2013). Directional routing and scheduling for green vehicular delay tolerant networks. Wireless Networks, 19(2), 161–173.Spyropoulos, T., Rais, R. N., Turletti, T., Obraczka, K., & Vasilakos, A. (2010). Routing for disruption tolerant networks: Taxonomy and design. Wireless Networks, 16(8), 2349–2370.Vasilakos, A. V., Zhang, Y., & Spyropoulos, T. (2012). Delay tolerant networks: Protocols and applications. Boca Raton: CRC Press.Aquino, R., & Edwards, A. (2006). A reactive location routing algorithm with cluster-based flooding for inter-vehicle communication. Computación y Sistemas, 9(4), 297–313.Wang, T., & Wang, G. (2010). TIBCRPH: traffic infrastructure based cluster routing protocol with handoff in VANET. In 19th Annual IEEE Wireless and Optical Communications Conference (WOCC) (pp. 1–5).Kihl, M., Sichitiu, M., & Joshi, H.P. (2008). Design and evaluation of two geocast protocols for vehicular ad-hoc networks. Journal of Internet Engineering, 2(1), 127–135.Allal, S., & Boudjit, S. (2012). Geocast routing protocols for vanets: Survey and guidelines. In Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS) (pp. 323–328).Ghafoor, K. Z., Abu Bakar, K., Lloret, J., Khokhar, R. H., & Lee, K. C. (2013). Intelligent beaconless geographical forwarding for urban vehicular environments. Wireless Networks, 19(3), 345–362.Ibrahim, K., Weigle, M.C., & Abuelela, M. (2009). p-IVG: Probabilistic inter-vehicle geocast for dense vehicular networks. In IEEE 69th Vehicular Technology Conference. VTC Spring 2009. (pp 1–5).Park, S., Lee, E., Park, H., Lee, H., & Kim, S.-H. (2010). Mobile geocasting to support mobile sink groups in wireless sensor networks. IEEE Communications Letters, 14(10), 939–941.Chaurasia, N., Sharma, S., & Soni, D. (2011). Review study of routing protocols and versatile challenges of MANET. International Journal, 1(2), 150–157.Kihl, M., Sichitiu, M., Ekeroth, T., & Rozenberg, M. (2007) Reliable geographical multicast routing in vehicular ad-hoc networks. In Wired/wireless internet communications (Lecture notes in computer science, pp. 315–325, Vol. 4517). Berlin, Heidelberg: Springer.Chen, Y.-S., Lin, Y.-W., & Lee, S.-L. (2010). A mobicast routing protocol in vehicular ad-hoc networks. Mobile Networks and Applications, 15(1), 20–35.Junhai, L., Liu, X., & Danxia, Y. (2008). Research on multicast routing protocols for mobile ad-hoc networks. Computer Networks, 52(5), 988–997.Li, P., Guo, S., Yu, S., & Vasilakos, A.V. (2012). CodePipe: An opportunistic feeding and routing protocol for reliable multicast with pipelined network coding. In INFOCOM, 2012 Proceedings IEEE (pp. 100–108).Yen, Y.-S., Chao, H.-C., Chang, R.-S., & Vasilakos, A. (2011). Flooding-limited and multi-constrained QoS multicast routing based on the genetic algorithm for MANETs. Mathematical and Computer Modelling, 53(11), 2238–2250.Royer, E.M. (2000). Multicast ad hoc on-demand distance vector (MAODV) routing. IETF Internet Draft, draft-ietf-manet-maodv-00 txt.Jetcheva, J.G., & Johnson, D.B. (2001). Adaptive demand-driven multicast routing in multi-hop wireless ad hoc networks. In Proceedings of the 2nd ACM International Symposium on Mobile ad hoc networking & computing (pp. 33–44). ACM.Patel, A., Latifi, M., Souza, A.B., Xavier, F.A., Celestino, J., & Oliveira, F.D. (2013). Stable multicast trees based on Ant Colony optimization for vehicular Ad Hoc networks. In Proceedings of the 2013 International Conference on Information Networking (ICOIN), IEEE Computer Society (pp. 101–106).Laouiti, A., Jacquet, P., Minet, P., Viennot, L., Clausen, T., & Adjih, C. (2003) Multicast optimized link state routing. INRIA research report RR–4721.Lee, S.-J., Su, W., & Gerla, M. (2002). On-demand multicast routing protocol in multihop wireless mobile networks. Mobile Networks and Applications, 7(6), 441–453.Tian, K., Zhang, B., Mouftah, H., Zhao, Z., & Ma, J. (2009). Destination-driven on-demand multicast routing protocol for wireless ad hoc networks. In ICC’09 IEEE International Conference on Communications, 2009 (pp. 1–5).Tonguz, O. K., Wisitpongphan, N., & Bai, F. (2010). DV-CAST: A distributed vehicular broadcast protocol for vehicular ad hoc networks. IEEE Wireless Communications, 17(2), 47–57.Nekovee, M., & Bogason, B.B. (2007). Reliable and effcient information dissemination in intermittently connected vehicular adhoc networks. In IEEE 65th Vehicular Technology Conference (pp. 2486–2490). VTC2007-Spring.Maia, G., Aquino, A.L., Viana, A., Boukerche, A., & Loureiro, A.A. (2012). HyDi: A hybrid data dissemination protocol for highway scenarios in vehicular ad hoc networks. In Proceedings of the second ACM international symposium on Design and analysis of intelligent vehicular networks and applications (pp. 115–122). ACM.Nakorn, N.N., & Rojviboonchai, K. (2010). DECA: Density-aware reliable broadcasting in vehicular ad hoc networks. In 2010 International Conference on Electrical Engineering/Electronics Computer Telecommunications and Information Technology (ECTI-CON) (pp. 598–602).Zhou, L., Chao, H.-C., & Vasilakos, A. V. (2011). Joint forensics-scheduling strategy for delay-sensitive multimedia applications over heterogeneous networks. Selected Areas in Communications, IEEE Journal on, 29(7), 1358–1367.Yao, Y., Cao, Q., & Vasilakos, A.V. (2013). EDAL: An energy-efficient, delay-aware, and lifetime-balancing data collection protocol for wireless sensor networks. In IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems (MASS), 2013 (pp. 182–190).Lochert, C., Hartenstein, H., Tian, J., Fussler, H., Hermann, D., & Mauve, M. (2003). A routing strategy for vehicular ad hoc networks in city environments. In Proceedings of the IEEE Intelligent Vehicles Symposium, 2003 (pp. 156–161).Käsemann, M., Füßler, H., Hartenstein, H., & Mauve, M. (2002). A reactive location service for mobile ad hoc networks. Citeseer.Chen, J-C. (2003). Dijkstra’s shortest path algorithm. Journal of Formalized Mathematics 15.Seet, B-C., Liu, G., Lee, B-S., Foh, C-H., Wong, K-J., Lee, K-K. (2004). A-STAR: A mobile ad hoc routing strategy for metropolis vehicular communications. In NETWORKING 2004. Networking technologies, services, and protocols; performance of computer and communication networks; mobile and wireless communications (pp. 989–999). New York: Springer.Gong, J., Xu, C-Z., & Holle, J. (2007). Predictive directional greedy routing in vehicular ad hoc networks. In IEEE 27th International Conference on Distributed Computing Systems Workshops, 2007. ICDCSW’07 (pp. 2–2).Ding, Y., Wang, C., & Xiao, L. (2007). A static-node assisted adaptive routing protocol in vehicular networks. In Proceedings of the fourth ACM international workshop on Vehicular ad hoc networks. ACM (pp. 59–68).Borsetti, D., & Gozalvez, J. (2010) Infrastructure-assisted geo-routing for cooperative vehicular networks. In IEEE Vehicular Networking Conference (VNC) (pp. 255–262).Cianfrani, A., Eramo, V., Listanti, M., Polverini, M., & Vasilakos, A. V. (2012). An OSPF-integrated routing strategy for QoS-aware energy saving in IP backbone networks. IEEE Transactions on Network and Service Management, 9(3), 254–267.Luo, J., Gu, X., Zhao, T., & Yan, W. (2010). A mobile infrastructure based VANET routing protocol in the urban environment. In IEEE 2010 International Conference on Communications and Mobile Computing (CMC) (pp. 432–437).Xiang, L., Luo, J., & Vasilakos, A. (2011). Compressed data aggregation for energy efficient wireless sensor networks. In 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON) (pp. 46–54).Cheng, H., Xiong, N., Vasilakos, A. V., Tianruo Yang, L., Chen, G., & Zhuang, X. (2012). Nodes organization for channel assignment with topology preservation in multi-radio wireless mesh networks. Ad Hoc Networks, 10(5), 760–773.Pan, H-Y., Jan, R-H., Jeng, A.A-K., Chen, C., & Tseng, H-R. (2011) Mobile gateway routing for vehicular networks. In Proceedings of the 8th IEEE Asia Pacific wireless communication symposium (APWCS 2011).Granelli, F., Boato, G., & Kliazovich, D. (2006). MORA: A movement-based routing algorithm for vehicle ad hoc networks. In IEEE Workshop on Automotive Networking and Applications (AutoNet 2006), San Francisco, USA.Menouar, H., Lenardi, M., & Filali, F. (2007). Movement prediction-based routing (MOPR) concept for position-based routing in vehicular networks. In 66th IEEE Vehicular Technology Conference, VTC-2007 Fall 2007 (pp. 2101–2105).Menouar, H., Lenardi, M., & Filali, F. (2006). An intelligent movement-based routing for VANETs. In ITS world congress, London.Menouar, M., Lenardi, M., & Filali, F. (2005). A movement prediction based routing protocol for vehicle-to-vehicle communications. Communications, 21, 07–2005.Wei, G., Ling, Y., Guo, B., Xiao, B., Vasilakos, A.V. (2011) Prediction-based data aggregation in wireless sensor networks: Combining grey model and Kalman filter. Computer Communications, 34(6), 793–802.Luo, Y., Zhang, W., & Hu, Y. (2010). A new cluster based routing protocol for VANET. In IEEE Second International Conference on Networks Security Wireless Communications and Trusted Computing (NSWCTC) (pp. 176–180).Raw, R.S., & Lobiyal, D. (2010). B-MFR routing protocol for vehicular ad hoc networks. In IEEE International Conference on Networking and Information Technology (ICNIT) (pp. 420–423).Stojmenovic, I., Ruhil, A. P., & Lobiyal, D. (2006). Voronoi diagram and convex hull based geocasting and routing in wireless networks. Wireless communications and mobile computing, 6(2), 247–258.Prasanth, K., Duraiswamy, K., Jayasudha, K., & Chandrasekar, C. (2009). Edge node based greedy routing for VANET with constant bit rate packet transmission. International Journal of Recent Trends in Engineering, 2(4), 14–19.Wang, X., Vasilakos, A. V., Chen, M., Liu, Y., & Kwon, T. T. (2012). A survey of green mobile networks: Opportunities and challenges. Mobile Networks and Applications, 17(1), 4–20.Brahmi, N., Boussedjra, M., Mouzna, J., & Bayart, M. (2009). Adaptative movement aware routing for vehicular ad hoc networks. In Proceedings of the International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly (pp. 1310–1315). New York: ACM.Haklay, M., & Weber, P. (2008). Openstreetmap: User-generated street maps. IEEE Pervasive Computing, 7(4), 12–18.Behrisch, M., Bieker, L., Erdmann, J., & Krajzewicz, D. (2011). Sumo-simulation of urban mobility-an overview. In SIMUL 2011, The Third International Conference on Advances in System Simulation (pp. 55–60).Baumgart, I., Heep, B., & Krause, S. (2007). OverSim: A flexible overlay network simulation framework. In IEEE Global Internet Symposium (pp. 79–84).Martinez, F. J., Toh, C.-K., Cano, J.-C., Calafate, C. T., & Manzoni, P. (2011). A street broadcast reduction scheme (SBR) to mitigate the broadcast storm problem in VANETs. Wireless Personal Communications, 56(3), 559–572.Youssef, M., Ibrahim, M., Abdelatif, M., Chen, L., & Vasilakos, A. (2013). Routing metrics of cognitive radio networks: A survey. IEEE Communications Surveys & Tutorials, 16(1), 92–109