# A Novel Video Sharing Solution Based on Demand-Aware Resource Caching Optimization in Wireless Mobile Networks

Authors: Shijie Jia; Ruiling Zhang; Shengli Jiang; Mingchuan Zhang
Journal: Mobile Information Systems
 (2017)

---

## Abstract

The video services in wireless mobile networks attract massive mobile video users, which triggers the demand for huge network traffic. In order to reduce network load and ensure user quality of experience (QoE), the MP2P-based video systems need to implement high-efficiency management and scheduling of video resources to optimize distribution and promote sharing with offloading traffic in underlaying networks. The traditional solutions do not efficiently address the problems caused by demand variation and node mobility for distribution optimization and resource sharing, so that promotion of video sharing performance in wireless mobile networks for user QoE and reduction of network load still is a significant challenge. This paper proposes a novel video sharing solution based on Demand-aware Resource Caching Optimization in wireless mobile networks (VDRCO). VDRCO models the process of video dissemination in overlay networks in terms of the epidemic model and discusses the main influence factors for video dissemination. By estimation for user demand and video distribution variation, VDRCO makes use of clustering nodes with similar video demand and movement behaviors to achieve distribution optimization and efficient video sharing. Extensive tests show how VDRCO achieves much better performance results in comparison with a state-of-the-art solution.


---

## Body

## 1. Introduction

The deployment and popularity of video streaming services in wireless mobile networks are benefited from fast increase of wireless bandwidth and continuous improvement [1]. The promotion of wireless bandwidth capacity such as WiMAX, 4G, and 5G can accommodate massive network traffic brought by high-definition video application [2], which improves visual experience of users; on the other hand, the various technologies of network access such as MANETs, VANETs, and cellular network enable users to conveniently watch video content via smart terminal [3]. As Figure 1 shows, by leveraging the network virtualization methods, the video systems employ the mobile peer-to-peer (MP2P) technologies to achieve large-scale deployment of video applications and promote video sharing in wireless mobile networks [4–9]. The MP2P-based video systems make use of management and scheduling for video resources in overlay networks to promote video sharing performance. The efficiency of video sharing is a key factor for system quality of service (QoS) and user quality of experience (QoE). The increase in the scale of video users brings huge traffic load for the core network. Offloading video traffic in underlaying networks can relieve load of the core network and reduce delay of video lookup and transmission [10, 11]. However, this requires video requesters always can find and connect with geographic adjacent providers to fetch desired videos (called “near-end video fetching”) instead of geographic far providers (called “far-end video fetching”). The near-end video fetching in wireless mobile networks relies on the two perspectives: (1) the efficient resource management achieves optimal video distribution to ensure local balance between supply and demand of resources in geographic area; (2) the efficient resource scheduling supports fast discovery of geographical adjacent video providers on the basis of the optimized distribution.Figure 1
MP2P-based video streaming services in wireless mobile networks.Recently, massive studies focus on making use of video caching and scheduling to promote sharing performance. For instance, the cooperative caching methods can make use of unoccupied storage space of nodes to cache popular videos in the future [12, 13]. The prefetching methods enable the nodes prestore the watched videos with high probability in the future, which reduces startup delay of request nodes and ensures smooth playback [14, 15]. The compelling caching assignment methods make use of the available storage resources to implement caching optimization in terms of variation of video distribution [16–21]. The social-based resource scheduling methods further promote resource sharing performance by cache integration in terms of social relationship [22–25]. However, the above methods do not efficiently address the negative influence caused by demand variation and node mobility for balance stability of video distribution, which results in low-efficiency scheduling and high-cost management [26]. In fact, user interest for video content is the determining factor for requesting or removing a video. The interest variation drives the nodes to request the desired videos regardless of whether near-end or far-end fetching. In other words, if the requested videos cannot be met by geographical adjacent video providers, the requesters also search geographical far providers, which increase delay of video lookup and transmission. Moreover, when the nodes lose interest for videos in local buffer, they remove the videos in order to cache interested videos. Obviously, variation of node interest is an important influence factor for balance stability of video distribution. On the other hand, the mobile nodes carry the own video resources and move from a geographical area to anther geographical area, which also causes variation of video distribution. A key issue for promotion of video sharing performance in wireless mobile networks is how to address the problems caused by interest variation and node mobility.In this paper, we propose a novel video sharing solution based on Demand-aware Resource Caching Optimization in wireless mobile networks (VDRCO). By making use of the epidemic model, VDRCO models video dissemination process in overlay networks and analyzes the four influence factors for video dissemination and distribution: number and influence of initial providers and attraction and number of disseminated videos. The influence of initial providers and the attraction of disseminated videos bring severe influence for user demand. The number of initial providers and disseminated videos influences resource distribution in the process of video dissemination. Based on the above analysis, VDRCO designs the two measurement methods for user demand and video distribution variation. By clustering the nodes in terms of interaction frequency and similarity of interest and mobility, VDRCO further designs a video sharing strategy to promote efficiency of near-end video sharing based on the measurement results of user demand and video distribution variation. Simulation results show that VDRCO can obtain much better performance of video delivery in comparison with a state-of-the-art solution.


## 2. Related Work

Recently, many studies employ caching and scheduling methods to improve resource distribution and delivery. For instance, the asymmetric cooperative resource caching approach proposed in [13] enables the nodes to build cache layer, so that request and response of data are transmitted to the cache layer, which efficiently reduces overhead of data copying and decreases end-to-end transmission delay. In [14], Kozat et al. designed the three cache mechanisms in P2P-based systems: (1) cache prefetching: the peers prefetch all content even if the content is not desired; (2) opportunistic cache update: if a cached content is last in local buffer, the peers can replace the content; (3) hybrid scheme composed of the above two strategies, which can efficiently reduce the server load. In [16], Tan and Massoulié designed the caching strategies in P2P system based on the two scenarios: (1) pure P2P network and (2) distributed server networks. In pure P2P network, each peer assigns one cache slot for the most popular content and the remaining cache slots are assigned for the more popular content. In distributed server networks, the peers randomly cache content according to the overall popularity distribution and switch out content from cache space with uniformly probability. In [18], a commercial caching system is designed, which includes a video retailer (VR) and multiple network service providers (NSPs). By caching popular videos in the rented SBSs, the VR leases small-cell base stations (SBS) of NSPs to provide better local video services to the mobile users. In [19], Mokhtarian and Jacobsen designed the four algorithms: (1) a flexible ingress-efficient algorithm; (2) an offline caching algorithm based on awareness of future requests; (3) an optimal offline caching algorithm; (4) an adaptive ingress control algorithm, handling the demand for content caching on the servers of CDNs. In [20], a cache replacement method, Trend-Caching, is proposed, which optimizes caching performance according to the popularity trends of video content. Trend-Caching makes the decision of caching and removing videos in terms of popularity trend of video content, which achieves fast convergence and improves cache hit rate.In order to further promote resource sharing performance, massive researchers have leveraged other technologies, such as the social network, to improve efficiency of resource caching and scheduling. For instance, in [22], SAVE considers channel switching as the interactions between channels and clusters channels with high-frequency interactions. SAVE builds contacts between channels with high-frequency and low-frequency interactions, which enables the nodes to stay in the same channel clusters or makes use of interchannel contacts to join a new channel instead of accessing server. The nodes also make use of the maintained friend lists to record common-interest channels and watching time shared by nodes, which achieves fast channel switching and reduces server load. Zhang et al. designed a resource prefetching strategy for video services based on online social network [24]. Because the popular videos are watched with high probability, the nodes can prefetch prefix chunks of popular videos, which reduce startup delay and achieves smooth playback. In [23], social-P2P groups nodes with common interests and close social relationship into a cluster by investigation of social interests and relationships in social network. Furthermore, the relatively stable nodes in each cluster also are clustered in terms of the Distributed Hash Table (DHT). When any node requests video content, it sends request message to content providers by making use of the DHT structure, which improves lookup success rate and reduces lookup delay.Moreover, some resource caching methods in new network architecture such as Content-Centric Networks (CCNs) and Information-Centric Networks (ICNs) are proposed. In [27], CodingCache makes use of network coding and random forwarding to support multipath routing in CCNs and improve diversity of cached content along different paths, which increases cache hit rate with reasonable cache privacy. Si et al. investigated the use of harvested bands for caching video contents closed to the interested nodes [28], in order to improve the performance of video distribution. Based on transforming the allocation of harvested bands (a Markov decision process) into a partially observable Markov decision process and a multiarmed bandit formulation, a spectrum management mechanism is designed, which improves efficiency of proactive video caching and spectrum utilization.


## 3. Model of Video Dissemination

The management for video resources cached by nodes in overlay networks focuses on achieving optimal video distribution to support high-efficiency video sharing. The local balance between supply and demand of videos is an important characteristic of optimal video distribution. For instance, when a nodeni always can find the video providers which cache the requested video from one-hop neighbor nodes of ni, the one-hop neighbor relationship can minimize the number of forwarding request message and video data, which ensures low delay of video lookup and transmission and reduces risk of video data loss. Obviously, the local balance between supply and demand of videos can efficiently support near-end video fetching (e.g., the above one-hop video fetching) to promote video sharing performance.The maintenance for stability of local balance of video resources in wireless mobile nodes is a significant challenge. This is as interest variation and node mobility bring severely negative influence for local balance of video resources. For instance, a nodeni has watched all videos cached in one-hop neighbor nodes of ni, so that ni loses interests for videos with high probability. In the other words, ni does not request videos which have been watched and may fetch new videos from other nodes instead of one-hop neighbor nodes. Obviously, the interest variation results in imbalance of video distribution. On the other hand, because the mobile nodes are the carriers of video resources, the node mobility makes the video resources move in geographical area, which also results in variation of video distribution in geographical area. The maintenance for stability of local balance needs continuous adjustment (caching new videos and removing old videos) in terms of interest variation and node mobility. The variation of user interests can change the number of available resources in video systems, which determines the performance of video lookup. The node mobility only leads to the variation of geographical distribution of video resources instead of changing total amount of available video resources, which determines the performance of video delivery.


