Log In Sign Up

PRIF: A Privacy-Preserving Interest-Based Forwarding Scheme for Social Internet of Vehicles

by   Liehuang Zhu, et al.

Recent advances in Socially Aware Networks (SANs) have allowed its use in many domains, out of which social Internet of vehicles (SIOV) is of prime importance. SANs can provide a promising routing and forwarding paradigm for SIOV by using interest-based communication. Though able to improve the forwarding performance, existing interest-based schemes fail to consider the important issue of protecting users' interest information. In this paper, we propose a PRivacy-preserving Interest-based Forwarding scheme (PRIF) for SIOV, which not only protects the interest information, but also improves the forwarding performance. We propose a privacy-preserving authentication protocol to recognize communities among mobile nodes. During data routing and forwarding, a node can know others' interests only if they are affiliated with the same community. Moreover, to improve forwarding performance, a new metric community energy is introduced to indicate vehicular social proximity. Community energy is generated when two nodes encounter one another and information is shared among them. PRIF considers this energy metric to select forwarders towards the destination node or the destination community. Security analysis indicates PRIF can protect nodes' interest information. In addition, extensive simulations have been conducted to demonstrate that PRIF outperforms the existing algorithms including the BEEINFO, Epidemic, and PRoPHET.


page 1

page 10


PPLS: A Privacy-Preserving Location-Sharing Scheme in Vehicular Social Networks

Recent advances in Socially Aware Networks (SANs) have allowed its use i...

PBAG: A Privacy-Preserving Blockchain-based Authentication Protocol with Global-updated Commitment in IoV

Internet of Vehicles(IoV) is increasingly used as a medium to propagate ...

Data Dissemination Using Interest Tree in Socially Aware Networking

Socially aware networking (SAN) exploits social characteristics of mobil...

A Spectrum Aware Mobility Pattern Based Routing Protocol for CR-VANETs

Cognitive radio technology offers an important function in the efficient...

Social Vehicle Swarms: A Novel Perspective on Social-aware Vehicular Communication Architecture

Internet of vehicles is a promising area related to D2D communication an...

PIS: A Multi-dimensional Routing Protocol for Socially-aware Networking

Socially-aware networking is an emerging paradigm for intermittently con...

Efficient and Privacy-Preserving Ride Sharing Organization for Transferable and Non-Transferable Services

Ride-sharing allows multiple persons to share their trips together in on...

I Introduction

The recent proliferation of mobile devices (e.g., mobile phones, vehicle onboard equipment, tablets, etc.) has changed the future of communication and services [1]. Due to the inseparable bond between mobile devices and their human carriers, social relationships and users’ mobility aspects are exploited in various research fields, such as Opportunistic Networks (OppNets) [2], Vehicular Ad-hoc Networks [3], and Delay Tolerant Networks [4]. This emerging network paradigm, also known as Socially Aware Networking (SAN), is able to take advantage of users’ social properties, and further uses them as a main design ingredient for social Internet of vehicles (SIOV), a communication network where vehicles behave “socially” [5], [6].

SIOV works similarly to OppNets and DTNs, as they all lack end-to-end fixed paths from the source to the destination, they utilize store-carry-forward paradigm for such services. When there is a need for data dissemination, a key problem for these networks is to predict the future encounter opportunity. Nevertheless, the difference between SIOV and OppNets (or DTNs) is that SIOV considers social properties of devices to solve the data routing and forwarding problems and challenges.

Fig. 1: Virtual Social Networks and Social Internet of Vehicles. Mobile devices (red, blue and yellow circles) form electronic social networks when they are in proximity, while vehicles (red and blue circles) establish social ties based on contact frequency or common interests.

Fig. 1 depicts two social levels in vehicular environment. Vehicles/individuals carrying mobile devices (e.g., smartphone, smart watch, digital camera, etc.) construct social Internet of vehicles when they are in communication range, and their inherent social ties determine virtual social networks. Generally, social relationships are relatively stable and change less frequently than transmission links among mobile devices. Therefore, it is crucial to take advantage of mobile devices’ social properties to make smarter forwarding decisions.

Recently, a series of social-based routing protocols, [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17] have been proposed. Most of them adopt the notion of “community” to make forwarding decisions. Specifically, mobile nodes can be divided into different communities based on their contact frequency or social relationships. It is generally agreed that members in a same community meet each other more often than others in different communities. Thus, a forwarding decision usually relies on how to construct a community and choose suitable forwarders. For example, LocalCom [7] detects communities using neighboring graphs, while Gently [8] chooses forwarders based on CAR-like [9] and Label [10] protocols. Communities in these schemes can be obtained from historical records such as encounter frequency, encounter length, and separation time. However, they ignore nodes’ inherent social relationships, especially considering that mobile nodes are always carried and used by people. Many forwarding schemes [10], [11], [12], [13], [14] have been proposed based on social network metrics. For example, Label [13] and Group [14] deliver messages only if message carriers meet the members within the same social community of the destination node, while Bubble Rap [11] uses a hierarchical community structure and forwards data if a node holds higher centrality. These social-based works utilize social relationships to make better forwarding strategies. Nevertheless, the drawback in these schemes is that the cost to form and maintain communities is high. Recently, Xia et al. [15] proposed a forwarding scheme named BEEINFO-DS which uses personal interests to construct communities. By using interest information, it eliminates the cost of community detection and formation. However, broadcasting the interest information is dangerous, since the interest usually contains users’ sensitive information, which can be used to directly or indirectly determine trajectories, habits, and religious beliefs, etc.

