Ticket-Based Fast Handover Authentication Protocol for Wireless Sensor Networks

Ticket-Based Fast Handover Authentication Protocol for Wireless Sensor Networks

D. Sathish Kumar (Anna University Chennai, Chennai, Tamil Nadu, India), N. Nagarajan (Coimbatore Institue of Engineering and Technology, Coimbatore, Tamil Nadu, India) and S. Asifa Begum (Nehru Institute of Technology, Coimbatore, Tamil Nadu, India)
DOI: 10.4018/ijmtie.2013100101
OnDemand PDF Download:
No Current Special Offers


Wireless sensor Network (WSN) is an emerging technology that widely used for secure communication purpose. In a fast moving world of communication obtaining service from the access point of transmission is necessary. Whenever mobile user moves from one site to another site Provision of secure handover process is a major considerable thing. In case of achieving secure handover authentication process the delay occurrences is possible in network communication. There is a conflict between security requirements and communication, computation overhead. To overcome this problem a Novel approach of Handover Mechanism is proposed namely credential Ticket based fast handover mechanism using pair hand protocols functions which resolves conflicts and reduced network latency to obtain rapid handover among access points in the network.
Article Preview

2. Literature Review

S. Pack et al. (2006) Suggested a fast handoff Scheme based on mobility Prediction in Wireless LAN systems. In this method, a mobile host entering the area that can be covered by an access point (AP) achieves authentication process for multiple APs, rather than the current access point. The main problem with this scheme is how to choose the neighboring APs to be authenticated in advance. The simplest method is to choose all of the APs adjacent to the current AP. Whreras Nasim Khazan et al. (2012) suggests that appropriate placement of network node can imporove the coverage parameter of network performance.also it optimizes the energy consumption by using hull algotithm. On the other hand, this is ineffective because it does not consider any movement patterns or the AP’s geographical location. Since a wireless LAN is a solution typically employed within an administrative network domain, centralized AP configuration and management are possible. Therefore, we present a centralized neighbour selection algorithm, called the ‘FHR selection algorithm’. If a mobile host sends an authentication request, the AAA server not only authenticates the currently used AP, but also multiple APs and sends multiple wired equivalent privacy (WEP) keys to the mobile host. The selection of multiple access points is accomplished by the frequent handoff region (FHR) selection algorithm based on mobility prediction. The frequent handoff region (FHR) selection algorithm exploits the handoff weight in each link between APs, which is composed and calculated by the centralized system.

Jaeduck Choi et al. (2010) suggested a handover authentication scheme using credentials based on chameleon hashing in the wireless networks. The key idea is that the short-term credential created by using the collision resistant hash function that is used for an authenticated ephemeral Diffie-Hellman (DH) key exchange only between a mobile node and an access point. In this method, the credential value C, which is signed with a chameleon hash value ijmtie.2013100101.m01. (m,r) that is used for mutual authentication (A. Ghosh et al., 2012) and authenticated ephemeral DH key exchange. It permits every node to newly produce an ephemeral random value for a DH secret value keeping the same credential C owing to the chameleon hash properties. The major work of this work is that this scheme achieves simple authentication architecture compared to AAA-based and SCT-based schemes; and Compared to IBC-based scheme, this method provides robust key exchange and efficiency in terms of delay time and energy consumption.

Complete Article List

Search this Journal:
Open Access Articles
Volume 7: 2 Issues (2018)
Volume 6: 2 Issues (2017)
Volume 5: 2 Issues (2015)
Volume 4: 2 Issues (2014)
Volume 3: 4 Issues (2013)
Volume 2: 4 Issues (2012)
Volume 1: 4 Issues (2011)
View Complete Journal Contents Listing