### 3.1. Construction of Video Dissemination Model

For convenience, several notations used in sections are defined in Notations (notations used by models). The video distribution is continuous variation in the whole process of video dissemination. This is as the video dissemination process has obvious periodicity. When a new videovi appears in overlay networks, the nodes have potential interest for vi. Some nodes cache vi and push vi to other contacted nodes, which increases the range and speed of dissemination of vi. At the moment, number of cached vi in overlay networks fast increases. When the most of nodes have watched vi, they lose the interests for vi and remove vi in local buffer in terms of their storage capacity. The number of cached vi in overlay networks fast decreases. Therefore, the video dissemination process can be influenced by variation of user interests instead of the node mobility. The initial providers of vi act as the infected nodes. The nodes interested in vi are considered as the susceptible nodes. The nodes which have watched vi are considered as the immune nodes. In the process of video dissemination, the susceptible nodes actively send request messages to search vi (pull mode) and the initial providers send the advertisement messages to push vi for other nodes (push mode). The two modes of pull and push enable vi to be spread in overlay networks. Therefore, the dissemination process of vi follows the epidemic model [29]. N is the total number of nodes in overlay networks. N=NS+NI+NR, where NS is the number of nodes interested in vi; NI is the number of nodes which have cached vi; NR is the number of nodes which have been uninterested in vi and have removed vi in local buffer. S=NS/N, I=NI/N, and R=NR/N denote the ratio between NS, NI, NR, and N, respectively. At the time t, S, I, and R meet the equation St+Rt+It=1 and the dissemination model of vi can be defined as(1)dIdt=λSI-μI,dSdt=-λSI,dRdt=μI,where λ and μ are the increasing rate of nodes which request and remove vi, respectively. If the content of vi is wonderful, the probability of requesting vi for nodes in overlay networks is high. If the nodes which have cached vi have strong influence level for other nodes, the pushed vi is accepted with high probability. Therefore, the wonderful content and strong influence level of push nodes make the value of λ keep high levels, so that vi can be fast disseminated to the whole overlay networks (the value of I also keeps fast increase). If the nodes cached in vi have watched vi, they lose the interests for vi and remove vi in local buffer, so that the values of μ also keep high levels (the value of R fast increases).


### 3.2. Analysis for Video Distribution Variation

We further describe variation process ofλ and μ to discuss the variation of distribution of vi.(1)
Initially, because the number of initial providers is less and there are some nodes which are uninterested invi in overlay networks, the dissemination rate of vi is low and the value of λ slowly increases. At the moment, because the nodes which cache vi do not finish the playback for vi, the value of μ is 0.(2)
With the increase in the dissemination time, if the content ofvi is wonderful, the large amount of nodes make use of pull mode to request and cache vi; if the nodes which have cached vi have strong influence level for other nodes, the pushed vi easily is accepted. The value of λ fast increases and reaches the peak. At the moment, because some nodes have watched vi and lose the interests for vi, they remove vi in local buffer. The value of μ keeps the increase trend.(3)
When the increment of number of nodes interested invi decreases, the value of λ decreases. At the moment, because the large amount of nodes have watched vi and remove vi, the value of μ fast increases and reaches the peak.(4)
When the number of nodes interested invi keeps relatively stable at the later stage of dissemination process, the value of λ keeps low level. Because the number of nodes which remove vi decreases, the value of μ fast decreases and also keeps low level.(5)
Finally, when all nodes finish the playback and removevi, the values of I and S are 0, respectively (the values of λ and μ are 0). In fact, the number of nodes in overlay networks always keeps dynamic variation in the real video services. The new mobile nodes join into the video systems, so the values of I and S always keep slight fluctuation in the reasonable range.If the nodes finish the playback and immediately removevi, the values of λ and μ have the same variation process. If the nodes finish the playback and do not immediately remove vi in order to serve other request nodes, the values of μ have longer and more moderate variation process than those of λ. In fact, we only consider the latter case in terms of the characteristic of resource sharing with each other in MP2P-based video systems.On the other hand, the values ofλ and μ reflect the variation levels of distribution of vi. The attraction of video content and the influence of providers are the two impact factors for the values of λ and μ and variation of user interests. For instance, the two nodes are interested in the NBA and frequently share related videos with each other. If a node pushes videos of the CBA to another node, the latter may accept the pushed videos with high probability. However, if a node pushes videos of the World Cup to another node, the latter may reject the pushed videos with high probability. This is as the pushed videos go beyond the demand (interest) ranges of the latter (the latter is immune for the pushed videos). The wonderful video content can attract large amount of nodes and the high-level influence of providers increases the probability of push success, which speeds up the video dissemination. As we know, the fast dissemination can increase the provision of available resources to reduce startup delay of request nodes caused by shortage of resources. In order to efficiently improve rate and range of video dissemination, a key issue is how to be aware of user demand and select appropriate push nodes.Except for attraction of video content and influence of providers, number of initial providers and number of disseminated videos are the two influence factors for the dissemination process. The large amount of initial providers not only ensures enough provision of available resources but also increases the value ofλ due to extension of push range. Moreover, the dissemination of multiple videos in overlay networks not only leads to the fast change of user interests but also causes the competition for bandwidth and storage resources of nodes. For instance, the small number of new videos lengthens the process of video dissemination. This is as the nodes do not fast lose the interests for the existing videos in overlay networks. The content providers do not eagerly remove vi to fetch new videos due to limited storage space. Otherwise, if the massive new videos appear in overlay networks, the nodes continually request more interested videos, which reduce the stay time of vi in local buffer of content providers. This speeds up the convergence of process of video dissemination, which results in the fast variation of distribution of vi. Therefore, in order to improve video sharing performance, the management and scheduling of video resources need to consider awareness of user demand, selection of push nodes in terms of estimation of common interests between nodes, and monitoring of variation level of video distribution.


## 3.1. Construction of Video Dissemination Model

For convenience, several notations used in sections are defined in Notations (notations used by models). The video distribution is continuous variation in the whole process of video dissemination. This is as the video dissemination process has obvious periodicity. When a new videovi appears in overlay networks, the nodes have potential interest for vi. Some nodes cache vi and push vi to other contacted nodes, which increases the range and speed of dissemination of vi. At the moment, number of cached vi in overlay networks fast increases. When the most of nodes have watched vi, they lose the interests for vi and remove vi in local buffer in terms of their storage capacity. The number of cached vi in overlay networks fast decreases. Therefore, the video dissemination process can be influenced by variation of user interests instead of the node mobility. The initial providers of vi act as the infected nodes. The nodes interested in vi are considered as the susceptible nodes. The nodes which have watched vi are considered as the immune nodes. In the process of video dissemination, the susceptible nodes actively send request messages to search vi (pull mode) and the initial providers send the advertisement messages to push vi for other nodes (push mode). The two modes of pull and push enable vi to be spread in overlay networks. Therefore, the dissemination process of vi follows the epidemic model [29]. N is the total number of nodes in overlay networks. N=NS+NI+NR, where NS is the number of nodes interested in vi; NI is the number of nodes which have cached vi; NR is the number of nodes which have been uninterested in vi and have removed vi in local buffer. S=NS/N, I=NI/N, and R=NR/N denote the ratio between NS, NI, NR, and N, respectively. At the time t, S, I, and R meet the equation St+Rt+It=1 and the dissemination model of vi can be defined as(1)dIdt=λSI-μI,dSdt=-λSI,dRdt=μI,where λ and μ are the increasing rate of nodes which request and remove vi, respectively. If the content of vi is wonderful, the probability of requesting vi for nodes in overlay networks is high. If the nodes which have cached vi have strong influence level for other nodes, the pushed vi is accepted with high probability. Therefore, the wonderful content and strong influence level of push nodes make the value of λ keep high levels, so that vi can be fast disseminated to the whole overlay networks (the value of I also keeps fast increase). If the nodes cached in vi have watched vi, they lose the interests for vi and remove vi in local buffer, so that the values of μ also keep high levels (the value of R fast increases).


## 3.2. Analysis for Video Distribution Variation