In this paper, we propose PRIF: a PRivacy-preserving Interest-based Forwarding scheme to protect the sensitive interest information and improve the forwarding efficiency for SIOV. To summarize, the contributions of PRIF include:

  • First, we classify communities based on personal interests. Inspired by BEEINFO-D

    S and general laws in practical physics, a novel social metric community energy is introduced to measure the social ability of a mobile node to forward messages to others. Generally, community energy is generated by node encounters. Specifically, a node will establish inter-community energy to the encountering node, if it is within the same community. Otherwise, intra-community energy will be built towards the encountering node community. Therefore, a better forwarder should be a node with higher inter-community energy to the destination node, or a node with higher intra-community energy towards the destination community.

  • Second, the interest information is private, and it is dangerous to deliver it to others. Thus, we take advantage of signature-based envelops and design a privacy-preserving authentication protocol. In this way, a node can recognize the members coming from which communities. However, it cannot know the interests of the members unless they are affiliated to the same group with it.

  • Third, extensive simulation analysis has been conducted to compare PRIF with several existing schemes. Specifically, compared with two representative schemes, i.e., Epidemic [18] and PRoPHET [19], PRIF performs better in message delivery, overhead, and hop counts. In addition, the proposed scheme outperforms the existing interest-based scheme BEEINFO-DS in delivery ratio and overhead.

The rest of this paper is organized as follows: In section II, we review existing social-based data forwarding protocols. Section III describes the detailed design of PRIF for SIOV. In section IV, we give the security analysis of PRIF and in section V, we analyze the performance. Finally, we conclude our work in section VI.

Ii Related works

In recent years, feature extraction has received considerable attention in various fields

[20], [21], [22],[23], [24]. In VANETs, to adapt to the frequently changing topology and high-speed mobility [25], [26], [27], social property as a special feature among people, plays an important role in designing routing algorithms. Many social-based routing algorithms [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17] have been proposed which are roughly based on two main aspects: behavior regularity and community information.

Behavior regularity focuses on individuals’ behaviors. It relies on the principle that people usually have repeated mobility patterns. In real world, people often hold similar mobility patterns. For instance, they usually follow similar paths from their home to offices during weekdays. Accordingly, regular behaviors can be used to predict the future encounter probability, and works in

[12], [16], [17] have proposed algorithms based on this metric. For example, SimBet [12] constructs a utility function by exploiting the similarity and betweenness centrality to the destination with the help of an ego network. To describe nodes’ relationships, SimBetTS [16] considers another important factor (i.e., social tie strength) to choose more suitable forwarders. Moreover, HiBOp [17] can automatically learn users’ behaviors and social relations to execute the forwarding process.

Another important basis to support social-based routing is community information. Generally, communities can be constructed by individuals’ interests or encounter frequency, and it is generally agreed that nodes coming from the same community will meet each other more frequently. A series of routing algorithms have been proposed based on this metric [7], [8], [10], [11], [13], [14], [15]. The simplest community-based routing method is LABEL [10], in which messages are only delivered to the nodes in the destination community. Similar to the scheme in [10], Li et al. [14] proposed a new community-based scheme. However, [10] and [14] do not take nodes’ relationships into consideration. To solve the problem, Bubble Rap [11] and Friendship-based [13] were proposed to select nodes with higher social centrality as relay nodes. Nevertheless, these schemes suffer a common drawback that the cost to form and maintain a socially aware overlay is extremely high. Besides the intra-community routing, inter-community routings were considered in [7] and [8]. LocalCom [7] utilized the encounter history such as encounter frequency, encounter period and separation time to construct a neighboring graph which was further utilized to detect communities, represent nodes’ similarity for intra-community, and design routing strategies for inter-community communication, while Gently [8] adopted a context-aware adaptive routing (CAR) algorithm and LABEL protocol. When no nodes within the destination community are in reach, Gently adopts the CAR-like routing algorithm. When the message carrier encounters a node coming from the destination community, it utilizes a LABEL-based protocol. Finally, a CAR-like routing strategy is used again to transmit the messages to the destination node in the destination community. These schemes predict future encounter probability by using historical records. However, nodes’ group identities are ignored. Xia et al. [15] recently proposed an interest-based routing algorithm, called BEEINFO. This scheme is constructed based on a fact that people usually gather together to obtain and share their interest information. Therefore, they utilize interests to form communities, and design different forwarding strategies. However, they fail to protect the sensitive interest information.

