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

    Throughput scheduling in cognitive radio networksbased on immune optimization

    2015-03-01 09:21:56ChaiZhengyiZhengBaolinShenLianfengZhuSifeng

    Chai Zhengyi  Zheng Baolin  Shen Lianfeng  Zhu Sifeng

    (1National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China)(2School of Computer Science and Software Engineering, Tianjin Polytechnic University, Tianjin 300384, China)(3Department of Information Engineering, Henan Vocational and Technical College, Zhengzhou 450046, China)

    ?

    Throughput scheduling in cognitive radio networksbased on immune optimization

    Chai Zhengyi1,2Zheng Baolin3Shen Lianfeng1Zhu Sifeng1

    (1National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China)(2School of Computer Science and Software Engineering, Tianjin Polytechnic University, Tianjin 300384, China)(3Department of Information Engineering, Henan Vocational and Technical College, Zhengzhou 450046, China)

    Abstract:To study the throughput scheduling problem under interference temperature in cognitive radio networks, an immune algorithm-based suboptimal method was proposed based on its NP-hard feature. The problem is modeled as a constrained optimization problem to maximize the total throughput of the secondary users (SUs). The mapping between the throughput scheduling problems and the immune algorithm is given. Suitable immune operators are designed such as binary antibody encoding, antibody initialization based on pre-knowledge, a proportional clone to its affinity and an adaptive mutation operator associated with the evolutionary generation. The simulation results show that the proposed algorithm can obtain about 95% of the optimal throughput and operate with much lower liner computational complexity.

    Key words:cognitive radio networks; throughput scheduling; immune algorithm; interference temperature

    Received 2015-04-20.

    Biography:Chai Zhengyi (1976—), male, doctor, associate professor,super_chai@126.com.

    Foundation items:The National Natural Science Foundation of China (No.U1504613, 61202099, 61201175, U1204618), China Postdoctoral Science Foundation (No.2013M541586).

    Citation:Chai Zhengyi, Zheng Baolin, Shen Lianfeng, et al. Throughput scheduling in cognitive radio networks based on immune optimization[J].Journal of Southeast University (English Edition),2015,31(4):431-436.[doi:10.3969/j.issn.1003-7985.2015.04.001]

    The increasing growth in wireless communication demands has intensified the shortage crisis for the radio spectrum, while a significant amount of the licensed spectrum is not currently being utilized[1]. The spectrum is far more underutilized rather than naturally scarce. A cognitive radio network (CRN) is a kind of intelligent communication system, which enables the devices to opportunistically access the licensed spectrum, and thereby enhance the utilization of the existing spectrum resources[2-3]. The nodes in a cognitive radio network can be classified into primary users (PUs) and secondary users (SUs). A PU is a licensed user that has exclusive rights to the access spectrum. A SU is an unlicensed user that can utilize the spectrum opportunistically with primary users under interference restriction.

    Throughput optimal scheduling for cognitive radio networks under interference temperature constraints is an open research issue[4]. The throughput scheduling determines how many packets and with which frequency each SU will transmit in each time slot[5]. The aim of it is to maximize the total throughput of the SUs in the cell. The throughput scheduler issue in conventional networks has been widely studied[6]. Nonetheless, the cognitive radio paradigm brings new challenges into the issue because of the coexistence of the PUs and the SUs. The throughput scheduling problem considered in this paper can be distinguished from these works by its cognitive radio specific nature. That is, not only the availability of different frequencies but also the maximum allowable transmission rate of the frequency bands are time-varying[5].

    Researchers have done some work with different scenarios. In Ref.[6], a throughput scheduling algorithm was proposed which does not enable the true coexistence of the PUs and the SUs. The authors in Ref.[7] figureted a distributed heuristic to determine the channels and time slots for the cognitive nodes. However, they do not consider the interference for the PUs either in their optimization figuretion or in their suboptimal heuristic. The interference temperature model provides the true coexistence data of its licensed and unlicensed users. The throughput optimization is a binary integer programming problem, so the figureted scheduling algorithms have a high computational complexity[3-7]. In Ref.[3], its optimal solution was obtained by the branch-and-bound algorithm with very high computational complexity. In Ref.[4], the authors focused on throughput scheduling under interference temperature constraints and figureted the throughput maximization problems. Then, the authors proposed suboptimal schedulers, referred to as maximum frequency selection (MFS) and probabilistic frequency selection (PFS), with low complexity at the expense of poor throughput performance. Hence, the design of better performing suboptimal scheduling with reasonable complexity is very meaningful.

    It is known that bio-inspired methods are ideal for such nonlinear optimization problems[8]. Some bio-inspired methods have been employed in conventional (non-cognitive) schedulers, such as the genetic algorithm[9]and particle swarm optimization[10]. In this paper, an improved immune algorithm is introduced to solve the throughput scheduling problem. The inspiration comes from the fact that the immune algorithm is ideal for nonlinear optimization problems with a large feasible solution space where a quick sub-optimal solution will suffice. Also, to the best of our knowledge, the use of the immune algorithm for scheduling in cognitive radio networks has not previously been explored.

    1System Model

    Consider a time-slotted IEEE 802.22 system in which the SUs are controlled and guided by the cognitive base station (CBS)[4-5]. The scheduler is at the CBS. Assume that the interference temperature perceived by the PUs is within the interference temperature limits; reliable communication between the CBS and the SUs is achieved; and collisions among the SUs are avoided[4]. Each SUncalculates every frequencyf, and the value is denoted asUnf, which is the maximum number of packets that it can transmit for frequencyfin a time slot. The calculation procedure forUnfvalues guarantees that the interference temperature perceived by the PUs is within the predetermined limits. The CBS then constitutes a matrix called U=[Unf].

    The throughput optimal schedule can be formatted as

    (1)

    (1a)

    Xnft+Xn′ft≤1?n,n′∈1,2,…,N;n≠n′; ?f,?t

    (1b)

    whereN,F,Tare the total number of SUs, frequencies, time slots, respectively;Xnftis a binary variable such thatXnft=1 if userntransmits with frequencyfin time slottand 0 otherwise. Constraint (1a) guarantees that at least one time slot is assigned to each SU, whereas constraint (1b) makes certain that at most one user can transmit at a particular time slot and frequency combination, and consequently preventing collisions among the cognitive nodes. Moreover, the schedule lengthTis the time period in which the spectral and networking environment changes slowly enough so that theXnftvalues are not affected. For example, the TV bands used by an IEEE 802.22 network constitute a slowly altering spectral environment, and hence enableTto be large enough[4].

    2Proposed Algorithm

    2.1 Overview of immune optimization algorithm

    The artificial immune system (AIS) is inspired by the human immune system. The AIS-based algorithms typically extract ideas from the human immune system’s characteristics of learning and adaptability to solve some complicated problems[10]. Most immune system inspired optimization algorithms are based on the clone selection principle. Clone selection is a dynamic simulation process of the immune system that is self-adaptive against antigens. The clone selection algorithm for optimization has been widely used in engineering-oriented fields, such as spectrum allocation[11], job scheduling[12], and image segmentation[13]and so on. These algorithms essentially evolve solutions to problems via the repetition of a clone, affinity maturation (via mutation) and a selection cycle for a candidate solutions population, and remaining good solutions in the population[10-12].

    Some related terms are described briefly as follows:

    1) Antigen. An antigen represents one sample in the solution space of the problem. In this paper, antigen refers to the throughput schedule problem to be solved and the total constraints.

    2) Antibody. An antibody represents a candidate solution to the problem in this paper.

    3) Antibody population. The complete antibodies consist of antibody population.

    4) Affinity. Affinity is the fitness measurement for an antibody, which indicates the extent that the antigen satisfies the problem requirements.

    5) Clone. In immunology, cloning means asexual propagation so that a group of identical cells can be descended from a single common ancestor. It is used to enlarge the search region.

    6) Mutation. In immunology, mutation means the immune system recognizes external patterns from antibody gene mutation in order to obtain a higher affinity. Mutations take the search procedure out of a locally optimal region, and enable it to possibly enter a better region of the search space.

    7) Selection. An immune algorithm takes a group of antigens from a population using an operation called selection. The selection operation serves the purpose of eliminating the relatively bad solution candidates and focusing the search operation on a relatively good portion of the solution space.

    2.2 Realization of throughput scheduling based on the immune algorithm

    Our motivations for utilizing the immune algorithm for the throughput optimal scheduling problems are manifold. First, the immune algorithm is suitable for problems with large search spaces. It is equipped with many tools to reduce the computational complexity and produce a diverse set of solutions. The fact that the immune algorithm operates on a population of solutions rather than a single solution implies that the algorithm makes parallel searches in the search space. Considering that the solution space in the throughput scheduling problems is enormous (even for 5 nodes, 3 frequencies, and 3 time slots, the size of the solution space is 245), the immune algorithm appears to be a suitable tool. Secondly, the immune algorithm can be conveniently implemented. The binary decision variablesXnftcan be easily encoded to a binary string.

    Some key techniques are as follows:

    1) Antigen representation (encoding). We use the binary encoded antigen which containsXnftvalues. Thus, the antigen [X111,X211,X311,X112,X212,…,X123,X223,X323], whereas the other antigen structure is [X111,X112,X113,X121,X122,…,X322,X323].Xnftis a gene bit of antibody.

    2) Affinity evaluation. In this paper, the optimization model is described in Eq.(1). The affinity is a mapping of the value of Eq.(1) for a given antibody. SinceQis to be maximized, it can be stated that if an antibody has higher affinity, it is the better one.

    The proposed algorithm for throughput optimal scheduling schemes is implemented as follows:

    Step 1Initialization. Set the maximum iterative generationtmax. Sett=0, wheretis termed as the current iterative generation. Create an initial antibody population A(t) with sizekin accordance with antibody encoding in section 3.2. That is

    A(t)={p1(t),p2(t),…,pk(t)}

    (2)

    where pi(1≤i≤k) is a candidate throughput scheduling scheme; A(t) is a set of candidate throughput scheduling schemes.

    Here, some pre-knowledge is used to initialize the antibody piin order to accelerate algorithm convergence, which is proved by the latter simulation experiments. From constraint (1a), it is known that at least one time slot is assigned to each SU. Constraint (1b) makes certain that at most, one user can transmit at a particular time slot and frequency combination. Each antibody pi(1≤i≤k) that satisfies the constraints (1a) and (1b) will be a candidate.

    Step 2Affinity evaluation. The affinities of all antibodies in A(t) are calculated according to Eq.(1) and it is denoted as

    f(A(t))={f(p1(t),f(p2(t)),…,f(pk(t)}

    (3)

    If an antibody pi(t) (1

    Step 3Proportional cloneTc. In this paper, B(t) is obtained by applying clone proliferationTcto A(t), and it is defined as

    B(t)=Tc(A(t))={Tc(p1(t)),Tc(p2(t)),…,Tc(pk(t))}

    (4)

    Here, the clone scaleqifor each antibody pi(1≤i≤k) is proportional to its affinityf(pi(t)). That is

    (5)

    where Int() denotes the integer function, andncis a given value (nc>k). The antibody with a large affinity value (objective function value of Eq.(1)) has a largeqi.

    (6)

    Actually, clone proliferation on antibody pi(t) is to make multiple identical copies of it.

    Step 4MutationTm. In this paper, it is defined as C(t)=Tm(B(t)). An adaptive mutation which associates the mutation probabilitympwith the evolutionary generation is designed. That is

    (7)

    wheretis the current evolutionary generation;tmaxis the maximum evolutionary generation.

    The advantages of the mutation lie in its searching ability within a large scope in the early evolution process while it searches in a local scope in the latter evolution process, which can accelerate the convergence. After mutation, the population becomes

    C(t)={p″1(t),p″2(t),…,p″z(t)}

    (8)

    In this paper, the mutation is done by exchanging the element one and element zero with each other with probabilitymp. The proposed mutation is easily realized and it does not violate the constraints.

    Step 5Affinity evaluation. The affinities of all antibodies in C(t) are calculated according to Eq.(1) and it is defined as

    f(C(t))={f(p″1(t),f(p″2(t)),…,f(p″z(t)}

    (9)

    Step 6Clone selectionTsis defined as

    A(t+1)=Ts(C(t)∪A(t)=

    (p1(t+1),p2(t+1),…,pk(t+1))

    (10)

    That is,kantibodies with a high affinity are selected from C(t) and A(t) to form the next population A(t+1).

    Step 7Termination test. Iftmaxis reached, stop the algorithm. Output the antibody with the maximum affinity in A(t+1) as the result of the throughout scheme. Otherwise,t=t+1, and go to Step 3.

    2.3 Computational complexity

    Recall thatNdenotes the number of SU, andFdenotes the number of available frequencies. For the immune-based scheme, the total computational complexity is mainly composed of that for initialization, affinity evaluation, cloning, mutation, and selection. Given the population sizek, the clone scalenc(nc>k) and the maximum generationtmax, the procedure of population initialization, the affinity evaluation and proportional clone (Step 1 to Step 3) has the same computational complexity ofO(kFN) in each generation, while the procedure of mutation, affinity evaluation, selection (Step 4 to Step 6) has the computational complexity ofO(kncFN) in each generation. Hence, for each generation, the total computational complexity isO(3kFN+3kncFN). Sincenc>k, according to the properties of symbolicO[10,13-14], it can be denoted asO(ncFN). When the throughout scheduling is finished, it has the total computational complexity ofO(tmaxncFN).

    The computer simulations show thattmaximplicitly depends onFandN. The more complex the search space is, the larger the number of generations should be. Thus, for givenncandtmax, the gradual computational complexity of the proposed algorithm isO(NF) in accordance with the properties of symbolicO.

    A brief summary of the complexities of previous typical algorithms and our proposed algorithm is as follows. The complexity of algorithm in Ref.[3] isO(FN2), while the complexity of our proposed algorithm is the same as the algorithm in Ref.[4], which isO(FN).

    3Simulation Results and Discussion

    3.1 Experimental environments and parameter settings

    We simulated the suboptimal schedulers and acquired theUnfvalues in OPNET Modeler, and we solved the optimization problems in CPLEX[15]. Additive white Gaussian noise (AWGN) channels are considered. In all the simulations, each SU has three primary neighbors in its interference range. The simulation results are the average of 100 independent tests. The parameter settings are as the same as that in Refs.[4-5]. There are three frequencies with interference temperature thresholds of 1 000, 2 000, and 3 000 K.

    3.2 Sensitivity in relation to the immune algorithm parameters

    Four parameters are to be set at the initialization phase: the antibody population sizek, the clone population sizenc, the mutation probabilitymp, and the maximum number of generationstmax. The sequential experimental design method of employing a series of small experiments each with a specific objective is a common method in experimental design[16], because the experimenter can quickly learn crucial information from a small group of runs that can be used to plan the next experiment.kandncdirectly affect the computational complexity of the algorithm[10-13]. If the givenkandncare large enough, the diversity of the population can be enhanced and the prematurity can be avoided in some extent, but the computational complexity will also be very large.tmaxclearly depends onFandN. The more complex the search space is, the larger the number of generations should be.mpis very important for local search in the algorithm. A largemphas the ability to produce more new antibodies, but it also has the probability to destroy some good antibodies. Whenmpis too small, the convergence speed is not quick enough to find the best solution in appointed generations.

    Since the optimal choice is difficult to determine by theoretical analysis, it is important to analyze the performance affected by experiments in different cases. After trial and error, the parameters employed in the proposed immune algorithm are as follows: the number of generationstmaxis 100; the population sizekis 50; the clone scalencis 10; and the mutation probabilitympis 0.3.

    3.3 The performances of the proposed algorithm

    In order to evaluate the performances of the proposed algorithm, the effect of number of iterations (evolutionary generation) on throughout scheduling is studied, and the number of SUs is set to be 5. As it is evident from Fig.1, the throughout initially increases with the number of evolutionary generations and then gradually converges to the high value, close to an optimal point. It is also can be seen that the proposed method provides significant gain in throughout and fast convergence rate. The simulation results prove the effectiveness of the proposed immune operators. It also can be seen from Fig.2 that the evolutionary generation increases with the numbers of SUs. It is effective.

    The results of different numbers of SUs are shown in Tab.1. It can be seen that the proposed algorithm gives consistent good results. First of all, the proposed solution yields better results than the MFS and PFS schedulers proposed in Ref.[4], at the same time being very close to the throughput optimal scheduler performance in Ref.[3].

    Fig.1 Throughout vs. evolutionary generation

    Fig.2 Evolutionary generation vs. different numbers of SUs

    Tab.1 The results of relative algorithms for different numbers of SUs

    Fig.3 presents the optimal throughput[3], MFS, and PFS[4]scheduling schemes compared with the proposed scheduling scheme. The algorithm in Ref.[3] can be regarded as the upper-bound of the proposed heuristic algorithm.

    Fig.3 Comparison of different algorithms

    Fig.4 shows the performances comparisons of relative algorithms with the increase in the numbers of SUs. It can be seen that the proposed algorithm performs excellently. It is very close to the optimal performances in Ref.[3] and is better than the algorithm in Ref.[4].

    All in all, the proposed scheduling scheme achieves performances close to the optimal scheduling operating with much lower complexity. However, the iterations in the simulation results reveal that the proposed algorithm is computationally more costly than the MFS and the PFS schedulers in Ref.[4]. Nevertheless, when they are compared with the throughput performance, we can see that the proposed algorithm is approximately twice as good as the MFS and the PFS schedulers. Moreover, the proposed algorithm is computationally more efficient than the classical branch and bound algorithms that are used to solve binary integer programming problems. Therefore, ther proposed algorithm presents a very reasonable tradeoff between computational complexity and performance.

    Fig.4 Throughout vs. numbers of SUs

    4Conclusion

    The immune algorithm-based suboptimal scheduling for the throughput problem in cognitive radio networks is proposed. The simulation results show that the proposed algorithm is very close to optimal performance with a relatively lower complexity. Hence, it can be concluded that the proposed scheduling is more suitable for slowly varying spectral environments. Considering that IEEE 802.22 networks that operate on the TV broadcast bands that are slowly changing, it can be confidently concluded that the proposed algorithm can operate in realistic network settings, and provide useful solutions for the open research problem.

    References

    [1]Akyildiz I, Lee W, Vuran M, et al. Next generation/dynamic spectrum access/cognitive radio wireless networks[J].ASurveyComputerNetworks, 2006, 50(13): 2127-2159.

    [2]Busson A, Jabbari B, Babaei A, et al. Large overlaid cognitive radio networks: from throughput scaling to asymptotic multiplexing gain[J].JournalofCommunicationsandNetworks, 2014, 16(1): 67-80.

    [3]Tian Z, Leus G, Lottici V. Joint dynamic resource allocation and waveform adaptation for cognitive networks[J].IEEEJournalonSelectedAreasinCommunications, 2011, 29(2): 443-454.

    [4]G?züpek D, Alag?z F. Throughput and delay optimal scheduling in cognitive radio networks under interference temperature constraints[J].JournalofCommunicationsandNetworks, 2009, 11(2): 147-155.

    [5]Arshad K, Mackenzie R, Celentano U, et al. Resource management for QoS support in cognitive radio networks[J].IEEECommunicationsMagazine, 2014, 52(3): 114-120.

    [6]Chaporkar P, Kar K, Luo X, et al. Throughput and fairness guarantees through maximal scheduling in wireless networks[J].IEEETransactionsonInformationTheory, 2008, 54(2): 572-594.

    [7]Chai Zhengyi, Liu Fang. A novel immune optimization algorithm for fairness resource allocation in cognitive wireless network[J].WirelessPersonalCommunications, 2013, 69(4): 1671-1687.

    [8]He A, Kyung K B,Newman T R, et al. A survey of artificial intelligence for cognitive radios[J].IEEETransactionsonVehicularTechnology, 2010, 59(4): 1578-1592.

    [9]Zhao Jun, Liu Quanli, Wang Wei, et al. A parallel immune algorithm for traveling salesman problem and its application on cold rolling scheduling[J].InformationSciences, 2011, 181(7): 1212-1223.

    [10]Chai Zhengyi, Liu Fang. On the use of immune clonal optimization for joint subcarrier and power allocation in OFDMA with proportional fairness rate[J].InternationalJournalofCommunicationSystems, 2013, 26(10): 1273-1287.

    [11]Luh G-C, Chueh C-H. A multi-modal immune algorithm for the job-shop scheduling problem[J].InformationSciences, 2009, 179(10): 1516-1532.

    [12]Yang Dongdong, Jiao Licheng, Gong Maoguo, et al. Artificial immune multi-objective SAR image segmentation with fused complementary features[J].InformationSciences, 2011, 181(13): 2797-2812.

    [13]Tarcisio F, Maciel M, Anja K. On the performance, complexity, and fairness of suboptimal resource allocation for multi-user MIMO-OFDMA Systems[J].IEEETransactionsonVehicularTechnology, 2010, 59(1): 406-421.

    [14] Banaei A, Georghiades C N, Cui S G. Maximum-minimum throughput for MIMO systems in cognitive radio networks[J].IEEETransactionsonWirelessCommunications, 2014, 13(6): 3042-3055.

    [15]Sadr S, Anpalagan A, Raahemifar K. Radio resource allocation algorithms for the downlink of multiuser OFDM communication systems[J].IEEECommunicationsSurveys&Tutorials, 2009, 11(3): 92-106.

    doi:10.3969/j.issn.1003-7985.2015.04.001

    久久久久久久久久久久大奶| 欧美国产精品va在线观看不卡| 久久国产精品影院| 中国美女看黄片| 日本猛色少妇xxxxx猛交久久| 国产午夜精品一二区理论片| 精品人妻在线不人妻| 少妇被粗大的猛进出69影院| 尾随美女入室| 深夜精品福利| 十八禁网站网址无遮挡| 天天添夜夜摸| 男女下面插进去视频免费观看| 18在线观看网站| 在线观看免费午夜福利视频| 各种免费的搞黄视频| www.熟女人妻精品国产| 亚洲精品成人av观看孕妇| 欧美97在线视频| 国产精品av久久久久免费| 又大又黄又爽视频免费| 中文字幕高清在线视频| 精品人妻1区二区| 亚洲中文av在线| 国产熟女午夜一区二区三区| 丰满迷人的少妇在线观看| 少妇 在线观看| h视频一区二区三区| 亚洲欧美精品自产自拍| 男女边吃奶边做爰视频| 亚洲中文字幕日韩| 欧美日本中文国产一区发布| 黄色片一级片一级黄色片| 亚洲色图综合在线观看| 国产一级毛片在线| 亚洲中文av在线| 在线观看免费午夜福利视频| 一级毛片我不卡| 精品亚洲乱码少妇综合久久| 大话2 男鬼变身卡| 多毛熟女@视频| 777久久人妻少妇嫩草av网站| 美女中出高潮动态图| 免费观看人在逋| 亚洲av男天堂| 精品国产国语对白av| 亚洲av成人不卡在线观看播放网 | 纯流量卡能插随身wifi吗| 国产欧美日韩综合在线一区二区| 免费高清在线观看视频在线观看| 久久性视频一级片| 久9热在线精品视频| 十分钟在线观看高清视频www| 国产亚洲欧美精品永久| 一级毛片女人18水好多 | 免费看不卡的av| 久久精品人人爽人人爽视色| 老鸭窝网址在线观看| 又大又黄又爽视频免费| 午夜久久久在线观看| 91精品国产国语对白视频| 国精品久久久久久国模美| 悠悠久久av| 国产欧美亚洲国产| e午夜精品久久久久久久| 王馨瑶露胸无遮挡在线观看| 免费少妇av软件| 成年美女黄网站色视频大全免费| 免费av中文字幕在线| 亚洲欧美精品综合一区二区三区| 国产精品国产av在线观看| 日韩av在线免费看完整版不卡| 欧美国产精品一级二级三级| 欧美成人午夜精品| 国产在线免费精品| 国产精品一国产av| 成人三级做爰电影| 亚洲第一av免费看| 成年av动漫网址| 999精品在线视频| 丰满饥渴人妻一区二区三| 亚洲专区中文字幕在线| 中文字幕制服av| 十八禁高潮呻吟视频| 国产又色又爽无遮挡免| 亚洲av电影在线进入| 亚洲av国产av综合av卡| 操美女的视频在线观看| 青春草亚洲视频在线观看| 亚洲欧美一区二区三区久久| 精品国产超薄肉色丝袜足j| 在线观看人妻少妇| 高清视频免费观看一区二区| 国产免费福利视频在线观看| 久久精品久久久久久噜噜老黄| 国产片内射在线| 亚洲精品一卡2卡三卡4卡5卡 | 国产真人三级小视频在线观看| 国产精品久久久久久人妻精品电影 | 精品视频人人做人人爽| 香蕉国产在线看| 亚洲,一卡二卡三卡| 国产深夜福利视频在线观看| 亚洲黑人精品在线| 欧美精品av麻豆av| 伊人久久大香线蕉亚洲五| 午夜福利在线免费观看网站| 一边亲一边摸免费视频| 亚洲成人免费电影在线观看 | 中文字幕av电影在线播放| 亚洲av成人不卡在线观看播放网 | 婷婷丁香在线五月| 又紧又爽又黄一区二区| 国产午夜精品一二区理论片| 午夜老司机福利片| 97人妻天天添夜夜摸| 国产91精品成人一区二区三区 | 精品一区在线观看国产| 熟女少妇亚洲综合色aaa.| 丰满人妻熟妇乱又伦精品不卡| 最近手机中文字幕大全| 欧美日韩黄片免| 在线观看免费视频网站a站| 精品久久久久久久毛片微露脸 | 人人妻人人澡人人爽人人夜夜| 嫁个100分男人电影在线观看 | 青春草视频在线免费观看| 国产精品一区二区在线观看99| 久久精品成人免费网站| 熟女少妇亚洲综合色aaa.| 美女国产高潮福利片在线看| 国产欧美日韩精品亚洲av| 精品熟女少妇八av免费久了| 久久久久网色| 日本黄色日本黄色录像| 午夜激情久久久久久久| 久久精品久久久久久久性| 黄色一级大片看看| 大片电影免费在线观看免费| 少妇粗大呻吟视频| 男女免费视频国产| 国产视频首页在线观看| 涩涩av久久男人的天堂| 亚洲国产欧美一区二区综合| 啦啦啦视频在线资源免费观看| 精品亚洲成a人片在线观看| 国产成人精品无人区| 搡老乐熟女国产| 国产欧美日韩一区二区三区在线| cao死你这个sao货| 免费一级毛片在线播放高清视频 | av天堂在线播放| 日本a在线网址| 亚洲欧洲精品一区二区精品久久久| 欧美成人精品欧美一级黄| 国产av精品麻豆| 国产精品免费大片| 亚洲精品一区蜜桃| 国产成人影院久久av| 真人做人爱边吃奶动态| 日韩电影二区| 国产极品粉嫩免费观看在线| 2021少妇久久久久久久久久久| 成人午夜精彩视频在线观看| 99精品久久久久人妻精品| 女人爽到高潮嗷嗷叫在线视频| 午夜福利乱码中文字幕| 午夜老司机福利片| 午夜两性在线视频| 国产有黄有色有爽视频| 黑人欧美特级aaaaaa片| 国产精品麻豆人妻色哟哟久久| 麻豆av在线久日| 国产成人免费无遮挡视频| 国产一区有黄有色的免费视频| 免费看十八禁软件| 日韩免费高清中文字幕av| 亚洲视频免费观看视频| 在线av久久热| 蜜桃国产av成人99| 在线看a的网站| 人人妻人人添人人爽欧美一区卜| 免费少妇av软件| 欧美精品一区二区免费开放| 亚洲精品日本国产第一区| 亚洲国产精品999| 性少妇av在线| 侵犯人妻中文字幕一二三四区| 黄色一级大片看看| 激情五月婷婷亚洲| tube8黄色片| 日韩大码丰满熟妇| 亚洲精品日本国产第一区| 久久久久精品人妻al黑| 男女高潮啪啪啪动态图| 91成人精品电影| 久久精品成人免费网站| 免费在线观看视频国产中文字幕亚洲 | 一本一本久久a久久精品综合妖精| 久久久精品国产亚洲av高清涩受| 亚洲精品在线美女| 欧美精品一区二区大全| av电影中文网址| 欧美老熟妇乱子伦牲交| 日韩av免费高清视频| 悠悠久久av| 国产成人精品无人区| 免费在线观看日本一区| 1024香蕉在线观看| 91麻豆av在线| 精品人妻1区二区| 免费高清在线观看视频在线观看| a级毛片黄视频| 国产亚洲欧美在线一区二区| 久久久久久久久免费视频了| h视频一区二区三区| 人人妻人人澡人人看| 手机成人av网站| 亚洲av日韩精品久久久久久密 | 搡老岳熟女国产| 一区二区三区精品91| 一本综合久久免费| 人人妻人人爽人人添夜夜欢视频| 国产精品 欧美亚洲| 久久精品国产a三级三级三级| 伊人亚洲综合成人网| 真人做人爱边吃奶动态| 久久精品国产亚洲av涩爱| 欧美日韩亚洲国产一区二区在线观看 | 捣出白浆h1v1| 精品一区在线观看国产| 免费少妇av软件| 日韩伦理黄色片| 黄色视频在线播放观看不卡| 狠狠婷婷综合久久久久久88av| 黄色a级毛片大全视频| 日韩视频在线欧美| 国产成人91sexporn| 国产精品国产三级国产专区5o| 免费观看人在逋| 国产99久久九九免费精品| 成年动漫av网址| 精品一区二区三区四区五区乱码 | 人成视频在线观看免费观看| 午夜福利影视在线免费观看| 色94色欧美一区二区| 欧美大码av| 欧美精品高潮呻吟av久久| 欧美日韩视频精品一区| 一级黄片播放器| 久久人妻熟女aⅴ| 啦啦啦中文免费视频观看日本| avwww免费| 久久久精品国产亚洲av高清涩受| 少妇粗大呻吟视频| 欧美成狂野欧美在线观看| 中文乱码字字幕精品一区二区三区| 国产欧美亚洲国产| www.熟女人妻精品国产| 亚洲欧美清纯卡通| av天堂在线播放| 久久久精品免费免费高清| 欧美精品一区二区大全| 亚洲精品国产一区二区精华液| 丝袜脚勾引网站| 热99久久久久精品小说推荐| 在线观看免费日韩欧美大片| 久久青草综合色| 亚洲国产精品国产精品| 免费观看av网站的网址| 一边亲一边摸免费视频| 亚洲精品第二区| 国产一区二区三区综合在线观看| 国产麻豆69| 老司机影院成人| 赤兔流量卡办理| 日本色播在线视频| 在线观看免费高清a一片| av在线老鸭窝| 亚洲欧洲国产日韩| 飞空精品影院首页| 国产精品一国产av| 精品国产超薄肉色丝袜足j| 人成视频在线观看免费观看| 亚洲精品国产av成人精品| 午夜免费男女啪啪视频观看| 亚洲欧美精品自产自拍| 午夜免费观看性视频| 久久人妻熟女aⅴ| 高清av免费在线| 欧美日韩精品网址| 久久av网站| 又大又爽又粗| 校园人妻丝袜中文字幕| 日韩制服丝袜自拍偷拍| 久久人妻熟女aⅴ| 国产高清国产精品国产三级| 欧美成人精品欧美一级黄| 最近中文字幕2019免费版| 一边亲一边摸免费视频| 蜜桃国产av成人99| 精品国产一区二区三区久久久樱花| 日韩av免费高清视频| 国产精品久久久久久精品古装| 成在线人永久免费视频| 亚洲国产中文字幕在线视频| 午夜两性在线视频| 国产免费福利视频在线观看| 99九九在线精品视频| 成年人免费黄色播放视频| 中国国产av一级| 一区二区日韩欧美中文字幕| 午夜久久久在线观看| 天天影视国产精品| 中文字幕色久视频| 巨乳人妻的诱惑在线观看| 日本vs欧美在线观看视频| 狠狠精品人妻久久久久久综合| 在线观看免费日韩欧美大片| 啦啦啦啦在线视频资源| 亚洲色图 男人天堂 中文字幕| 国产亚洲av高清不卡| 男的添女的下面高潮视频| 久久精品亚洲熟妇少妇任你| 最近最新中文字幕大全免费视频 | 国产男女超爽视频在线观看| 大片免费播放器 马上看| 19禁男女啪啪无遮挡网站| 久久久久久久久免费视频了| 国产91精品成人一区二区三区 | 中文字幕色久视频| 在线观看一区二区三区激情| 成人国产av品久久久| 亚洲欧美清纯卡通| 天堂中文最新版在线下载| 一级毛片我不卡| 国产成人精品在线电影| 中文字幕av电影在线播放| 一二三四社区在线视频社区8| 国产高清videossex| 久久久精品免费免费高清| 日韩av免费高清视频| 男人添女人高潮全过程视频| 美女扒开内裤让男人捅视频| 国产精品香港三级国产av潘金莲 | 亚洲国产精品999| 欧美精品av麻豆av| 免费在线观看完整版高清| 久久午夜综合久久蜜桃| 人妻一区二区av| 久久ye,这里只有精品| 亚洲人成网站在线观看播放| 国产高清videossex| 国产午夜精品一二区理论片| 丰满迷人的少妇在线观看| 91麻豆精品激情在线观看国产 | 一区二区三区激情视频| 久久性视频一级片| 亚洲国产欧美日韩在线播放| 麻豆国产av国片精品| 欧美亚洲日本最大视频资源| 在线观看免费午夜福利视频| av线在线观看网站| 久9热在线精品视频| 亚洲欧美一区二区三区国产| 尾随美女入室| 亚洲精品久久成人aⅴ小说| 欧美日韩一级在线毛片| 王馨瑶露胸无遮挡在线观看| 亚洲精品美女久久久久99蜜臀 | 国产精品一二三区在线看| 久久人妻福利社区极品人妻图片 | 1024香蕉在线观看| 成人国语在线视频| 黄色 视频免费看| 色精品久久人妻99蜜桃| 9191精品国产免费久久| 高清视频免费观看一区二区| 久久久国产一区二区| 国产在线一区二区三区精| 亚洲黑人精品在线| av国产久精品久网站免费入址| 亚洲,欧美,日韩| 国产精品三级大全| 丝瓜视频免费看黄片| 18在线观看网站| 欧美国产精品va在线观看不卡| 久久鲁丝午夜福利片| svipshipincom国产片| 日本91视频免费播放| 国产熟女午夜一区二区三区| 国产精品国产三级国产专区5o| 亚洲七黄色美女视频| 亚洲中文日韩欧美视频| 欧美黑人欧美精品刺激| 国产精品人妻久久久影院| www.自偷自拍.com| 香蕉国产在线看| 一级黄片播放器| 精品福利永久在线观看| 亚洲国产最新在线播放| 成年人免费黄色播放视频| 欧美大码av| 久久狼人影院| 中文字幕人妻熟女乱码| 九色亚洲精品在线播放| 天堂中文最新版在线下载| 欧美日韩国产mv在线观看视频| 久久久国产精品麻豆| 脱女人内裤的视频| 亚洲第一av免费看| 只有这里有精品99| 老司机影院成人| 成在线人永久免费视频| 久久青草综合色| 亚洲av成人不卡在线观看播放网 | 熟女少妇亚洲综合色aaa.| 亚洲国产成人一精品久久久| 亚洲国产欧美一区二区综合| 女人爽到高潮嗷嗷叫在线视频| 亚洲久久久国产精品| 熟女少妇亚洲综合色aaa.| 老熟女久久久| 亚洲熟女精品中文字幕| 亚洲欧美精品综合一区二区三区| 看十八女毛片水多多多| 亚洲情色 制服丝袜| 亚洲国产看品久久| 色婷婷av一区二区三区视频| 蜜桃国产av成人99| 亚洲av国产av综合av卡| 男人爽女人下面视频在线观看| 色94色欧美一区二区| 国产99久久九九免费精品| 亚洲精品一二三| 国产激情久久老熟女| 国产日韩欧美亚洲二区| 熟女少妇亚洲综合色aaa.| 国产一卡二卡三卡精品| 91精品国产国语对白视频| 国产高清不卡午夜福利| 欧美日韩av久久| 一区二区三区精品91| 午夜精品国产一区二区电影| 狂野欧美激情性xxxx| 成人午夜精彩视频在线观看| 脱女人内裤的视频| 精品国产乱码久久久久久男人| 日本wwww免费看| 一个人免费看片子| 国产高清videossex| 人妻一区二区av| 久久国产亚洲av麻豆专区| 国产熟女欧美一区二区| 久久久久网色| 亚洲美女黄色视频免费看| 国产深夜福利视频在线观看| 又粗又硬又长又爽又黄的视频| kizo精华| 99久久综合免费| 狠狠婷婷综合久久久久久88av| 亚洲欧美一区二区三区国产| 别揉我奶头~嗯~啊~动态视频 | 精品国产乱码久久久久久男人| a级毛片黄视频| 国产精品成人在线| 日本五十路高清| 啦啦啦在线观看免费高清www| 国产一卡二卡三卡精品| 亚洲成人手机| 大型av网站在线播放| 777久久人妻少妇嫩草av网站| 久久九九热精品免费| av线在线观看网站| 国产精品三级大全| 啦啦啦 在线观看视频| 欧美日韩国产mv在线观看视频| 人成视频在线观看免费观看| 国产一级毛片在线| 国产精品亚洲av一区麻豆| 成人午夜精彩视频在线观看| 丁香六月欧美| cao死你这个sao货| 亚洲国产欧美日韩在线播放| 中文字幕色久视频| 人人妻人人爽人人添夜夜欢视频| 欧美乱码精品一区二区三区| 中国美女看黄片| 999久久久国产精品视频| 精品欧美一区二区三区在线| 久久av网站| 99九九在线精品视频| 国产精品 国内视频| 欧美日韩亚洲高清精品| 大码成人一级视频| 精品少妇黑人巨大在线播放| 2021少妇久久久久久久久久久| 亚洲人成电影观看| 老熟女久久久| 久久久精品94久久精品| 色94色欧美一区二区| a 毛片基地| 日本色播在线视频| 国产又爽黄色视频| 看免费av毛片| 高清黄色对白视频在线免费看| 啦啦啦啦在线视频资源| 一本色道久久久久久精品综合| 91麻豆精品激情在线观看国产 | 精品亚洲成国产av| 国产人伦9x9x在线观看| 天天添夜夜摸| 国产视频一区二区在线看| 国产精品秋霞免费鲁丝片| 一区二区日韩欧美中文字幕| 久久国产亚洲av麻豆专区| 大型av网站在线播放| 免费在线观看影片大全网站 | 国产在线一区二区三区精| svipshipincom国产片| 国产三级黄色录像| 丝袜脚勾引网站| 日韩伦理黄色片| 精品视频人人做人人爽| 丁香六月欧美| 一级片免费观看大全| 午夜精品国产一区二区电影| 午夜激情久久久久久久| 久久精品国产亚洲av涩爱| 日本欧美国产在线视频| 69精品国产乱码久久久| 日韩 欧美 亚洲 中文字幕| 脱女人内裤的视频| 精品福利永久在线观看| 好男人电影高清在线观看| 男女边吃奶边做爰视频| 色94色欧美一区二区| 一级a爱视频在线免费观看| 少妇人妻 视频| 久久久精品免费免费高清| 精品高清国产在线一区| 视频在线观看一区二区三区| av天堂在线播放| 制服人妻中文乱码| 你懂的网址亚洲精品在线观看| 亚洲熟女毛片儿| 最新在线观看一区二区三区 | 国产精品三级大全| 亚洲成色77777| 秋霞在线观看毛片| 国产精品亚洲av一区麻豆| 欧美黑人欧美精品刺激| 日本欧美国产在线视频| 欧美日韩一级在线毛片| 考比视频在线观看| 99久久99久久久精品蜜桃| 国产成人影院久久av| 无遮挡黄片免费观看| 欧美日韩视频高清一区二区三区二| 久久人妻福利社区极品人妻图片 | 国产精品亚洲av一区麻豆| 男女床上黄色一级片免费看| 五月天丁香电影| 久久精品久久久久久噜噜老黄| 考比视频在线观看| 人妻人人澡人人爽人人| 欧美日韩视频精品一区| 在线观看免费视频网站a站| 热re99久久国产66热| 日韩大码丰满熟妇| 欧美精品高潮呻吟av久久| av在线播放精品| 欧美精品一区二区大全| 国产在线一区二区三区精| 欧美久久黑人一区二区| 高清黄色对白视频在线免费看| 18禁观看日本| 在线观看国产h片| 亚洲欧美精品自产自拍| 国产爽快片一区二区三区| 欧美少妇被猛烈插入视频| 美女脱内裤让男人舔精品视频| 超碰97精品在线观看| 国产男女内射视频| 黑丝袜美女国产一区| 欧美日韩黄片免| www.精华液| 成人亚洲欧美一区二区av| 久久久久久免费高清国产稀缺| 一边亲一边摸免费视频| 黑丝袜美女国产一区| 国产亚洲av高清不卡| 黄色片一级片一级黄色片| 国产成人系列免费观看| √禁漫天堂资源中文www| 老汉色av国产亚洲站长工具| 婷婷色综合www| 国产精品国产三级专区第一集| 天天躁夜夜躁狠狠躁躁| 色综合欧美亚洲国产小说| 国产成人一区二区在线| 无限看片的www在线观看| 一区二区三区精品91| 亚洲少妇的诱惑av| 久久久久精品国产欧美久久久 | 国产午夜精品一二区理论片| 美女福利国产在线| 亚洲国产欧美一区二区综合| 天天躁夜夜躁狠狠躁躁| 日韩中文字幕视频在线看片| 人妻 亚洲 视频| 99国产精品99久久久久| 叶爱在线成人免费视频播放| 一二三四在线观看免费中文在| 18禁黄网站禁片午夜丰满|