We further describe variation process ofλ and μ to discuss the variation of distribution of vi.(1)
Initially, because the number of initial providers is less and there are some nodes which are uninterested invi in overlay networks, the dissemination rate of vi is low and the value of λ slowly increases. At the moment, because the nodes which cache vi do not finish the playback for vi, the value of μ is 0.(2)
With the increase in the dissemination time, if the content ofvi is wonderful, the large amount of nodes make use of pull mode to request and cache vi; if the nodes which have cached vi have strong influence level for other nodes, the pushed vi easily is accepted. The value of λ fast increases and reaches the peak. At the moment, because some nodes have watched vi and lose the interests for vi, they remove vi in local buffer. The value of μ keeps the increase trend.(3)
When the increment of number of nodes interested invi decreases, the value of λ decreases. At the moment, because the large amount of nodes have watched vi and remove vi, the value of μ fast increases and reaches the peak.(4)
When the number of nodes interested invi keeps relatively stable at the later stage of dissemination process, the value of λ keeps low level. Because the number of nodes which remove vi decreases, the value of μ fast decreases and also keeps low level.(5)
Finally, when all nodes finish the playback and removevi, the values of I and S are 0, respectively (the values of λ and μ are 0). In fact, the number of nodes in overlay networks always keeps dynamic variation in the real video services. The new mobile nodes join into the video systems, so the values of I and S always keep slight fluctuation in the reasonable range.If the nodes finish the playback and immediately removevi, the values of λ and μ have the same variation process. If the nodes finish the playback and do not immediately remove vi in order to serve other request nodes, the values of μ have longer and more moderate variation process than those of λ. In fact, we only consider the latter case in terms of the characteristic of resource sharing with each other in MP2P-based video systems.On the other hand, the values ofλ and μ reflect the variation levels of distribution of vi. The attraction of video content and the influence of providers are the two impact factors for the values of λ and μ and variation of user interests. For instance, the two nodes are interested in the NBA and frequently share related videos with each other. If a node pushes videos of the CBA to another node, the latter may accept the pushed videos with high probability. However, if a node pushes videos of the World Cup to another node, the latter may reject the pushed videos with high probability. This is as the pushed videos go beyond the demand (interest) ranges of the latter (the latter is immune for the pushed videos). The wonderful video content can attract large amount of nodes and the high-level influence of providers increases the probability of push success, which speeds up the video dissemination. As we know, the fast dissemination can increase the provision of available resources to reduce startup delay of request nodes caused by shortage of resources. In order to efficiently improve rate and range of video dissemination, a key issue is how to be aware of user demand and select appropriate push nodes.Except for attraction of video content and influence of providers, number of initial providers and number of disseminated videos are the two influence factors for the dissemination process. The large amount of initial providers not only ensures enough provision of available resources but also increases the value ofλ due to extension of push range. Moreover, the dissemination of multiple videos in overlay networks not only leads to the fast change of user interests but also causes the competition for bandwidth and storage resources of nodes. For instance, the small number of new videos lengthens the process of video dissemination. This is as the nodes do not fast lose the interests for the existing videos in overlay networks. The content providers do not eagerly remove vi to fetch new videos due to limited storage space. Otherwise, if the massive new videos appear in overlay networks, the nodes continually request more interested videos, which reduce the stay time of vi in local buffer of content providers. This speeds up the convergence of process of video dissemination, which results in the fast variation of distribution of vi. Therefore, in order to improve video sharing performance, the management and scheduling of video resources need to consider awareness of user demand, selection of push nodes in terms of estimation of common interests between nodes, and monitoring of variation level of video distribution.


## 4. VDRCO Detailed Design

As we know, the optimal video distribution can improve resources sharing performance of video systems and reduce delay of video lookup and delivery. The accurate awareness for user demand and distribution variation level is significant for optimization of video distribution. The awareness for user demand enables the video systems to be aware of caching what resources. The awareness for distribution variation level enables the video systems to be aware of period time of scheduling resources.


### 4.1. Awareness of User Demand

When the users are interested in videos, they send request messages to fetch and cache the requested videos. Obviously, the requested videos can embody the interests of users and the interest range of users is limited. For instance, a user has the highest interest level for the NBA-related videos among all videos. The user pays more time to search and watch the NBA-related videos. On the other hand, because the users may push some interested videos to other users, the pushed videos also reflect the interests levels of users. Therefore, the videos which are watched for a long time or are pushed by users can represent the interest of users. The interest range can be considered as demand range of users.In order to accurately measure the interest range, we cluster the videos watched by users and define the interest range in terms of the interest levels of users for videos. The set of clustered videos is considered as the interest range of users. LetSvni denote the set of watched videos of ni. The similarity Sjk between any two videos vj∈Sv(ni) and vk∈Sv(ni) can be calculated according to our previous work [30]. If Sjk is the largest among the similarity values between vk and other items in Svni, vj and vk form a new video subset Ssubj=vj,vk, as Figure 2(a) shows. Similarly, if Shk denotes the similarity between vh∈Svni and vk∈Svni and Shk is larger than the similarity values between vh and other items in Svni, vh joins into Ssubj, as Figure 2(b) shows. After the iteration of video clustering, the items in Svni are grouped into several video subsets; namely, Svni=Ssuba,Ssubb,…,Ssubj, as Figure 2(c) shows. Because any video in each subset Ssubj only has a similarity value with another video in Ssubj, all items in Ssubj can be ranked in terms of the ascending similarity; namely, Ssubj=va,vb,…,vj. In fact, the video subsets may include many noise items. For instance, vs∈Ssubj and the similarity value Ssk between vs and vk is larger than the values between vs and other items in Svni. If the value of Ssk is very small and the similarity values between vs and other items in Ssubj are also very small, vs is unsuitable to become the member in Ssubj; namely, vs is a noise item in Ssubj. This is as the above video clustering only considers the similarity between vs and vk and neglects the similarity between vs and other items in Ssubj. In order to remove the noise items in video subsets, we firstly calculate the average value of similarity among all items in Ssubj according to the following equation:(2)S¯Ssubj=∑c=1Ssubj∑e=1Ssubj-1SceSsubjSsubj-1,S¯Ssubj∈0,1,where Ssubj returns the number of items in Ssubj. The initial average value of similarity among items in Ssubj is defined as S¯Ssubj1. Because all items in Ssubj have been ranked in terms of the ascending similarity and va is first item with minimum similarity, va is removed from Ssubj and other items form a new set Ssubj2. The average value of similarity among all items in Ssubj2 is recalculated according to (2); namely S¯Ssubj2. If S¯Ssubj2<S¯Ssubj1, va is not a noise item and is readded to Ssubj2. Otherwise, if S¯Ssubj2>S¯Ssubj1, va is considered as a noise item. Although the similarity value between va and another item in Ssubj is high, va may have the low similarity with other items in Ssubj. Therefore, when va is removed, the average value of similarity in Ssubj2 increases. After making the decision of retaining or removing va, Ssubj2 continues to remove vb. Other items in Ssubj2 form a new subset Ssubj3. If S¯(Ssubj)3>S¯(Ssubj)2, vb is a noise item. Otherwise, if S¯Ssubj3<S¯Ssubj2, vb is not a noise item and is readded to Ssubj2. By iteration of the above process, the noise videos in Ssubj are removed, as Figure 2(d) shows. Similarly, the noise items in all video subsets can be removed and form a new video subset. We continue to cluster and refine items in subset composed of noise videos according to the above process. The condition of convergence is that each noise video forms a subset.Figure 2
Estimation of interest range.
(a) (b) (c) (d)In order to extract the demand regions ofni from the video subsets, we firstly make use of the watched time and pushed frequency to estimate the interest level for any video vj according to the following equation:(3)Iivj=αlivjLi+βfivjFi,α,β∈0,1,where livj is the watched time of a node ni for vj; Li is the total playback time of ni for all watched videos; fivj is the pushed frequency of ni for vj; Fi is the total push frequency of ni for all watched videos. α and β are the weight values of watched time and push frequency, respectively, and α+β=1. Therefore, the value of Iivj is in the range [0,1]. If a video vj∈Ssubj has the highest interest level among all items in Ssubj, vj acts as the deputy video of Ssubj. Each video subset Ssubj has an average value of interest level according to the following equation:(4)I¯Ssubj=∑c=1SsubjIivcSsubj.Further, the average value of interest level of all items inSvni can be defined as(5)I¯Svni=∑c=1SvniI¯SsubjSvni,where Svni returns the number of video subsets included in Svni. If the value of I¯Ssubj is greater than I¯Svni, Ssubj is considered as a demand region of ni. Therefore, the set of demand regions can be defined as Di=d1,d2,…,dk. When ni requests and watches a new video vd, the similarity between vd and deputy videos in all demand regions is calculated. If the similarity between vd and a deputy video vj in Ssubj is the largest similarity among all deputy videos, vd is added to Ssubj. By the purification for the subset, if vd is a noise video, the similarity values between vd and all noise videos are calculated. vd is added to the video subset corresponding to the noise video which has the largest similarity; otherwise, if vd is not a noise video, it stays in Ssubj.


### 4.2. Awareness of Variation Level of Video Distribution

When the nodes want to watch new videos and the local buffer is full, they remove the videos which have been watched. The replacement of cached videos in local buffer of nodes directly results in the variation of video distribution in overlay networks. The stay time of cached videos in local buffer is an important factor for the measurement of replacement. For instance, when a request nodenj wants to watch a video vk, it sends the request message in overlay networks and waits for the returned video data. If a video provider ni stores vk and receives the request message of nj, it needs to transmit video data to nj and cannot remove vk in local buffer. In other words, the more the number of received request messages is, the longer the stay time of cached videos is. Obviously, the period time of video dissemination is the impact factor for stay time. The time of downloading vk from ni can be defined as(6)TRivk=sizekB¯i1-P¯i,where sizek is the size of vk; B¯i and P¯i are the average values of bandwidth and packet loss rate of ni in the process of transmission. We assume that the video providers remove vk in local buffer when they do not receive the request messages during a short period time Δt. If the number of request messages received by ni is NRi during a period time ta<NRi×TRi(vk), the stay time of vk in local buffer of ni is NRi×TRivk+Δt. If B¯i is equal to the playback rate of requesters, the transmission time of vk is equal to the playback time of requesters. If the number of requesters and providers is NRk and NPk for vk during the period time tb-ta, respectively, and NRk<NPk, the NRk video requesters cache and watch vk and also become video providers of vk. The number of cached vk in networks is 2×NRk and the number of vk removed by providers is NPk-NRk. This is as the NPk-NRk providers do not receive the request messages for vk. The variation level of vk distribution during tb-ta is defined as VLk=NRk/NPk-NRk.On the other hand, the push between nodes also drives the video dissemination except for the video request. For instance, a providerni stores a video vk and pushes vk to another node nj. If nj accepts the pushed vk, it returns an acknowledgement message to ni and receives the video data from ni. Otherwise, if nj is uninterested in vk, it neglects the pushed vk. The push success rate also is an important factor for period time of video dissemination. If the number of successful push for vk during the period time tb-ta of video dissemination is NUk, the variation level of vk distribution during tb-ta is defined as VLk=NRk+NUk/NPk-NRk-NUk, where NPk>NRk+NUk. Obviously, NRk+NUk/tb-ta and NPk-NRk-NUk/tb-ta denote the increase and decrease rate of vk, respectively (λ=NRk+NUk/tb-ta and μ=NPk-NRk-NUk/tb-ta). The variation level of video distribution can be defined as VLk=λ/μ.


