Abstract
In roadside gateway (RG) based vehicle ad hoc networks, the vehicles have difficulty in maintaining a stable route to the RG due to their high mobility. In addition, the redundant transmissions of an RG advertisement message transmitted to inform vehicles of the presence of RG can cause high control overhead. A new gateway discovery approach using tree topology is proposed to reduce control overhead as well as to cope with the high mobility of vehicles. The proposed approach employs the notion of connected dominating set (CDS) such that all nodes can receive the advertisement message if every vehicle in the CDS retransmits the message once. A prediction function of link persistence time is used in building the CDS, which replaces the node Id as primary key, to increase the stability of the route from each vehicle to an RG. The proposed protocol was evaluated comparatively with the traditional approaches, by resorting to simulation with various mobility scenarios generated by the VanetMobisim tool.
This research was supported by 2013 Special Research Fund of Electrical Engineering at University of Ulsan.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ba, A.A., Hafid, A., Drissi, J.: Broadcast Control-Based Routing Protocol for Internet Access in VANETS. In: Wireless Communications and Mobile Computing Conference (IWCMC), pp. 1766–1771 (2011)
Boukerche, A., Abrougui, K., Pazzi, R.W.N.: Location-aided gateway advertisement and discovery protocol for VANets: Proof of correctness. In: The 34th Annual IEEE Conference on Local Computer Networks, pp. 778–785 (2009)
Bechler, M., Wolf, L., Storz, O., Franz, W.J.: Efficient discovery of Internet gateways in future vehicular communication systems. In: Vehicular Technology Conference, pp. 965–969 (2003)
Ruiz, P.M., Gomez-Skarmeta, A.F.: Adaptive gateway discovery mechanisms to enhance internet connectivity for mobile ad hoc networks. Ad Hoc and Sensor Wireless Networks 1, 159–177 (2005)
Ratanchandani, P., Kravets, R.: A hybrid approach to Internet connectivity for mobile ad hoc networks. In: Proceedings of the International Conference on Wireless Communications and Networking (WCNC), pp. 1522–1527 (2003)
Wu, J.: Dominating-set-based routing in ad hoc wireless networks. In: Handbook of Wireless Networks and Mobile Computing, pp. 425–450. John Wiley & Sons, Inc. (2002)
Benslimane, A., Barghi, S., Assi, C.: An efficient routing protocol for connecting vehicular networks to the Internet. Pervasive and Mobile Computing 7, 98–113 (2011)
Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. (1990)
Su, W., Lee, S.-J., Gerla, M.: Mobility prediction and routing in vehicular ad-hoc wireless networks. Int. J. Netw. Manag. 11, 3–30 (2001)
Jerome, H., Fethi, F., Bonnet, C.: On Meaningful Parameters for Routing in VANETs Urban Environments under Realistic Mobility Patterns. In: Proceedings of the 1st IEEE Workshop on Automotive Networking and Applications, AutoNet 2006 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ngo, C.T., Oh, H. (2013). A Gateway Discovery Approach Using Link Persistence Based Connected Dominating Sets for Vehicular Ad Hoc Networks. In: Cichoń, J., Gȩbala, M., Klonowski, M. (eds) Ad-hoc, Mobile, and Wireless Network. ADHOC-NOW 2013. Lecture Notes in Computer Science, vol 7960. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39247-4_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-39247-4_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39246-7
Online ISBN: 978-3-642-39247-4
eBook Packages: Computer ScienceComputer Science (R0)Springer Nature Proceedings Computer Science