Vehicular ad hoc networks (VANETs) in which vehicles act as the mobile nodes provide a wide variety of services, such as audio and video surveillance. However, such networks suffer from an important problem of service delivery reliability as the network performance degrades significantly in the presence of misbehaving vehicles. Most of the existing works either assume that vehicles' misbehaviors are constant or ignore heterogeneous traffic for multiservice (a mix of video, voice, and data traffic). In this paper, we investigate the problem of trust-based multiservice delivery via integrated misbehavior detection and tolerance for fault-aware VANETs. To model the effects of time-varying misbehaviors, modern fog computing could help to analyze and to store related data in VANETs while evaluating the dynamic trust weights based on attribute parameters of each vehicle. Then, we incorporate these weights into our service delivery framework that integrates trustworthy vehicle selection for misbehavior detection and uses differential resource allocation to achieve misbehavior tolerance. We present a multi-path selection criterion based on the trust evaluation and design a trust-aware heterogeneous traffic allocation algorithm over multiple routing paths. Finally, our scheme is evaluated using extensive simulations where we show that (i) approximately 12% - 40% higher successful service delivery can be achieved by our routing algorithm at the expense of acceptable delay loss compared to other three routing protocols; (ii) our trust-aware traffic allocation algorithm can gain 10% - 20% higher effective network utility and better fairness than that of the baseline solution; and (iii) the integrated scheme significantly improves both effective utility ratio and the path-usage proportion by comparing it with only routing scheme and only traffic allocation scheme.
Proposed a method of detecting intrusion using incremental SVM based on key feature selection. A center SVM summarizes the distributed samples and incorporates them to build the incremental SVM for locals. By eliminating the redulldant features of sample dataset the space dimension of the sample data is reduced. Using this method it can overcome the shortages of SVM-time-consuming of training and massive dataset storage. The simulation experiments with KDD Cup 1999 data demonstrate that our proposed method achieves the increasing performance for intrusion detection.
In many fields, multiple RFID tags are often combined into a group to identify an object. An RFID grouping-proof protocol is utilized to prove the simultaneous existence of a group of tags. However, many current grouping-proof protocols cannot simultaneously provide privacy preserving, forward security, and the authentication between reader/verifier and tags, which are vulnerable to trace attack, privacy leakage, and desynchronization attack. To improve the secure performance of the current grouping-proof protocols, we propose two provable lightweight grouping-proof protocols that provide forward security, identity authentication, and privacy preserving. Our protocols involve a trusted reader and an untrusted reader, respectively. In order to avoid verifying some invalid evidences, our protocols complete the authentication of the verifier to the trusted reader and the verified tags before the verifier verifies the grouping-proof evidence. Each tag uses parallel mode to complete its signature to improve the efficiency of the protocols. Moreover, the activate-sleep mechanism and the filtering operation are proposed to effectively reduce the collision probability and computing load of tags. Our protocols complete the authentication to tags twice by a verifier and a trusted reader, respectively. They can resist various attacks such as eavesdropping, replay, trace, and desynchronization. The protocols are proven to be secure, flexible, and efficient. They only utilize some lightweight operations. Therefore, they are very suitable to the low-cost RFID systems.