### 4.3. Video Sharing Strategy

Based on the awareness results for user demand and distribution variation level, the video systems make use of video caching and scheduling to optimize distribution and achieve high-efficiency sharing in the process of video dissemination. For instance, if the two nodesni and nj frequently share cached videos with each other, ni/nj pushes videos which may be interested by nj/ni in terms of results of demand awareness, which increases probability of push success. When their video demand is out of original range and has high variation level, they can adjust cached videos in local buffer to maintain the stability of balance of video supply and demand between them. Moreover, if the nodes have similar demand and are clustered into a node set, the similar demand ensures the videos cached by them can meet the requirement with each other. The nodes in the same set share cached videos and adjust local cached videos according to variation of demand and cached resources in the set, which achieves balance between supply and demand in the whole overlay networks.On the other hand, the construction of logical links between items in node sets relies on similarity level of demand and does not consider the factor of their geographical location. The adjacent geographical location between video providers and requesters can reduce number of relay nodes in the path of data transmission, which decreases delay of data transmission and probability of data loss and relieves traffic load of networks. The mobility results in dynamic geographical location of nodes, which brings severely negative influence for video delivery. For instance, the one-hop data transmission between requesters and providers may become multihop transmission with the continuous movement. The estimation of mobility similarity between nodes can measure the stability of relative distance between nodes. The construction of node sets (clustering nodes in overlay networks) needs to investigate similarity of demand and mobility of nodes, which achieves local balance between video supply and demand in geographical area.We investigate the interaction (push and pull) between nodes to estimate similarity of demand. The high-frequency and successful interaction denotes that the nodes can meet the demand for the videos with each other, which increases lookup success rate and reduces lookup delay. The total number of interaction between any two nodesni and nj is defined as(7)Fij=fipush+fjpush+fipull+fjpull,where fipush and fipull are the number of videos pushed and requested by ni for nj; fjpush and fjpull are the number of videos pushed and requested by nj for ni. The accepted video push and the successful response for the video request are considered the successful interaction. IRij=Fijs/Fij denotes the interaction success rate where Fijs is the number of successful interaction. The higher the value of IRij is, the more efficient the video dissemination is. Moreover, the high-frequency interaction and high interaction success rate also reflect the closeness and stability of relationship between nodes. The close and stable relationship between nodes avoids the frequent message exchange to fetch state information with each other such as cached videos, which reduces the energy consumption of mobile nodes caused by huge message overhead.Because the mobile nodes have low capacity in bandwidth, computation, storage, and energy, they difficultly bear the load for the estimation of mobility similarity with each other in large geographic areas. We investigate the stability of one-hop neighbor relationship between nodes to estimate their mobility similarity. The estimation of mobility similarity in small geographic areas can reduce the load of mobile nodes. If the two nodes have one-hop neighbor relationship at the timeta, the two nodes are considered as encounter at ta. The more the number of encounter is, the longer the period time of stable one-hop neighbor relationship is. The stability st of one-hop relationship between nodes can be estimated according to our previous work [31]. Therefore, the relationship level between any two nodes ni and nj can be defined as(8)GRij=IRij×1-arccot⁡stijπ.Because the values ofstij are in the range -∞,+∞, the values of 1-arccot⁡stij/π are in the range [0,1] and GRij∈[0,1]. Any node ni records the information of nodes which encountered ni and interacted with ni and builds a node set GNi. ni estimates the relationship level with all items in GNi according to (8). We cluster the nodes in overlay networks into multiple node subsets by employing the above demand region construction method in Section 4.1. If nj has the highest relationship level with ni among GNi, ni and nj form a node set GSj. If another node nk also has the highest relationship level with nj among items in GNk, nk joins into GSj. After the iteration of the above clustering process, the built node subsets continue to remove the noise nodes according to the variation of average values of relationship between nodes in subsets. Finally, the nodes in overlay networks are grouped into multiple node subsets; namely, NS=GS1,GS2,…,GSn. The nodes in the same subsets are aware of the deputy videos corresponding to demand regions with each other by periodical exchange of messages.The nodes preferentially send request messages for the videos to members in the same subsets. Beforeni requests a video vk, it firstly calculates the similarity between vk and deputy videos of other nodes in current subset; namely, LSi=Sak,Sbk,…,Snk, where Sak denotes the similarity value between va and vk. If the similarity between the deputy video vh and vk is the largest among all deputy videos and a node nj in current subset stores vh, ni sends the request message to nj. If nj also stores vk in local buffer, nj directly returns an acknowledge message and transmits data of vk for ni. Otherwise, if nj does not store vk, it returns a lookup failure message to ni. ni uses a threshold Thri to filter some items in LSi. If the similarity values between vk and items in LSi is greater than Thri, these deputy videos are marked as the selected videos. ni sends the request messages to the nodes which cache the selected videos except for nj. If these nodes store vk, they return the acknowledge messages to ni and ni selects a node as the provider. Otherwise, if these nodes do not store vk, ni broadcasts the request message in the whole network after receiving the lookup failure messages.On the other hand, because the nodes can be aware of number of request forvk and number of nodes which cache vk in subsets by message exchange, they estimate the variation level VLk of distribution for vk during a period time. If VLk is the minimum value among the variation levels of all videos in current subset, vk can be preferentially removed in local buffer of nodes after a period time Δt. Otherwise, if VLk is not the minimum value among the variation levels of all videos in current subset and the nodes carrying vk do not receive the request message during a period time 1+VLkΔt, these carriers can remove vk from their local buffer.


## 4.1. Awareness of User Demand

When the users are interested in videos, they send request messages to fetch and cache the requested videos. Obviously, the requested videos can embody the interests of users and the interest range of users is limited. For instance, a user has the highest interest level for the NBA-related videos among all videos. The user pays more time to search and watch the NBA-related videos. On the other hand, because the users may push some interested videos to other users, the pushed videos also reflect the interests levels of users. Therefore, the videos which are watched for a long time or are pushed by users can represent the interest of users. The interest range can be considered as demand range of users.In order to accurately measure the interest range, we cluster the videos watched by users and define the interest range in terms of the interest levels of users for videos. The set of clustered videos is considered as the interest range of users. LetSvni denote the set of watched videos of ni. The similarity Sjk between any two videos vj∈Sv(ni) and vk∈Sv(ni) can be calculated according to our previous work [30]. If Sjk is the largest among the similarity values between vk and other items in Svni, vj and vk form a new video subset Ssubj=vj,vk, as Figure 2(a) shows. Similarly, if Shk denotes the similarity between vh∈Svni and vk∈Svni and Shk is larger than the similarity values between vh and other items in Svni, vh joins into Ssubj, as Figure 2(b) shows. After the iteration of video clustering, the items in Svni are grouped into several video subsets; namely, Svni=Ssuba,Ssubb,…,Ssubj, as Figure 2(c) shows. Because any video in each subset Ssubj only has a similarity value with another video in Ssubj, all items in Ssubj can be ranked in terms of the ascending similarity; namely, Ssubj=va,vb,…,vj. In fact, the video subsets may include many noise items. For instance, vs∈Ssubj and the similarity value Ssk between vs and vk is larger than the values between vs and other items in Svni. If the value of Ssk is very small and the similarity values between vs and other items in Ssubj are also very small, vs is unsuitable to become the member in Ssubj; namely, vs is a noise item in Ssubj. This is as the above video clustering only considers the similarity between vs and vk and neglects the similarity between vs and other items in Ssubj. In order to remove the noise items in video subsets, we firstly calculate the average value of similarity among all items in Ssubj according to the following equation:(2)S¯Ssubj=∑c=1Ssubj∑e=1Ssubj-1SceSsubjSsubj-1,S¯Ssubj∈0,1,where Ssubj returns the number of items in Ssubj. The initial average value of similarity among items in Ssubj is defined as S¯Ssubj1. Because all items in Ssubj have been ranked in terms of the ascending similarity and va is first item with minimum similarity, va is removed from Ssubj and other items form a new set Ssubj2. The average value of similarity among all items in Ssubj2 is recalculated according to (2); namely S¯Ssubj2. If S¯Ssubj2<S¯Ssubj1, va is not a noise item and is readded to Ssubj2. Otherwise, if S¯Ssubj2>S¯Ssubj1, va is considered as a noise item. Although the similarity value between va and another item in Ssubj is high, va may have the low similarity with other items in Ssubj. Therefore, when va is removed, the average value of similarity in Ssubj2 increases. After making the decision of retaining or removing va, Ssubj2 continues to remove vb. Other items in Ssubj2 form a new subset Ssubj3. If S¯(Ssubj)3>S¯(Ssubj)2, vb is a noise item. Otherwise, if S¯Ssubj3<S¯Ssubj2, vb is not a noise item and is readded to Ssubj2. By iteration of the above process, the noise videos in Ssubj are removed, as Figure 2(d) shows. Similarly, the noise items in all video subsets can be removed and form a new video subset. We continue to cluster and refine items in subset composed of noise videos according to the above process. The condition of convergence is that each noise video forms a subset.Figure 2
Estimation of interest range.
(a) (b) (c) (d)In order to extract the demand regions ofni from the video subsets, we firstly make use of the watched time and pushed frequency to estimate the interest level for any video vj according to the following equation:(3)Iivj=αlivjLi+βfivjFi,α,β∈0,1,where livj is the watched time of a node ni for vj; Li is the total playback time of ni for all watched videos; fivj is the pushed frequency of ni for vj; Fi is the total push frequency of ni for all watched videos. α and β are the weight values of watched time and push frequency, respectively, and α+β=1. Therefore, the value of Iivj is in the range [0,1]. If a video vj∈Ssubj has the highest interest level among all items in Ssubj, vj acts as the deputy video of Ssubj. Each video subset Ssubj has an average value of interest level according to the following equation:(4)I¯Ssubj=∑c=1SsubjIivcSsubj.Further, the average value of interest level of all items inSvni can be defined as(5)I¯Svni=∑c=1SvniI¯SsubjSvni,where Svni returns the number of video subsets included in Svni. If the value of I¯Ssubj is greater than I¯Svni, Ssubj is considered as a demand region of ni. Therefore, the set of demand regions can be defined as Di=d1,d2,…,dk. When ni requests and watches a new video vd, the similarity between vd and deputy videos in all demand regions is calculated. If the similarity between vd and a deputy video vj in Ssubj is the largest similarity among all deputy videos, vd is added to Ssubj. By the purification for the subset, if vd is a noise video, the similarity values between vd and all noise videos are calculated. vd is added to the video subset corresponding to the noise video which has the largest similarity; otherwise, if vd is not a noise video, it stays in Ssubj.


