Software defined networking with pseudonym systems for secure vehicular clouds

2169-3536 (c) 2016 IEEE. Translations and content mining are permitted for academic research only. Personal use is also permitted, but republication/redistribution requires IEEE permission. See
http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/ACCESS.2016.2560902, IEEE Access
1
Software Defined Networking with Pseudonym
Systems for Secure Vehicular Clouds
Xumin Huang, Rong Yu, Member, IEEE, Jiawen Kang, Ning Wang, Member, IEEE,
Sabita Maharjan, Member, IEEE, and Yan Zhang, Senior Member, IEEE
Abstract—The vehicular cloud is a promising new paradig-
m where vehicular networking and mobile cloud computing
are elaborately integrated to enhance the quality of vehicular
information services. Pseudonym is a resource for vehicles
to protect their location privacy, which should be efficiently
utilized to secure vehicular clouds. However, only a few ex-
isting architectures of pseudonym systems take flexibility and
efficiency into consideration, thus leading to potential threats
to location privacy. In this paper, we exploit software-defined
networking technology to significantly extend the flexibility
and programmability for pseudonym management in vehicular
clouds. We propose a software-defined pseudonym system where
the distributed pseudonym pools are promptly scheduled and
elastically managed in a hierarchical manner. In order to decrease
the system overhead due to the cost of inter-pool communications,
we leverage the two-sided matching theory to formulate and
solve the pseudonym resource scheduling. We conducted extensive
simulations based on the real map of San Francisco. Numerical
results indicate that the proposed software-defined pseudonym
system significantly improves the pseudonym resource utilization,
and meanwhile, effectively enhances the vehicles’ location privacy
by raising their entropy.
I. INTRODUCTION
With the rapid development of wireless communica-
tion technologies [1], [2], vehicles can utilize vehicle-to-
infrastructure and vehicle-to-vehicle communications with the
help of on-board devices to form vehicular networks. However,
many emerging mobile applications require larger and secure
storage [3] and complex computation, and brings new resource
challenges to vehicular networks, e.g., vehicle platoon [4],
real-time video streaming application [5]–[8] and vehicular
augmented reality, social media sharing [9], [10]. To meet the
growing demands of radio and computing resources, vehicular
networks take the advantages of cloud computing and are
evolving towards vehicular clouds. From a system-level view,
idle resources in vehicles, network infrastructures (e.g., road-
side unit (RSU)) and cloud infrastructures (e.g, data center)
can be recruited to form a vehicular cloud system. A typical
vehicular cloud system [11] consists of three different levels as
following. 1) At the bottom level, cooperative vehicles create
a vehicular cloud. 2) At the middle layer, a set of adjacent
Xumin Huang, Rong Yu, and Jiawen Kang are with School of Automation,
Guangdong University of Technology, China. Email: {xumin.huang, yurong,
jiawen.kang.cn}@ieee.org.
Ning Wang is with the Center for Communications Systems Research,
University of Surrey, U.K. Email: n.wang@surrey.ac.uk.
Sabita Mahajan and Yan Zhang (corresponding author) are with Simula Re-
search Laboratory and University of Oslo, Norway. Email: sabita@simula.no,
yanzhang@ieee.org.
RSUs form a local cloud. 3) At the top layer, central cloud
manages resources in the system. While ubiquitous wireless
communication of pervasive cloud computing greatly facilitate
the formation and functioning of vehicular cloud, privacy and
security challenges remain to be addressed for this new domain
[12], [13].
To secure vehicular clouds, we focus on pseudonym, which
is an essential resource for vehicles to protect location privacy
[14]. Most of the privacy protection schemes are implemented
on the basis of pseudonyms, e.g., group signature, silent pe-
riod, and mix-zone [14]. Vehicles should periodically change
their pseudonyms to avoid being continuously tracked. More-
over, a third-party cloud service provider may pose potential
threats to the vehicles because of data leakage [15]. This
further highlights the importance of pseudonyms for vehicles
to protect privacy in vehicular clouds. Vehicles need to possess
sufficient pseudonyms to be able to frequently change for
anonymity.
Moreover, with the increasing number of vehicles,
pseudonym management in vehicular clouds has become a
challenging problem. The drawbacks of a previous centralized
approach to manage pseudonyms mainly include two aspects:
a heavy computing workload for the central cloud and a
big backhaul delay for the vehicles. These vulnerabilities
confine the pseudonym system capacity, and also result in
low utilization of pseudonyms. Consequently, the pseudonyms
may not be sufficient to maintain the location privacy of the
vehicles. To this end, a new pseudonym system with high
flexibility and efficient pseudonym utilization is necessary. We
exploit Software Defined Networking (SDN) to significantly
enhance the flexibility and programmability for pseudonym
management in vehicular clouds. Software defined networking
is a novel technology to control the network in a logically
centralized, programmable and systematic approach by decou-
pling the physical data plane and the abstract control plane
[16]. The potential of centralized knowledge, programmability
and flexibility in SDN can satisfy the requirements of vehicular
clouds and simplify pseudonym management, especially when
the number of vehicles is high.
In this paper, we propose a Software-Defined Pseudonym
System (SDPS), where distributed pseudonym pools are de-
ployed, quickly scheduled and elastically managed in a hier-
archical manner. Besides, to decrease the system overhead due
to the cost of inter-pool communications, we leverage the two-
sided matching theory to formulate and solve the pseudonym
resource scheduling. The main contributions of this paper are
summarized as follows.
www.redpel.com +917620593389