The motivation for the proposed PRIF approach is to protect nodes’ interests and make forwarding decisions. Specifically, to detect and maintain communities, similar to BEEINFO, PRIF uses interests to construct communities. To protect nodes’ interests, a privacy-preserving authentication protocol is designed. Considering people’s regular behaviors, PRIF gathers nodes’ community information, and predicts the future destination community or destination node encounter probability.

Iii Privacy-Preserving Interest-Based Forwarding

This section elaborates the design details of PRIF. We first give an overview of the whole scheme, and introduce the community detection method followed by the key concept of PRIF: a new social metric as community energy. In addition, we powered our proposed work with efficient key management scheme based on some previous works [28, 29, 30].Then, we introduce the privacy-preserving interest-based forwarding scheme.

Iii-a Overview

The system model considered in this paper is a typical SIOV application scenario. There are potentially three kinds of mobile objects in the street: cars, buses, and pedestrians. Each car or bus owns a vehicle device, and each pedestrian carries a mobile device. They communicate with each other through wireless interface such as Wi-Fi or Bluetooth. In this paper, we use nodes to represent these devices. The aim of the application is to design an effective forwarding strategy by using these mobile nodes, without disclosing their interest information.

Since mobile nodes are used and controlled by people, the carriers111Carrier: Refers to the vehicle/individual carrying a mobile device. It does not represent the cellular service provider. behavior can be an exact indicator of the nodes behavior. Thus, we take advantage of the human social property (i.e., interests) to make forwarding decisions. Normally, people have different interests. Although interests usually change over time, they can be considered relatively stable in a given time period. For example, some people are interested in reading in day-to-day activities, but during the World Cup, they may pay more attention to football. People with the same interest get together more often than others to obtain and share their interest information. For instance, people who share the interest of shopping appear frequently in the shopping malls but they nearly have no interaction with those who are interested in fishing. We assume a community is only related to one interest. If a person has more than one interest, he/she will belong to several communities simultaneously. In order to make our scheme easily understandable, similar to [15], each node is assumed to only hold one interest. During the forwarding process, node’s interest information should be protected. We summarize the assumptions of the system below.

  • There are three types of mobile nodes (cars, buses and pedestrians) in the application scenario, which forms a typical SIOV.

  • There are no malicious nodes, and nodes are fully cooperative when forwarding messages.

  • Each node only has one interest, and nodes with the same interest form a community.

  • Each node must register itself with Trust Authority (TA).

The notations used in this paper are listed in Table I.

Symbol Definition
M Messages to deliver
Source node
Destination node
Intermediate node
Interest of the source node
Interest of the destination node
Interest of an intermediate node
Inter-community energy between and
Intra-community energy between and the community
Inter-community energy prediction factor
Intra-community energy prediction factor
TABLE I: Notations

Iii-B Community Energy

In this section, we will introduce the concept of community energy which is inspired by molecular chemistry.

Iii-B1 Inter-community Energy

In reality, molecules are composed of atoms and there exist forces among atoms. Similarly, we assume a force is generated when two nodes encounter one another. The force, called inter-community energy, represents their social tie and determines their contact strength. The stronger energy a node has, the more opportunities it has to successfully deliver messages. Note that the inter-community energy is only generated among nodes of the same community. We use Eq. (1), shown below, to define the inter-community energy between the nodes and ,


where is the contact duration between and in the -th encounter, and represents the duration that has elapsed from -th encounter end to -th encounter end.

The inter-community energy has a transitive property, which is based on an observation in reality. For example, if a person A frequently meets B, and meanwhile B frequently meets C, then A is also considered as a good forwarder to deliver messages to C though they may not encounter one another. Similarly, as shown in Fig. 2(a), a node establishes an energy to a node , and builds an energy to a node . Then, an indirect energy between and is generated as in Eq. (2), which is similar to [19],


The nodes with high energy in the past usually are good forwarders in the future. Therefore, we define the energy prediction as in Eq. (3) using an Exponential Weighted Moving Average (WEMA) [31],


where is the inter-community energy prediction factor.

(a) Inter-community energy
(b) Intra-community energy
Fig. 2: Community energy.

Iii-B2 Intra-community Energy

In social networks, if a person encounters others from the same community frequently, the person can be considered as a good choice to forward messages destined for this community. We utilize degree centrality, which is the number of community nodes that a node encounters, to measure the community strength of the node, as shown in Fig. 2(b). However, considering the fast movement of mobile nodes, it may not be reasonable to directly use degree centrality. For example, a car may encounter many nodes interested in shopping around a shopping mall but fewer such nodes will be encounter after passing by the mall. Thus, we use average degree centrality to represent the intra-community energy between the node and the community , as in Eq. (4),