## 4.2. Awareness of Variation Level of Video Distribution

When the nodes want to watch new videos and the local buffer is full, they remove the videos which have been watched. The replacement of cached videos in local buffer of nodes directly results in the variation of video distribution in overlay networks. The stay time of cached videos in local buffer is an important factor for the measurement of replacement. For instance, when a request nodenj wants to watch a video vk, it sends the request message in overlay networks and waits for the returned video data. If a video provider ni stores vk and receives the request message of nj, it needs to transmit video data to nj and cannot remove vk in local buffer. In other words, the more the number of received request messages is, the longer the stay time of cached videos is. Obviously, the period time of video dissemination is the impact factor for stay time. The time of downloading vk from ni can be defined as(6)TRivk=sizekB¯i1-P¯i,where sizek is the size of vk; B¯i and P¯i are the average values of bandwidth and packet loss rate of ni in the process of transmission. We assume that the video providers remove vk in local buffer when they do not receive the request messages during a short period time Δt. If the number of request messages received by ni is NRi during a period time ta<NRi×TRi(vk), the stay time of vk in local buffer of ni is NRi×TRivk+Δt. If B¯i is equal to the playback rate of requesters, the transmission time of vk is equal to the playback time of requesters. If the number of requesters and providers is NRk and NPk for vk during the period time tb-ta, respectively, and NRk<NPk, the NRk video requesters cache and watch vk and also become video providers of vk. The number of cached vk in networks is 2×NRk and the number of vk removed by providers is NPk-NRk. This is as the NPk-NRk providers do not receive the request messages for vk. The variation level of vk distribution during tb-ta is defined as VLk=NRk/NPk-NRk.On the other hand, the push between nodes also drives the video dissemination except for the video request. For instance, a providerni stores a video vk and pushes vk to another node nj. If nj accepts the pushed vk, it returns an acknowledgement message to ni and receives the video data from ni. Otherwise, if nj is uninterested in vk, it neglects the pushed vk. The push success rate also is an important factor for period time of video dissemination. If the number of successful push for vk during the period time tb-ta of video dissemination is NUk, the variation level of vk distribution during tb-ta is defined as VLk=NRk+NUk/NPk-NRk-NUk, where NPk>NRk+NUk. Obviously, NRk+NUk/tb-ta and NPk-NRk-NUk/tb-ta denote the increase and decrease rate of vk, respectively (λ=NRk+NUk/tb-ta and μ=NPk-NRk-NUk/tb-ta). The variation level of video distribution can be defined as VLk=λ/μ.


## 4.3. Video Sharing Strategy

Based on the awareness results for user demand and distribution variation level, the video systems make use of video caching and scheduling to optimize distribution and achieve high-efficiency sharing in the process of video dissemination. For instance, if the two nodesni and nj frequently share cached videos with each other, ni/nj pushes videos which may be interested by nj/ni in terms of results of demand awareness, which increases probability of push success. When their video demand is out of original range and has high variation level, they can adjust cached videos in local buffer to maintain the stability of balance of video supply and demand between them. Moreover, if the nodes have similar demand and are clustered into a node set, the similar demand ensures the videos cached by them can meet the requirement with each other. The nodes in the same set share cached videos and adjust local cached videos according to variation of demand and cached resources in the set, which achieves balance between supply and demand in the whole overlay networks.On the other hand, the construction of logical links between items in node sets relies on similarity level of demand and does not consider the factor of their geographical location. The adjacent geographical location between video providers and requesters can reduce number of relay nodes in the path of data transmission, which decreases delay of data transmission and probability of data loss and relieves traffic load of networks. The mobility results in dynamic geographical location of nodes, which brings severely negative influence for video delivery. For instance, the one-hop data transmission between requesters and providers may become multihop transmission with the continuous movement. The estimation of mobility similarity between nodes can measure the stability of relative distance between nodes. The construction of node sets (clustering nodes in overlay networks) needs to investigate similarity of demand and mobility of nodes, which achieves local balance between video supply and demand in geographical area.We investigate the interaction (push and pull) between nodes to estimate similarity of demand. The high-frequency and successful interaction denotes that the nodes can meet the demand for the videos with each other, which increases lookup success rate and reduces lookup delay. The total number of interaction between any two nodesni and nj is defined as(7)Fij=fipush+fjpush+fipull+fjpull,where fipush and fipull are the number of videos pushed and requested by ni for nj; fjpush and fjpull are the number of videos pushed and requested by nj for ni. The accepted video push and the successful response for the video request are considered the successful interaction. IRij=Fijs/Fij denotes the interaction success rate where Fijs is the number of successful interaction. The higher the value of IRij is, the more efficient the video dissemination is. Moreover, the high-frequency interaction and high interaction success rate also reflect the closeness and stability of relationship between nodes. The close and stable relationship between nodes avoids the frequent message exchange to fetch state information with each other such as cached videos, which reduces the energy consumption of mobile nodes caused by huge message overhead.Because the mobile nodes have low capacity in bandwidth, computation, storage, and energy, they difficultly bear the load for the estimation of mobility similarity with each other in large geographic areas. We investigate the stability of one-hop neighbor relationship between nodes to estimate their mobility similarity. The estimation of mobility similarity in small geographic areas can reduce the load of mobile nodes. If the two nodes have one-hop neighbor relationship at the timeta, the two nodes are considered as encounter at ta. The more the number of encounter is, the longer the period time of stable one-hop neighbor relationship is. The stability st of one-hop relationship between nodes can be estimated according to our previous work [31]. Therefore, the relationship level between any two nodes ni and nj can be defined as(8)GRij=IRij×1-arccot⁡stijπ.Because the values ofstij are in the range -∞,+∞, the values of 1-arccot⁡stij/π are in the range [0,1] and GRij∈[0,1]. Any node ni records the information of nodes which encountered ni and interacted with ni and builds a node set GNi. ni estimates the relationship level with all items in GNi according to (8). We cluster the nodes in overlay networks into multiple node subsets by employing the above demand region construction method in Section 4.1. If nj has the highest relationship level with ni among GNi, ni and nj form a node set GSj. If another node nk also has the highest relationship level with nj among items in GNk, nk joins into GSj. After the iteration of the above clustering process, the built node subsets continue to remove the noise nodes according to the variation of average values of relationship between nodes in subsets. Finally, the nodes in overlay networks are grouped into multiple node subsets; namely, NS=GS1,GS2,…,GSn. The nodes in the same subsets are aware of the deputy videos corresponding to demand regions with each other by periodical exchange of messages.The nodes preferentially send request messages for the videos to members in the same subsets. Beforeni requests a video vk, it firstly calculates the similarity between vk and deputy videos of other nodes in current subset; namely, LSi=Sak,Sbk,…,Snk, where Sak denotes the similarity value between va and vk. If the similarity between the deputy video vh and vk is the largest among all deputy videos and a node nj in current subset stores vh, ni sends the request message to nj. If nj also stores vk in local buffer, nj directly returns an acknowledge message and transmits data of vk for ni. Otherwise, if nj does not store vk, it returns a lookup failure message to ni. ni uses a threshold Thri to filter some items in LSi. If the similarity values between vk and items in LSi is greater than Thri, these deputy videos are marked as the selected videos. ni sends the request messages to the nodes which cache the selected videos except for nj. If these nodes store vk, they return the acknowledge messages to ni and ni selects a node as the provider. Otherwise, if these nodes do not store vk, ni broadcasts the request message in the whole network after receiving the lookup failure messages.On the other hand, because the nodes can be aware of number of request forvk and number of nodes which cache vk in subsets by message exchange, they estimate the variation level VLk of distribution for vk during a period time. If VLk is the minimum value among the variation levels of all videos in current subset, vk can be preferentially removed in local buffer of nodes after a period time Δt. Otherwise, if VLk is not the minimum value among the variation levels of all videos in current subset and the nodes carrying vk do not receive the request message during a period time 1+VLkΔt, these carriers can remove vk from their local buffer.


## 5. Testing and Test Results Analysis

### 5.1. Testing Topology and Scenarios

