Research Article Open Access

An Efficient Hand-off Mechanism for Vehicular Networks

M. Dinakaran and P. Balasubramanie

Abstract

Problem statement: In recent times, wireless networks have become ubiquitous and the hotspot research arena. When a mobile node switches from one access network to another network, the node is said to perform a handoff. This transition is a complex and time-consuming task since after transit the mobile node has to obtain a new Care of Address (CoA) from the transited AR and bind this CoA with its home agent, apart from this there occurs a problem of packet loss. However there exist some solutions for this handoff problem, these mechanisms do not offer efficient solution for the problem. Approach: A mechanism to reduce the hand off delay in vehicular networks is proposed in this article. This approach pre allocates the new address for the mobile node before hand off based on its mobility. Results: The proposed system is implemented in ns2 simulation environment and compared with some existing hand of mechanisms and its evident that the proposed mechanism reduces the hand off delay and packet loss ratio. Conclusion: This article is concerned with defining a better solution for the handoff problem such that the proposed mechanism offers efficient results compared to the existing system.

Journal of Computer Science
Volume 8 No. 1, 2012, 163-169

DOI: https://doi.org/10.3844/jcssp.2012.163.169

Submitted On: 30 September 2011 Published On: 3 November 2011

How to Cite: Dinakaran, M. & Balasubramanie, P. (2012). An Efficient Hand-off Mechanism for Vehicular Networks. Journal of Computer Science, 8(1), 163-169. https://doi.org/10.3844/jcssp.2012.163.169

  • 3,121 Views
  • 2,763 Downloads
  • 5 Citations

Download

Keywords

  • Hand off
  • mobile networks
  • NEMO hand off
  • Internet Engineering Task Force (IETF)
  • Care of Address (CoA)
  • Network Mobility (NEMO)
  • Binding Update (BU)
  • Binding Acknowledgement (BA)