Designing Smart Adaptive Flooding in MANET using Evolutionary Algorithm

International audienceThis paper deals with broadcasting warning / emergency messages in mobile ad hoc networks. Traditional broadcasting schemes tend to focus on usually high and homogeneous neighborhood densities environments. This paper presents a broadcasting protocol that locally and dynamically adapts its strategy to the neighborhood densities. The behavior of the protocol is tuned using various internal parameters. Multiple combinations of those parameters have been pre-computed as optimal solutions for a range of neighborhood densities, and the most relevant one is dynamically chosen depending on the locally perceived environment. The combinations were determined by coupling an evolutionary algorithm and a network simulator, using a statistically realistic radio-propagation model (Shadowing Pattern). This approach is compared with other probabilistic methods while broadcasting an emergency message in vehicular ad hoc networks with variable and heterogeneous vehicle densities. In such a context, it is expected from the network to enable each node to receive the warning message. The results show that our protocol covers the whole network, whereas other methods only have a probability of 0.57 to 0.9 to cover the entire network

Dissimilarity metric based on local neighboring information and genetic programming for data dissemination in vehicular ad hoc networks (VANETs)

This paper presents a novel dissimilarity metric based on local neighboring information and a genetic programming approach for efficient data dissemination in Vehicular Ad Hoc Networks (VANETs). The primary aim of the dissimilarity metric is to replace the Euclidean distance in probabilistic data dissemination schemes, which use the relative Euclidean distance among vehicles to determine the retransmission probability. The novel dissimilarity metric is obtained by applying a metaheuristic genetic programming approach, which provides a formula that maximizes the Pearson Correlation Coefficient between the novel dissimilarity metric and the Euclidean metric in several representative VANET scenarios. Findings show that the obtained dissimilarity metric correlates with the Euclidean distance up to 8.9% better than classical dissimilarity metrics. Moreover, the obtained dissimilarity metric is evaluated when used in well-known data dissemination schemes, such as p-persistence, polynomial and irresponsible algorithm. The obtained dissimilarity metric achieves significant improvements in terms of reachability in comparison with the classical dissimilarity metrics and the Euclidean metric-based schemes in the studied VANET urban scenarios

Quality of service aware data dissemination in vehicular Ad Hoc networks