The performance of the proposed solution VDRCO compares with a state-of-the-art community-based video sharing solution AMCV [32]. We use in NS-2 to model and implement the two solutions VDRCO and AMCV. The 400 mobile nodes are deployed in the 1000 × 1000 m2 area and have 200 m signal range. The mobile speed of nodes is in the range [1,20] m/s. The simulation time is set to 400 s. The data transmission protocol is UDP and the wireless routing protocol is DSR. In order to reduce the influence caused by network congestion for the simulation results, the server and the mobile nodes have 20 Mb/s and 10 Mb/s bandwidth, respectively. The transmission rate of video data (the playback rate of mobile nodes) is set to 128 kb/s.The 200 mobile nodes request videos and join the video system, which are considered as the system members. The number of video files is 30 and the length of each file is 100 s. The 200 playback logs are generated for the system members, which are used to define the requested resources and playback time of system members. After simulation startup, the system members finish the first request for the videos in terms of the playback logs following the Poisson distribution fromt= 0 s to t= 100 s. The requested resources and playback time of each system member in playback logs are randomly assigned. The number of videos requested by nodes in playback logs is 5 and the system members quit the system when they have watched all videos. The number of resources cached in each system member is 3. In VDRCO, the 200 historical playback logs are generated, which are used to estimate demand regions of the 200 system members. The historical logs of encounter and interaction of system members are generated. The system members are clustered in terms of their historical logs of encounter and interaction before the simulation. α and β are set to 0.5, respectively. The threshold Thr of all system members is set to 0.2. Δt is set to 20 s.On the other hand, the 400 movement behavior logs are generated for the 400 mobile nodes. In the movement behavior logs, the location, speed, and moving target of mobile nodes are randomly assigned. The mobile nodes move from the initial location. When the mobile nodes arrive at the assigned target, they do not stay and continue to move in terms of the new speed and moving target defined in movement behavior logs. In VDRCO, the members in node subsets are reestimated the relationship between them in terms of the new movement traces and make the selection: leaving current subset and joining new subset or staying current subset.AMCV is suitable for the performance comparison with VDRCO. AMCV has the flexible deployment strategy to implement video file sharing in wireless mobile networks. In AMCV, the nodes which request the same video chunk are grouped into a community. In the simulation, AMCV clusters the nodes which request the same video file into a community. The number of communities in AMCV is in the range(0,30]. The maintenance strategy in AMCV also is suitable for the video file sharing. (2) The sharing strategy of video chunks in AMCV is suitable for the video file sharing. We assign the ID for the 30 video files, so the communities in AMCV can build the static connections with each other. We also generated the 5000 historical playback logs which include ID of videos requested by nodes. AMCV can construct the dynamic connections between communities according to the request behaviors of nodes. α and β are also set to 0.5, respectively. PTb and PTr are set to 0.2 and 0.12, respectively. The value of UT is defined as 60 s. (3) AMCV and VDRCO make use of community-based MP2P network architecture and estimation for the video request behaviors of nodes to support high-efficiency video sharing. AMCV relies on the association relationship between videos requested by nodes to build the dynamic connections between communities and support the fast video lookup. VDRCO investigates the content similarity level between videos requested by nodes and node mobility to build the node subsets and support the video sharing between nodes in subsets. Before simulation startup, the system members also are clustered in terms of the community construction method.


### 5.2. Performance Evaluation

The performance comparison between VDRCO and AMCV includes the three aspects average startup delay (ASD), caching utilization rate, and packet loss rate (PLR).(1) ASD. Let SD=tr-tv denote the definition of startup delay. tr is the time of sending the packet containing request message at the application layer; tv is the time of receiving first packet containing video data at the application layer.Figure3 shows the variation of ASD of the two solutions VDRCO and AMCV with increasing simulation time. ASD=∑i=1m‍SDi/m denotes the average startup delay where m is the number of nodes which have finished startup during a time interval T= 20 s. The two curves corresponding to VDRCO and AMCV keep the fall trend from t= 220 s to t= 400 s after the fast rise from t= 0 s to t= 200 s. The VDRCO results fast increase from t= 0 s to t= 60 s, also keep slow rise from t= 80 s to t= 120 s, and reach the peak value at t= 220 s. The AMCV results keep relatively stable rise from t= 0 s to t= 120 s and reach the peak values at t= 220 s. Although the VDRCO results are higher than those of AMCV from t= 0 s to t= 60 s, the red curve corresponding to VDRCO is lower than that of AMCV from t= 80 s to t= 400 s and the peak value of VDRCO is less than that of AMCV.Figure 3
Average startup delay against simulation time.Figure4 shows the variation of ASD of VDRCO and AMCV with increasing number of request nodes. ASD=∑i=1m‍SDi/m also denotes the average startup delay where m is the number of nodes which have finished startup during a time interval of every 20 nodes requesting videos. The red curve corresponding to VDRCO keeps fast rise with increasing number of request nodes from 0 to 100 and also falls with increasing number of request nodes from 100 to 140. Finally, the red curve continues to keep the rise trend with increasing number of request nodes from 140 to 200. The blue curve corresponding to AMCV always fast increases in the process of the 200 request nodes joining. Although the red curve of VDRCO is higher than that of AMCV with increasing number of request nodes from 0 to 120, the VDRCO results are better than those of AMCV in the increase process of request nodes from 140 to 200.Figure 4
Average startup delay against number of request nodes.Figure5 shows the results of ASD of VDRCO and AMCV in the different range of mobile speed where the mean values of startup delay of all nodes during the whole simulation corresponding to the four range of mobile speed denote ASD. The bars corresponding to VDRCO and AMCV keep the rise trend with the increase in the mobile speed. The red bars of VDRCO are lower than those of AMCV in all range of mobile speed.Figure 5
Average startup delay against range variation of mobile speed.In AMCV, the system nodes which request the same video are grouped into a node community and these communities rely on the static and dynamic connections to support the node movement between communities (namely, video lookup). If there are the communities corresponding to all videos in overlay networks, the request nodes can fast find the video providers by making use of the connections between communities to forward the request messages. Therefore, the ASD results of AMCV in the initial simulation process are better than those of VDRCO. However, the system members continuously move between communities with the variation of requested videos, which leads to the dynamic and fragile community structure. In the other words, the interest variation for the video content results in the generation and disappearance of communities, which brings severely negative influence for the lookup success rate. If the request messages cannot be forwarded to the corresponding communities, they only are forwarded to the server. Therefore, the ASD values of AMCV fast increase. On the other hand, AMCV does not consider the mobility of mobile nodes in the process of video delivery, so that the far-end access for the video resources is not avoided. The fast increase in the number of requested videos brings large amount of data traffic, which leads to the network congestion. The ASD values of AMCV keep high level in the process of network congestion fromt= 140 s to t= 340 s, which means that the ASD values of AMCV are subjected to the severe influence of network congestion. When some system members have watched the 5 videos and quit the system, the decrease of traffic relieves the congestion level, so that the ASD values of AMCV can quickly decrease. Moreover, the mobility of mobile nodes may result in the increase of hop number between requesters and providers, so the increase of mobile speed also causes the rise of ASD results of AMCV. The ASD values of AMCV with low mobile speed are less than those with high mobile speed. In VDRCO, the system members are clustered in terms of the frequency of interaction and encounter between them and preferentially request and push the video content in current subsets. Because the system members in subsets continuously estimate the relationship between them according to the current frequency of interaction and encounter, the variation of subset structure brings severely negative influence for the sharing performance. Initially, the new movement traces lead to the change of subset structure; namely, the system members leave current subsets and join other subsets, which increase the ASD values of VDRCO. Once the subset structure keep relatively stable state, the intrasubset video sharing relies on the close geographical distance to obtain low transmission delay of request messages and video data. Further, the system members in the same subsets are aware of the demand regions with each other in the process of video sharing and dynamically regulate the local cached resources according to the demand variation and video dissemination. The adjustment of cached resources based on the awareness of demand variation ensures local balance between supply and demand to promote the intrasubset sharing and reduce lookup delay. Therefore, the ASD values of VDRCO can keep the level of decrease and stability from t= 60 s to t= 120 s. With the fast increase in the number of requested videos, VDRCO also is subjected to the network congestion from t= 140 s to t= 340 s, but the ASD values of VDRCO still are less than those of AMCV. The peak value of VDRCO is less than that of AMCV and the ASD decrease rate of VDRCO also is higher than that of AMCV. On the other hand, because the system members in the same subsets keep frequent encounter and have the stable one-hop neighbor relationship, the near-end video delivery reduces the influence caused by network congestion. The ASD values of VDRCO keep the rise trend with the increase in the mobile speed, but the increment of ASD values of VDRCO is less than that of AMCV.(2) Caching Utilization Rate. Making use of video resources cached in local buffer of system members to serve the requesters denotes the caching utilization. Let NCU and NRM denote the number of caching utilization and all request messages, respectively. The caching utilization rate can be defined as RCU=NCU/NRM.Figure6 shows the variation of caching utilization rate of VDRCO and AMCV every 40 s. The curves of VDRCO and AMCV have the rise trend during the whole simulation process. The blue curve corresponding to AMCV fast increases from t= 40 s to t= 320 s and keeps stable rise from t= 340 s to t= 400 s. The red curve corresponding to VDRCO has the stable increase from t= 200 s to t= 400 s after a fast rise from t= 40 s to t= 180 s. The results of caching utilization rate of VDRCO are higher than those of AMCV.Figure 6
Caching utilization rate against simulation time.In AMCV, the system members firstly send the request messages to the broker members in current communities. The broker members make use of the maintained connections with other communities to forward the request messages. If the requested videos are not played by the system members, the communities corresponding to the requested videos also are not built and the request nodes need to fetch the requested video resources from the server. Although the members in communities which have watched the requested videos and do not immediately remove the videos, they continue to request new videos, quit current communities, and join the new communities. The original videos cached by them are not used to serve other requesters. This is as these members have quit the original communities, which results in the link disconnection with the broker members of original communities. On the other hand, the interests of users have random and extensive characters; it is difficult to all videos being watched during the same period time. Therefore, the caching utilization rate of AMCV always keeps the lower level than those of VDRCO. In VDRCO, the system members in the same subsets have high-frequency interaction and similar interests, so they make use of local cached videos to serve with each other. Even if the system members do not fetch the desired video resources from the nodes in current subsets, they require other nodes in subsets forward the request messages or broadcast the request messages to obtain the requested videos from the nodes in overlay networks. Therefore, the results of caching utilization rate of VDRCO are higher than those of AMCV in the whole process of simulation. Moreover, the high caching utilization rate also means that VDRCO reduces the load of the server to obtain higher system scalability than AMCV.(3) Packet Loss Rate. The ratio between number of lost data at the application layer in the transmission process and number of total number of data sent by video providers and the server denotes the packet loss rate.Figure7 shows the PLR variation of VDRCO and AMCV with increasing simulation time where the PLR values during a time interval T= 40 s denote the PLR. The two curves corresponding to VDRCO and AMCV have similar variation process of PLR. The results of VDRCO and AMCV decrease from t= 200 s to t= 400 s after slow rise from t= 40 s to t= 120 s and fast increase from t= 120 s to t= 200 s. The blue curve of AMCV is higher than the red curve of VDRCO where AMCV’s results have higher increment and peak value than those of VDRCO from t= 40 s to t= 200 s. The decrement of AMCV’s results is lower than that of VDRCO from t= 240 s to t= 400 s.Figure 7
Average packet loss rate against simulation time.Figure8 shows the PLR variation of VDRCO and AMCV with increasing number of request nodes. Because the 200 system members request the videos following the Poisson distribution from t= 0 s to t= 100 s, the PLR results of VDRCO and AMCV with the increase in number of request nodes from t= 0 s to t= 100 s are shown in Figure 8. The two curves of VDRCO and AMCV have the similar variation trend with variation of number of request nodes from 20 to 200. The red curve corresponding to VDRCO firstly keeps the fast rise with increasing number of request nodes from 20 to 80, experiences a transient fall from 80 to 100, and also continues to quickly increase from 120 to 200. The blue curve corresponding to AMCV firstly has a fast rise with increasing number of request nodes from 20 to 80, experiences a stable process from 100 to 140, and continues to quickly increase from 160 to 200. The blue curve of AMCV is higher than that of VDRCO during increase process in number of request nodes.Figure 8
Average packet loss rate against number of request nodes.Figure9 shows the PLR variation of VDRCO and AMCV in different range of mobile speed. The bars of VDRCO and AMCV keep the rise trend with increasing mobile speed. The red bars of VDRCO keep the low levels in the low range of mobile speed [0,5] and (5,10] and have the fast rise in the high range of mobile speed (10,15] and (15,20]. The blue bars of AMCV also have low levels in the range of mobile speed [0,5], keep the slow rise with the variation of mobile speed from (5,10] and (10,15], and have the distinct increase in (15,20]. The PLR results of VDRCO are less than those of AMCV in the four range of mobile speed.Figure 9
Average packet loss rate against range variation of mobile speed.AMCV does not consider the negative influence caused by the node mobility for the video delivery; namely, AMCV groups the system members into communities according to the videos requested by them. The forwarding process of request messages only reflects the logical distance between requesters and providers. The neglect for the geographical distance between requesters and providers leads to the increase in the probability of far-end video fetching, which brings the two types of negative influence for the video delivery. (1) The video delivery with geographical long distance increases the load core networks, which aggravates the level of network congestion. When the network congestion occurs, the PLR values of AMCV keep high levels during a long period time from t= 200 s to t= 400 s, even if some system members continuously quit the video system. (2) There is high risk of packet loss in the process of data transmission with geographical long distance. For instance, if the receiving buffer of a relay node is full, the relay node drops the subsequent data; if there are many relay nodes in the data transmission path, the fast movement of some relay nodes leads to the frequent change of data transmission path which increases the probability of packet loss. Therefore, AMCV has the higher PLR values than VDRCO. VDRCO groups the system members into multiple subsets according to the frequency of interaction and encounter. The system members in the same subsets have stable one-hop neighbor relationship, so they achieve near-end video fetching with high probability. The near-end video fetching not only relieves the load of core network to reduce the level of network congestion but also avoids the risk of packet loss caused by node mobility in the process of data transmission. The PLR values of VDRCO keep relatively low level from t= 200 s to t= 280 s and fast decrease from t= 280 s to t= 400 s, which means that the negative influence caused by the network congestion for VDRCO is low relative to AMCV. Moreover, because VDRCO considers the stability of mobility of system members in subsets (namely, stability of one-hop neighbor relationship), the PLR values of VDRCO keep low increase in the range of mobile speed [0,5], (5,10] and (10,15]. Although the PLR values of VDRCO are subjected to the distinct negative influence in the high mobile speed (15,20], VDRCO’s PLR results are better than those of AMCV.


