Clustering Based Energy Efficient and Communication Protocol for Multiple Mix-Zones Over Road Networks

Arain, Qasim Ali; Uqaili, Muhammad Aslam; Deng, Zhongliang; Memon, Imran; Jiao, Jichao; Shaikh, Mohammad Abuzar; Zubedi, Asma; Ashraf, Aisha; Arain, Usman Ali

doi:10.1007/s11277-016-3900-x

Cited by 48 publications

(32 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In an ideal mix zone, it is equiprobable for x to be any of the users in the entering users set V out , having p x → y =

\frac{1}{true∣ normalV out true∣}

. However, in real world, the effectiveness of the mix zone is constrained by many factors, such as the number of road segments at the intersections, the probability distribution between the road segments, the mobile users' travel speed constraint inside the mix zone region, etc . The more uniform the probability distribution is, the higher the entropy is and the more difficult the real user can be identified.…”

Section: Resultsmentioning

confidence: 99%

Pseudonym changing strategy with multiple mix zones for trajectory privacy protection in road networks

Memon

Chen

Arain

et al. 2017

Int J Communication

Self Cite

View full text Add to dashboard Cite

SummaryIn road network, vehicles' location may be identified, and their transmissions may even tracked by eavesdrops (eg, safety messages) that contain sensitive personal information such as identity and location of the vehicle. This type of communication leads to breaking the users' trajectory privacy. Frequently changing pseudonyms are widely accepted as a solution that protects the trajectory privacy of users in road networks. However, this solution may become invalid if a vehicle changes its pseudonym at an improper occasion. To cope with this issue, we presented an efficient pseudonym change strategy with multiple mix zones scheme to provide trajectory privacy for road network. In addition, we protected vehicles against linkability attack by cheating mechanism. Henceforth, we constructed a cheating detection mechanism which allows the vehicles to verify whether the pseudonym change process is successful or not and also detect to malicious vehicles. In this way, users' trajectory privacy can be improved. Finally, by taking the anonymity set size (ASS) as the trajectory privacy metric, we exhibit by means of simulations that the proposed scheme is effective in multiple networks scenarios. KEYWORDS changing pseudonyms, cheating detection, cooperation, multiple mix-zones security, road networks, silent period, trajectory privacy | INTRODUCTIONRoad networks consist of vehicles and road-side units (RSUs) equipped with radio transceivers. Vehicles communicate with each other using vehicle-to-vehicle (V2V) communications, and with RSUs using vehicle-to-infrastructure (V2I) communications. 1 Road network promises safer driving conditions and more efficient traffic management. For safety applications, several initiatives have been launched to draw strong support in Europe 2,3 and also USA. 4 Road network offers a wide range of applications. We distinguish typically 2 classes of applications: (1) safety applications and (2) non-safety applications. Safety applications allow vehicles to exchange safety-related information in order to prevent accidents and hazardous situations. For example, such applications included cooperative driving, collision avoidance warnings, etc. Non-safety applications, such as Internet access, point of interest notification, and infotainment, focus on providing convenience and entertainment to drivers and passengers.In order to achieve road network applications, vehicles are required to broadcast periodic beacons into their direct neighborhood and occasionally event-based messages (eg, safety messages) as shown in Figure 1. These messages reported sensitive personal information about their senders such as the identity and location of the vehicle. 5 Due to

show abstract

“…In an ideal mix zone, it is equiprobable for x to be any of the users in the entering users set V out , having p x → y =

\frac{1}{true∣ normalV out true∣}

Section: Resultsmentioning

confidence: 99%

Pseudonym changing strategy with multiple mix zones for trajectory privacy protection in road networks

Memon

Chen

Arain

et al. 2017

Int J Communication

Self Cite

View full text Add to dashboard Cite

show abstract

“…As shown in Section 2, the existing routing criteria that are employed to calculate the route weight have ignored at 3) The behavior of PU senders and protection of PU receivers are the most basic challenges in the CRN routing.…”

Section: Proposed Routing Criterionmentioning

confidence: 99%

“…P PU s specifies the activity probability of the PU s senders, and IS c i;j is obtained using (3). SUs are able to estimate P PU s based on the historical use of the channel by PU s .…”

