Mobility information estimation algorithm using Kalman-filter for vehicular ad hoc networks
by Fuad A. Ghaleb; Anazida Zainal; Murad A. Rassam
International Journal of Information and Computer Security (IJICS), Vol. 8, No. 3, 2016

Abstract: In vehicular networks, the exchange of mobility information is considered as the basis for many applications. The quality of this information affects applications and networks performance. False mobility information leads applications, network services and security services to make wrong decisions. Accordingly, many verification approaches were proposed as a security countermeasure. However, most of these approaches assume accurate mobility information regardless of localisation errors occurrence. Therefore, estimating the mobility information is an important security procedure to enhance the verification performance. In this paper, mobility information estimation algorithm (MIEA) was proposed based on Kalman filter to estimate the actual mobility information from noisy measurements. To evaluate the algorithm effectiveness, the study used next generation simulation dataset (NGSIM). White noises were injected into vehicle trajectories to simulate localisation errors. Results show that the root mean square error (RMSE) is reduced which implies the effectiveness of the proposed algorithm.

Online publication date: Wed, 21-Sep-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Computer Security (IJICS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com