## 5.1. Testing Topology and Scenarios

The performance of the proposed solution VDRCO compares with a state-of-the-art community-based video sharing solution AMCV [32]. We use in NS-2 to model and implement the two solutions VDRCO and AMCV. The 400 mobile nodes are deployed in the 1000 × 1000 m2 area and have 200 m signal range. The mobile speed of nodes is in the range [1,20] m/s. The simulation time is set to 400 s. The data transmission protocol is UDP and the wireless routing protocol is DSR. In order to reduce the influence caused by network congestion for the simulation results, the server and the mobile nodes have 20 Mb/s and 10 Mb/s bandwidth, respectively. The transmission rate of video data (the playback rate of mobile nodes) is set to 128 kb/s.The 200 mobile nodes request videos and join the video system, which are considered as the system members. The number of video files is 30 and the length of each file is 100 s. The 200 playback logs are generated for the system members, which are used to define the requested resources and playback time of system members. After simulation startup, the system members finish the first request for the videos in terms of the playback logs following the Poisson distribution fromt= 0 s to t= 100 s. The requested resources and playback time of each system member in playback logs are randomly assigned. The number of videos requested by nodes in playback logs is 5 and the system members quit the system when they have watched all videos. The number of resources cached in each system member is 3. In VDRCO, the 200 historical playback logs are generated, which are used to estimate demand regions of the 200 system members. The historical logs of encounter and interaction of system members are generated. The system members are clustered in terms of their historical logs of encounter and interaction before the simulation. α and β are set to 0.5, respectively. The threshold Thr of all system members is set to 0.2. Δt is set to 20 s.On the other hand, the 400 movement behavior logs are generated for the 400 mobile nodes. In the movement behavior logs, the location, speed, and moving target of mobile nodes are randomly assigned. The mobile nodes move from the initial location. When the mobile nodes arrive at the assigned target, they do not stay and continue to move in terms of the new speed and moving target defined in movement behavior logs. In VDRCO, the members in node subsets are reestimated the relationship between them in terms of the new movement traces and make the selection: leaving current subset and joining new subset or staying current subset.AMCV is suitable for the performance comparison with VDRCO. AMCV has the flexible deployment strategy to implement video file sharing in wireless mobile networks. In AMCV, the nodes which request the same video chunk are grouped into a community. In the simulation, AMCV clusters the nodes which request the same video file into a community. The number of communities in AMCV is in the range(0,30]. The maintenance strategy in AMCV also is suitable for the video file sharing. (2) The sharing strategy of video chunks in AMCV is suitable for the video file sharing. We assign the ID for the 30 video files, so the communities in AMCV can build the static connections with each other. We also generated the 5000 historical playback logs which include ID of videos requested by nodes. AMCV can construct the dynamic connections between communities according to the request behaviors of nodes. α and β are also set to 0.5, respectively. PTb and PTr are set to 0.2 and 0.12, respectively. The value of UT is defined as 60 s. (3) AMCV and VDRCO make use of community-based MP2P network architecture and estimation for the video request behaviors of nodes to support high-efficiency video sharing. AMCV relies on the association relationship between videos requested by nodes to build the dynamic connections between communities and support the fast video lookup. VDRCO investigates the content similarity level between videos requested by nodes and node mobility to build the node subsets and support the video sharing between nodes in subsets. Before simulation startup, the system members also are clustered in terms of the community construction method.


## 5.2. Performance Evaluation