Section: Proposed Routing Criterionmentioning

confidence: 99%

Design of optimum criterion for opportunistic multi-hop routing in cognitive radio networks

2018

View full text Add to dashboard Cite

The instability of operational channels on cognitive radio networks (CRNs), which is due to the stochastic behavior of primary users (PUs), has increased the complexity of the design of the optimal routing criterion (ORC) in CRNs. The exploitation of available opportunities in CRNs, such as the channel diversity, as well as alternative routes provided by the intermediate nodes belonging to routes (internal backup routes) in the route‐cost (or weight) determination, complicate the ORC design. In this paper, to cover the channel diversity, the CRN is modeled as a multigraph in which the weight of each edge is determined according to the behavior of PU senders and the protection of PU receivers. Then, an ORC for CRNs, which is referred to as the stability probability of communication between the source node and the destination node (SPC_SD), is proposed. SPC_SD, which is based on the obtained model, internal backup routes, and probability theory, calculates the precise probability of communication stability between the source and destination. The performance evaluation is conducted using simulations, and the results show that the end‐to‐end performance improved significantly.

show abstract

“…The road network can be divided into small intersections, known as clusters to make the network with random distance and energy efficiency . To reduce the consumption of pseudonyms changing energy by the vehicle nodes as well as the road network, clustering is one of the techniques . In this technique, cluster heads (CHs) are chosen and nearby nodes attach to their relevant CH.…”

Section: Introductionmentioning

confidence: 99%

“…The clustering based on energy efficiency and communication protocols is one of them . It uses a probabilistic model for the selection of CHs .…”

Section: Introductionmentioning

confidence: 99%

Distance and clustering‐based energy‐efficient pseudonyms changing strategy over road network

Memon

2018

Int J Communication

Self Cite

View full text Add to dashboard Cite

Summary To improve the fairness, the energy consumption changing pseudonyms needs to be taken into account. Existing works focus on changing velocity‐based pseudonyms changing strategy and short changes interval with limited coverage, but due to similar velocity and short changes, internal attacker guesses easily known communication and location information due to location information of vehicle on tracking, which may expose adversary private information, and frequently, pseudonyms changing occurs due to movement of vehicles' similar velocity and short coverage, which may cause serious attack of vehicle. To overcome this problem, distance and cluster can be performed. In this work, we proposed distance and cluster‐based energy pseudonyms changing method for road network. We proposed distance and energy‐based clustering routing service over road network, the cluster head elected to depend on random number of distance and energy to change pseudonyms of vehicles. An each interval to be establish cluster head vehicle deployed while selects the operation mode and informs the cluster members of the selected mode through beacon signal. The cluster head vehicle node performs the pseudonyms changing based on the predicted distance and energy of the cluster member to use clustering optimization. The data of whole network send to report server through these nodes while near the RSU, and the vehicles in this area will use less energy to change the pseudonyms. The simulation results show that the proposed method enhances pseudonyms changing strategy less consumption and delays sufficient privacy level each vehicle also our method has outperform compare with existing methods than we use Sumo simulation and Matlab tools to verify our proposed method. Our proposed method outperformed in terms of pseudonym changing energy efficiency to careful attention during the cluster formation process, stable and balanced clusters that prolong the network lifetime, increases distances to more CH vehicles connectivity to makes clustering group and changing their pseudonyms in terms of high level privacy and finally, CH nodes use Dijkstra's algorithm use MST among the vehicles nodes depend on existing road networks to follow shortest path selection roads in terms of high connectivity probability of CH and stable structure of the network decreases the topology changes and thus,the clustering overhead is reduced.

show abstract

Clustering Based Energy Efficient and Communication Protocol for Multiple Mix-Zones Over Road Networks

Cited by 48 publications

References 21 publications

Pseudonym changing strategy with multiple mix zones for trajectory privacy protection in road networks

Pseudonym changing strategy with multiple mix zones for trajectory privacy protection in road networks

Design of optimum criterion for opportunistic multi-hop routing in cognitive radio networks

Distance and clustering‐based energy‐efficient pseudonyms changing strategy over road network

Contact Info

Product

Resources

About