Des systèmes de transport intelligents (STI) seront éventuellement fournis dans un proche avenir pour la sécurité et le confort des personnes lors de leurs déplacements sur les routes. Les réseaux ad-hoc véhiculaires (VANETs) représentent l'élément clé des STI. Les VANETs sont formés par des véhicules qui communiquent entre eux et avec l'infrastructure. En effet, les véhicules pourront échanger des messages qui comprennent, par exemple, des informations sur la circulation routière, les situations d'urgence et les divertissements. En particulier, les messages d'urgence sont diffusés par des véhicules en cas d'urgence (p.ex. un accident de voiture); afin de permettre aux conducteurs de réagir à temps (p.ex., ralentir), les messages d'urgence doivent être diffusés de manière fiable dans un délai très court. Dans les VANETs, il existe plusieurs facteurs, tels que le canal à pertes, les terminaux cachés, les interférences et la bande passante limitée, qui compliquent énormément la satisfaction des exigences de fiabilité et de délai des messages d'urgence. Dans cette thèse, en guise de première contribution, nous proposons un schéma de diffusion efficace à plusieurs sauts, appelé Dynamic Partitioning Scheme (DPS), pour diffuser les messages d'urgence. DPS calcule les tailles de partitions dynamiques et le calendrier de transmission pour chaque partition; à l'intérieur de la zone arrière de l'expéditeur, les partitions sont calculées de sorte qu'en moyenne chaque partition contient au moins un seul véhicule; l'objectif est de s'assurer que seul un véhicule dans la partition la plus éloignée (de l'expéditeur) est utilisé pour diffuser le message, jusqu'au saut suivant; ceci donne lieu à un délai d'un saut plus court. DPS assure une diffusion rapide des messages d'urgence. En outre, un nouveau mécanisme d'établissement de liaison, qui utilise des tonalités occupées, est proposé pour résoudre le problème du problème de terminal caché. Dans les VANETs, la Multidiffusion, c'est-à-dire la transmission d'un message d'une source à un nombre limité de véhicules connus en tant que destinations, est très importante. Par rapport à la diffusion unique, avec Multidiffusion, la source peut simultanément prendre en charge plusieurs destinations, via une arborescence de multidiffusion, ce qui permet d'économiser de la bande passante et de réduire la congestion du réseau. Cependant, puisque les VANETs ont une topologie dynamique, le maintien de la connectivité de l'arbre de multidiffusion est un problème majeur. Comme deuxième contribution, nous proposons deux approches pour modéliser l'utilisation totale de bande passante d'une arborescence de multidiffusion: (i) la première approche considère le nombre de segments de route impliqués dans l'arbre de multidiffusion et (ii) la seconde approche considère le nombre d'intersections relais dans l'arbre de multidiffusion. Une heuristique est proposée pour chaque approche. Pour assurer la qualité de service de l'arbre de multidiffusion, des procédures efficaces sont proposées pour le suivi des destinations et la surveillance de la qualité de service des segments de route. Comme troisième contribution, nous étudions le problème de la congestion causée par le routage du trafic de données dans les VANETs. Nous proposons (1) une approche de routage basée sur l’infonuagique qui, contrairement aux approches existantes, prend en compte les chemins de routage existants qui relaient déjà les données dans les VANETs. Les nouvelles demandes de routage sont traitées de sorte qu'aucun segment de route ne soit surchargé par plusieurs chemins de routage croisés. Au lieu d'acheminer les données en utilisant des chemins de routage sur un nombre limité de segments de route, notre approche équilibre la charge des données en utilisant des chemins de routage sur l'ensemble des tronçons routiers urbains, dans le but d'empêcher, dans la mesure du possible, les congestions locales dans les VANETs; et (2) une approche basée sur le réseau défini par logiciel (SDN) pour surveiller la connectivité VANET en temps réel et les délais de transmission sur chaque segment de route. Les données de surveillance sont utilisées en entrée de l'approche de routage.Intelligent Transportation Systems (ITS) will be eventually provided in the near future for both safety and comfort of people during their travel on the roads. Vehicular ad-hoc Networks (VANETs), represent the key component of ITS. VANETs consist of vehicles that communicate with each other and with the infrastructure. Indeed, vehicles will be able to exchange messages that include, for example, information about road traffic, emergency situations, and entertainment. Particularly, emergency messages are broadcasted by vehicles in case of an emergency (e.g., car accident); in order to allow drivers to react in time (e.g., slow down), emergency messages must be reliably disseminated with very short delay. In VANETs, there are several factors, such as lossy channel, hidden terminals, interferences and scarce bandwidth, which make satisfying reliability and delay requirements of emergency messages very challenging. In this thesis, as the first contribution, we propose a reliable time-efficient and multi-hop broadcasting scheme, called Dynamic Partitioning Scheme (DPS), to disseminate emergency messages. DPS computes dynamic partition sizes and the transmission schedule for each partition; inside the back area of the sender, the partitions are computed such that in average each partition contains at least a single vehicle; the objective is to ensure that only a vehicle in the farthest partition (from the sender) is used to disseminate the message, to next hop, resulting in shorter one hop delay. DPS ensures fast dissemination of emergency messages. Moreover, a new handshaking mechanism, that uses busy tones, is proposed to solve the problem of hidden terminal problem. In VANETs, Multicasting, i.e. delivering a message from a source to a limited known number of vehicles as destinations, is very important. Compared to Unicasting, with Multicasting, the source can simultaneously support multiple destinations, via a multicast tree, saving bandwidth and reducing overall communication congestion. However, since VANETs have a dynamic topology, maintaining the connectivity of the multicast tree is a major issue. As the second contribution, we propose two approaches to model total bandwidth usage of a multicast tree: (i) the first approach considers the number of road segments involved in the multicast tree and (ii) the second approach considers the number of relaying intersections involved in the multicast tree. A heuristic is proposed for each approach. To ensure QoS of the multicasting tree, efficient procedures are proposed for tracking destinations and monitoring QoS of road segments. As the third contribution, we study the problem of network congestion in routing data traffic in VANETs. We propose (1) a Cloud-based routing approach that, in opposition to existing approaches, takes into account existing routing paths which are already relaying data in VANETs. New routing requests are processed such that no road segment gets overloaded by multiple crossing routing paths. Instead of routing over a limited set of road segments, our approach balances the load of communication paths over the whole urban road segments, with the objective to prevent, whenever possible, local congestions in VANETs; and (2) a Software Defined Networking (SDN) based approach to monitor real-time VANETs connectivity and transmission delays on each road segment. The monitoring data is used as input to the routing approach

Reliable Message Dissemination in Mobile Vehicular Networks

