• <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| 最近最新中文字幕大全免费视频| 老司机在亚洲福利影院| 黑人欧美特级aaaaaa片| 十分钟在线观看高清视频www| 亚洲人成电影观看| 国产成人精品无人区| 欧美日韩中文字幕国产精品一区二区三区 | 欧美久久黑人一区二区| 一级片'在线观看视频| 又大又爽又粗| www.999成人在线观看| 国产xxxxx性猛交| 中文字幕制服av| 另类精品久久| 国产精品免费视频内射| 中文字幕精品免费在线观看视频| 精品高清国产在线一区| 国产成人免费无遮挡视频| 久久人人爽av亚洲精品天堂| 亚洲免费av在线视频| 久久天躁狠狠躁夜夜2o2o| 久久女婷五月综合色啪小说| 亚洲av日韩精品久久久久久密| 亚洲成人国产一区在线观看| 精品人妻在线不人妻| 国产一区有黄有色的免费视频| 嫩草影视91久久| 亚洲精品中文字幕在线视频| 热re99久久精品国产66热6| 水蜜桃什么品种好| 侵犯人妻中文字幕一二三四区| www日本在线高清视频| 我要看黄色一级片免费的| 亚洲色图综合在线观看| 久久99热这里只频精品6学生| 国产人伦9x9x在线观看| 久久ye,这里只有精品| 丰满人妻熟妇乱又伦精品不卡| 少妇的丰满在线观看| 老司机午夜十八禁免费视频| 色综合欧美亚洲国产小说| 制服人妻中文乱码| 丁香六月欧美| 天堂8中文在线网| 精品一区在线观看国产| 久久久国产一区二区| 欧美日韩亚洲国产一区二区在线观看 | 51午夜福利影视在线观看| 十八禁网站网址无遮挡| 国产精品二区激情视频| 99精品欧美一区二区三区四区| 亚洲成av片中文字幕在线观看| av视频免费观看在线观看| 国产精品久久久人人做人人爽| 男人添女人高潮全过程视频| 国产精品久久久av美女十八| 国产一区有黄有色的免费视频| 在线观看一区二区三区激情| 日韩欧美一区视频在线观看| 考比视频在线观看| 久久久精品免费免费高清| videos熟女内射| 极品少妇高潮喷水抽搐| 国产深夜福利视频在线观看| 成人av一区二区三区在线看 | 啪啪无遮挡十八禁网站| 久久人妻福利社区极品人妻图片| 俄罗斯特黄特色一大片| 黄频高清免费视频| 日本a在线网址| 久久99一区二区三区| 国产免费福利视频在线观看| 最近最新中文字幕大全免费视频| 交换朋友夫妻互换小说| 国产精品久久久久久人妻精品电影 | 欧美 日韩 精品 国产| 狠狠精品人妻久久久久久综合| av在线app专区| 精品亚洲成a人片在线观看| 女人高潮潮喷娇喘18禁视频| 男人添女人高潮全过程视频| 青春草视频在线免费观看| 国产又爽黄色视频| 80岁老熟妇乱子伦牲交| 日韩欧美一区视频在线观看| 国产精品香港三级国产av潘金莲| 欧美黑人欧美精品刺激| 视频区欧美日本亚洲| 人人妻人人澡人人爽人人夜夜| 亚洲中文av在线| 99精国产麻豆久久婷婷| 亚洲九九香蕉| 日本a在线网址| 久久免费观看电影| 91国产中文字幕| tocl精华| 制服诱惑二区| bbb黄色大片| 国产97色在线日韩免费| 亚洲avbb在线观看| 男女高潮啪啪啪动态图| 欧美久久黑人一区二区| 日日夜夜操网爽| 搡老熟女国产l中国老女人| 91九色精品人成在线观看| 久久精品国产综合久久久| 日韩免费高清中文字幕av| 国产成+人综合+亚洲专区| 日韩 亚洲 欧美在线| 欧美成人午夜精品| 中文字幕制服av| 国产野战对白在线观看| 欧美黑人精品巨大| 日韩欧美一区二区三区在线观看 | 男女之事视频高清在线观看| 久久99一区二区三区| 国产黄色免费在线视频| 国产av又大| 亚洲国产av新网站| 99久久精品国产亚洲精品| e午夜精品久久久久久久| 日本猛色少妇xxxxx猛交久久| av国产精品久久久久影院| 国产成+人综合+亚洲专区| 97人妻天天添夜夜摸| 狂野欧美激情性bbbbbb| 亚洲精品中文字幕在线视频| 黑人巨大精品欧美一区二区蜜桃| 国产一区有黄有色的免费视频| 国产一卡二卡三卡精品| 女人久久www免费人成看片| 亚洲精品中文字幕一二三四区 | 亚洲激情五月婷婷啪啪| 国产av又大| 午夜激情久久久久久久| 久久热在线av| 丝袜美足系列| 国产视频一区二区在线看| 99久久人妻综合| 80岁老熟妇乱子伦牲交| 免费高清在线观看日韩| 国产成人精品久久二区二区91| 汤姆久久久久久久影院中文字幕| 久久久国产成人免费| 老司机午夜福利在线观看视频 | 日韩人妻精品一区2区三区| 国产熟女午夜一区二区三区| 在线av久久热| 两个人看的免费小视频| 99久久99久久久精品蜜桃| 每晚都被弄得嗷嗷叫到高潮| 人人妻,人人澡人人爽秒播| 一区二区日韩欧美中文字幕| 性高湖久久久久久久久免费观看| 高清黄色对白视频在线免费看| 久久九九热精品免费| 爱豆传媒免费全集在线观看| 天堂8中文在线网| av电影中文网址| 999精品在线视频| 久热这里只有精品99| 国产亚洲欧美在线一区二区| 69av精品久久久久久 | 黄色片一级片一级黄色片| 午夜久久久在线观看| 黄色怎么调成土黄色| 精品卡一卡二卡四卡免费| 精品少妇一区二区三区视频日本电影| 女人高潮潮喷娇喘18禁视频| 日本精品一区二区三区蜜桃| 亚洲av欧美aⅴ国产| 99香蕉大伊视频| 亚洲精品国产一区二区精华液| 涩涩av久久男人的天堂| 亚洲精品一区蜜桃| 久久久欧美国产精品| videosex国产| 啪啪无遮挡十八禁网站| 69精品国产乱码久久久| 国产精品免费大片| 精品卡一卡二卡四卡免费| 在线观看www视频免费| 国产亚洲精品第一综合不卡| 另类亚洲欧美激情| 中文字幕另类日韩欧美亚洲嫩草| 啦啦啦免费观看视频1| 日韩 亚洲 欧美在线| 自拍欧美九色日韩亚洲蝌蚪91| 国产亚洲精品第一综合不卡| 人妻 亚洲 视频| 久热这里只有精品99| 一边摸一边抽搐一进一出视频| 精品熟女少妇八av免费久了| 国产熟女午夜一区二区三区| 成年人黄色毛片网站| 亚洲国产av影院在线观看| 人妻久久中文字幕网| 黄色怎么调成土黄色| 久久精品亚洲熟妇少妇任你| 婷婷成人精品国产| 午夜影院在线不卡| kizo精华| 肉色欧美久久久久久久蜜桃| 亚洲精品久久久久久婷婷小说| 国产麻豆69| 制服人妻中文乱码| 在线十欧美十亚洲十日本专区| 少妇 在线观看| 波多野结衣av一区二区av| 1024香蕉在线观看| 成人免费观看视频高清| 电影成人av| 性少妇av在线| 人人妻人人添人人爽欧美一区卜| a级毛片黄视频| 999久久久国产精品视频| 国产91精品成人一区二区三区 | 欧美激情 高清一区二区三区| 日韩视频一区二区在线观看| 免费高清在线观看视频在线观看| 一区二区av电影网| 黑人欧美特级aaaaaa片| 亚洲中文日韩欧美视频| 黑人巨大精品欧美一区二区mp4| 伊人久久大香线蕉亚洲五| 亚洲第一青青草原| 天堂中文最新版在线下载| 欧美人与性动交α欧美精品济南到| 国产精品亚洲av一区麻豆| 丰满迷人的少妇在线观看| 亚洲自偷自拍图片 自拍| 亚洲精品中文字幕在线视频| 国产成人系列免费观看| 亚洲精品国产精品久久久不卡| 亚洲激情五月婷婷啪啪| 国产男人的电影天堂91| 精品国内亚洲2022精品成人 | 免费黄频网站在线观看国产| 一区福利在线观看| 久久久国产精品麻豆| 大香蕉久久成人网| 亚洲av男天堂| 国产免费视频播放在线视频| 建设人人有责人人尽责人人享有的| 国产xxxxx性猛交| 免费观看av网站的网址| bbb黄色大片| 国产精品一区二区免费欧美 | 免费高清在线观看日韩| 成人黄色视频免费在线看| 中文字幕最新亚洲高清| 九色亚洲精品在线播放| 国产在线观看jvid| 大陆偷拍与自拍| 三级毛片av免费| 我的亚洲天堂| 欧美成人午夜精品| kizo精华| 亚洲一区二区三区欧美精品| 亚洲国产欧美在线一区| 一本久久精品| 成年av动漫网址| 19禁男女啪啪无遮挡网站| 丝袜人妻中文字幕| 免费久久久久久久精品成人欧美视频| 精品卡一卡二卡四卡免费| 成人av一区二区三区在线看 | 欧美另类亚洲清纯唯美| 在线十欧美十亚洲十日本专区| 国产深夜福利视频在线观看| 十八禁网站网址无遮挡| 亚洲人成电影观看| 男女国产视频网站| 久久精品亚洲熟妇少妇任你| 涩涩av久久男人的天堂| 国产在线免费精品| 国产精品成人在线| 亚洲国产精品一区三区| 亚洲精品一卡2卡三卡4卡5卡 | 亚洲av日韩在线播放| 午夜老司机福利片| 国精品久久久久久国模美| 性色av一级| 91麻豆精品激情在线观看国产 | 免费人妻精品一区二区三区视频| 老司机午夜福利在线观看视频 | 一本色道久久久久久精品综合| 丝袜美足系列| 亚洲av成人不卡在线观看播放网 | 亚洲欧美日韩高清在线视频 | 韩国高清视频一区二区三区| 考比视频在线观看| 美女大奶头黄色视频| 国产区一区二久久| 国产亚洲精品一区二区www | 老司机午夜福利在线观看视频 | 十八禁人妻一区二区| 菩萨蛮人人尽说江南好唐韦庄| 日本av手机在线免费观看| 国产精品久久久久久精品古装| 免费在线观看完整版高清| 这个男人来自地球电影免费观看| 午夜久久久在线观看| 丝袜脚勾引网站| 国产又色又爽无遮挡免| 久久久久国内视频| 久久影院123| 亚洲欧美激情在线| 亚洲精品一二三| 久久久久国内视频| 欧美中文综合在线视频| 成年人午夜在线观看视频| 999久久久国产精品视频| 国产三级黄色录像| av福利片在线| 午夜免费鲁丝| 纯流量卡能插随身wifi吗| 亚洲中文av在线| 国产麻豆69| 啦啦啦视频在线资源免费观看| 日韩制服丝袜自拍偷拍| av有码第一页| 日韩制服骚丝袜av| 少妇猛男粗大的猛烈进出视频| 欧美日韩黄片免| 日本精品一区二区三区蜜桃| 中文欧美无线码| 亚洲情色 制服丝袜| 久久人人爽人人片av| 亚洲视频免费观看视频| 波多野结衣一区麻豆| 久久综合国产亚洲精品| 动漫黄色视频在线观看| 久久av网站| 亚洲一卡2卡3卡4卡5卡精品中文| 久久人人爽av亚洲精品天堂| 美女视频免费永久观看网站| 亚洲精品粉嫩美女一区| 亚洲国产av影院在线观看| 成年人午夜在线观看视频| 国产精品国产av在线观看| 亚洲av欧美aⅴ国产| 午夜成年电影在线免费观看| 国产日韩欧美视频二区| 欧美黄色片欧美黄色片| 欧美日韩成人在线一区二区| 久久久久久久久免费视频了| 18禁观看日本| 久久人妻熟女aⅴ| 欧美少妇被猛烈插入视频| 手机成人av网站| 亚洲,欧美精品.| 老司机午夜十八禁免费视频| 又黄又粗又硬又大视频| 巨乳人妻的诱惑在线观看| 国产黄色免费在线视频| 两个人看的免费小视频| 久久久久久人人人人人| 国产精品九九99| 久久这里只有精品19| 日日爽夜夜爽网站| 一个人免费看片子| 日韩人妻精品一区2区三区| 国产成人av激情在线播放| 亚洲精品国产av蜜桃| 中文字幕人妻丝袜制服| 久久久国产一区二区| 超碰97精品在线观看| 90打野战视频偷拍视频| 久久久久视频综合| 亚洲欧美精品综合一区二区三区| 亚洲国产日韩一区二区| 日本一区二区免费在线视频| 日韩免费高清中文字幕av| 天天躁狠狠躁夜夜躁狠狠躁| 在线观看免费日韩欧美大片| 日本av手机在线免费观看| 男女午夜视频在线观看| 高清黄色对白视频在线免费看| 正在播放国产对白刺激| 老司机靠b影院| 免费观看人在逋| 黄片播放在线免费| 少妇粗大呻吟视频| 少妇裸体淫交视频免费看高清 | 精品亚洲乱码少妇综合久久| 99国产精品一区二区蜜桃av | 欧美日本中文国产一区发布| 三级毛片av免费| 欧美日韩av久久| 一二三四社区在线视频社区8| 欧美黄色淫秽网站| 亚洲精品中文字幕在线视频| 狠狠婷婷综合久久久久久88av| 亚洲欧洲日产国产| 亚洲 国产 在线| 中亚洲国语对白在线视频| 一级毛片精品| 亚洲精品国产av蜜桃| 男女免费视频国产| 国产99久久九九免费精品| 国产精品麻豆人妻色哟哟久久| 国产色视频综合| 咕卡用的链子| 亚洲男人天堂网一区| 夜夜夜夜夜久久久久| 又紧又爽又黄一区二区| 免费在线观看影片大全网站| 国产主播在线观看一区二区| 如日韩欧美国产精品一区二区三区| 热99国产精品久久久久久7| 亚洲精品美女久久久久99蜜臀| 精品久久蜜臀av无| 一二三四在线观看免费中文在| 啦啦啦 在线观看视频| 亚洲avbb在线观看| 男人舔女人的私密视频| 美女大奶头黄色视频| 午夜日韩欧美国产| 乱人伦中国视频| 男女下面插进去视频免费观看| 中文字幕av电影在线播放| av视频免费观看在线观看| 亚洲伊人久久精品综合| 国产精品1区2区在线观看. | 久久久久国产一级毛片高清牌| 欧美日韩黄片免| 男女下面插进去视频免费观看| 精品国产国语对白av| 热99久久久久精品小说推荐| 99精品久久久久人妻精品| 一级a爱视频在线免费观看| 久久精品人人爽人人爽视色| 国产片内射在线| 涩涩av久久男人的天堂| 一区二区三区精品91| 黄色毛片三级朝国网站| 狂野欧美激情性bbbbbb| 国产精品av久久久久免费| 91老司机精品| 美女中出高潮动态图| 亚洲熟女精品中文字幕| 男人爽女人下面视频在线观看| 在线天堂中文资源库| av一本久久久久| 欧美97在线视频| 久久精品久久久久久噜噜老黄| 久久久久国产精品人妻一区二区| 亚洲性夜色夜夜综合| 欧美大码av| 久久久国产欧美日韩av| 亚洲美女黄色视频免费看| 久久精品亚洲熟妇少妇任你| 日韩,欧美,国产一区二区三区| 亚洲精品国产一区二区精华液| 国产在线一区二区三区精| 视频在线观看一区二区三区| 日韩免费高清中文字幕av| 十八禁网站网址无遮挡| 欧美大码av| 成年av动漫网址| 超色免费av| 亚洲国产精品成人久久小说| 国产一区二区三区在线臀色熟女 | 日本猛色少妇xxxxx猛交久久| 午夜免费成人在线视频| 国产av又大| 国产日韩欧美视频二区| 国产成人精品久久二区二区91| 王馨瑶露胸无遮挡在线观看| 亚洲男人天堂网一区| 午夜久久久在线观看| 日本五十路高清| 久久久国产成人免费| 精品少妇一区二区三区视频日本电影| 亚洲欧美一区二区三区黑人| 日日摸夜夜添夜夜添小说| 黄片小视频在线播放| 国产激情久久老熟女| 波多野结衣av一区二区av| 欧美日韩福利视频一区二区| 亚洲欧美日韩另类电影网站| 人成视频在线观看免费观看| 亚洲色图综合在线观看| 1024香蕉在线观看| 一级片'在线观看视频| 99国产极品粉嫩在线观看| 亚洲熟女精品中文字幕| 国产日韩欧美视频二区| 久久天躁狠狠躁夜夜2o2o| 成年人午夜在线观看视频| 最近中文字幕2019免费版| 亚洲精品久久午夜乱码| 亚洲成人国产一区在线观看| 高清av免费在线| 少妇精品久久久久久久| 人人妻人人澡人人看| 欧美亚洲日本最大视频资源| 嫁个100分男人电影在线观看| 欧美日韩av久久| 满18在线观看网站| 国产成+人综合+亚洲专区| 亚洲av电影在线进入| 国产av国产精品国产| 亚洲久久久国产精品| 正在播放国产对白刺激| 美女午夜性视频免费| 亚洲第一欧美日韩一区二区三区 | 美国免费a级毛片| 亚洲av日韩精品久久久久久密| 久久青草综合色| 80岁老熟妇乱子伦牲交| 亚洲avbb在线观看| 日韩 欧美 亚洲 中文字幕| 少妇的丰满在线观看| 日本91视频免费播放| 桃花免费在线播放| 老熟女久久久| 黄色片一级片一级黄色片| 免费在线观看影片大全网站| 免费人妻精品一区二区三区视频| 狂野欧美激情性bbbbbb| 狠狠狠狠99中文字幕| 高清欧美精品videossex| 久久久国产精品麻豆| 亚洲精品av麻豆狂野| 亚洲国产日韩一区二区| 亚洲欧美日韩高清在线视频 | 亚洲精品美女久久久久99蜜臀| 国产高清videossex| 日韩欧美一区视频在线观看| 首页视频小说图片口味搜索| 少妇精品久久久久久久| 国产成人欧美在线观看 | 多毛熟女@视频| 国产精品久久久人人做人人爽| 欧美另类亚洲清纯唯美| 午夜免费观看性视频| 老司机福利观看| 精品国产一区二区三区四区第35| 亚洲国产欧美在线一区| 丝袜喷水一区| e午夜精品久久久久久久| 波多野结衣av一区二区av| 两人在一起打扑克的视频| 涩涩av久久男人的天堂| 亚洲精品乱久久久久久| 亚洲欧美色中文字幕在线| 老司机午夜福利在线观看视频 | 国产老妇伦熟女老妇高清| 欧美在线一区亚洲| 欧美激情久久久久久爽电影 | 18禁观看日本| 国产极品粉嫩免费观看在线| 亚洲 国产 在线| 亚洲国产av新网站| 国产在线一区二区三区精| 两人在一起打扑克的视频| 丁香六月天网| av又黄又爽大尺度在线免费看| 日韩精品免费视频一区二区三区| 亚洲国产中文字幕在线视频| 久热这里只有精品99| 男女高潮啪啪啪动态图| 一区福利在线观看| 伦理电影免费视频| 亚洲成av片中文字幕在线观看| av国产精品久久久久影院| 国产亚洲欧美在线一区二区| 亚洲国产欧美网| 日韩欧美免费精品| 人妻人人澡人人爽人人| 亚洲欧美一区二区三区黑人| 欧美日韩精品网址| 久久性视频一级片| 久久久久久久大尺度免费视频| 热99re8久久精品国产| 久久精品国产a三级三级三级| 日本vs欧美在线观看视频| 成年av动漫网址| 黄色片一级片一级黄色片| 91成人精品电影| 777米奇影视久久| 国产精品久久久av美女十八| 成人国产av品久久久| 亚洲一区中文字幕在线| 亚洲激情五月婷婷啪啪| 久久久久久免费高清国产稀缺| 99热国产这里只有精品6| 极品少妇高潮喷水抽搐| 人妻久久中文字幕网| 国产主播在线观看一区二区| 成人影院久久| 国产在线视频一区二区| 99国产精品99久久久久| 99精国产麻豆久久婷婷| 一本综合久久免费| 欧美精品一区二区大全| 亚洲精品第二区| 久久久国产成人免费| 亚洲精品一区蜜桃| 成年女人毛片免费观看观看9 | 国产欧美日韩一区二区精品| 伊人久久大香线蕉亚洲五| 国产成人欧美在线观看 | 亚洲成人手机| 国产成人精品久久二区二区91| 日韩一区二区三区影片| 欧美日韩一级在线毛片| 无遮挡黄片免费观看| svipshipincom国产片| 亚洲男人天堂网一区| 2018国产大陆天天弄谢| 黄片小视频在线播放|