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

    Name Relevance and Contact Opportunity-Based Routing Strategy for Mobile Content Sharing

    2018-10-10 06:27:26ChaoLiWeiHeandHuimeiLu

    Chao Li, Wei He and Huimei Lu

    (School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China)

    Abstract: With the rapid advancement of smart devices and mobile computing technologies, content sharing in dynamic wireless networks is in substantial demand. To address this problem, in our former work, we presented the Delay/Disruption-tolerant Mobile Content Sharing Network (DMCSN). In this paper, we further examine the routing strategy under the DMCSN framework. We first design the composite interest for organizing user interests. Then, an interest routing strategy based on incremental name relevance (IRINR) and a content routing strategy based on incremental contact opportunity (CRICO) are devised to correspond to the two stages of the content acquisition process: the spreading of the interests and the returning of the contents. Our simulation results validate the following: first, the composite interest can reduce redundant dissemination of content; second, matching of interests and contents are accomplished in a more cost-effective manner under the guidance of IRINR compared with baseline methods; and finally, the integration of IRINR and CRICO achieves a good balance between cost and performance.

    Key words: opportunistic routing; content-based; name relevance; contact opportunity; composite interest

    Mobile devices have become indispensable in people’s common daily lives because of their portability, versatility and computational capability. However, most mobile users still rely on cellular or Wi-Fi connection to obtain content and rarely share it among peers. On the one hand, free public hotspots are seldom available outdoors, so users usually have to be charged for a large amount of data traffic. On the other hand, a considerable amount of content may reside in devices of neighboring ones, and non-private contents could be made public for sharing, such as news, weather reports, announcements, and so forth. Currently, these massive and diversified resources are not fully exploited. In addition, the limited communication range and inherent mobility of mobile devices make the connectivity in the network constructed by such devices highly intermittent, which is quite challenging for content routing and exchanging. Moreover, although users can utilize device-to-device communication methods, e.g. Bluetooth and Wi-Fi direct, to contact with neighboring people, procedures of content discovery and connection establishment are not automatic.

    To provide a solution to this issue, in our previous work[1], by borrowing properties inherited from the Delay/Disruption Tolerant Network (DTN) as a remedy to highly dynamic network conditions and combining the emerging concept of content-centric networking, we proposed the Delay/Disruption-tolerant Mobile Content Sharing Network (DMCSN) to enhance collaboration among multiple devices in content sharing. The key features of DMCSN are listed below.

    ①Each piece of content possesses a name. Users can request the content by name, thus eliminating the need to know the explicit owner of the content.

    ②Content body and information in bundle header are stored separately without independent bundle encapsulation to avoid redundancy and alleviate pressure on the buffer.

    ③Previous transmissions can reduce costs for later requests, because they leave replicas on intermediate nodes. Requesters can fetch one of the replicas nearby, not necessarily from the source. In this way, contents in the buffer are far more valuable and users could expect to spend less time on waiting.

    ④Two phase routing methods, namely, interest and content routing, are more appropriate and effective for content request, matching, and delivery.

    ⑤Integration of transmission inits is supported to save link capacity.

    In this paper, we further develop an enhanced routing protocol for the DMCSN framework. Our chief focus is to incorporate and utilize the characteristics of content naming and two-phase routing to achieve better performance. To this end, we devise two separate strategies: the first is interest routing based on incremental name relevance(IRINR), which is responsible for matching content based on interest at low cost, and the second is content routing based on incremental contact opportunity (CRICO), whose task is to effectively pass content back to the requester.

    The remainder of this paper is organized as follows. In Section 1, related works are outlined and discussed. In Section 2, we first describe the naming convention based on attribute-value pairs and demonstrate how it works in representation and matching; then we elaborate the IRINR and CRICO routing strategies. Experimental evaluations and correlated analysis are given in Section 3. Finally, we end the paper with the concluding remarks in Section 4.

    1 Related Works

    Content sharing has attracted significant attention from scholars over the past few years. As reflected in these works, most proposals on the Internet or MANET agree on some assumptions, such as stable connections and periodic information exchanging for maintaining status and knowledge of the network. But these assumptions are often violated in mobile wireless scenarios in which, due to active mobility of participating nodes, the publisher and consumer of a content cannot be expected to establish an end-to-end connection under all circumstances. So the “publish/subscribe” paradigm, which decouples the request and content dissemination both temporally and spatially[2], is more suitable for mobile environments where the contacts of nodes are sporadic and intermittent.

    Routing protocols based on the pub/sub model in opportunistic wireless networking are well studied by numerous researchers. Context-based methods, as represented by Refs.[3-4], emphasize the social or contact relationship of users and consider them as the solid bases for determining a better carrier. However, context-oblivious methods, such as the one discussed in Ref.[5], do not need much knowledge about surroundings or the neighboring nodes, nor do they require a data collection phase. Meanwhile, past works like Ref.[6] and Ref.[7] use content popularity as the central metric. Each interest explicitly specifies a demanded piece of content, and this one-on-one relationship is the foundation of calculating content popularity. As it can be seen, the relationship of multiple interests and contents are not taken into consideration. In our work, a more flexible relevance between interests and contents can be quantified and exploited. Of these, Ref.[8] proposes an agent-assisted method, which utilizes nodes that could discover or retrieve content more easily to provide services for others. We can learn that the majority of the aforementioned routing protocols still rely on address to perform routing, i.e., they always try to track the specific nodes instead of seeking desired contents, which is proven to be inefficient for distributed content sharing[9-10].

    Haggle[11]is a search-oriented framework, in which content and interest can be described by users by attaching flexible “attribute-value” labels to them. All labels form a relation graph as the foundation of local search operations. The proportion of matched labels represents the relation strength. Here, the interests of nodes can be learned by far-away counterparts through dissemination. Clearly, the relationship between nodes is quite concentrated on content, and this represents a major difference from traditional routing proposals. In the current work, we are interested in following this new content-centric approach to design an appropriate routing strategy.

    Despite numerous advantages achieved through the principle of “content from anywhere”, such as fast fetching of popular contents and the optimization of bandwidth consumption, the new approach also makes the network susceptible to new cache- and content-based attacks. This problem, also known as “content poisoning”, jeopardizes the safety of users and causes harmful effects to the network. Although it is beyond the scope of this study to solve this problem, reviewing related solutions on attack mitigation is still a noteworthy subject as it may be a chief concern of readers and a future working direction of us.

    A basic and passive method for addressing such a problem is by incorporating a signature in packet[12]. A user can clearly be aware of whether or not the received content is trustworthy by simply verifying the signature using the public key of the producer. However, this method only protects users, to some extent, by enabling them to distinguish and discard poisoned contents. Due to the caching nature of the networking, the contents still exist in the intermediary caches and, if not handled properly, these will be served continuously to more victims. Therefore, more proactive methods are proposed. In Ref.[13], upon detecting poisoned content, nodes will propagate a feedback message upstream to warn the others. Then, the path to the poisoned content is treated as a bad choice. In Ref.[14], a ranking algorithm for cached contents is applied based on statistics collected from consumers. Apart from user reports, other studies theorized that routers or intermediary nodes can undertake inspection jobs along with forwarding. However, performing on-the-fly checking of every packet is a computationally heavy and time-consuming task. To reduce the overhead, Ref.[15] only performs verification on popular content and Ref.[16] employs probabilistic verification during the data packet forwarding process. Furthermore, Ref.[17] notes that well-designed caching strategies also have effects on relieving poisoned content attacks. In delay-tolerant networks, where the network topology is highly dynamic, it is even more difficult to control poisoned contents. In Ref.[18], a node tries to detect poorly behaving nodes by observing the suspicious activities of its neighbors. If a node is considered to be malicious, it will be quarantined, i.e. others will cease to connect with it in the future.

    2 Name Relevance and Contact Opportunity-Based Routing

    2.1 Composite interest

    Interest is an important indicator in content dissemination, as it allows nodes to be aware of the needs of others and forward contents accordingly. In our design, users can express their interests or describe features of contents via attribute-value pairs, and the attribute field can be left empty. The name of interest or content consists of a series of such pairs. We do not assign priorities to pairs and treat them equally for simplicity. We take this flat naming scheme mainly because of two reasons. First, it can provide the flexibility allowing users to show their requirements through arbitrary keywords. In this way, the well-known taxonomy of contents does not become a mandatory prerequisite. Second, the compactness and conciseness of the flat naming scheme are expected, because the name information are carried in each bundle header in forwarding process. Once a name is assigned to a piece of content at the source node, it will stay unchanged unless some modifications are made to the content body. In this way the purity of names is kept and the computational complexity is reduced. This aspect is different from Haggle in which anyone can put labels on content at will.

    However, as the number of requests increases, the interest units are produced in greater quantity. Even after a content is delivered to the requester, corresponding interests would not disappear if they are not yet expired or removed deliberately. This will continuously incur more redundant transfers. It would be quite difficult and implausible to locate all of them and inform owners to remove them immediately under a distributed situation. To alleviate this problem, we propose the concept of “composite interest”. From the viewpoint of form, as Figs.1-2 shown, this is an aggregation of all valid single interests of a node. Using the composite interest, we are able to express multiple individual interests at one time. Hence, the transmission times of interests can be reduced and the local management of interests is much easier. More importantly, the composite interest can function implicitly as a notification message of invalidation. For example, if composite interestP1, which consists of single interestI1andI2, comes at timeT1, then later,P2comes containingI1andI3atT2(T1

    Fig.1 Structure of single interest

    Fig.2 Structure of composite interest

    Fig.3 Structure of response content

    2.2 Content matching

    We define the metric as “name relevance” to measure the matching degree between two objects, one of which can be either an interest or a content. For example, if the name of interestIaisnaand the name of contentCbisnb, then the name relevance is calculated as

    (1)

    which yields a value between 0 and 1. The bigger the value is, the stronger the relation between the interest and content. The cardinality of the name is the number of “attribute-value” pairs it includes. Meanwhile, the result of the intersection is the number of pairs that the two names have in common. Next, we extend the equation to calculate the relevance between two objects containing multiple name entries as Algorithm 1.

    Algorithm1Calculation of relevance between two composite interests

    repeat

    rAB←rAB+(1-rAB)ri,?ri∈T

    T←T-{ri}

    untilTis ?

    The setRis defined as

    R={rij|rij=f(ni,nj),?ni∈A,?nj∈B}

    (2)

    2.3 Interest routing based on the incremental name relevance

    To acquire content, a node should initially announce its interests to let others know what it actually demands. In our strategy, we provide two ways to disseminate interest to avoid flooding interests to the regions where required contents do not likely exist. The first is by broadcasting beacons which include the interests of the node itself. The beacons are forwarded within 1-hop for neighbor discovery and connection establishment. If the desired contents are found at the direct neighbor, then they can be delivered immediately. The second way is by storing and forwarding the interests of other nodes in a multi-hop manner to largely expand the reachable scope of interests.

    With the aim of helping improve the proportion of successful matching and controlling the dissemination of interests within a reasonable area, we propose interest routing based on incremental name relevance (IRINR). Our primary goal is directing interests to nodes, including but not limited to, those with demanded contents. The nodes that have highly similar interests or contents are deemed as good forwarders as well, because they share common preferences and also have high possibility to obtain demanded contents in the near future in their neighborhoods. The composite interest can facilitate the finding of such nodes as it can reflect the overall requirements of the source node. Moreover, with the name relevance metric, the interests have more opportunities to approach the regions, in which the contents needed possibly reside, along the direction of increasing name relevance without the location knowledge of node or content.

    For example, we presume the names of composite interestI1andI2aren1andn2, respectively. Then, according to Eq.(1), the relevance betweenn1andn2is given by

    (3)

    If contentC3, whose name isn3, completely matchesI2, it means that

    (4)

    Then, we can have

    n2∩n3=n2

    (5)

    Furthermore,

    n1∩n2∩n3=n1∩n2

    (6)

    From Eqs.(1) and (6), we have

    Therefore, we can deduce that

    p3=r13≥p1=r12

    (7)

    We can conclude that, if the source ofI2getsC3, then the probability thatC3can satisfyI1is greater than the relevance ofI1andI2. This indicates that interests should be forwarded along the direction of higher relevance to approach the expected contents.

    The procedures of how nodes forward interests to neighbors and how they react to the incoming interests are given in Algorithms 2 and 3.

    Algorithm2Procedure of forwarding the interests of other nodes in IRINR

    localInterestList=getLocalInterestList()

    for eachiin local Interest List do

    ifi.source ≠ localNode then

    neighborInterest = getInterest(currentNeighbor)

    selfInterest = getInterest(localNode)

    if relevance(i, neighborInterest) > relevance(i, selfInterest) then

    sendInterest(i)

    end if

    end if

    end for

    Algorithm3Procedure of receiving the interests in IRINR

    incomingInterest = receiveInterest()

    if localExistInterest(incomingInterest.source) then

    localInterest = getInterest(incomingInterest.source)

    if incomingInterest.timestamp > localInterest.timestamp then

    updateLocalInterest(incomingInterest)

    updatelocalMatchingRecords()

    end if

    end if

    2.4 Content routing based on incremental contact opportunity

    When two nodes initiate a connection, all local matching records, content digest, and predictions of contacting other nodes will be exchanged. The exchanging of content digest will clarify to both sides what useful contents they could obtain from each other. The content digest is valid only during the current session and will not be passed to the third party. Next, both sides will take the same operations. Here we just take one side to explain. The node will first receive the matching records from the neighbor. For the interest in each record, if the current node has not seen it before or has an older version of it, then an update should be applied. Otherwise, if the interest the current node has is relatively new and the content in the record cannot satisfy any of the interests of the current node, this indicates the matching information provided by the neighbor may be outdated, so the content will not be retrieved. In this way, only contents that can satisfy the latest version of interests can be forwarded. Next, if the content is not stored locally, and if the current node has a higher probability to meet the destination of compared with the neighbor, the content will be pulled back. For those contents that are already present locally, only corresponding matching records will be updated. Matching will also be performed upon the arrival of new content to satisfy the needs of more awaiting interests. To calculate contact opportunity, prediction-based routing methods, which have been extensively studied in DTN research[19-21], can be applied to our framework. However, our method differs from that proposed by Haggle in terms of routing in that Haggle uses an identical method for forwarding interest and content, but here we use separate methods for different purposes. In addition, Haggle considers contents as interests and may misguide them to sources of similar content instead of to the actual requesters. By contrast, we make content gradually come closer to the nodes that really need them. The complete procedure of CRICO is given in Algorithm 4.

    Algorithm4Procedure of CRICO

    matchingRecords = receiveMatchingRecords()

    check ← false

    for eachrin matchingRecords do

    incomingInterestInfo = r.getInterestInfo()

    incomingContentInfo = r.getContentInfo()

    if localExistInterest(interestInfo.source) then

    localInterestInfo = getInterest(interestInfo.source)

    if localInterestInfo.timestamp > incomingInterestInfo.timestamp then

    check ← true

    else

    updateLocalInterest(incomingInterestInfo)

    end if

    end if

    acceptContent ← true

    if check then

    if not matching(incomingContentInfo, localInterestInfo) then

    acceptContent ← false

    end if

    end if

    if localExistContent(incomingContentInfo) then

    acceptContent ← false

    end if

    if acceptContent and hashigherContactProbability(currentNeighbor, incomingInterestInfo.source) then

    receiveContent(receivedContentInfo)

    matchingLocalInterests(incomingContentInfo)

    end if

    updateLocalMatchingRecords()

    end for

    3 Experiments and Results

    3.1 Experimental setup

    In our experiments, we adopt a modified version based on ONE[22](version 1.4.1) as the simulator. The main function we implemented is the support of content naming. The global parameters and settings are given in Tab.1. Here, we give a brief explanation on the reasoning for these parameters. We assumed that the communication interface that each node is equipped with is a widely used IEEE 802.11g Wi-Fi interface. IEEE 802.11g works at a 2.4 GHz band; it can provide transmission speed of up to 54 Mb/s and transmit at a maximum range of 100 m[23]. However, in reality, the speed and range of the wireless radio are often significantly influenced by the surrounding environment. In order not to lose generality, we set the transmission speed to 25 Mb/s and the transmission range to 30 m. The moving velocity of the nodes is set to 0.5-1.5 m/s, which is the normal speed for walking pedestrians used by numerous past studies[24-26]. The default map of ONE simulator is used, which depicts a section of downtown Helsinki, Finland. Nodes move along roads on the map and Dijkstra’s algorithm is used to calculate the shortest path from the current location to a randomly selected destination according to the shortest path map-based movement model.

    Tab.1 Experiment parameters and settings

    We compare our design with two baseline methods (i.e., the direct method and the flooding method)in order to exclude the impact of other algorithms and to discover the real defects and benefits of our work tentatively. In this part, the buffer size is set to infinite to avoid introducing too many influential factors simultaneously. We shall take this factor into consideration in the following part. In the following experiments, we evaluate the different combinations of interest and content routing components as listed in Tab.2 extensively and present the temporal result analysis.

    3.2 Evaluation metrics

    The effectiveness and cost are two major aspects of evaluating the advantages and disadvantages of routing algorithms. Therefore, we use several metrics in each of them. The description of metrics is shown in Tab.3. The metrics “Efficiency of Content Dissemination”, “Fulfillment Ratio of Interests”, and “Average Content Holding” are defined in the following equations respectively.

    (8)

    (9)

    (10)

    In these equations,Nfis the number of successfully fulfilled interests,Niis the total number of interests,Ciis the number of content items the nodeiowns,Cis the total number of distinct content items,Nis the total number of nodes, andFiis the forwarded times of contenti(including all replicas).

    Tab.2 Routing methods for comparison

    Tab.3 Evaluation metrics

    3.3 Evaluation of the composite interest

    In this section, we use the flooding method both as the interest and content routing component to evaluate the performance of composite interest compared with the single interest. As shown in Fig.4, at the beginning, neither content nor interest appears in the network. This results in the ECD being 0 before 1 000 s. During 1 000 s and 1 800 s, no content successfully returns to the requester, so it still remains 0. With the progress of the simulation, this value begins to fluctuate severely at approximately 2 000 s. This can be attributed to the fact that the denominator, i.e., the forwarded times of contents, is too small to resist sudden change. After 3 000 s, this value becomes stable and indicates that the composite interest surpasses the single interest on the ECD for at least 10%. In other words, the redundant transmission of content is reduced, thus the efficiency and the precision of dissemination are enhanced. In the following experiments, composite interest is applied as the default type of interest.

    Fig.4 Comparison of single interest and composite interest on ECD

    3.4 Evaluation of IRINR

    In this experiment, in order to observe the performance of IRINR, we adopt the flooding method as the content routing component, although we adopt different interest routing methods as the interest routing component. The scheme settings are shown in Tab.4. As shown in Fig.5, with regards the sum of forwarded interests, IRINR is slightly more than the direct scheme and is far less than the flooding scheme. Associating with Fig.6, in which the FRI of IRINR can compete with that of the flooding scheme, we can say that it is fairly cost-effective. Another point in Fig.5 that needs explanation is that, a few interests are already forwarded before 1 000 s. These interests are empty beacons used for discovering neighbors. In another viewpoint, they are special empty interests announcing that their hosts do not desire anythingat that moment.

    Tab.4 Scheme settings for the comparison of interest routing

    Fig.5 Comparison of interest schemes on exchanged interests

    Fig.6 Comparison of interest schemes on FRI

    3.5 Evaluation of CRICO

    In this experiment, we use the prediction model in Prophet[21]as the core of CRICO. We adopt the flooding method as the interest routing component, although we use different content routing methods as the content routing component to clarify the performance of CRICO. The scheme settings are shown in Tab.5. The flooding scheme exchanges contents in an uncontrolled manner; hence, it can reach high FRI in a short time, as shown in Fig.7. Meanwhile, the buffer resource is exhausted rapidly as depicted in Fig.8. Comparatively, the increase speed of the FRI of CRICO is not so fast, but it saves approximately 30%-40% of buffer space, on average. In addition, most of the interests can be fulfilled in an acceptable delay. Take the 60% line in Fig.7 as example, the elapsed time before overall FRI reaches 60% of CRICO is approximately 10 000 s, which is only 30% more than that of the flooding scheme (approximately 6 600 s), and on the other hand is greatly less than that of the direct scheme (approximately 27 000 s). In Fig.9, we bring the results of CRICO on FRI and ACH together and discover that the increase speed on FRI is faster than that of ACH, indicating that a small addition in storage cost can pay more in terms of the successful content deliveries by CRICO.

    Tab.5 Scheme settings for the comparison of content routing

    Fig.7 Comparison of the content schemes on FRI

    Fig.8 Comparison of the content schemes on ACH

    Fig.9 Comparison of the CRICO scheme on FRI and ACH

    3.6 Evaluation of INTR

    In this section, we integrate IRINR and CRICO and label it as INTR, to assess their performance as a whole. The scheme settings are shown in Tab.6. Fig.10 illustrates that, with respect to FRI, the flooding scheme still has superiority over other approaches. The INTR also behaves well and has a good trend: it ascends almost linearly under 80% and achieves final results that close to the flooding scheme at the end of the simulation. Figs.11-12 demonstrate that INTR has an effect on controlling overhead. First, the forwarded times of interests are less than a half of those in the flooding scheme, indicating only selected interests are forwarded towards promising directions. Correspondingly, the ACH of INTR is maintained at a very low level, suggesting that redundant content exchange is suppressed and a considerable amount of buffer space could be saved. To summarize, the integration of IRINR and CRICO is effective in achieving a good balance between performance and cost.

    Tab.6 Scheme settings for the evaluation of INTR

    Fig.10 Evaluation of the INTR scheme on FRI

    3.7 Evaluation under limited buffer size and shorter time

    In this section, we will evaluate the performance of INTR with the constraints of limited buffer size and shorter simulation time,in order to determine whether INTR performs well under these conditions. The scheme settings are the same as those shown in Tab.6 in Section 3.6. The parameters are unchanged as in Tab.1 in Section 3.1, with the exception of the simulation time being reduced from 36 000 s (10 h) to 21 600 s (6 h). The buffer size ranges from 100-200 MB, which we believe is acceptable for most user devices. The replacement policy is to remove the oldest content first. Each experiment is repeated for 10 times with different trajectories of nodes. The result presented is the mean number of all the derived values.

    Fig.11 Evaluation of the INTR scheme on exchanged interests

    Fig.12 Evaluation of the INTR on ACH

    From Fig.13, we can see that the buffer size has great impact on the delivery ratio of the flooding scheme. With the decreasing buffer size, the delivery ratio of flooding scheme declines evidently. The delivery ratio of the direct scheme is not influenced much by buffer size changing because it does not need much buffer resources to work and thus has a relatively low delivery ratio. Notably, the INTR surpasses the flooding scheme when the buffer resource is in a shortage. This indicates that the INTR can utilize limited buffer size with greater efficiency in order to deliver more contents. Meanwhile, augmenting the buffer size has a positive effect on the INTR as the delivery ratio increases gradually with the increase in buffer size. In addition, INTR shows better adaptability to the limitation of buffer size, because the difference of the delivery ratio between the maximum and the minimum buffer sizes is only approximately 7%.

    Fig.13 Delivery ratio with different buffer sizes

    In terms of average delay, as shown in Fig.14, the flooding scheme is the lowest among the three schemes. It can be observed that the average delay goes up first and then goes down with the increase in buffer size. This is mainly due to several reasons. ① When the buffer size is small, the stay duration of contents is very short as they are to be replaced soon. As such, those contents that are near the requesters have a higher possibility of successful delivery. Therefore, the average delay is low at the beginning. ② With the increasing buffer size, each node can possess more contents. This makes it possible for more deliveries to be completed at a later time, which contributes to the higher value of the average delay. ③ With the further increase in buffer size, due to the rapidly spreading nature of the flooding scheme, the possibility of demanded contents locating in the local buffer or nearby nodes also increases. Therefore, the average delay keeps decreasing when the buffer size is larger than 140 MB due to such immediate deliveries. The average delay of the direct scheme is also unaffected by variations in the buffer size. For the direct scheme, the buffer size is sufficient and the delay largely correlates with the routes and movements of nodes, for which we use the same 10 sets data across different experiment groups of buffer size. The average delay of the INTR is the highest of all schemes: it keeps increasing gradually as the buffer size increases. From this point, combined with the result of the delivery ratio, we can see that INTR can find and deliver contents efficiently in the long run. The longer delay reveals that, in the INTR, contents that are located far from the requesters or need multiple relays to be found and delivered are well-supported. This point is more clearly observable when the buffer size is limited, as we know that the flooding scheme provides poor support for such far-away contents. This finding validates the correctness of IRINR, as it can find demanded contents in potential directions. The increasing buffer size further strengthens such abilities.

    Fig.14 Average delay with different buffer sizes

    Next, we examine the results from the aspect of the amount of content. Tabs.7-8 provide the comparison of the transmitted and removed content amounts, respectively. As can be seen, the flooding scheme has an overwhelming amount of transmitted data, but most of them are removed. The severe turbulence greatly affects the performance of the flooding scheme and leads to wasted link resources when the buffer size is small. In comparison, when the buffer size becomes larger, as stated previously, local or nearby content replicas relieve such phenomena. In the direct scheme, both the transmitted and removed content amounts are extremely low as contents are exchanged in an overly conservative way. Therefore, the direct scheme does not fully utilize the buffer resource. As for the INTR, we can see that the transmitted content amount is only approximately 10% of the flooding scheme, and the removed content amount is only approximately 5% of the flooding scheme. This demonstrates the coaction effects of both the IRINR and CRICO. To avoid a great number of content replicas being generated, IRINR only selectively disseminates interests based on the matching results. Meanwhile, CRICO only forwards contents with a greater delivery possibility to the next hop. The results given in Fig.15 indicate that the average content number possessed by each node in INTR is only a half that of the flooding scheme. This is a reasonable buffer use level for each node, because each node has a number of contents and also needs to simultaneously keep a portion of available space for incoming valuable contents. These results demonstrate the effectiveness of the INTR in controlling the amount of content in the network and its efficiency in maximizing the utilization of limited link and buffer resources.

    Tab.7 Average transferred content amount with different buffer sizes

    Tab.8 Average removed content amount with different buffer sizes

    Fig.15 Average number of contents in each node with different buffer sizes

    To conclude this section, we briefly review the key findings below.

    ①The INTR can achieve a better delivery ratio when the buffer size is limited. The overall performance is not influenced greatly by the buffer variance.

    ② The longer average delay of the INTR reveals that INTR supports multi-hop content finding and delivery processes more efficiently; it does so by sending selected interests towards the potential locations of demanded contents and by exchanging more valuable contents.

    ③The INTR is more storage-efficient compared with other schemes and is capable of efficiently utilizing the link and buffer resources with less content transfer and dropping.

    4 Conclusions

    In this paper, based on DMCSN, the framework we have presented for improving content sharing in wireless network, we expanded on our past research by completing several tasks. First, we use the attribute-value pairs to describe the names of interests and contents. This method is flexible and allows us to quantify and exploit the relevance of multiple names. Then, we propose the composite interest structure that is used to express the interests of users. This structure facilitates both transmission and management, while simultaneously serving as an implicit acknowledgement to suppress the redundant transmission of successfully delivered contents. Next, we design the IRINR for the routing of interest. The main feature of the IRINR is that it can lead interests towards potential nodes, which either possess demanded contents or have highly relevant interests or contents, based on the matching results. Finally, we use the classical routing method prophet as the core of CRICO to function as the content routing and combine it with the IRINR to form the complete routing solution, which we call INTR.

    We obtained several findings from the experiments. First, composite interest can reduce the redundant transmission of contents. Second, the IRINR can effectively guide interests to existing or potential content locations. Finally, the INTR maintains a good balance between cost and performance. It also shows better tolerance on limited buffer size, can provide better support for matching across multi-hop, and is capable of utilizing link and storage resources more efficiently.

    亚洲色图 男人天堂 中文字幕 | 三上悠亚av全集在线观看| 熟妇人妻不卡中文字幕| 一本久久精品| 成人国产av品久久久| 国产色爽女视频免费观看| av一本久久久久| 成人国产av品久久久| 色婷婷久久久亚洲欧美| 国产男人的电影天堂91| 欧美亚洲 丝袜 人妻 在线| 国产黄色免费在线视频| 观看av在线不卡| 日韩不卡一区二区三区视频在线| 亚洲精品乱码久久久久久按摩| 边亲边吃奶的免费视频| 国产伦理片在线播放av一区| 精品一区二区免费观看| 欧美精品一区二区大全| 久久久久久久久久久久大奶| 亚洲精品美女久久av网站| 97超碰精品成人国产| 久久毛片免费看一区二区三区| 女人久久www免费人成看片| 九草在线视频观看| 一本一本久久a久久精品综合妖精 国产伦在线观看视频一区 | 亚洲国产精品999| www.av在线官网国产| 欧美xxⅹ黑人| 中文欧美无线码| 少妇人妻 视频| 精品久久蜜臀av无| 成人影院久久| 美女福利国产在线| 丝袜脚勾引网站| 丝袜在线中文字幕| 亚洲av成人精品一区久久| 久久国产精品男人的天堂亚洲 | 少妇人妻久久综合中文| 卡戴珊不雅视频在线播放| 丰满少妇做爰视频| 纯流量卡能插随身wifi吗| 国产日韩欧美在线精品| 成人免费观看视频高清| 国产成人免费观看mmmm| 久久久久网色| 中国美白少妇内射xxxbb| 国产极品天堂在线| 日本爱情动作片www.在线观看| 国产精品一二三区在线看| 18+在线观看网站| 日韩一本色道免费dvd| 午夜久久久在线观看| 美女国产高潮福利片在线看| 热99久久久久精品小说推荐| 国产永久视频网站| 美女xxoo啪啪120秒动态图| 九色亚洲精品在线播放| av视频免费观看在线观看| 伊人亚洲综合成人网| 国国产精品蜜臀av免费| 久久99热6这里只有精品| 熟女av电影| 欧美亚洲 丝袜 人妻 在线| 99九九线精品视频在线观看视频| 欧美 日韩 精品 国产| 一个人看视频在线观看www免费| 日本与韩国留学比较| 欧美性感艳星| 建设人人有责人人尽责人人享有的| 91精品一卡2卡3卡4卡| 亚洲一区二区三区欧美精品| 欧美日韩视频高清一区二区三区二| 在线免费观看不下载黄p国产| 两个人免费观看高清视频| av网站免费在线观看视频| 日韩av免费高清视频| 久久久久网色| 人人妻人人爽人人添夜夜欢视频| 最新中文字幕久久久久| 老司机影院成人| 午夜影院在线不卡| 国产免费福利视频在线观看| 日本猛色少妇xxxxx猛交久久| 九色亚洲精品在线播放| 免费大片黄手机在线观看| 男人操女人黄网站| 午夜91福利影院| 中文字幕人妻熟人妻熟丝袜美| 免费高清在线观看日韩| 国产国拍精品亚洲av在线观看| 久久国内精品自在自线图片| 另类亚洲欧美激情| 日韩伦理黄色片| 91精品国产国语对白视频| 蜜桃久久精品国产亚洲av| 欧美日韩综合久久久久久| av免费在线看不卡| 亚洲人与动物交配视频| 人妻制服诱惑在线中文字幕| 亚洲一级一片aⅴ在线观看| 五月天丁香电影| 少妇被粗大的猛进出69影院 | 国产伦精品一区二区三区视频9| 欧美日韩国产mv在线观看视频| 亚洲欧美色中文字幕在线| 亚洲第一区二区三区不卡| 欧美精品国产亚洲| 91精品国产九色| av有码第一页| 免费久久久久久久精品成人欧美视频 | 亚洲天堂av无毛| 精品少妇久久久久久888优播| 18禁观看日本| 三级国产精品欧美在线观看| 天堂8中文在线网| 精品99又大又爽又粗少妇毛片| 看十八女毛片水多多多| 国产男女内射视频| 欧美 日韩 精品 国产| 亚洲人成77777在线视频| 99久久中文字幕三级久久日本| 欧美 亚洲 国产 日韩一| 国产淫语在线视频| 精品久久久久久久久亚洲| 国产精品久久久久久av不卡| 久久国产精品男人的天堂亚洲 | 一级a做视频免费观看| 三级国产精品片| 欧美激情国产日韩精品一区| 日韩大片免费观看网站| 青春草国产在线视频| 国产成人精品福利久久| 一边亲一边摸免费视频| 欧美成人精品欧美一级黄| 亚洲成色77777| 中文精品一卡2卡3卡4更新| a 毛片基地| 亚洲无线观看免费| 十分钟在线观看高清视频www| 亚洲一级一片aⅴ在线观看| 一级毛片我不卡| 夜夜爽夜夜爽视频| 国产熟女午夜一区二区三区 | 久久热精品热| 中文字幕av电影在线播放| 极品少妇高潮喷水抽搐| 亚洲精品乱码久久久久久按摩| 亚洲精品久久午夜乱码| 男人添女人高潮全过程视频| 国产 一区精品| 亚洲婷婷狠狠爱综合网| 97超碰精品成人国产| 久久精品久久久久久噜噜老黄| 日韩欧美精品免费久久| 中国美白少妇内射xxxbb| 亚洲av成人精品一二三区| 春色校园在线视频观看| 亚洲无线观看免费| 美女国产视频在线观看| 秋霞在线观看毛片| 老司机影院毛片| 少妇人妻久久综合中文| 少妇的逼好多水| 日本黄色日本黄色录像| 一级毛片黄色毛片免费观看视频| 国产精品偷伦视频观看了| 午夜久久久在线观看| 亚洲国产精品成人久久小说| 欧美97在线视频| videosex国产| 2022亚洲国产成人精品| 美女主播在线视频| 自拍欧美九色日韩亚洲蝌蚪91| 天堂8中文在线网| 亚洲人与动物交配视频| 中文字幕久久专区| 国产男女超爽视频在线观看| 久久久午夜欧美精品| 国产欧美另类精品又又久久亚洲欧美| 久久韩国三级中文字幕| 999精品在线视频| a级片在线免费高清观看视频| 亚洲av欧美aⅴ国产| 亚洲av男天堂| 最后的刺客免费高清国语| 久久久久久久大尺度免费视频| 色94色欧美一区二区| 亚洲av成人精品一二三区| 亚洲精品一二三| 三上悠亚av全集在线观看| 久久久久久久久久成人| 这个男人来自地球电影免费观看 | 伊人亚洲综合成人网| 日韩中文字幕视频在线看片| 啦啦啦视频在线资源免费观看| 999精品在线视频| 高清视频免费观看一区二区| 精品人妻偷拍中文字幕| 国产成人91sexporn| 亚洲国产av影院在线观看| xxx大片免费视频| 十分钟在线观看高清视频www| av天堂久久9| 五月天丁香电影| 国产成人aa在线观看| 高清毛片免费看| 欧美老熟妇乱子伦牲交| 久久热精品热| 777米奇影视久久| xxx大片免费视频| 欧美 亚洲 国产 日韩一| 国产色婷婷99| 黄片无遮挡物在线观看| 亚洲,一卡二卡三卡| 香蕉精品网在线| 国产精品人妻久久久久久| 亚洲av日韩在线播放| 国产一区二区在线观看日韩| 久久ye,这里只有精品| 丝袜脚勾引网站| 精品亚洲成国产av| 久久鲁丝午夜福利片| 国产精品国产三级专区第一集| xxx大片免费视频| 老司机影院成人| 91成人精品电影| 免费高清在线观看日韩| 最新中文字幕久久久久| 亚洲,一卡二卡三卡| 成年av动漫网址| 色94色欧美一区二区| 国产成人免费观看mmmm| 久久国内精品自在自线图片| 亚洲人成网站在线观看播放| 五月玫瑰六月丁香| 香蕉精品网在线| 交换朋友夫妻互换小说| 人妻人人澡人人爽人人| 国产成人精品福利久久| 国产综合精华液| 亚洲av成人精品一区久久| av免费观看日本| 水蜜桃什么品种好| 三级国产精品欧美在线观看| 亚洲综合精品二区| 国产精品.久久久| 精品一区在线观看国产| 亚洲三级黄色毛片| 亚洲精品乱久久久久久| 欧美成人午夜免费资源| av福利片在线| 999精品在线视频| 男的添女的下面高潮视频| 国产免费一区二区三区四区乱码| 黄色一级大片看看| 日本av手机在线免费观看| 国产免费又黄又爽又色| 亚洲av男天堂| 久久精品国产a三级三级三级| 大香蕉久久成人网| 国产成人aa在线观看| 九九在线视频观看精品| 91在线精品国自产拍蜜月| 午夜视频国产福利| 日本猛色少妇xxxxx猛交久久| 久久久久久久久久久丰满| 久久久午夜欧美精品| 一本一本综合久久| 九九在线视频观看精品| 好男人视频免费观看在线| 国产成人一区二区在线| 久久午夜综合久久蜜桃| 久久这里有精品视频免费| 七月丁香在线播放| 乱人伦中国视频| 欧美日韩在线观看h| 国产在线视频一区二区| 激情五月婷婷亚洲| 中文字幕久久专区| 国产一区亚洲一区在线观看| 乱人伦中国视频| 黄片无遮挡物在线观看| 日韩一区二区三区影片| 亚洲激情五月婷婷啪啪| 亚洲国产色片| av.在线天堂| 中文字幕av电影在线播放| 国产精品国产av在线观看| 桃花免费在线播放| 久久精品国产a三级三级三级| 国产黄频视频在线观看| 欧美xxxx性猛交bbbb| 插逼视频在线观看| 黄色怎么调成土黄色| 黄色欧美视频在线观看| 精品一区二区免费观看| 99久久人妻综合| 观看av在线不卡| 国产精品一二三区在线看| 久久热精品热| 国产成人aa在线观看| 制服丝袜香蕉在线| 日韩免费高清中文字幕av| 国产欧美亚洲国产| 免费观看无遮挡的男女| 亚洲国产日韩一区二区| 亚洲色图综合在线观看| 九草在线视频观看| 日日摸夜夜添夜夜爱| 日日摸夜夜添夜夜添av毛片| 亚洲精品国产色婷婷电影| 亚洲第一av免费看| 国产成人精品婷婷| 一级爰片在线观看| 亚洲综合色网址| 国产乱人偷精品视频| 婷婷色综合大香蕉| 亚洲精品国产av蜜桃| 日本与韩国留学比较| 国产 精品1| 肉色欧美久久久久久久蜜桃| 18禁在线播放成人免费| 新久久久久国产一级毛片| 亚洲三级黄色毛片| 日本欧美视频一区| 免费人妻精品一区二区三区视频| 精品少妇久久久久久888优播| 国产日韩欧美在线精品| 亚洲美女黄色视频免费看| 亚洲成人手机| 久久这里有精品视频免费| 国产黄色免费在线视频| 五月玫瑰六月丁香| 麻豆乱淫一区二区| 亚洲av二区三区四区| 哪个播放器可以免费观看大片| 午夜老司机福利剧场| 80岁老熟妇乱子伦牲交| 婷婷色麻豆天堂久久| 国产黄片视频在线免费观看| 乱人伦中国视频| 人妻夜夜爽99麻豆av| 国产高清国产精品国产三级| 久久99热6这里只有精品| 亚洲人成77777在线视频| 国产精品免费大片| 国产精品嫩草影院av在线观看| 欧美老熟妇乱子伦牲交| 这个男人来自地球电影免费观看 | 王馨瑶露胸无遮挡在线观看| 老司机影院毛片| 亚洲高清免费不卡视频| 插逼视频在线观看| 热99国产精品久久久久久7| 免费观看av网站的网址| 99久久精品国产国产毛片| 久久国产精品大桥未久av| 啦啦啦视频在线资源免费观看| 人妻制服诱惑在线中文字幕| 热re99久久国产66热| 久久久国产精品麻豆| 国产av国产精品国产| 国产探花极品一区二区| 91精品国产国语对白视频| 精品酒店卫生间| 91久久精品国产一区二区成人| 免费看光身美女| 天堂8中文在线网| 人人妻人人爽人人添夜夜欢视频| 免费观看性生交大片5| 久久久欧美国产精品| 欧美另类一区| 人人妻人人爽人人添夜夜欢视频| 久久精品久久精品一区二区三区| 免费大片黄手机在线观看| 日日摸夜夜添夜夜爱| 伦理电影大哥的女人| 美女福利国产在线| 国产有黄有色有爽视频| 99久国产av精品国产电影| 夜夜看夜夜爽夜夜摸| 大香蕉97超碰在线| 天天躁夜夜躁狠狠久久av| 丝袜脚勾引网站| 久久久亚洲精品成人影院| 久久久久国产精品人妻一区二区| 国产精品偷伦视频观看了| 欧美3d第一页| 日韩精品有码人妻一区| 老女人水多毛片| 色吧在线观看| 精品久久久噜噜| 国产男人的电影天堂91| 午夜视频国产福利| 综合色丁香网| 国产免费现黄频在线看| 一本大道久久a久久精品| 制服丝袜香蕉在线| 最近的中文字幕免费完整| 亚洲精品亚洲一区二区| 国产精品久久久久久精品古装| 91aial.com中文字幕在线观看| 亚洲成人一二三区av| 婷婷色麻豆天堂久久| 在线 av 中文字幕| 久久久久久久亚洲中文字幕| 国产淫语在线视频| 五月伊人婷婷丁香| 午夜激情av网站| 你懂的网址亚洲精品在线观看| 亚洲精品av麻豆狂野| 久久毛片免费看一区二区三区| 久久久久视频综合| 香蕉精品网在线| 汤姆久久久久久久影院中文字幕| 一本色道久久久久久精品综合| 91在线精品国自产拍蜜月| 夜夜爽夜夜爽视频| 久久久久精品久久久久真实原创| 欧美日韩av久久| 国产精品.久久久| 在线观看国产h片| 日韩视频在线欧美| 国产一区二区三区av在线| 最近的中文字幕免费完整| 肉色欧美久久久久久久蜜桃| 久久久久人妻精品一区果冻| 国产深夜福利视频在线观看| 交换朋友夫妻互换小说| 午夜福利视频精品| 丝袜喷水一区| 久久99一区二区三区| 男女高潮啪啪啪动态图| 精品亚洲成a人片在线观看| 日本色播在线视频| 国产亚洲精品久久久com| 婷婷成人精品国产| 肉色欧美久久久久久久蜜桃| 国精品久久久久久国模美| 欧美老熟妇乱子伦牲交| 99热网站在线观看| 中文字幕制服av| 欧美丝袜亚洲另类| 我的老师免费观看完整版| 免费观看无遮挡的男女| 午夜视频国产福利| av又黄又爽大尺度在线免费看| 国产欧美日韩一区二区三区在线 | 久久人人爽人人爽人人片va| 亚洲五月色婷婷综合| 欧美精品亚洲一区二区| av有码第一页| 久久人人爽av亚洲精品天堂| 两个人免费观看高清视频| 十分钟在线观看高清视频www| 亚洲精品456在线播放app| 亚洲成色77777| 午夜免费鲁丝| 午夜免费男女啪啪视频观看| 桃花免费在线播放| 亚洲人成网站在线播| 99精国产麻豆久久婷婷| 成人影院久久| 天天影视国产精品| 少妇人妻 视频| 性色av一级| 高清黄色对白视频在线免费看| 美女大奶头黄色视频| xxxhd国产人妻xxx| 亚洲性久久影院| 国产片内射在线| 色5月婷婷丁香| 搡老乐熟女国产| 考比视频在线观看| 午夜久久久在线观看| 日韩电影二区| 亚洲国产欧美在线一区| 十八禁高潮呻吟视频| 国产伦精品一区二区三区视频9| 午夜精品国产一区二区电影| 如日韩欧美国产精品一区二区三区 | 精品一区在线观看国产| 久热这里只有精品99| √禁漫天堂资源中文www| 久久狼人影院| 日本猛色少妇xxxxx猛交久久| 男人添女人高潮全过程视频| 欧美bdsm另类| xxx大片免费视频| 97在线人人人人妻| 久久99蜜桃精品久久| 亚洲精品日本国产第一区| 色94色欧美一区二区| 91在线精品国自产拍蜜月| 99re6热这里在线精品视频| 激情五月婷婷亚洲| 国产av一区二区精品久久| 精品久久国产蜜桃| 日韩一区二区视频免费看| 亚洲内射少妇av| av专区在线播放| 97在线视频观看| 国产高清三级在线| 日韩中文字幕视频在线看片| 精品久久久噜噜| 中文精品一卡2卡3卡4更新| tube8黄色片| 五月玫瑰六月丁香| 大又大粗又爽又黄少妇毛片口| av又黄又爽大尺度在线免费看| 欧美精品高潮呻吟av久久| 大码成人一级视频| 天天影视国产精品| 大片电影免费在线观看免费| 久久狼人影院| 多毛熟女@视频| 人妻 亚洲 视频| 夫妻午夜视频| 欧美变态另类bdsm刘玥| √禁漫天堂资源中文www| 97超碰精品成人国产| 久久人人爽av亚洲精品天堂| 亚洲在久久综合| 一区二区三区四区激情视频| 久久99一区二区三区| 欧美亚洲日本最大视频资源| 自拍欧美九色日韩亚洲蝌蚪91| 色5月婷婷丁香| 一本久久精品| 91aial.com中文字幕在线观看| 一个人免费看片子| 色视频在线一区二区三区| 午夜福利在线观看免费完整高清在| 啦啦啦啦在线视频资源| 成人国语在线视频| 欧美激情国产日韩精品一区| 在现免费观看毛片| 午夜av观看不卡| 少妇精品久久久久久久| 久久综合国产亚洲精品| 全区人妻精品视频| 999精品在线视频| 在线观看三级黄色| 久久鲁丝午夜福利片| 亚洲国产色片| 亚洲欧美成人综合另类久久久| 两个人免费观看高清视频| 热re99久久国产66热| 亚洲精品视频女| 涩涩av久久男人的天堂| 天堂8中文在线网| 寂寞人妻少妇视频99o| 特大巨黑吊av在线直播| 国产亚洲午夜精品一区二区久久| 人人妻人人澡人人爽人人夜夜| 秋霞在线观看毛片| 一本色道久久久久久精品综合| 91精品三级在线观看| 国产亚洲精品久久久com| 国产 一区精品| 日韩电影二区| 美女内射精品一级片tv| 亚洲精品日韩在线中文字幕| 精品亚洲乱码少妇综合久久| 久久午夜综合久久蜜桃| 天堂中文最新版在线下载| 18禁动态无遮挡网站| 97在线视频观看| 国产av精品麻豆| 亚洲成人一二三区av| 一边亲一边摸免费视频| .国产精品久久| 国产亚洲一区二区精品| 中文精品一卡2卡3卡4更新| av有码第一页| 少妇熟女欧美另类| 日韩中文字幕视频在线看片| 黄色配什么色好看| 水蜜桃什么品种好| 我的女老师完整版在线观看| 不卡视频在线观看欧美| 国产黄色视频一区二区在线观看| 亚洲av.av天堂| 99re6热这里在线精品视频| 简卡轻食公司| 精品国产一区二区久久| kizo精华| 国产精品嫩草影院av在线观看| 久久久久精品久久久久真实原创| kizo精华| 在线 av 中文字幕| 菩萨蛮人人尽说江南好唐韦庄| 亚洲性久久影院| 亚洲国产色片| 亚洲综合色惰| 国产一区二区三区综合在线观看 | 午夜精品国产一区二区电影| 国产视频首页在线观看| 永久网站在线| 国产深夜福利视频在线观看| 免费大片18禁| 满18在线观看网站| 久久久久久人妻| 搡老乐熟女国产| 亚洲av日韩在线播放| 亚洲av在线观看美女高潮| 国产成人av激情在线播放 | 欧美 亚洲 国产 日韩一| 国产欧美日韩综合在线一区二区| 欧美变态另类bdsm刘玥| 2021少妇久久久久久久久久久| 人人妻人人澡人人看| 人人妻人人爽人人添夜夜欢视频| 简卡轻食公司|