• We propose a software-defined pseudonym system with
a hierarchical architecture, which leverages the SDN
technology to provide flexibility and programmability for
pseudonym management.
• We develop the two-sided matching theory to solve
pseudonym resource scheduling problem, which matches
the optimal pseudonym transmitters and receivers to
decrease the system overhead due to the cost of inter-
pool communications.
• Numerical results show that the proposed software-
defined pseudonym system significantly improves the
pseudonym resource utilization, and effectively strength-
ens the vehicles’ location privacy.
The rest of this paper is organized as follows. Section II
presents the related work. We describe a new observation
about delay on pseudonym distribution approaches in Section
III. A hierarchical architecture of software-defined pseudonym
system is proposed in Section IV. Section V discusses the
pseudonym-allocation problem, and we introduce the two-
sided matching theory to solve this problem in Section VI.
Performance evaluation of our proposed scheme is provided
in Section VII. Finally, Section VIII concludes this paper.
II. RELATED WORK
Recently, a few studies have investigated the combination
of cloud computing and vehicular networks. The authors
in [11] presented a hierarchical architecture to organize the
cloud resources in a vehicular network, consisting of three
layers: vehicular cloud, RSU cloud, and central cloud. In
[17], the authors pointed out that the way of network service
provisioning changes when integrating the mobile cloud model
into vehicular networks. The Vehicular Ad hoc Networks
(VANET) Cloud, a new cloud computing model for VANET as
introduced in [18], consists of three layers: client layer, cloud
layer and communication layer. [19] proposed a new two-
tier BUS-VANET that enables less delivery delay and higher
delivery rate than those of the traditional VANET.
Along with the system architectures and design principles,
some researchers have shown great interest in the resource
allocation problem in vehicular clouds. Due to uncertainty of
the vehicles’ behavior, the variation of available computation
resources in vehicular clouds cannot be neglected. To address
this problem, the authors in [20] proposed an optimal com-
putation resource allocation scheme. The dynamic vehicular
clouds make a decision about whether or not to locally process
a service request. Then the computing resource allocation
problem in a vehicular cloud is formulated as a semi-Markov
decision process to maximize the total long-term reward of the
vehicles. The authors in [11] focused on resource allocation
and formulated the competition among virtual machines as a
non-cooperative game. Similarly, RSU cloud resource manage-
ment models in [21] employed SDN technology to decrease
virtual machine migration, and minimize the number of service
hosts and the infrastructure routing delay.
SDN is emerged as a promising approach for providing a
centralized control method for global resource management in
cloud computing environment. The authors in [22] combined
SDN framework with cloud computing for cloud resource
optimal control. A resource sharing strategy is designed with
global optimum in the control plane and executed by each
cloud service provider in the data plane. [23] exploited SD-
N technology to allow the flexible allocation of bandwidth
coordinated with virtual machine provisioning to minimize
users costs. An optimal bandwidth provisioning and routing
decision on virtualized routers are made by a SDN controller
and then implemented on the physical network. Similar work
on bandwidth allocation based on SDN was studied in [24] for
guaranteeing quality of service. SDN bridges the gaps through
unified network abstraction and programmability, which also
can be utilized for overcoming todays limitations in vehicular
networks [25]. Through utilizing SDN framework to manage
the cloud resources in vehicular clouds, a new paradigm of 5G-
enabled vehicular networks was proposed in [26]. With SDN
technology reconfiguring resources, an efficient RSU cloud
resource management scheme aiming to minimize reconfigu-
ration overhead was proposed in [21]. In this paper, we also
consider that SDN can be to coordinate among vehicles and
allocate efficiently all kinds of resources in vehicular clouds.
Pseudonym is crucial for vehicles to protect their location
privacy when forming a vehicular cloud for inter-vehicular
communication [14]. Vehicles need sufficient pseudonyms
to frequently change for location privacy preservation. The
schemes for pseudonym distribution can be broadly catego-
rized into two groups. I) A centralized pseudonym pool dis-
tributes pseudonyms to vehicles. In [27], each vehicle obtains
48830 pseudonyms at a time, and uses these pseudonyms over
a long time (e.g., one year). II) Distributed pseudonym pools
distribute pseudonyms to vehicles by distributed pseudonym
pools. In [28], the vehicles periodically obtain a certain num-
ber of resource (keys or pseudonyms) from local managers.
For efficient generation and management of pseudonyms,
we adopt a distributed approach that distributed local cloud
with a pseudonym pool generates and manages pseudonyms.
This approach can reduce pseudonym distribution delay and
balance the computing workload in vehicular clouds. To
improve pseudonym utilization efficiency and to provide
flexibility on pseudonym management, we propose a new
pseudonym system, SDPS, for vehicular clouds. The vehicles
are mobile in both time and space, consequently causing
different pseudonym demands in time and from different
pseudonym pools. To address this issue, we design an efficient
pseudonym scheduling and distribution scheme using the two-
sided matching theory.
III. A NEW OBSERVATION ON PSEUDONYM DISTRIBUTION
In this section, we first introduce two pseudonym manage-
ment approaches in detail. Furthermore, we make an observa-
tion about pseudonym distribution and find out the advantages
of distributed pseudonym management approach.
A. Two Pseudonym Management Approaches
In the centralized pseudonym management approach, a
centralized pseudonym pool stores all pseudonyms and cer-
tificates, and distributes them to the vehicles for privacy
2

protection. Vehicles request and obtain pseudonyms through
RSUs. All the vehicles send pseudonym requests with digital
signatures to nearby RSUs after encryption. The RSUs decrypt
and verify the pseudonym requests, and transmit these requests
to the central manager after encrypting and adding signatures
of the RSUs. The central manager decrypts and verifies the
signatures generated by the RSUs and the vehicles. The central
manager encrypts the pseudonyms and transmits them to the
RSUs. After decryption and verification, the RSUs send the
pseudonyms to the vehicles.
For distributed pseudonym-management, there is a local
authority and a pseudonym pool in the local cloud. Vehicles
request pseudonyms from the local clouds. The process of
pseudonym distribution in the distributed approach is simpler.
The local authorities generate and manage their pseudonyms
in their own pseudonym pools. A vehicle sends an encrypted
request with signature to its nearby RSU, which delivers the
requests to a local authority. The local authority decrypts
and verifies the request, and then distributes the encrypted
pseudonyms to the vehicle. The vehicle verifies and receives
the pseudonyms from the RSU. We observe that there are
less handshake protocols and data transmission delay in the
distributed approach. Besides, for central pseudonym man-
agement approach, all the pseudonyms include corresponding
public and private keys and certificates. This brings a heavy
computing workload to the central cloud from pseudonyms
generation to revocation. A distributed pseudonym manage-
ment approach can be helpful to balance this computing
workload.
B. An Experiment about Pseudonym Distribution
In this subsection, we compare the distribution delay of
pseudonyms in different pseudonym management approaches.
We select a map of the West University Place and Braeswood
Place, Houston [29] as observation areas. Twelve RSUs are
deployed in this map according to the scheme proposed in
[30]. There are four local clouds in the experiment, each
consisting of four adjacent RSUs. Some of the vehicles are
mobile within the region of interest. We consider that the
request for pseudonyms from the vehicles in different local
clouds follows a Poisson process. The average key size is 1024
bits in RSA algorithm [31]. The time taken to execute basic
operations in our experiment is referred from [32].
Fig. 1 shows that the distribution delay increases with the
increase in average arrival rate of the vehicles that request
pseudonyms. The pseudonyms distribution delay in the central-
ized approach is higher compared to the distributed approach.
Moreover, it is clear that the computing overhead of basic
operations of pseudonyms management (e.g., signing, encrypt-
ing and decrypting) in the centralized pseudonym management
approach is higher than that in the distributed approach since
there are more handshake protocols in the former. The central
authority manages pseudonyms of all the vehicles, while the
local authorities only manage a part of the vehicles. Therefore,
the distributed approach is more efficient than the centralized
approach because of smaller distribution delay and lower
computation overhead.
400 600 800 1000 1200 1400 1600
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
Average arrival rate of vehicles
Pseudonymdistributiondelay(s)
Central pseudonym management system
Distributed pseudonym management system
Fig. 1: The distribution delay comparison of distributed and
centralized management.
IV. SOFTWARE-DEFINED PSEUDONYM SYSTEMS
In this section, we propose a software-defined pseudonym
system, where distributed pseudonym pools are deployed,
scheduled and elastically managed in a hierarchical manner.
A. SDN for Pseudonym Management
SDN has emerged as a novel approach to control the net-
work in a centralized, programmable and systematic manner.
The core concept of SDN is the separation between the control
plane and the data plane. By decoupling these two planes,
network intelligence and state can be logically centralized and
the data forwarding is abstracted from applications [33]. The
flexibility of SDN can be an important advantage for cloud
resource allocation to meet dynamic demands, and to improve
resource utilization in vehicular clouds [21].
We exploit SDN technology to increase the flexibility and
programmability for pseudonym management in vehicular
clouds. To deploy SDN, a communication protocol between
the control plane and the data plane is required. We use the
OpenFlow protocol, which is the defacto standard protocol
for SDN. It consists of OpenFlow controller and OpenFlow
switches. We design the pseudonym resource scheduling strat-
egy in the control plane. Utilizing this strategy, the OpenFlow
controller defines pseudonym forwarding rules for every Open-
Flow switch in the pseudonym (data) plane. Some benefits of
leveraging SDN in the context of pseudonym management are
as follows.
• Globalization: The centralized controller obtains global
knowledge about pseudonym resource, i.e., demand and
consumption rates of all local clouds. With these informa-
tion, an optimal resource scheduling strategy is designed
to allocate the pseudonyms on demand efficiently.
• Flexibility: SDN technology brings flexibility and pro-
grammability into the vehicular clouds for pseudonym
management. Pseudonyms can be flexibly managed ac-
cording to the heterogeneous characteristics of vehicular
networks, such as mobility, topology and capability.
3

