IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v10y2014i3p650923.html
   My bibliography  Save this article

Social Group Architecture Based Distributed Ride-Sharing Service in VANET

Author

Listed:
  • Weicheng Zhao
  • Yajuan Qin
  • Dong Yang
  • Linjuan Zhang
  • Wanting Zhu

Abstract

Lots of traditional distributed ride-sharing services match vehicles with drivers and passengers geographic information only. When urban road congestion situation is particularly serious, such as Beijing's rush hour, the waiting time for the passengers is too long which affects the quality of the service. So we propose a distributed ride-sharing service based on dual Social Group Architecture (SGA). We divide the service into Drivers Social Group Architecture (DSGA) message and Vehicles Social Group Architecture (VSGA) message. Vehicles generate dual SGA messages to complete ride-sharing service. DSGA messages focus on the relation between drivers and passengers. We make a basic geometry matching by generating the DSGA messages. VSGA messages figure out the traffic conditions through a multilevel detection. After generating VSGA messages, the final matching strategy is processed. The low level detection is finished by the limited neighbors to decrease the network consume. Dual SGA messages shorten the waiting time for the passengers and avoid traffic jams. Analysis shows that our scheme enhances the ride-sharing service quality and robust.

Suggested Citation

  • Weicheng Zhao & Yajuan Qin & Dong Yang & Linjuan Zhang & Wanting Zhu, 2014. "Social Group Architecture Based Distributed Ride-Sharing Service in VANET," International Journal of Distributed Sensor Networks, , vol. 10(3), pages 650923-6509, March.
  • Handle: RePEc:sae:intdis:v:10:y:2014:i:3:p:650923
    DOI: 10.1155/2014/650923
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/650923
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/650923?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:10:y:2014:i:3:p:650923. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.