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

    A feedback-retransmission based asynchronous frequency hopping MAC protocol for military aeronautical ad hoc networks

    2018-05-17 10:07:56JinhuiTANGYequnWANGShufuDONGQiluSUNGuoceHUANG
    CHINESE JOURNAL OF AERONAUTICS 2018年5期

    Jinhui TANG,Yequn WANG,Shufu DONG,Qilu SUN,Guoce HUANG

    aCollege of Information and Navigation,Air Force Engineering University,Xi’an 710077,China

    bNational Key Laboratory of Airspace Technology,Beijing 100085,China

    cPostdoctoral Scienti fic Research Workstation,Westone Information Industry INC.,Chengdu 610041,China

    dPostdoctoral Scientific Research Station,University of Electronic Science and Technology of China,Chengdu 610054,China

    1.Introduction

    A Mobile Ad hoc NETwork(MANET)has the advantages of simple deployment,rapid networking,easy to expand,strong anti-destroying ability,etc.,which make it widely used in social networks,1,2wireless sensor networks,3,4vehicle networks,5,6and so on.Introducing technologies of MANETs into aeronautical communications brings a new application named Aeronautical Ad hoc NETwork(AANET),7,8which helps to build a flexible and efficient platform for exchanging and sharing air information,and is also favored by the military.

    Besides the general characteristics of an MANET,a military AANET also has its own particularities which are mainly classified into two categories.9–12The first one is that air nodes have characteristics of wide coverage,fast-changing topology,and long propagation delay.For example,air nodes may distribute in a huge range of thousands of kilometers and the speed of an aircraft can be 2 Mach.Furthermore,the propagation time of packets may be longer than the transmission time,which will not happen in an MANET.The other is that military aeronautical communication has rigid demands for low latency and high reliability,especially in the application of attacking time-sensitive targets,which expects that 99%of total packets’end-to-end delay should not go beyond 10 ms,and more than 99%of total packets are transmitted successfully.The resulted problems because of these particularities of a military AANET need to be considered during the design of a network infrastructure and communication protocols.In this paper,we only consider the MAC protocol of an AANET,because this protocol has a crucial influence on the system performance.

    The existing MAC protocols of AANETs can be divided into three classi fications.The first one is the reservation MAC protocol,represented by IEEE 802.11 and its implementations.13,14Within an MANET,because of the short distance between two adjacent nodes,the propagation time of these two nodes is much shorter than the transmission time,and thus the influence of the propagation time on the protocol performance analysis can be ignored.However,for an AANET,since the scale of the network gets enlarged,the propagation time between two nodes is also increased,which may be as long as the transmission time,and therefore,the propagation time has to be taken into account of the protocol performance analysis.Furthermore,the nodes of these MAC protocols need multiple control frames to reserve a channel before transmitting packets,which makes the propagation time more serious and the ratio of channel utilization declined,and as a result,the protocol performance degrades sharply.Thus,the reservation MAC protocol only works well in a network with a short node distance.The second one is the scheduling MAC protocol,15represented by Time Division Multiple Access(TDMA)and its improvements.Since the length of a time slot is determined by the maximal propagation time,the maximal transmission time of packets,and the processing time,this kind of protocol works on time synchronization of a network and is suitable for traffic which is delay-insensitive and has a large capacity.The third one is the FH anti-jamming MAC protocol,including synchronous FH16and asynchronous FH.17The synchronization FH has a strict demand for time synchronization,and its characteristic of slow changing topology makes it suitable in a civil AANET.For an application which has a higher demand for timeliness and reliability such as a military AANET,a Statistics Priority-based Media Access(SPMA)control protocol18was proposed,which was developed from the CSMA protocol and adopted the mechanism of channel occupancy statistic.When the value of channel occupancy statistic reaches a predetermined threshold,this protocol will restrict the process of packet access,which will ensure that the network is always in a light load status.Based on the SPMA protocol,adaptive mechanisms for a frequency hopping MAC and a priority-based adaptive frequency hopping MAC were designed in Refs.19,20,respectively.However,they still have some disadvantages to be solved.Firstly,they all belong to the Non-Feedback-Retransmission based asynchronous frequency hopping Media Access(NFRMA)control protocol and only adapt to the very light load scenarios which can lessen the collisions of packets;as a consequence,the performances of system throughput and channel utilization are degraded.Secondly,they use the average packet end-to-end delay as the timeliness evaluation standard,which may not be suitable for time-sensitive information in a military aeronautical network.Lastly,most of existing research works only validate their ideas by simulations,in other words,they are lack of theoretic analysis with modeling and calculating.

    The general simulation method,queuing theory,and Markov model have been used in the proposed protocol of an AANET.As to the simulation method,which is the most basic,simplest,and most effective method,simulation tools include OPNET,NS-2,Qualnet,Exata,and so on.These simulation tools can assess the performances of protocols,and the difference between these simulation tools is only the code portability.The queuing theory method can illustrate the process of packets queuing service,and adopted models are M/G/1/K,M/D/1/K,M/M/1/K,and so on.These queuing models can be used to compute the system throughput,packet success probability,and the distribution of packet waiting time.While the Markov model method can accurately exhibit the state transition course of nodes,this method can be used to analyze the average value and distribution function of packet end-toend delay.

    For the above problems,a new MAC protocol named feedback-retransmission based asynchronous FRequency hopping Media Access(FRMA)control protocol is proposed in this paper.Through techniques of burst communications,asynchronous FH,channel coding,and mechanism of feedback retransmission,the timeliness and reliability of information transmission are ensured.Besides,compared with the NFRMA protocol,the proposed scheme has an outperformance in system throughput.

    2.Protocol description

    Assume that all nodes in a network are equal and randomly distributed within an L×L×H km spatial region,and constitute a fully connected network.The transceiver is composed by one transmitting channel and multiple receiving channels the number of which are equal to the number of FH points.The length of a packet is fixed,and its arrival rate obeys the Poisson distribution.The transmit buffer is a First Input First Output(FIFO)queue,and a newly arrived packet will be discarded automatically when the buffer is full.Since all nodes have their own FH patterns,a packet is split into several bursts and then modulated according to the FH pattern of the receiving node before being transmitted.

    2.1.Multi-packet reception

    In an FH network,there are two ways to realize the function of multi-packet reception.One way is to equip with multiple FH receivers which can process signal detection,timing acquisition,signal receiving,and demodulation for data streams from different sources.The other way is to equip with several general receivers which can receive traffic packets at fixed frequencies and get a complete recovery through Analog-Digital(A/D)conversion and FH pattern matching.With a comparison between these two ways,the second approach has the advantage of less cost.The composition of receiving equipment and the processing procedure are shown in Fig.1.

    Fig.1 indicates that FH pattern matching can recover complete information from traffic packets,and these packets exist in the form of bursts.The burst distributions before FH pattern matching are shown in Fig.2.Fig.2 shows the transmitted packets by nodes A,B,and C via four channels,i.e.,f1-f4,as well as the received packets at the node D.Since the A,B,and C three nodes use the FH pattern of node D,and the initial times and propagation times of the traffic packets for A,B,and C nodes are different,thus the received bursts at node D could be collided as the receiving buffer of node D shown in Fig.2.Through FH pattern matching,these bursts can be recovered into three data streams,and their FH patterns are consistent.

    2.2.Feedback-retransmission mechanism

    Similar to the ARQ protocol,let ACK and NCK represent that packets are received correctly and incorrectly,respectively.Set maximum retransmission times for all packets,and a bigger retransmit number means that the packet is transmitted successfully with a higher ratio;however,a longer delay is also resulted in.When the maximum retransmission times are small,the time delay is also small,but the reliability declines consequently.Therefore,the value of the maximum retransmission times should be given according to a tradeoff between reliability and timeliness in a practical application.

    Since the burst communication and FH technology are utilized,the control frame can only be divided into several bursts because of its short length.Such a limited number of bursts are unfavorable to do FH pattern matching,so an independent control channel may be more suitable.

    2.3.Process of state transition

    The state transition process of the FRMA protocol is shown in Fig.3.

    All nodes in the network work according to the following steps:

    Step 1.Start from the ‘initialization/idle” state.If a new packet arrives,it will be inserted into the tail of the transmitting buffer directly.Then the first packet in the queue is selected to be handled.After channel coding,packet dividing,and FH modulation,this packet is transmitted in a burst manner,and then that node enters into the state of ‘waiting acknowledge”.

    Step 2.In the state of ‘waiting acknowledge”,if a new packet arrives,it will be inserted into the tail of the transmitting buffer directly.If the control frame of ACK arrives,it indicates that the current transmission is successful.If the control frame of NCK arrives,or the waiting acknowledge is timeout,it means that the current transmission is failed.Then the times of that packet’s transmission are examined whether it reaches the maximum,and the result determines discarding or retransmitting of the next step.

    Step 3.By checking the transmitting buffer,the node enters into the state of ‘idle” if it is empty;otherwise,the first packet in the queue is transmitted and enters into the state of ‘waiting acknowledge”.

    3.Modeling analysis

    3.1.Basic parameters

    To easily distinguish,we call packets received from the upper level as traffic packets and packets entering into the network as data packets.A definition of symbols used in the modeling analysis is listed in Table 1.

    3.2.Queuing theory

    For any node,new packets can be considered as customers in the service system,and the process of transmitting can be considered as providing service,so it can be viewed as a typical queuing system.In this system,the arriving process of a new packet obeys the Poisson distribution,and the serving time obeys the independent identical distribution.There is one server,and the size of the transmitting buffer is K.All of these can be described as an M/D/1/K queuing model.

    Let akbe the probability of k sums of packets coming during one packet service time.Let pkbe the probability of k sums of packets waiting in the transmitting buffer under a steady state.Let ηkbe the probability of k sums of residual packets just after one packet leaves the transmitting buffer under a steady state.Let Xkbe the number of residual packets just after the kth packet leaves the transmitting buffer.Because the nodes of the network are independent and the collision of packet transmission for each node has no relation with the unsuccessful times of pre-transmission,according to Refs.21–23,Xkcan be considered as a discrete Markov process,and the state transition course is shown in Fig.4.

    Table 1 definition of symbols used in the modeling analysis.

    Through Markov analysis,the state transition matrix can be written as

    Set η=[η0,η1,...,ηK-1],and the following equations can be obtained:

    ρ can be expressed as

    According to the M/D/1/K queuing model,pkcan be written as

    akcan thus be mathematically expressed as

    When λ and K are fixed,take Eq.(6)into Eq.(1),and then take the resulted Eq.(1)into Eq.(2).Combining the resulted Eq.(2)with Eq.(3),we can get K+1 equations with K+1 parameters,which are ηi,i∈ [0,K-1]and E(Tserve).With the achieved K+1 equations,the parameters ηi,i∈ [0,K-1]and E(Tserve)can be obtained.Take the obtained E(Tserve)into Eq.(4),we can get the value of ρ.With Eq.(5),K+1 equations of parameters pi,i∈ [0,K]can be formed,and piis finally obtained.

    pdropcan be written as

    3.3.Network load

    The mutual interference between data packets may affect correct receiving.Ignore the failure of control frames.Let PSibe the probability of traffic packets which have been transmitted i times and succeeded finally,and let Libe the number of data packets added to the network load which are caused by one traffic packet with i times of transmission.Let PFbe the probability of traffic packets which have reached the maximum retransmission times and failed finally,and the load of the network increases by LFaccordingly.All of these parameters can be expressed as

    Let Q1be the number of data packets added to the network load which are caused by one traffic packet transmission.Based on Eq.(8),Q1can be expressed as

    With Eqs.(7)and(9),the network load can be written as

    3.4.Artwork/Figure

    When the traffic load is low,the sending buffer of each node is empty most of the time,so a new packet arriving from the upper level will be transmitted immediately;thus the process of data packets entering into the network can approximately be thought to obey the Poisson distribution,and the corresponding probability density function can be expressed as

    Any data packet in the network may overlap with some other data packets and get interfered,that is shown in Fig.5.

    As shown in Fig.5,let Di, i=1,2,3...be the ith data packet pre- and post-current data packet. Let φi,i∈ [1,Nburst]be the probability of two adjacent data packets having an ((i-1)Tburst,iTburst]interval,and φNburst+1denotes the probability of having a(Tpacket,∞)interval,where Tpacket=NburstTburst.From the above analysis,the following equations can be obtained:

    De fine I(i,k),i∈ [1,Nburst],k ∈ [1,Nburst+1],the probability that k-1 bursts are interfered in the case of two data packets having an ((i-1)Tburst,iTburst] interval, and I(Nburst+1,k),k ∈ [1,Nburst+1],the probability of k-1 bursts to be interfered in the case of two packets having a(Tpacket,∞)interval.

    De fine g(i,k),i∈ [0,Nburst],k ∈ [0,Nburst],the probability that k bursts are interfered in the case of two packets having i overlapping bursts.g(i,k)can be expressed as

    Step 1.Analysis of D1’s effect on current data packet.

    (1)There are Nburst-i+1 overlapping bursts if two packets have an interval of ((i-1)Tburst,iTburst],i∈ [1,Nburst],and the probability that k-1 bursts are interfered can be expressed as I(i,k)=g(Nburst-i+1,k-1).

    (2)There are no overlapping bursts if two packets have an interval of(Tpacket,∞),and the probability that k-1 burstsare interfered can be expressed as I(Nburst+1,k)=g(0,k-1).

    From the above analysis,I(i,k)can be written as

    According to Eqs.(12)–(16),the expected number of interfered bursts due to being overlapped by D1can be expressed as

    Step 2.Analysis of D2’s effect on current data packet.

    D2’s effect on current data packet is related to the interval between D1and D2,as well as the interval between D1and current data packet.

    (1)If D1and D2has an interval of(0,Tburst],D2’s effect on current data packet is analyzed as follows.

    (A)There are Nburst-i overlapping bursts if the interval between current data packet and D1is((i-1)Tburst,iTburst],i∈ [1,Nburst-1],and the probability that k-1 bursts are interfered can be expressed as I(i,k)=g(Nburst-i,k-1).(B)There are no overlapping bursts if the interval between current data packet and D1is((Nburst-1)Tburst,∞),and the probability that k-1 bursts are interfered can be expressed as I(Nburst,k)=g(0,k-1).I(i,k)can be expressed as

    Therefore,in the case that the interval between D1and D2is(0,Tburst],the expected sum of interfered bursts due to overlapping can be expressed as

    (2) If D1and D2have an interval of((j-1)Tburst,jTburst],j ∈ [1,Nburst-1],D2’s effect on current data packet is analyzed as follows.

    (A)There are Nburst-j-i+1 overlapping bursts if the intervalbetween currentdata packetand D1is((i-1)Tburst,iTburst],i∈ [1,Nburst-j],and the probability that k-1 bursts are interfered can be expressed as I(1,k)=g(Nburst-j-i+1,k-1).

    (B)There are no overlapping bursts if the interval between current data packet and D1is((Nburst-j)Tburst,∞),and the probability that k-1 bursts are interfered can be expressed as I(Nburst-j+1,k)=g(0,k-1).I(i,k)can be expressed as

    Therefore,in the case that the interval between D1and D2is((j-1)Tburst,jTburst],j∈ [1,Nburst-1],the expected number of interfered bursts due to overlapping can be expressed as

    (3)If D1and D2have an interval of((Nburst-1)Tburst,∞),the interval between current data packet and D2is(Tpacket,∞),and there are no overlapping bursts.

    According to Eqs.(18)–(21),the expected sum of interfered bursts due to overlapping with D2can be expressed as

    Theorem 1.A data packet,consisting of Nburstbursts,overlaps with packets A and B.The probability density functions of the interfered bursts’number are IA(k)and IB(k),k ∈ [0,Ntransmit].Then the probability density function of union effects can be expressed as

    The following subsection is the derivation of Theorem 1:

    The instance that k bursts are interfered due to overlapping with A and B can be classi fied as follows:

    Firstly,the probability of k bursts overlapping with A and zero burst overlapping with B can be written as

    Secondly,the probability of k bursts overlapping with A and one burst overlapping with B can be written as

    Thirdly,the probability of k bursts overlapping with A and j,j∈ [0,k]bursts overlapping with B can be written as

    Fourthly,the probability of k-1 bursts overlapping with A and j,j∈ [1,k]bursts overlapping with B can be written as

    From the above analysis,the formulation of IAB(k)can be obtained as

    In order to lessen the computational burden,once the load of the network is not heavy,only two packets before the current data packet and two packets after the current data packet are considered during analyzing the interference of the current data packet.

    Then according to Eq.(23),the probability density function of the total number of interfered bursts can be obtained and written as I(k).

    Assume that a data packet can be recovered if Mburstout of Nburstbursts are correct.Then PDcan be expressed as

    3.5.traffic packet service time

    Tfeedbackcan be expressed as

    If the traffic packet is transmitted successfully after i,i∈ [1,Ntransmit]times of trying,then the service time it occupies can be expressed as

    If the traffic packet reaches the maximum retransmission times,then the service time it occupies can be written as

    Then the expectation of the traffic packet service time can be calculated as

    According to Eqs.(7),(10),(17),(23),and(33),when the parameters n, λ,Nburst,Mburst,Tack,Tfeedback,and σmaxare known,the values of Q,E(Tserve),and PDcan be calculated.

    4.Performance analysis

    4.1.Packet success probability

    Set the packet success probability as the ratio of the number of successful packets to the total number of packets generated,which is denoted by Pright.

    There are two reasons for a failure of traffic packets transmission.The first is transmitting buffer over flow,and the second is that the transmit times of a packet reach the maximum and fail eventually.According to Eqs.(7)and(8),Prightcan be expressed as

    4.2.System throughput

    Set the system throughput as the bit number of successful packets per unit time,and it is denoted by Sthroughput.

    According to Eq.(34),Sthroughputcan be expressed as

    4.3.Packet end-to-end delay

    Set the packet end-to-end delay as the interval from the time of a traffic packet entering into the transmitting buffer to the time of being received successfully,and the packet access time as the interval from the time of a traffic packet moving out the transmitting buffer to the time of being received successfully.

    The computation procedure of the packet end-to-end delay is shown as follows.

    Step 1.Probability density function of the propagation delay.

    Let g(i)be the probability of the propagation delay which is iTburst.The probability density function can be obtained through discrete Laplace transformation,and it is denoted by G(z).

    Step 2.Probability density function of the packet access time.

    If a traffic packet transmits i, i∈ [1,Ntransmit]times and finally succeeds, the access time is denoted as(i-1)Tfeedback+Tpacket+σ,and the probability density function can be written as

    According to Eqs.(8)and(36),the probability density function of the packet access time can be calculated as

    Step 3.Probability density function of the packet end-toend delay.

    When a new traffic packet arrives,if the number of packets waiting in the transmitting buffer is j,j∈ [0,K-1],then the probability density function of the packet end-to-end delay can be expressed as

    According to Eqs.(5)and(38),the probability density function of the packet end-to-end delay can be calculated as

    The distribution function of the packet end-to-end delay can be obtained by residue theorem as

    where ξ denotes the maximum packet end-to-end delay,and it is written as ξ=KNtransmitTfeedback.

    It is assumed that more than 99%of traffic packets’end-toend delays are required less than 10 ms.Then according to Eq.(40),when λ is fixed,t0.99can be obtained via T(t)=0.99.However,the obtained t0.99has a direct relationship with λ when the network scale and packet length are fixed,and when λ changes,the obtained t0.99also varies.Since the equation of T(t|t=10ms)=0.99 is too complex to get an exact value of λ,thus we can only get its approximation according to the distribution of T(t)with different λ.

    The average value of packet end-to-end delays can be calculated as

    5.Performance evaluation

    In this section,simulations are provided to investigate the performance of the FRMA protocol,including(A)the approximation accuracy of theoretical derivation for the FRMA protocol,(B)the performance difference between FRMA and NFRMA,and(C)analysis of the FRMA protocol’s ability in providing low latency service.

    Table 2 Simulation parameters.

    In an air-to-ground attack mission,we dispatch 40 fighters composed by 4 groups to strike enemy’s important target,and the flight path of each group is shown in Fig.6.The flight speed is 100 km/h during take-off,and the maximum and minimum distances between each two groups are 300 km and 100 km,respectively.Within our area,the flight speed is 600 km/h,while once the fighters move into the enemy area,group 1 and group 4 speed up to 1200 km/h and the other two groups speed up to 1100 km/h,quickly.The distance between any two groups is more than 2 km.These groups have cooperative information transmission.The route and speed for coming back are the same as those for the attack,and the whole time of the mission is 2 hours.We use NS-2 to simulate and analyze.

    The simulation parameters are listed in Table 2.

    5.1.Comparison between calculation and experimental results

    Assume that the maximum retransmission times of a traffic packet are 3,and then the packet success probability,the system throughput,and the average packet end-to-end delay under different packet arrival rates are shown in Fig.7.

    As shown in Fig.7(a),in the case of λ ≤ 200 packets/s,the experimental result of packet success probability is consistent with the calculation derivation,but the calculation result is slightly higher than that of experiment if λ > 200 packets/s.The reasons can be summarized as the following.(A)To reduce the computation complexity,this paper puts forward a hypothesis that the time interval of data packets obeys a negative exponential distribution.(B)In the analysis of the packet collision model,only neighboring packets’colliding effect is considered.These two assumptions are only correct in cases of lighter network loads.As shown in Fig.7(b)and(c),the experimental results of the system throughput and the average packet end-to-end delay are consistent with the analytical derivations.

    5.2.Performance comparison between FRMA and NFRMA

    Assume that the maximum retransmission times of a traffic packet are 2,and then the performances of the packet success probability,the system throughput,and the average packet end-to-end delay for FRMA and NFRMA are shown in Fig.8.

    As shown in Fig.8(a),to ensure Pright≥99%,the NFRMA protocol must work in the condition of λ ≤ 42 packets/s,while the FRMA protocol demands λ ≤ 130 packets/s,so the improvement degree is 210%.As shown in Fig.8(b),the system throughput of NFRMA is 6.6×105bits/s in the case of λ=42 packets/s,while the system throughput of FRMA is 2.1 × 106bits/s in the case of λ =130 packets/s.In a word,the improvement degree is 215%.As shown in Fig.8(c),the packet average end-to-end delay of the NFRMA protocol is 0.98 ms,while that of the FRMA protocol is 1.27 ms in the case of λ =130 packets/s.In a word,to ensure Pright≥ 99%,the consumption time of FRMA is 0.29 ms more than that of the NFRMA protocol,so the deteriorative degree is 29.6%.

    Through comparison and analysis,we can see that when the traffic load is very light,these two protocols have no big difference.When the traffic load is not heavy,the proposed FRMA protocol can significantly improve the system throughput with the price of a small delay.However,when the traffic load is heavy,these two protocols both deteriorate sharply.Therefore,the proposed protocol outperforms the existing protocol with normal traffic load,and when the traffic load is heavy,these MAC protocols are not sufficient,and the mechanism of flow control should be taken into account further,which is out of our scope.

    5.3.Analysis of the FRMA protocol’s ability in providing low latency service

    Assume that the maximum retransmission times of traffic packet are 3,and then the packet end-to-end delay distribution of FRMA is shown in Fig.9.

    As shown in Fig.9,in the case of λ=130 packets/s,95%of the packet end-to-end delays are less than 4.96 ms,and 99%are less than 7.72 ms.In the case of λ=150 packets/s,95%of the packet end-to-end delays are less than 5.57 ms,and 99%are less than 8.59 ms.In the case of λ=170 packets/s,95%of the packet end-to-end delays are less than 6.81 ms,and 99%are less than 9.48 ms.In the case of λ=192 packets/s,95%of the packet end-to-end delays are less than 8.13 ms,and 99%are less than 11.4 ms.

    From Fig.9,we can see that if more than 99%of traffic packets’end-to-end delays are required less than 10 ms,we can get the ranges of a reasonable maximum λ with different delay distribution lines.The simulated results show that the delay distribution corresponding to the maximum λ lies between the square line and the downward-pointing triangle line.

    6.Conclusions

    (1)The analytical derivation can reflect the performance of the FRMA protocol in the condition of light network load.

    (2)By using the mechanism of feedback retransmission,the system throughput of the FRMA protocol increases greatly with a price of adding a little packet end-toend delay.

    (3)Although the packet average end-to-end delay of the FRMA protocol is a little higher than that of the NFRMA protocol,with an increase of the traffic load,the proportion of long-delay packets also increases accordingly.Therefore,traffic load should be restricted according to specificdemandson timelinessand reliability.

    Acknowledgement

    This study was supported by the National Natural Science Foundation of China(No.61501496).

    References

    1.Xia F,Liaqat HB,Deng J,Wan JF,Das SK.Overhead control with reliable transmission of popular packets in ad-hoc social networks.IEEE Trans Veh Technol 2016;65(9):7647–61.

    2.Hao F,Li S,Min GY,Kim H-C,Yau SS,Yang LT.An efficient approach to generating location-sensitive recommendations in adhoc social network environments.IEEE Trans Serv Comput 2015;8(3):520–33.

    3.Saman S,Kavian YS,Tarhani M,Rashvand HF.Geographical multi-layered energy-efficient clustering scheme for ad hoc distributed wireless sensor networks.IET Wireless Sens Syst 2016;6(1):1–9.

    4.Priyatosh M,De Swades.New reservation multiaccess protocols for underwater wireless ad hoc sensor networks.IEEE J Oceanic Eng 2015;40(2):277–91.

    5.Xie HH,Boukerche A,Loureiro AAF.MERVS:A novel multichannel error recovery video streaming protocol for vehicle ad hoc networks.IEEE Trans Veh Technol 2016;65(2):923–35.

    6.Siva T P,Tim B,Robert HK.Initial evaluation of an IEEE 802.11s-based mobile ad-hoc network for collaborative unmanned aerial vehicles.Proceedings of ICCVE;2013 December 2–6;Las Vegas.Piscataway,NJ:IEEE Press.2013.p.145–50.

    7.Ghosh S,Nayak A.ACPM:an associative connectivity prediction model for AANETProceedings of ICUFN;2016 July 5-8.Vienna.Piscataway,NJ:IEEE Press;2016.p.605–10.

    8.Mickael R,Fabien G,Alain P.An enhanced 1-hop clustering algorithm for publish/subscribe systems in AANETs.Proceedings of DASC;2015 September 13–17;Czech Republic.Piscataway:IEEE Press;2015.p.2D2-1–2D2-6.

    9.Justin PR,Abdul J,Egemen KC,Perrins E,Sterbenz JPG.Highlydynamic cross-layered aeronautical network architecture.IEEE Trans Aerosp Electron Syst 2011;47(4):2742–65.

    10.Nguyen TXM,Yoshikazu M,Chaiyachet S.Connectivity analytical modeling for a single flight path ad hoc aeronautical network.Proceedings of ECTI;2010 May 19–21;Chiang Mai,Thailand.Piscataway:IEEE Press;2010.p.51–55

    11.Konstanca N,Nicolas B.A new method based on motion primitives to compute 3D path planning close to helicopters’flight dynamics limits.Proceedings of ICMAE;2016 July 18–20;London.Piscataway:IEEE Press;2016.p.411–415

    12.Kam WL,Brian GF.Simultaneous classi fication and ranging of direct fire weapons using an asynchronous acoustic sensor network.Proceedings of ISSNIP;2011 Dec 6–9;Adelaide,SA.Piscataway:IEEE Press;2011.p.425–430.

    13.IEEE Std 802.11.IEEE standard for local and metropolitan area networks,part 11:Wireless LAN medium access control(MAC)and physical layer(PHY)specifications.Piscataway,NJ:IEEE Press;2011.

    14.Aymen F,Domenico G,Vincent L.Evaluation of self-positioning algorithms for time-of- flight base localization.Proceedings of WiOpt;2016 May 9–13;Tempe,AZ.Piscataway:IEEE Press;2016.p.1–8.

    15.Helmle S,Dehm M,Kuhn M,Lieckfeldt D,Pesch D.Feedback interval for link adaptation in TDMA-based single-carrier VHF narrowband mobile ad-hoc networks.Electron Lett 2014;50(3):221–3.

    16.Smart G,Deligiannis N,Surace R,Loscri V.Decentralized timesynchronized channel swapping for Ad Hoc wireless networks.IEEE Trans Veh Technol 2016;65(10):8538–53.

    17.John CH,James AS,inventor;Rockwell Collins Inc.,Method and architecture for TTNT symbol rate scaling modes.United States patent US 7839900;2010 November 23.

    18.Stephen MC,Kelli AH,Scott JFZ,inventor;Rockwell Collins Inc.,Statistical priority-based multiple access system and method.United States patent US 7680077;2010 March 16.

    19.Wang YQ,Ye XY,Qi YJ,Zhang HY.Adaptive mechanism for frequencyhoppingMAC.JXi’dianUniv2013;40(5):78–85[Chinese].

    20.Wang YQ,Yang F,Huang GC,Zhang HY,Guo JX.Media access control protocol with differential service in aeronautical frequency hopping ad hoc networks.J Softw 2013;24(9):2214–25[Chinese].

    21.Bianchi G.Performance analysis of the IEEE 802.11 distributed coordination function.IEEE J Sel Areas Commun 2000;18(3):535–47.

    22.Yao Y,Cai WD,Hilaire V,Koukam A,Wang C.Statistical analysis technique on ad hoc network topology dynamic characteristics:Markov stochastic process.Telecommun Syst 2013;53(1):33–45.

    23.Chenga HJ,Sua ZH,Xiongb NX,Xiao Y.Energy-efficient node scheduling algorithms for wireless sensor networks using Markov random field model.Inf Sci 2016;329:461–77.

    亚洲av成人精品一区久久| 3wmmmm亚洲av在线观看| 中文精品一卡2卡3卡4更新| 久久精品久久精品一区二区三区| 欧美3d第一页| 国产伦在线观看视频一区| 日本-黄色视频高清免费观看| 草草在线视频免费看| 少妇裸体淫交视频免费看高清| 日韩亚洲欧美综合| 丝袜喷水一区| 色网站视频免费| 少妇被粗大猛烈的视频| 国产 一区精品| 男女国产视频网站| 秋霞在线观看毛片| 免费一级毛片在线播放高清视频| 欧美潮喷喷水| 精品久久久久久久末码| 精华霜和精华液先用哪个| 美女大奶头视频| 黑人高潮一二区| 亚洲av一区综合| 欧美xxxx黑人xx丫x性爽| 成人无遮挡网站| 久久久久久久国产电影| 成年版毛片免费区| 国产成人91sexporn| 欧美zozozo另类| 成人二区视频| 成人高潮视频无遮挡免费网站| av.在线天堂| 国产极品天堂在线| 亚洲欧美成人综合另类久久久 | 亚洲久久久久久中文字幕| 久久精品国产亚洲av涩爱| 亚洲av中文av极速乱| 国产精品日韩av在线免费观看| 精品欧美国产一区二区三| 久久人妻av系列| 精品不卡国产一区二区三区| 亚州av有码| 亚洲精品国产av成人精品| 又爽又黄a免费视频| 亚洲经典国产精华液单| 免费电影在线观看免费观看| 久久久久网色| 免费一级毛片在线播放高清视频| 人人妻人人澡欧美一区二区| 久久精品久久精品一区二区三区| av线在线观看网站| 国产熟女欧美一区二区| 精品午夜福利在线看| 午夜免费激情av| videos熟女内射| 小说图片视频综合网站| 少妇丰满av| 欧美激情在线99| 亚洲av不卡在线观看| 国产探花极品一区二区| 少妇丰满av| 日韩av在线大香蕉| 日韩欧美国产在线观看| 全区人妻精品视频| 亚洲av福利一区| 国产精品熟女久久久久浪| 久久久久久久亚洲中文字幕| 男的添女的下面高潮视频| 中文精品一卡2卡3卡4更新| 欧美色视频一区免费| 午夜精品一区二区三区免费看| 国产极品精品免费视频能看的| 国产成人免费观看mmmm| 1024手机看黄色片| 免费一级毛片在线播放高清视频| 欧美日韩在线观看h| 免费观看人在逋| 成人二区视频| 欧美日韩综合久久久久久| 菩萨蛮人人尽说江南好唐韦庄 | 欧美人与善性xxx| 深夜a级毛片| 深爱激情五月婷婷| 亚洲av不卡在线观看| 成年版毛片免费区| 一本—道久久a久久精品蜜桃钙片 精品乱码久久久久久99久播 | 精华霜和精华液先用哪个| 久久6这里有精品| 亚洲久久久久久中文字幕| 老司机影院毛片| 日韩大片免费观看网站 | 色综合色国产| 日日撸夜夜添| 成人性生交大片免费视频hd| 亚洲,欧美,日韩| 精品一区二区三区人妻视频| 天天躁日日操中文字幕| 亚洲激情五月婷婷啪啪| 最近最新中文字幕免费大全7| 免费观看人在逋| 成人性生交大片免费视频hd| 国产大屁股一区二区在线视频| 日韩在线高清观看一区二区三区| 日韩欧美 国产精品| 免费电影在线观看免费观看| av卡一久久| 麻豆av噜噜一区二区三区| 国产在线一区二区三区精 | 九九在线视频观看精品| 蜜臀久久99精品久久宅男| 国产不卡一卡二| 亚洲av免费在线观看| 丝袜美腿在线中文| 国内精品宾馆在线| 一级av片app| 看免费成人av毛片| 国产私拍福利视频在线观看| 少妇人妻精品综合一区二区| 看免费成人av毛片| 国产成人精品婷婷| 欧美3d第一页| 美女脱内裤让男人舔精品视频| 亚洲精品乱久久久久久| 国产精品久久久久久精品电影小说 | 黄色一级大片看看| 婷婷色麻豆天堂久久 | 亚洲国产精品久久男人天堂| 亚洲av成人精品一区久久| 成人高潮视频无遮挡免费网站| 国产午夜精品久久久久久一区二区三区| 国产精品精品国产色婷婷| 亚洲av免费高清在线观看| 特大巨黑吊av在线直播| 中文字幕av在线有码专区| 两个人的视频大全免费| 日本免费一区二区三区高清不卡| 亚洲国产欧洲综合997久久,| 日韩av在线大香蕉| 青春草国产在线视频| 又爽又黄a免费视频| 精品不卡国产一区二区三区| 久久精品夜夜夜夜夜久久蜜豆| 国产私拍福利视频在线观看| 性插视频无遮挡在线免费观看| 一本久久精品| 亚洲国产成人一精品久久久| 成人欧美大片| 身体一侧抽搐| 丰满人妻一区二区三区视频av| 精品久久久久久久末码| 极品教师在线视频| 中国美白少妇内射xxxbb| 最近中文字幕2019免费版| 国产 一区精品| 纵有疾风起免费观看全集完整版 | 成人一区二区视频在线观看| 免费看光身美女| 欧美日韩国产亚洲二区| 国产熟女欧美一区二区| 日韩精品青青久久久久久| 七月丁香在线播放| 国产高清国产精品国产三级 | 成人一区二区视频在线观看| 国产精品无大码| 好男人视频免费观看在线| 免费观看精品视频网站| 亚洲欧美精品专区久久| 能在线免费看毛片的网站| 国产精品野战在线观看| 纵有疾风起免费观看全集完整版 | 五月伊人婷婷丁香| 亚洲国产精品sss在线观看| 国产精品三级大全| 亚洲精品影视一区二区三区av| 国产精品一区www在线观看| 桃色一区二区三区在线观看| 日韩av在线大香蕉| 男人的好看免费观看在线视频| 狠狠狠狠99中文字幕| 欧美xxxx性猛交bbbb| 99热精品在线国产| 亚洲中文字幕一区二区三区有码在线看| 亚洲自拍偷在线| 成人无遮挡网站| 成人午夜精彩视频在线观看| av国产免费在线观看| 久久国内精品自在自线图片| 搞女人的毛片| 久久久久久国产a免费观看| 一级av片app| 夜夜看夜夜爽夜夜摸| 日韩强制内射视频| 成人美女网站在线观看视频| 日本色播在线视频| 国产老妇伦熟女老妇高清| 看黄色毛片网站| 国产不卡一卡二| 麻豆成人午夜福利视频| 一级黄色大片毛片| 国产精品女同一区二区软件| 国产成人精品一,二区| 人人妻人人澡欧美一区二区| 99在线视频只有这里精品首页| 特级一级黄色大片| 亚洲精品乱久久久久久| 精品久久久久久成人av| 1000部很黄的大片| av国产久精品久网站免费入址| 午夜视频国产福利| 亚洲av成人精品一二三区| 老司机影院成人| 又黄又爽又刺激的免费视频.| 99热这里只有是精品在线观看| 久久精品久久久久久噜噜老黄 | 久久精品国产亚洲网站| 久久精品熟女亚洲av麻豆精品 | 久久久久久久久久成人| 男女下面进入的视频免费午夜| 1024手机看黄色片| 亚洲最大成人中文| 精品久久国产蜜桃| 国产精品麻豆人妻色哟哟久久 | 少妇裸体淫交视频免费看高清| 中文在线观看免费www的网站| 2022亚洲国产成人精品| 日韩亚洲欧美综合| 精品不卡国产一区二区三区| 亚洲欧美日韩卡通动漫| 日日摸夜夜添夜夜添av毛片| 少妇的逼好多水| 国产精品蜜桃在线观看| 国产三级中文精品| 国产在视频线精品| 搞女人的毛片| 国产精品爽爽va在线观看网站| 国产精品永久免费网站| 久久99蜜桃精品久久| 日韩高清综合在线| 国产免费男女视频| 狂野欧美激情性xxxx在线观看| 尤物成人国产欧美一区二区三区| 日本午夜av视频| 国产精品久久久久久精品电影小说 | 亚州av有码| 嘟嘟电影网在线观看| 国产精品一区二区性色av| 亚洲av熟女| 精品久久久久久久人妻蜜臀av| www.色视频.com| 国产精品一区www在线观看| 亚洲经典国产精华液单| 狠狠狠狠99中文字幕| 看片在线看免费视频| 国产伦精品一区二区三区视频9| 热99re8久久精品国产| 小说图片视频综合网站| 国产成人91sexporn| 人妻系列 视频| 熟女电影av网| 亚洲婷婷狠狠爱综合网| 一个人看视频在线观看www免费| 国产高清视频在线观看网站| 天堂影院成人在线观看| 在线观看一区二区三区| 建设人人有责人人尽责人人享有的 | 亚洲美女视频黄频| 晚上一个人看的免费电影| 国产乱人视频| 午夜精品在线福利| 九九在线视频观看精品| 精品久久久久久久末码| 欧美不卡视频在线免费观看| 欧美性感艳星| 国产又色又爽无遮挡免| 99在线人妻在线中文字幕| 亚洲国产成人一精品久久久| 精品人妻视频免费看| 精品欧美国产一区二区三| 女人久久www免费人成看片 | 欧美三级亚洲精品| 性插视频无遮挡在线免费观看| 国产伦理片在线播放av一区| 国产精品爽爽va在线观看网站| 又黄又爽又刺激的免费视频.| 久久久久精品久久久久真实原创| 免费看日本二区| 欧美一区二区精品小视频在线| 国产精品久久视频播放| 国产白丝娇喘喷水9色精品| 免费大片18禁| 97超碰精品成人国产| 亚洲国产欧洲综合997久久,| 国产精品麻豆人妻色哟哟久久 | 亚洲高清免费不卡视频| 女人久久www免费人成看片 | 精品一区二区三区人妻视频| 亚洲欧美清纯卡通| 99视频精品全部免费 在线| 午夜亚洲福利在线播放| 国产成人一区二区在线| 欧美性感艳星| 91狼人影院| 色哟哟·www| 丝袜喷水一区| 日韩欧美三级三区| 国产又黄又爽又无遮挡在线| 亚洲伊人久久精品综合 | 在线观看av片永久免费下载| 国产精品久久久久久精品电影小说 | 舔av片在线| 免费人成在线观看视频色| 国产私拍福利视频在线观看| 亚洲天堂国产精品一区在线| 高清日韩中文字幕在线| 日韩欧美国产在线观看| 亚洲欧美一区二区三区国产| 国产乱人视频| 欧美zozozo另类| 久久久精品大字幕| 伊人久久精品亚洲午夜| 亚洲伊人久久精品综合 | 亚洲精品456在线播放app| 亚洲成人av在线免费| 精品一区二区免费观看| 简卡轻食公司| 亚洲在久久综合| 精品午夜福利在线看| 99热全是精品| 亚洲国产日韩欧美精品在线观看| 三级国产精品欧美在线观看| 观看美女的网站| 日本一二三区视频观看| 亚洲在久久综合| 国产精品人妻久久久影院| 韩国av在线不卡| 国产免费男女视频| 长腿黑丝高跟| 老司机福利观看| 我的老师免费观看完整版| 嫩草影院新地址| 最近最新中文字幕大全电影3| 日韩av不卡免费在线播放| 一区二区三区四区激情视频| 天堂影院成人在线观看| 国内精品美女久久久久久| 青春草亚洲视频在线观看| 少妇裸体淫交视频免费看高清| 中国国产av一级| 人妻系列 视频| 亚洲欧美日韩东京热| 亚洲美女视频黄频| 麻豆成人午夜福利视频| 色5月婷婷丁香| 国内揄拍国产精品人妻在线| 国产精品嫩草影院av在线观看| 伦精品一区二区三区| 久久精品夜夜夜夜夜久久蜜豆| 极品教师在线视频| 最新中文字幕久久久久| 99久久人妻综合| 午夜a级毛片| 老司机福利观看| www日本黄色视频网| 亚洲一区高清亚洲精品| 97人妻精品一区二区三区麻豆| 久久久国产成人精品二区| 中文欧美无线码| 少妇熟女欧美另类| 2021天堂中文幕一二区在线观| 久久久久性生活片| 国产真实伦视频高清在线观看| 三级国产精品片| 午夜日本视频在线| 桃色一区二区三区在线观看| 哪个播放器可以免费观看大片| 一级av片app| 日本色播在线视频| 国产精品久久电影中文字幕| 亚洲怡红院男人天堂| 久久久久久久久久久丰满| 久久99热这里只有精品18| 99久久人妻综合| 国产精品久久久久久精品电影| 亚洲av不卡在线观看| 国产不卡一卡二| 精品久久久久久成人av| 国产成人免费观看mmmm| 日本黄色片子视频| 欧美三级亚洲精品| 狂野欧美激情性xxxx在线观看| 国产视频内射| 精品不卡国产一区二区三区| 国产亚洲午夜精品一区二区久久 | 美女黄网站色视频| 国产探花在线观看一区二区| 国国产精品蜜臀av免费| 精品久久久久久久人妻蜜臀av| 国产亚洲最大av| 亚洲成av人片在线播放无| 18禁在线播放成人免费| 国产精品国产高清国产av| 99久久成人亚洲精品观看| 国内揄拍国产精品人妻在线| 国产综合懂色| 亚洲熟妇中文字幕五十中出| 精品久久久久久久人妻蜜臀av| 日韩强制内射视频| 国产成人freesex在线| 69人妻影院| 国产毛片a区久久久久| 免费搜索国产男女视频| 亚洲电影在线观看av| 亚洲国产最新在线播放| 身体一侧抽搐| 99热全是精品| 五月伊人婷婷丁香| 天堂影院成人在线观看| 一边亲一边摸免费视频| 久久久久久久久中文| 深爱激情五月婷婷| 国产又色又爽无遮挡免| 国产成年人精品一区二区| 少妇的逼好多水| 嫩草影院入口| 91精品一卡2卡3卡4卡| 又粗又硬又长又爽又黄的视频| 别揉我奶头 嗯啊视频| 欧美日韩在线观看h| 国产美女午夜福利| 99视频精品全部免费 在线| 91久久精品国产一区二区三区| 乱码一卡2卡4卡精品| 日韩欧美精品v在线| 欧美色视频一区免费| 国产黄片美女视频| 97在线视频观看| 国产在线一区二区三区精 | 亚洲av男天堂| 中文字幕免费在线视频6| 欧美日本亚洲视频在线播放| 国产精品嫩草影院av在线观看| 亚洲成人av在线免费| 毛片女人毛片| 久久久午夜欧美精品| 男人狂女人下面高潮的视频| 国产精品久久久久久精品电影| 久久久精品大字幕| 嫩草影院精品99| 成年人午夜在线观看视频| 人成视频在线观看免费观看| 久久久精品区二区三区| 亚洲欧洲国产日韩| 天天影视国产精品| 久久影院123| 精品酒店卫生间| 国语对白做爰xxxⅹ性视频网站| 男女下面插进去视频免费观看 | 少妇人妻 视频| 国产一区有黄有色的免费视频| 国产亚洲午夜精品一区二区久久| 欧美激情国产日韩精品一区| 久久精品国产综合久久久 | 热re99久久精品国产66热6| 日韩精品有码人妻一区| 天天影视国产精品| 久久热在线av| 久久国产精品大桥未久av| 中文乱码字字幕精品一区二区三区| 2022亚洲国产成人精品| 免费黄网站久久成人精品| 一本色道久久久久久精品综合| 日韩欧美一区视频在线观看| 最近中文字幕高清免费大全6| 久久女婷五月综合色啪小说| 中文乱码字字幕精品一区二区三区| 国产精品国产三级专区第一集| 中文字幕亚洲精品专区| 国产精品人妻久久久影院| 国产不卡av网站在线观看| 国精品久久久久久国模美| 国产熟女欧美一区二区| 99热6这里只有精品| 免费在线观看黄色视频的| 国产一区有黄有色的免费视频| av一本久久久久| www.av在线官网国产| 一本大道久久a久久精品| 1024视频免费在线观看| 男人舔女人的私密视频| 久久人人爽人人爽人人片va| 91精品三级在线观看| 一级毛片我不卡| 亚洲激情五月婷婷啪啪| 内地一区二区视频在线| 国产男女内射视频| 亚洲,欧美精品.| 男男h啪啪无遮挡| 亚洲欧美精品自产自拍| 丰满饥渴人妻一区二区三| 国产麻豆69| 午夜福利乱码中文字幕| 高清不卡的av网站| 永久免费av网站大全| 婷婷色av中文字幕| 少妇的丰满在线观看| a级片在线免费高清观看视频| 嫩草影院入口| 日韩av在线免费看完整版不卡| 国产精品蜜桃在线观看| 国产成人精品婷婷| 国产在线视频一区二区| 国产精品嫩草影院av在线观看| 成人手机av| 男女午夜视频在线观看 | 久久久久久久久久久免费av| 亚洲国产精品成人久久小说| 日韩中字成人| 亚洲国产看品久久| 精品少妇久久久久久888优播| 插逼视频在线观看| 国产精品一二三区在线看| 日韩制服骚丝袜av| av视频免费观看在线观看| 卡戴珊不雅视频在线播放| 天天操日日干夜夜撸| 欧美 日韩 精品 国产| 国产欧美另类精品又又久久亚洲欧美| 亚洲国产精品999| 国语对白做爰xxxⅹ性视频网站| freevideosex欧美| 男女午夜视频在线观看 | 夫妻性生交免费视频一级片| 少妇人妻精品综合一区二区| 日本wwww免费看| av视频免费观看在线观看| 国产成人a∨麻豆精品| 久久人妻熟女aⅴ| 女性被躁到高潮视频| 人成视频在线观看免费观看| 欧美日韩视频高清一区二区三区二| 欧美成人午夜精品| 亚洲精品视频女| 秋霞在线观看毛片| 少妇人妻精品综合一区二区| 久久久a久久爽久久v久久| 久久这里只有精品19| 亚洲国产精品国产精品| 成人国产av品久久久| 性色avwww在线观看| 视频在线观看一区二区三区| 丝瓜视频免费看黄片| 激情五月婷婷亚洲| 大陆偷拍与自拍| 黄网站色视频无遮挡免费观看| 我的女老师完整版在线观看| 国产成人一区二区在线| 国产精品熟女久久久久浪| 国产熟女午夜一区二区三区| 国产日韩欧美在线精品| 亚洲色图综合在线观看| 22中文网久久字幕| 久久人人97超碰香蕉20202| 色哟哟·www| 国产成人精品在线电影| 日韩一区二区三区影片| 国产成人免费观看mmmm| 高清视频免费观看一区二区| www日本在线高清视频| 国产一区二区在线观看日韩| 精品一品国产午夜福利视频| 丝袜美足系列| 亚洲精品日韩在线中文字幕| 精品亚洲成a人片在线观看| 免费大片18禁| 男女下面插进去视频免费观看 | 五月玫瑰六月丁香| 捣出白浆h1v1| 熟女人妻精品中文字幕| 菩萨蛮人人尽说江南好唐韦庄| 久久亚洲国产成人精品v| 欧美 亚洲 国产 日韩一| 欧美日韩精品成人综合77777| 久热这里只有精品99| 亚洲成人手机| 在线观看免费日韩欧美大片| 亚洲第一av免费看| 高清不卡的av网站| 亚洲av国产av综合av卡| 国产高清三级在线| 亚洲欧美日韩卡通动漫| 亚洲av国产av综合av卡| 亚洲国产毛片av蜜桃av| 看免费av毛片| 国产永久视频网站| 男女午夜视频在线观看 | 中文字幕人妻丝袜制服| 女的被弄到高潮叫床怎么办| av一本久久久久| av.在线天堂| 午夜精品国产一区二区电影| 国产亚洲最大av| av.在线天堂| 中文字幕免费在线视频6| 久久久久人妻精品一区果冻| 国产免费福利视频在线观看| 男人舔女人的私密视频| 久久影院123| 男女下面插进去视频免费观看 | 夫妻午夜视频| 在线天堂最新版资源| 久久久久久人人人人人| 狂野欧美激情性xxxx在线观看| 欧美xxⅹ黑人| 黑人巨大精品欧美一区二区蜜桃 | 伊人久久国产一区二区|