Central Cloud
Data centerRegistration
authority
OpenFlow controller
OpenFlow switch
Pseudonym pool
Local data center
Pseudonym resource
Instruction communication
Data transfer
ControlplaneDataplane
Local Cloud
Vehicular Cloud
RSU RSU RSU
Fig. 2: A hierarchical architecture of SDPS in vehicular
clouds.
• Simplicity: By decoupling the pseudonym resource con-
trols (control plane) and pseudonym forwarding functions
(data plane), SDN simplifies pseudonym management.
This goal can be achieved even if the number of vehicles
is high.
B. A Hierarchical Architecture for SDPS
Fig. 2 shows a hierarchical architecture for SDPS in ve-
hicular clouds, which is divided into data plane and control
plane. The vehicular clouds in this paper have three-layer
clouds: central cloud, local cloud and vehicular cloud. There
are a registration authority, a data center and an OpenFlow
controller in the central cloud. The registration authority
manages the digital certificates of all entities, e.g., vehicles,
RSUs, OpenFlow switches, and pseudonym pools. The regis-
tration authority is in charge of monitoring the behaviors of
all entities to ensure system security [27]. The data centers
collect and store the status information of all local clouds.
These information include traffic flow, and the deployment
information of pseudonyms, which are used to design the op-
timal pseudonym resource scheduling strategy. Some adjacent
RSUs and a remote data center form a local cloud, including
a pseudonym pool with an OpenFlow switch. A group of
cooperative vehicles create a vehicular cloud to share vehicular
resources.
Pseudonym is utilized in frequent vehicle-to-vehicle and
vehicle-to-infrastructure communication for location privacy
preservation. For example, when nearby vehicles in mo-
tion constitute a dynamic vehicular cloud, inter-vehicle com-
munication is normally required. For location privacy p-
reservation, the vehicles without sufficient pseudonyms send
Control
plane
Data
planeForward among
pseudonym pools
Forward to
vehicles
OpenFlow switch
Check OpenFlow
switches
Define a pseudonym
flow table
Pseudonym-flow
table
Status information of
OpenFlow switches
Develop an optimal
resource scheduling
strategy
OpenFlow
controller
Fig. 3: Control plane and data plane in SDPS.
pseudonym requests to nearby RSUs. The local cloud sched-
ules pseudonyms generated by its pseudonym pool to support
the demands from vehicles. Generally, the pseudonym de-
mands from vehicles in different local clouds may change over
time. This means that there exists redundant or on-demand
pseudonym resource among the local clouds.
In the SDPS, pseudonyms are generated by local pseudonym
pools and transferred to other pseudonym pools in different
local clouds when necessary. The pseudonyms are managed by
the local clouds that distribute them. When some pseudonyms
are distributed to a vehicle, these pseudonyms will be attached
with signatures of the local clouds to indicate the manager.
For example, a vehicle obtains some pseudonyms from the
local cloud LC1. LC1 signs the pseudonyms and the vehicle
may enter another local cloud, e.g., LC2 . LC2 verifies the
signatures of the pseudonyms to authenticate the vehicle. If
the vehicle wants to request new pseudonyms from LC2,
LC2 need to inform LC1 to perform revocation of the former
pseudonyms distributed to the vehicle. Then LC2 distributes
new pseudonyms to the vehicle.
The OpenFlow controller collects and analyzes the global
status information in vehicular clouds. To improve pseudonym
utilization, the global controller makes an optimal pseudonym
resource scheduling strategy, and then OpenFlow switches for-
ward pseudonym flow. A pseudonym-flow table is designed by
the controller and sent to every OpenFlow switch. OpenFlow
switches receive the pseudonym-flow table, and forward the
pseudonyms to vehicles or other pseudonym pools according
to the flow rules. The system consists of the following SDN
components.
• OpenFlow controller: In the control plane, the Open-
Flow controller is the logical central intelligence of the
vehicular clouds, which controls the network behavior
4

of the entire system. The controller designs the optimal
pseudonym resource scheduling strategy and generates
a detailed pseudonym-flow table for every OpenFlow
switch.
• OpenFlow switch: In the data plane, the pseudonym
pools equipped with OpenFlow switches are controlled
by the OpenFlow controller to perform actions. They
are stationary elements of data plane, which are respon-
sible for forwarding pseudonym flow, e.g., forwarding
pseudonyms to local vehicles or other pseudonym pools.
More details about functions of data plane and control plane
are shown in Fig. 3 and are described next.
• Data plane: The pseudonym pools in local clouds gener-
ate pseudonyms at a constant rate. There is an OpenFlow
switch in every pseudonym pool, and every OpenFlow
switch communicates with the OpenFlow controller. Ac-
cording to flow rules in a pseudonym-flow table designed
by the OpenFlow controller, a pseudonym pool may
distribute the pseudonyms to relative RSUs to make
vehicles anonymous for privacy preservation in its cover-
age. On the other hand, it can also transmit redundant
pseudonyms to others, or receive a certain number of
pseudonyms from others. Therefore, the data plane is
responsible for performing pseudonym flow forwarding
tasks in this system. Besides, status information about
OpenFlow switches are also uploaded to the controller
for checking.
• Control plane: The OpenFlow controller in the cen-
tral cloud obtains global information about all the
pseudonym pools and pseudonym requests from vehicles.
The OpenFlow controller makes the optimal pseudonym
resource allocation strategy among pseudonym pool-
s. A pseudonym-flow table is also designed by the
controller, and then it decides how the pseudonyms
are forwarded in the vehicular clouds. The format
of an item in a pseudonym-flow table is shown as:
PID From To Time . Here, “PID” denotes
the identification of pseudonym. “From” and “To”
indicate where the pseudonym is generated from and
transmitted to, respectively. To can be an address of an
RSU or other pseudonym pools. “Time” is the timestamp
of pseudonym generation. The goal of the pseudonym-
flow table is to maximize the utilization of pseudonym
resource by transmitting redundant pseudonyms to the
pseudonym pools that fall short of pseudonyms. Due
to the cost of inter-pools communication, the redundant
pseudonyms should be well scheduled and transferred
from pseudonym transmitters to receivers among the
pseudonym pools. To efficiently match transmitters and
receivers, we use two-sided matching theory to obtain the
optimal result after multi-rounds matching.
V. PROBLEM FORMULATION
In our model, the pseudonym pools with OpenFlow switches
form a network as an undirected graph G = G(V, E). The
network of the pseudonym pools includes m nodes (i.e.,
pseudonym pools) and n node pairs (i.e., edges and links).
The pseudonym pools in local clouds are denoted by V =
{P1, P2, ..., Pm}. The set of edges E represents the undirected
pseudonym transmission links. The pseudonym data packets
can be transmitted between two connected pseudonym pools
via wired link with smaller cost. During the transmission of
pseudonym data packets, the data packet loss per distance
unit is l [34]. Then the weights of edges are calculated by
the total pseudonym transmission loss (denoted as c) between
two connected pseudonym pools. Here, c = l • d, where d
is the distance between two connected pseudonym pools. All
the pseudonym pools are connected with each other. Using
Dijkstra’s algorithm, the link with minimum communication
cost between any two pseudonym pools can be determined.
Defining a symmetric matrix M=Dijkstra(G) as the inter-
pool minimum communication cost matrix, the element of the
matrix, mi,j(i ̸= j), represents the minimum communication
cost between pseudonym pool Pi and pseudonym pool Pj. To
make this paper clear, we use m(Pi, Pj) to replace mi,j.
At the beginning of an observation period t (i.e., a time
window), a pseudonym pool Pi possesses a certain amount
of residual pseudonym resource Rt
i. Each pseudonym pool
generates pseudonyms at a constant rate, θi. The average
consuming rate of pseudonym resource of Pi in the following
time (denoted as λt
i) can be estimated from the historical
records by statistical methods. During time interval T, if
Rt
i > (λt
i − θi)T, Pi has a certain amount of redundant
pseudonym resource. Otherwise Pi lacks pseudonym resource.
Let rt
i represent the difference between the amount of required
resources and the amount of actual resources as follows,
r(Pi) = Rt
i + θiT − λt
iT . (1)
Pi shares idle pseudonyms with other pseudonym pools or re-
ceives pseudonyms from others. We represent the pseudonym
pool offering pseudonyms to others as OP, and the pseudonym
pool receiving pseudonyms from the OPs as RP.
In an SDPS, a pseudonym resource scheduling problem
includes three considerations.
• 1) OPs are rational to determine that how many idle
pseudonyms can be offered to RPs after considering both
the current and future demands.
• 2) To decrease the system overhead, OPs prefer to offer
their idle pseudonyms to some proper RPs with smaller
inter-pool communications cost.
According to this principle, an optimal pseudonym resource
allocation strategy among the pseudonym pools can be de-
signed.
VI. SOLUTION FOR PSEUDONYM RESOURCE SCHEDULING
A. The Optimal Strategies for OPs
For OPs, they offer a certain amount of idle pseudonyms to
others according to a predefined utility function. The utility
function of an OP, OPi, consists of two components: the
satisfaction function and the cost function. The satisfaction
function St
i is defined as
St
i = wi log(1 + ρt
ixt
i). (2)
5

