Efficient multiple-copy routing in software-defined vehicular networks

Ming Zhu, Zhiping Cai, Jiannong Cao, Ming Xu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

3 Citations (Scopus)

Abstract

Multiple-copy routing is widely used in sparse vehicular ad hoc networks (VANETs). Recently, we proposed a novel architecture named software-defined vehicular networks (SDVNs) that can provide a global view of the whole network and centralized control over vehicular switches. However, existing multiple-copy routing protocols cannot utilize the benefits of SDVNsto improve routing efficiency. In this paper, we propose a Spray-and-Prey multiple-copy routing protocol for SDVNs. The Spray-and-Prey protocol uses graph-based minimum communication hops to define the utility of carriers and utilize two copies cooperation schemes to reduce delivery delay. Further more, the proposed protocol can clear other copies in the network when one copy arrives at the destination with low cost. Simulation experiment demonstrates that spray-and-prey protocol has lower delivery delay and network resource cost than other protocol in sparse SDVNsscenarios.
Original languageEnglish
Title of host publicationIET Conference Publications
PublisherInstitution of Engineering and Technology
Publication statusPublished - 1 Jan 2015
Event2015 International Conference on Information and Communications Technologies, ICT 2015 - Xi'an, China
Duration: 24 Apr 201526 Apr 2015

Conference

Conference2015 International Conference on Information and Communications Technologies, ICT 2015
Country/TerritoryChina
CityXi'an
Period24/04/1526/04/15

Keywords

  • Carry-and-forward routing
  • Intermittently connected network
  • Multi-copy routing
  • Software-defined networking
  • Vehicular ad hoc networks

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Efficient multiple-copy routing in software-defined vehicular networks'. Together they form a unique fingerprint.

Cite this