Hypergraph Modeling Scheme with Joint Contact Schedule and Prioritized Data
Traffic Constraint for Opportunistic Internet of Vehicles
Long Zhang, Xinxin Zhang
School of Information and Electrical Engineering
Hebei University of Engineering
Handan 056038, China
E-mail: zhanglong@hebeu.edu.cn
Qiwu Wu
Department of Communication Engineering
Engineering University of Armed Police Force
Xi’an 710086, China
E-mail: wuqiwu700@163.com
Abstract—In this paper, we explore the hypergraph modeling
scheme with joint contact schedule and prioritized data traffic
constraint for Opportunistic Internet of Vehicles (OppIoVs).
Firstly, we present the concepts of the real contact and the
virtual contact between two vehicle nodes by taking into
account both the real connection constraint of the physical link
and the constraint of the priorities of different data traffic in
OppIoVs. Then we devise the real contact schedule metric for
the real contact between two vehicle nodes along the scheduled
link. Moreover, the hybrid contact homeostasis incorporating
joint contact schedule and prioritized data traffic constraint
between two vehicle nodes along the scheduled link is also
designed. Finally, we propose the hypergraph modeling scheme
by devising the different algorithms to obtain the hyperedges
under two different cases including the case of intermittent
real contact and the case of persistent virtual contact.
Keywords-Internet of Vehicles; Hypergraph Model; Contact
Schedule; Data Traffic; Priority
I. INTRODUCTION
As a promising vehicle-oriented mobile Internet of
Things, Internet of Vehicles (IoVs) refer to the dynamic
mobile communication systems that communicate with their
internal and external environments by creating the
interactions of vehicle-to-sensor (V2S), vehicle-to-vehicle
(V2V), vehicle-to-road infrastructure (V2R), and vehicle-to-
Internet (V2I), etc [1], [2]. With the help of the On-Board
Units (OBUs) installed on the vehicles as well as the Road-
Side Units (RSUs) deployed along the sides of the roads or
highways, IoVs are characterized by gathering, sharing,
processing, computing, and secure release of data traffic onto
information platforms [2].
In the IoVs, V2V and V2R communications are the two
basic communication paradigms, which respectively allow
OBUs to communicate with each other and with the RSUs.
Considering the dynamic characteristic and the limited
transmission ranges of vehicles, the data traffic generated
from the vehicles and the RSUs may be effectively
disseminated among vehicles through multi-hop V2V
communications in Vehicular Ad Hoc Networks (VANETs)
[3]. In recent years, there has been growing number of
research activities in the field of VANETs. Recent results
covering VANET-related issues include the areas such as
routing, data dissemination, information security, node
localization, MAC protocol, etc. In particular, the vast
majority of the above study results in VANETs are
formulated bearing in mind the underlying network models
or system models, which cover the different system
parameters, such as node distribution model [4], node
mobility model [5], headway distribution model [6],
communication link model [7], etc.
It is noteworthy that the conditions such as limited
transmission ranges, radio obstacles due to physical
characteristics, and external interferences, etc, make the V2V
and V2R communications subject to frequent partition,
intermittent connectivity, and significant loss rates [8]. Most
importantly, there are no guaranteed continuous end-to-end
paths between sources and destinations due to the
intermittently or partially connected dynamic topologies over
the IoVs. Such a challenged network is often termed as an
opportunistic IoVs (OppIoVs). Thus, the aforementioned
recent results tailored for VANETs cannot be efficiently
applied to the environments of the OppIoVs.
Our work in this paper mainly focuses on the network
modeling strategy for the OppIoV scenario owing to its
importance for designing other network protocols, such as
routing, MAC specification, data dissemination, and
transportation control, etc. Due to the most important
characteristics including the frequent partitioned topologies,
the intermittent connected links, and significant loss rates in
OppIoVs, the traditional graph theory cannot be effectively
used to model the network structure. In order to better
enhance the network connectivity of OppIoVs, we present a
hypergraph modeling scheme with joint contact schedule and
prioritized data traffic constraint for OppIoVs. Our main
contributions can be outlined as follows:
x By characterizing the priorities of different data
traffic bearing in mind the differentiated types of
data traffic in the OppIoVs, we define the traffic
sensing factor for each access category.
x We introduce the concepts of the real contact and the
virtual contact between two vehicle nodes. The real
contact indicates the real connection constraint of the
physical link. However, the virtual contact reveals
the interior phenomena that this defined contact
firstly belongs to the real contact and further must be
subject to the constraint of the priorities of different
data traffic.
UIC-ATC-ScalCom-CBDCom-IoP 2015
978-1-4673-7211-4/15 $31.00 © 2015 IEEE
DOI 10.1109/UIC-ATC-ScalCom-CBDCom-IoP.2015.272
1509
UIC-ATC-ScalCom-CBDCom-IoP 2015
978-1-4673-7211-4/15 $31.00 © 2015 IEEE
DOI 10.1109/UIC-ATC-ScalCom-CBDCom-IoP.2015.272
1509
UIC-ATC-ScalCom-CBDCom-IoP 2015
978-1-4673-7211-4/15 $31.00 © 2015 IEEE
DOI 10.1109/UIC-ATC-ScalCom-CBDCom-IoP.2015.272
1508
UIC-ATC-ScalCom-CBDCom-IoP 2015
978-1-4673-7211-4/15 $31.00 © 2015 IEEE
DOI 10.1109/UIC-ATC-ScalCom-CBDCom-IoP.2015.272
1508
UIC-ATC-ScalCom-CBDCom-IoP 2015
978-1-4673-7211-4/15 $31.00 © 2015 IEEE
DOI 10.1109/UIC-ATC-ScalCom-CBDCom-IoP.2015.272
1508
UIC-ATC-ScalCom-CBDCom-IoP 2015
978-1-4673-7211-4/15 $31.00 © 2015 IEEE
DOI 10.1109/UIC-ATC-ScalCom-CBDCom-IoP.2015.272
1508
UIC-ATC-ScalCom-CBDCom-IoP 2015
978-1-4673-7211-4/15 $31.00 © 2015 IEEE
DOI 10.1109/UIC-ATC-ScalCom-CBDCom-IoP.2015.272
1508