Here, xt
i (xt
i ≥ 0) represents the amount of pseudonym
resource that OPi would like to offer to others in time period
t. wi is the willingness of OPi, which is determined by its
geographical advantage in G. wi can be expressed by
wi =
k
∑
j̸=i
m(Pi, Pj)
, (3)
where k is a predefined constant. The form of wi is similar
to the closeness centrality in [35]. Clearly, less pseudonym
transmission loss between OPi and other pseudonym pools
stimulates OPi to share its idle pseudonyms. The redundant
level in the current time period of OPi is denoted by
ρt
i = a
Rt
i + θiT
λt
iT
, (4)
where a is the redundant level gain and is predefined by the
preference of pseudonym pools. OPi is willing to offer more
pseudonyms to others for higher utility, when it possesses more
idle pseudonyms. But OPi should take its demand level of
the next time period (denoted as γt
i ) into consideration when
offering idle pseudonyms to others. γt
i is defined as
γt
i = b
λt+1
i
λt
i
, (5)
where b is the redundant level gain, that can be predefined.
The cost of OPi offering resources to others is proportional
to γt
i . Thus, the utility function of OPi can be expressed as
ut
i = wi log(1 + ρt
ixt
i) − γt
i xt
i. (6)
Next, to obtain the optimal solution, we analyze the charac-
teristic of the utility function. Differentiating ut
i with respect
to xt
i, we get
∂ut
i
∂xt
i
=
wiρt
i
(1+ρt
ixt
i) ln 2
− γt
i ,
∂2
ut
i
∂xt
i
2 = −
wiρt2
i
(1+ρixt
i)2
ln 2
< 0.
The utility function is concave, so we can obtain its maximal
value by leveraging
∂ut
i
∂xt
i
= 0. Thus, the optimal amount of idle
pseudonyms offering to others (denoted as xt∗
i ) is expressed
as
xt∗
i =
wi
γt
i ln 2
−
1
ρt
i
. (7)
For the sake of fairness, xt∗
i is constrained by r(OPi) as
follows,
xt∗
i = min(r(OPi),
wi
γt
i ln 2
−
1
ρt
i
). (8)
B. Two-sided Matching among Pseudonym Pools
After calculating the optimal number of idle pseudonyms
provided by the OPs, a global controller in the central cloud
decides how to allocate these pseudonyms to the RPs. The OPs
transfer their idle pseudonyms to appropriate RPs for less cost
of the inter-pool communications. It is a matching problem
between the RPs and the OPs to decide that how to match an
optimal RP for every OP, which aims at decreasing the system
overhead due to the cost of inter-pool communications.
We use a simple and efficient two-sided matching theory
based on Gale-Shapley algorithm to solve the problem of
optimal pseudonym resource allocation [36]. RPs, as the
inviters, will propose to the invitees OPs according to their
own preference lists (denoted as PL(Pi)). The PL is gener-
ated and stored according to communication cost of different
pseudonym pools. In the preference list of RPi, OPj is
arranged in the ϕi
jth order. Conversely, in the preference list
of OPj, RPi is arranged in the φj
i th order. The preference
lists are described as follows:
OPj = PL(RPi, ϕi
j),
RPi = PL(OPj, φj
i ).
(9)
We take a pseudonym pool network consisting of two OPs
and three RPs as an example. The preference lists of OPs and
RPs are given as follows.
OP1 : {RP2, RP1, RP3};
OP2 : {RP2, RP1, RP3};
RP1 : {OP2, OP1};
RP2 : {OP2, OP1};
RP3 : {OP1, OP2}.
For simplicity, we consider that every RP demands the equal
amount of pseudonyms and the redundant pseudonym resource
of every OP only can satisfy one RP. In the first round of
matching procedure, every RP proposes to its favorite OP
according to its preference list. In the first round of result,
every OP chooses the favorite one from the existing inviters
according to the preference list. More details are shown as
follows.
1st round procedure 1st round result
RP1 → OP2 RP1 →
RP2 → OP2 RP2 ↔ OP2
OP1 chooses to match with RP3 temporally because that
RP3 is the only inviter for OP1 in the first round. OP2 choose
to match with RP2 because that RP2 is prior to RP1 in the
preference list of OP2. Then RP1 has to choose the next OP
in its preference list in the next round. Similarly, the second
round procedure and result are listed as
2nd round procedure 2nd round procedure
RP2 ↔ OP2 RP2 ↔ OP2
RP3 ↔ OP1 RP3 →
After being rejected by OP2, RP1 proposes to OP1 in the
second round. Due to the priority of RP1, OP1 prefers to break
the previous matching result with RP3, and then receives the
invitation from RP1. As a result, RP3 has to stay alone in this
round. Although RP3 tries to propose OP2 subsequently, the
result in the second round is stable because that both OP1 and
OP2 do not want to change their current inviters. Thus, two
stable matches between RP1, RP2, RP3 and OP1, OP2 are
formed and satisfy the requirement of the two-sided matching.
According to the above example, we know that, to decrease the
system overhead due to the cost of inter-pool communications,
6