The performance comparison between VDRCO and AMCV includes the three aspects average startup delay (ASD), caching utilization rate, and packet loss rate (PLR).(1) ASD. Let SD=tr-tv denote the definition of startup delay. tr is the time of sending the packet containing request message at the application layer; tv is the time of receiving first packet containing video data at the application layer.Figure3 shows the variation of ASD of the two solutions VDRCO and AMCV with increasing simulation time. ASD=∑i=1m‍SDi/m denotes the average startup delay where m is the number of nodes which have finished startup during a time interval T= 20 s. The two curves corresponding to VDRCO and AMCV keep the fall trend from t= 220 s to t= 400 s after the fast rise from t= 0 s to t= 200 s. The VDRCO results fast increase from t= 0 s to t= 60 s, also keep slow rise from t= 80 s to t= 120 s, and reach the peak value at t= 220 s. The AMCV results keep relatively stable rise from t= 0 s to t= 120 s and reach the peak values at t= 220 s. Although the VDRCO results are higher than those of AMCV from t= 0 s to t= 60 s, the red curve corresponding to VDRCO is lower than that of AMCV from t= 80 s to t= 400 s and the peak value of VDRCO is less than that of AMCV.Figure 3
Average startup delay against simulation time.Figure4 shows the variation of ASD of VDRCO and AMCV with increasing number of request nodes. ASD=∑i=1m‍SDi/m also denotes the average startup delay where m is the number of nodes which have finished startup during a time interval of every 20 nodes requesting videos. The red curve corresponding to VDRCO keeps fast rise with increasing number of request nodes from 0 to 100 and also falls with increasing number of request nodes from 100 to 140. Finally, the red curve continues to keep the rise trend with increasing number of request nodes from 140 to 200. The blue curve corresponding to AMCV always fast increases in the process of the 200 request nodes joining. Although the red curve of VDRCO is higher than that of AMCV with increasing number of request nodes from 0 to 120, the VDRCO results are better than those of AMCV in the increase process of request nodes from 140 to 200.Figure 4
Average startup delay against number of request nodes.Figure5 shows the results of ASD of VDRCO and AMCV in the different range of mobile speed where the mean values of startup delay of all nodes during the whole simulation corresponding to the four range of mobile speed denote ASD. The bars corresponding to VDRCO and AMCV keep the rise trend with the increase in the mobile speed. The red bars of VDRCO are lower than those of AMCV in all range of mobile speed.Figure 5
Average startup delay against range variation of mobile speed.In AMCV, the system nodes which request the same video are grouped into a node community and these communities rely on the static and dynamic connections to support the node movement between communities (namely, video lookup). If there are the communities corresponding to all videos in overlay networks, the request nodes can fast find the video providers by making use of the connections between communities to forward the request messages. Therefore, the ASD results of AMCV in the initial simulation process are better than those of VDRCO. However, the system members continuously move between communities with the variation of requested videos, which leads to the dynamic and fragile community structure. In the other words, the interest variation for the video content results in the generation and disappearance of communities, which brings severely negative influence for the lookup success rate. If the request messages cannot be forwarded to the corresponding communities, they only are forwarded to the server. Therefore, the ASD values of AMCV fast increase. On the other hand, AMCV does not consider the mobility of mobile nodes in the process of video delivery, so that the far-end access for the video resources is not avoided. The fast increase in the number of requested videos brings large amount of data traffic, which leads to the network congestion. The ASD values of AMCV keep high level in the process of network congestion fromt= 140 s to t= 340 s, which means that the ASD values of AMCV are subjected to the severe influence of network congestion. When some system members have watched the 5 videos and quit the system, the decrease of traffic relieves the congestion level, so that the ASD values of AMCV can quickly decrease. Moreover, the mobility of mobile nodes may result in the increase of hop number between requesters and providers, so the increase of mobile speed also causes the rise of ASD results of AMCV. The ASD values of AMCV with low mobile speed are less than those with high mobile speed. In VDRCO, the system members are clustered in terms of the frequency of interaction and encounter between them and preferentially request and push the video content in current subsets. Because the system members in subsets continuously estimate the relationship between them according to the current frequency of interaction and encounter, the variation of subset structure brings severely negative influence for the sharing performance. Initially, the new movement traces lead to the change of subset structure; namely, the system members leave current subsets and join other subsets, which increase the ASD values of VDRCO. Once the subset structure keep relatively stable state, the intrasubset video sharing relies on the close geographical distance to obtain low transmission delay of request messages and video data. Further, the system members in the same subsets are aware of the demand regions with each other in the process of video sharing and dynamically regulate the local cached resources according to the demand variation and video dissemination. The adjustment of cached resources based on the awareness of demand variation ensures local balance between supply and demand to promote the intrasubset sharing and reduce lookup delay. Therefore, the ASD values of VDRCO can keep the level of decrease and stability from t= 60 s to t= 120 s. With the fast increase in the number of requested videos, VDRCO also is subjected to the network congestion from t= 140 s to t= 340 s, but the ASD values of VDRCO still are less than those of AMCV. The peak value of VDRCO is less than that of AMCV and the ASD decrease rate of VDRCO also is higher than that of AMCV. On the other hand, because the system members in the same subsets keep frequent encounter and have the stable one-hop neighbor relationship, the near-end video delivery reduces the influence caused by network congestion. The ASD values of VDRCO keep the rise trend with the increase in the mobile speed, but the increment of ASD values of VDRCO is less than that of AMCV.(2) Caching Utilization Rate. Making use of video resources cached in local buffer of system members to serve the requesters denotes the caching utilization. Let NCU and NRM denote the number of caching utilization and all request messages, respectively. The caching utilization rate can be defined as RCU=NCU/NRM.Figure6 shows the variation of caching utilization rate of VDRCO and AMCV every 40 s. The curves of VDRCO and AMCV have the rise trend during the whole simulation process. The blue curve corresponding to AMCV fast increases from t= 40 s to t= 320 s and keeps stable rise from t= 340 s to t= 400 s. The red curve corresponding to VDRCO has the stable increase from t= 200 s to t= 400 s after a fast rise from t= 40 s to t= 180 s. The results of caching utilization rate of VDRCO are higher than those of AMCV.Figure 6
Caching utilization rate against simulation time.In AMCV, the system members firstly send the request messages to the broker members in current communities. The broker members make use of the maintained connections with other communities to forward the request messages. If the requested videos are not played by the system members, the communities corresponding to the requested videos also are not built and the request nodes need to fetch the requested video resources from the server. Although the members in communities which have watched the requested videos and do not immediately remove the videos, they continue to request new videos, quit current communities, and join the new communities. The original videos cached by them are not used to serve other requesters. This is as these members have quit the original communities, which results in the link disconnection with the broker members of original communities. On the other hand, the interests of users have random and extensive characters; it is difficult to all videos being watched during the same period time. Therefore, the caching utilization rate of AMCV always keeps the lower level than those of VDRCO. In VDRCO, the system members in the same subsets have high-frequency interaction and similar interests, so they make use of local cached videos to serve with each other. Even if the system members do not fetch the desired video resources from the nodes in current subsets, they require other nodes in subsets forward the request messages or broadcast the request messages to obtain the requested videos from the nodes in overlay networks. Therefore, the results of caching utilization rate of VDRCO are higher than those of AMCV in the whole process of simulation. Moreover, the high caching utilization rate also means that VDRCO reduces the load of the server to obtain higher system scalability than AMCV.(3) Packet Loss Rate. The ratio between number of lost data at the application layer in the transmission process and number of total number of data sent by video providers and the server denotes the packet loss rate.Figure7 shows the PLR variation of VDRCO and AMCV with increasing simulation time where the PLR values during a time interval T= 40 s denote the PLR. The two curves corresponding to VDRCO and AMCV have similar variation process of PLR. The results of VDRCO and AMCV decrease from t= 200 s to t= 400 s after slow rise from t= 40 s to t= 120 s and fast increase from t= 120 s to t= 200 s. The blue curve of AMCV is higher than the red curve of VDRCO where AMCV’s results have higher increment and peak value than those of VDRCO from t= 40 s to t= 200 s. The decrement of AMCV’s results is lower than that of VDRCO from t= 240 s to t= 400 s.Figure 7
Average packet loss rate against simulation time.Figure8 shows the PLR variation of VDRCO and AMCV with increasing number of request nodes. Because the 200 system members request the videos following the Poisson distribution from t= 0 s to t= 100 s, the PLR results of VDRCO and AMCV with the increase in number of request nodes from t= 0 s to t= 100 s are shown in Figure 8. The two curves of VDRCO and AMCV have the similar variation trend with variation of number of request nodes from 20 to 200. The red curve corresponding to VDRCO firstly keeps the fast rise with increasing number of request nodes from 20 to 80, experiences a transient fall from 80 to 100, and also continues to quickly increase from 120 to 200. The blue curve corresponding to AMCV firstly has a fast rise with increasing number of request nodes from 20 to 80, experiences a stable process from 100 to 140, and continues to quickly increase from 160 to 200. The blue curve of AMCV is higher than that of VDRCO during increase process in number of request nodes.Figure 8
Average packet loss rate against number of request nodes.Figure9 shows the PLR variation of VDRCO and AMCV in different range of mobile speed. The bars of VDRCO and AMCV keep the rise trend with increasing mobile speed. The red bars of VDRCO keep the low levels in the low range of mobile speed [0,5] and (5,10] and have the fast rise in the high range of mobile speed (10,15] and (15,20]. The blue bars of AMCV also have low levels in the range of mobile speed [0,5], keep the slow rise with the variation of mobile speed from (5,10] and (10,15], and have the distinct increase in (15,20]. The PLR results of VDRCO are less than those of AMCV in the four range of mobile speed.Figure 9
Average packet loss rate against range variation of mobile speed.AMCV does not consider the negative influence caused by the node mobility for the video delivery; namely, AMCV groups the system members into communities according to the videos requested by them. The forwarding process of request messages only reflects the logical distance between requesters and providers. The neglect for the geographical distance between requesters and providers leads to the increase in the probability of far-end video fetching, which brings the two types of negative influence for the video delivery. (1) The video delivery with geographical long distance increases the load core networks, which aggravates the level of network congestion. When the network congestion occurs, the PLR values of AMCV keep high levels during a long period time from t= 200 s to t= 400 s, even if some system members continuously quit the video system. (2) There is high risk of packet loss in the process of data transmission with geographical long distance. For instance, if the receiving buffer of a relay node is full, the relay node drops the subsequent data; if there are many relay nodes in the data transmission path, the fast movement of some relay nodes leads to the frequent change of data transmission path which increases the probability of packet loss. Therefore, AMCV has the higher PLR values than VDRCO. VDRCO groups the system members into multiple subsets according to the frequency of interaction and encounter. The system members in the same subsets have stable one-hop neighbor relationship, so they achieve near-end video fetching with high probability. The near-end video fetching not only relieves the load of core network to reduce the level of network congestion but also avoids the risk of packet loss caused by node mobility in the process of data transmission. The PLR values of VDRCO keep relatively low level from t= 200 s to t= 280 s and fast decrease from t= 280 s to t= 400 s, which means that the negative influence caused by the network congestion for VDRCO is low relative to AMCV. Moreover, because VDRCO considers the stability of mobility of system members in subsets (namely, stability of one-hop neighbor relationship), the PLR values of VDRCO keep low increase in the range of mobile speed [0,5], (5,10] and (10,15]. Although the PLR values of VDRCO are subjected to the distinct negative influence in the high mobile speed (15,20], VDRCO’s PLR results are better than those of AMCV.


## 6. Conclusion

In this paper, we propose a novel video sharing solution based on Demand-aware Resource Caching Optimization in wireless mobile networks (VDRCO). By construction of video dissemination process model in terms of the epidemic model, VDRCO discusses the main influence factors for the dissemination and distribution of videos. By estimation for user demand range and video distribution variation level, VDRCO groups the nodes into multiple subsets in terms of interaction frequency and similarity of interest and mobility, which optimizes video distribution. VDRCO further designs video sharing strategies to balance local supply and demand and make use of near-end video fetching to improve sharing performance. The simulation results also show how VDRCO has lower startup delay, higher caching utilization rate, and lower packet loss rate than AMCV.



---

*Source: 3725898-2017-01-19.xml*