In Eq. (4), is the total number of nodes belonging to the same community that a node encounters from the first encounter to the -th encounter, and is the duration time. If does not encounter members from the community for a long time, its intra-community energy will decrease sharply. In addition, we use Eq. (5) to combine the past and present observations to predict the future intra-community energy. is the intra-community energy prediction factor, which is similar to in Eq. (3).


Iii-B3 Energy Decay

Finally, we consider the fact that if nodes do not encounter each other in a period of time, they may not remain good forwarders for each other. Thus, an evaporation/aging process is necessary. We use Eq. (6) and Eq. (7) to decay the community energy,


where is the aging factor, and is the number of time intervals since the last time energy was aged.

When nodes move around, they share and gather interest information, and further update the above community energy information.

Iii-C Privacy-Preserving Interest-Based Forwarding

In this section, we introduce the privacy-preserving interest-based forwarding scheme including system initialization, privacy-preserving authentication, forwarding process, message scheduling and buffer management strategies.

Iii-C1 System Initialization

Let be a large prime, , and the order of be , where is a large prime factor of . and are cryptographic hash functions.

TA generates a certificate revocation list , which is originally empty and public. In order to create the group (i.e., the community ), TA randomly chooses and computes mod . Then, TA sets the group secret key for as . In addition, TA generates a group ID for .

When a node wants to join the group , TA registers it. TA generates a certificate and sends it to over an authenticated private channel. TA randomly selects a string and , and generates a Schnorr signature , where mod ) and mod . ’s certificate is . Note that, is known by the members of all the groups and TA, while the certificate is only known by itself. If wants to leave the group, TA inserts into .

Iii-C2 Privacy-preserving Authentication

Assume that claims that it is affiliated to the group , and claims that it belongs in the group . After executing privacy-preserving authentication, can identify if belongs in and can identify if is affiliated to . If they are in the same group, we can conclude that they have the same interest.

We assume that a node with belongs to , and ’s group ID is GID. Assume encounters another node , where claims that it is affiliated to . can communicate with to check if is affiliated to . Specifically, performs the following steps:

  • randomly selects . Here, mod .

  • calculates ( mod ) = ( mod ), and mod .

  • sends to .

Similarly, generates , and sends it to .

If is not listed in and , computes mod and sets ), where and . Otherwise, randomly selects , then sets , and . sends to . Similarly, sends to , where

If , then rejects communication. Otherwise, performs the following steps:

  • After receives , computes mod .

  • checks whether equals to . Since

    Thus, if , can conclude that is an invalid participant. Otherwise, can conclude that the group ID of is GID.

According to GID, can conclude whether belongs in the same group with .

Iii-C3 Forwarding Process

When mobile nodes are in communication range, they will communicate with each other. The forwarding process consists of two parts: community energy awareness and message forwarding strategy.

Community energy awareness. When two nodes (for example and ) encounter, they first check if they are in the same community in a privacy-preserving way, and then update the community energy. If they are affiliated to different communities, they accumulate the community number and update their intra-community energy. Otherwise, they compute the connection time and update their inter-community energy. We give the pseudocode of community energy awareness in Algorithm 1.

for  all intermediate nodes connected to  do
       if  then
             Update the direct inter-community energy;
             if  has the inter-community energy record of  then
                   Update the inter-community energy with Eq. (1);
                   Initialize the inter-community energy between and ;
             Update the indirect inter-community energy;
             for all connected nodes of and  do
                   Update the indirect inter-community energy with Eq. (2);
             Update intra-community energy;
             if  has intra-community energy record of  then
                   Update intra-community energy with Eq. (4);
                   Initialize intra-community energy;
      Predict inter-community energy with Eq. (3);
       Predict intra-community energy with Eq. (5);
Algorithm 1 Pseudocode for community energy awareness

Message forwarding strategy. The message forwarding strategy is the core of PRIF. By using community energy, the best forwarders can be chosen for the destination. According to the communities of , and , PRIF uses different message forwarding strategies.

Assume that a node with a message destined for meets another node . If is not the destination node and , and belong in the same community, inter-community energy will be used to make forwarding decisions. If has higher inter-community energy to the destination, it will be selected as a better forwarder. Otherwise, will stop forwarding and wait for a better opportunity. If does not share the same interest with , then there are only two cases where the forwarding process can occur: (1) . In this case, belongs to the destination community; (2) does not belong to ’s community and . Otherwise, will continue holding the message .

