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

    Edge Metric Dimension of Honeycomb and Hexagonal Networks for IoT

    2022-08-24 03:27:34SohailAbbasZahidRazaNidaSiddiquiFaheemKhanandTaegkeunWhangbo
    Computers Materials&Continua 2022年5期

    Sohail Abbas,Zahid Raza,Nida Siddiqui,F(xiàn)aheem Khan and Taegkeun Whangbo,*

    1Department of Computer Science,College of Computing and Informatics,University of Sharjah,Sharjah,27272,UAE

    2Department of Mathematics,College of Sciences,University of Sharjah,Sharjah,27272,UAE

    3Artificial Intelligence Lab,Department of Computer Engineering,Gachon University,Seongnam,13557,Korea

    Abstract: Wireless Sensor Network (WSN) is considered to be one of the fundamental technologies employed in the Internet of things (IoT); hence,enabling diverse applications for carrying out real-time observations.Robot navigation in such networks was the main motivation for the introduction of the concept of landmarks.A robot can identify its own location by sending signals to obtain the distances between itself and the landmarks.Considering networks to be a type of graph,this concept was redefined as metric dimension of a graph which is the minimum number of nodes needed to identify all the nodes of the graph.This idea was extended to the concept of edge metric dimension of a graph G,which is the minimum number of nodes needed in a graph to uniquely identify each edge of the network.Regular plane networks can be easily constructed by repeating regular polygons.This design is of extreme importance as it yields high overall performance;hence,it can be used in various networking and IoT domains.The honeycomb and the hexagonal networks are two such popular mesh-derived parallel networks.In this paper,it is proved that the minimum landmarks required for the honeycomb network HC(n),and the hexagonal network HX(n)are 3 and 6 respectively.The bounds for the landmarks required for the hex-derived network HDN1(n) are also proposed.

    Keywords: Edge metric dimension;internet of things;wireless sensor network;honeycomb network;hexagonal network;hex-derived networks

    1 Introduction

    Honeycomb and Hexagonal networks[1]have been widely studied in various research domains,such as wireless sensor networks,wireless networks[2–6]and cellular networks,in order to study and analyze various issues like routing, [7–9] location management and target tracking [10–12], energy conservation [13–15], and interference estimation [16].These networks and application domains are applicable to the IoT as well[17–24].The concept of metric basis and metric dimension for the purpose of robot navigation within a graph-structured framework was initially studied in [25].Recently,the concept of robots and drones have also been proposed in such network structures for various application reasons [26].For example, drones/robots might be used in wireless sensor networks to gather samples for maintenance inspection or regular data collection acting as a mobile sink.Similarly,they can also be used to recharge the batteries of dying sensors on-the-fly.

    Suppose an IoT scenario where a robot/drone is dropped somewhere unknown in a network and can move from node to node.Some vertices in the graph behave as landmarks, and the robot can measure its distance in the graph to any landmark.The objective of this work is to find the fewest number of landmarks so that the robot can determine its current node by only using the distances to the landmarks.While dealing with navigation problems,networks are referred to as graphsG,the elements of the metric basis as landmarks,the minimum size of the metric basis as metric dimensiondim(G) and the remaining vertices as nodes and identified the metric dimension of certain simple categories of graphs.The concept of metric basis also yielded significant applications in chemistry,drug design,image processing and combinatorial optimization[27].

    But what if the robot takes edges into consideration while calculating distance to any landmark.Can the robot still measure its distance in the graph to any landmark such that the landmarks distinguish the edges instead of vertices?A metric basisSof a connected graphGuniquely identifies all the nodes ofGby means of distance vectors.One could think that the edges of the graph are also identified bySwith respect to the distances toS.However,this does not happen.For instance,F(xiàn)ig.1 shows an example of a graph,where no metric basis uniquely recognizes all the edges of the graph.

    Figure 1:The simple graph G

    It can be observed that the graphGof Fig.1 satisfies thatdim(G) = 2.But for each one of the metric bases,there exist at least a pair of edges which is not distinguished by the corresponding metric basis as shown in Tab.1.For the metric basis{a,b}the edgesacandadare equidistant from it while for the metric basic{c,d},the edgesadandbdare equidistant and so on.In this sense,a natural question is:Are there some sets of vertices/nodes which uniquely identify all the edges of a graph?To answer this,a new parameter was recently introduced in which the question is to whether there are some sets of nodes which can uniquely identify all the edges of a graph[28].

    Table 1:Metric basis of G and equidistant edges

    LetG=(V,E)be a connected graph.Letx∈Vbe a node ande=uv∈Ebe an edge,then the distance between the nodexand the edgeeis defined asdG(e,x)=min{dG(u,x),dG(v,x)}.A nodex distinguishesany two edgese,fifdG(x,e) ≠dG(x,f).A setS?Vis an edge metric generator(EMG)forGif for any two distinct edgese1 ande2,there exists at least one nodev∈Ssuch that the distancesdG(e1,v)anddG(e2,v)are different.An EMG with the smallest size is referred to as an edge metric basis(EMB)forG,and its size is an edge metric dimension(EMD),which is denoted byedim(G).Another useful approach for an EMG is as follows.Given an ordered set of nodesS=(s1,s2,...,sd)of a connected graphG,for any edgeeinG,the d-vector(ordered d-tuple)is referred to asr(e|S)=(dG(e,s1),dG(e,s2),...,dG(e,sd))as the edge metric representation ofewith respect to S.In this sense,Sis an EMG forGif and only if for every pair of different edgese1,e2 ofG,r(e1|S) ≠r(e2|S)[29].

    In[29],it was proved that theedim(G)=1 if and only if it is a path.They also proved that pathsPn,cyclesCnand complete graphsKnare families of graphs for whomdim(G)=edim(G).

    The determination of EMD is NP hard problem.Hence,one has to consider particular classes of graphs.In[30,31],the author characterized the graphs for whichedim(G)=n-1.The EMD of some graph products was computed in terms of the graphs of the products[32].

    In this paper the following have been proved:

    ·The EMD of Honeycomb networks is 3.

    ·The EMD of Hexagonal networks is 6.

    ·The upper bound of two extensions of these networks called the Hex derived networks is proposed.

    The rest of the manuscript is organized as follows.Section 2 provides the background of honeycomb and hexagonal networks along with their applications plus the related research in this domain.In Section 3, the edge metric dimension of the honeycomb and hexagonal networks are discussed where the resolving set for the HDN1(n) network is presented.The paper is concluded in the Section 4 while highlighting the limitations and future direction of the proposed work.

    2 Background and Related Work

    The honeycomb networks are built by recursively using the hexagonal tessellation[33].The honeycomb network can be easily built from simple hexagons in various ways.HC(1)is just a simple hexagon.Adding one hexagon to each edge of this hexagon gives usHC(2).Similarly,HC(n)can be obtained in the same manner.The network cost, defined as the product of degree and diameter, is better for honeycomb networks than for the two other families based on square(mesh-connected computers and tori) and triangular (hexagonal meshes and tori) tessellations.Honeycomb networks provide simple and optimal routing, broadcasting, and semigroup computation algorithm.Honeycomb networks have major applications in mobile base stations, sensor networks, image processing, and computer graphics.The topological properties of honeycomb networks,their routing as well as torus honeycomb networks have been studied in[33].

    On the other hand,the hexagonal network which was introduced in[34]is made of a minimum of six triangles and denoted byHX(2)whereasHX(1)does not exist.HX(3)comes from adding a series of triangles aroundHX(2).This pattern can be extended toHX(n).It is easy to see thatnis the number of nodes on any one of the outermost edges of the hexagonal network,see Fig.2.

    Figure 2:Honeycomb HC(4)and hexagonal HX(5)networks

    Hexagonal networks also have many applications in wireless communication systems,where the cellular concept plays an important role in solving the problem of spectral congestion and capacity.Hence, the hexagonal concept of model coverage plays an important role in such cellular network communications.

    Multiprocessor interconnection networks are often required to connect thousands of homogeneously replicated processor-memory pairs,each of which is called a processing node.Instead of using a shared memory, all synchronization and communication between processing nodes for program execution is often done via message passing.Design and use of multiprocessor interconnection networks have recently drawn considerable attention due to the availability of inexpensive, powerful microprocessors and memory chips [34,35].Regular plane tessellations can be easily constructed by repeating regular polygons.This design is of extreme importance for direct interconnection networks as it yields high overall performance.

    A lot of research followed this and a host of generators,such as[36,37],were introduced.However,these generators primarily focused on the differentiation of the nodes.The idea was that a network in which a metric generator can distinguish the vertices behaves like an accurate surveillance activated network.But,if there is an intruder which accesses the network not through its vertices,but by using some connections between them(edges),then such intruder could not be identified,and in this sense,the surveillance fails in its commitment and some extra property is required in the network to be used effectively for this purpose[38].The honeycomb and hexagonal networks along with the security are studied in[39].Hence,such limitation can cause a major disadvantage from the application point of view.It is this shortcoming,that motivated the authors to explore a unique edge metric generator for this family of networks.

    3 Result Discussions and Analysis

    In this section, the EMD of the Honeycomb and hexagonal networks will be computed.The bounds for one of the hex derived networks will also be proposed.It is interesting to find that the EMD of honeycomb network and the hexagonal network are constant.For the hex-derived networks,it still needs to be seen whether an exact value for the EMD can be obtained or not.

    3.1 Edge Metric Dimension of the Honeycomb Network

    In this subsection,the EMD will be computed for the Honeycomb networkHC(n),It is interesting to note that the EMD is the same as the metric dimension of the honeycomb network.This will provide a partial answer to the question about the families of graphs for which the EMD and the usual metric dimension are same.In order to prove the EMD for the honeycomb network,first the paths for this network are defined.LetαPi,βPjandγ Pkbe paths definingHC(n)such that 0 ≤i,j,k≤2n-1 as shown in the Fig.3.It is easy to see that each edge is the intersection of exactly two different paths.

    Figure 3:Paths in honeycomb network-HC(4)

    Theorem 1.Let HC(n)be the honeycomb network.Then edim(HC(n))=3.

    Proof:This proof consists of two parts,where the first part is divided into three cases depending upon the paths, and the second part is divided into two cases.The first part of the proof is of forward inequality followed by proof of backward inequality thus leading to the equality itself.Since the honeycomb network is built recursively using the hexagonal tessellation, its properties exhibit symmetry across various dimensions.It is to explain these properties,that the proof is further divided into Cases,sometimes followed by sub-cases to further explain the unique cases underlying a particular pattern.

    It will be proved thatR={α,β,γ}is a resolving set forHC(n).As one can see from Fig.3,thatHC(n)network consists of three types of edges with respect to each node inR.For simplicity,three types of edges with respect toαwill be taken.The case of the edges with respect to the other nodes ofRcan be resolved in a similar manner.Lete1 ande2 be any two edges ofHC(n).The following cases may ensue,depending on the types of edges.

    Case 1:If both edgese1 ande2 belong to the same pathαPifor somei, then they will be distinguished byαitself.

    Case 2:If both edgese1 ande2 are parallel such that they lie between two consecutive pathsαPiandαPi+1 for somei,that ise1 ande2 does not completely lie on any of these two consecutive paths,then again,they will be distinguished byα.

    Case 3:Ife1 ande2 lie on two different pathsαPiandαPjsuch thati≠j, then all such pair of edgese1 ande2 will be automatically distinguished byαexcept the pair of edges for whomd(e1,α)=d(e2,α).In this situation,two possibilities may arise,i.e.,:Subcase 3a:Ife1,e2 ∈βPkfor somek,then we are in Case 1 for the nodeβ.Subcase 3b:Ife1,e2/∈βPkfor somek,then this happened only ife1 ∈βP2kande2 ∈βPl+1for somekandl,then it is easy to see thatd(e1,γ)<d(e2,γ)and both edges will be distinguished byγ.Hence,theedim(HC(n))≤3.

    Conversely,it can be proved that theedim(HC(n))≥3.On the contrary,suppose that there is a resolving set of cardinality two, sayS= {a, b} ∈V(HC(n)).Since each node ofHC(n) lies on some paths ofα,β,γ,let us consider all the nodes lying on the paths indexed byγ.So,if there exitsiandjsuch thata∈γ Piandb∈γ Pj,then the following two cases are to be considered:

    Case 1:Ifi=j,it means that both the nodes ofSlie on a pathγ Piof even lengthl=2q.If the distance between them is denoted byd(a,b)=m.then two cases may arise depending uponm.

    Subcase 1a:Ifm <l, then there will exist two edgese1 ande2 incident to one of the nodes ofSsaya, such that one of the edges lies on the pathγ Piand the other does not.It is easy to see thatd(e1|S)=d(e2|S)=(0,m).

    Subcase 1b:Ifm=l,such thati=j≠nanda,b∈γ Pi,then there exists at least two edgese1 ande2 inγ Pi+1andγ Pi-1such thatd(e1|S)=d(e2|S)=(3,m-2),a contradiction.Ifi=j=nanda,b∈γ Pn,then again there exists two edgese1 ande2 onγ P3 such thatd(e1|S)=d(e2|S)=(m+1,m+1),a contradiction.

    Case 2:Fori≠j,leta∈γ Piandb∈γ Pjsuch that they also lie onαProrβPs.Then we will be in Case 1 forαorβ.Ifa∈γ Piandb∈γ Pjsuch that they do not lie onαProrβPs,then the following possibilities may ensue:

    ·Ifd(a,b)>3,then there exists at least two edgese1 ande2 with the following properties:e1 ande2 are incident on a node of the shortest path betweenaandb,and one of the edges saye1 lies on the shortest path.Hence,d(a,e1)=d(a,e2)=2 andd(e1|S)=d(e2|S).

    ·Ifd(a,b)=3,andaandblie on two deferent hexagons,then one can find two edgese1 ande2 such thatd(e1|S)=d(e2|S)=(0,3).

    ·Ifd(a,b)=3,andaandblie on the same hexagon,then one can find two edgese1 ande2 such thatd(e1|S)=d(e2|S)=(0,2).

    ·Ifd(a,b)=2,then one can find two edgese1 ande2 such thatd(e1|S)=d(e2|S)=(0,2).

    ·Ifd(a, b) = 1, then there exists two edgese1 ande2 such thatd(e1 |S) =d(e2 |S) = (0, 1).

    Hence,theedim(HC(n))>3 and the proof is finished.

    3.2 Edge Metric Dimension of the Hexagonal Network

    In order to prove this,the concept of the co-ordinate system of the hexagonal network is presented as adapted by Nocettiet al.[39].He introduced the three axes,X,YandZat an angle of 120 along the sides of any triangle within a hexagonal network as shown in the Fig.4.In this section,the EMD for the hexagonal networkHX(n)will be computed.It is interesting to note that the EMD is larger than the metric dimension of the hexagonal network.This will once again provide a partial answer to the question raised in[40]about the classification of families for which the EMD is larger than the usual metric dimension.

    Figure 4:Coordinate system of hexagonal network-HX(5)

    The concept of edge neighborhood of a node and state some properties of the same are introduced now.For any nodev∈V(HX(n))ande∈E(HX(n)),the edge neighborhood of a nodevis defined asE Np(v) = {e|d(e,v) =p} where 0 ≤p≤2n- 2.For the convenience of describing the edges, the lines parallel toX-axis are referred to asX-lines and follow the same concept for definingY-lines andZ-lines.Furthermore,a segment of anyX,YorZline is referred to asSX,SYandSZrespectively as shown in the Fig.4.The central node is labeled byoand the six corner nodes of the outer most hexagon as{α,β,γ,θ,σ,ψ}as shown in the Fig.5.

    Figure 5:Neighborhoods of hexagonal network-HX(4)

    Theorem 2.Let HX(n)be a hexagonal network.Then the edim(HX(n))=6

    Proof.We will prove thatR={α,β,γ,θ,σ,ψ}is a resolving set forHX(n).

    In order to proof thatR={α,β,γ,θ,σ,ψ}is a resolving set forG,the network is divided into 6 triangles namelyΔαoψ,Δβoα,Δγ oβ,Δθoγ,ΔσoθandΔψo(hù)σ.

    The proof is presented in two steps.In the first step,it is proved that ife1 ande2 are two edges such thate1 ande2 belong to two different triangles,then they are distinguished by one of the nodes inR.In the second step,it is further proved that ife1 ande2 are two edges belonging to the same triangle,then once again they are distinguished by some node inR.

    Case 1:Lete1 ande2 by two edges belongs to two different triangles.There are two subcases to consider depending upon the types of triangles.

    Subcase 1a:Lete1 ande2 belong to two non-adjacent triangles.For simplicity let us take the two trianglesΔαoψandΔθoγsuch thate1 ∈Δαoψande2 ∈Δθoγ.Thene1 ∈E Np(α) such that 0 ≤p≤n- 1 ande2 ∈E Np(α) such thatn- 1 ≤p≤2n- 2.Hence, at all timese1 ande2 will be distinguished byα∈Rexcept whenp=n-1.In such a case,it is easy to see thate1 ande2 will be clearly distinguished byψ.

    Subcase 1b:Lete1 ande2 belong to two adjacent triangles.Ife1 ande2 lie on the shared side of the two adjacent triangles,then they will fall under the restrictions of Case 2 discussed below.However,if the edgese1 ande2 are chosen such thate1 ∈Δαoψande2 ∈Δψo(hù)σsuch that they do not lie on the shared side then it is observed thate1 ∈E Np(α)such that 0 ≤p≤n-1 ande2 ∈E Np(α)such thatn-1 ≤p≤2n-3.Hence,e1 ande2 will be distinguished byα∈Rexcept whenp=n-1.In such a case,it is easy to see thate1 ande2 will be clearly distinguished byσ.Symmetry leads to similar reasoning for the cases of any pair of edges belonging to any pair of triangles in the network.

    Case 2:Let the two edgese1 ande2 belong to the same triangle,sayΔψo(hù)σ.See Fig.5.In this case,the following is observed:

    Subcase 2a:If the two edgese1 ande2 lie on the same segment of one of the co-ordinate axes,saySZof theZ-axis.Then it is easy to see that the two edgese1 ande2 are distinguished byψandγ.Similarly,if the edges belonged toSXorSY,then they will be distinguished byαandθorβandσrespectively.

    Subcase 2b:If two edgese1 ande2 are parallel to each other and lie on the segments of one of the axes,saySXiandSXjfori≠j.Then it is clear to note that there exists distinct indicespandqsuch thate1 ∈E Np(β)ande2 ∈E Nq(β)and hence the edges are distinguished byβ.Similar observations will be observed if the edges belonged toSYorSZ.

    Subcase 2c:If the two edgese1 ande2 lie on segments of two different axes, then the following two possibilities arise:

    a) If two edges are incident on a node,for simplicity,it can be assumed thate1=bd∈SZifor somei,then the following two possibilities arise:

    ·Ife2=ab∈SXj forsomej,thene1 ande2 will be distinguished byα.

    ·Ife2=dc∈SXl forsomel,thene1 ande2 will be distinguished byβ.

    Similarly,all other edges with a common node can be distinguished in a similar manner.

    b) Ife1e2 are not incident edges,then they will be disguised byαexcept ife1,e2 ∈ENr(α).In such a case,if for simplicity lete1 ∈SX,thene1,e2 will be distinguished byβbecause they will lie in different neighborhoods ofβasd(e1,e2)≥1.Hence,edim(HX(n))≤6.

    Conversely, LetS= {v1,v2,v3,v4,v5} ?V(G) such thatSis an EMG.Then three cases to be considered.

    Case 1:IfSis such thatS∩Zn-1=Φ.Then there will always exist two edgese1 ande2 such thatd(e1|S)=d(e2|S).

    Precisely,the two edges would be given bye1=rsande2=rtwherer,s,tare nodes belonging toV(G)such thatr∈Z(n-2)ands,t∈Z(n-1)and their co-ordinates arer=(-1,n-3,n-2),s=(-1,n-2,n-1),t=(-2,n-3,n-1).

    Case 2:IfSis such thatS∩Zn-1{θ,σ} ≠Φ.Then there will always exist two edgese1 ande2 such thatd(e1|S)=d(e2|S).

    Precisely,the two edges would be given bye1=orande2=oswhereo,r,sare nodes belonging toV(G),o=(0,0,0),r=(0,1,1),s=(-1,0,1).

    Case 3:SupposeS?{α,β,γ,θ,σ,ψ} such that |S| = 5.For simplicity let us considerS?{α,β,γ,θ,σ} such that |S| = 5.Then there exists two edgese1 ∈EN1(θ) ∩EN2n-1(ψ) ande2 ∈EN2n-1(α)∩EN2n-1(β)such thatd(e1|S)=d(e2|S),e1 ande2 have a common node with coordinates(0,n–1,n–1).

    Thus,all sets of 5 corner nodes of theHX(n)network generate similar equidistant edges.Hence,theedim(HX(n))≥6 which completes the proof.

    3.3 Hex Derived Networks

    In [41] two hex derived networks were introduced as they have much better connectivity as compared to the honeycomb and hexagonal networks.These areHDN1(n) andHDN2(n), forn≥2 as shown in Fig.6.

    Figure 6:HDN1(n)and HDN2(n)networks

    TheHDN1(n)is a planar graph and was shown to have 9n2-15n+7 vertices and 27n2-51n+24 edges with a diameter of 2n-2.TheHDN2(n)graph was shown to have 9n2-15n+7 vertices and 36n2-72n+36 edges with a diameter of 2n-2.These two architecturesHDN1(n)andHDN2(n)have a few advantages over the hexagonal and honeycomb networks.The vertex-edge ratio ofHDN1(n)andHDN2(n)are the same as that of hexagonal and honeycomb networks.However,both these hexagonal and honeycomb networks are simulated by these hex derived networks with no extra cost.This is possible since the hex derived networks contain hexagonal and honeycomb.HDN1(n)is planar,and it accommodates in a given space more processors and wires than hexagonal and honeycomb.In[42]it was proved that the metric dimension ofHDN1(n) andHDN2(n) was between 3 and 4.In [43] it was proved that the metric dimension ofHDN1(n)=4.In this paper,a resolving set for the network ofHDN1(n) was formulated which would make an upper bound of the minimum resolving set forHDN1(n).The resolving setRcontains all the nodes of each Hexagon inside the network,except the central node.Hence, the EMD has to be greater than or equal to 12 and less than |R|, where |R|,depends on the types ofn;even or odd.

    Here|R|,represents the upper bound of the proposed resolving set for the hex derived networkHDN1(n),and k is any positive integer.

    The comparison of the research is summarized in Tab.2.It is observed that the Metric dimension of HC(n)proposed in[41]and the edge metric dimension of these networks as proved in this research are the same.However, this research shows that the edge metric dimension of the HX(n) is greater than the metric dimension of HX(n)which was found out to be 3 in[41].While[42]was able to give a bound for both the hex derived networks and[43]found the exact value for HDN1(n)networks and this research is able to find the bounds for the HDN1(n)networks.

    Table 2:Edge metric dimension comparison

    4 Conclusion and Future Work

    In this paper the edge metric dimension of honeycomb and hexagonal networks were studied which could effectively be utilized by wireless sensor networks in a IoT scenario,such as robot/drone navigation.After representing the network via a graph in terms of robots and landmarks, a robot could measure its distance in the graph to any landmark.The objective was to enable robot in finding out the fewest number of landmarks in order to determine its current node thereby using only the distances to the landmarks.It was proved that the minimum landmarks required for a honeycomb networkHC(n)and a hexagonal networkHX(n)are 3 and 6,respectively.The bounds were proposed for the landmarks required for the hex-derived networkHDN1(n), i.e., by finding out the resolving set for the network ofHDN1(n).However,the exact values of the number of landmarks required for hex derived networks are still unfound and the methodology proposed for the number of landmarks required for hex networks cannot be naturally extended to hex derived networks.Since the hex derived networks are more efficient in an IoT scenario, exact values for the number of landmarks for these hex-derived networks point towards a future direction of research.

    Acknowledgement:The authors thank their families and colleagues for their continued support.

    Funding Statement:No funding was received to support any stage of this research study.Zahid Raza is funded by the University of Sharjah under the Projects#2102144098 and#1802144068 and MASEP Research Group.

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

    国产精品伦人一区二区| 欧美区成人在线视频| 欧美激情国产日韩精品一区| 麻豆成人午夜福利视频| 嫩草影院精品99| 亚洲av.av天堂| 99久久久亚洲精品蜜臀av| 欧美人与善性xxx| 亚洲美女搞黄在线观看 | 一区福利在线观看| 国内精品美女久久久久久| 国产精品不卡视频一区二区| 精品久久久久久成人av| 男人和女人高潮做爰伦理| 黄色视频,在线免费观看| 少妇丰满av| 国产极品精品免费视频能看的| 免费在线观看日本一区| 国产综合懂色| 亚洲av不卡在线观看| 成人av在线播放网站| 日本欧美国产在线视频| 成人午夜高清在线视频| 最近视频中文字幕2019在线8| 美女免费视频网站| av天堂中文字幕网| 在线观看舔阴道视频| 免费观看精品视频网站| 蜜桃久久精品国产亚洲av| 男人和女人高潮做爰伦理| 在线观看午夜福利视频| 日韩欧美免费精品| 日本精品一区二区三区蜜桃| 村上凉子中文字幕在线| 欧美三级亚洲精品| 亚洲欧美日韩东京热| 国产 一区 欧美 日韩| 亚洲在线自拍视频| 久久草成人影院| 国产精品美女特级片免费视频播放器| 精品免费久久久久久久清纯| 国产一区二区激情短视频| 丰满人妻一区二区三区视频av| 人人妻,人人澡人人爽秒播| 99视频精品全部免费 在线| 日韩国内少妇激情av| 亚洲精华国产精华液的使用体验 | 亚洲精品日韩av片在线观看| 亚洲av五月六月丁香网| 亚洲性久久影院| 久久久久久久久久成人| av黄色大香蕉| 久久99热6这里只有精品| 日韩亚洲欧美综合| 色播亚洲综合网| 国内毛片毛片毛片毛片毛片| 哪里可以看免费的av片| 国产伦精品一区二区三区视频9| 自拍偷自拍亚洲精品老妇| 一区二区三区激情视频| 老熟妇乱子伦视频在线观看| 中文字幕高清在线视频| 老女人水多毛片| 成人鲁丝片一二三区免费| 麻豆成人午夜福利视频| 精品久久久久久久末码| 成年女人永久免费观看视频| 黄色女人牲交| 日韩中字成人| 日韩精品青青久久久久久| 身体一侧抽搐| 久久精品91蜜桃| 国产老妇女一区| 国产精品国产高清国产av| 在线观看舔阴道视频| 欧美一级a爱片免费观看看| 在线播放国产精品三级| 久久草成人影院| aaaaa片日本免费| 国产精品一区www在线观看 | 国产精品99久久久久久久久| 国产精品电影一区二区三区| 亚洲天堂国产精品一区在线| 久久久国产成人精品二区| 美女 人体艺术 gogo| 国产亚洲精品久久久com| 超碰av人人做人人爽久久| av在线天堂中文字幕| 综合色av麻豆| 欧美成人a在线观看| 99riav亚洲国产免费| 岛国在线免费视频观看| a级毛片a级免费在线| 亚洲熟妇熟女久久| 国产精品国产三级国产av玫瑰| 午夜a级毛片| 美女大奶头视频| 日本与韩国留学比较| 国产男靠女视频免费网站| 国产一区二区三区视频了| 成人特级黄色片久久久久久久| 波野结衣二区三区在线| 色综合色国产| 国产精品一区二区三区四区免费观看 | avwww免费| 日本色播在线视频| 亚洲精品在线观看二区| 亚洲 国产 在线| 日韩精品青青久久久久久| 久久久午夜欧美精品| 97碰自拍视频| 少妇人妻一区二区三区视频| 3wmmmm亚洲av在线观看| 日韩欧美 国产精品| 国产亚洲精品久久久久久毛片| 一级黄色大片毛片| 亚洲专区国产一区二区| 亚洲最大成人中文| 亚洲经典国产精华液单| 欧美激情久久久久久爽电影| 欧美精品啪啪一区二区三区| 婷婷亚洲欧美| 亚洲经典国产精华液单| 国产精品亚洲一级av第二区| 波野结衣二区三区在线| 国产视频一区二区在线看| 亚洲国产高清在线一区二区三| 在线观看66精品国产| 欧美日韩黄片免| 熟女电影av网| 国产高潮美女av| 1000部很黄的大片| 亚洲专区中文字幕在线| 国产高清视频在线播放一区| 色哟哟哟哟哟哟| 欧美日韩综合久久久久久 | 成人三级黄色视频| 亚洲精品亚洲一区二区| 一进一出抽搐gif免费好疼| 悠悠久久av| 成人av一区二区三区在线看| 永久网站在线| 老熟妇仑乱视频hdxx| av在线蜜桃| 不卡一级毛片| 一进一出抽搐gif免费好疼| 老熟妇仑乱视频hdxx| 国产乱人视频| 亚洲av中文av极速乱 | 嫁个100分男人电影在线观看| 日韩亚洲欧美综合| 美女 人体艺术 gogo| 成年免费大片在线观看| 国产亚洲欧美98| 国产v大片淫在线免费观看| 欧美国产日韩亚洲一区| 久久国产精品人妻蜜桃| 国产成人a区在线观看| 精品一区二区三区av网在线观看| 日本一本二区三区精品| 亚洲av中文字字幕乱码综合| 午夜日韩欧美国产| 成人一区二区视频在线观看| 免费一级毛片在线播放高清视频| 中文字幕高清在线视频| 欧美日韩国产亚洲二区| 看免费成人av毛片| 国产精品国产高清国产av| 国产白丝娇喘喷水9色精品| 在线观看免费视频日本深夜| 欧美最新免费一区二区三区| 免费在线观看影片大全网站| 亚洲av中文av极速乱 | 无人区码免费观看不卡| 啦啦啦啦在线视频资源| 老司机福利观看| 国内久久婷婷六月综合欲色啪| 亚洲在线观看片| 美女被艹到高潮喷水动态| 少妇的逼水好多| 日韩国内少妇激情av| 天天一区二区日本电影三级| 精品人妻偷拍中文字幕| 2021天堂中文幕一二区在线观| 精品人妻视频免费看| 色尼玛亚洲综合影院| 如何舔出高潮| 一边摸一边抽搐一进一小说| 欧美性感艳星| 国产精品精品国产色婷婷| 校园人妻丝袜中文字幕| 岛国在线免费视频观看| 俺也久久电影网| 国产精品嫩草影院av在线观看 | 国产视频内射| 一卡2卡三卡四卡精品乱码亚洲| 亚洲天堂国产精品一区在线| 麻豆一二三区av精品| 熟妇人妻久久中文字幕3abv| .国产精品久久| 91久久精品电影网| 亚洲成人精品中文字幕电影| 日韩精品有码人妻一区| 88av欧美| 亚洲最大成人av| 亚洲aⅴ乱码一区二区在线播放| 国产成人影院久久av| 午夜爱爱视频在线播放| 久久久久性生活片| 蜜桃久久精品国产亚洲av| 大又大粗又爽又黄少妇毛片口| 国产午夜精品论理片| 国产乱人伦免费视频| 国内少妇人妻偷人精品xxx网站| 精品人妻视频免费看| 亚洲18禁久久av| 搡老妇女老女人老熟妇| 桃红色精品国产亚洲av| 又爽又黄无遮挡网站| 看片在线看免费视频| 日韩,欧美,国产一区二区三区 | av.在线天堂| 日本色播在线视频| 在线免费观看的www视频| or卡值多少钱| 男插女下体视频免费在线播放| 午夜激情欧美在线| 国产久久久一区二区三区| 午夜日韩欧美国产| 国产亚洲精品久久久久久毛片| 精品人妻1区二区| www.色视频.com| 丰满乱子伦码专区| 91久久精品国产一区二区成人| videossex国产| aaaaa片日本免费| 观看免费一级毛片| 天天一区二区日本电影三级| 国产高潮美女av| 国内揄拍国产精品人妻在线| 综合色av麻豆| 97热精品久久久久久| 久久99热6这里只有精品| 国产色爽女视频免费观看| 亚洲性久久影院| 成人毛片a级毛片在线播放| 色综合亚洲欧美另类图片| 淫秽高清视频在线观看| 亚洲精品影视一区二区三区av| 国产精品一区www在线观看 | 亚洲乱码一区二区免费版| 免费av毛片视频| 一级毛片久久久久久久久女| 日本黄色片子视频| 亚洲欧美日韩高清在线视频| 特级一级黄色大片| 精品一区二区三区视频在线观看免费| 午夜福利18| 国产黄a三级三级三级人| 久久6这里有精品| 久久精品国产亚洲网站| 午夜精品一区二区三区免费看| 欧美精品啪啪一区二区三区| 久久国产乱子免费精品| 91久久精品国产一区二区成人| 欧美另类亚洲清纯唯美| 色综合色国产| 国产私拍福利视频在线观看| 99riav亚洲国产免费| 中出人妻视频一区二区| 美女被艹到高潮喷水动态| 波野结衣二区三区在线| av国产免费在线观看| 丰满乱子伦码专区| 国产精品嫩草影院av在线观看 | 在线观看舔阴道视频| 永久网站在线| 婷婷六月久久综合丁香| 91久久精品国产一区二区三区| 制服丝袜大香蕉在线| 日韩亚洲欧美综合| 日本三级黄在线观看| 久久久久免费精品人妻一区二区| 精品一区二区三区人妻视频| 国产精品,欧美在线| 69av精品久久久久久| 非洲黑人性xxxx精品又粗又长| 九色国产91popny在线| 黄色一级大片看看| av中文乱码字幕在线| 88av欧美| 日本欧美国产在线视频| 中文在线观看免费www的网站| 国产av在哪里看| 精品一区二区免费观看| 超碰av人人做人人爽久久| 久久久色成人| 中文在线观看免费www的网站| 欧美最新免费一区二区三区| 91av网一区二区| 亚洲狠狠婷婷综合久久图片| 久久国内精品自在自线图片| 亚洲avbb在线观看| 欧美日韩国产亚洲二区| 在线观看av片永久免费下载| 日韩欧美三级三区| 啪啪无遮挡十八禁网站| 成人二区视频| 看黄色毛片网站| 亚洲第一区二区三区不卡| 久久久久久久久大av| 99国产精品一区二区蜜桃av| 午夜激情福利司机影院| 国产探花在线观看一区二区| 日本-黄色视频高清免费观看| 午夜a级毛片| www.www免费av| 尤物成人国产欧美一区二区三区| 国产精品国产高清国产av| 国产 一区精品| 深爱激情五月婷婷| 国产真实乱freesex| 日韩大尺度精品在线看网址| 动漫黄色视频在线观看| 日日撸夜夜添| 一区二区三区免费毛片| 91精品国产九色| 在线观看舔阴道视频| 国产真实伦视频高清在线观看 | av专区在线播放| 精品一区二区三区人妻视频| 日日撸夜夜添| 嫩草影院入口| 国产精品久久电影中文字幕| 小说图片视频综合网站| 婷婷六月久久综合丁香| 一区二区三区四区激情视频 | av在线蜜桃| 国产亚洲91精品色在线| 日本一二三区视频观看| 久久人妻av系列| 日本五十路高清| 免费搜索国产男女视频| 日韩欧美国产在线观看| 一级黄色大片毛片| 国产一区二区在线观看日韩| 狠狠狠狠99中文字幕| 男人狂女人下面高潮的视频| 内射极品少妇av片p| 亚洲国产精品sss在线观看| 日韩强制内射视频| 成人av在线播放网站| 啦啦啦观看免费观看视频高清| 亚洲国产高清在线一区二区三| 久久精品国产清高在天天线| 男人的好看免费观看在线视频| 日本在线视频免费播放| 成年版毛片免费区| 久久这里只有精品中国| 最近最新免费中文字幕在线| 最近最新中文字幕大全电影3| 日本黄大片高清| 国产精品一区二区三区四区久久| 午夜免费激情av| 久久久精品大字幕| 日本黄大片高清| 国产高清视频在线观看网站| 嫁个100分男人电影在线观看| 国产综合懂色| 久久精品91蜜桃| 精品乱码久久久久久99久播| 男人和女人高潮做爰伦理| 99久久精品一区二区三区| 一a级毛片在线观看| 欧美成人性av电影在线观看| 免费看日本二区| 成人国产综合亚洲| 他把我摸到了高潮在线观看| 午夜福利视频1000在线观看| 久久久久久久亚洲中文字幕| 国产高清视频在线播放一区| 亚洲精品国产成人久久av| 免费在线观看成人毛片| av在线亚洲专区| 久久欧美精品欧美久久欧美| 欧美性猛交╳xxx乱大交人| 一卡2卡三卡四卡精品乱码亚洲| h日本视频在线播放| 黄色女人牲交| 久久午夜亚洲精品久久| av在线亚洲专区| 免费电影在线观看免费观看| 日韩亚洲欧美综合| 尤物成人国产欧美一区二区三区| 内射极品少妇av片p| 精品久久久久久,| 国产伦人伦偷精品视频| 如何舔出高潮| 亚洲色图av天堂| 91麻豆精品激情在线观看国产| 精品欧美国产一区二区三| 国产欧美日韩精品一区二区| 嫩草影视91久久| 国产精品自产拍在线观看55亚洲| 免费在线观看成人毛片| 一个人看视频在线观看www免费| 成人国产麻豆网| 久久久久国内视频| 国产又黄又爽又无遮挡在线| 两个人的视频大全免费| a级毛片免费高清观看在线播放| 欧美丝袜亚洲另类 | 精品久久久久久久久亚洲 | 欧美高清成人免费视频www| 免费看a级黄色片| 亚洲av熟女| 老师上课跳d突然被开到最大视频| 国产极品精品免费视频能看的| 亚洲国产欧洲综合997久久,| 日韩 亚洲 欧美在线| 国产伦一二天堂av在线观看| 中国美白少妇内射xxxbb| 哪里可以看免费的av片| 观看免费一级毛片| 久久亚洲精品不卡| 一级av片app| 国产极品精品免费视频能看的| 欧美性猛交╳xxx乱大交人| 久久久久久久亚洲中文字幕| 国内少妇人妻偷人精品xxx网站| 制服丝袜大香蕉在线| 精品人妻一区二区三区麻豆 | 干丝袜人妻中文字幕| 婷婷精品国产亚洲av| 天堂动漫精品| 日本黄色片子视频| 三级男女做爰猛烈吃奶摸视频| 长腿黑丝高跟| 国内精品久久久久久久电影| 伦理电影大哥的女人| 国产精品人妻久久久影院| 99热6这里只有精品| 国产毛片a区久久久久| 97超视频在线观看视频| 久久久久性生活片| 国产精品98久久久久久宅男小说| 亚洲国产欧洲综合997久久,| xxxwww97欧美| 欧美最新免费一区二区三区| 麻豆国产97在线/欧美| 91精品国产九色| 午夜福利在线观看免费完整高清在 | 国产av不卡久久| xxxwww97欧美| 小说图片视频综合网站| 丰满乱子伦码专区| 欧美另类亚洲清纯唯美| 精品一区二区三区人妻视频| 国内毛片毛片毛片毛片毛片| 最近最新中文字幕大全电影3| av在线观看视频网站免费| 日本 欧美在线| 国产av麻豆久久久久久久| eeuss影院久久| 久久国内精品自在自线图片| 色吧在线观看| 亚洲最大成人手机在线| 国产伦在线观看视频一区| 亚洲熟妇中文字幕五十中出| 成人二区视频| 麻豆久久精品国产亚洲av| 制服丝袜大香蕉在线| 国产色爽女视频免费观看| 人人妻人人澡欧美一区二区| 在线观看午夜福利视频| a级一级毛片免费在线观看| 男女下面进入的视频免费午夜| 可以在线观看的亚洲视频| 国产白丝娇喘喷水9色精品| 亚洲精品粉嫩美女一区| 内地一区二区视频在线| 大型黄色视频在线免费观看| 亚洲国产精品成人综合色| 成人一区二区视频在线观看| 久久精品国产自在天天线| 在线免费十八禁| av天堂中文字幕网| 深爱激情五月婷婷| 久久久精品大字幕| 最新中文字幕久久久久| 欧美xxxx性猛交bbbb| 久久香蕉精品热| 日本爱情动作片www.在线观看 | 极品教师在线视频| 一进一出抽搐gif免费好疼| 毛片一级片免费看久久久久 | 成人av一区二区三区在线看| 天天躁日日操中文字幕| 尾随美女入室| 长腿黑丝高跟| 精品一区二区三区视频在线| 国产伦精品一区二区三区四那| 九九久久精品国产亚洲av麻豆| 性插视频无遮挡在线免费观看| 国产在视频线在精品| 色在线成人网| av女优亚洲男人天堂| 三级男女做爰猛烈吃奶摸视频| 免费大片18禁| 成人一区二区视频在线观看| 国产免费av片在线观看野外av| 色视频www国产| 国产精品一区二区性色av| 亚洲国产精品成人综合色| 日本精品一区二区三区蜜桃| 性欧美人与动物交配| 日韩一本色道免费dvd| 春色校园在线视频观看| 黄色配什么色好看| 亚洲狠狠婷婷综合久久图片| 十八禁国产超污无遮挡网站| 少妇丰满av| 夜夜夜夜夜久久久久| 人妻夜夜爽99麻豆av| 精品久久久久久久末码| 日韩,欧美,国产一区二区三区 | 国产黄a三级三级三级人| 又爽又黄a免费视频| 深夜a级毛片| 欧美xxxx性猛交bbbb| 亚洲国产高清在线一区二区三| 一区二区三区四区激情视频 | 亚洲精品粉嫩美女一区| 日韩欧美国产在线观看| 男人舔女人下体高潮全视频| 久久久久性生活片| 1000部很黄的大片| 99久久精品国产国产毛片| 女同久久另类99精品国产91| 日本免费a在线| 成人精品一区二区免费| 亚洲一级一片aⅴ在线观看| 一卡2卡三卡四卡精品乱码亚洲| 免费看a级黄色片| 国产成人aa在线观看| 不卡一级毛片| www.www免费av| 白带黄色成豆腐渣| 精品免费久久久久久久清纯| 91在线观看av| 极品教师在线免费播放| 国产伦精品一区二区三区四那| 亚洲一级一片aⅴ在线观看| 亚洲美女搞黄在线观看 | 日韩精品青青久久久久久| 成年人黄色毛片网站| 夜夜看夜夜爽夜夜摸| 色精品久久人妻99蜜桃| 黄色日韩在线| 日本a在线网址| 久久久久免费精品人妻一区二区| 久久久久久久午夜电影| 啦啦啦观看免费观看视频高清| 日日撸夜夜添| 国产久久久一区二区三区| 3wmmmm亚洲av在线观看| 又爽又黄无遮挡网站| av在线观看视频网站免费| 51国产日韩欧美| 精品一区二区三区人妻视频| 国产亚洲精品久久久com| 国产视频一区二区在线看| 亚洲国产欧美人成| 色av中文字幕| av国产免费在线观看| 很黄的视频免费| 日韩一本色道免费dvd| 午夜精品久久久久久毛片777| 国产精品亚洲美女久久久| 他把我摸到了高潮在线观看| 亚洲国产精品久久男人天堂| 久久人人精品亚洲av| 嫁个100分男人电影在线观看| 日韩国内少妇激情av| 69人妻影院| 成人高潮视频无遮挡免费网站| 午夜亚洲福利在线播放| 亚洲性久久影院| 极品教师在线免费播放| netflix在线观看网站| 露出奶头的视频| 色综合婷婷激情| 99九九线精品视频在线观看视频| 美女被艹到高潮喷水动态| 国产精品三级大全| a级一级毛片免费在线观看| 有码 亚洲区| 国产精品野战在线观看| 久久久久久国产a免费观看| 99久久精品一区二区三区| 欧美日韩中文字幕国产精品一区二区三区| 99精品在免费线老司机午夜| 麻豆国产97在线/欧美| 免费一级毛片在线播放高清视频| 女生性感内裤真人,穿戴方法视频| 99久久精品一区二区三区| 欧美日韩中文字幕国产精品一区二区三区| 日日摸夜夜添夜夜添小说| 亚洲av日韩精品久久久久久密| 久久久久久久久中文| 亚洲性夜色夜夜综合| 搞女人的毛片| 欧美黑人巨大hd| 在线天堂最新版资源| 男人和女人高潮做爰伦理|