• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    Incentive-Driven Approach for Misbehavior Avoidance in Vehicular Networks

    2022-03-14 09:27:42ShahidSultanQaisarJavaidEidRehmanAhmadAzizAlahmadiNasimUllahandWakeelKhan
    Computers Materials&Continua 2022年3期

    Shahid Sultan,Qaisar Javaid,Eid Rehman,Ahmad Aziz Alahmadi,Nasim Ullah and Wakeel Khan

    1Department of Computer Science and Software Engineering,International Islamic University,Islamabad,44000,Pakistan

    2Department of Software Engineering,Foundation University Islamabad,44000,Pakistan

    3Department of Electrical Engineering,Taif University KSA Taif,21944,Saudi Arabia

    4Department of Electrical Engineering,Foundation University Islamabad,44000,Pakistan

    Abstract: For efficient and robust information exchange in the vehicular adhoc network, a secure and trusted incentive reward is needed to avoid and reduce the intensity of misbehaving nodes and congestion especially in the case where the periodic beacons exploit the channel.In addition, we cannot be sure that all vehicular nodes eagerly share their communication assets to the system for message dissemination without any rewards.Unfortunately,there may be some misbehaving nodes and due to their selfish and greedy approach,these nodes may not help others on the network.To deal with this challenge,trust-based misbehavior avoidance schemes are generally reflected as the capable resolution.In this paper, we employed a fair incentive mechanism for cooperation aware vehicular communication systems.In order to deploy a comprehensive credit based rewarding scheme,the proposed rewardbased scheme fully depends on secure and reliable cryptographic procedures.In order to achieve the security goals, we used the cryptographic scheme to generate a certified public key for the authenticity of every message exchange over the network.We evaluated the friction of misbehaving vehicles and the effect of rewarding schemes in context with honest messages dissemination over the network.

    Keywords: VANET; misbehavior; reputation; rewards; congestion avoidance; certified public key

    1 Introduction

    The emergence of Vehicle Ad Hoc Network (VANET) brings new challenges and requires deeper Consideration about vehicle reputation and trust calculation because these parameters can be used to accept or forward the message over the network.Incentive schemes for cooperative VANET frameworks can be characterized as trust and credit-based schemes.A comprehensive trust management system allows vehicles to interact in the network based on the assessment and evaluation of past historical communication.To preserve the reputation history of other vehicles is a challenging task as most of the vehicles are anonymous and changing their identities periodically.It is also very difficult to store trust and reputation information for a dense and largescale network.An adaptable and general-purpose trust-management approach can keep up-to-date and reliable data delivery with diverse entities in a distributed network [1].

    In addition, since VANETs are independent and self-organizing systems of participation between vehicles, we cannot continuously anticipate all vehicles to intentionally contribute their computing assets to the network.Additionally, a few selfish vehicles will not forward message hand-off services for other vehicles.One way to resolve this challenge is to back motivations to compensate for deliberate cooperation within the network with credit rewards [2].

    For example, when the sender requests help from the vehicle, the sender will motivate the vehicle so that the vehicle is willing to store, carry and forward the sender’s message to the destination.Although, on the one hand, incentives seem to be an attractive approach to selfish behavior, another problem is how to determine whether the sender actually delivers the message to the destination.If the source location server first provides a credit line for the vehicle, the malicious vehicle will not faithfully store the message to the designated destination after receiving the credit line.The origin location server may worry about this malicious behavior of the vehicle,that is, the so-called meal and dash, which is unfair to the origin location server.Therefore, how to solve the unfair problem of the incentive scheme on the autonomous vehicle network is also a serious challenge [3].

    In our proposed scheme, the vehicle can accept and exchange messages at an event time after assessing and evaluating the trust and reputation score of the participating vehicles in the network.To analyze the behavior of the particular vehicular node, the proposed scheme evaluates the type of message exchanged in each transaction in context with vehicular reputation score.The reputation of the sender vehicle that creates or forwarding the message plays a decisive role in accepting the forwarded or created message.To this approach, the vehicle’s trust and reputation certificate score is assigned to the message created or forwarded by a specific vehicle.We proposed an incentive-driven approach that works with the generation of a certified public key for robust and secure dissemination over the network.In the proposed scheme, a collaborative trust mechanism is adopted for calculating the reputation and trust score for every vehicular node.Reputation and trust scores can be suitable tools for accepting and forwarding messages in correlation with two behavioral factors: use to generate event-driven messages about road conditions and to cooperate when forwarding messages.In order to achieve the security goals,we used the cryptographic scheme to generate a certified public key for the authenticity of every message exchange over the network.We evaluated the friction of misbehaving vehicles and the effect of rewarding schemes in context with honest messages dissemination over the network.

    The rest of the paper is organized as follows: Section II describes work related to misbehavior avoidance in VANETs; Section III defines system model including system architecture of incentive-driven scheme, secure public key generation, and incentive paradigm; Section IV includes performance evaluation, network parameters and discussion of the results of the proposed scheme;Section V summarizes the conclusion of the research study.

    2 Related Works

    In this section of the paper, we emphasize on work related to trust and reputation management schemes.Second, we relate the trust-based approach to an incentive-driven mechanism.

    In VANET scenario, trust and confidence building measures are the vital research areas,because vehicular nodes introduce fake information in the network system.Centralized approaches for trust management are not best suited for large scale network; VANET requires trust-based approaches for a service provider that experiences higher network delay.A significant effort has been made to create distributed trust administration schemes for VANETs, based on the presumption that it is not conceivable to depend on a centralized approach for VANETs.The primary reason for implementing a centralized system is that the vehicles are directed and represented by a central authority.Hence, it is natural to adopt a centralized scheme [4].In expansion, the centralized framework may be best fitted than decentralized due to simple administration, control,and security.

    Nowadays, it is conceivable to structure a centralized reputation framework that includes innovations such as Long-Term Evolution (LTE); this can be the foremost effective way of linking the vehicles to the Internet.Another approach utilized a single-hop trust calculation mechanism and proposed a multi-hop implementation based on carrying and forward strategy [5].The recommendations look to assess the reliability of messages and the accumulation of reputation scores.In any case, these schemes need protection and security since the messages and inputs are linkable and not anonymous.An intruder can launch an attack on traceability to trace out the pathway of a target vehicle.The author in [6] defined a nonexclusive reflection to authenticate the anonymous announcement mechanism utilizing the reputation framework.Trust information can be collected through neighboring participating nodes in a very short span of time.Trustbased misbehavior detection schemes assigned trust values to the node based on their past communication information [7].

    The author introduced a time series pattern, RSS evaluation, and the historical communication record for a specific vehicular node and dynamic connection procedure in [8].The mentioned scheme comprehensively evaluates the direct and indirect trust and reputation scores and quality parameters to handle intrusion attacks.The vehicular trust model based on Bayesian inference proposed in [9] works on intrusion attacks.

    Chen et al.[10] presented a full depiction of a novel cryptographic primitive, which enhances the mechanism to address a secure medium for the recovery of updated cryptographic keys.The author in [11] proposed a blockchain-based anonymous reputation system (BARS), to preserve privacy the proposed mechanism disrupts the congeniality between honest nodes and public keys.The work by [12] presented a trust-based dueling deep reinforcement learning approach (TDDRL); the network deployment includes dueling network design into a consistently centralized control system of software-defined Networks (SDN).The authors in [13] used trust-based techniques to find out vehicular location with the assistance of the trust value of the node.Kumar et al.[14] proposed an improved trust-based technique to choose trusted vehicular nodes through which messages are exchanged.

    The work in [15,16] suggested a reputation-based system, where network nodes assess trust relationships with each other and vote on neighboring node’s activity of message exchange so that non-cooperative nodes with low reputation scores are prohibited from the system.In order to stimulate vehicles to cooperate positively, the author in [17] proposed a robust incentive mechanism integrating with Bitcoin for Vehicular Delay tolerant Networks (VDTNs) to give rewards for their positive efforts.MultiSig transaction is used to ensure fairness of the rewarding scheme so only those vehicles redeem the Bitcoins incentive transactions provided that vehicle honestly completes the message forwarding to a target vehicle.The scheme [18] presented three primary prototypes from the fundamental model of the Internet of vehicles.On the basis of the fundamental models, the categorization and classification of the fundamental model were analyzed; and at the end, optimization impacts were compared for different variables.In [19], the authors presented a stimulus-centric approach to credit Blockchain.The driver can get Credit coins for positive contributions provided that legendary focuses must be on the normal behavior of the participating vehicles.

    However, Credit Coin portends security breaches and permits dependent offense in light of Blockchain, and traces out malicious approaches to dangerous zones in a horrendous case and so on.

    The scheme [20] proposes re-broadcast operations and a credit-based incentive approach for achieving effectiveness in honest data exchange.A mechanism in [21] based on the Blockchain techniques executes a credit installment service for participating vehicles.The technique used to assist the utilization and pathway service in Vehicle-to-vehicle communication.MobiCent [22]proposes a credit-incentive approach for the Disrupt Tolerant Networks (DTNs) and calculates incentives by a multiplicative decreasing remuneration (MDR) scheme.The proposed scheme helps to minimize the computation cost and delay of the network.However, the source and target vehicle have the opportunity to access the network for exchanging messages all the time over the network.The reciprocal incentive scheme (RIS) proposed in [23] investigates how two types of malicious vehicular nodes select appropriate data sources to exploit network resources for personal profit gain under extreme buffer limitations.

    Furthermore, the proposed RIS approach ignores those nodes in VANET that have different levels of benefits and maliciousness for different kinds of exchanged data.As a result, the scheme suffers a higher ratio of latency to receive the required data contents successfully.To address these defects, three types of approaches such as credit-based [24-26], reputation-based [27,28]and tit-for-tat (TFT)-based [29,30] incentive mechanisms have been proposed to motivate the vehicular nodes to share their data and resources.The mentioned schemes focused on trust and credit evaluation to stimulate the vehicular node to exchange the content data to its neighbors by disbuRSing some credit reward to it.For every message-forwarding operation, a central authority would charge the source node of the data packet a part of the credit reward and pay it to each communicated node.It is worth mentioning that the failure of the central authority becomes a major issue while paying among the participating nodes.

    However, these solutions additionally need to implement a reputation management system or virtual coin management system that depends on VANET applications.Existing work does not provide analysis and experiments to calculate the packet transfer rate and transmission delay of the encryption function, as well as the number of messages that is the implementation of this scheme.In addition, the existing incentive scheme completely relies on a central and trusted third party to allocate some virtual coins to each node and track the virtual coins that have been issued in the system.

    3 Proposed System Model

    The main emphasis of this work is to apply a collaborative trust approach to avoid misbehavior of vehicular node in VANET ensuring less packet drop ratio and robust end-end throughput.In our proposed scheme, to avoid message congestion on highways and roads it is suggested that each node or vehicle receive a single message per node with certified key pair.To cope with the issue of duplication of messages a public key-based strategy will be followed to discard and reduced the retransmission of unnecessary packets.A vehicular node will only send and respond to the most current data based on the unique identifier associated with the specific data packet.

    Congestion control schemes are mainly the procedures and techniques to keep the network load below the defined capacity of the network.In VANET flooding technique is employed to route the packets across the whole connected network.In this network topology, we have to send and receive many data packets from a node to one or multiple destinations.In flooding the routing is as simple as every packet is sent back through every outgoing link.But it is also associated with certain issues such as contention of a medium, collision of packets, and redundancy or duplication of messages.

    3.1 Architecture

    VANET applications can be categorized in store, carry, and forward mechanisms in collaboration with participating vehicles where source to destination cannot be linked directly.To design a certified public key scheme, we consider that a vehicle assisted in carrying some data packets received from the main server to the points for displaying the information as depicted in Fig.1.

    Figure 1: Public key-based Information propagation model in VANET

    (i) Main Server (MS) controls Road Side Units (RSUs) and authorizes participating vehicles for message propagation services on VANETs.Authentication of vehicular nodes can be done with the process of generating certified public keys for roadside units and participating vehicles.

    (ii) Participating vehicles in the network are fitted out with On Board Units (OBUs) capable of LTE/5G communication.The 802.11p standard is used for Vehicle to Infrastructure and Vehicle to Vehicle communications with a digital map navigation system.

    (iii) MS is responsible for controlling RSUs with 802.11p capability for collaborating with nearby vehicles.As roadside units don’t have direct communication with all participating vehicles,so indirect communication can only be possible using the opportunistic approach with the help of nearby vehicles.

    We assume that roadside units and vehicles have their key pairs to receive and transmit messages.When a roadside unit or source server requests a participating vehicle to transmit a message to a specific destination vehicular point, the roadside unit or source server generates a public key pair from the main server to the participating vehicle.The roadside source server locked the key pair under the condition that these certified key pairs can be utilized by the specific participating vehicle which carries the message to the destination vehicular point.These certified key pairs can be used if the vehicle trustfully transmits the message to the destination point and receives an acknowledgment.

    Algorithm 1 shows the reputation calculation of each vehicle in the proposed system.To calculate the reputation of the nodes Reputationupd function is used.RSU calls these functions and exchanges event information with nearby vehicular nodes.If the event occurrence is genuine,the reputation value of the vehicle will increase by 5 points.Otherwise, the reputation of the vehicle is reduced by 20 points.It prevents vehicles from signing and initiating false occurrences.In addition, this feature will also check the current reputation value of the vehicle to prevent signing or launching a false event.If the reputation of the vehicle is found to be less than 20, then the Central Authority (CA) cancels the registration of the vehicle by deleting it from the network.The function also describes that the reputation value has only increased to 60 points.This means that the node with the largest reputation value has only two opportunities to continuously verify the false event and then cancel its registration.

    ?

    3.2 Security Goals

    In this paper, we highlighted how to implement certified key generation scheme for VANETs in term of following security goals.

    (i)Vehicle authorization: as VANET is monitored by Computer-based algorithm, only the vehicular nodes authorized by MS would be able to communicate over the network.Vehicle authorization process prevents illegal entities from mishandling the information propagation over the network.

    (ii)Vehicle anonymity: hiding the identities of the source and destination points in store-carryforwarding mechanism during VANET communication.

    (iii)Fair allocation of resources: resources must be allocated to the participating vehicles while ensuring fairness.If a vehicle successfully transmits a message from source point to the destination point, the resources must be fairly allocated in order to prevent from dine and dash situation.

    The proposed system attains these security measures by adopting certified public key mechanism for authorization of vehicles.Tab.1 depicted the basic notations used in the proposed system.

    Table 1: Notations and description

    3.3 Cryptographic Schemes

    A symmetric encryption plot comprised of three calculations which are depicted as below.

    (i) Key Generation (1k): in this phase input for Key parameter 1kand output parameter 1k∈K.

    (ii) Encryption (kpub,m): the second phase takes input for public key parameterkpuband textmfor all output ciphertextc.

    (iii) Decryption (kpub,c): third phase input for public key parameterkpuband ciphertextcto generate output text messagem.

    3.4 Certified Public Key Generation

    For calculating public key pair for road side units and participating vehicles, we assume that eachRSiandVion VANET has a master keyKallotted by the Main server.Moreover,RSihave its own key pair 〈bskSi, bpkSi〉andVialso have its own key pair 〈bskVi, bpkVi〉.Furthermore,let 〈bsKi,bpki,Vi,RSi∈˙G〉be the public key parameters for road side server and participating vehicle.In order to derive certified public key, let 〈p,q,˙G,P∈G〉where p and q represent prime numbers, G represent addition function andPrepresented base point forG.

    Let 〈K,kpub〉be the master and public key allotted from MS where public key can bekpub∈˙Gand master key can beK=P.kpub.For each vehicular entityVicertified public key pairCpkcan be generated as:

    (1)Vchoosesbski∈˙Gand then computes its master keyKi=.,kpub.P,Vithen sendKito MS and requests for certified public key.

    (2) we sssumed that the thatViis valid and legitimate vehicle, MS selected a random numberri∈G, and computes certified public key asCpk=Ki+ri·PandYi=ri+ρ(Cpk) ·kpub(modq)whereρis a positive integer used for encoding function by elementG.Now SM provides the generated certified public and derived keys 〈Cpk,Yi〉toV.

    (3)Vicomputes y’i=Yi+kpub(modq),Y’iy’i·Pand verify thatYi=Cpk+ (Cpk)·K.

    The calculated key set forV〈bski?Yi,bpki?Y’i〉 can be used as public and private key pair respectively andCpkcan be taken as certified public key.As we calculatedVi’s certified public keyCpk, the public keyYican also be derive fromCpkthrough MS’s public keyKasYi=Cpk+(Cpk) ·K.

    TheCpkitself is encrypted in input and output transactions for designated the recipient of messagem.in contrast, in our proposed system, theCpkis only used for authentication process of the participating vehicleViandRSi.

    3.5 Incentive Driven Message Forwarding and Verification

    In this section of the, we discussed an incentive-based forwarding mechanism to pay the reward to the vehicle for successful message delivery across the network.In case, ifRSineeds to send a messagemtoRSjthrough a store-carry-forward mechanism with the assistance ofVi.ThenRSidemandsVito carry out a messagemtoRSj, the system initiates an incentive transaction TxforRSi.IfVisuccessfully finishes the message forwarding process forRSithen incentive transaction Txis credited to the system network.The incentive transaction Txcan be cashed by RSj using an encashment forward signature (FwdSig) transaction.

    In case, ifVidoes not send the messagemto RSj,RSiwill lose its incentive.Once Txis credited to the system, theRSi’s input value of Txis termed as consumed in the incentive scheme.To handle this condition, we set time-stampTscondition locked with FwdSig forRSito draw the incentive from Tx.This scheme is suitable in the case whereVideliberately not forward the message earlier than the time-stamp lock condition expires.Algorithm 2 shows the function that defines the incentive mechanism for witnesses who verify the event information produced by the source node.Utilizing the define function, RSU adds the credit reward to the account of the responding vehicle and deducts the same amount from the account of the event initiator’s vehicle.Another define function “emit” is used at the end to save the data in the Blockchain.

    ?

    The detailed proposed scheme for message forwarding and signature verification is defined as follow:

    (1) TheRSibroadcasts a request over the network system and asks for the assistance of the volunteer vehicle to carry a messagemtoRSj.The broadcast request includes the location information and identity of theRSj.

    (2) We can assume thatViwhich is near byRSj’s location and voluntarily helpsRSifor message forwarding, responds toRSiby givingΩ= Sig(bskiVi,RSj ‖ loc) with itsCpkVi.

    (3)RSiverifies the signatureΩas v (bpkiVi,Ω) by derivingVi’s public keybpkiVifromCpkVias calculated in Section D.After verification if the signature found valid,RSiformulates incentive transaction Tx1 and combines a messagemsg1: = {m‖Ts‖Sig(bski RSi,m‖Ts),Cpk RSi, Tx1}.Incentive transactions for crediting and reclamation amount as incentives can be stored inTX1.whereTX1.inspecifies credited amount received fromRSi’s MS pool.Virecorded the amount given as incentives inTX1.out and the reclamation condition forTX1.out is described by using script-locking containing of 2-of-2 FwdSig forViand time-stamp constraint forRSj.At last,RSipublishes theTX1to the incentive network and delivers msg1 toVi.

    (4) AsVireceivedmsg1,VicalculatesRSi’s certified public key fromCpk RSi, which is then used for the verification ofRSi’s signature.The message is now stored and carries to the destination point RSj by vehicleVi.Moreover,Viinitiate a validation check of Tx1 using incentive network and generates transaction Tx2 to claim the amount specified in Tx1.out.To claim the amount, Vi verify the transaction Tx2 excluding FwdSig unlocking script of transaction Tx2.in.

    (5) IfVifounds to be an honest and successful volunteer vehicle, the system will allowVito store, carry, and forward.

    (6) WhenVireaches at the target location and recognizesRSj,Viconstitutes another message msg2: = {m‖Ts‖ si(bski RSi,m‖Ts),Cpk RSi, Tx2} and exchange the same with toRSj.

    (7) RSj analyzes the msg2 and initiates the signature verification process (bski,m‖Ts) throughCpkRSi.After successful verification RSj accepts the messagemfromVi.

    (8) As to acknowledge the message delivery ofVi,RSjgenerates transaction Tx2 and generates a partial signature to unlock 2-of-2 FwdSig script.This signature can be used byVito spend the amount claim in the preceding transaction Tx1.out.The generated signature {Tx2, Sig (bskiRSj, Tx2),Cpk RSj} can be provided toVibyRSj.

    (9)VicalculatesRSj’s public key fromCpk RSjto verify the signature {Tx2,Sig(bski RSj,Tx2),Cpk RSj}.If the signature is valid,Vifinalizes 2-of-2 FwdSig unlock-script by appendingVisignature with Tx2.Finally, Tx2 will be published to the incentive network to en-cash the amount given by Tx1 toVi’s account.

    ?

    The validation process can be started on transactions Tx1 and Tx2 over the incentive network,upon successful validation the transactions Tx1 and Tx2 will be appended to the blockchain network.As a result,Vican get a credited amount as incentive for its volunteer cooperation for message propagation on VANETs.The most important aspect of the 2-of-2 FwdSig lock-script is that it cannot be accomplished alone byVi.Therefore,Viwill not be rewarded if it stops message forwarding even if Tx1 is already published to its account in step 3 becauseVicannot solely achieve 2-of-2 FwdSig lock-script.As soon asRSifinds that Tx1 is not cashed byViafter the time-lock expires,RSifreeze the transactionTX’2 to publish incentive becauseVidid not forward the messagemto the actual destination pointRSj.Algorithm 3 shows the function of FwdSig, used for verification of the signatures of every vehicle.RSigenerates a confirmed the list of verified, not verified, and cancelled signatures using this function.

    4 Proposed System Model

    In this section, we evaluate the implementation scenarios and elaborate to obtained experimental results in detail.Our performance evaluation objectives are three folded:

    i) To motivate node contribution in the message delivery and to illustrate the requirements of the incentive scheme.

    ii) To verify the practicability of the proposed incentive schemes.

    iii) To investigate the special effects of different system parameters on the incentive and rewards scheme.

    4.1 Simulation Setup

    The simulation parameters are shown in Tab.2.We assume that power balancing is the same for all nodes.Furthermore, we also assume that no handoffs have been taking place and there is no radio link failure detected in simulation parameters.The simulation parameters in the experimental setup are depicted in Tab.2.

    Table 2: Simulation parameters

    4.2 Experimental Results

    In the proposed scheme the communication cost is measured by the ratio of transmitted byte counted at the channel, which both include event-driven data and periodic data across the networks.In congestion the medium is wholly or partially exploited by the periodic beacons thus the event-driven message could not be disseminated timely.

    Figs.2 and 3, the effects of misbehaving vehicular nodes on the performance evaluation of VANET are investigated in the situation where no incentive scheme is implemented.In the simulation scenario, a misbehaving vehicular node will only forward its self-created messages but decline to deliver those created by other vehicular nodes.Fig.2 depicted the impact of the misbehaving vehicles on packet delivery ratio (PDR).Two lines curve in Fig.2 illustrates the decline tendency of the PDR and relative packet delivery ratio (RPDR) as the proportion of misbehaving vehicles increases.At the beginning we assume that all participating vehicles are honest, i.e., the proportion of misbehaving vehicles is equivalent to 0, and the PDR can be nearly 70%.In case when all the nodes are misbehaving, the proportion of misbehaving nodes is equivalent to 100%, the PDR falls down to only 20%.If the ratio of misbehaving nodes is 100%, as the misbehaving vehicular node will only forward its self-created messages bundle and refused to deliver those created by other vehicles.In such cases, the PDR can be larger than 0 subsequently every node directly carries its own created message from a source point to the destination point.

    The dotted-line curvature in Fig.2 depicted the decline tendency of the PDR relative to no misbehaving nodes.The graph clearly illustrates the lower percentage of the PDR if more misbehaving nodes exist over the network.

    Fig.3 demonstrates the impact of the misbehaving vehicles on the delay factors and the relative delay of the system.The double-line curve shows the increased tendency of the transmission delay as the proportion of misbehaving nodes increases.Fig.3 depicted that the transmission delay is in the defined range of 6000 to 7600 s where all the participating vehicles are honest.As the proportion of misbehaving vehicles increases, the transmission delay will rise exponentially.Transmission delay will rose to 7400 s in worst case scenario where all the participating vehicles are misbehaving.The dashed-line curve depicted the higher proportion of the transmission delay under the different proportions of misbehaving nodes.

    Figure 2: Packet delivery ratio and relative friction for different percentage of misbehaving vehicles

    Figure 3: Transmission delay and relative friction under different percentage of misbehaving nodes

    As depicted in Figs 2 and 3, the presence of the misbehaving nodes will eventually drop down the packet delivery ratio and increase transmission delay.Thus, message forwarding can be greatly affected by the high proportion of misbehaving nodes, and it is very essential to introduce the reward- based incentive approach to stimulate node contribution in the message forwarding over the network.

    We also proposed a unique node identification mechanism scheme by generating a certified public key attached with each message.Public key mechanism is taking into consideration to ensure reliable and accurate message dissemination.

    Fig.4 illustrated the total and average rewarded credits of the suggested scheme with two different scenarios.Total number of created messages also varies from 500 to 1500.At this point, total rewarded incentives refers to the sum of the rewarded incentives of all the forwarded messages, while average rewarded incentives refers to the average rewarded incentives for each forwarded message bundle in the network.The time to live (TTL) per delivered message in Fig.4 is nearly 600 s.The solid-line curvatures depicted the total rewarded incentives, the curve raises almost exponentially as the number of created messages increases.It is very obvious from Figs.4 and 5 that increase in the number of generated messages, the aggregated rewarded incentives will be escalated exponentially with the increase ratio of delivered messages at the destination point.In comparison with our proposed incentive driven misbehavior avoidance (IDMA) scheme, the total rewarded credits are much higher than that of the incentive-based misbehavior detection and tolerance (IMDT) scheme.Dotted-line curves depicted the average rewarded incentives for every conveyed message of the proposed incentive-driven forwarding schemes.Moreover, the average rewarded incentives in the proposed IDMA approach are much higher than that of the existing IMDT approach.Figs.4 and 5 shows that the average rewarded incentives of the proposed incentive-driven scheme are quite stable, as the credits are rewarded from the roadside servers after validation and verification of FwdSig lock-script.This also endorses our previous claims that the rewards imbursement from source nodes for every conveyed message is highly restricted.

    Figure 4: Total rewarded and average rewarded credits for different number of generated messages

    The proposed incentive-driven scheme where all the vehicles in the network will have honestly delivered the messages; this clearly shows that the proposed scheme is incentive compatible.For this purpose, the packets can be dealt for brief time at the destination by introducing a buffer.The buffer stores the incoming packets from the source for a given time interval.After elapsing the given time interval these data packets assemble with each other.

    Fig.5 depicted the effects of the TTL of delivered messages, TTL values varies from 2000s to 4000s in the system model.The idea of the total number of rewarded incentives and average rewarded incentives is similar as illustrated in Fig.4.The rewarded credits in the demonstrated mechanism are depend on the node’s cooperation time.TTL is exponentially increased with an increase in the total cooperation time of the participating node in message forwarding process.As a result, the number of conveyed messages is directly proportional to TTL values.The solid line curve in Fig.5 illustrates the impacts of the time-to-live ratio on the total rewarded incentives of the proposed scheme.Fig.5 shows that the total rewarded incentives of the IMDT mechanism is less than that of the IDMA mechanism.The dotted-line curve illustrates the outcome of the time-to-live ratio on the average rewarded incentives per conveyed packet, which demonstrated that the average incentives of the incentive-driven mechanism are exponentially increase with the high TTL value.In the same way, the average rewarded incentives of the IMDT mechanism are much less than that of the IDMA mechanism.

    Figure 5: Total rewarded and average rewarded credits under different number of TTL per message

    Moreover, we tested the experiment with constantΩvalue; Fig.6 compares the ultimate outcomes about the average reputation with two values ofΩand malicious nodes rate.

    All the outcomes about average reputation values were positive; this is due to the fact that the number of vehicles getting feedback in response to sending messages is much higher than the number of vehicles getting feedback in response of generating messages.The outcomes showed that average reputation is impacted byΩ; the four experimental results about average reputation withΩ= 1.00 are higher than for the four tests withΩ= 0.5.This can be clarified on the basis that the weightage given to forward message is high; while the weightage given for the generating messages is low.Because a large number of vehicular nodes receiving negative feedbacks in response to create and flood bogus messages, and fewer nodes receive positive feedbacks for forwarding real and honest data.

    Fig.7 represents the cooperation or participation ratio of the vehicles within the VANET.As discussed earlier in the paper, the participation ratio depends on the incentive-driven model and the number of legitimate vehicles within VANET.The vehicles appear to be cooperative when they get compensated rewards for their support, that’s why there is an exponential increment in participation ratio.As depicted within the fig, the vehicular cooperation ratio directly proportional to the number of vehicles in the network.Experimental results show that participation ratio directly influenced by number of vehicles on network.

    Fig.8 depicted the time of creating diverse numbers of certificates for every vehicular node using an elliptic curve cryptographic scheme.The total number of generated certificates comprises two main parameter of digital signature and a pair of cryptographic key combinations.The results show that computational time increases as the number of generated certificates increases.these two-performance metrics are directly proportional to each other.Moreover, resources utilization also increases with the increased number of generated certificates.The line appears in the depicted graph is not plane and an unexpected increase can be observed in computation time when the total number of generated certificates crosses 300.Due to this reason, the maximum limit value is set to 250, due to the reason that not more than 250 certifications will be granted at the same time, so the overhead can be reduced on certificate authority.

    Figure 6: Total rewarded credits and average rewarded credits for different number of messages

    Figure 7: Total rewarded and average rewarded credits for different number of generated messages

    Figure 8: Total rewarded credits and average rewarded credits for different number of messages

    5 Conclusion

    In this paper, we proposed an incentive-driven scheme incorporating certified public key generation for VANETS.In order to avoid nodes from misbehaving, a stimulus approach is adopted where vehicles can get rewards for their volunteer efforts and positive cooperation with other vehicles on the network.In proposed scheme, fairness and security can be guaranteed by using FwdSig validation and verification mechanism so that a message carrying node can claim the amount of credit only if the node successfully transfers the message bundle to the target point.To realize the objectives of fairness, we also employed 2-of-2 FwdSig lock and unlock scripts incorporated with time-locked condition to deal with fair incentive rewarding.Moreover,in comparison with the existing schemes, our proposed incentive-driven scheme can be deployed reasonably because the proposed scheme does not implement any virtual incentive system on VANETs.

    Acknowledgement:Authors acknowledge the financial support of TAIF University researchers supporting project under grant TURSP-2020/21.

    Funding Statement:This research was financially supported in part by Researchers Supporting Project (TURSP-2020/121), Taif University, Saudi Arabia.

    Conflicts of Interest:The authors declare that they have no conflicts of interest to report regarding the present study.

    中文字幕av成人在线电影| 别揉我奶头 嗯啊视频| 美女内射精品一级片tv| 亚洲aⅴ乱码一区二区在线播放| 亚洲精品一区av在线观看| 插逼视频在线观看| 天天一区二区日本电影三级| 波多野结衣巨乳人妻| 久久久久久久久中文| 久久亚洲国产成人精品v| 日韩,欧美,国产一区二区三区 | 亚洲真实伦在线观看| 国产真实伦视频高清在线观看| 日韩中字成人| 日日撸夜夜添| 日日摸夜夜添夜夜添小说| 成人美女网站在线观看视频| 精品久久久久久久久久免费视频| 欧洲精品卡2卡3卡4卡5卡区| 久久久久精品国产欧美久久久| 国产亚洲欧美98| 久久九九热精品免费| 日韩精品有码人妻一区| 国产精品久久久久久亚洲av鲁大| 亚洲精品在线观看二区| 国产精品乱码一区二三区的特点| 国产伦一二天堂av在线观看| 久久久a久久爽久久v久久| 高清毛片免费看| 干丝袜人妻中文字幕| 尤物成人国产欧美一区二区三区| 国产在线男女| 搞女人的毛片| 成人特级黄色片久久久久久久| ponron亚洲| 亚洲国产精品sss在线观看| 国产精品久久久久久精品电影| 色综合站精品国产| 免费人成视频x8x8入口观看| 欧美色视频一区免费| 在线免费观看不下载黄p国产| 午夜福利成人在线免费观看| 日本三级黄在线观看| 中文字幕久久专区| 国产成人一区二区在线| 一个人看视频在线观看www免费| 日本黄色视频三级网站网址| 久久热精品热| 亚洲乱码一区二区免费版| www.色视频.com| 波多野结衣高清作品| 我要看日韩黄色一级片| av卡一久久| 别揉我奶头~嗯~啊~动态视频| 亚洲欧美精品综合久久99| 免费观看精品视频网站| 久久久欧美国产精品| 国产探花极品一区二区| 免费av不卡在线播放| 国产一级毛片七仙女欲春2| 此物有八面人人有两片| 少妇被粗大猛烈的视频| 变态另类丝袜制服| 欧美日韩乱码在线| 俺也久久电影网| 亚洲国产精品成人久久小说 | 少妇熟女欧美另类| 欧美日韩在线观看h| 亚洲专区国产一区二区| 人人妻人人看人人澡| 国产精华一区二区三区| 日日干狠狠操夜夜爽| 99九九线精品视频在线观看视频| 欧美性猛交黑人性爽| 国产成人福利小说| 身体一侧抽搐| 国产午夜福利久久久久久| 午夜福利在线在线| 美女xxoo啪啪120秒动态图| 亚洲国产色片| 久久久久久久久中文| 久久精品人妻少妇| 国产精品女同一区二区软件| 亚洲欧美精品综合久久99| 亚洲,欧美,日韩| 国产三级中文精品| 免费大片18禁| 亚洲av电影不卡..在线观看| 欧美激情久久久久久爽电影| 中文亚洲av片在线观看爽| 午夜福利成人在线免费观看| 中文字幕久久专区| 国产精品永久免费网站| 亚洲内射少妇av| 精品人妻偷拍中文字幕| 欧美三级亚洲精品| 亚洲国产高清在线一区二区三| 亚洲av二区三区四区| 精品少妇黑人巨大在线播放 | 亚洲18禁久久av| 久久婷婷人人爽人人干人人爱| 村上凉子中文字幕在线| 最好的美女福利视频网| 色在线成人网| 午夜影院日韩av| 亚洲精品成人久久久久久| 我要搜黄色片| 亚洲国产精品国产精品| 你懂的网址亚洲精品在线观看 | 亚洲精品在线观看二区| 精品免费久久久久久久清纯| 亚洲国产精品久久男人天堂| 国产一级毛片七仙女欲春2| 黑人高潮一二区| 一本一本综合久久| 午夜日韩欧美国产| 久久精品久久久久久噜噜老黄 | or卡值多少钱| 人妻久久中文字幕网| 少妇高潮的动态图| 日韩欧美三级三区| 最近的中文字幕免费完整| 亚洲人成网站在线观看播放| 亚洲欧美日韩无卡精品| 国产精品久久视频播放| 可以在线观看毛片的网站| 神马国产精品三级电影在线观看| 搡老妇女老女人老熟妇| 欧洲精品卡2卡3卡4卡5卡区| 亚洲电影在线观看av| 免费不卡的大黄色大毛片视频在线观看 | 国产黄色视频一区二区在线观看 | 中文在线观看免费www的网站| 亚洲电影在线观看av| 久久人人爽人人爽人人片va| 国产日本99.免费观看| 熟妇人妻久久中文字幕3abv| 久久久久久久久大av| 1024手机看黄色片| 午夜免费男女啪啪视频观看 | 亚洲图色成人| 精品熟女少妇av免费看| 成人特级av手机在线观看| 久久人人爽人人片av| 熟妇人妻久久中文字幕3abv| 99热只有精品国产| 麻豆乱淫一区二区| 婷婷精品国产亚洲av| 日韩欧美三级三区| 精品无人区乱码1区二区| 特级一级黄色大片| 91麻豆精品激情在线观看国产| 日韩亚洲欧美综合| 精品少妇黑人巨大在线播放 | 色在线成人网| 最近手机中文字幕大全| 亚洲无线观看免费| 日韩制服骚丝袜av| 国产麻豆成人av免费视频| 日日摸夜夜添夜夜添av毛片| 久久精品国产亚洲av香蕉五月| 男插女下体视频免费在线播放| 国产探花在线观看一区二区| 亚洲国产精品sss在线观看| 免费人成视频x8x8入口观看| 欧美最黄视频在线播放免费| 精华霜和精华液先用哪个| 久久午夜福利片| 成年免费大片在线观看| 欧美中文日本在线观看视频| 精品久久久噜噜| 女人被狂操c到高潮| 亚洲精品影视一区二区三区av| 狠狠狠狠99中文字幕| 18禁在线无遮挡免费观看视频 | 国产v大片淫在线免费观看| 五月伊人婷婷丁香| 三级国产精品欧美在线观看| 午夜福利18| 日韩欧美一区二区三区在线观看| 久久人人爽人人爽人人片va| 免费大片18禁| 亚洲高清免费不卡视频| 午夜激情福利司机影院| 韩国av在线不卡| 国产精品久久久久久久久免| 国产亚洲精品久久久久久毛片| 97在线视频观看| 欧美成人免费av一区二区三区| 久久精品91蜜桃| 91久久精品国产一区二区三区| 老司机福利观看| 国产午夜福利久久久久久| www.色视频.com| 性插视频无遮挡在线免费观看| 午夜福利成人在线免费观看| 日日摸夜夜添夜夜添av毛片| 小说图片视频综合网站| 亚洲欧美日韩无卡精品| 搡老妇女老女人老熟妇| 亚洲欧美日韩高清专用| 男女那种视频在线观看| av福利片在线观看| 久久精品夜夜夜夜夜久久蜜豆| 亚洲aⅴ乱码一区二区在线播放| 亚洲成a人片在线一区二区| 久久久国产成人免费| 日日撸夜夜添| 九色成人免费人妻av| 综合色丁香网| 国产成人影院久久av| a级毛色黄片| 国产在线男女| 国产三级在线视频| 国产成年人精品一区二区| 嫩草影院入口| 国产精品久久久久久久久免| 日日摸夜夜添夜夜添av毛片| 亚洲精品在线观看二区| 欧美一区二区国产精品久久精品| 亚洲欧美中文字幕日韩二区| 久久精品国产亚洲av天美| 亚洲av五月六月丁香网| 亚洲美女黄片视频| 狂野欧美激情性xxxx在线观看| 亚洲欧美中文字幕日韩二区| 精品国内亚洲2022精品成人| 12—13女人毛片做爰片一| 有码 亚洲区| 高清毛片免费看| 此物有八面人人有两片| 免费观看的影片在线观看| 特级一级黄色大片| 91久久精品国产一区二区三区| 亚洲第一电影网av| 日本与韩国留学比较| 国产亚洲av嫩草精品影院| 精品少妇黑人巨大在线播放 | 久久久久久九九精品二区国产| 少妇猛男粗大的猛烈进出视频 | 欧美+日韩+精品| 国产精品亚洲美女久久久| 亚洲成人av在线免费| 少妇被粗大猛烈的视频| 亚洲最大成人av| 国产淫片久久久久久久久| 中文在线观看免费www的网站| 国产高清不卡午夜福利| 精品一区二区免费观看| 插阴视频在线观看视频| 亚洲精品乱码久久久v下载方式| 一级毛片aaaaaa免费看小| 欧美性感艳星| 久久精品影院6| 国产欧美日韩一区二区精品| 真实男女啪啪啪动态图| 99视频精品全部免费 在线| 久久人人爽人人爽人人片va| 熟女人妻精品中文字幕| 可以在线观看毛片的网站| 蜜臀久久99精品久久宅男| 亚洲七黄色美女视频| 亚洲第一电影网av| 麻豆久久精品国产亚洲av| 九九热线精品视视频播放| 日韩 亚洲 欧美在线| 青春草视频在线免费观看| 国产精品久久久久久亚洲av鲁大| 色综合站精品国产| 成年女人毛片免费观看观看9| 99久久九九国产精品国产免费| 婷婷六月久久综合丁香| 久久午夜亚洲精品久久| 亚洲人成网站在线观看播放| 亚洲欧美日韩无卡精品| 久久午夜福利片| 国产av麻豆久久久久久久| 97碰自拍视频| 日本a在线网址| 日韩欧美国产在线观看| 一区二区三区高清视频在线| 偷拍熟女少妇极品色| 日本三级黄在线观看| 麻豆久久精品国产亚洲av| 日韩强制内射视频| 成熟少妇高潮喷水视频| av福利片在线观看| 十八禁网站免费在线| 免费观看的影片在线观看| 日日摸夜夜添夜夜添小说| 深夜a级毛片| 亚洲精品久久国产高清桃花| 国产色婷婷99| 两个人的视频大全免费| 色综合站精品国产| 欧美中文日本在线观看视频| 在线观看66精品国产| 精品久久久久久久久av| 欧美丝袜亚洲另类| h日本视频在线播放| 久久国产乱子免费精品| 亚洲成a人片在线一区二区| 亚洲成av人片在线播放无| 精品人妻视频免费看| 性色avwww在线观看| 看片在线看免费视频| 少妇人妻一区二区三区视频| 99riav亚洲国产免费| 在线国产一区二区在线| 亚洲精品成人久久久久久| 国产成人影院久久av| 亚洲中文日韩欧美视频| 日韩精品有码人妻一区| av女优亚洲男人天堂| 国产毛片a区久久久久| 色噜噜av男人的天堂激情| 亚洲av一区综合| 在线观看美女被高潮喷水网站| 国产精品爽爽va在线观看网站| 别揉我奶头~嗯~啊~动态视频| av专区在线播放| 在线观看av片永久免费下载| 一级毛片电影观看 | 成年版毛片免费区| 波多野结衣高清作品| 最近的中文字幕免费完整| 国内精品一区二区在线观看| 黑人高潮一二区| 啦啦啦啦在线视频资源| 小说图片视频综合网站| a级毛片免费高清观看在线播放| 色av中文字幕| 三级国产精品欧美在线观看| 欧美一区二区亚洲| 中文在线观看免费www的网站| 嫩草影视91久久| 国产av不卡久久| 日韩人妻高清精品专区| eeuss影院久久| 国产精品精品国产色婷婷| 麻豆成人午夜福利视频| 国产探花在线观看一区二区| 亚洲国产精品sss在线观看| 久久天躁狠狠躁夜夜2o2o| 国产欧美日韩精品一区二区| 亚洲成人中文字幕在线播放| 日韩高清综合在线| 18+在线观看网站| 日韩制服骚丝袜av| 乱系列少妇在线播放| 又黄又爽又免费观看的视频| 99在线人妻在线中文字幕| 老司机福利观看| 国内少妇人妻偷人精品xxx网站| 亚洲国产精品成人综合色| 欧美最黄视频在线播放免费| 搡老岳熟女国产| 国产精品嫩草影院av在线观看| 免费看光身美女| 亚洲自偷自拍三级| 特大巨黑吊av在线直播| 国产精品1区2区在线观看.| 日本a在线网址| 久久精品国产亚洲av涩爱 | 一边摸一边抽搐一进一小说| av福利片在线观看| 亚洲欧美清纯卡通| 国产精品一区二区性色av| 99国产精品一区二区蜜桃av| 亚洲在线自拍视频| 亚洲久久久久久中文字幕| 人妻久久中文字幕网| 网址你懂的国产日韩在线| 亚洲无线在线观看| 欧美国产日韩亚洲一区| 日日啪夜夜撸| 国模一区二区三区四区视频| 欧美人与善性xxx| 五月玫瑰六月丁香| 亚洲av电影不卡..在线观看| 日韩精品青青久久久久久| 美女内射精品一级片tv| 尾随美女入室| 十八禁网站免费在线| 亚洲久久久久久中文字幕| 99国产极品粉嫩在线观看| 亚洲最大成人手机在线| 白带黄色成豆腐渣| 久久久久久大精品| 国产精品永久免费网站| 无遮挡黄片免费观看| 成人性生交大片免费视频hd| 亚洲专区国产一区二区| 国产黄色小视频在线观看| av专区在线播放| 久久中文看片网| 色av中文字幕| 亚洲真实伦在线观看| 男人的好看免费观看在线视频| 亚洲国产精品合色在线| 噜噜噜噜噜久久久久久91| 十八禁国产超污无遮挡网站| 国产不卡一卡二| 美女 人体艺术 gogo| 寂寞人妻少妇视频99o| 欧美成人一区二区免费高清观看| 成人一区二区视频在线观看| 97碰自拍视频| 亚洲最大成人手机在线| 国产探花极品一区二区| 亚洲av免费在线观看| 夜夜夜夜夜久久久久| 在线观看免费视频日本深夜| 国产一区二区激情短视频| 欧美极品一区二区三区四区| 久久热精品热| 国产亚洲av嫩草精品影院| 国产精品乱码一区二三区的特点| 日日撸夜夜添| 亚洲av不卡在线观看| 12—13女人毛片做爰片一| 最近中文字幕高清免费大全6| 一级毛片aaaaaa免费看小| 搡女人真爽免费视频火全软件 | 日本黄色片子视频| 免费在线观看影片大全网站| 性插视频无遮挡在线免费观看| 色5月婷婷丁香| 成年女人永久免费观看视频| 亚洲天堂国产精品一区在线| 亚洲精品日韩av片在线观看| 51国产日韩欧美| 久久精品91蜜桃| 毛片一级片免费看久久久久| av在线亚洲专区| 国国产精品蜜臀av免费| 国产乱人偷精品视频| 3wmmmm亚洲av在线观看| 国产亚洲欧美98| 国产爱豆传媒在线观看| 久久国内精品自在自线图片| 男女那种视频在线观看| 欧美一级a爱片免费观看看| 18禁黄网站禁片免费观看直播| 麻豆国产av国片精品| 欧美最新免费一区二区三区| 免费观看人在逋| 久久久久久久久中文| 免费高清视频大片| 日本黄色片子视频| 免费黄网站久久成人精品| 夜夜爽天天搞| 婷婷亚洲欧美| 听说在线观看完整版免费高清| 亚洲人成网站高清观看| 日韩中字成人| 日本撒尿小便嘘嘘汇集6| 亚洲欧美精品自产自拍| 卡戴珊不雅视频在线播放| 搡女人真爽免费视频火全软件 | 成年av动漫网址| 国产一区二区三区av在线 | 亚洲成人av在线免费| 日韩强制内射视频| 一本精品99久久精品77| 亚洲精品一区av在线观看| 亚洲精品影视一区二区三区av| videossex国产| 久久久久免费精品人妻一区二区| 九色成人免费人妻av| 成人美女网站在线观看视频| 99热只有精品国产| 久久久久久久久久久丰满| 亚洲成人中文字幕在线播放| 又爽又黄无遮挡网站| 又粗又爽又猛毛片免费看| 亚洲av熟女| 欧美日本视频| 国产一区二区在线av高清观看| 免费人成在线观看视频色| 99久久中文字幕三级久久日本| 99久久成人亚洲精品观看| 99久久精品热视频| 午夜福利成人在线免费观看| 亚洲精品在线观看二区| 1024手机看黄色片| 国产精品1区2区在线观看.| 亚洲欧美日韩卡通动漫| 亚洲无线观看免费| 97超视频在线观看视频| 校园春色视频在线观看| 晚上一个人看的免费电影| 久久久久久九九精品二区国产| 一边摸一边抽搐一进一小说| 日韩精品中文字幕看吧| 天美传媒精品一区二区| 中文资源天堂在线| 乱人视频在线观看| 亚洲成av人片在线播放无| 91久久精品国产一区二区三区| 免费一级毛片在线播放高清视频| 少妇的逼好多水| 亚洲在线观看片| 国产精品一区二区三区四区久久| 亚洲在线自拍视频| 亚洲18禁久久av| 中文字幕久久专区| 亚洲熟妇熟女久久| 成人欧美大片| 97在线视频观看| 少妇的逼水好多| 最近视频中文字幕2019在线8| 国产精品人妻久久久久久| 国产一区二区激情短视频| 看片在线看免费视频| 欧美一区二区国产精品久久精品| 国产色婷婷99| 天堂√8在线中文| 美女被艹到高潮喷水动态| 男女边吃奶边做爰视频| 天天一区二区日本电影三级| 一本一本综合久久| 国产精品综合久久久久久久免费| 亚洲国产精品成人久久小说 | 亚洲电影在线观看av| 一本一本综合久久| 国产成人精品久久久久久| 婷婷精品国产亚洲av在线| 国模一区二区三区四区视频| 亚洲中文字幕日韩| 毛片女人毛片| 国产高清视频在线播放一区| 熟女人妻精品中文字幕| 欧美一区二区精品小视频在线| 最后的刺客免费高清国语| 国产亚洲精品久久久久久毛片| 日本a在线网址| 变态另类成人亚洲欧美熟女| 麻豆国产97在线/欧美| 亚洲av成人精品一区久久| 亚洲熟妇熟女久久| 午夜免费男女啪啪视频观看 | 日本一本二区三区精品| 十八禁网站免费在线| 可以在线观看毛片的网站| 女生性感内裤真人,穿戴方法视频| 99久久精品一区二区三区| 久久精品综合一区二区三区| 亚洲人成网站在线观看播放| 九九热线精品视视频播放| 亚洲无线观看免费| а√天堂www在线а√下载| 少妇高潮的动态图| 欧美成人一区二区免费高清观看| 国产熟女欧美一区二区| 给我免费播放毛片高清在线观看| 亚洲成人久久性| 最近的中文字幕免费完整| 午夜福利18| 色av中文字幕| www.色视频.com| 亚洲在线观看片| 色综合站精品国产| 亚洲性久久影院| 日日摸夜夜添夜夜爱| 国产高清不卡午夜福利| 俺也久久电影网| 亚洲成人久久性| 久久精品夜色国产| 亚洲欧美日韩无卡精品| 精品午夜福利视频在线观看一区| 亚洲美女视频黄频| 国产又黄又爽又无遮挡在线| 国产亚洲91精品色在线| 国产亚洲精品av在线| 国产精华一区二区三区| 亚洲成人中文字幕在线播放| 日韩一区二区视频免费看| 色播亚洲综合网| 亚洲av中文av极速乱| 国产综合懂色| 国产黄色小视频在线观看| 两个人的视频大全免费| 内地一区二区视频在线| 丰满乱子伦码专区| 高清午夜精品一区二区三区 | 内射极品少妇av片p| 国产淫片久久久久久久久| 亚洲欧美成人综合另类久久久 | 伦精品一区二区三区| 国产一区二区三区在线臀色熟女| 91狼人影院| 岛国在线免费视频观看| 99视频精品全部免费 在线| 亚洲国产精品成人久久小说 | 婷婷六月久久综合丁香| 十八禁国产超污无遮挡网站| 成人特级av手机在线观看| 天天一区二区日本电影三级| 最后的刺客免费高清国语| 日韩一本色道免费dvd| 精品午夜福利视频在线观看一区| 亚洲av.av天堂| 成人精品一区二区免费| 日本爱情动作片www.在线观看 | 在线观看av片永久免费下载| 99在线视频只有这里精品首页| 日韩欧美 国产精品| 亚洲一区高清亚洲精品| 色综合亚洲欧美另类图片| 美女被艹到高潮喷水动态| 日韩欧美免费精品| 亚洲成人av在线免费| 熟女人妻精品中文字幕| 无遮挡黄片免费观看|