CN106888462B - Content topology construction method and system - Google Patents
Content topology construction method and system Download PDFInfo
- Publication number
- CN106888462B CN106888462B CN201710126919.9A CN201710126919A CN106888462B CN 106888462 B CN106888462 B CN 106888462B CN 201710126919 A CN201710126919 A CN 201710126919A CN 106888462 B CN106888462 B CN 106888462B
- Authority
- CN
- China
- Prior art keywords
- content
- node
- nodes
- base station
- link
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000010276 construction Methods 0.000 title claims abstract description 17
- 238000004891 communication Methods 0.000 claims abstract description 18
- 238000011156 evaluation Methods 0.000 claims description 3
- 230000035945 sensitivity Effects 0.000 claims description 3
- 230000005540 biological transmission Effects 0.000 abstract description 11
- 230000008878 coupling Effects 0.000 abstract description 3
- 238000010168 coupling process Methods 0.000 abstract description 3
- 238000005859 coupling reaction Methods 0.000 abstract description 3
- 230000009286 beneficial effect Effects 0.000 abstract 1
- 238000005516 engineering process Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000000034 method Methods 0.000 description 2
- 230000004913 activation Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000003090 exacerbative effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008092 positive effect Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/021—Traffic management, e.g. flow control or congestion control in wireless networks with changing topologies, e.g. ad-hoc networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0226—Traffic management, e.g. flow control or congestion control based on location or mobility
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W64/00—Locating users or terminals or network equipment for network management purposes, e.g. mobility management
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
本发明属于无线通信技术领域，公开了一种内容拓扑构建方法及系统，包括：基站统计每个移动节点的内容存储情况，并建立内容存储表；基站定位每个节点的位置并计算所有节点之间的距离，根据距离及路径损耗模型计算节点之间能否建立通信链路；基站根据内容流行分布及节点内容存储情况计算和移动节点相关的节点权重；定义节点之间的内容势，根据内容势计算节点之间的链路的权重；根据基站覆盖下的所有节点，节点中存储的内容，以及节点之间的链路构成内容拓扑。本发明能够很清晰地展现移动节点、内容和存储内容的节点三者之间的拓扑关系，并且能够明确揭示内容存储与内容传输之间的耦合关系，利于通过对内容拓扑的控制来保证内容传输成功率，提高存储效率。
The invention belongs to the technical field of wireless communication, and discloses a content topology construction method and system, comprising: a base station counts the content storage situation of each mobile node, and establishes a content storage table; The distance between nodes is calculated based on the distance and path loss model to calculate whether a communication link can be established between nodes; the base station calculates the node weight related to the mobile node according to the content popularity distribution and node content storage situation; defines the content potential between nodes, according to the content The weight of the link between the nodes is calculated by the potential; according to all the nodes covered by the base station, the content stored in the nodes, and the links between the nodes constitute the content topology. The invention can clearly show the topological relationship among the mobile node, content and the node storing the content, and can clearly reveal the coupling relationship between the content storage and the content transmission, which is beneficial to ensure the content transmission through the control of the content topology success rate and improve storage efficiency.
Description
Technical Field
The invention belongs to the technical field of wireless communication, and particularly relates to a content topology construction method.
Background
Caching content at the edge of a mobile network is a wireless communication technology with full development potential, and the caching content at the edge of the network can be close to the distance between the content and a user, so that the load in the network is reduced, and the bottleneck effect of a server is relieved. Device-to-device (D2D) communication technology has received much attention in recent years, primarily due to its near-field communication characteristics that can provide better throughput rates, as well as better energy efficiency. Caching content required by users in the device nodes and sharing the content stored in each other through the D2D technology can improve the utilization rate of wireless resources while alleviating the network load. When storing content in a device, the invention hopes to store different content in different devices to improve the diversity of the content in the devices, thereby improving the probability of the devices acquiring the content locally and reducing the load flowing to the network. But the diversity of the content necessarily results in more communication between users, so more links need to be activated to support the communication overhead brought by the sharing of the content. This may result in multiple communication links being activated simultaneously, thereby exacerbating interference conditions for communication between devices. In order to cope with such a situation, it is necessary to control the storage distribution of the content in the devices and the active links between the devices at the same time, thereby making full use of the storage resources and the link resources. In order to control the storage and Sharing of Content in a Device, some methods have been proposed by researchers, such as the article "Efficient Scheduling and Power Allocation for D2D-associated Wireless Networks", published by the authors LinZhang et al in IEEE TCOMM 2016, and the article "maximum sized Cellular Traffic accessing video-to-Device Content Sharing", published by the authors Jinjie Jieing et al in IEEE JSCA 2016. The Lin Zhang and other algorithms ensure the high efficiency of content sharing, but the difference of the storage capacity of the mobile equipment nodes and the difference of the demands of the nodes on the content are not considered, so that the Lin Zhang and other algorithms cannot be applied to actual wireless network nodes because the storage capacity of the actual nodes and the demands on the content are different. The algorithm of jingjie jiang and the like firstly stores content according to popularity, and then transmits the content for the node with the maximum matching transmission rate, but does not consider the characteristic that the content storage and the content transmission are mutually influenced and coupled, and does not consider the problem of interference possibly brought when the transmission links are simultaneously activated, so that the stored content is not transmitted by proper links, and the activated links carry out ineffective transmission because the nodes at two ends have no difference of the content, thereby influencing the success rate of content sharing.
In summary, the problems of the prior art are as follows: the probability of content sharing among the nodes is low, and the service load in the network is large. The main reason is that when content storage is performed, the influence of storage on a wireless link is not considered, and the problem that content storage and content transmission are coupled with each other is not effectively solved.
Disclosure of Invention
Aiming at the problems in the prior art, the invention provides a content topology construction method.
The invention is realized in such a way that a content topology construction method comprises the following steps:
step one, a base station counts the content storage condition of each mobile node and establishes a content storage table;
secondly, the base station positions the position of each node and calculates the distance between all the nodes, and whether a communication link can be established between the nodes is calculated according to the distance and the path loss model;
step three, the base station calculates the node weight related to the mobile node according to the content popular distribution and the node content storage condition; defining content potential between nodes, and calculating the weight of a link between the nodes according to the content potential;
and step four, forming a content topology according to all nodes covered by the base station, the content stored in the nodes and the links among the nodes.
Further, the content topology construction method specifically includes the following steps:
firstly, a mobile node acquires and stores content and then sends information of the stored content to a base station, the base station counts the content storage condition of each mobile node according to the received information, and establishes a content storage table for each node, and the table comprises an ID serial number of equipment and the name of the stored content of each node;
secondly, the base station collects the position of each node and calculates the Euclidean distance d between any two nodes u and iu,iCalculating whether a link can be established between nodes according to the distance and the path loss model, wherein the condition for establishing the link is
Wherein, PmaxWhich represents the maximum transmit power of the node,
representing the channel gain, α is the path loss factor, N represents the noise at node iAcoustic power, gamma is the threshold value of the received signal-to-noise ratio, and is determined according to the sensitivity and the bit error rate requirement of the receiver;
thirdly, the base station calculates the node weight related to the mobile equipment according to the content popularity distribution and the content stored by the equipment;
fourthly, defining the content potential between the nodes, and calculating the weight of the link between the nodes according to the content potential;
fifthly, according to all nodes under the coverage of the base station, the content stored in the nodes and the links among the nodes, a content topology G-EU,WE) Wherein U represents a set of nodes, E represents a set of links, WURepresenting a set of node weights, WERepresenting a set of link weights.
Further, the third step specifically includes:
(1) the base station acquires content popularity distribution through a content service provider, wherein the popularity distribution represents the preference degree of nodes to the content and represents the probability distribution of the nodes for requesting the content; the probability that node u requests content c is denoted as Du,cAnd can be characterized by a Zipf distribution:
wherein ΔuThe deviation degree of different users to the content preference is shown and determined according to the specific content preferred by different users; sigmauIndicates whether the user's preference for content is centralized or decentralized, σuA larger value indicates that the user requests are concentrated on a smaller number of contents which are more popular, otherwise the requests are more scattered; c denotes a user set.
(2) The weight of a node may be represented as wu＝∑c∈Cxu,cDu,cSc(ii) a Wherein x isu,cRepresenting nodesuWhether to store content c, if so, x u,c1, otherwise xu,c＝0；ScRepresents the size of the content; the weight of the node indicates that the node acquires the content from the storage of the node when the node has the content demand, thereby saving the load flowing to the base stationAnd the saved load flow is the node weight.
Further, the fourth step specifically includes:
(1) the content potential is as follows: the content potential from node u to node i with respect to content c may be represented as xu,c-xi,c(ii) a The tendency of sharing contents between two nodes due to difference of stored contents is shown, and the potential from the node u to the node i shows that the node u has stronger capacity of sharing contents for the node i, and vice versa;
(2) the weight of the link between two nodes u and i can be obtained according to the content potential as follows:
the traffic saving which can be brought by the tendency of sharing content from the node u to the node i is the evaluation of the link value between the two nodes.
Another object of the present invention is to provide a device-to-device communication system to which the content topology construction method is applied.
The invention has the advantages and positive effects that: the content topology is constructed by defining the potential of content storage among nodes, the node weight and the link weight, and the topological relation among the content storage, the node position and the distribution of links among the nodes is clearly expressed. The constructed content topology can clearly reveal the coupling relation between content storage and content transmission, namely the node storage content determines the effectiveness of link transmission content among nodes, and the link activation state determines the storage distribution of the content on the nodes.
The construction of the content topology can provide a definite optimized modeling scheme for combining content storage and content sharing transmission, so that the coupling problem between the content storage and the content transmission can be solved by controlling the content topology, and the aim of fully utilizing storage resources and wireless resources is fulfilled.
Drawings
Fig. 1 is a flowchart of a content topology construction method provided in an embodiment of the present invention.
Fig. 2 is a schematic diagram of a network scenario applicable to the embodiment of the present invention.
Fig. 3 is a flow chart of an embodiment provided by an embodiment of the present invention.
Fig. 4 is a diagram illustrating a topology construction provided by an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail with reference to the following embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The following detailed description of the principles of the invention is provided in connection with the accompanying drawings.
As shown in fig. 1, the content topology construction method provided by the embodiment of the present invention includes the following steps:
s101: the base station counts the content storage condition of each mobile node and establishes a content storage table;
s102: the base station positions the position of each node and calculates the distance between all the nodes, and whether a communication link can be established between the nodes is calculated according to the distance and a path loss model;
s103: the base station calculates the node weight related to the mobile node according to the content popular distribution and the node content storage condition; defining content potential between nodes, and calculating the weight of a link between the nodes according to the content potential;
s104: according to all nodes under the coverage of the base station, the content stored in the nodes and the links among the nodes form a content topology.
The application of the principles of the present invention will now be described in further detail with reference to the accompanying drawings.
Referring to fig. 2, the network scenario used in the present invention considers a macro base station and a mobile device under the service of the base station. Each mobile device represents a node, has a unique ID serial number, and can acquire its own location information through GPS or indoor positioning. Any node is provided with storage, and the storage capacity is as large as that; c files need to be stored, and the size of any content is as follows; the base station may track the location of the nodes and the content storage of each node and decide whether to direct a request for content from the node to the network or to a neighbor node of the node to obtain the content. If the node acquires the requested content through the D2D communication technique, the present invention only considers that the node communicates with the node storing the content through one hop and that the communication between the nodes is done in unicast. The communication between the nodes occupies the same frequency band, and the transmitting power of each node is equal.
Referring to fig. 3, the implementation steps of the embodiment of the present invention are as follows:
step 2, the base station collects the position of each node and calculates the Euclidean distance d between any two nodes u and iu,iCalculating whether a link can be established between nodes according to the distance and the path loss model, wherein the condition for establishing the link is
Wherein, PmaxWhich represents the maximum transmit power of the node,
representing the channel gain, α is the path loss factor, N represents the noise power at node i, and Γ is the received signal-to-noise ratio threshold, determined according to the sensitivity and bit error rate requirements of the receiver.
And 3, the base station calculates the node weight related to the mobile equipment according to the content popular distribution and the content stored by the equipment:
(3a) the base station acquires content popularity distribution through a content service provider, wherein the popularity distribution represents the preference degree of nodes to the content and represents the probability distribution of the nodes for requesting the content; the probability that node u requests content c is denoted as Du,cAnd can be distributed by ZipfEngraving:
wherein ΔuThe deviation degree of different users to the content preference is shown and determined according to the specific content preferred by different users; sigmauIndicates whether the user's preference for content is centralized or decentralized, σuA larger value indicates that the user requests are concentrated on a smaller number of contents which are more popular, otherwise the requests are more scattered; c denotes a user set.
(3b) The weight of a node may be represented as wu＝∑c∈Cxu,cDu,cSc(ii) a Wherein x isu,cIndicates whether node u stores content c, and if so, xu,c1, otherwise xu,c＝0；ScRepresents the size of the content; the weight of the node indicates that when the node has content demand, the content is acquired from the storage of the node, so that the load flow flowing to the base station is saved, and the saved load flow is the weight of the node.
Step 4, defining the content potential between the nodes, and calculating the weight of the link between the nodes according to the content potential:
(4a) the content potential is as follows: the content potential from node u to node i with respect to content c may be represented as xu,c-xi,c(ii) a The tendency of sharing contents between two nodes due to difference of stored contents is shown, and the potential from the node u to the node i shows that the node u has stronger capacity of sharing contents for the node i, and vice versa;
(4b) the weight of the link between two nodes u and i can be obtained according to the content potential as follows:
the traffic saving which can be brought by the tendency of sharing content from the node u to the node i is the evaluation of the link value between the two nodes.
Step 5, according to all nodes covered by the base station, the content stored in the nodesAnd the links between the nodes constitute a content topology G ═ (U, E, W)U,WE) Wherein U represents a set of nodes, E represents a set of links, WURepresenting a set of node weights, WERepresenting a set of link weights.
Referring to fig. 4, the content topology construction example of the present invention is to abstract a content topology map from an actual visual map.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.
Claims (2)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710126919.9A CN106888462B (en) | 2017-03-06 | 2017-03-06 | Content topology construction method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710126919.9A CN106888462B (en) | 2017-03-06 | 2017-03-06 | Content topology construction method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106888462A CN106888462A (en) | 2017-06-23 |
| CN106888462B true CN106888462B (en) | 2020-05-01 |
Family
ID=59180413
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710126919.9A Active CN106888462B (en) | 2017-03-06 | 2017-03-06 | Content topology construction method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106888462B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101184021A (en) * | 2007-12-14 | 2008-05-21 | 华为技术有限公司 | A method, device and system for realizing streaming media cache replacement |
| CN101466025A (en) * | 2007-12-17 | 2009-06-24 | 阿尔卡泰尔卢森特公司 | Method for distributing content data packets created by users of a hyper peer-to-peer network |
| CN105245592A (en) * | 2015-09-29 | 2016-01-13 | 西安电子科技大学 | Cache Content Placement Method of Mobile Network Base Station Based on Proximity Cache Cooperation |
| CN105791391A (en) * | 2016-01-29 | 2016-07-20 | 西安交通大学 | Calculation method of optimal collaboration distance in D2D fusion network based on file popularity |
| CN105930365A (en) * | 2016-04-11 | 2016-09-07 | 天津大学 | Network link topology reconstruction method based on content |
| CN106231622A (en) * | 2016-08-15 | 2016-12-14 | 北京邮电大学 | A kind of content storage method limited based on buffer memory capacity |
| CN106303927A (en) * | 2016-08-31 | 2017-01-04 | 电子科技大学 | A kind of cache allocation method in the wireless buffer network of D2D |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7096266B2 (en) * | 2001-01-08 | 2006-08-22 | Akamai Technologies, Inc. | Extending an Internet content delivery network into an enterprise |
-
2017
- 2017-03-06 CN CN201710126919.9A patent/CN106888462B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101184021A (en) * | 2007-12-14 | 2008-05-21 | 华为技术有限公司 | A method, device and system for realizing streaming media cache replacement |
| CN101466025A (en) * | 2007-12-17 | 2009-06-24 | 阿尔卡泰尔卢森特公司 | Method for distributing content data packets created by users of a hyper peer-to-peer network |
| CN105245592A (en) * | 2015-09-29 | 2016-01-13 | 西安电子科技大学 | Cache Content Placement Method of Mobile Network Base Station Based on Proximity Cache Cooperation |
| CN105791391A (en) * | 2016-01-29 | 2016-07-20 | 西安交通大学 | Calculation method of optimal collaboration distance in D2D fusion network based on file popularity |
| CN105930365A (en) * | 2016-04-11 | 2016-09-07 | 天津大学 | Network link topology reconstruction method based on content |
| CN106231622A (en) * | 2016-08-15 | 2016-12-14 | 北京邮电大学 | A kind of content storage method limited based on buffer memory capacity |
| CN106303927A (en) * | 2016-08-31 | 2017-01-04 | 电子科技大学 | A kind of cache allocation method in the wireless buffer network of D2D |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106888462A (en) | 2017-06-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109951869B (en) | Internet of vehicles resource allocation method based on cloud and mist mixed calculation | |
| CN110198278B (en) | A Lyapunov optimization method for joint task scheduling between cloud and edge of Internet of Vehicles | |
| CN109862592B (en) | A resource management and scheduling method in mobile edge computing environment based on multi-base station cooperation | |
| CN106686655B (en) | A Heterogeneous Network Federated User Association and Content Caching Method | |
| Zhao et al. | Cooperative caching in wireless p2p networks: Design, implementation, and evaluation | |
| CN111314889A (en) | Task offloading and resource allocation method based on mobile edge computing in the Internet of Vehicles | |
| CN105791391B (en) | The computational methods of the optimal cooperation distance of D2D converged network based on file popularity | |
| CN111556514A (en) | A decentralized mobile edge computing resource discovery and selection method and system | |
| CN108156596B (en) | Method for supporting D2D-cellular heterogeneous network combined user association and content caching | |
| CN106851741B (en) | Distributed mobile node file caching method based on social relationship in cellular network | |
| CN109673018B (en) | A Novel Content Cache Distribution Optimization Method in Wireless Heterogeneous Networks | |
| Luo et al. | CFT: A cluster-based file transfer scheme for highway VANETs | |
| CN108271172B (en) | Cellular D2D communication joint clustering and content deployment method | |
| CN110290507A (en) | A caching strategy and spectrum allocation method for a D2D communication-assisted edge caching system | |
| Fan et al. | The capacity of device-to-device communication underlaying cellular networks with relay links | |
| CN114982331A (en) | Method for adaptive configuration data streaming | |
| Zhu et al. | Mobility-aware multimedia data transfer using Multipath TCP in Vehicular Network | |
| CN110418377A (en) | A LoRa wireless sensor network data dynamic load balancing control method | |
| CN107343268A (en) | Nonopiate multicast and unicast transmission beam shaping method and system | |
| CN106686679B (en) | Energy-efficiency-based multi-hop D2D routing hop number limiting method in content-centric network | |
| TWI650037B (en) | Centralized wireless access network control method | |
| CN107949007A (en) | A kind of resource allocation algorithm based on Game Theory in wireless caching system | |
| CN106912059B (en) | Cognitive relay network joint relay selection and resource allocation method supporting mutual information accumulation | |
| CN106304232B (en) | A kind of communication means and device of base station dormancy | |
| Jin et al. | MANET for Disaster Relief based on NDN |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |