CN105610941B - A kind of data fragmentation caching method based on node grouping in mobile network - Google Patents
A kind of data fragmentation caching method based on node grouping in mobile network Download PDFInfo
- Publication number
- CN105610941B CN105610941B CN201511004459.XA CN201511004459A CN105610941B CN 105610941 B CN105610941 B CN 105610941B CN 201511004459 A CN201511004459 A CN 201511004459A CN 105610941 B CN105610941 B CN 105610941B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- caching
- cache
- group
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention provides the data fragmentation caching methods based on node grouping in a kind of mobile network, mainly include divide cooperative groups, data sharing three phases between cooperation caching, group in group.It is cooperative groups by the node division adjacent with central node according to node centered on the significance level selected part node of nodes；Caching task is distributed according to group cache information table by central node in group, manages the data buffer storage in cooperative groups；By realizing data cached fragment using the most short contacting time between node between group, the caching upper limit for limiting node using duration of contact total between node simultaneously improves the utilization rate of spatial cache, and coding is carried out to data slice by coding mode and solves the problems, such as gift coupon collecting, the cooperation caching for finally realizing the whole network, improves the efficiency of data access in mobile network environment.
Description
Technical field
The present invention relates to technical field of the computer network, are divided more specifically in a kind of mobile network based on node
The data fragmentation caching method of group.
Background technique
Caching technology, which is usually used to, improves data access efficiency in network, but in mobile network environment, mobile node
All be to be played the part of by handheld intelligent terminal device, there is a problem of that electricity and spatial cache are resource-constrained, this with it is traditional wired
There are larger differences for network environment, it is therefore desirable to be suitble to the special caching method of mobile environment.
Cooperation caching technology using the cache resources for cooperating shared node of node by being improved in mobile environment
Data access efficiency.All assume that cache node can be transmitted in a contact process in the research of existing cooperation caching
Total data required for data requester, however in real mobile network this hypothesis and do not have generality because move
Rotating ring border interior joint has mobility, this makes the duration of contact between node extremely limited, when the number of cache node caching
According to it is larger when, it is not achievable that all data are transmitted within limited time of contact, thus improve data access efficiency
The data volume that cache node and each cache node can cache must be reasonably selected.
The targeted mobile network environment of the present invention is as shown in Figure 1.In this scenario, when (intelligent movable is whole for mobile node
End equipment) in AP (wireless access point) coverage area when, mobile node can directly from AP obtain needed for data；However work as
When mobile node is in except AP coverage area, the data on AP can not be directly acquired, but at this moment can be obtained from other nodes
Access evidence.
Due to the limitation of time of contact, data possibly can not be transmitted in a contact process.If only simple
Data are divided into multiple continuous data packets by ground, must just collect all data packets to restore data, and this will lead
Cause the appearance of gift coupon collecting problem.I.e., it is assumed that there are s different data packets, and the probability phase that each data packet is collected into
Together, then data requester is in order to be collected into this s different data packets, the data packet sum of required collection is about Θ
(slogs).This mode data access efficiency is low, needs a kind of suitable solution to improve data in mobile network environment
The efficiency of access.
Summary of the invention
1. technical problems to be solved by the inivention
Based on above-mentioned analysis, the invention proposes mentioned in a kind of mobile network based on the cooperation caching strategy of node grouping
The method of data access efficiency in high mobile network environment；Battery capacity of the present invention by analysis node, the caching money of node
Node division in network is multiple cooperative groups by the significance level of source size and node in a network, passes through group pipe in group
Reason node coordinates the cachings of data in group, by realizing data sharing using touch opportunity limited between node between group, most
The cooperation caching for realizing the whole network eventually, improves the efficiency of data access in mobile network environment.
2. technical solution
In order to achieve the above objectives, technical solution provided by the invention are as follows:
Data fragmentation caching method based on node grouping in a kind of mobile network of the invention, comprising dividing cooperative groups,
Three parts of data sharing between cooperation caching and group in group:
Divide cooperative groups: by the battery capacity of analysis node, the cache resources size and node of node are in a network
Significance level, choose central node of the part of nodes as division cooperative groups in network, and connecing according to nodes
Touching history, which will be greater than in network with central node frequency of exposure, sets the node division of threshold values as same cooperative groups, while by center
Management node of the node as cooperative groups；
Cooperation caching in group:
(1) management node collects cache information table in the local cache information creating group of member node, management node in organizing
Collect member node information generation group cache information table；
(2) management node distributes caching task to member node according to the data access frequency of member node；
(3) member node is confirmed whether to receive the caching task of distribution according to cache information table itself；
(4) if the caching task that member node rejection distributes in step (3), management node choose another member node
Distribution task repeats step (3), (4) until data are cached；
Data sharing between group:
(a) regard the cooperative groups of division as cache node in network, calculated arbitrarily according to the contact model between node
The most short contact duration of node and the total duration of contact of each node, to show that each contact process can pass
The largest buffered data volume of defeated minimal data amount and each node；
(b) the minimal data amount according to obtained in (a) is to data cached carry out data fragmentation, and passes through linear network encoding
Technology encodes data, and the data after coding are finally sent to data requester；
(c) judge whether cache node caches the data received according to the cache information table of cache node, when caching number
Just give up the caching to the data when mesh reaches largest buffered data volume obtained in (a)；
(d) judge whether carry out data exchange when two cache nodes contact according to the buffer status of node.
Further, divide cooperative groups during Selection Center node measurement standard are as follows:
S=q1B+q2C+q3I
In formula, qiExpression weight, i=1,2,3；B indicates battery capacity；The cache resources size of C expression node；I is indicated
The significance level of node in a network；The battery capacity B of node, the cache resources size C of node, is provided by equipment itself
Api function programming obtains；The significance level of node in a network:
I=E (TC)/(E(TC)+E(TI))
Wherein, E (TC) be node and other node contact times mean value, E (TI) it is node and other node contact intervals
The mean value of time.
Further, it contacts with each other between nodes in node contact history record a period of time
Contact process information, including the node MAC addr once contacted, time started, end time, frequency of exposure and with the last time
The interval time of contact.
Further, in organizing during cooperation caching management node by comparing member node data access frequency
Fi, i=1,2 ,-..., N；Find out Fmax=Max (F1,F2,…,FN), to FmaxCorresponding member node amaxData buffer storage is sent to ask
It asks；If node amaxThe caching task of distribution is rejected, then management node selects access frequency from member node and is only second to node
amaxNode send data buffer storage request, distribute caching task according to access frequency size iteration and cached until data；
Further, the minimal data amount that can be transmitted is contacted between group in data sharing process every time:
dmin=tmin*d
Wherein, tminFor the average most short contact duration of any one node and other nodes, tiFor each node with
The most short contacting time of other nodes, M are cache node number, i=1,2 ... M.
Further, between group in data sharing process according to minimal data transmission quantity dmin, data cached P is divided into
With dminFor s data slice of unit, i.e. P={ p1,p2,…,ps, and generate code coefficient vector set at random from Galois FieldThe final stochastic linear combination for calculating s:Then by the data packet after coding
pj' it is sent to data requester.
Further, between group in data sharing process cache node i according to total duration of contactWith the ratio of most short contacting time, the largest buffered data volume R that each node can cache is obtainedi, when
RiWhen greater than total data fragmentation number s, node largest buffered data slice number is s, it may be assumed that
3. beneficial effect
Using technical solution provided by the invention, compared with existing well-known technique, there is following remarkable result:
(1) in a kind of mobile network of the invention based on node grouping data fragmentation caching method, according between node most
Small duration of contact reduces the time of contact limited influence to data access to data cached progress data fragmentation, reduces
Delay time of data access；
(2) the data fragmentation caching method based on node grouping in a kind of mobile network of the invention, is managed by choosing
Node manages cooperative groups concentratedly, is conducive to data cached control, reduces data cached redundancy in same cooperative groups, more
Add the cache resources for effectively utilizing node, it is more efficiently data cached in Partial global planning group；
(3) in a kind of mobile network of the invention based on node grouping data fragmentation caching method, using caching group as
Cache node increases the cache resources of cache node, reduces the frequency that data update on cache node, reduces node
Electric quantity consumption.
Detailed description of the invention
Fig. 1 is the targeted mixed mobile network scene figure of the present invention；
Fig. 2 is the flow chart that cooperative groups interior nodes obtain data in the present invention；
Fig. 3 is cooperative groups hum pattern in network；
Fig. 4 is the principal function program flow chart run in group interior nodes；
Fig. 5 is the data cached function program flow diagram run in group interior nodes；
Fig. 6 is the request of data function program flow diagram run in group interior nodes；
Fig. 7 is the principal function program flow chart run in management node；
Fig. 8 is the caching function program flow diagram run in management node.
Specific embodiment
To further appreciate that the contents of the present invention, the present invention is described in detail in conjunction with the accompanying drawings and embodiments.
Embodiment 1
In conjunction with attached drawing, the data fragmentation caching method being grouped in a kind of mobile network of the present embodiment based on node, mainly
Content including three aspects: cooperative groups, the cooperation caching in cooperative groups and the data sharing between cooperative groups are divided.
Dividing cooperative groups is mainly the battery capacity B, the cache resources size C and node of node for passing through analysis node
Significance level I in a network, and by calculating q1B+q2C+q3Value (the wherein q of Ii(i=1,2,3) it is corresponding weight) make
For the measurement standard of Selection Center node, it is denoted as S.Ratio ρ is chosen in certain simultaneously, the biggish node of S value in network is chosen and makees
It, and will be big with central node frequency of exposure in network according to the contact history of nodes for the central node for dividing cooperative groups
In the node division for the threshold values T being previously set be same cooperative groups, and using central node as the management node of cooperative groups.
Since the node in network is usually to be played the part of by mobile intelligent terminal equipment, the battery capacity of node in this process
B, the cache resources size C of node can be programmed by the api function that equipment itself provides and be obtained.And node significance level I=
E(TC)/(E(TC)+E(TI)), wherein E (TC) be node and other node contact times mean value, E (TI) it is node and other sections
The mean value of point contact interval time.The connectivity that I reflects node to a certain extent can be good at characterizing the important of node
Degree.Selection ratio ρ and threshold values T can carry out dynamic according to the contact frequency between the quantity and node of mobile node in network
Adjustment, such as: when nodes quantity increases, selection ratio and threshold values can be properly increased, so that possessing in network more
Cooperative groups, while it is more frequent to organize the contact between interior nodes and management node.
The contact history of the present embodiment interior joint are as follows: the contact to contact with each other between nodes in record a period of time
Procedural information is contacted including the node MAC addr once contacted, time started, end time, frequency of exposure and with the last time
Interval time.Acquisition process is as follows: being implanted into program on the mobile node, can obtain in moving process and connect with oneself
The MAC Address of node, and the information of entire contact process are touched, and is recorded by journal file, and over time
It is sent to AP point to be summarized, to form the contact historical information of nodes.Nodal information file format such as the following table 1 institute
Show:
1 nodal information file format of table
| Node MAC addr | Node MAC addr | Time started | End time | Frequency of exposure | Interval time |
| Node1 | Node2 | tstart | tend | Ctimes | tinterval |
The battery capacity of node, the cache resources size and node of node are considered when the present embodiment Selection Center node
Significance level in a network, centered on node should cooperate the data cached distribution task completed in cooperative groups, again
Data request information is forwarded in data access, while also to complete the data sharing between other node groups.It is empty in caching
Between using upper, central node needs cache information table in cache cooperation group member's nodal cache information and maintenance group.
Referring to Fig. 2, the cooperation caching in cooperative groups is realized, mainly include following procedure:
(1) for member node according to own cache information generation local cache information table, which includes that member saves in cooperative groups
The cached data entry of point, fragment number corresponding with data entry and the member node largest buffered fragment number.
Management node collects the local cache information table generation group cache information table of member node, which includes member node ID and should
The data entry that member node is cached.
(2) circular flow principal function (program flow chart is as shown in Figure 7) in management node, when management node receives letter
After breath, the type of information is first determined whether.If desired data cached Data then runs CacheOperation caching function
(program flow chart is as shown in Figure 8) calculates each member node to the access frequency F of the datai(i=1,2 ..., N),
Middle N is the number of member node.And find out a FmaxSo that Fmax=Max (F1,F2,…,FN), remember FmaxCorresponding node is
amax.Management node finds out F by comparing access frequency FmaxAfterwards, to corresponding member node amaxSend data buffer storage request；
If organize interior nodes transmission is data request information, RequestMessage function, the judgement of lookup group cache information table are run
Whether data can be provided for requesting node.
(3) circular flow principal function (program flow chart is as shown in Figure 4) in interior nodes is organized, when receiving information in group
Afterwards, information type is first determined whether.When the information received is cache request, then CacheData function (program circuit frame is run
Figure is as shown in Figure 5), group interior nodes first look at whether have enough cache resources for caching the data entry, if caching money
Limited data cached can not just send to management node in source refuses data cached information；Otherwise it just sends data to management node to ask
Ask that show can be data cached, and wait management node to send to need data cached be cached.When the information received is data
When request, then RequestData function (program flow chart is as shown in Figure 6) is run, first looks at node local cache information
Whether table caches the data, the returned data if caching；It is on the contrary then send data query information to management node, and it waits to be managed
The flow chart of node return information, data request process is as shown in Figure 2.
(4) when management node receives request of data, data Data is just sent to node amaxData buffer storage is carried out,
Local cache information table and group cache information table are modified simultaneously；If management node receives refusal data cached information, just
Access frequency F, which is selected, from member node is only second to node amaxOther nodes send data buffer storage request, then repeatedly step
(3), (4) are cached until data Data.
It realizes the data sharing between cooperative groups, mainly includes following procedure:
(1) assume to split the network into M cooperative groups during dividing cooperative groups, the present embodiment cooperates this M
Group regards M cache node in network as.The most short contact of each node Yu other nodes is calculated according to the contact history of node
Time ti(i=1,2 ..., M) and each node and the total duration of contact of other nodesSo
The average most short contact duration of any one node and other nodesIt is assumed that data transmission in network is fast
Constant rate is d, then once contacting minimum transmitted data amount is dmin=tmin*d。
T at the beginning of due to having recorded contact process between node in node contact historystart, end time tend, connect
Touch number CtimesAnd the interval time t contacted with the last timeinterval.It is now assumed that node i is with node j most short contacting time
tij, then
Wherein,At the beginning of when respectively the c times contact and the end time；
It can thus be concluded that the most short contacting time of node i:
ti=Min { tij| j=1,2 ..., M；j≠i}
It can similarly obtain total duration of contact of node i
(2) in order to solve the problems, such as brought by the simple fragment mentioned in background technique, the present embodiment uses stochastic linear
Network coding technique.Firstly, according to the minimal data transmission quantity d in (1)min, data cached P is divided into d on APminFor
S data slice of unit, i.e. P={ p1,p2,…,ps}.And generate code coefficient vector set at random from Galois FieldThe final stochastic linear combination for calculating s:Then AP is by the data packet after coding
It is sent to data requester.By random linear network encoding technology, the status of each data packet in network be it is equivalent,
Data requester only needs the data packet for collecting s linear independence that can restore original data, in this way can
Effectively improve the efficiency of data access.
(3) cache node i is according to total duration of contact in (1)With most short contacting time
Ratio Ri, show that the maximum data piece number that each node can cache is Ri, work as RiWhen greater than total data fragmentation number s,
Node largest buffered data slice number is s.That is: the largest buffered data slice number N of node iiFor
Each cache node safeguards a cache information table, which includes caching group ID, the maximum number that can be cached
According to fragment number, the data fragmentation number of current cache, and indicate the timestamp that data update, the results are shown in Table 2.
2 local cache information table of table
(4) when cache node receive AP transmission data packet when, according to the content analysis of cache information table in (3) whether
Cache the data packet.When the current cache data fragmentation number of cache node is less than the maximum data fragment number that can be cached
When, which just caches the data packet；Otherwise just give up the data packet without caching.
(5) cache node contacts in moving process, just carries out data exchange and updates cache information table.In data exchange
In the process, it is mainly carried out analysing whether exchange data packets according to the content of the cache information table of cache node.When the number of caching
It just will do it data exchange less than largest buffered number and when cache node still has spatial cache, realize the number between cache node
According to shared, i.e. data sharing between cooperative groups.
As shown in figure 3, three cooperative groups use A respectively, B, C are indicated.Now by taking cooperative groups A as an example, cooperative groups are described in detail
Interior cooperation caching strategy.
There are member node a in cooperative groups A for step 1)1,a2,a3,a4With management node a0, each member node maintenance one
Anticipatory remark ground cache information table Li(i=1,2,3,4), field has in table: node ID, data entry, data fragmentation number, and maximum is slow
Deposit fragment number.Management node a0Collect local cache information table LiGeneration group cache information table G, field has in table: node ID,
Data cached entry.
Step 2) is in moving process, management node a0Receive the data data that the needs of other cooperative groups transmission cache
When, management node a0Calculate all member node ai(i=1,2,3,4) to the access frequency F of data datai(i=1,2,3,4).
Step 3) management node a0It chooses the maximum node of access frequency F and sends data buffer storage information, it is assumed that F1=Max
(F1,F2,F3,F4) be maximum value, corresponding to node be a1, then management node a0Data buffer storage information is sent to a1。
Step 4) a1When receiving data buffer storage information, local cache information table L is checked1.When largest buffered fragment in table
When number is less than data cached fragment number, request of data just is sent to management node and obtains the data for needing to cache.Conversely,
It is just sent to management node and refuses data cached information.
Step 5) management node a0Receive a1After the information of transmission, information type is first determined whether, believe if request of data
Breath, then send the data to a1It is cached and modifies a group cache information table G；If refusal cache information, then access frequency is chosen
The big node of rate time executes step 3)~step 5), until receiving data request information.
Step 6) member node aiWhen receiving data cached, which is cached and modifies local cache information Li。
As shown in figure 3, three cooperative groups use A respectively, B, C are indicated.Now narration cooperative groups A in detail, the data between B, C are total
Enjoy strategy.
Step 1) calculates cooperative groups A, B, C shortest time of contact between each otherTo obtain cooperation
Average most short contacting time between groupIt can then show that contact can be transmitted minimum every time
According to amount dmin=tmin* d, it is steady state value that wherein d, which is data transmission in network rate,.
Step 2) calculates each cooperative groups and the total duration of contact of other cooperative groupsIt utilizesObtain the maximum data fragment R that each cooperative groups can cachei.But the maximum amount of data cannot
Largest buffered space more than cooperative groups limits.
Step 3) is on AP (wireless access point), it is assumed that data data size is D, according to D/dminRatio S by data
Data is divided into S data slice, i.e. data={ data1,data2..., datas}.And generate coding at random from Galois Field
Coefficient vector collectionThe final stochastic linear combination for calculating data:
The each cooperation group maintenance one of step 4) opens cache information table Gi' (i=A, B, C), the information table is as shown in table 3, packet
Have containing field: node ID, data cached entry.
3 groups of cache information tables of table
| Node ID | Data cached entry |
| i | data |
Step 5) directly can obtain data from AP when cooperative groups A is moved in AP coverage area.When cooperative groups obtain
After data, management node a0According to GA' information judge whether it is data cached.The step 2) of cooperation caching strategy in execution group~
Step 6).
Step 6) is in moving process, when cooperative groups A and cooperative groups B are contacted, is exchanged with each other cache information table, and according to
To information table judge whether from other side obtain data cache.
The present invention uses packet-based cooperation caching strategy, in the method will be in network according to the contact history of node
Node division is multiple cooperative groups, the touch opportunity with high probability between the node in the same cooperative groups.It utilizes simultaneously
Contact model between node, each cache node is limited according to longest time of contact between node can cache most each data
Big fragment quantity is substantially increased by the data sharing strategy between the cooperation caching strategy and cooperation tissue in cooperative groups
The efficiency of data access in mobile network environment.
Schematically the present invention and embodiments thereof are described above, description is not limiting, institute in attached drawing
What is shown is also one of embodiments of the present invention, and actual structure is not limited to this.So if the common skill of this field
Art personnel are enlightened by it, without departing from the spirit of the invention, are not inventively designed and the technical solution
Similar frame mode and embodiment, are within the scope of protection of the invention.
Claims (6)
1. the data fragmentation caching method based on node grouping in a kind of mobile network, it is characterised in that: comprising dividing cooperative groups,
Three parts of data sharing between cooperation caching and group in group:
It divides cooperative groups: passing through the battery capacity of analysis node, the weight of the cache resources size and node of node in a network
Degree is wanted, chooses central node of the part of nodes as division cooperative groups in network, and go through according to the contact of nodes
History, which will be greater than in network with central node frequency of exposure, sets the node division of threshold values as same cooperative groups, while by central node
Management node as cooperative groups；Wherein, the measurement standard of Selection Center node are as follows:
S=q1B+q2C+q3I
In formula, qiExpression weight, i=1,2,3；B indicates battery capacity；The cache resources size of C expression node；I indicates that node exists
Significance level in network；The battery capacity B of node, the cache resources size C of node, the API letter provided by equipment itself
Number programming obtains；The significance level of node in a network:
I=E (TC)/(E(TC)+E(TI))
Wherein, E (TC) be node and other node contact times mean value, E (TI) it is node and other node contact interval times
Mean value, while choosing ratio ρ in certain, choose central node of the biggish node of S value as division cooperative groups in network；
Cooperation caching in group:
(1) management node collects the local cache information creating group cache information table of member node in organizing；
(2) management node distributes caching task to member node according to the data access frequency of member node；
(3) member node is confirmed whether to receive the caching task of distribution according to cache information table itself；
(4) if the caching task that member node rejection distributes in step (3), management node chooses another member node distribution
Task repeats step (3), (4) until data are cached；
Data sharing between group:
(a) regard the cooperative groups of division as cache node in network, arbitrary node is calculated according to the contact model between node
The most short contact duration and the total duration of contact of each node, to obtain what each contact process can be transmitted
The largest buffered data volume of minimal data amount and each node；
(b) the minimal data amount according to obtained in (a) is to data cached carry out data fragmentation, and passes through linear network encoding technology
Data are encoded, the data after coding are finally sent to data requester；
(c) judge whether cache node caches the data received according to the group cache information table of cache node, when caching number
Just give up the caching to the data when reaching largest buffered data volume obtained in (a)；
(d) judge whether carry out data exchange when two cache nodes contact according to the buffer status of node.
2. the data fragmentation caching method based on node grouping in a kind of mobile network according to claim 1, feature
Be: the node contact history is to record the contact process information to contact with each other between nodes in a period of time,
When including the node MAC addr once contacted, time started, end time, frequency of exposure and with the last interval contacted
Between.
3. the data fragmentation caching method based on node grouping in a kind of mobile network according to claim 1 or 2, special
Sign is: in organizing during cooperation caching management node by comparing member node data access frequency Fi, i=1,2 ...,
N；Find out Fmax=Max (F1,F2,…,FN), to FmaxCorresponding member node amaxSend data buffer storage request；If node amaxIt refuses
The caching task of distribution is received absolutely, then management node selects access frequency from member node and is only second to node amaxNode send
Data buffer storage request distributes caching task until data are cached according to access frequency size iteration.
4. the data fragmentation caching method based on node grouping in a kind of mobile network according to claim 1, feature
It is: contacts the minimal data amount that can be transmitted between group in data sharing process every time:
dmin=tmin*d
Wherein, tminFor the average most short contact duration of any one node and other nodes, tiFor each node and other
The most short contacting time of node, M are cache node number, and i=1,2 ... M, d are data transmission in network rate, and d is constant
Value.
5. the data fragmentation caching method based on node grouping in a kind of mobile network according to claim 4, feature
It is: according to minimal data transmission quantity d in data sharing process between groupmin, data cached P is divided into dminFor the s of unit
A data slice, i.e. P={ p1,p2,…,ps, and generate code coefficient vector set at random from Galois FieldThe final stochastic linear combination for calculating s:Then by the data packet p ' after codingj
It is sent to data requester.
6. the data fragmentation caching method based on node grouping in a kind of mobile network according to claim 5, feature
Be: between group in data sharing process cache node i according to total duration of contactWith most short contact
The ratio of time obtains the maximum data piece number R that each node can cachei, work as RiWhen greater than total data fragmentation number s,
Node largest buffered data slice number is s, i.e. the largest buffered data slice number N of node iiAre as follows:
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511004459.XA CN105610941B (en) | 2015-12-28 | 2015-12-28 | A kind of data fragmentation caching method based on node grouping in mobile network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511004459.XA CN105610941B (en) | 2015-12-28 | 2015-12-28 | A kind of data fragmentation caching method based on node grouping in mobile network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105610941A CN105610941A (en) | 2016-05-25 |
| CN105610941B true CN105610941B (en) | 2019-03-05 |
Family
ID=55990475
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201511004459.XA Active CN105610941B (en) | 2015-12-28 | 2015-12-28 | A kind of data fragmentation caching method based on node grouping in mobile network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105610941B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106686399B (en) * | 2016-12-22 | 2019-07-02 | 陕西尚品信息科技有限公司 | It is a kind of based on joint cache structure network in video cache method |
| CN110365728A (en) * | 2018-04-10 | 2019-10-22 | 重庆邮电大学 | A kind of grouping cooperative caching system of Information central site network |
| CN109195174B (en) * | 2018-08-29 | 2021-07-09 | 安徽工业大学 | Boundary node judgment method based on local area projection |
| CN116707934B (en) * | 2023-06-20 | 2023-10-24 | 甘肃省地震局（中国地震局兰州地震研究所） | Data encryption transmission method based on wireless sensor network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103116645A (en) * | 2013-02-25 | 2013-05-22 | 广东欧珀移动通信有限公司 | Method and device for browsing webpage with mobile device |
| CN104394236A (en) * | 2014-12-18 | 2015-03-04 | 重庆邮电大学 | Distributed cooperative caching method capable of realizing node and message state combined perception |
-
2015
- 2015-12-28 CN CN201511004459.XA patent/CN105610941B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103116645A (en) * | 2013-02-25 | 2013-05-22 | 广东欧珀移动通信有限公司 | Method and device for browsing webpage with mobile device |
| CN104394236A (en) * | 2014-12-18 | 2015-03-04 | 重庆邮电大学 | Distributed cooperative caching method capable of realizing node and message state combined perception |
Non-Patent Citations (5)
| Title |
|---|
| Adaptive Contact Volume prediction in Delay Tolerant Networks;J. B. Pinto Neto, etc.;《2013 IEEE Symposium on Computers and Communications》;20140306;全文 |
| Cooperative caching algorithm based on grouping nodes in mobile ad hoc networks;Ke Han;《The 2010 IEEE International Conference on Information and Automation》;20100719;全文 |
| Energy efficient dynamic group caching in mobile Ad hoc networks for improving data accessibility;Atul Rao, etc.;《2012 International Conference on Recent Trends In Information Technology》;20120601;全文 |
| Social-Based Cooperative Caching in DTNs: A Contact Duration Aware Approach;Xuejun Zhuo, etc.;《2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems》;20111115;全文 |
| 机会网络节点协作缓存策略设计与实现;陈果，叶晖，赵明;《计算机工程》;20100920;第36卷(第18期);全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105610941A (en) | 2016-05-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105610941B (en) | A kind of data fragmentation caching method based on node grouping in mobile network | |
| CN104394236B (en) | Node combines the distributed collaborative caching method perceived with message status | |
| CN107846704A (en) | A kind of resource allocation and base station service arrangement method based on mobile edge calculations | |
| CN107968835B (en) | Wireless heterogeneous network video cache facility deployment method based on coding | |
| CN107071852B (en) | Can society's perception of community network and the method for routing of probabilistic forecasting towards moving machine | |
| CN104780210B (en) | Load-balancing method and device | |
| CN109429274A (en) | A kind of configuration method and corresponding intrument | |
| CN108881445B (en) | Cooperation caching method based on Gono game in fog calculation | |
| Wang et al. | Mobile traffic offloading by exploiting social network services and leveraging opportunistic device-to-device sharing | |
| CN108345643A (en) | A kind of data processing method and device | |
| CN106028391A (en) | Pedestrian flow statistics method and device | |
| Li et al. | Enhancing participant selection through caching in mobile crowd sensing | |
| CN107148306A (en) | A kind of low power loss communication method and device that network is gathered based on micro-energy | |
| CN104780173A (en) | System and method for selecting anonymous road section under location privacy protection in road network | |
| CN103281374A (en) | Method for rapid data scheduling in cloud storage | |
| CN105072589B (en) | A kind of data transmission method and Wide Area Netweork base satation of Wide Area Netweork base satation | |
| CN103701647B (en) | A kind of wireless network topology optimization generates method | |
| CN108521640A (en) | A kind of content distribution method in cellular network | |
| CN106209261B (en) | The mobile data collection method of three-dimensional UASNs based on probability neighborhood grid | |
| CN108449149A (en) | A kind of small base station resource distribution method of energy acquisition based on matching game | |
| CN101394418B (en) | General computation data processing control method based on mobile proxy | |
| CN108377473A (en) | File content distribution method in D2D is wireless buffer network and device | |
| CN103269519B (en) | A kind of processing resource allocation method and system in centralized base station framework | |
| CN106507415A (en) | A kind of content caching of mobile network-oriented and network cooperating method | |
| CN104601424B (en) | The passive transacter of master and method of probabilistic model are utilized in equipment control net |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |