Open Access Open Access  Restricted Access Subscription or Fee Access

Optimizing OLSR Routing in VANET Using Rough Set

S. Mahalakshmi, R. Pradipa

Abstract


Infrastructure-less and Self-organized networks among vehicles are known as Vehicular ad hoc networks (VANETs). Designing efficient routing protocols for rapid topology changing environment is a major concern. Optimized Link State Routing protocol (OLSR) - link state, table driven proactive protocol uses control messages to identify the link state information everywhere in the network. Being a Proactive protocol routes to all destinations within the networks are known and maintained before use, which leads to uncertainty for the Data transmission. Due to this limitation in OLSR it is necessary to optimize the routing. In this study, to minimize the Uncertainty in OLSR routing due to the frequent change in the topology, Rough Set Theory (RST) is used. Our proposal is further validated by simulation.


Keywords


Connectivity Time, Dynamic Source Routing Protocol (DSR), Optimized Link State Routing Protocol, Rough Set Theory, Vehicular Ad hoc Networks.

Full Text:

PDF

References


. A.Loutfi and M. ElKoutbi (2012), Journal of Computer Information Systems(7:2),Enhancing Performance OLSR in MANET ,(vol 4, no 6)

. B.S.Shylaja,V.Mary Anita Rajam,V.UmaMaheswari and Arul Siromoney (2011),’Optimal next Hop Selection for Routing in VANETs based on Weighted Temporal Decision Systems’, Journal of Computer Information Systems, Vol. 7, No. 2, pp. 347-351

. Jamal Toutouh, Jose Garcia-Nieto, and Enrique Alba, (2012), Intelligent OLSR Routing Protocol Optimization for VANETs, IN PRESS

. F. Li and Y. Wang, “Routing in vehicular ad hoc networks: A survey,” Vehicular Technology Magazine, IEEE, vol. 2, no. 2, Jun. 2007. [Online]. Available: http://dx.doi.org/10.1109/MVT.2007.912927.

. J. Harri, F. Filali, and C. Bonnet, “Performance comparison of AODV and OLSR in VANETs urban environments under realistic mobility patterns,” in Med-Hoc-Net 2006, 5th Annual Mediterranean Ad Hoc Networking Workshop, S. Basagni, A. Capone, L. Fratta, and G. Morabito, Eds. IFIP, June 2006.

. T. Clausen and P. Jacquet, “Optimized Link State Routing Protocol (OLSR),” IETF RFC 3626, [online] Available in URL http://www.ietf.org/rfc/rfc3626.txt, United States, 2003.

. T. Chen, O. Mehani, and R. Boreli, “Trusted routing for VANET,” in ITST 2009, 9th International Conference on Intelligent Transport Systems Telecommunications, M. Berbineau, M. Itami, and G. Wen, Eds. Piscataway, NJ, USA: IEEE Computer Society, October 2009, pp. 647–652.

. Qayyum, A. Laouiti, L. Viennot, Multipoint relaying technique for flooding broadcast messages in mobile wireless networks, HICSS: Hawai International Conference on System Sciences, January 2002, Hawai, USA.

. F. Bai, N. Sadagopan, and A. Helmy, “IMPORTANT: A framework to systematically analyze the impact of mobility on performance of routing protocols for ad hoc networks,” in Proc. IEEE INFOCOM, San Francisco, California, USA, vol. 2, pp. 825C835. Mar. 2003.

. Nikoletta Sofra, Athanasius Gkelias, and Kin K. Leung, “Route Construction for Long Lifetime in VANETs,” IEEE Trans. Veh. Technol., Vol. 60, No. 7, pp. 3450-3461, Sep. 2011.

. Arefin, Khan, Toyoda, “Performance analysis of mobile ad-hoc network routing protocols” IEEE conference, pp. 935 - 939 ,may 2012

. V.Mary Anita Rajam,V.UmaMaheswari and Arul Siromoney, ‘Temporal Information Systems and their Application to Mobile Ad Hoc Routing’, Ubiquitous Computing and Communication Journal,Vol. 3, No. 4, pp. 417-424.

. Rodolfo, Miguel, Luis et.al “Impact of Node’s Mobility on Link-detection based on routing Hello messages” IEEE communication society, pp. 1-6, April 2010.

. Z. Pawlak (1995) ‘Vagueness and uncertainty: a rough set perspective’ Computational Intelligence: An International Journal, vol.11, pp. 227-232.

. Sathish,S, Boopathi, S. , Gavel, K.T. “Threshold based dynamic source routing in mobile ad hoc networks” IEEE conference, pp. 129-134, Dec 2011


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.