Minimal Road-Side Unit Placement for Delay-Bounded Applications in Bus Ad-hoc Networks

Haizhou Bao; Qin Liu; Chuanhe Huang; Xiaohua Jia

doi:10.1109/pccc.2017.8280441

Minimal Road-Side Unit Placement for Delay-Bounded Applications in Bus Ad-hoc Networks

Haizhou Bao
, Qin Liu
, Chuanhe Huang^*
, Xiaohua Jia

^*Corresponding author for this work

Department of Computer Science

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

10 Citations (Scopus)

Abstract

With the emerging demand for road safety and entertainment applications, efficient information exchanges among vehicles in Vehicular Ad-hoc Networks (VANETs) have attracted considerable attention. Since VANETs usually suffer from intermittent connectivity, long delay, and packet loss, Road-Side Unit (RSU) placement has been introduced to improve communication performance recently. Although some researchers have focused on scheduling and routing of buses, efficient communication in public transportation systems with infrastructure has not been well studied. In this paper, we use a space-time graph to model topology changes in Bus Ad-hoc Networks (BANETs), and then propose an effective greedy algorithm to minimize the number of RSUs, such that the communication delay between any two buses is within a given delay bound in BANETs. To evaluate the proposed scheme, we conduct simulations and analyze the performance. The simulation results show that our algorithm can significantly reduce the number of installed RSUs and the average end-to-end delay in the entire network.

Original language	English
Title of host publication	2017 IEEE 36th International Performance Computing and Communications Conference (IPCCC)
Publisher	IEEE
ISBN (Electronic)	9781509064687
ISBN (Print)	9781509064694
DOIs	https://doi.org/10.1109/pccc.2017.8280441
Publication status	Published - Dec 2017
Event	36th IEEE International Performance Computing and Communications Conference (IPCCC 2017) - Bahia Resort Hotel, San Diego, United States Duration: 10 Dec 2017 → 12 Dec 2017 http://ipccc.org/ipccc2017/

Publication series

Name	IEEE International Performance Computing and Communications Conference (IPCCC)
ISSN (Print)	1097-2641
ISSN (Electronic)	2374-9628

Conference

Conference	36th IEEE International Performance Computing and Communications Conference (IPCCC 2017)
Abbreviated title	IPCCC 2017
Place	United States
City	San Diego
Period	10/12/17 → 12/12/17
Internet address	http://ipccc.org/ipccc2017/

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 3 Good Health and Well-being
SDG 9 Industry, Innovation, and Infrastructure
SDG 11 Sustainable Cities and Communities

Research Keywords

Vehicular Ad-hoc Networks
Bus Ad-hoc Networks
RSU placement
delay-bounded
space-time graph
TOLERANT NETWORKS
THROWBOX PLACEMENT
VEHICULAR NETWORKS
TOPOLOGY DESIGN

Access Output

10.1109/pccc.2017.8280441

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{3a5c0ae4a0164d9b812b77a93a32b5a4,

title = "Minimal Road-Side Unit Placement for Delay-Bounded Applications in Bus Ad-hoc Networks",

abstract = "With the emerging demand for road safety and entertainment applications, efficient information exchanges among vehicles in Vehicular Ad-hoc Networks (VANETs) have attracted considerable attention. Since VANETs usually suffer from intermittent connectivity, long delay, and packet loss, Road-Side Unit (RSU) placement has been introduced to improve communication performance recently. Although some researchers have focused on scheduling and routing of buses, efficient communication in public transportation systems with infrastructure has not been well studied. In this paper, we use a space-time graph to model topology changes in Bus Ad-hoc Networks (BANETs), and then propose an effective greedy algorithm to minimize the number of RSUs, such that the communication delay between any two buses is within a given delay bound in BANETs. To evaluate the proposed scheme, we conduct simulations and analyze the performance. The simulation results show that our algorithm can significantly reduce the number of installed RSUs and the average end-to-end delay in the entire network.",

keywords = "Vehicular Ad-hoc Networks, Bus Ad-hoc Networks, RSU placement, delay-bounded, space-time graph, TOLERANT NETWORKS, THROWBOX PLACEMENT, VEHICULAR NETWORKS, TOPOLOGY DESIGN",

author = "Haizhou Bao and Qin Liu and Chuanhe Huang and Xiaohua Jia",

year = "2017",

month = dec,

doi = "10.1109/pccc.2017.8280441",

language = "English",

isbn = "9781509064694",

series = "IEEE International Performance Computing and Communications Conference (IPCCC)",

publisher = "IEEE",

booktitle = "2017 IEEE 36th International Performance Computing and Communications Conference (IPCCC)",

address = "United States",

note = "36th IEEE International Performance Computing and Communications Conference (IPCCC 2017), IPCCC 2017 ; Conference date: 10-12-2017 Through 12-12-2017",

url = "http://ipccc.org/ipccc2017/",

}

