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

    Optimizing Energy Conservation in V2X Communications for 5G Networks

    2022-08-24 03:30:08ArifHusenAbidSoahilMohammadHijjiMuhammadHasanainChaudaryandFarooqAhmed
    Computers Materials&Continua 2022年5期

    Arif Husen,Abid Soahil,Mohammad Hijji,Muhammad Hasanain Chaudary and Farooq Ahmed

    1Department of Computer Science,COMSATS University Islamabad,Lahore Campus,Lahore,Punjab,Pakistan

    2Department of Computer Science and Information Technology,Virtual University of Pakistan,Lahore,Punjab,Pakistan

    3Computer Science Department,University of Tabuk,Tabuk,Saudi Arabia

    Abstract:The smart vehicles are one of critical enablers for automated services in smart cities to provide intelligent transportation means without human intervention.In order to fulfil requirements,Vehicle-to-Anything(V2X)communications aims to manage massive connectivity and high traffic load on base stations and extend the range over multiple hops in 5G networks.However, V2X networking faces several challenges from dynamic topology caused by high velocity of nodes and routing overhead that degrades the network performance and increases energy consumption.The existing routing scheme for V2X networking lacks energy efficiency and scalability for high velocity nodes with dense distribution.In order to handle the challenges,this article proposes a scalable and energy-efficient routing scheme called Dynamic proactive reactive routing for 5G(DPR5)for high mobility speed and dense environment.As compared to existing schemes it uses a single routing table and efficiently minimizes the energy consumption in dense environment,improves node‘s lifetime upto 42%,and optimizes network performance by reducing the packet loss ratio upto 46%in a high velocity dense environment.

    Keywords: Internet of vehicles;vehicle-to-any device;energy conservation

    1 Introduction

    A The Internet of things(IoT)is changing the world with an aim to improve daily life by providing diverse applications for smart homes,health care,industrial automation,consumer market,Intelligent transportation system (ITS), security and environmental monitoring [1].The Internet of vehicles(IoV) is basically an integration of the IoT and vehicular network, in which vehicles communicate with other vehicles and IoT enabled devices located in their close proximity [2].Different types of communication needs will exist in IoV such as Vehicle to vehicle(V2V), Vehicle to internet(V2I),Vehicle to people(V2P), Vehicle to traffic controller(V2T), Vehicle to surveillance(V2S) and this list grows on.In short, vehicles will connect to anything and thus a term V2X communication is used as shown in Fig.1.It is important to note that vehicles communicate to the Internet through regular Fifth generation (5G) connectivity and only the communications to nodes such as vehicles, traffic controllers and people present in the surrounding environment are through adhoc network.Thus,causing a significant reduction in the amount of traffic load on the 5G base station.

    Figure 1:Types of communications(a)V2X communications(b)IoV communications

    The IoV is an advanced concept of traditional Adhoc networks,and its basic implementation is similar to its predecessor technologies along with more specific requirements[3,4].It has potential to support connectivity of a large number of devices and enables them to communicate over the Internet.It is expected that more than 20 billion devices will become part of the Internet by the end of this decade.In the absence of V2X communication support,the rapid growth in IoV and their connections will consequently bring a storm in the Internet traffic[5].The huge boost in the Internet traffic will restrain it to achieve IoV objectives and hinder its wide applications[6].The efficiency and effectiveness of IoV depends upon high network throughput,high availability of networks under diverse situations,ultra-low latency,energy efficiency,massive heterogeneous connectivity,and ubiquitous coverage[7].However, current wireless technologies have limitations and are unable to fulfill the requirements,especially providing high network throughput in a dense network[8].Vehicles in IoV form a distributed network in which all devices communicate with each other under different circumstances [9] and based on the category of devices,nodes form multiple communication models[10].The 5G wireless technology has promised to meet deliverables set by IoTs [11].It provides a very high data rate in an energy-efficient manner under dense network environments.It supports the architecture of an ultra-dense network(UDN)[12]where a macro cell is hierarchically split into manageable small cells according to coverage requirements, the quality of service, data rate, number of users, line of sight,and other application scenarios[13].As the cell size becomes small,the number of base stations will increase up to 1000 cells/sq km[14].The increase in density of base stations helps to handle massive network traffic, improve signal quality, and ultra-high-speed data rate for end-users.In addition to UDN, 5G allows direct communications across devices to reduce the dense network traffic [15]consequently in the context of IOV,the vehicle to any other devices(V2X)communications are desired.V2X communications are adhoc in nature and allow communication among vehicles, people, other vehicles, base stations, traffic, and surveillance control devices without the intervention of the base station.The direct communication across the devices is also beneficial in terms of spectrum reusability and interference mitigation[16].

    Although V2X communication has many advantages,it suffers from multiple challenges as well,and must be resolved for the successful realization of V2X communications.IoV are a combination of heterogeneous devices.The mobility nature of vehicles and other devices that need to be connected is different[17].Some devices are static like sensors or cameras which are installed at different locations while others have moderate mobility like human-centric devices.Some of them have an even higher degree of mobility,for instance,vehicular nodes in the Intelligent transport systems(ITS)are highly mobile and nodes can move at a speed of 40 m/s [18].The mobile nature of nodes changes the network topology very frequently as various issues are associated such as increased frequency of update messages,higher flooding,and retransmissions.Thus,there is a higher probability of high packet loss and retransmission consuming more energy.The situation further aggravates with higher density and higher mobility velocities and lifetime of battery-operated devices significantly reduced.

    The existing standalone proactive or reactive routing protocols are not suitable due to their inability to handle the high mobility of vehicles and higher node density.The scalability and energy efficiency in IoV are still a challenge and researchers have been adopting various approaches to address the issue[19–21].

    In this paper,we introduce a routing scheme with dynamic reactive and proactive routing process selection for V2X communications to efficiently manage mobility,reduce overhead,improve the energy conservation and performance in a dense environment.Our major contribution in this article is to design an efficient routing scheme to address high speed mobility and energy efficiency.Moreover,we evaluate the scheme using MATLAB and present an analysis of performance,node‘s lifetime in terms of energy efficiency and packet loss.Rest of the paper is organized as follows:Section 2 discusses existing routing schemes and highlights their shortcomings.Section 3 describes the proposed DPR5 scheme in detail.Experiments and results are discussed in Section 4,and finally Section 5 concludes the findings.

    2 Related Work

    V2X communications are similar to device-to-device communications and ad hoc in nature with specific characteristics like fast mobility and rapid changes in topology.Furthermore,the V2X communication falls under the critical services nature as any delays, information loss or corruption may result in life threatening conditions resulting from accidents and incorrectly calculated routes.Inefficient V2X communication not only degrades the network performance but also inhibits the achievement of the desired network goals such as collecting,evaluating,and sending data to the base station.Moreover,this wastes scarce network resources as well as energy and ultimately shortens the lifetime of devices[22].

    In proactive routing schemes, every node is required to maintain information of neighbors and topology of the network and information requires regular updates [23].A routing scheme called multi-hop cellular networks (MCN) has been proposed in the literature by Othmen et al.[24] to provide connectivity to single as well as for multi hops communication.It transmits a data packet multiple times for single and multiple hop nodes and causes wastage of energy and computation resources.Furthermore, as the node density increases, it floods more and more redundant packets often leading to congestion and degradation of the network performance.In contrast,the Base-centric routing (BCN) scheme proposed by Shaikh et al.[25] efficiently utilizes the network resources in a comparatively simpler way.However, it also transmits the data packets multiple times and cannot ensure the end-to-end delay in case of congestion caused by the increased node density due to which BCN is not a scalable solution for V2X communications.A similar scheme called Cellular based multi-hop network (CBMN) was proposed in [26] to address the scalability issues by using separate transceivers for data and control packet.However, the procedure to identify the data and control packets lead to complexity of the scheme and also wastes computing resources.

    The reactive routing schemes do not maintain any routing tables; rather routes are discovered on demand.A route discovery process is used to flood route request messages and receive the route responses from other nodes.The best route is selected to transmit the data packet based on some metrics.In this category,a Spectrum sharing scheme(SSS)has been proposed for cellular users and device-to-device communications by Lin et al.[27] (2014).This scheme can manage the network interference by adjusting transmit power, however it causes some scalability issues.Furthermore,the frequency division used in this scheme is not feasible with higher densities of the nodes due to the difficulties faced in identifying cellular users and D2D users.The absence of clear demarcation methods between the cellular and D2D users results in load balancing issues in the network.A similar scheme called DSR has been proposed by[28].In this scheme only nodes become active when required and can respond to route request messages,otherwise do not participate in the route discovery process.With sleep mode,it reduces the energy consumption on nodes and reduces the route discovery overhead.However, in networks with higher node density, overhead of the route discovery process increases the delay in communications, furthermore it performs well only on static and low density and low mobility velocities.In the reactive class of routing scheme an Interference-conscious routing(ICR) scheme has been studied by Shaikh et al.[29].It calculates the optimal route based on the minimum signal to interference noise ratio.However,it calculates the SINR at a step and may select longer routes with several relay nodes thus requiring more energy for data packet transmission.

    As compared to the proactive and reactive schemes,hybrid schemes of routing are used to improve the scalability of routing.Bello et al.[30]has presented a model of an adaptive routing scheme where a centralized reactive process is used for a certain number of hops.If the hop threshold increases a distributed proactive process is used for route discovery.The route calculation process involves both the nodes and Base station (BS) and hence reduces the load on BS and results in enhanced coverage, connectivity, and throughput.However, due to three different communication modes, the route discovery process becomes complex and energy consumption increases three-fold.Moreover,the wrong selection of hop thresholds badly affects the efficiency of the routing process.To minimize the complexity of the routing with improved coverage Han et al.[31]proposed the Light dark routing protocol(LDR)scheme.It classifies the single hop nodes as light nodes and multi hop nodes as dark nodes.For dark nodes it uses the reactive route discovery and for light nodes it uses the proactive process.This scheme has improved the coverage in a simpler way, but it uses two control packets for information exchanging continuously that consumes more energy.Furthermore, it has longer end to end delays in a network with high node density and efficiency of the route discovery is dependent on mobility.Another hybrid scheme called Centralized adaptive routing(CAR)has been proposed by Shaikh et al.[25].It uses the same common frequency for both cellular and D2D users Communications and provides an efficient solution in terms of energy consumption and coverage only for low node density networks.This model shows better power utilization for all users under the coverage of BS.

    In this section,we have discussed various existing schemes in the context of V2X communications and has seen that energy efficiency and scalability are still issues faced in V2X communications.We have discussed various reactive and proactive schemes and discussed their issues in terms of performance,energy efficiency and scalability.Moreover,the hybrid schemes based on fixed hop count criteria are also inefficient in an environment with high mobility speed and node density and results in a higher routing overhead and retransmissions.In the next section, we propose a DPR5 routing scheme dynamically select the reactive and proactive route discovery and substantially reduces the energy consumption and improves the scalability.

    3 DPR5 Routing Scheme

    The proactive routing for V2X communications although can provide fast route discovery and reliability in the packet delivery but incurs large overhead and all nodes within the proximity transmit hello message periodically to find the changes.In contrast,the reactive or on-demand routing approach has lesser overhead and lesser resource consumption, but it results in high latency during the route calculation and involves excessive flooding and network clogging.DPR5 design is focused to avoid network clogging in V2X communications,reduce routing overhead and delay in the route discovery process.The scheme consists of two sub-processes, namely a Proactive routing process(PRP) and Reactive routing process(RRP).Both processes coordinate through four coordination points where control of route discovery is transferred from PRP to RRP or vice versa.

    The PRP route discovery process is shown in Fig.2,where each active node broadcasts an inquiry packet and builds a periodically updated Directly connected node ‘s list (DCL) that contains the addresses of Directly connected neighbors(DCN).The Data buffer status (BUFS) is continuously checked by waiting for the data(WFD)signal and updates the Data state status(DSS)flag.If DSS status is ready then PRP checks the routing table and if there is no rout existing in the table,the DCL list is checked otherwise the route entry is saved.If there is no matching entry in the DCL,the control of the route discovery is transferred to RRP process as indicated in Fig.2 with coordination point A.Similarly,after the transmission of data packet,if the acknowledgement is not received during the specified threshold value, the control of route discovery is transferred to RRP as indicated with the coordination point D otherwise DSS is checked for next data packet transmission.

    Figure 2:PRP routing subprocess

    Figure 3:RRP routing subprocess

    The RRP route discovery subprocess is shown in Fig.3 which is initiated through the coordination point A, by broadcasting route requests where the node responses are used to calculate the optimal route.

    Figure 4:Procedure for routing table updates

    If a suitable route is found it is propagated to PRP via coordination point B and after saving the route data packet is transmitted,otherwise Round trip time(RTT)is incremented,and the process is repeated till RTT threshold is reached.Similarly, if a Negative acknowledgement (NAK) is received from PRP, it is incremented till the NAK threshold.During this adoptive route recovery (ARR) is used to find an optimal route that is propagated back to PRP.The coordination point C is used to inform the PRP when no route exists to the destination.According to the spatial locality principle,the probability of communication with the neighbor’s nodes is quite high as compared to the nodes which are located at a far distance from the target node.

    In Eq.(1)N is the total number of nodes into the network,X0is the source node(initiator),Xnis the neighbor of the source node,M is the range of transmission and reception,Aiis the no of nodesXn.The probability of Spatial locality(SL)equation shows that it has a high probability to communicate with its direct neighbors and has a relatively low probability for communication with other nodes.We used PRP for communicating with neighbor nodes where every node-maintained route to every other node within its close vicinity.It consists of a routing table maintenance,and a route discovery process.Route maintenance is more complex because this process continuously monitors the nodes and network state.Each node periodically broadcasts an Inquiry(INQ)message which contains the initiator address,its current location,and residual energy for its neighbor’s nodes.The routing table updating process with INQ messages is shown in Fig.4.Each node periodically broadcasts INQ massage into the network for all nodes under direct transmission coverage of the initiator node.The massage contains the initiator address,its current location,and residual energy.

    Figure 5:Inquiry message broadcast in RRP

    The PRP starts with an INQ message for updating the routing table.During INQ broadcast,the nodes that sent INQ message for their neighboring nodes are included in the routing table and all other nodes are filtered out as shown in Fig.5.

    All the nodes that are under direct coverage of the initiator node receive and extract the INQ message packet, however receiving nodes do not rebroadcast the message.Based on INQ massage each node generates a routing table that includes source and destination address.If the source node does not exist in the neighbor table,an entry into the table is created for that source node.The update of routing table is required when topological change found in the INQ message,and the routing table is updated accordingly.Whenever a node is required to send data,it checks the routing table.If a routing entry is found then start sending data to its destination,otherwise destination may exist at multi hops or doesn’t present in the network.We used a DSR reactive approach for multi-hop communication.

    The RRP is similar to the DSR,and it is a combination of two mechanisms,which work together to allow on-demand route discovery and maintenance for routes.The route discovery process is triggered when a source node wants to send data packets to any destination node route required from a source to destination.This is an on-demand process in which no periodic INQ message is broadcast into the network and the route discovery process is triggered only if there are some data packets to be sent.When a source node wants to send data packets,it generates a Route request(RREQ)inquiry message and places the source and destination address into it.The broadcast INQ massage consists of source ID, destination ID, residual energy, and source location information.All nodes that are under BS coverage receive INQ messages,extract it,and check the destination address.If the receiving node is the intended destination itself or has a destination route into its routing table,then respond otherwise discard it.Only those nodes that have destination address,or it is required destination,will respond to RREQ and disregard INQ message otherwise.In the responding message format,they embedded destination address,energy level,hop count up to the destination and relay nodes address.Based on responding RREQ messages, BS establishes a route from source to destination.BS share the route information with the initiator and check whether they are ready to send data.When all nodes such as a source,destination,and relay nodes become ready,the BS informs the source to send data through delay nodes up to the destination node.With the established route,source nodes continue to send data and receive acknowledgment(ACK)signals from the recipient nodes.In the route maintenance process route are ensured to be maintained by sending and receiving ACK messages to its respective nodes.If due to some reasons ACK messages are not received by sending nodes up to some threshold number,then an error message is broadcast into the network which indicates that route does not exist,so the route discovery process again originated.Each node has limited storage capacity for data packets.When any nodes want to send data, it places packets into its data buffer.Nodes periodically check the buffer and if data is found then find the route through a proactive or reactive routing process and send it to its destination node.If there is no data to send in its data buffer,wait for the arrival of data packets to send.

    The process of discovering a route is comparatively a complex and critical procedure,especially in the case of the reactive approach.Without saving the route information,the routes are searched again and again before sending multiple packets to the same destination.Route information is saved in a Routing buffer(RB)and before sending data to a destination instead of directly initiating the route discovery process,RB is checked for the existence of any matching route.The RB is a fast but limited capacity cache that saves only one entry into its buffer space.As the density of the network is increased,the probability of the indirect communications decreases as per Eq.(1),thus the load on route buffer is also reduced.When a route is found whether it’s through a proactive or reactive routing process,it is saved into it’s the RB.An entry in the RB contains information such as the last route or the current route from the source to destination.The RB use can potentially reduce the route discovery time,energy consumption,and other computational resources.The route establishment process is confirmed with an acknowledgment mechanism.On receipt of a packet, the receiving node must acknowledge the initiator through the same route.If the initiator receives the ACK message,it sends the next data packet,otherwise it increments the NAK counter,which indicates the ACK message is not received.The receipt of an ACK message is the only way to check the status of a route and confirm that a data packet is received and its ACK was sent.However,during this process a route may get disturbed and results in failure of receipt of ACK message.

    This issue generally occurs in multi hops communication.If an ACK message is not received,the NAK counter is incremented.The NAK counter has a threshold of 5 that means if the NAK counter reaches its limit,a signal is broadcasted into the network that the current route is no more valid,and the route discovery process needs to be started.Before sending every data packet,the first of all the NAK buffer threshold is checked if it exceeds its threshold limit then route the route is again discovered otherwise continue to send data packets.When a route is not found through a proactive or reactive approach,an error message is broadcast into the network.It shows that the destination node does not exist in the network.

    4 Measurements and Experimental Results

    The proposed routing scheme was evaluated in MATLAB, and various parameters selected for experiments are shown in Tab.1.

    Table 1:Evaluation parameters

    In the experimental scenario,the initial network is farmed in a two-dimensional free space where the position and direction of nodes are set randomly.The transmission power of nodes is selected at 250 meters.Those nodes participate in network formations which have energy levels above the threshold level.Nodes are allowed to freely move in the operational area.The experiments are conducted by varying the number of nodes from 20 to 50.The node movement is confined to a grid area of 1 km×1 km and 2 km×2 km with velocity varying between 10 m/s to 20 m/s.For the sake of fair comparison,values of different parameters are kept the same for all of the algorithms.We conducted multiple experiments for each algorithm with each setup and computed their average results.The performance is conducted in terms of PLR and energy consumption.The nodes are generally equipped with a full form GPS and transceivers having a transmission range of almost 250 meters.Other sensors provide required information,especially energy level of node and data buffer having limited storage capacity.The nodes leave or join the network following Poisson distribution.

    Considerλbe the average number of nodes leaving or joining the network in a given time intervaltandf(k) the probability ofknodes number of nodes available at any given time, then the arrival distribution of V2X nodes is determined as per the Eq.(1).

    In Eq.(2),Cbrepresents power consumption over time,Iis the discharge current in Amperes,tis the discharge time and n=1.12 is the Peukert constant, the power consumption of the nodes is determined by the Peukert Eq.(2).

    According to above Eq.(3), the energy consumption increases over time due to the fact that initially the node consumes fewer amperes,but after consuming half of the battery it consumes more power, and battery time declines at a faster rate.From the Peukert equation [32], we can find the residual energy as,

    TheCfis full capacity of battery power and age,we impose the threshold on the energy level which is 5%of theCf.At any time,those nodes which have energy less than or equal to that threshold level may be considered as a dead node and will not participate in network formation.Assuming S is the size of the network in terms of number of nodes in a network andais the relative weight of data rateRandNis the number times a node sends data to its neighbor for timet,then the following relation for PLR exists.

    Similarly,ifdis the packet drop,then Eq.(4)becomes,so the Eq.(4)becomes

    As we have discussed in earlier sections, that energy conservation, coverage and scalability are major issues faced with V2X routing, we have evaluated the Packet loss ratio (PLR) and energy consumption by varying node density, coverage, and mobility speed with the proposed model.The results have been compared with adaptive routing and LDR scheme.The reason behind choosing these algorithms for comparison is that the architecture and implementation of these two algorithms are closely related to our model.

    4.1 PDR5 Performance Analysis

    The general performance of the PDR5 has been evaluated by measuring throughput,end-to-end delay,and jitter in the network.During these measurements we have excluded the propagation delay in order to analyze the routing process.Fig.6a shows the results of instantaneous throughput achieved during the experiment.The maximum throughput achieved is 2 Kilo packets per second(KPPS)with the average rate at 0.75 KPPS in a dense environment of 1x1 km grid size and a total of ten high speed nodes.Fig.6b shows the end-to-end delay increases with more nodes starting transmission,however,the maximum delay observed is below 3ps without including the propagation delay.Similarly,the jitter is also within a reasonable limit of 0.6ps and average to 0.12ps as shown in Fig.6c.The major outstanding issues for the V2X communications are scalability,energy efficiency and mobility as discussed in earlier sections,we have compared the PDR5 with other approaches in the next subsection only for these aspects.

    Figure 6:Delay and jitter analysis(a)Throughput of DPR5(b)End to End Delay(c)End to End Jitter

    4.2 Comparison

    In this section,we compare the aspects of mobility,scalability,the packet loss ratio,and energy consumption with other state-of-the-art schemes namely the adaptive routing and LDR.The delay(d)and jitter(j)calculations are performed as per the following system of Eqs.(7)–(11)[33]whereiandjrepresent the packet sequence number andpcis the packet count.The delaydthe time difference between packets is calculated using the timestamp values.

    4.2.1 PLR Measurements

    PLR is a measure of the number of packets dropped as compared to the number of packets transmitted.It has an inverse relationship with performance;high PLR means low network performance and vice versa.We measured the PLR while varying node density and velocity.

    a)PLR vs.Node Density Measurement

    In a grid area of 1 km×1 km,the formation of the number of nodes is varied from 20 to 50 and checks the PLR of the network.Fig.7a shows the comparison of PLR results with DPR5,LDR and adaptive routing.

    Figure 7:PLR vs.node density measurement results(a)Grid size 1 x 1 km(b)Grid size 2 x 2 km

    Increasing the number of nodes causes a decrease in the PLR.With 50 nodes,PLR of the proposed hybrid model reaches 1.3%.While in the case of the other two algorithms PLR also decreased,but not at the same rate as in the proposed model.The drop in PLR is due to the fact that as the number of nodes increase in the limited geographical region,the degree of neighborhood,probability of routefinding and route establishment increases.But in the case of adaptive routing,increasing the number of nodes increases the broadcast message three times,which congests the network.Moreover,finding the hops threshold in a dense network is a complex task which affects the PLR of the network.In the case of LDR,finding a proxy node in a dense network consumes much time which affects the throughput of the network.Another affecting metric is INQ messages, when the number of nodes increases it doubles the number of broadcast messages in the network.Fig.7b shows PLR measurements results and node density for a grid size of 2×2 km.As the grid size increases,the node deploys at a far distance.The probability of neighborhood,route establishment,route find decreased.However,as compared to 1 km×1 km grid size,this network has more PLR at all levels.In this case,the minimum PLR of the network is approximately 4 at 50 nodes in the proposed model.Grid size highly affects the PLR of Adaptive and LDR,because in LDR selection of proxy nodes for remote nodes is not fusible or even consumes much time.

    b)Speed vs.PLR of Network

    Mobility speed is also an important factor to check the performance of a mobile network.It disturbs the routes and routing processes spend more time in route discovery and maintenance process,that directly affects the PLR of the network.We vary the speed of nodes from 10 m/s to 20 m/s while the number of nodes is set at 50.Fig.8a shows the results of mobility speeds and PLR of the network for all three algorithms in a grid area of 1 km×1 km.

    Figure 8:Speed vs.PLR measurement results(a)Grid Size 1 x 1 km(b)Grid Size 2 x 2 km

    It can be noted from the graph that increasing the node’s velocity increases the PLR.With the increase in speed,the PLR of the proposed model does not increase at the same rate as the other algorithms.The reason behind is that,on increasing the speed,nodes move under restricted geographical area and remain in close vicinity to each other.In this way route finding and establishment probability remains high without affecting the PLR in the network.In case of adaptive routing the calculation of hop count threshold is performed repeatedly which decreases PLR in the network.As in the case of LDR, it uses the control message which makes the route maintenance process quite slow, which results in route disturbance frequently.Therefore, the PLR of the network is badly affected due to the mobility of nodes.In the formation when the grid size increased,PLR also increased because the probability of route disturbance increased even more.Nodes may move at the outer region or at far distance from each other,which decreases the probability of route finding.Fig.8b shows the PLR of the network.It shows that the PLR of the DPR5 scheme is not much affected as in adaptive and LDR routing algorithms.

    4.2.2 Results for Energy

    Energy is another key parameter to check the network performance.It is highly important for such types of the network which operate under battery backup and have a limited lifetime.To improve the life of the network it’s more important that we efficiently handle the energy of the network.Nodes’used energy for multiple purposes during transmission, reception, and processing.We monitor the energy consumption while varying node density and velocity.

    a)Node Density vs.Energy Consumption

    We measured the scalability of the proposed model in terms of a relationship between nodes density,mobility speed and energy consumption.A network with a small number of nodes consumes less energy since they transmit,receive,and process fewer data and INQ packets.Similarly,when the number of nodes is increased, total energy consumption of the network also increases.In a dense network, every node receives multiple INQ messages, irrespective of whether they are related to it or not.Another reason for this high consumption is that a greater number of nodes will rely on the message.Since the proposed algorithm consumes less computation resources and performs efficient routing, it consumes less energy as compared to Adaptive and LDR.The proposed model just uses two types of INQ massages (RREQ, RREP) which consume less energy.Whereas adaptive routing algorithms use the three times more message broadcast into the network while finding a route,which causes it to deplete more energy.In the case of LDR,finding a proxy node in a dense network consumes much energy which affects the energy consumption of the network.As the grid size increases, the node deploys at a far distance.The neighborhood probability of route establishment decreased which triggered the routing process frequently.This results in more control and INQ packets, which is the wastage of energy.Fig.9 shows the energy consumption as compared to node density(a and b)and the energy consumption with respect to the mobility speed(c and d)with grid size of 1x1 and 2 km x 2 km respectively.

    In adaptive routing calculation of hop count threshold is performed repeatedly that results in broadcasting more INQ messages increased the energy consumption of nodes.In the case of LDR,the location of the proxy node changes at the same rate as speed which disturbs the route.Selection of proxy nodes, again and again, requires energy consumption activity.Energy consumption of the proposed model does not have much effect as in adaptive and LDR routing algorithms.Another important finding of DPR5 is shown in Fig.10 where PLR is compared with ratio of node Density to node mobility(DMR).

    The PLR of all the other schemes reduces as the DMR is increased,however with PDR5 the PLR remains minimum as compared to other routing schemes.The adoptive routing schemes PLR is twice as of the DPR5,and hybrid scheme has four times more PLR.

    Figure 9:Node’s speed and density vs.energy consumption(a)Grid Size 1 x 1 km(b)Grid Size 2×2 km(c)Grid Size 1×1 km(d)Grid Size 2×2 km

    Figure 10:PLR vs.DMR comparison

    5 Conclusions

    We have proposed an improved scheme for energy efficient and scalable routing in V2X communications for 5G.We have shown that it reduces energy consumption and the PLR in a high-speed dense environment as compared to the adaptive and LDR schemes.The PLR cumulative reduction is observed between 28 to 37%in a dense environment and 20 to 29%in a sparse environment.The highspeed mobility analysis has yielded a reduction of PLR in the range of 26 to 39%in a dense environment and 37 to 46%in a sparse environment.The node lifetime improvements are observed between 32 to 41% in dense environment and 16 to 26% in a sparse environment.Similarly, in highly mobile and dense networks,the energy consumption is reduced in the range of 14 to 19%and in highly mobile and sparse environment between 9 to 20%.Moreover,it has been shown that as ratio of density to mobility velocity is increased,the proposed schemes provide significantly better results in reducing the PLR as compared to other schemes.The end-to-end delay and jitter in all environments have been observed within acceptable limits.Thus, we have shown that the proposed scheme has significant advantages over the existing schemes and can offer better quality of service for critical transport services in 5G.

    Funding Statement:The authors received no specific funding for this study.

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

    丝袜美腿在线中文| 成年免费大片在线观看| 精品一区二区三区av网在线观看| 精品国产亚洲在线| 在线免费观看的www视频| 欧美日韩乱码在线| 成年女人毛片免费观看观看9| 一级毛片女人18水好多| 成人国产综合亚洲| 国产精品亚洲一级av第二区| 白带黄色成豆腐渣| 午夜日韩欧美国产| 小蜜桃在线观看免费完整版高清| 午夜精品一区二区三区免费看| 波多野结衣巨乳人妻| 久久精品国产综合久久久| 国产av麻豆久久久久久久| 久久久精品大字幕| 免费一级毛片在线播放高清视频| 少妇的逼水好多| 久久精品亚洲精品国产色婷小说| 亚洲国产精品合色在线| 免费无遮挡裸体视频| 又粗又爽又猛毛片免费看| АⅤ资源中文在线天堂| 1024手机看黄色片| 欧美最黄视频在线播放免费| 亚洲成人免费电影在线观看| 亚洲18禁久久av| 俺也久久电影网| 高清在线国产一区| 国产老妇女一区| 久久久成人免费电影| av视频在线观看入口| 婷婷丁香在线五月| 黄色日韩在线| 男人舔女人下体高潮全视频| 国产成人福利小说| 天堂动漫精品| 无遮挡黄片免费观看| 国产毛片a区久久久久| 日韩精品中文字幕看吧| 婷婷精品国产亚洲av| 夜夜看夜夜爽夜夜摸| 午夜两性在线视频| 国产精品综合久久久久久久免费| 99国产极品粉嫩在线观看| 亚洲成人中文字幕在线播放| 国产真人三级小视频在线观看| 国产主播在线观看一区二区| 丰满人妻一区二区三区视频av | 久久久色成人| 国产综合懂色| 亚洲av中文字字幕乱码综合| 亚洲在线自拍视频| 亚洲国产欧美网| 日韩精品中文字幕看吧| 变态另类成人亚洲欧美熟女| 久久国产精品影院| 人妻夜夜爽99麻豆av| 国产精品影院久久| 久久亚洲精品不卡| 久久中文看片网| 老汉色av国产亚洲站长工具| 午夜福利免费观看在线| 一个人免费在线观看电影| 嫩草影院入口| xxxwww97欧美| 日韩国内少妇激情av| 国产三级在线视频| 极品教师在线免费播放| 真人一进一出gif抽搐免费| 人妻久久中文字幕网| 一级毛片女人18水好多| 久久久久久久久中文| 亚洲最大成人中文| 欧美区成人在线视频| 日韩免费av在线播放| 欧美bdsm另类| 国产成年人精品一区二区| 露出奶头的视频| 欧美激情在线99| 午夜免费激情av| 成年免费大片在线观看| 老师上课跳d突然被开到最大视频 久久午夜综合久久蜜桃 | 久久九九热精品免费| 亚洲人成网站高清观看| 波多野结衣高清无吗| 嫩草影院精品99| 欧美日本亚洲视频在线播放| 久久99热这里只有精品18| 日日干狠狠操夜夜爽| 久久久色成人| 国产麻豆成人av免费视频| 免费看日本二区| 观看免费一级毛片| 国产伦一二天堂av在线观看| 动漫黄色视频在线观看| 日本与韩国留学比较| 色吧在线观看| 偷拍熟女少妇极品色| 性色avwww在线观看| 51国产日韩欧美| 校园春色视频在线观看| 国产精品野战在线观看| 欧美日韩精品网址| 日本五十路高清| 五月玫瑰六月丁香| 最后的刺客免费高清国语| 亚洲人成网站高清观看| 村上凉子中文字幕在线| 一个人免费在线观看电影| 国产精品久久电影中文字幕| 国产高清视频在线播放一区| 亚洲性夜色夜夜综合| 99久国产av精品| netflix在线观看网站| 老汉色∧v一级毛片| 18禁黄网站禁片免费观看直播| 欧美黄色片欧美黄色片| 性色av乱码一区二区三区2| 国产精品嫩草影院av在线观看 | 成年女人看的毛片在线观看| 日韩精品青青久久久久久| 国产精品久久久人人做人人爽| 欧美一区二区亚洲| 一本一本综合久久| 精品午夜福利视频在线观看一区| 丁香六月欧美| 亚洲国产高清在线一区二区三| 又紧又爽又黄一区二区| 国产午夜精品久久久久久一区二区三区 | 精品久久久久久成人av| 免费观看精品视频网站| 一个人看的www免费观看视频| 老汉色∧v一级毛片| 草草在线视频免费看| 床上黄色一级片| 中亚洲国语对白在线视频| 亚洲精品456在线播放app | 中国美女看黄片| 久久草成人影院| 国产色爽女视频免费观看| 一个人观看的视频www高清免费观看| 男插女下体视频免费在线播放| 午夜激情福利司机影院| 少妇的丰满在线观看| 国内久久婷婷六月综合欲色啪| 国产伦一二天堂av在线观看| 小说图片视频综合网站| 美女高潮的动态| 熟女少妇亚洲综合色aaa.| 免费观看精品视频网站| 国产毛片a区久久久久| 久久精品人妻少妇| 亚洲激情在线av| 狠狠狠狠99中文字幕| x7x7x7水蜜桃| 脱女人内裤的视频| 国产精品98久久久久久宅男小说| 日韩欧美精品v在线| 久久久久久久午夜电影| 午夜老司机福利剧场| 精品久久久久久成人av| 两性午夜刺激爽爽歪歪视频在线观看| av国产免费在线观看| 欧美激情在线99| 99久国产av精品| 欧美激情久久久久久爽电影| 久久精品综合一区二区三区| 丰满人妻熟妇乱又伦精品不卡| 两个人的视频大全免费| 亚洲aⅴ乱码一区二区在线播放| 国产aⅴ精品一区二区三区波| 欧美一区二区精品小视频在线| 国产黄色小视频在线观看| 国产aⅴ精品一区二区三区波| 亚洲精品亚洲一区二区| 国产成人影院久久av| 精品久久久久久久人妻蜜臀av| av国产免费在线观看| 国产亚洲精品久久久com| 少妇的逼水好多| 国产主播在线观看一区二区| 97超级碰碰碰精品色视频在线观看| 一个人看的www免费观看视频| 国产一区二区在线av高清观看| 成年女人毛片免费观看观看9| 亚洲成人免费电影在线观看| 亚洲av熟女| 精品久久久久久久久久免费视频| 男女午夜视频在线观看| 最后的刺客免费高清国语| 亚洲国产欧美网| 国产蜜桃级精品一区二区三区| 黄色片一级片一级黄色片| 欧美激情久久久久久爽电影| 久久久精品欧美日韩精品| 熟女少妇亚洲综合色aaa.| 国产高清视频在线播放一区| 一边摸一边抽搐一进一小说| 一本综合久久免费| 亚洲av美国av| 亚洲男人的天堂狠狠| 欧美一区二区精品小视频在线| 欧美zozozo另类| 国产精品电影一区二区三区| 他把我摸到了高潮在线观看| 99久国产av精品| 两个人的视频大全免费| 国产精品 国内视频| 小蜜桃在线观看免费完整版高清| 国产蜜桃级精品一区二区三区| 少妇人妻精品综合一区二区 | 国产亚洲精品综合一区在线观看| 久久久久久久久久黄片| 99热这里只有精品一区| 波多野结衣高清无吗| 久久久久国内视频| 少妇高潮的动态图| 国产精品精品国产色婷婷| 国产又黄又爽又无遮挡在线| av欧美777| 欧美日韩福利视频一区二区| 国产精品亚洲一级av第二区| 免费人成视频x8x8入口观看| 亚洲国产日韩欧美精品在线观看 | 中文字幕高清在线视频| 久久中文看片网| 久久精品国产99精品国产亚洲性色| 三级国产精品欧美在线观看| 色精品久久人妻99蜜桃| 欧美日韩国产亚洲二区| 亚洲熟妇熟女久久| 老师上课跳d突然被开到最大视频 久久午夜综合久久蜜桃 | 久久亚洲精品不卡| 欧美中文日本在线观看视频| av天堂在线播放| 给我免费播放毛片高清在线观看| 在线a可以看的网站| 偷拍熟女少妇极品色| 国内精品久久久久精免费| avwww免费| 老司机午夜十八禁免费视频| 国产午夜福利久久久久久| 国产伦人伦偷精品视频| 久久久久久久久中文| 亚洲,欧美精品.| 亚洲第一欧美日韩一区二区三区| 又粗又爽又猛毛片免费看| a在线观看视频网站| 久久精品国产亚洲av涩爱 | 99热6这里只有精品| 亚洲中文字幕日韩| 一区二区三区免费毛片| 国产免费男女视频| 久久久精品欧美日韩精品| 国产精品一区二区免费欧美| 91麻豆精品激情在线观看国产| 欧美中文日本在线观看视频| 免费看a级黄色片| 给我免费播放毛片高清在线观看| 欧美日韩综合久久久久久 | 久久精品夜夜夜夜夜久久蜜豆| 国内精品久久久久久久电影| 好男人电影高清在线观看| 高清毛片免费观看视频网站| 免费av不卡在线播放| 精品久久久久久久毛片微露脸| 久久久精品大字幕| 岛国视频午夜一区免费看| 蜜桃久久精品国产亚洲av| 2021天堂中文幕一二区在线观| 一本一本综合久久| 亚洲精品在线美女| 久久久久国内视频| 麻豆成人av在线观看| 亚洲七黄色美女视频| 亚洲国产欧美网| 老汉色av国产亚洲站长工具| 国产色爽女视频免费观看| 久久精品国产自在天天线| xxxwww97欧美| 大型黄色视频在线免费观看| 熟女人妻精品中文字幕| 悠悠久久av| a在线观看视频网站| 欧美激情久久久久久爽电影| 两个人视频免费观看高清| 国产亚洲精品av在线| 变态另类丝袜制服| 成人一区二区视频在线观看| 十八禁网站免费在线| 国产高清videossex| 婷婷精品国产亚洲av在线| 亚洲欧美日韩卡通动漫| 亚洲天堂国产精品一区在线| av在线蜜桃| 欧美一区二区亚洲| www.熟女人妻精品国产| 精品一区二区三区人妻视频| 舔av片在线| 国产成人啪精品午夜网站| 国产99白浆流出| 舔av片在线| 国产成人啪精品午夜网站| 亚洲中文字幕一区二区三区有码在线看| or卡值多少钱| 99久久综合精品五月天人人| 午夜两性在线视频| 极品教师在线免费播放| 日本三级黄在线观看| 精品人妻偷拍中文字幕| 成人午夜高清在线视频| 日本一本二区三区精品| 欧美又色又爽又黄视频| 国模一区二区三区四区视频| 99热精品在线国产| 少妇人妻一区二区三区视频| 性色avwww在线观看| 亚洲色图av天堂| 51午夜福利影视在线观看| 欧美日本视频| 舔av片在线| 亚洲中文日韩欧美视频| 国产一区二区三区在线臀色熟女| 在线播放无遮挡| 亚洲内射少妇av| 精品一区二区三区av网在线观看| 五月玫瑰六月丁香| 精品国内亚洲2022精品成人| 女生性感内裤真人,穿戴方法视频| 夜夜躁狠狠躁天天躁| 午夜免费观看网址| 国产aⅴ精品一区二区三区波| 久久99热这里只有精品18| 精品久久久久久成人av| av欧美777| 午夜福利成人在线免费观看| av欧美777| 熟女少妇亚洲综合色aaa.| 国产一区在线观看成人免费| 亚洲av不卡在线观看| 国产午夜精品久久久久久一区二区三区 | 啦啦啦观看免费观看视频高清| 久久亚洲精品不卡| 熟女少妇亚洲综合色aaa.| eeuss影院久久| 免费在线观看成人毛片| 免费看a级黄色片| 欧美色欧美亚洲另类二区| 此物有八面人人有两片| 夜夜夜夜夜久久久久| av天堂在线播放| 免费在线观看亚洲国产| 成人国产一区最新在线观看| 一级黄片播放器| 此物有八面人人有两片| 夜夜夜夜夜久久久久| 男女午夜视频在线观看| 亚洲欧美精品综合久久99| 日韩欧美精品v在线| 久久精品国产99精品国产亚洲性色| 精品久久久久久,| 少妇的丰满在线观看| 无遮挡黄片免费观看| 成人鲁丝片一二三区免费| 亚洲成人精品中文字幕电影| 欧美丝袜亚洲另类 | 国产精品综合久久久久久久免费| 无人区码免费观看不卡| av天堂在线播放| 桃色一区二区三区在线观看| 五月伊人婷婷丁香| 欧美中文综合在线视频| 欧美午夜高清在线| 亚洲在线自拍视频| 琪琪午夜伦伦电影理论片6080| 丝袜美腿在线中文| 国产精品一区二区三区四区免费观看 | a级一级毛片免费在线观看| 久久精品影院6| 窝窝影院91人妻| 欧美一区二区国产精品久久精品| 亚洲国产欧美网| 欧美性猛交╳xxx乱大交人| 在线观看舔阴道视频| 嫩草影院精品99| 亚洲一区二区三区不卡视频| 岛国在线免费视频观看| 在线观看66精品国产| 国模一区二区三区四区视频| 国产一区二区三区视频了| av女优亚洲男人天堂| 91字幕亚洲| 亚洲人成伊人成综合网2020| 在线视频色国产色| 欧美极品一区二区三区四区| 日韩欧美一区二区三区在线观看| 观看免费一级毛片| 国产精品三级大全| 久久久久免费精品人妻一区二区| 91在线精品国自产拍蜜月 | 成人性生交大片免费视频hd| 国产男靠女视频免费网站| 国产亚洲欧美98| 成人三级黄色视频| 欧美国产日韩亚洲一区| 国产高清视频在线观看网站| 日日摸夜夜添夜夜添小说| 成人特级av手机在线观看| 在线播放无遮挡| 国产黄色小视频在线观看| 手机成人av网站| 最近最新免费中文字幕在线| 色哟哟哟哟哟哟| 国产精品美女特级片免费视频播放器| 最好的美女福利视频网| 亚洲男人的天堂狠狠| 午夜免费观看网址| 日日摸夜夜添夜夜添小说| 亚洲性夜色夜夜综合| 免费看光身美女| 国产精品 国内视频| 国产精品久久久久久久电影 | 亚洲欧美日韩无卡精品| 色尼玛亚洲综合影院| 久久中文看片网| 免费人成在线观看视频色| 一个人免费在线观看的高清视频| 一个人看视频在线观看www免费 | 国产爱豆传媒在线观看| 欧美3d第一页| 他把我摸到了高潮在线观看| 欧美最黄视频在线播放免费| 偷拍熟女少妇极品色| 婷婷亚洲欧美| 男人的好看免费观看在线视频| 一区二区三区高清视频在线| 亚洲一区高清亚洲精品| 色综合亚洲欧美另类图片| 亚洲欧美日韩高清在线视频| 淫秽高清视频在线观看| 国产高清激情床上av| 内地一区二区视频在线| 色吧在线观看| 免费一级毛片在线播放高清视频| 搡老妇女老女人老熟妇| 变态另类成人亚洲欧美熟女| 精品一区二区三区视频在线 | www.熟女人妻精品国产| 哪里可以看免费的av片| 欧美乱码精品一区二区三区| 久久亚洲真实| 99久久久亚洲精品蜜臀av| 97超级碰碰碰精品色视频在线观看| 啦啦啦免费观看视频1| 午夜久久久久精精品| 亚洲精品国产精品久久久不卡| 一本综合久久免费| 亚洲精品久久国产高清桃花| 老熟妇仑乱视频hdxx| 欧美3d第一页| 国产私拍福利视频在线观看| 少妇的逼水好多| 日日干狠狠操夜夜爽| 熟女电影av网| 热99re8久久精品国产| 18禁黄网站禁片免费观看直播| 国产在视频线在精品| АⅤ资源中文在线天堂| 欧美绝顶高潮抽搐喷水| 亚洲五月婷婷丁香| 亚洲真实伦在线观看| 日韩欧美在线二视频| 免费高清视频大片| 久久精品国产亚洲av涩爱 | 午夜精品一区二区三区免费看| 中文字幕熟女人妻在线| 国产精品99久久99久久久不卡| 1024手机看黄色片| 亚洲国产精品999在线| 国产精品永久免费网站| 国产一区二区激情短视频| 免费看光身美女| 亚洲五月婷婷丁香| 男女午夜视频在线观看| 精品人妻一区二区三区麻豆 | 亚洲在线自拍视频| 国产精品女同一区二区软件 | 少妇高潮的动态图| 亚洲国产色片| 中文字幕人成人乱码亚洲影| 亚洲欧美日韩高清在线视频| 午夜亚洲福利在线播放| 精品一区二区三区视频在线观看免费| 夜夜夜夜夜久久久久| 久久久成人免费电影| 国产激情偷乱视频一区二区| 亚洲七黄色美女视频| 精品一区二区三区视频在线观看免费| 亚洲成a人片在线一区二区| 国产蜜桃级精品一区二区三区| 丁香六月欧美| 免费搜索国产男女视频| 精品电影一区二区在线| 亚洲av不卡在线观看| 亚洲熟妇中文字幕五十中出| 国产探花在线观看一区二区| 天堂√8在线中文| 国产精品美女特级片免费视频播放器| 国产激情欧美一区二区| 19禁男女啪啪无遮挡网站| 天堂av国产一区二区熟女人妻| a级毛片a级免费在线| 一级毛片高清免费大全| www.999成人在线观看| 怎么达到女性高潮| 麻豆国产97在线/欧美| 丁香六月欧美| 深爱激情五月婷婷| 国产精品99久久久久久久久| 亚洲欧美一区二区三区黑人| 亚洲最大成人中文| 天天躁日日操中文字幕| 亚洲人成网站在线播放欧美日韩| a在线观看视频网站| 国产99白浆流出| 操出白浆在线播放| 波多野结衣高清无吗| 蜜桃亚洲精品一区二区三区| 日韩 欧美 亚洲 中文字幕| 亚洲欧美精品综合久久99| 国产伦精品一区二区三区视频9 | 久久国产精品人妻蜜桃| 波多野结衣高清作品| 成人欧美大片| 精品久久久久久久毛片微露脸| 国产伦在线观看视频一区| 亚洲av第一区精品v没综合| 少妇熟女aⅴ在线视频| 免费看十八禁软件| 久久精品国产综合久久久| 国产黄色小视频在线观看| 婷婷亚洲欧美| 嫩草影院入口| 看免费av毛片| 长腿黑丝高跟| 久久精品国产综合久久久| 亚洲七黄色美女视频| 亚洲av二区三区四区| 亚洲欧美日韩卡通动漫| 熟女电影av网| 国产真实乱freesex| 波多野结衣高清无吗| 中出人妻视频一区二区| 久久久成人免费电影| 亚洲人成网站高清观看| 亚洲精品国产精品久久久不卡| 国产精品野战在线观看| 麻豆国产97在线/欧美| 看黄色毛片网站| 舔av片在线| 熟妇人妻久久中文字幕3abv| 狠狠狠狠99中文字幕| 欧美激情久久久久久爽电影| 啪啪无遮挡十八禁网站| 国产黄片美女视频| 一个人观看的视频www高清免费观看| 黄色日韩在线| 免费观看的影片在线观看| 国产一级毛片七仙女欲春2| 午夜免费激情av| 中文字幕av成人在线电影| 非洲黑人性xxxx精品又粗又长| 男的添女的下面高潮视频| 亚洲一区高清亚洲精品| 亚洲国产av新网站| 久久久a久久爽久久v久久| av又黄又爽大尺度在线免费看| 99久久精品一区二区三区| 综合色av麻豆| 日韩,欧美,国产一区二区三区| 一个人观看的视频www高清免费观看| 免费观看在线日韩| 国产精品美女特级片免费视频播放器| 国产极品天堂在线| 免费黄网站久久成人精品| 久久久成人免费电影| 国产亚洲av片在线观看秒播厂 | 免费观看无遮挡的男女| 夜夜看夜夜爽夜夜摸| 国产美女午夜福利| 亚洲成人精品中文字幕电影| 丝瓜视频免费看黄片| 2018国产大陆天天弄谢| 亚洲精华国产精华液的使用体验| 啦啦啦中文免费视频观看日本| 国产av码专区亚洲av| 三级毛片av免费| 最新中文字幕久久久久| 久久久a久久爽久久v久久| 成人特级av手机在线观看| 日本熟妇午夜| 性色avwww在线观看| 欧美精品一区二区大全| 天堂俺去俺来也www色官网 | 视频中文字幕在线观看| 色网站视频免费| 国产精品美女特级片免费视频播放器| 国产午夜精品久久久久久一区二区三区| 狠狠精品人妻久久久久久综合| 国产一区亚洲一区在线观看| 免费人成在线观看视频色| 欧美性感艳星|