Les réseaux véhiculaires accueillent une multitude d’applications d’info-divertissement et de sécurité. Les applications de sécurité visent à améliorer la sécurité sur les routes (éviter les accidents), tandis que les applications d’info-divertissement visent à améliorer l'expérience des passagers. Les applications de sécurité ont des exigences rigides en termes de délais et de fiabilité ; en effet, la diffusion des messages d’urgence (envoyés par un véhicule/émetteur) devrait être fiable et rapide. Notons que, pour diffuser des informations sur une zone de taille plus grande que celle couverte par la portée de transmission d’un émetteur, il est nécessaire d’utiliser un mécanisme de transmission multi-sauts. De nombreuses approches ont été proposées pour assurer la fiabilité et le délai des dites applications. Toutefois, ces méthodes présentent plusieurs lacunes. Cette thèse, nous proposons trois contributions. La première contribution aborde la question de la diffusion fiable des messages d’urgence. A cet égard, un nouveau schéma, appelé REMD, a été proposé. Ce schéma utilise la répétition de message pour offrir une fiabilité garantie, à chaque saut, tout en assurant un court délai. REMD calcule un nombre optimal de répétitions en se basant sur l’estimation de la qualité de réception de lien dans plusieurs locations (appelées cellules) à l’intérieur de la zone couverte par la portée de transmission de l’émetteur. REMD suppose que les qualités de réception de lien des cellules adjacentes sont indépendantes. Il sélectionne, également, un nombre de véhicules, appelés relais, qui coopèrent dans le contexte de la répétition du message d’urgence pour assurer la fiabilité en multi-sauts. La deuxième contribution, appelée BCRB, vise à améliorer REMD ; elle suppose que les qualités de réception de lien des cellules adjacentes sont dépendantes ce qui est, généralement, plus réaliste. BCRB utilise les réseaux Bayésiens pour modéliser les dépendances en vue d’estimer la qualité du lien de réception avec une meilleure précision. La troisième contribution, appelée RICS, offre un accès fiable à Internet. RICS propose un modèle d’optimisation, avec une résolution exacte optimale à l'aide d’une technique de réduction de la dimension spatiale, pour le déploiement des passerelles. Chaque passerelle utilise BCRB pour établir une communication fiable avec les véhicules.Vehicular networks aim to enable a plethora of safety and infotainment applications. Safety applications aim to preserve people's lives (e.g., by helping in avoiding crashes) while infotainment applications focus on enhancing the passengers’ experience. These applications, especially safety applications, have stringent requirements in terms of reliability and delay; indeed, dissemination of an emergency message (e.g., by a vehicle/sender involved in a crash) should be reliable while satisfying short delay requirements. Note, that multi-hop dissemination is needed to reach all vehicles, in the target area, that may be outside the transmission range of the sender. Several schemes have been proposed to provide reliability and short delay for vehicular applications. However, these schemes have several limitations. Thus, the design of new solutions, to meet the requirement of vehicular applications in terms of reliability while keeping low end-to-end delay, is required. In this thesis, we propose three schemes. The first scheme is a multi-hop reliable emergency message dissemination scheme, called REMD, which guarantees a predefined reliability , using message repetitions/retransmissions, while satisfying short delay requirements. It computes an optimal number of repetitions based on the estimation of link reception quality at different locations (called cells) in the transmission range of the sender; REMD assumes that link reception qualities of adjacent cells are independent. It also adequately selects a number of vehicles, called forwarders, that cooperate in repeating the emergency message with the objective to satisfy multi-hop reliability requirements. The second scheme, called BCRB, overcomes the shortcoming of REMD by assuming that link reception qualities of adjacent cells are dependent which is more realistic in real-life scenarios. BCRB makes use of Bayesian networks to model these dependencies; this allows for more accurate estimation of link reception qualities leading to better performance of BCRB. The third scheme, called RICS, provides internet access to vehicles by establishing multi-hop reliable paths to gateways. In RICS, the gateway placement is modeled as a k-center optimisation problem. A space dimension reduction technique is used to solve the problem in exact time. Each gateway makes use of BCRB to establish reliable communication paths to vehicles

Beaconing Approaches in Vehicular Ad Hoc Networks: A Survey