Bao, H, Liu, Q, Huang, C & Jia, X 2017, Minimal Road-Side Unit Placement for Delay-Bounded Applications in Bus Ad-hoc Networks. in 2017 IEEE 36th International Performance Computing and Communications Conference (IPCCC). IEEE International Performance Computing and Communications Conference (IPCCC), IEEE, 36th IEEE International Performance Computing and Communications Conference (IPCCC 2017), San Diego, United States, 10/12/17. https://doi.org/10.1109/pccc.2017.8280441

Minimal Road-Side Unit Placement for Delay-Bounded Applications in Bus Ad-hoc Networks. / Bao, Haizhou; Liu, Qin; Huang, Chuanhe et al.
2017 IEEE 36th International Performance Computing and Communications Conference (IPCCC). IEEE, 2017. (IEEE International Performance Computing and Communications Conference (IPCCC)).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Minimal Road-Side Unit Placement for Delay-Bounded Applications in Bus Ad-hoc Networks

AU - Bao, Haizhou

AU - Liu, Qin

AU - Huang, Chuanhe

AU - Jia, Xiaohua

PY - 2017/12

Y1 - 2017/12

N2 - With the emerging demand for road safety and entertainment applications, efficient information exchanges among vehicles in Vehicular Ad-hoc Networks (VANETs) have attracted considerable attention. Since VANETs usually suffer from intermittent connectivity, long delay, and packet loss, Road-Side Unit (RSU) placement has been introduced to improve communication performance recently. Although some researchers have focused on scheduling and routing of buses, efficient communication in public transportation systems with infrastructure has not been well studied. In this paper, we use a space-time graph to model topology changes in Bus Ad-hoc Networks (BANETs), and then propose an effective greedy algorithm to minimize the number of RSUs, such that the communication delay between any two buses is within a given delay bound in BANETs. To evaluate the proposed scheme, we conduct simulations and analyze the performance. The simulation results show that our algorithm can significantly reduce the number of installed RSUs and the average end-to-end delay in the entire network.

AB - With the emerging demand for road safety and entertainment applications, efficient information exchanges among vehicles in Vehicular Ad-hoc Networks (VANETs) have attracted considerable attention. Since VANETs usually suffer from intermittent connectivity, long delay, and packet loss, Road-Side Unit (RSU) placement has been introduced to improve communication performance recently. Although some researchers have focused on scheduling and routing of buses, efficient communication in public transportation systems with infrastructure has not been well studied. In this paper, we use a space-time graph to model topology changes in Bus Ad-hoc Networks (BANETs), and then propose an effective greedy algorithm to minimize the number of RSUs, such that the communication delay between any two buses is within a given delay bound in BANETs. To evaluate the proposed scheme, we conduct simulations and analyze the performance. The simulation results show that our algorithm can significantly reduce the number of installed RSUs and the average end-to-end delay in the entire network.

KW - Vehicular Ad-hoc Networks

KW - Bus Ad-hoc Networks

KW - RSU placement

KW - delay-bounded

KW - space-time graph

KW - TOLERANT NETWORKS

KW - THROWBOX PLACEMENT

KW - VEHICULAR NETWORKS

KW - TOPOLOGY DESIGN

UR - https://www.scopus.com/pages/publications/85047401857

UR - https://www.scopus.com/pages/publications/85047401857#tab=impact

U2 - 10.1109/pccc.2017.8280441

DO - 10.1109/pccc.2017.8280441

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9781509064694

T3 - IEEE International Performance Computing and Communications Conference (IPCCC)

BT - 2017 IEEE 36th International Performance Computing and Communications Conference (IPCCC)

PB - IEEE

T2 - 36th IEEE International Performance Computing and Communications Conference (IPCCC 2017)

Y2 - 10 December 2017 through 12 December 2017

ER -

Minimal Road-Side Unit Placement for Delay-Bounded Applications in Bus Ad-hoc Networks

Abstract

Publication series

Conference

UN SDGs

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this