CN106888462A - A kind of content topology construction method - Google Patents

A kind of content topology construction method Download PDF

Info

Publication number
CN106888462A
CN106888462A CN201710126919.9A CN201710126919A CN106888462A CN 106888462 A CN106888462 A CN 106888462A CN 201710126919 A CN201710126919 A CN 201710126919A CN 106888462 A CN106888462 A CN 106888462A
Authority
CN
China
Prior art keywords
content
node
link
storage
base station
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.)
Granted
Application number
CN201710126919.9A
Other languages
Chinese (zh)
Other versions
CN106888462B (en
Inventor
盛敏
宋炯炯
徐超
王玺钧
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xidian University
Original Assignee
Xidian University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xidian University filed Critical Xidian University
Priority to CN201710126919.9A priority Critical patent/CN106888462B/en
Publication of CN106888462A publication Critical patent/CN106888462A/en
Application granted granted Critical
Publication of CN106888462B publication Critical patent/CN106888462B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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

Abstract

The invention belongs to wireless communication technology field, a kind of content topology construction method is disclosed, including：Base station counts the content storage condition of each mobile node, and sets up content storage table；Can the position of architecture each node simultaneously calculates the distance between all nodes, communication link is set up according between distance and path loss model calculate node；Base station calculates the node weights related to mobile node according to content Distribution and node content storage condition；Content gesture between definition node, according to the weight of the link between content gesture calculate node；According to all nodes under the covering of base station, the content stored in node, and the link constitution content topology between node.The present invention represents the topological relation between the node three of mobile node, content and storage content in which can be apparent from, and the coupled relation between disclosure storage and content transmission can be specified, beneficial to content transmission success rate is ensured by the control to content topology, storage efficiency is improved.

Description

A kind of content topology construction method
Technical field
The invention belongs to wireless communication technology field, more particularly to a kind of content topology construction method.
Background technology
In mobile network edge, cache contents are a wireless communication technologys full of development potentiality, at network edge Cache contents can further the distance of content and user, so that the load in reducing network, alleviates the bottleneck effect of server.If The standby communication technology to equipment (D2D) has received very big concern in recent years, and the near field communication characteristic mainly due to it can More preferable throughput rate, and preferably energy efficiency are provided.In device node cache user need content and pass through D2D technologies share the content for storing each other, and the utilization rate of Radio Resource can be improved while offered load is alleviated.Setting During standby middle storage content, the present invention wishes to store different contents in different equipment to improve content in a device various Property, so as to improve equipment in the local probability for obtaining content, reduction flows to the load of network.But the diversity of content is necessarily led Apply and more communicate between family, so needing to activate the shared communication overhead that brings of more links to support content.This This may result in activating multiple communication links simultaneously, so as to aggravate the disturbed condition of communication between devices.In order to tackle this feelings Condition makes full use of storage to provide, it is necessary to control content activation link in a device between storage and distribution and equipment simultaneously Source and link circuit resource.In order to control content storage in a device with it is shared, researcher has been proposed certain methods, such as Lin Article " the Efficient Scheduling and Power that the authors such as Zhang deliver on IEEE TCOMM 2016 Allocation for D2D-assisted Wireless Caching Networks ", and Jingjie Jiang etc. make Article " the Maximized Cellular Traffic Offloading via that person delivers on IEEE JSAC 2016 Device-to-Device Content Sharing”.The algorithm of Lin Zhang etc. ensures the shared high efficiency of content, but The otherness of otherness and node to content requirements of mobile device node storage capacity is not accounted for, therefore cannot be applied to In actual wireless network node, because the memory capacity of actual node and the demand to content are all different.Jingjie The algorithm of Jiang etc. carries out content storage according to popularity first, then for the maximum node of node matching transmission rate is carried out Content transmission, but do not account for content storage and influenced each other the characteristics of intercoupling with content transmission, do not account for simultaneously yet The interference problem that may be brought during activation transmission link, this content that may result in storage does not have suitable link to transmit, energy The link of enough activation carries out failed transmission because of the sleazy otherness of two end nodes, so as to influence the shared success of content Rate.
In sum, the problem of prior art presence is：The shared probability of content is relatively low between node, business load in network It is larger.Main cause is when content storage is carried out, not account for influence of the storage to Radio Link, is not solved effectively Content stores the problem intercoupled with content transmission.
The content of the invention
For the problem that prior art is present, the invention provides a kind of content topology construction method.
The present invention is achieved in that a kind of content topology construction method, and the content topology construction method includes following Step：
Step one, base station counts the content storage condition of each mobile node, and sets up content storage table；
Step 2, the position of architecture each node simultaneously calculates the distance between all nodes, according to distance and path Communication link can be set up between loss model calculate node；
Step 3, base station calculates the node related to mobile node according to content Distribution and node content storage condition Weight；Content gesture between definition node, according to the weight of the link between content gesture calculate node；
Step 4, according to all nodes under the covering of base station, the content stored in node, and the link structure between node Into content topology.
Further, the content topology construction method specifically includes following steps：
The first step, mobile node obtains content and after storing to the information of base station transmission storage content, and base station is according to receiving Information Statistics each mobile nodes content storage condition, and for each node sets up content storage table, included in the table The ID sequence numbers of equipment and the title of each node storage content；
Collect the position of each node and calculate the Euclidean distance d between any two node u and i in second step, base stationu,i, Link can be set up according between distance and path loss model calculate node, can set up the condition of link is
Wherein, PmaxThe maximum transmission power of node is represented,Channel gain is represented, α is path-loss factor, and N is represented Noise power at node i, to receive signal-noise ratio threshold value, sensitivity and bit error rate requirement according to receiver determine Γ；
3rd step, base station calculates the node weight related to mobile device according to the content that content Distribution and equipment are stored Weight；
4th step, the content gesture between definition node, according to the weight of the link between content gesture calculate node；
5th step, according to all nodes under the covering of base station, the content stored in node, and the link structure between node Into content topology G=(U, E, WU,WE) wherein, U represents the set of node, and E represents the set of link, WURepresent node weights Set, WERepresent the set of link weight.
Further, the 3rd step is specifically included：
(1) base station obtains content Distribution by content service provider, and Distribution represents hobby journey of the node to content Degree, represents the probability distribution of node request content；The probability of node u request contents c is expressed as Du,c, it is possible to it is distributed with Zipf To portray：
Wherein ΔuThe drift rate of different user to content preference is represented, it is true according to the particular content that different user is liked It is fixed；σuRepresent that user concentrates or disperse to the hobby of content, σuValue is larger to represent that user's request concentrates on popular lacking In number content, otherwise ask more dispersed；C represents that user gathers.
(2) weight of node can be expressed as wu=∑c∈Cxu,cDu,cSc；Wherein, xu,cRepresent nodeuWhether storage content C, if storage, xu,c=1, otherwise xu,c=0；ScRepresent the size of content；The weight of node is represented to be needed when node has content Content is obtained when asking from the storage of oneself, so as to save the load flow for flowing to base station, these load flows saved are Node weights.
Further, the 4th step is specifically included：
(1) content gesture：Content gesture on content c from node u to node i can be expressed as xu,c-xi,c；Represent two sections The tendency of the sharing contents each other produced because of storage content difference between point, the gesture of node u to node i is big to represent node u There is stronger ability for node i sharing contents, vice versa；
(2) weight that can obtain link between two nodes u and i according to content gesture is：
The flow that representing node u can bring to node i sharing contents tendency is saved, and is to link valency between two nodes The assessment of value.
Communicated another object of the present invention is to provide a kind of device-to-device for applying the content topology construction method System.
Advantages of the present invention and good effect are：By the gesture of storage content between definition node, node weights and link weight Carry out content construction topology again, clearly expression content storage, opening up between node location, and the distribution three of inter-node link Flutter relation.The content topology of structure can specify the coupled relation between disclosure storage and content transmission, i.e. node storage Content determines the validity of inter-node link transferring content, and Link Active state determines storage and distribution of the content on node.
The structure of content topology can provide a kind of clearly excellent for the shared transmission of the storage of joint content and content in the present invention Change modeling scheme, such that it is able to solve the coupled problem between content storage and content transmission by control content topology, reach To the purpose for making full use of storage resource and Radio Resource.
Brief description of the drawings
Fig. 1 is content topology construction method flow chart provided in an embodiment of the present invention.
Fig. 2 is applicable network scenarios schematic diagram provided in an embodiment of the present invention.
Fig. 3 is the flow chart of embodiment provided in an embodiment of the present invention.
Fig. 4 is topology constructing exemplary plot provided in an embodiment of the present invention.
Specific embodiment
In order to make the purpose , technical scheme and advantage of the present invention be clearer, with reference to embodiments, to the present invention It is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not used to Limit the present invention.
Application principle of the invention is explained in detail below in conjunction with the accompanying drawings.
As shown in figure 1, content topology construction method provided in an embodiment of the present invention is comprised the following steps：
S101：Base station counts the content storage condition of each mobile node, and sets up content storage table；
S102：The position of architecture each node simultaneously calculates the distance between all nodes, is damaged according to distance and path Communication link can be set up between consumption model calculate node；
S103：Base station calculates the node weight related to mobile node according to content Distribution and node content storage condition Weight；Content gesture between definition node, according to the weight of the link between content gesture calculate node；
S104：According to all nodes under the covering of base station, the content stored in node, and the link composition between node Content topology.
Application principle of the invention is further described below in conjunction with the accompanying drawings.
Reference picture 2, the network scenarios that the present invention is used considers the individual mobile device under a macro base station and base station service. Each mobile device represents a node, with unique ID sequence numbers, it is possible to obtain it by GPS or indoor positioning The positional information of itself.Arbitrary node is equipped with storage, memory capacity size；Total C file needs storage, arbitrary content Size be；Base station can track position and each node content storage condition of node, and determine node to content Request is oriented to the neighbor node of network or node to obtain content.If node obtains the interior of request by the D2D communication technologys Hold, the present invention only considers that node is jumped by one and communicated with the node of storage content, and communication between node is with unicast fashion Complete.Communication between node takes same frequency band, and the transmission power of each node is equal.
Reference picture 3, the embodiment of the present invention realizes that step is as follows：
Step 1, mobile node obtains content and after storing to the information of base station transmission storage content, and base station is according to receiving The content storage condition of Information Statistics each mobile nodes, and for each node sets up content storage table, comprising setting in the table Standby ID sequence numbers and the title of each node storage content；
Collect the position of each node and calculate the Euclidean distance d between any two node u and i in step 2, base stationu,i, Link can be set up according between distance and path loss model calculate node, can set up the condition of link is
Wherein, PmaxThe maximum transmission power of node is represented,Channel gain is represented, α is path-loss factor, and N is represented Noise power at node i, to receive signal-noise ratio threshold value, sensitivity and bit error rate requirement according to receiver determine Γ.
Step 3, base station calculates the node weight related to mobile device according to the content that content Distribution and equipment are stored Weight：
(3a) base station obtains content Distribution by content service provider, and Distribution represents hobby journey of the node to content Degree, represents the probability distribution of node request content；The probability of node u request contents c is expressed as Du,c, it is possible to it is distributed with Zipf To portray：
Wherein ΔuThe drift rate of different user to content preference is represented, it is true according to the particular content that different user is liked It is fixed；σuRepresent that user concentrates or disperse to the hobby of content, σuValue is larger to represent that user's request concentrates on popular lacking In number content, otherwise ask more dispersed；C represents that user gathers.
The weight of (3b) node can be expressed as wu=∑c∈Cxu,cDu,cSc；Wherein, xu,cIn representing whether node u stores Hold c, if storage, xu,c=1, otherwise xu,c=0；ScRepresent the size of content；The weight of node is represented when node has content Content is obtained during demand from the storage of oneself, so as to save the load flow for flowing to base station, these load flows saved are It is node weights.
Step 4, the content gesture between definition node, according to the weight of the link between content gesture calculate node：
(4a) content gesture：Content gesture on content c from node u to node i can be expressed as xu,c-xi,c；Represent two The tendency of the sharing contents each other produced because of storage content difference between node, the big expression node of gesture of node u to node i U has stronger ability for node i sharing contents, and vice versa；
(4b) is according to the weight that content gesture can obtain link between two nodes u and i：
The flow that representing node u can bring to node i sharing contents tendency is saved, and is to link valency between two nodes The assessment of value.
Step 5, according to all nodes under the covering of base station, the content stored in node, and the link structure between node Into content topology G=(U, E, WU,WE) wherein, U represents the set of node, and E represents the set of link, WURepresent node weights Set, WERepresent the set of link weight.
Reference picture 4, present disclosure topology constructing example is to take out content topology figure from actual audio-visual picture.
Presently preferred embodiments of the present invention is the foregoing is only, is not intended to limit the invention, it is all in essence of the invention Any modification, equivalent and improvement made within god and principle etc., should be included within the scope of the present invention.

Claims (5)

1. a kind of content topology construction method, it is characterised in that the content topology construction method is comprised the following steps：
Step one, base station counts the content storage condition of each mobile node, and sets up content storage table；
Step 2, the position of architecture each node simultaneously calculates the distance between all nodes, according to distance and path loss Communication link can be set up between model calculate node；
Step 3, base station calculates the node weight related to mobile node according to content Distribution and node content storage condition Weight；Content gesture between definition node, according to the weight of the link between content gesture calculate node；
Step 4, according to all nodes that base station covering is lower, the content stored in node, and link between node constitute it is interior Hold topology.
2. content topology construction method as claimed in claim 1, it is characterised in that the content topology construction method is specifically wrapped Include following steps：
The first step, mobile node obtains content and sends the information of storage content after storing to base station, and base station is according to the letter for receiving Breath counts the content storage condition of each mobile node, and for each node sets up content storage table, equipment is included in the table ID sequence numbers and each node storage content title；
Collect the position of each node and calculate the Euclidean distance d between any two node u and i in second step, base stationu,i, according to Link can be set up between distance and path loss model calculate node, can set up the condition of link is：
P m a x d u , i - α N ≥ Γ ;
Wherein, PmaxThe maximum transmission power of node is represented,Channel gain is represented, α is path-loss factor, and N represents node i The noise power at place, to receive signal-noise ratio threshold value, sensitivity and bit error rate requirement according to receiver determine Γ；
3rd step, base station calculates the node weights related to mobile device according to the content that content Distribution and equipment are stored；
4th step, the content gesture between definition node, according to the weight of the link between content gesture calculate node；
5th step, according to all nodes that base station covering is lower, the content stored in node, and link between node constitute it is interior Hold topology G=(U, E, WU,WE) wherein, U represents the set of node, and E represents the set of link, WURepresent the collection of node weights Close, WERepresent the set of link weight.
3. content topology construction method as claimed in claim 2, it is characterised in that the 3rd step is specifically included：
(1) base station obtains content Distribution by content service provider, and Distribution represents fancy grade of the node to content, generation The probability distribution of table node request content；The probability of node u request contents c is expressed as Du,c, it is possible to carved with Zipf distributions Draw：
D u , c = 1 | u - c | σ u Σ k ∈ C k - σ u ;
Wherein ΔuThe different user of expression determines to the drift rate of content preference according to the particular content that different user is liked；σu Represent that user concentrates or disperse to the hobby of content, σuValue is larger to represent that user's request is concentrated in popular minority Rong Shang, on the contrary ask more dispersed；C represents that user gathers；
(2) weight of node is expressed asWherein, xu,cRepresent node u whether storage content c, if deposited Store up, then xu,c=1, otherwise xu,c=0；ScRepresent the size of content；The weight of node is represented when node has content requirements from certainly Content is obtained in oneself storage.
4. content topology construction method as claimed in claim 2, it is characterised in that the 4th step is specifically included：
(1) content gesture：Content gesture on content c from node u to node i can be expressed as xu,c-xi,c；Represent two nodes it Between the tendency of sharing contents each other that is produced because of storage content difference, the big expression node u of gesture of node u to node i has more Strong ability is node i sharing contents, and vice versa；
(2) weight that can obtain link between two nodes u and i according to content gesture is：
w u → i = Σ c ∈ C ( x u , c - x i , c ) D i , c S c ;
The flow that representing node u can bring to node i sharing contents tendency is saved, and is that link between two nodes is worth Assessment.
5. the device-to-device communication system of content topology construction method described in a kind of application Claims 1 to 4 any one.
CN201710126919.9A 2017-03-06 2017-03-06 Content topology construction method and system Active CN106888462B (en)

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 true CN106888462A (en) 2017-06-23
CN106888462B 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 (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020138437A1 (en) * 2001-01-08 2002-09-26 Lewin Daniel M. Extending an internet content delivery network into an enterprise environment by locating ICDN content servers topologically near an enterprise firewall
CN101184021A (en) * 2007-12-14 2008-05-21 华为技术有限公司 Method, equipment and system for implementing stream media caching replacement
CN101466025A (en) * 2007-12-17 2009-06-24 阿尔卡泰尔卢森特公司 Method for distributing content data packages originated by users of a super peer-to-peer network
CN105245592A (en) * 2015-09-29 2016-01-13 西安电子科技大学 Mobile network base station cache content placing method based on nearby cache cooperation
CN105791391A (en) * 2016-01-29 2016-07-20 西安交通大学 Method for calculating optimal cooperation distance of 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

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020138437A1 (en) * 2001-01-08 2002-09-26 Lewin Daniel M. Extending an internet content delivery network into an enterprise environment by locating ICDN content servers topologically near an enterprise firewall
CN101184021A (en) * 2007-12-14 2008-05-21 华为技术有限公司 Method, equipment and system for implementing stream media caching replacement
CN101466025A (en) * 2007-12-17 2009-06-24 阿尔卡泰尔卢森特公司 Method for distributing content data packages originated by users of a super peer-to-peer network
CN105245592A (en) * 2015-09-29 2016-01-13 西安电子科技大学 Mobile network base station cache content placing method based on nearby cache cooperation
CN105791391A (en) * 2016-01-29 2016-07-20 西安交通大学 Method for calculating optimal cooperation distance of 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
CN106888462B (en) 2020-05-01

Similar Documents

Publication Publication Date Title
Zhou et al. Energy-efficient matching for resource allocation in D2D enabled cellular networks
Pantisano et al. Cache-aware user association in backhaul-constrained small cell networks
Zhao et al. A non-orthogonal multiple access-based multicast scheme in wireless content caching networks
Li et al. Coalitional games for resource allocation in the device-to-device uplink underlaying cellular networks
CN102595314B (en) Position-information-based device-to-device (D2D) clustering multicast method
JP2019024248A (en) Method and apparatus for realizing neighboring service in mobile communication network
Sun et al. A distributed approach to improving spectral efficiency in uplink device-to-device-enabled cloud radio access networks
Wen et al. Energy-efficient device-to-device edge computing network: An approach offloading both traffic and computation
Chen et al. Optimal power and bandwidth allocation for multiuser video streaming in UAV relay networks
He et al. Resource allocation based on graph neural networks in vehicular communications
Wang et al. Reliable wireless connections for fast-moving rail users based on a chained fog structure
CN106162846A (en) A kind of two users NOMA descending efficiency optimization method considering SIC energy consumption
CN110337092B (en) Low-power-consumption relay selection method based on social trust model
CN105636216A (en) Robust power allocation method based on throughput maximization
Xia et al. Cooperative content delivery in multicast multihop device-to-device networks
Barik et al. An efficient data transmission scheme through 5G D2D-enabled relays in wireless sensor networks
CN104683986B (en) Orthogonal resource secret sharing based on cooperating relay in the cellular network of embedded D2D
Zhuoming et al. Fuzzy mathematics and game theory based D2D multicast network construction
Narottama et al. Impact of number of devices and data rate variation in clustering method on device-to-device communication
CN104378151B (en) Greedy relay selection method based on CDMA slotted ALOHA in extensive junction network
Miao et al. 4-DMWM approach for caching based optimal D2D pairing and channel allocation: Centralized and distributed algorithm design
CN107249213B (en) A kind of maximized power distribution method of D2D communication Intermediate Frequency spectrum efficiency
CN106888462A (en) A kind of content topology construction method
Li et al. Promoting energy efficiency and proportional fairness in densely deployed backscatter-aided networks
CN107302747A (en) A kind of cooperation video transmission method based on stable matching

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