A Vehicular Ad hoc Network (VANET) is a type of wireless ad hoc network that facilitates ubiquitous connectivity between vehicles in the absence of fixed infrastructure. Beaconing approaches is an important research challenge in high mobility vehicular networks with enabling safety applications. In this article, we perform a survey and a comparative study of state-of-the-art adaptive beaconing approaches in VANET, that explores the main advantages and drawbacks behind their design. The survey part of the paper presents a review of existing adaptive beaconing approaches such as adaptive beacon transmission power, beacon rate adaptation, contention window size adjustment and Hybrid adaptation beaconing techniques. The comparative study of the paper compares the representatives of adaptive beaconing approaches in terms of their objective of study, summary of their study, the utilized simulator and the type of vehicular scenario. Finally, we discussed the open issues and research directions related to VANET adaptive beaconing approaches.Ghafoor, KZ.; Lloret, J.; Abu Bakar, K.; Sadiq, AS.; Ben Mussa, SA. (2013). Beaconing Approaches in Vehicular Ad Hoc Networks: A Survey. Wireless Personal Communications. 73(3):885-912. doi:10.1007/s11277-013-1222-9S885912733ITS-Standards (1996) Intelligent transportation systems, U.S. Department of Transportation, http://www.standards.its.dot.gov/about.aspCheng, L., Henty, B., Stancil, D., Bai, F., & Mudalige, P. (2005). Mobile vehicle-to-vehicle narrow-band channel measurement and characterization of the 5.9 Ghz dedicated short range communication (DSRC) frequency band. IEEE Transactions on Selected Areas in Communications, 25(8), 1501–1516.van Eenennaam, E., Wolterink, K., Karagiannis, G., & Heijenk, G. (2009). Exploring the solution space of beaconing in vanets. In Proceedings of the 2009 IEEE international vehicular networking conference, Tokyo (pp. 1–8).Torrent-Moreno, M. (2007). Inter-vehicle communications: Assessing information dissemination under safety constraints. In Proceedings of the 2007 IEEE conference wireless on demand network systems and services, Austria (pp. 59–64).Lloret, J., Canovas, A., Catalá, A., & Garcia, M. (2012). Group-based protocol and mobility model for vanets to offer internet access. Journal of Network and Computer Applications 2224–2245 doi: 10.1016j.jnca.2012.02.009 .Nzouonta, J., Rajgure, N., Wang, G., & Borcea, C. (2009). Vanet routing on city roads using real-time vehicular traffic information. IEEE Transactions on Vehicular Technology, 58(7), 3609–3626.Fukui, R., Koike, H., & Okada, H. (2002). Dynamic integrated transmission control(ditrac) over inter-vehicle communications. In Proceedings of the 2002 IEEE vehicular technology conference, Birmingham (pp. 483–487).Schmidt, R., Leinmuller, T., Schoch, E., Kargl, F., & Schafer, G. (2010). Exploration of adaptive beaconing for efficient intervehicle safety communication. IEEE Network, 24(1), 14–19.Ghafoor, K., Bakar, K., van Eenennaam, E., Khokhar, R., Gonzalez, A. A fuzzy logic approach to beaconing for vehicular ad hoc networks, Accepted for publication in Telecommunication Systems Journal.Ghafoor, K., & Bakar, K. (2010). A novel delay and reliability aware inter vehicle routing protocol. Network Protocols and Algorithms, 2(2), 66–88.Mittag, J., Thomas, F., Härri, J., & Hartenstein, H. (2009). A comparison of single-and multi-hop beaconing in vanets. In Proceedings of the 2009 ACM international workshop on vehicular internetworking, Beijing (pp. 69–78).Sommer, C., Tonguz, O., & Dressler, F. (2010). Adaptive beaconing for delay-sensitive and congestion-aware traffic information systems. In Proceedings of the 2010 IEEE international vehicular networking conference (VNC), New Jersey (pp. 1–8).Guan, X., Sengupta, R., Krishnan, H., & Bai, F. (2007). A feedback-based power control algorithm design for vanet. In Proceedings of the 2007 IEEE international conference on mobile networking for vehicular environments, USA (pp. 67–72).AL-Hashimi, H., Bakar, K., & Ghafoor, K. (2011). Inter-domain proxy mobile ipv6 based vehicular network. Network Protocols and Algorithms, 2(4), 1–15.Rawat, D., Popescu, D., Yan, G., & Olariu, S. (2011). Enhancing vanet performance by joint adaptation of transmission power and contention window size. Transactions on Parallel and Distributed Systems, 22(9), 1528–1535.European-ITS (2009) Eits-technical report 102 638 v1.1.1, European Telecommunications Standards Institute (ETSI), http://www.etsi.org/WebSite/homepage.aspxNHTSA, I. Joint program office”, report to congress on the national highway traffic safety administration its program, program progress during 1992–1996 and strategic plan for 1997–2002, US Department of Transportation, Washington, DC.Godbole, D., Sengupta, R., Misener, J., Kourjanskaia, N., & Michael, J. (1998). Benefit evaluation of crash avoidance systems. Transportation Research, 1621(1), 1–9.Reinders, R., van Eenennaam, M., Karagiannis, G., & Heijenk, G. (2004). Contention window analysis for beaconing in vanets. In Proceedings of the 2011 IEEE international conference on wireless communications and mobile computing (IWCMC), Istanbul (pp. 1481–1487).Yang, L., Guo, J., & Wu, Y. (2008). Channel adaptive one hop broadcasting for vanets. In Proceedings of the 2008 IEEE international conference on intelligent transportation systems, Beijing (pp. 369–374).Tseng, Y., Ni, S., Chen, Y., & Sheu, J. (2002). The broadcast storm problem in a mobile ad hoc network. Wireless Networks, 8(2), 153–167.van Eenennaam, E. M., Karagiannis, G., & Heijenk, G. (2010). Towards scalable beaconing in vanets. In Proceedings of the 2010 ERCIM workshop on eMobility, Lulea (pp. 103–108).Ros, F., Ruiz, P., & Stojmenovic, I. (2012). Acknowledgment-based broadcast protocol for reliable and efficient data dissemination in vehicular ad-hoc networks. IEEE Transactions on Mobile Computing, 11(1), 33–46.Torrent-Moreno, M., Santi, P., & Hartenstein, H. (2006). Distributed fair transmit power adjustment for vehicular ad hoc networks. In Proceedings of the 2007 IEEE international conference on sensor and ad hoc communications and networks, Reston, VA (pp. 479–488).Artimy, M. (2007). Local density estimation and dynamic transmission-range assignment in vehicular ad hoc networks. IEEE Transactions on Intelligent Transportation Systems, 8(3), 400–412.Caizzone, G., Giacomazzi, P., Musumeci, L., & Verticale, G. (2005). A power control algorithm with high channel availability for vehicular ad hoc networks. In Proceedings of the 2005 IEEE international conference on communications, Seoul (pp. 3171–3176).Torrent-Moreno, M., Santi, P., & Hartenstein, H. (2009). Vehicle-to-vehicle communication: Fair transmit power control for safety critical information. IEEE Transaction for Vehicular Technology, 58(7), 3684–3703.Torrent-Moreno, M., Schmidt-Eisenlohr, F., Fubler, H., & Hartenstein, H. (2006). Effects of a realistic channel model on packet forwarding in vehicular ad hoc networks. In Proceedings of the 2007 IEEE conference on wireless communications and networking, USA (pp. 385–391).NS, Network simulator (June 2011). http://nsnam.isi.edu/nsnam/index.php/MainPageNakagami, M. (1960). The m-distribution: A general formula of intensity distribution of rapid fadinge. In W. C. Hoffman (Ed.), Statistical method of radio propagation. New York: Pergamon Press.Narayanaswamy, S., Kawadia, V., Sreenivas, R., & Kumar, P. (2002). Power control in ad-hoc networks: Theory, architecture, algorithm and implementation of the compow protocol. In Proceedings of the 2002 European wireless conference next generation wireless networks: technologies, protocols, Italy (pp. 1–6).Cheng, P., Lee, K., Gerla, M., & Harri, J. (2010). Geodtn+ nav: Geographic dtn routing with navigator prediction for urban vehicular environments. Mobile Networks and Applications, 15(1), 61–82.Gomez, J., & Campbell, A. (2004). A case for variable-range transmission power control in wireless multihop networks. In Proceedings twenty-third annual joint conference of the IEEE computer and communications societies, Hong kong (pp. 1425–1436).Ramanathan, R., & Rosales-Hain, R. (2000). Topology control of multihop wireless networks using transmit power adjustment. In Proceedings nineteenth annual joint conference of the IEEE computer and communications societies, Hong kong (pp. 404–413).Artimy, M., Robertson, W., & Phillips, W. (2005). Assignment of dynamic transmission range based on estimation of vehicle density. In Proceedings of the 2nd ACM international workshop on vehicular ad hoc networks, Germany (pp. 40–48).Samara, G., Ramadas, S., & Al-Salihy, W. (2010). Safety message power transmission control for vehicular ad hoc networks. Computer Science, 6(10), 1027–1032.Rezaei, S., Sengupta, R., Krishnan, H., Guan, X., & Student, P. (2008). Adaptive communication scheme for cooperative active safety system.Rezaei, S., Sengupta, R., Krishnan, H., & Guan, X. (2007). Reducing the communication required by dsrc-based vehicle safety systems. In Proceedings of the 2007 IEEE international conference on intelligent transportation systems, Bellevue, WA (pp. 361–366).Sommer, C., Tonguz, O., & Dressler, F. (2011). Traffic information systems: Efficient message dissemination via adaptive beaconing. IEEE Communications Magazine, 49(5), 173–179.Thaina, C., Nakorn, K., & Rojviboonchai, K. (2011). A study of adaptive beacon transmission on vehicular ad-hoc networks. In Proceeding of the 2011 IEEE 13th international conference on communication technology (ICCT), Vancouver (pp. 597–602).Boukerche, A., Rezende, C., & Pazzi, R. (2009). Improving neighbor localization in vehicular ad hoc networks to avoid overhead from periodic messages. In Proceedings of the 2009 IEEE global telecommunications conference, USA (pp. 1–6).Bai, F., Sadagopan, N., & Helmy, A. (2008). Important: A framework to systematically analyze the impact of mobility on performance of routing protocols for adhoc networks. In Proceedings of the 2003 22th annual joint conference of the IEEE computer and communications, USA (pp. 825–835).Nguyen, H., Bhawiyuga, A., & Jeong, H. (2012). A comprehensive analysis of beacon dissemination in vehicular networks. In Proceedings of the 75th IEEE vehicular technology conference, Korea (pp. 1–5).Djahel, S., & Ghamri-Doudane, Y. (2012). A robust congestion control scheme for fast and reliable dissemination of safety messages in vanets. In Proceeding of the 2012 IEEE conference wireless communications and networking, Paris, France (pp. 2264–2269).O. Technologies (Augast 2012) Opnet modeler, http://www.opnet.com/Huang, C., Fallah, Y., Sengupta, R., & Krishnan, H. (2010). Adaptive intervehicle communication control for cooperative safety systems. IEEE Network, 24(1), 6–13.OPNET (June 2012) Opnet modeler, http://www.opnet.com/Kerner, B. (2004). The physics of traffic: Empirical freeway pattern features, engineering applications, and theory. Berlin: Springer.Vinel, A., Vishnevsky, V., & Koucheryavy, Y. (2008). A simple analytical model for the periodic broadcasting in vehicular ad-hoc networks. In Proceedings of the 2008 IEEE international GLOBECOM workshops, Philadelphia, PA (pp. 1–5).Mariyasagayam, N., Menouar, H., & Lenardi, M. (2009). An adaptive forwarding mechanism for data dissemination in vehicular networks. In Proceedings of the 2009 IEEE Vehicular Networking Conference, Boston (pp. 1–5).Hung, C., Chan, H., & Wu, E. (2008). Mobility pattern aware routing for heterogeneous vehicular networks. In Proceedings of the 2008 international conference on wireless communications and networking, Las Vegas (pp. 2200–2205).Yang, K., Ou, S., Chen, H., & He, J. (2007). A multihop peer-communication protocol with fairness guarantee for ieee 802.16-based vehicular networks. IEEE Transactions on Vehicular Technology, 56(6), 3358–3370.Lequerica, I., Ruiz, P., & Cabrera, V. (2010). Improvement of vehicular communications by using 3G capabilities to disseminate control information. IEEE Network Magazine, 24(1), 32–38.Oh, D., Kim, P., Song, J., Jeon, S., & Lee, H. (2005). Design considerations of satellite-based vehicular broadband networks. IEEE Wireless Communications Magazine, 12(5), 91–97.Ko, Y., Sim, M., & Nekovee, M. (2006). Wi-fi based broadband wireless access for users on the road. BT Technology Journal, 24(2), 123–129.Choffnes, D., & Bustamante, F. (2005). An integrated mobility and traffic model for vehicular wireless networks. In Proceedings of the 2005 ACM international workshop on vehicular ad hoc networks, Cologne (pp. 69–78).TIGER (October 2010) Topologically integrated geographic encoding and referencing system, http://www.census.gov/geo/www/tiger/Mittag, J., Thomas, F., Harri, J., & Hartenstein, H. (2009). A comparison of single and multi-hop beaconing in vanets. In Proceedings of the 2009 ACM international workshop on vehiculaar internetworking, Beijing (pp. 69–78).Rappaport, T. (1996). Wireless communications: Principles and practice (2nd ed.). New Jersey: Prentice Hall PTR