the matching problem between RPs and OPs can be solved by
a two-sided matching problem.
We use a binary variable, µ(RPi, OPj), to denote the final
matching result. When the binary value is 1, it means that the
pseudonym pools are matched. There may exist many rounds
during the process of two-sided matching. Every matching
round includes the following three stages.
1) Stage 1: The inviters propose to the invitees. RPs request
pseudonym resource and send queries to the first OP in their
preference lists. Every OP that act as the invitee selects the best
partner according to its own preference list. When multiple
RPs propose to the same OP, the OP selects the best RP from
the proposers. If an RP is rejected by any OP, the RP will
propose to the next OP in the RP’s preference list until it is
accepted or is rejected by all the OPs in its preference list.
Theorem 1: µ(RPi, OPj) = 1 will exist if and only if
ϕi
j∑
s=1
µ(RPi, PL(RPi, s)) +
φj
i∑
s=1
µ(PL(OPj, s), OPj) = 0.
Proof: RPi proposes to OPj, which means that RPi
has already been rejected by those OPs that whose or-
ders are prior to ϕi
j. The rejections are expressed by
ϕi
j∑
s=1
µ(RPi, PL(RPi, s)) = 0. OPj accepts RPi, only
if OPj has no better proposer but RPi, which implies
φj
i∑
s=1
µ(PL(OPj, s), OPj) = 0. This means that for RPi, it
has been rejected those OPs that are better than OPj in
its preference list. So OPj is the best choice of RPi at
that time. Conversely, for OPj, the acceptation of RPi is
done because that there is no better inviter than RPi. Then,
µ(RPi, OPj) = 1 will exist if and only if both RPi and OPj
have been matched with their own best partner. In summary,
the final outcome of matching is the optimal two-sided result,
because both inviters and invitees have been matched with
their own best partner. The matching result is stable since
both the inviters and the invitees have no better choice [36].
2) Stage 2: OPs decide the amount of transmitted
pseudonym resource. If µ(RPi, OPj) = 1, the amount of
pseudonym resource transmission between RPi and OPj
(denoted as t(RPi, OPj)) depends on m(RPi, OPj), x(OPj)
and r(RPi). For decreasing transmission cost, the amount of
transmitted pseudonym resource is given by,
t(RPi, OPj) =



r(RPi) + m(RPi, OPj), r(RPi)+
m(RPi, OPj) < x(OPi);
x(OPi), m(RPi, OPj) < x(OPi) ≤
r(RPi) + m(RPi, OPj);
0, x(OPi) ≤ m(RPi, OPj).
(10)
The actual amount of pseudonym resource received by RPi is
equal to min(t(RPi, OPj) − m(RPi, OPj), 0).
3) Stage 3: Updating the members of inviters and in-
vitees. If µ(RPi, OPj) = 1 and RPi obtains enough
pseudonym resource, which satisfies min(t(RPi, OPj) −
m(RPi, OPj), 0) = r(RPi), RPi will split from the set of
RPs. Otherwise, RPi will update its resource status informa-
tion as follows,
r(RPi) = r(RPi) − min(t(RPi, OPj) − m(RPi, OPj), 0),
(11)
and then joins into the next matching round. Thus, a new set
of RPs occurs. OPj will update the status information after
offering pseudonym resource to RPi, as
r(OPj) = r(OPj) − t(RPi, OPj). (12)
If OPj cannot offer enough amount of pseudonyms for
any RP in the next round, which satisfies x(OPj) ≤
min(m(RP, OPj)), it will split from the set of OPs. Oth-
erwise, it still stay in OPs. When the set of RPs or OPs is
empty, the matching process ends.
C. Pseudonym-flow Table
The optimal pseudonyms allocation strategy can be per-
formed in terms of designing a detailed pseudonym-flow
table for every OpenFlow switch. For a local cloud, it first
satisfies the local pseudonym demands and then transfers
redundant pseudonyms to others. The local clouds transfer
pseudonyms to local vehicles or other local clouds in a batch.
For instance, several pseudonyms are generated in OPi and
packaged together in time slot t. We denote this pseudonym
package as pt
i. According to the optimal pseudonym resource
allocation strategy, OPi should transfer ti,j (the number of
pseudonym packages) to RPj (j = 1, 2, 3...N). If there exists
a local pseudonym request at this time, pt
i will be delivered to
the local requester otherwise it will be transferred to RPs or be
stored in local pseudonym pool when
∑
ti,j = 0. Following
this principle, a detailed pseudonym-flow table of OPi can be
designed according to Algorithm 1.
VII. NUMERICAL RESULTS
In this section, we evaluate the performance of the proposed
pseudonym resource scheme in an actual urban area of San
Francisco. The latitude is from 37.73619 to 37.81505, and
the longitude is from -122.51431 to -122.36731. As shown in
Fig. 4, the observed area is approximately 11.03 × 7.6km2
,
which is divided into 8 grids (local clouds) according to the
spatial distribution of vehicle hotspots in Fig. 5 [37]. The
coverage of each local cloud is about 11 km2
. In an urban
area, the vehicles often take familiar routes in a specified
time period, such as similar trajectories from home to work in
the day time [38]. We also deploy 8 pseudonym pools in the
observed area shown in Fig. 4, whose locations are restricted
by the geographical conditions and the traffic load of each
local cloud. The pseudonym pools 1, 2, 3 and 4 are deployed
in the commercial areas. And the pseudonym pools 5, 6, 7 and
8 belong to the residential areas. This deployment strategy of
local clouds follows the spatio-temporal distributions of the
vehicles.
In this paper, we use the OpenFlow protocol to deploy the
SDN [16]. Every pseudonym pool connects with an OpenFlow
switch, which is responsible for forwarding the pseudonym
flow. A global OpenFlow controller is deployed at a remote
cloud, which acts as the central cloud. There exists a data
7

Algorithm 1 Pseudonym distribution algorithm
// An element denoted as A[j] in an array A[N] indicates
how many pseudonym packets this OP, OPi, has transferred
to RPj+1.
1: Initialize an array A[N] = 0 and j = 0.
2: while t ∈ T do
3: Generate a pseudonym package, pt
i.
4: if there is a local pseudonym request then
5: Deliver pt
i to the local requester.
6: else
7: Initialize Flag ← 0.
8: while
N−1∑
k=0
A[k] <
N∑
k=1
ti,k AND Flag do
9: while j < N AND Flag do
10: if A[j] < ti,j+1 then
11: Transfer pt
i to RPj+1.
12: A[j] ← A[j] + 1
13: Next RP, j ← j + 1
14: if j == N then
15: Initialize again, j ← 0
16: end if
17: end if
18: end while
19: end while
20: if
N−1∑
k=0
A[k] ==
N∑
k=1
ti,k then
21: Store pt
i locally.
22: end if
23: end if
24: Next time slot,t ← t + 1
25: end while
center in the central cloud, which collects global real-time
status information of the network. The OpenFlow controller
can access to the global information for predictions, analyses
and decisions. According to pseudonym-ﬂow rules designed
by the OpenFlow controller, pseudonym resource is scheduled
among the pseudonym pools.
The pseudonym pools communicate with each other through
wired communication technologies. For simplicity, the trans-
mission cost of pseudonyms (i.e., package dropout rate) is set
to 1 unit/km and the generating rate of each pseudonym pool
can be equal, denoted by θ [14]. According to the vehicular
statistic data in [37], we set that the pseudonyms consuming
process of each pseudonym pool follows a Poisson process,
which the mean value ranges from 100 to 400 units per minute
with an observation time period (i.e., 1 hour).
Actually, the wired connections among the pseudonym
pools are restricted by geographical conditions. For example,
pseudonym pool 7 is screened on three sides by three hills.
It cannot directly connect to pseudonym pool 4, 6 and 8
since there are some geographical obstructions, such as hills
and lakes. The network construction expense is too high
to establish communication links across the hills. Therefore
pseudonym pool 7 only establishes network connectivity with
pseudonym pool 1 to decrease the network construction ex-
pense. The nearby pseudonym pools without geographical
Fig. 4: The connection of pseudonym pools in the real map
of San Francisco.
Fig. 5: Spatial distribution of vehicle hotspots.
obstructions are directly connected with each other. Some
pseudonym pools, that are far away from others, can also
connect with each other through multi-hop transmission, e.g,
pseudonym pools 2 and 6.
A. Performance Comparison of Different Approaches
To further analyze the performance of our proposed ap-
proach, we consider a typical scenario of unbalanced demands
of pseudonyms among pseudonym pools. The pseudonym
pools are divided into two sides: four pseudonym pool-
s receiving pseudonyms from OPs (denoted as RP =
{P1, P2, P3, P4}) and four pseudonym pools that offer
pseudonyms to others (denoted as OP = {P5, P6, P7, P8}).
The pseudonym generating rate of each pseudonym pool is
100 units/minute. During the observation period of 1 hour, if
the pseudonyms consuming rates of the RPs range from 300
to 400 units/minute, it indicates that the RPs are busy. While
if pseudonym consuming rates of the OPs range from 100 to
200 units/minute, it indicates that the RPs are idle.
The pseudonym pools cooperate to share idle pseudonyms
using two-sided matching theory. During the observation time,
8