As a whole, PRIF looks for active intermediate nodes (with higher inter-community or intra-community energy) which will allow fast transfer of message to the destination node or destination community. When the message has reached the destination, it broadcasts a response message to inform all nodes which still maintain the message to discard it. We give the pseudocode of message forwarding strategy in Algorithm 2. In Algorithm 2, denotes a secure identity-based encryption algorithm [32], presents the pseudo identity of , and is the ciphertext of the message .

When with a message destined for encounters a node .
if  is  then
       Deliver from to ;
       if  ==  then
             belongs to the destination community;
             if  ==  then
                   belongs to the destination community;
                   if  then
                         has higher inter-community energy;
                         Deliver from to ;
             does not belong to the destination community;
             if  ==  then
                   belongs to the destination community;
                   Deliver from to ;
                   does not belong to the destination community;
                   if  then
                         has higher intra-community energy;
                         Deliver from to ;
Algorithm 2 Pseudocode for message forwarding strategy

Iii-C4 Message Scheduling and Buffer Management

Since all mobile nodes have limited resources (i.e., battery power and buffer size), it is necessary to design message scheduling and buffer management strategies to improve the forwarding efficiency. The message scheduling policy decides in what order to deliver messages so as to ensure messages can be delivered to the destination node with higher delivery opportunities. In PRIF, we design strategies based on their communities. The message whose interest is the same as that of the current node will have a priority. When the buffer size reaches its capacity, the buffer management strategy decides which messages will be discarded if new messages arrive. Moreover, similar to message scheduling, the buffer management scheme is also based on communities. Details of both are given below.

Message scheduling algorithm. When is selected as a message forwarder and it has a set of messages to be delivered, then the relation between and is a major factor that needs to be considered. Specifically, the algorithm orders messages with the following priority rules: (1) the messages satisfying will have priority. The messages satisfying this condition will be ordered according to inter-community energy. If the inter-community energy is equal, the newer message will be transmitted first; (2) for the messages which do not satisfy , it suits intra-community transmission, hence intra-community energy of is considered. The messages with higher intra-community energy will have higher priority. If intra-community energy is equal, then the newer one will be transmitted first.

Buffer management algorithm. The buffer management algorithm relies on the relation between the source node and the message. It discards the messages following the reverse order as that of the message scheduling sequence: (1) the messages which have different interests with the destination nodes will be discarded first. In this condition, the messages with lower intra-community energy will be replaced first. In the case that intra-community energy is equal, the older one will be discarded; (2) we then consider the messages in which . The messages with lower inter-community energy will be replaced first. If the intra-community energy is equal, the message coming later will be discarded.

Iv Security Analysis

In this section, we will introduce the security model and prove that our scheme is privacy-preserving by showing that the attacks studied in [33, 34, 35] cannot be used to determine the participants’ interest information.

Iv-a Security Model

In this security model, the privacy property is defined by using a game between an adversary and a challenger . The adversary ’s goal is to learn about the players’ interest information. The adversary cannot learn the interest information unless it can distinguish the two executions: One where the challenger executes the protocols as honest players, while the other where the adversary runs the protocol with a simulator.

Firstly, the challenger creates a group in which members are included. Specifically, generates of the group. Besides, generates a certificate for the user , where . Then, chooses corrupted players and gives the certificates of the corrupted players to . Subsequently, updates .

Afterwards, sends a polynomial number of ), ), and ) queries adaptively. picks at random a bit uniformly, where . If , answers ’s requests as honest players. Otherwise, responds to by using the simulator. When , replies to the queries as follows:

  • ) and ) queries: answers the queries with the messages generated by the simulator. will set as and return , if is incorrect.

  • ): gives to and updates the revocation list.

Finally, outputs a bit . wins the game, if holds. The advantage with which wins the game is defined to be

Definition 1

The proposed protocol is said to be privacy-preserving, if for any probabilistic polynomial time adversary , is negligible.

Iv-B Security Proof

Theorem 1

Assume can ask the random oracle at most times. The proposed scheme is secure with the probability , where is the order of group and is a large prime.

Proof. In order to prove that our protocol is privacy-preserving, we design two games Game0 and Game1, where Game1 denotes a simulation, and Game0 represents the real game.

In order to show that the adversary can not distinguish its view in Game1 and its view in Game0, Game1 is constructed as follows.

Simulation. Assume pid=.

  • ): randomly chooses corresponding to , selects randomly and calculates mod , then picks randomly and calculates mod . replies with .

  • ): randomly selects , then sets . Output .

  • ): gives to and inserts to the revocation list.

For any and any , and is defined via the messages and , where is sent by of on that session. is sent by to . That is, mod and mod . Let denote the event that sends query on or .

We can observe the difference between the two games. That is, is randomly selected in Game1, where . Thus, can not distinguish its view in Game1 from its view in Game0 unless happens. In the proposed scheme, mod mod and cannot know . Therefore, and can be considered as mod and mod respectively, for some unknown and some unknown for . Then, the probability with which can query or is at most. That is, the probability with which event happens is at most. Moreover, can distinguish its view in Game1 from that in Game0 with at most. becomes negligible, since is a large prime. That is, can not distinguish its view in Game1 from that in Game0. Therefore, our protocol captures the privacy-preserving property.

