Open Access Open Access  Restricted Access Subscription or Fee Access

Gateways’ Mobility Increases the Capacity of Communication in VANETs: Routing Algorithm Based on Congestion Game


(*) Corresponding author


Authors' affiliations


DOI: https://doi.org/10.15866/irecos.v9i8.2964

Abstract


Vehicular Ad Hoc Network (VANET) is considered as a special application of Mobile Ad Hoc Networks in road traffic, which can autonomously organize networks without infrastructure. VANETs enable vehicles on the road to communicate with each other and with road infrastructure using wireless capabilities. In the last few years, extensive research provided several routing algorithms to extend Internet connectivity to VANETs through fixed gateways installed along the road. However, most of these algorithms have not been effective because of the high mobility of vehicles in the road.
In this paper, we propose a routing algorithm which based both on the congestion game to resolve the problem of network congestion and on mobile gateways to resolve the problem of high mobility in VANET. Therefore, the proposed algorithm is a prediction done by each node in the network that helps them to reach the optimal route to access Internet. Simulation results validate the algorithm and show its robustness under two scenarios. In the first one, we examine the algorithm with fixed gateways installed along the road to validate the connectivity to the Internet. Whilst in the second scenario, we examine the algorithm with mobile gateways to show the effectiveness of gateways’ mobility on the capacity of communication and the Internet access in VANETs.
Copyright © 2014 Praise Worthy Prize - All rights reserved.

Keywords


VANET; Congestion Game; Routing; Mathematical Model; Learning Algorithm; Fixed Gateway; Mobile Gateway

Full Text:

PDF


References


S. Kumar, K. Narayan, J. Kumar, Qualitative based comparison of routing protocols for vanet, Journal of Information Engineering and Applications, Vol. 1, no. 4, pp. 13–17, 2011.

F. Hui, A survey on the characterization of vehicular ad hoc networks routing solutions, in ECS, Vol. 257, 2005, 1–15.

Y. Z. Yunpeng Zang et al, Opportunistic wireless internet access in vehicular environments using enhanced wave devices, International Journal of Hybrid Information Technology (IJHIT), Vol. 1, no. 2, pp. 83–100, 2008.

D. Wu, Y. Ling, H. Zhu, and J. Liang, The RSU access problem based on evolutionary game theory for VANET, International Journal of Distributed Sensor Networks, Vol. 2013, 2013.
http://dx.doi.org/10.1155/2013/143024

E. Pertovt, T. Javornik, and M. Mohorˇciˇc, Game theory application for performance optimisation in wireless networks.

T. Clausen, P. Jacquet, C. Adjih, A. Laouiti, P. Minet, P. Muhlethaler, A. Qayyum, L. Viennot et al., Optimized Link State Routing protocol (OLSR), 2003.
http://dx.doi.org/10.1109/inmic.2001.995315

M. GERLS, Fisheye State Routing (FSR) for ad hoc networks, Internet Draft, draft-ietf-manet-fsr-03. txt, 2002.

C. Perkins, E. Belding-Royer, and S. Das, Ad hoc On Demand distance Vector (AODV) routing, (rfc 3561), IETF MANET Working Group (August. 2003), 2003.

D. B. Johnson, D. A. Maltz, J. Broch et al., DSR: The Dynamic Source Routing protocol for multi-hop wireless ad hoc networks, Ad hoc networking, Vol. 5, pp. 139–172, 2001.

N. Beijar, Zone Routing Protocol (ZRP), Networking Laboratory, Helsinki University of Technology, Finland, 2002.

Rhattoy, A., Zatni, A., Performance evaluation of OLSR and AODV routing protocols in VANETs urban area, (2013) International Review on Computers and Software (IRECOS), 8 (7), pp. 1711-1717.

D. E. Charilas and A. D. Panagopoulos, A survey on game theory applications in wireless networks, Computer Networks, Vol. 54, no. 18, pp. 3421–3430, 2010.
http://dx.doi.org/10.1016/j.comnet.2010.06.020

E. Altman, G. Neglia, F. De Pellegrini, and D. Miorandi, Decentralized stochastic control of delay tolerant networks, in INFOCOM 2009, (IEEE, 2009, 1134–1142).

E. Altman, Competition and cooperation between nodes in delay tolerant networks with two hop routing, in Network Control and Optimization. (Springer, 2009, 264–278).
http://dx.doi.org/10.1007/978-3-642-00393-6

D. Niyato, P. Wang, W. Saad, and A. Hjorungnes, Coalition formation games for improving data delivery in delay tolerant networks, in Global Telecommunications Conference (GLOBECOM 2010), (IEEE, 2010, 1–5).

M. Naserian and K. Tepe, Game theoretic approach in routing protocol for wireless ad hoc networks, Ad Hoc Networks, Vol. 7, no. 3, pp. 569–578, 2009.
http://dx.doi.org/10.1016/j.adhoc.2008.07.003

T. Chen et al, Stimulating cooperation in vehicular ad hoc networks: a coalitional game theoretic approach, Vehicular Technology, IEEE Transactions on, Vol. 60, no. 2, pp. 566–579, 2011.

D. Wu, J. Cao, Y. Ling, J. Liu, and L. Sun, Routing algorithm based on multi-community evolutionary game for vanet, Journal of Networks, Vol. 7, no. 7, pp. 1106–1115, 2012.
http://dx.doi.org/10.4304/jnw.7.7.1106-1115

D. Monderer and L. S. Shapley, Potential games, Games and economic behavior, Vol. 14, no. 1, pp. 124–143, 1996.
http://dx.doi.org/10.1006/game.1996.0044

H. Tembine, Distributed strategic learning for wireless engineers. CRC Press, 2012.
http://dx.doi.org/10.1201/b11896


Refbacks

  • There are currently no refbacks.



Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2024 Praise Worthy Prize