0 1 2 3 4 5 6 7 8
0
20
40
60
80
100
120
Pseudonym pool
Probabilityofchangingpseudonyms(%)
Without cooperation
With cooperation
Average value without cooperation
Average value with cooperation
Fig. 6: The performance comparison with respect to the
probability of obtaining pseudonyms from pseudonym pool.
0 1 2 3 4 5 6 7 8
0
0.5
1
1.5
2
2.5
3
x 10
4
Pseudonym pool
Totalnumberofservicedvehicles
Without cooperation
With coopeation
Average value without cooperation
Average value with cooperation
Fig. 7: The performance comparison of the total number of
served vehicles.
the probability of vehicles obtaining pseudonyms from a
pseudonym pool is expressed by POi = min(1 −
Rt
i+θiT
λt
iT
, 1).
Fig. 6 shows the performance comparison of different ap-
proaches with respect to the probability of vehicles obtaining
pseudonyms from pseudonym pools. From this figure, OPs
are always able to satisfy the demands of the vehicles during
observation time. It means that idle pseudonym resource
sharing has no influence on the performance of OPs since
the OPs have enough pseudonyms to satisfy pseudonym de-
mands of local vehicles. Moreover, RPs are able to improve
POi through obtaining some pseudonyms from OPs with the
help of pseudonym-sharing. As a result, the performance of
the whole network is improved when the pseudonym pools
cooperate with each other. The average value of probability
in our proposed approach is about 28% higher than that
without pseudonym-cooperation. Similar improvement can be
observed in Fig. 7, where the performance index is the total
number of served vehicles. The average value of the total
50 100 150 200
12.8
13
13.2
13.4
13.6
13.8
14
14.2
14.4
14.6
θ
Averageentropyofvehiclesinthesystem
Without cooperation
With cooperation
Fig. 8: The performance comparison of different approaches
with respect to privacy entropy.
50 100 150 200 250
0
10
20
30
40
50
60
70
θ
Systemoverhead
NPPM Scheme
Our Scheme
Fig. 9: The performance comparison of different approaches
with respect to system overhead.
number of served vehicles with our proposed scheme is 40%
higher than that without cooperation scheme.
Generally, the level of location privacy is quantified as the
uncertainty of the information related to a specific vehicle.
Here, the uncertainty is described by privacy entropy H. The
maximum H of a local cloud is given by Hm = log2(|S|)
[39]. Here, |S| represents the total number of served vehicles,
which can obtain the needed pseudonyms. Fig. 8 shows that
the improvement of the average entropy of vehicles with
cooperation is influenced by the pseudonyms generating rate
θ. When the generating rate of pseudonyms is 50 units/minute,
the maximum improved entropy is 12% in our scheme. This
emphasizes the importance of pseudonym-cooperation among
pseudonym pools to improve the privacy entropy of vehicles
when the pseudonym-generating rate is low. As the generating
rate of the pseudonym pools increases, the change of average
entropy is not obvious. It is because most of the pseudonym
pools can gradually satisfy the vehicles’ demands by them-
9

selves.
Fig. 9 shows system overhead comparison between our
proposed scheme with the existing scheme [14]. One of the
existing schemes only schedules pseudonym resource among
nearby local clouds, which is called as Nearby Pseudonym
Pools Matching (NPPM) scheme in this paper. Fig. 9 show
that our proposed scheme has less system overhead than that
of the NPPM scheme. It is because that pseudonym resource
in our scheme is scheduled via a global optimal way. In our
scheme, the two-sided matching theory is utilized to decreases
system overhead due to cost of inter-pool communication-
s. While the NPMM scheme can only schedule a part of
pseudonym resource among the nearby pseudonym pools,
which generally takes more pseudonym-scheduling times to
satisfy pseudonym demand. Especially, when θ decreases, the
number of pseudonym-scheduling times is increasing leading
to bigger system overhead.
B. Impacts of Different System Parameters
Fig. 10 shows the total amount of pseudonyms offered by
OPs with respect to different system parameters. Here, we set
the system parameters as [k, a, b] = [100, 1, 0.5]. The total
amount of offered pseudonyms by OPs increases when the
generating rate of pseudonyms θ increases. The figure shows
that OPs can offer more idle pseudonyms when they generate
more pseudonyms. The amount of offered pseudonyms is
influenced by the following predefined parameters, k, a, b and
θ. Fig. 10(a) shows the higher value of willingness constant
(k) brings more pseudonyms offered by OPs, when other
system parameters are fixed. Fig. 10(b) shows that when the
redundant level constant (a) increases, the total amount of
offered pseudonyms also increases. But Fig. 10(c) shows that
the total amount of pseudonyms offered by OPs is decreased
when OPs pay much more attention to predicted demand level
(b) of the next time period. In summary, the system parameters,
θ, k and a, are beneficial to increase the total amount of
pseudonyms offered by OPs. While the pseudonym demands
of the next time period brings negative influence to the
total amount of offered pseudonyms. When the pseudonym-
generation rate is high, the OPs are willing to share their idle
pseudonyms to others. Otherwise, the OPs are not willing to
share pseudonyms even if k, and a are higher. Apparently, the
OPs should first satisfy their own demand of pseudonyms, and
then consider to help others.
VIII. CONCLUSIONS
In this paper, we have proposed a software-defined
pseudonym system, which exploits SDN technology to sched-
ule and manage the pseudonyms among distributed pseudonym
pools. We have designed a hierarchical architecture of SDPS
for scheduling pseudonym resource from a global perspec-
tive. To decrease the system overheads due to the cost of
inter-pool communications, we adopted a two-side matching
theory to formulate and solve the matching problem among
the pseudonym pools. Through extensive numerical result-
s, we have illustrated that SDPS is efficient in improving
pseudonym-utilization, and that it also effectively strengthens
the location privacy of the vehicles.
50 100 150 200 250
0
0.5
1
1.5
2
2.5
3
3.5
x 10
4
θ
Totalamountofofferingpseudonyms
k=50,a=1,b=0.5
k=100,a=1,b=0.5
k=150,a=1,b=0.5
(a) Different values of willingness constant (k).
50 100 150 200 250
0
0.5
1
1.5
2
2.5
3
x 10
4
θ
k=100,a=0.5,b=0.5
k=100,a=1,b=0.5
k=100,a=5,b=0.5
(b) Different values of redundant level constant (a).
50 100 150 200 250
0
0.5
1
1.5
2
2.5
3
3.5
x 10
4
θ
k=100,a=1,b=0.3
k=100,a=1,b=0.5
k=100,a=1,b=0.7
(c) Different values of demand level constant (b).
Fig. 10: Performance comparison of the total amount of
pseudonyms offered by OPs with respect to different k, a
and b.
IX. ACKNOWLEDGMENT
The work is supported in part by programs of NSFC under
Grant nos. 61422201, 61370159 and U1201253, U1301255,
10

