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

    日本-黄色视频高清免费观看| 国产成人a区在线观看| 免费观看精品视频网站| 在线免费观看不下载黄p国产| 中文欧美无线码| 六月丁香七月| 国产伦在线观看视频一区| 69人妻影院| 精品国产三级普通话版| 午夜精品在线福利| 国产熟女欧美一区二区| 高清毛片免费看| 欧美一区二区亚洲| 国产 一区精品| 国语自产精品视频在线第100页| 99久久人妻综合| 一边亲一边摸免费视频| 国产高清不卡午夜福利| 久久草成人影院| 国产亚洲最大av| 你懂的网址亚洲精品在线观看 | 国产高清有码在线观看视频| 99热网站在线观看| 久久精品夜色国产| 99久久中文字幕三级久久日本| 国产爱豆传媒在线观看| 国产亚洲精品av在线| 国产色婷婷99| 中文字幕人妻熟人妻熟丝袜美| videos熟女内射| 国产成人精品一,二区| 欧美另类亚洲清纯唯美| 免费看av在线观看网站| 亚洲人与动物交配视频| 国产伦在线观看视频一区| 天堂av国产一区二区熟女人妻| 国产乱人偷精品视频| 成年av动漫网址| 建设人人有责人人尽责人人享有的 | 91精品国产九色| 精品一区二区免费观看| 永久免费av网站大全| 日本黄大片高清| 成年版毛片免费区| 中文字幕av在线有码专区| 天堂网av新在线| 青春草视频在线免费观看| 日本三级黄在线观看| 内地一区二区视频在线| 亚洲人成网站在线播| 国产淫片久久久久久久久| 男人的好看免费观看在线视频| 国产视频首页在线观看| 精品久久久久久电影网 | 国产高清视频在线观看网站| 在线天堂最新版资源| 亚洲国产日韩欧美精品在线观看| 如何舔出高潮| 日本欧美国产在线视频| 一级二级三级毛片免费看| 国产免费一级a男人的天堂| 大又大粗又爽又黄少妇毛片口| 亚洲欧美中文字幕日韩二区| 久久国产乱子免费精品| 亚洲国产高清在线一区二区三| 久久久久久久久中文| 国产免费视频播放在线视频 | 午夜精品国产一区二区电影 | 一区二区三区四区激情视频| 天堂av国产一区二区熟女人妻| 国产在线一区二区三区精 | 久久6这里有精品| 26uuu在线亚洲综合色| 国产探花极品一区二区| 亚洲欧美日韩卡通动漫| 午夜a级毛片| 天堂中文最新版在线下载 | 久久99热这里只频精品6学生 | 日韩三级伦理在线观看| 成年女人看的毛片在线观看| 精品久久久噜噜| 一本久久精品| 国产一区二区在线观看日韩| 大又大粗又爽又黄少妇毛片口| 中文乱码字字幕精品一区二区三区 | 久久久国产成人免费| 日本五十路高清| 国产探花在线观看一区二区| 免费在线观看成人毛片| 变态另类丝袜制服| 久久久亚洲精品成人影院| 国产伦理片在线播放av一区| 亚洲欧美日韩高清专用| 日本av手机在线免费观看| 亚洲精品,欧美精品| 黄色配什么色好看| 又爽又黄a免费视频| 午夜精品在线福利| 国产一区二区亚洲精品在线观看| 人人妻人人澡欧美一区二区| 91精品一卡2卡3卡4卡| 亚洲精品456在线播放app| 在线免费观看不下载黄p国产| 亚洲精品色激情综合| 亚洲av免费在线观看| 日韩欧美精品v在线| 草草在线视频免费看| 国产亚洲一区二区精品| 午夜老司机福利剧场| 免费观看人在逋| 久久久久久国产a免费观看| 爱豆传媒免费全集在线观看| 我的女老师完整版在线观看| 九九久久精品国产亚洲av麻豆| 欧美区成人在线视频| 亚洲在线自拍视频| 美女黄网站色视频| 精品国产一区二区三区久久久樱花 | 久久久久久大精品| 淫秽高清视频在线观看| 日韩欧美三级三区| 两个人的视频大全免费| 精品国产一区二区三区久久久樱花 | 亚洲欧洲日产国产| 久久久午夜欧美精品| 国产乱人视频| 欧美一区二区精品小视频在线| 亚洲丝袜综合中文字幕| 国产视频内射| 在线免费观看不下载黄p国产| 国产亚洲av嫩草精品影院| 2021少妇久久久久久久久久久| 美女高潮的动态| 亚洲国产精品久久男人天堂| 亚洲精华国产精华液的使用体验| 男女啪啪激烈高潮av片| 国产精品一区二区在线观看99 | 男人舔奶头视频| 午夜福利在线观看免费完整高清在| 国产又色又爽无遮挡免| 内地一区二区视频在线| 国产亚洲一区二区精品| 国产亚洲av嫩草精品影院| 亚洲欧美日韩卡通动漫| 六月丁香七月| 久久99热这里只频精品6学生 | 青青草视频在线视频观看| 久久亚洲精品不卡| 最新中文字幕久久久久| 亚洲欧美成人综合另类久久久 | 精品欧美国产一区二区三| 91久久精品国产一区二区三区| 18禁在线播放成人免费| 日日撸夜夜添| 国产亚洲午夜精品一区二区久久 | 国产成人freesex在线| 欧美变态另类bdsm刘玥| 99久久精品一区二区三区| 中文字幕亚洲精品专区| 九九爱精品视频在线观看| 国产久久久一区二区三区| 久久人妻av系列| 亚洲精品乱码久久久v下载方式| 国产又黄又爽又无遮挡在线| 亚洲精品一区蜜桃| 中文字幕亚洲精品专区| 中文乱码字字幕精品一区二区三区 | 久久99蜜桃精品久久| 欧美三级亚洲精品| 国产精品乱码一区二三区的特点| 国产精品国产高清国产av| 国产激情偷乱视频一区二区| 亚洲av中文字字幕乱码综合| 十八禁国产超污无遮挡网站| 国产91av在线免费观看| 2022亚洲国产成人精品| 日本黄大片高清| 欧美日本亚洲视频在线播放| 亚洲精品日韩在线中文字幕| 国产精品无大码| 日本色播在线视频| 亚洲国产精品专区欧美| 日韩精品有码人妻一区| 久久久欧美国产精品| 麻豆成人午夜福利视频| 丝袜喷水一区| 成人鲁丝片一二三区免费| 女人被狂操c到高潮| 亚洲在线观看片| 国产麻豆成人av免费视频| 51国产日韩欧美| 欧美另类亚洲清纯唯美| 国产在视频线在精品| 老师上课跳d突然被开到最大视频| 国产色婷婷99| av黄色大香蕉| 午夜激情福利司机影院| 男人的好看免费观看在线视频| 国产精品熟女久久久久浪| 美女高潮的动态| 成人二区视频| 国产视频内射| 亚洲一区高清亚洲精品| 青春草国产在线视频| 亚洲av不卡在线观看| 美女高潮的动态| 国产精品国产三级国产专区5o | 国产精品永久免费网站| 天堂影院成人在线观看| 国产在视频线在精品| 麻豆一二三区av精品| 日韩成人伦理影院| 亚洲欧美成人精品一区二区| 国产精品久久电影中文字幕| 91精品国产九色| 久久久色成人| 亚洲精品影视一区二区三区av| 天天躁日日操中文字幕| 国产成人a∨麻豆精品| 亚洲最大成人手机在线| 综合色丁香网| 97热精品久久久久久| 午夜精品在线福利| 日本黄色片子视频| 午夜久久久久精精品| 日韩在线高清观看一区二区三区| 丝袜喷水一区| 欧美97在线视频| 亚洲国产成人一精品久久久| 国产午夜精品一二区理论片| 人体艺术视频欧美日本| 免费观看a级毛片全部| 免费无遮挡裸体视频| 国产亚洲精品av在线| 寂寞人妻少妇视频99o| 日韩欧美 国产精品| 亚洲精品日韩av片在线观看| 中国国产av一级| 狠狠狠狠99中文字幕| 国产69精品久久久久777片| 亚洲av电影不卡..在线观看| 国产欧美日韩精品一区二区| 99久久九九国产精品国产免费| 午夜福利在线在线| 麻豆国产97在线/欧美| 亚洲欧美清纯卡通| 别揉我奶头 嗯啊视频| 欧美日本视频| 内射极品少妇av片p| 欧美另类亚洲清纯唯美| 成人午夜精彩视频在线观看| 欧美三级亚洲精品| 亚洲伊人久久精品综合 | 国产麻豆成人av免费视频| 天堂影院成人在线观看| h日本视频在线播放| 久久这里只有精品中国| 毛片一级片免费看久久久久| 晚上一个人看的免费电影| 国产淫语在线视频| 亚洲精华国产精华液的使用体验| 18+在线观看网站| 91午夜精品亚洲一区二区三区| 国产精品一及| 日韩精品有码人妻一区| 少妇被粗大猛烈的视频| 免费看av在线观看网站| 亚洲国产精品成人综合色| 一本—道久久a久久精品蜜桃钙片 精品乱码久久久久久99久播 | 丰满乱子伦码专区| 国产精品爽爽va在线观看网站| 欧美性猛交黑人性爽| 国产伦精品一区二区三区视频9| 草草在线视频免费看| av在线蜜桃| 日本熟妇午夜| 国产伦一二天堂av在线观看| 国产淫语在线视频| 亚洲国产精品久久男人天堂| 亚洲人成网站高清观看| 国产色婷婷99| 亚洲在久久综合| 欧美三级亚洲精品| 国产精品.久久久| 少妇熟女aⅴ在线视频| 天堂影院成人在线观看| 精品一区二区三区视频在线| 禁无遮挡网站| 51国产日韩欧美| 久久国内精品自在自线图片| 国产亚洲av嫩草精品影院| 91在线精品国自产拍蜜月| 一区二区三区乱码不卡18| 久久精品国产亚洲av天美| 午夜视频国产福利| 精品不卡国产一区二区三区| 免费av不卡在线播放| 午夜日本视频在线| 久久久成人免费电影| av又黄又爽大尺度在线免费看 | 久久久久久久久大av| 3wmmmm亚洲av在线观看| 搡女人真爽免费视频火全软件| 国产成人91sexporn| 午夜老司机福利剧场| 成年女人看的毛片在线观看| 只有这里有精品99| 久久精品国产自在天天线| 少妇的逼好多水| 一级毛片久久久久久久久女| 亚洲综合精品二区| 直男gayav资源| 国产在线男女| 午夜福利在线观看免费完整高清在| 国产精品国产三级专区第一集| www.色视频.com| 一区二区三区四区激情视频| 久久99热6这里只有精品| 内地一区二区视频在线| 国产亚洲精品av在线| 天天躁夜夜躁狠狠久久av| 搡女人真爽免费视频火全软件| 99国产精品一区二区蜜桃av| 亚洲av不卡在线观看| 精品久久久久久久久久久久久| 青春草视频在线免费观看| 精品熟女少妇av免费看| 男女下面进入的视频免费午夜| 18禁裸乳无遮挡免费网站照片| 亚洲久久久久久中文字幕| 国产探花在线观看一区二区| 久久久欧美国产精品| 久久久久久九九精品二区国产| 亚洲18禁久久av| 中文乱码字字幕精品一区二区三区 | 免费不卡的大黄色大毛片视频在线观看 | 在线a可以看的网站| 白带黄色成豆腐渣| 国产高潮美女av| 色综合亚洲欧美另类图片| 97超视频在线观看视频| or卡值多少钱| 国语对白做爰xxxⅹ性视频网站| 男人狂女人下面高潮的视频| 亚洲精品一区蜜桃| 尾随美女入室| 国产在线男女| 色网站视频免费| 男人舔女人下体高潮全视频| 91在线精品国自产拍蜜月| av黄色大香蕉| 蜜臀久久99精品久久宅男| 国产亚洲最大av| 啦啦啦啦在线视频资源| av在线亚洲专区| 欧美+日韩+精品| 国产精品一区二区在线观看99 | 人人妻人人看人人澡| 99视频精品全部免费 在线| 国产一区二区在线观看日韩| 免费不卡的大黄色大毛片视频在线观看 | 日本一本二区三区精品| 亚洲精华国产精华液的使用体验| 成人毛片60女人毛片免费| 成人毛片a级毛片在线播放| 亚洲自拍偷在线| 国产精品久久久久久精品电影| 99久久无色码亚洲精品果冻| 美女高潮的动态| 欧美潮喷喷水| 亚洲最大成人中文| 日韩欧美精品v在线| 国产高清国产精品国产三级 | 国内精品宾馆在线| 中文字幕免费在线视频6| 国产精品电影一区二区三区| 国产午夜精品久久久久久一区二区三区| 一区二区三区免费毛片| 日韩视频在线欧美| 欧美日韩在线观看h| 少妇猛男粗大的猛烈进出视频 | 亚洲一级一片aⅴ在线观看| 久久久久九九精品影院| 十八禁国产超污无遮挡网站| 国产精品一区二区性色av| 最近中文字幕高清免费大全6| 亚洲精品乱码久久久v下载方式| 日本黄色视频三级网站网址| 久久精品综合一区二区三区| 18禁动态无遮挡网站| 日本黄色视频三级网站网址| 在线观看美女被高潮喷水网站| 精品国内亚洲2022精品成人| 色噜噜av男人的天堂激情| 狂野欧美白嫩少妇大欣赏| 国产av码专区亚洲av| 精品免费久久久久久久清纯| 国产精品野战在线观看| 久久久久久久久大av| 秋霞在线观看毛片| 波野结衣二区三区在线| 国产精品三级大全| 亚洲美女搞黄在线观看| 蜜臀久久99精品久久宅男| 春色校园在线视频观看| 黄色一级大片看看| 日本猛色少妇xxxxx猛交久久| 又爽又黄a免费视频| 村上凉子中文字幕在线| 欧美成人一区二区免费高清观看| 亚洲性久久影院| 五月玫瑰六月丁香| 国产久久久一区二区三区| 村上凉子中文字幕在线| 国产真实乱freesex| 老司机影院毛片| 亚洲av一区综合| 小蜜桃在线观看免费完整版高清| 国产精品一及| 最近的中文字幕免费完整| 亚洲av二区三区四区| 视频中文字幕在线观看| 一级爰片在线观看| 99久久精品热视频| 一级av片app| 在线观看av片永久免费下载| 嫩草影院入口| 可以在线观看毛片的网站| 亚洲欧美成人综合另类久久久 | 午夜福利在线在线| 老司机影院成人| 九九在线视频观看精品| 69人妻影院| 中文字幕av在线有码专区| 麻豆国产97在线/欧美| 九九爱精品视频在线观看| 人人妻人人澡欧美一区二区| 精品一区二区三区视频在线| 人体艺术视频欧美日本| 日日摸夜夜添夜夜爱| 麻豆一二三区av精品| 国产精品一区二区三区四区久久| 亚洲精品一区蜜桃| www日本黄色视频网| 麻豆精品久久久久久蜜桃| 我的老师免费观看完整版| 最近手机中文字幕大全| 日本色播在线视频| 毛片女人毛片| 女人久久www免费人成看片 | 久久久久免费精品人妻一区二区| АⅤ资源中文在线天堂| 乱码一卡2卡4卡精品| 日韩精品青青久久久久久| 日本欧美国产在线视频| 国产精品一区二区在线观看99 | 久久久久久国产a免费观看| 精品久久久久久久久久久久久| 国产精品国产三级专区第一集| videossex国产| 岛国毛片在线播放| 最近视频中文字幕2019在线8| 看片在线看免费视频| 爱豆传媒免费全集在线观看| 成年av动漫网址| 亚洲精品成人久久久久久| 在现免费观看毛片| 搞女人的毛片| 亚洲熟妇中文字幕五十中出| 真实男女啪啪啪动态图| 久久精品夜夜夜夜夜久久蜜豆| 男人狂女人下面高潮的视频| 波多野结衣高清无吗| 久久国内精品自在自线图片| 小说图片视频综合网站| av在线播放精品| 国产午夜精品一二区理论片| 99热网站在线观看| 午夜激情福利司机影院| 成人毛片60女人毛片免费| 美女cb高潮喷水在线观看| 秋霞伦理黄片| 亚洲国产精品专区欧美| 亚洲国产精品久久男人天堂| av播播在线观看一区| 51国产日韩欧美| 寂寞人妻少妇视频99o| 最后的刺客免费高清国语| 色综合色国产| 日韩成人av中文字幕在线观看| 日韩欧美在线乱码| 天堂√8在线中文| 午夜久久久久精精品| 我的女老师完整版在线观看| 天堂影院成人在线观看| 亚洲av男天堂| 国产又黄又爽又无遮挡在线| 色吧在线观看| 久久久久久久亚洲中文字幕| 亚洲18禁久久av| 国产免费又黄又爽又色| 欧美精品一区二区大全| 国产成人a∨麻豆精品| 人妻制服诱惑在线中文字幕| 亚洲精品国产成人久久av| 黄色欧美视频在线观看| 亚洲自偷自拍三级| 免费一级毛片在线播放高清视频| 又粗又硬又长又爽又黄的视频| 国产探花在线观看一区二区| 久久久精品94久久精品| 中文在线观看免费www的网站| 99热网站在线观看| 又黄又爽又刺激的免费视频.| 国产精品国产三级国产av玫瑰| 夜夜爽夜夜爽视频| 色哟哟·www| kizo精华| 国产精品女同一区二区软件| 不卡视频在线观看欧美| 免费看美女性在线毛片视频| 欧美变态另类bdsm刘玥| 亚洲精品国产成人久久av| 亚洲av中文字字幕乱码综合| 亚洲av电影在线观看一区二区三区 | 国产乱人视频| 少妇熟女欧美另类| 亚洲欧美精品专区久久| 老司机福利观看| 男人舔女人下体高潮全视频| 国产在视频线在精品| 五月玫瑰六月丁香| 久久这里有精品视频免费| 亚洲最大成人av| 国产伦一二天堂av在线观看| 日本爱情动作片www.在线观看| 亚洲国产精品合色在线| 69av精品久久久久久| 白带黄色成豆腐渣| 最后的刺客免费高清国语| 午夜福利在线观看免费完整高清在| 精品人妻熟女av久视频| 亚洲欧美日韩无卡精品| 亚洲国产精品久久男人天堂| 最近最新中文字幕免费大全7| av专区在线播放| 国产成人福利小说| 中文字幕av在线有码专区| 久久精品综合一区二区三区| 国产午夜精品一二区理论片| 欧美性猛交╳xxx乱大交人| 国产欧美日韩精品一区二区| 一级毛片久久久久久久久女| 熟妇人妻久久中文字幕3abv| 午夜亚洲福利在线播放| 亚洲欧美日韩东京热| 美女内射精品一级片tv| 天堂中文最新版在线下载 | 一级黄色大片毛片| 午夜老司机福利剧场| 天堂中文最新版在线下载 | 国产精品一区二区在线观看99 | 深爱激情五月婷婷| 人妻制服诱惑在线中文字幕| 欧美成人a在线观看| 夫妻性生交免费视频一级片| 一边摸一边抽搐一进一小说| 精品国产露脸久久av麻豆 | 亚洲av电影在线观看一区二区三区 | 亚洲怡红院男人天堂| av在线老鸭窝| 久久人人爽人人爽人人片va| 国产精品野战在线观看| 国产精品女同一区二区软件| 九草在线视频观看| 亚洲va在线va天堂va国产| 国产免费一级a男人的天堂| 亚洲成人久久爱视频| 亚洲自拍偷在线| 亚洲国产精品久久男人天堂| 日韩三级伦理在线观看| 国产欧美日韩精品一区二区| 听说在线观看完整版免费高清| 亚洲国产精品合色在线| 国语对白做爰xxxⅹ性视频网站| 午夜福利网站1000一区二区三区| 秋霞在线观看毛片| 欧美bdsm另类| 级片在线观看| 有码 亚洲区| 国产亚洲精品av在线| 99国产精品一区二区蜜桃av| av.在线天堂| 热99re8久久精品国产| 97人妻精品一区二区三区麻豆| 直男gayav资源| 国产成人精品婷婷| 国产伦精品一区二区三区四那| 日韩强制内射视频| 欧美激情久久久久久爽电影| 97热精品久久久久久| 国内精品美女久久久久久| 久久精品国产亚洲网站| 3wmmmm亚洲av在线观看| 男女那种视频在线观看| 国产亚洲最大av| 精品酒店卫生间| 亚洲欧美清纯卡通| 婷婷色麻豆天堂久久 | eeuss影院久久| 久久人妻av系列| 九九热线精品视视频播放| 亚洲最大成人中文| 99久久精品国产国产毛片| 亚洲精品久久久久久婷婷小说 |