Dynamic path privacy protection framework for continuous query service over road networks

Summary Network operators depend on security services with the aim of safeguarding their IT infrastructure. Various types of network security policies are employed on a global scale and are disseminated among several security middleboxes implemented in networks. But, owing to the complications in security policies, it is not quite efficient to directly use the path‐wise enforcement schemes that are prevalent. The major motivation of this work is to improve security levels and solve the policy enforcement problem. For the first time, this work reports the issue of policy enforcement on middleboxes. The major contribution of this work is to design security policy enforcement as a Weighted K Set Covering Problem, and we designed a Policy Space Analysis (PSA) tool intended for a group of operations in the security policy. This PSA tool was developed based on range‐signified hyper‐rectangles, which are indexed by the Hilbert R‐tree. Leveraging the PSA, we first investigated the topological features of various kinds of policies. Balancing the PSA tool in a non‐dominated sorting particle swarm optimization technique exposes the intrinsic difficulties of this security strategy and provides guidance for designing the enforcement approach. In addition, in this research, a new fuzzy rule‐based classification system is introduced for packet classification. A scope‐wise policy enforcement algorithm was proposed, which chooses a moderate number of enforcement network nodes for deploying multiple policy subsets in a greedy manner. This scheme is much quicker compared with the first one and therefore has found its application in real‐time deployments.

Section: Literature Reviewmentioning

confidence: 99%

Non‐dominated sorting particle swarm optimization (NSPSO) and network security policy enforcement for Policy Space Analysis

Sureshkumar

Lingaraj²,

Anand³

et al. 2018

“…Nevertheless, if we consider cities, there can be many obstacles like high end buildings, trees, and different corners which might create difficulties in signal transmission, and therefore signal will be distorted and information loss would occur. Thefore, another approach named multi‐cast broadcast would be best suitable for this type of scenarios . The spatial‐based protocols are appealing, because they ensure that vehicles change their pseudonyms simultaneously but lack flexibility because they depend on predetermined locations …”

Section: Related Workmentioning

confidence: 99%

“…Road 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 . Road network promises safer driving conditions and more efficient traffic management.…”

Section: Introductionmentioning

confidence: 99%

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

Memon

Chen

Arain

et al. 2017

Self 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

“…Many protocols take advantage of routing and time stamp . Routing and time stamps are used to make real‐time decisions about the environment. Different environmental parameters are merged as per predefined rules, and a decision is being made.…”

Section: Introductionmentioning

confidence: 99%

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

Memon

2018

Self 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.