V Performance Evaluation

We have conducted extensive experiments to evaluate the performance of the proposed PRIF and compared it with the following routing and forwarding methods, i.e., BEEINFO-DS [15], Epidemic [18], and PRoPHET [19].

Following metrics have been used for performance comparison:

  • Delivery ratio: the average ratio of successfully delivered messages to all created messages from the sources to the destinations.

  • Overhead: the percentage of relayed messages which excludes the delivered messages.

  • Average hop count: the average number of hops when messages are delivered successfully.

V-a Simulation Settings

Similar to BEEINFO-DS [15] and other DTN routing schemes such as [31], [36], [37] and [38], The Opportunistic Network Environment (ONE) Simulator [39] is used to evaluate the performance of the PRIF.

In our experiments, five groups of nodes are considered, including two pedestrian groups, two car groups, and one bus group. All groups consist of 40 nodes except the bus group which has 6 nodes. There are two kinds of Bluetooth interface to realize wireless transmission: one is used for cars and pedestrians where the communication range is 10 m and transmission rate is 2 Mb/s, and the other one is used for buses with a higher communication range and transmission rate (i.e., 100 m and 10 Mb/s). Messages are only generated by nodes of cars and pedestrians groups, every 50-90 s. The size of message is set as 0.5-1 MB. We implement the experiments by varying the values of two important factors: the buffer size (10-50 MB) and TTL (600-3600 min). Detailed simulation parameters are listed in Table II.

Parameter Value or Range
Simulation time 400000 s
Time window 30 s
Warm up time 5000 s
Area 4500 3400 m
Speed of pedestrians m/s
Speed of cars m/s
Speed of buses m/s
Wait time at destination s
Message TTL 600 min
Event interval s
Message size KB
Number of nodes in each car/pedestrian group 40
Number of nodes in each bus group 6
TABLE II: Parameters used in evaluation.

V-B Simulation results and analysis

The performance of the proposed PRIF is evaluated over different buffer sizes, message’s TTL, and simulation time. Each experiment runs 30 times and we compute the average result. In Fig. 3, 4 and 5, we show the results of simulation experiments for delivery ratio, overhead, and hop count, respectively.

Fig. 3: Performance over buffer size.
Fig. 4: Performance over TTL.
Fig. 5: Performance over simulation time.

In Fig. 3, we compare the proposed PRIF scheme with other three schemes when buffer size ranges from 10 MB to 50 MB. It can be observed that, with larger buffer size, more messages will be delivered to the destinations, less overhead will be generated, and fewer hops are required. The proposed PRIF performs best in terms of the delivery ratio and overhead. For example, when the buffer size is set as 50 MB, PRIF delivers messages (compared with for BEEINFO-DS) with message overhead of 1146.5474 (compared with 1365.5567 for BEEINFO-S), and hop count of 2.8679 (similar to 2.7730 for BEEINFO-D). By comparison, Epidemic and PRoPHET perform worse with and in delivery ratio, 1365.5567 and 2276.1788 in overhead, and 4.6457 and 3.2951 in hop count experiments respectively.

In Fig. 4, we show the performance of the four schemes with varying TTL, where the simulation time is 400000 s and the buffer size is 10 MB. It can be seen that as the TTL increases, message delivery ratio of all schemes decreases, and PRIF exhibits best performance. When the TTL is set as 3600, PRIF delivers messages, which is higher than BEEINFO-DS, higher than Epidemic and higher than PRoPHET. For the overhead, PRIF also outperforms the rest. In terms of the hop count, the four schemes are comparable in performance, and PRIF is at similar level with that of BEEINFO-DS.

Fig. 5 shows the performance of all these schemes varying with simulation time (using 10 MB of buffer size and 600 min of message TTL). When the simulation time increases from 100000 s to 500000 s, PRIF can gather more community energy information, which helps nodes to select better forwarders. The trend of PRIF is similar to those of other schemes, but proves the over all benefit as shown in Fig. 3 and Fig. 4. Hence, it can be concluded that, with long lifetime of networks, PRIF can give better performance while preserving the privacy of interests.

In summary, PRIF achieves better delivery ratio and overhead compared with the other three schemes, and gives comparable results with BEEINFO-DS for the hop count metric. These observations confirm the efficiency of introducing community energy in the design of social-based forwarding for SIOV.

Vi Conclusion

