Using Security Context Pre-Transfer to Provide Security Handover Optimization for Vehicular Ad Hoc Networks

Xue, Kaiping; Hong, Peilin; Tie, Xiaolei

doi:10.1109/vetecf.2010.5594521

Cited by 4 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [15], a VFHS mechanism is proposed, which use the AP physical and MAC layer information from the oncoming vehicle to reduce the handover delay. In [16], it is pointed out that when vehicles travel from coverage of RSUm to another RSUn, they need to re-secure the authentication. RSUm transmits the vehicles' authentication messages to RSUn in advance to shorten the time for authentication as well as handover delay.…”

Section: Related Workmentioning

confidence: 99%

Game Approach for Handover Scheme Based on Road-section in VANET

Wu¹,

Liang²

2014

JCP

View full text Add to dashboard Cite

In VANET (Vehicular Ad Hoc Network), vehicles moving from one RSU's coverage region to another will cause access congestion problem if vehicles use improper handover scheme. In this paper, we present a novel mobility handover scheme for vehicles with seamless Internet access in urban VANET scenario, which is called Game approach for Handover Scheme based on Road-section (GHSR). The main advantages of our scheme are that it uses Sequential Game and it based on 802.11p standard proceeding from service and the vehicles needing to handover will game each other to gain no smaller payoff by selecting an appropriate road-section. Performance evaluations demonstrate that our scheme outperforms the threshold scheme significantly in terms of both the traffic load of RSUs and the QoS (Quality of Service) of vehicles users, and QoS of vehicle users increase by up to 33.68%. Index Terms-Urban VANET; Sequential Game; Handover I. INTRODUCTION VANET is a special Mobile Ad Hoc Networks (MANET), which consists of the Infrastructures (Road Side Units, RSUs) and vehicles equipped with Onboard Units (OBUs) that provide the basic wireless communication capability. VANET is characterized by high speed mobile users and frequent network topology change. In recent years, with the deployment of RSUs, many researchers consider using 802.11p standard to realize the interaction between vehicles and Internet by accessing to RSUs, whose feasibility is confirmed [1]. In VANET, based on some communications protocols specially designed for VANET, such as [2], the communication usually occurs among Vehicles (Vehicleto-Vehicle, V2V), or between Vehicle and Infrastructure (Vehicle-to-RSU, V2R) [3]. When services are being provided by RSUs, seamless handover is desired for continuous connectivity to provide uninterrupted service when the vehicle moves from one RSU's region to another, as seen in Fig. 1. Under the IEEE802.11p, the handover progress removes the identification and interaction of wireless networks, such as Wi-Fi and so on, since IEEE802.11p is a protocol for VANETs that is designed for communication during high-speed mobility (up to 200 km/h) among vehicles or between vehicles and RSUs with a range of up to 1,000m [18]. In addition, few vehicles can provide or share their own service to others, in VANET. Therefore, in order to guarantee vehicles to

show abstract

Section: Related Workmentioning

confidence: 99%

Game Approach for Handover Scheme Based on Road-section in VANET

Wu¹,

Liang²

2014

JCP

View full text Add to dashboard Cite

show abstract

“…, and . Moreover, and in [29][30] where denotes the time for an inverse operation computation. We assume that .…”

Section: Performance Evaluationmentioning

confidence: 99%

Secure Convertible Undeniable Signature Scheme Using Extended Euclidean Algorithm without Random Oracles

2013

KSII TIIS

View full text Add to dashboard Cite

A convertible undeniable signature requires a verifier to interact with the signer to verify a signature and furthermore allows the signer to convert a valid one to publicly verifiable signature. In 2007, Yuen et al. proposed a convertible undeniable signature without random oracles in pairings. However, it is recently shown that Yuen et al.'s scheme is not invisible for the standard definition of invisibility. In this paper, we propose a new improvement by using extended Euclidean algorithm that can overcome the visibility attack. The proposed scheme has been evaluated based on computation and communication complexities and the performance comparisons of Yuen et al.'s scheme and various convertible undeniable signature schemes are provided. Moreover, it has been observed that the proposed algorithm reduces the computation and communication times significantly.

show abstract