the Science and Technology Program of Guangdong Province
under Grant no. 2015B010129001, Special-Support Project of
Guangdong Province under grant no. 2014TQ01X100, High
Education Excellent Young Teacher Program of Guangdong
Province under grant no. YQ2013057, Science and Technol-
ogy Program of Guangzhou under grant no. 2014J2200097
(Zhujiang New Star Program), and is partially supported by
the projects 240079/F20 funded by the Research Council of
Norway.
REFERENCES
[1] S. Xie and Y. Wang, “Construction of tree network with limited delivery
latency in homogeneous wireless sensor networks,” Wireless personal
communications, vol. 78, no. 1, pp. 231–246, 2014.
[2] J. Shen, H. Tan, J. Wang, J. Wang, and S. Lee, “A novel routing protocol
providing good transmission reliability in underwater sensor networks,”
Journal of Internet Technology, vol. 16, no. 1, pp. 171–178, 2015.
[3] Y. Ren, J. Shen, J. Wang, J. Han, and S. Lee, “Mutual verifiable provable
data auditing in public cloud storage,” Journal of Internet Technology,
vol. 16, no. 2, pp. 317–323, 2015.
[4] M. Gerla, E. K. Lee, G. Pau, and U. Lee, “Internet of vehicles: From
intelligent grid to autonomous cars and vehicular clouds,” in Internet
of Things (WF-IoT), 2014 IEEE World Forum on, pp. 241–246, March
2014.
[5] X. Jiang, X. Cao, and D. H. C. Du, “Multihop transmission and retrans-
mission measurement of real-time video streaming over dsrc devices,” in
World of Wireless, Mobile and Multimedia Networks (WoWMoM), 2014
IEEE 15th International Symposium on a, pp. 1–9, June 2014.
[6] J. Li, X. Li, B. Yang, and X. Sun, “Segmentation-based image copy-
move forgery detection scheme,” Information Forensics and Security,
IEEE Transactions on, vol. 10, no. 3, pp. 507–518, 2015.
[7] B. Gu, V. S. Sheng, K. Y. Tay, W. Romano, and S. Li, “Incremental
support vector learning for ordinal regression,” Neural Networks and
Learning Systems, IEEE Transactions on, vol. 26, no. 7, pp. 1403–1416,
2015.
[8] Z. Pan, Y. Zhang, and S. Kwong, “Efficient motion and disparity
estimation optimization for low complexity multiview video coding,”
Broadcasting, IEEE Transactions on, vol. 61, no. 2, pp. 166–176, 2015.
[9] M. Tinghuai, Z. Jinjuan, T. Meili, T. Yuan, A.-D. Abdullah, A.-R.
Mznah, and L. Sungyoung, “Social network and tag sources based aug-
menting collaborative recommender system,” IEICE TRANSACTIONS
on Information and Systems, vol. 98, no. 4, pp. 902–910, 2015.
[10] F. Zhangjie, S. Xingming, L. Qi, Z. Lu, and S. Jiangang, “Achieving
efficient cloud search services: multi-keyword ranked search over en-
crypted cloud data supporting parallel computing,” IEICE Transactions
on Communications, vol. 98, no. 1, pp. 190–200, 2015.
[11] R. Yu, Y. Zhang, S. Gjessing, W. Xia, and K. Yang, “Toward cloud-based
vehicular networks with efficient resource management,” Network, IEEE,
vol. 27, no. 5, pp. 48–55, 2013.
[12] Z. Xia, X. Wang, X. Sun, and Q. Wang, “A secure and dynamic
multi-keyword ranked search scheme over encrypted cloud data,” IEEE
Transactions on Parallel and Distributed Systems, vol. 27, pp. 340–352,
Feb. 2016.
[13] P. Guo, J. Wang, B. Li, and S. Lee, “A variable threshold-value
authentication architecture for wireless mesh networks,” Journal of
Internet Technology, vol. 15, no. 6, pp. 929–936, 2014.
[14] J. Petit, F. Schaub, M. Feiri, and F. Kargl, “Pseudonym schemes in
vehicular networks: a survey,” Communications Surveys & Tutorials,
IEEE, vol. 17, no. 1, pp. 228–255, 2015.
[15] Y. Park, C. Sur, and K.-H. Rhee, “Pseudonymous authentication for
secure v2i services in cloud-based vehicular networks,” Journal of
Ambient Intelligence and Humanized Computing, pp. 1–11, 2015.
[16] D. Kreutz, F. M. Ramos, P. Esteves Verissimo, C. Esteve Rothenberg,
S. Azodolmolky, and S. Uhlig, “Software-defined networking: A com-
prehensive survey,” Proceedings of the IEEE, vol. 103, no. 1, pp. 14–76,
2015.
[17] E. Lee, E.-K. Lee, M. Gerla, and S. Y. Oh, “Vehicular cloud networking:
architecture and design principles,” Communications Magazine, IEEE,
vol. 52, no. 2, pp. 148–155, 2014.
[18] S. Bitam, A. Mellouk, and S. Zeadally, “Vanet-cloud: a generic cloud
computing model for vehicular ad hoc networks,” Wireless Communi-
cations, IEEE, vol. 22, no. 1, pp. 96–102, 2015.
[19] X. Jiang and D. H. Du, “Bus-vanet: A bus vehicular network integrated
with traffic infrastructure,” Intelligent Transportation Systems Magazine,
IEEE, vol. 7, no. 2, pp. 47–57, 2015.
[20] K. Zheng, H. Meng, P. Chatzimisios, L. Lei, and X. Shen, “An
smdp-based resource allocation in vehicular cloud computing systems,”
Industrial Electronics, IEEE Transactions on, vol. 62, no. 12, pp. 7920–
7928, 2015.
[21] M. A. Salahuddin, A. Al-Fuqaha, and M. Guizani, “Software-defined
networking for rsu clouds in support of the internet of vehicles,” Internet
of Things Journal, IEEE, vol. 2, no. 2, pp. 133–144, 2015.
[22] J. Ding, R. Yu, Y. Zhang, S. Gjessing, and D. H. Tsang, “Service
provider competition and cooperation in cloud-based software defined
wireless networks,” Communications Magazine, IEEE, vol. 53, no. 11,
pp. 134–140, 2015.
[23] J. Chase, R. Kaewpuang, W. Yonggang, and D. Niyato, “Joint virtual
machine and bandwidth allocation in software defined network (sdn) and
cloud computing environments,” in Communications (ICC), 2014 IEEE
International Conference on, pp. 2969–2974, June 2014.
[24] A. V. Akella and K. Xiong, “Quality of service (qos)-guaranteed
network resource allocation via software defined networking (sdn),” in
Dependable, Autonomic and Secure Computing (DASC), 2014 IEEE 12th
International Conference on, pp. 7–13, Aug. 2014.
[25] Z. He, J. Cao, and X. Liu, “Sdvn: Enabling rapid network innovation
for heterogeneous vehicular communication,” IEEE Network Magazine
Special Issue on Software Defined Wireless Networks, 2015.
[26] R. Yu, J. Ding, X. Huang, M. T. Zhou, S. Gjessing, and Y. Zhang,
“Optimal resource sharing in 5g-enabled vehicular networks: A matrix
game approach,” IEEE Transactions on Vehicular Technology, to be
published, 2016.
[27] M. Raya and J.-P. Hubaux, “Securing vehicular ad hoc networks,”
Journal of Computer Security, vol. 15, no. 1, pp. 39–68, 2007.
[28] Y. Sun, Z. Feng, Q. Hu, and J. Su, “An efficient distributed key man-
agement scheme for group-signature based anonymous authentication in
vanet,” Security and Communication Networks, vol. 5, no. 1, pp. 79–86,
2012.
[29] U.S. Census Bureau. ”TIGER, TIGER/Line and TIGER-Related Prod-
ucts”. [Online]. Available: http://www.census.gov/geo/www/tiger/.
[30] Y. Sun, X. Lin, R. Lu, X. Shen, and J. Su, “Roadside units deployment
for efficient short-time certificate updating in vanets,” in Communica-
tions (ICC), 2010 IEEE International Conference on, pp. 1–5, IEEE,
2010.
[31] K. Singh, P. Saini, S. Rani, and A. K. Singh, “Authentication and privacy
preserving message transfer scheme for vehicular ad hoc networks
(vanets),” in Proceedings of the 12th ACM International Conference
on Computing Frontiers, CF ’15, (New York, NY, USA), pp. 58:1–58:7,
ACM, 2015.
[32] D. Huang, S. Misra, M. Verma, and G. Xue, “Pacp: An efficient
pseudonymous authentication-based conditional privacy protocol for
vanets,” Intelligent Transportation Systems, IEEE Transactions on,
vol. 12, no. 3, pp. 736–746, 2011.
[33] H. Kim and N. Feamster, “Improving network management with soft-
ware defined networking,” Communications Magazine, IEEE, vol. 51,
no. 2, pp. 114–119, 2013.
[34] G. Baltoglou, E. Karapistoli, and P. Chatzimisios, “Iptv qos and qoe
measurements in wired and wireless networks,” in Global Communi-
cations Conference (GLOBECOM), 2012 IEEE, pp. 1757–1762, Dec.
2012.
[35] G. Sabidussi, “The centrality index of a graph,” Psychometrika, vol. 31,
no. 4, pp. 581–603, 1966.
[36] D. Gale and L. S. Shapley, “College admissions and the stability of
marriage,” American mathematical monthly, pp. 9–15, 1962.
[37] M. A. Hoque, X. Hong, and B. Dixon, “Analysis of mobility patterns
for urban taxi cabs,” in Computing, Networking and Communications
(ICNC), 2012 International Conference on, pp. 756–760, IEEE, 2012.
[38] Y. Li, D. Jin, Z. Wang, P. Hui, L. Zeng, and S. Chen, “A markov jump
process model for urban vehicular mobility: modeling and applications,”
Mobile Computing, IEEE Transactions on, vol. 13, no. 9, pp. 1911–1926,
2014.
[39] K. Sampigethaya, M. Li, L. Huang, and R. Poovendran, “Amoeba:
Robust location privacy scheme for vanet,” Selected Areas in Commu-
nications, IEEE Journal on, vol. 25, no. 8, pp. 1569–1589, 2007.
11

