Study Guides, Notes, & Quizzes

A Peer to Peer Based Information Sharing Scheme in Vehicular Ad Hoc Networks

Description
Information sharing among vehicles is one of the emergent issues in Vehicular Ad Hoc Networks (VANETs). Considering the mobility and limited connectivity of the nodes, designing a secure scalable architecture for information sharing is a challenging
Published
of 3
All materials on our website are shared by users. If you have any questions about copyright issues, please report us to resolve them. We are always happy to assist you.
Related Documents
Share
Transcript
  See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/221422727 A Peer to Peer Based Information SharingScheme in Vehicular Ad Hoc Networks Conference Paper  · January 2010 DOI: 10.1109/MDM.2010.74 · Source: DBLP CITATIONS 14 READS 85 1 author: Neelanjana DuttaMissouri University of Science and Technology 6   PUBLICATIONS   39   CITATIONS   SEE PROFILE All content following this page was uploaded by Neelanjana Dutta on 21 December 2016. The user has requested enhancement of the downloaded file.  A Peer to PeScheme in Miss   Abstract  -Information sharing among emergent issue in Vehicular Ad (VANETs). Considering the mobilityconnectivity of the nodes in a typical VAscalable schemes for information sharinIn this paper, we propose a distribut(P2P) based architecture for informatVANETs. We split the entire vehiculageographically unique zones and use cotechniques to map the nodes and the unique identifiers in Distributed Hash hence providing scalable look-up serwork aims to develop scalable roreplication and handover managememobility.    Keywords- VANET; peer-to-peer; distrib I.   INTRODUCTI In this paper, we present prelimidesigning efficient and scalable information sharing in Vehicular Ad (VANETs). Information sharing is recognized as a critical service in emer [1, 2], where the shared informatiomultitude of forms like music files, vievent tickets etc. Unfortunately, in vehicular network with thousands of distributed nodes with dynamic moinformation sharing can be quite challeConsider Figure 1, where in a city Car  A  in one part of the network r   Hello.mp3 . It so happens that Car geographic part of the network has twilling to share it. Clearly, naïve a broadcast based request-responses are this case, primarily due to the sheer nuand rapid mobility in VANETs. Odesign of an efficient and scalable information sharing in such scenarios. r based Information Shehicular Ad Hoc Netw  Neelanjana Dutta Computer Science Department ouri University of Science and Technology Rolla, Missouri 65401, USA nd2n8@mst.edu vehicles is an oc Networks and limited ET, designing is challenging. d peer-to-peer ion sharing in network into sistent hashinginformation to Table (DHT), ices. Ongoing ting schemes, t under node ted hash table N nary ideas on schemes for   Hoc Networks slowly being ging VANETs n can take a deos, coupons, a large scale geographically ility patterns, ging. wide VANET, equests a file  B  in another is file and is  proaches like un-scalable in mber of nodes r goal is the technique for In this paper, we propose aapproach to attain our goal. approach is to design a scalable a scheme that synchronizes infor any requestor with the location provider, via the design of a contechnique implemented on VAN Fig 1. Information sharing in a c Consistent hashing   and  Distri Consistent hashing provides lo based on hash tables in a way removal of one node (or a slot) dchange the mapping of data iteThe consistent hash function caassigning each node and key an a base hash function such as SHmaintains information regardinclosest to its zone in its information content uniformlyscalability can be achieved in using distributed hash tables sto[5]. DHT also pertains to thetolerance of the network as nocomplete information of the net   aring rks  peer-to-peer based he premise of our nd efficient look-up ation requests from information of the istent hashing based Ts. ity road network uted Hash Table  – k-up functionalities that the addition or oes not significantly s to other slots [3].  be implemented by -bit identifier using -1 [4]. A node only data items hashed ash table, making distributed. Thus P2P based systems ed at various nodes  privacy and fault e of the nodes has ork.   Eleventh International Conference on Mobile Data Management 978-0-7695-4048-1/10 $26.00 © 2010 IEEEDOI 10.1109/MDM.2010.74309  II.   OUR APPROA  A. Building the Hash Table - In thdiscuss our look-up scheme in VANconsistent hashing. In the proposed divide the VANET into geographicallyFor example, different zip codes can unique zones. Each vehicle which is VANET will construct a hash table tZip Code (  Z  i ) to an unique m-bit iusing a function like SHA-1. Figurepresentative example of the scenaVANET is divided into 5 unique zondifferent Zip Codes 63044, 63112, 63163146  . The zones are hashed in tcorresponding identifiers such a  H(63146)  etc. in an identifier circle mo m=4 . Fig 2. Representative Hash Table with 5 Zip  Hello.mp3   Referring back to Figure 1, say CCode 63112  and it has the file  Hello. willing to share. So Car  B  hashes  He same table as shown in Figure 2. Let  position of  H(Hello.mp3)  is such that succeeding zone entry in the table is call Zone 63114  as the successor  Hello.mp3 .  B. Constructing DHTs for Look-up Se successor of  Hello.mp3  is found, Car any vehicle in Zip Code 63114  to maifor  Hello.mp3  and its location, Zone 6  DHT (Figure 3). Hello.mp3 Zo Fig 3. DHT of a vehicle in Zone 63112 hol  Hello.mp3 and its location C. P2P based Protocol for Query Driv Retrieval-  Consider that Car  A  in Figu 63044  and it seeks the file  Hello.mp3 . H s section, we ETs based on approach, we unique zones. e divided into a part of the at maps each entifier  H(Z  i  ) , e 2 shows a io, where the es based on 5 32, 63114 and e table using s  H(63044) , dulo 2 m  where Codes and file ar  B  is in Zip  p3  which it is llo.mp3  to the us assume the the immediate  H(63114) . We of the item vice-  Once the  B  will request ntain the entry 112  in its own ne 63112 ing entry for   en Information e 1 is in Zone We propose a P2P based information retriretrieving the requested file. Step 1.  The requestor, Car  A , haits hash table. Step 2. When Car  A  identifies thsuccessor of  Hello.mp3 from forwards a look-up request to vehicle to vehicle communicatio Step 3.  The request will be br   Zone   63114 , and the car with the will   forward the location of Zone 63112,  to the requestor usicommunication. Step 4.  Car  A  routes the request t Step 5. When the request reache broadcasted, Car  B  routes  Hel  requestor. III.   FUTURE The strength of the proposed s purely distributed and scalabledesigning a scalable routing pquery and the requested informatthe right vehicle containing tchallenge. We also intend to replication technique for faster iSince the vehicles can join or lany point, and might move from over time, it is essential to buildvehicles leaving a zone to handoits peers in the zone. Therefore management is part of our future REFERENCE [1] S. Lee, G. Pan, J. Park, M. Gerla, for Commencial Ad Dissemination In Proc. of MobiHoc, 2007. [2] Y. Zhang, J. Zhao, G. Cao, “Roadcontent Sharing Scheme in VANE2009. [3] D. Karger, E. Lehman, F. Leighton,Panigrahy, “Consistent hashing and caching protocols for relieving hot Web,” In Proc. of the 29th AonTheory of Computing, 1997, TX, [4] FIPS 180-1. Secure Hash StandaCommerce/NIST, National Techni1995, VA. [5] I. Stoica, R. Morris, D. Karger Balakrishnan, “Chord: A scalable pfor Internet Applications,” In Proc. 149–160. eval protocol for shes  Hello.mp3  into t   Zone 63114  is the its hash table, it Zone 63114  using only. adcasted to cars in corresponding entry ello.mp3 , which   is g vehicle to vehicle Zone 63112 . Zone 63112 , and is o.mp3  back to the ORK olution is that it is . Our next step is otocol to route the on. Also identifying e information is a ropose an efficient formation retrieval. eave the network at one zone to another up a policy for the er its information to mobility based data work. S . Lu, “Secure Incentives in Vehicular Networks,” ast: A Popularity Aware Ts,” In Proc. of ICDCS, M. Levine, D. Lewin, R. random trees: Distributed spots on the World Wide nual ACM Symposium  pp. 654–663. rd. U.S. Department of cal Information Service, , M. F. Kaashoek, H. er-to-peer lookup service of SIGCOMM, 2001, pp.   310 View publication statsView publication stats
Search
Tags
Related Search
We Need Your Support
Thank you for visiting our website and your interest in our free products and services. We are nonprofit website to share and download documents. To the running of this website, we need your help to support us.

Thanks to everyone for your continued support.

No, Thanks