An efficient geo-aware peer-to-peer resource discovery and sharing scheme in vehicular ad-hoc networks
by Chyi-Ren Dow; Pei-Jung Lin; Yu-Hong Lee; Ya-Chen Lin; Shiow-Fen Hwang
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 14, No. 4, 2013

Abstract: There has been a recent increase in research on vehicular ad-hoc network (VANET) technology. Peer-to-peer (P2P) systems have also been widely used for resource sharing. This paper proposes an efficient geo-aware P2P search mechanism to enable resource discovery and sharing on VANETs. The proposed discovery and sharing schemes are based on virtual backbone architecture. The schemes limit the data-exchanging region to reduce unnecessary message transmissions. They establish coordinators to store information and manage local resource information. If more vehicles own the resources, the user has more opportunities to discover and obtain the resources. Three piece selection mechanisms, nearest-first, rarest-first and in-order, are proposed to download resource pieces from other vehicles and to improve the dissemination efficiency speed at which resources piece to networks. Experimental results demonstrate that the searching and sharing schemes are efficient and outperform other schemes in terms of satisfactory ratio and download time.

Online publication date: Wed, 01-Jan-2014

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 Ad Hoc and Ubiquitous Computing (IJAHUC):
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