Xumin Huang is now a Ph.D. student of net-
worked control systems in Guangdong University
of Technology, China. His research interests mainly
focus on network performance analysis, simulation
and enhancement in wireless communications and
networking.
Rong Yu [S’05, M’08] received his Ph.D. degree
from Tsinghua University, China, in 2007. He is a
full professor Guangdong University of Technology
(GDUT) now. His research interest mainly focuses
on wireless communications and networking, in-
cluding cognitive radio, wireless sensor networks,
and home networking. He is the co-inventor of
over 10 patents and author or co-author of over 70
international journal and conference papers. Dr. Yu
is currently serving as the deputy secretary general
of the Internet of Things (IoT) Industry Alliance,
Guangdong, China, and the deputy head of the IoT Engineering Center,
Guangdong, China. He is the member of home networking standard committee
in China, where he leads the standardization work of three standards.
Jiawen Kang received the M.S. degree from the
Guangdong University of Technology, China, in
2015. He is now pursuing his Ph.D. degree in
Guangdong University of Technology, China. His
research interests mainly focus on resource man-
agement, security and privacy protection in wireless
communications and networking. He is the author or
co-author of 15 papers published in journals, maga-
zines, and proceedings of international conferences.
Ning Wang [M12] received the M.E. degree in
electronic engineering from Nanyang University,
Singapore, and the Ph.D. degree in electronic en-
gineering from the University of Surrey, Guildford,
U.K., in 2000, and 2004, respectively. Since 2009,
he has been the Principal Investigator for several
EU and U.K. Research Grants in the areas of future
internet design and network management and con-
trol. He is currently a Reader with the Institute for
Communication Systems, University of Surrey. His
current research interests include information-centric
networking, network resource management and optimization, and smart grid
communications.
Sabita Maharjan [M’09] is currently a Post-
Doctoral Fellow with Simula Research Laboratory,
Fornebu, Norway. She received her M.E. degree
from the Antenna and Propagation Laboratory, Toky-
o Institute of Technology, Tokyo, Japan, in 2008, and
Ph.D. degree in Networks and Distributed Systems
from Simula Research Laboratory and University
of Oslo, Norway, in 2013. Her research interests
include wireless networks, network security and re-
silience, smart grid communications, cyber-physical
systems, machine-to-machine communications and
software deﬁned wireless networking.
Yan Zhang [SM’10] is currently Head of Depart-
ment, Department of Networks at Simula Research
Laboratory, Norway; and an Associate Professor
(part-time) at the Department of Informatics, Uni-
versity of Oslo, Norway. He received a Ph.D. degree
in School of Electrical & Electronics Engineering,
Nanyang Technological University, Singapore. He
is an associate editor or on the editorial board of
a number of well-established scientiﬁc international
journals, e.g., Wiley Wireless Communications and
Mobile Computing (WCMC). He also serves as the
guest editor for IEEE Transactions on Smart Grid, IEEE Transactions on
Dependable and Secure Computing, IEEE Transactions on Industrial Infor-
matics, IEEE Communications Magazine, IEEE Wireless Communications,
IEEE Network, IEEE Systems and IEEE Internet of Things. He serves as
chair positions in a number of conferences, including IEEE PIMRC 2016,
IEEE Cloudcom 2016/2015, IEEE CCNC 2016, IEEE ICCC 2016, WICON
2016, and IEEE SmartGridComm 2015. He serves as TPC member for
numerous international conference including IEEE INFOCOM, IEEE ICC,
IEEE GLOBECOM, and IEEE WCNC. His current research interest include:
wireless networks and reliable and secure cyber-physical systems (e.g., smart
grid, transport, healthcare). He has received 8 Best Paper Awards. He is a
senior member of IEEE, IEEE ComSoc, IEEE VT society, IEEE PES and
IEEE Computer society. He is a Fellow of IET.
12

Software defined networking with pseudonym systems for secure vehicular clouds

More Related Content

What's hot (20)

Similar to Software defined networking with pseudonym systems for secure vehicular clouds (20)

More from redpel dot com (20)

Recently uploaded (20)

Software defined networking with pseudonym systems for secure vehicular clouds