In this paper, we propose a privacy-preserving interest-based forwarding scheme for SIOV, which not only protects nodes’ interests, but also improves the forwarding performance. We have designed a privacy-preserving authentication protocol to recognize communities among mobile nodes. Moreover, we classify communities based on nodes’ interests and present detailed methods to calculate community energy including inter-community energy and intra-community energy based on their interests. Extensive simulations have been conducted, which demonstrate the efficiency and effectiveness of the proposed scheme.


  • [1] W. Yuan, P. Wang, W. Liu, and W. Cheng, “Variable-width channel allocation for access points: A game-theoretic perspective,” IEEE Trans. Mob. Comput, vol. 12, no. 7, pp. 1428–1442, 2013.
  • [2] L. Pelusi, A. Passarella, and M. Conti, “Opportunistic networking: data forwarding in disconnected mobile ad hoc networks,” IEEE Communications Magazine, vol. 44, no. 11, pp. 134–141, 2006.
  • [3] X. Lin and R. Lu, Vehicular Ad Hoc Network Security and Privacy. Wiley-IEEE Press, 2015.
  • [4] F. Warthman, Delay-Tolerant Networks: A Tutorial. 2003.
  • [5] A. M. Vegni and V. Loscrì, “A survey on vehicular social networks,” IEEE Communications Surveys and Tutorials, vol. 17, no. 4, pp. 2397–2419, 2015.
  • [6] X. Hu, J. Zhao, B. Seet, V. C. M. Leung, T. H. S. Chu, and H. C. B. Chan, “S-aframe: Agent-based multilayer framework with context-aware semantic service for vehicular social networks,” IEEE Trans. Emerging Topics Comput, vol. 3, no. 1, pp. 44–63, 2015.
  • [7] F. Li and J. Wu, “Localcom: A community-based epidemic forwarding scheme in disruption-tolerant networks,” in Proceedings of the Sixth Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2009, June 22-26, 2009, Rome, Italy, pp. 1–9, 2009.
  • [8] M. Musolesi, P. Hui, C. Mascolo, and J. Crowcroft, “Writing on the clean slate: Implementing a socially-aware protocol in haggle,” in 9th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WOWMOM 2008, Newport Beach, CA, USA, 23-26 June, 2008, pp. 1–6, 2008.
  • [9] M. Musolesi, S. Hailes, and C. Mascolo, “Adaptive routing for intermittently connected mobile ad hoc networks,” in 2005 International Conference on a World of Wireless, Mobile and Multimedia Networks (WOWMOM 2005), 13-16 June 2005, Taormina, Italy, Proceedings, pp. 183–189, 2005.
  • [10] P. Hui and J. Crowcroft, “How small labels create big improvements,” in Fifth Annual IEEE International Conference on Pervasive Computing and Communications - Workshops (PerCom Workshops 2007), 19-23 March 2007, White Plains, New York, USA, pp. 65–70, 2007.
  • [11] P. Hui, J. Crowcroft, and E. Yoneki, “BUBBLE rap: Social-based forwarding in delay-tolerant networks,” IEEE Trans. Mob. Comput, vol. 10, no. 11, pp. 1576–1589, 2011.
  • [12] E. M. Daly and M. Haahr, “Social network analysis for routing in disconnected delay-tolerant manets,” in Proceedings of the 8th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2007, Montreal, Quebec, Canada, September 9-14, 2007, pp. 32–40, 2007.
  • [13] E. Bulut and B. K. Szymanski, “Friendship based routing in delay tolerant mobile social networks,” in Proceedings of the Global Communications Conference, 2010. GLOBECOM 2010, 6-10 December 2010, Miami, Florida, USA, pp. 1–5, 2010.
  • [14] F. Li, L. Zhao, C. Zhang, Z. Gao, and Y. Wang, “Routing with multi-level cross-community social groups in mobile opportunistic networks,” Personal and Ubiquitous Computing, vol. 18, no. 2, pp. 385–396, 2014.
  • [15] F. Xia, L. Liu, J. Li, A. M. Ahmed, L. T. Yang, and J. Ma, “BEEINFO: interest-based forwarding using artificial bee colony for socially aware networking,” IEEE Trans. Vehicular Technology, vol. 64, no. 3, pp. 1188–1200, 2015.
  • [16] E. M. Daly and M. Haahr, “Social network analysis for information flow in disconnected delay-tolerant manets,” IEEE Trans. Mob. Comput, vol. 8, no. 5, pp. 606–621, 2009.
  • [17] C. Boldrini, M. Conti, and A. Passarella, “Exploiting users’ social relations to forward data in opportunistic networks: The hibop solution,” Pervasive and Mobile Computing, vol. 4, no. 5, pp. 633–657, 2008.
  • [18] A. Vahdat and D. Becker, “Epidemic routing for partially-connected ad hoc networks,” Master Thesis, 2000.
  • [19] A. Lindgren, A. Doria, and O. Schelén, “Probabilistic routing in intermittently connected networks,” Mobile Computing and Communications Review, vol. 7, no. 3, pp. 19–20, 2003.
  • [20] X. You, Q. Chen, B. Fang, and Y. Y. Tang, “Thinning character using modulus minima of wavelet transform,”

    International Journal of Pattern Recognition and Artificial Intelligence

    , vol. 20, no. 3, pp. 361–376, 2006.
  • [21] Z. He, X. Li, X. You, D. Tao, and Y. Y. Tang, “Connected component model for multi-object tracking,” IEEE Trans. Image Processing, vol. 25, no. 8, pp. 3698–3711, 2016.
  • [22] Z. He, S. Yi, Y. Cheung, X. You, and Y. Y. Tang, “Robust object tracking via key patch sparse representation,” IEEE Trans. Cybernetics, vol. 47, no. 2, pp. 354–364, 2017.
  • [23] F. Zhou, J. Jin, X. Du, B. Zhang, and X. Yin, “A calculation method for social network user credibility,” in IEEE International Conference on Communications, ICC 2017, Paris, France, May 21-25, 2017, pp. 1–6, 2017.
  • [24] Y. Zhang, F. Tian, B. Song, and X. Du, “Social vehicle swarms: a novel perspective on socially aware vehicular communication architecture,” IEEE Wireless Commun., vol. 23, no. 4, pp. 82–89, 2016.
  • [25] P. Dong, X. Du, T. Zheng, and H. Zhang, “Improving qos on high-speed vehicle by multipath transmission based on practical experiment,” in 2015 IEEE Vehicular Networking Conference, VNC 2015, Kyoto, Japan, December 16-18, 2015, pp. 32–35, 2015.
  • [26] P. Dong, X. Du, J. Sun, and H. Zhang, “Energy-efficient cluster management in heterogeneous vehicular networks,” in IEEE Conference on Computer Communications Workshops, INFOCOM Workshops 2016, San Francisco, CA, USA, April 10-14, 2016, pp. 644–649, 2016.
  • [27] X. Du and H. Chen, “Security in wireless sensor networks,” IEEE Wireless Commun., vol. 15, no. 4, pp. 60–66, 2008.
  • [28] X. Du, M. Guizani, Y. Xiao, and H.-H. Chen, “Transactions papers a routing-driven elliptic curve cryptography based key management scheme for heterogeneous sensor networks,” IEEE Transactions on Wireless Communications, vol. 8, no. 3, pp. 1223–1229, 2009.
  • [29] X. Du, Y. Xiao, M. Guizani, and H.-H. Chen, “An effective key management scheme for heterogeneous sensor networks,” Ad Hoc Networks, vol. 5, no. 1, pp. 24–34, 2007.
  • [30] Y. Xiao, V. K. Rayi, B. Sun, X. Du, F. Hu, and M. Galloway, “A survey of key management schemes in wireless sensor networks,” Computer communications, vol. 30, no. 11-12, pp. 2314–2341, 2007.
  • [31] A. C. B. K. Vendramin, A. Munaretto, M. R. Delgado, and A. C. Viana, “Grant: Inferring best forwarders from complex networks’ dynamics through a greedy ant colony optimization,” Computer Networks, vol. 56, no. 3, pp. 997–1015, 2012.
  • [32] D. Boneh and M. K. Franklin, “Identity-based encryption from the weil pairing,” in Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001, Proceedings, pp. 213–229, 2001.
  • [33] L. Wu, X. Du, and X. Fu, “Security threats to mobile multimedia applications: Camera-based attacks on mobile phones,” IEEE Communications Magazine, vol. 52, no. 3, pp. 80–87, 2014.
  • [34] L. Wu, X. Du, and J. Wu, “Mobifish: A lightweight anti-phishing scheme for mobile phones,” in Computer Communication and Networks (ICCCN), 2014 23rd International Conference on, pp. 1–8, IEEE, 2014.
  • [35] X. Huang and X. Du, “Achieving big data privacy via hybrid cloud,” in Computer Communications Workshops (INFOCOM WKSHPS), 2014 IEEE Conference on, pp. 512–517, IEEE, 2014.
  • [36] Y. Xian, C. Huang, and J. A. Cobb, “Look-ahead routing and message scheduling in delay-tolerant networks,” Computer Communications, vol. 34, no. 18, pp. 2184–2194, 2011.
  • [37] M. Orlinski and N. Filer, “Neighbour discovery in opportunistic networks,” Ad Hoc Networks, vol. 25, pp. 383–392, 2015.
  • [38] J. Miao, O. Hasan, S. B. Mokhtar, L. Brunie, and G. Gianini, “A delay and cost balancing protocol for message routing in mobile delay tolerant networks,” Ad Hoc Networks, vol. 25, pp. 430–443, 2015.
  • [39] A. Keränen, T. Kärkkäinen, and J. Ott, “Simulating mobility and dtns with the ONE (invited paper),” JCM, vol. 5, no. 2, pp. 92–105, 2010.