CN104954986A - Opportunity-type data transmission method based on multiple behavior sites - Google Patents
Opportunity-type data transmission method based on multiple behavior sites Download PDFInfo
- Publication number
- CN104954986A CN104954986A CN201510307475.XA CN201510307475A CN104954986A CN 104954986 A CN104954986 A CN 104954986A CN 201510307475 A CN201510307475 A CN 201510307475A CN 104954986 A CN104954986 A CN 104954986A
- Authority
- CN
- China
- Prior art keywords
- user
- behavior
- place
- data
- timeslice
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
-
- 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/08—Protocols specially adapted for terminal emulation, e.g. Telnet
-
- 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/52—Network services specially adapted for the location of the user terminal
-
- 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/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
- H04W4/08—User group management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
- H04W8/08—Mobility data transfer
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Databases & Information Systems (AREA)
- Multimedia (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides an opportunity-type data transmission method based on multiple behavior sites, aiming to solve the problem of incapability of accurately sending data to attribute users of the behavior sites. According to the method, the user performs site behavior registration on a cloud server, the cloud server stores a user/behavior site combined matrix, and a server updates the matrix timely and returns a newest time slice vector to the user. A source user starts a data forwarding process after applying data from the cloud server. In the process of data forwarding, a circuit is initiated and messages are transmitted to the attribute users of h different behavior sites, wherein the h refers to the number of the sites. In the progressive gradient increase stage of forwarding, the messages are forwarded to intention receivers of the behavior sites layer by layer. The data are sent to the intention receivers of all the surrounding behavior sites in a multicast mode. The data are forwarded to the users of the behavior sites by taking user behavior attribute weights as forwarding conditions, so that data transmission rate is improved effectively and energy consumption is lowered.
Description
Technical field
The present invention proposes a kind of is the opportunistic data transmission method in place based on multirow, belongs to the crossing domain of opportunistic network and social networks.
Background technology
At present, traditional sensor network comes with some shortcomings: (1) needs manually to dispose a large amount of awareness apparatus in advance, and not only expensive, along with the expansion of scale, the complexity of system also sharply increases.(2) awareness apparatus static state is disposed, generally can not dense deployment, makes perception visual angle single, cannot comprehensive thorough perceptive object.(3) carry out forwarding data according to node ID, be not suitable for the network scenarios of height dynamic mobile, also cannot be applied to the network that there is special interests preference.
Along with the development of technology, emerge in multitude with the intelligent movable equipment enriching transducer, intelligent perception, as cognition technology of future generation, has become study hotspot in recent years.Smart mobile phone, as the major product of mobile device, can reflect the behavior property of holder truly, for intelligent perception technology brings opportunities and challenges.The high performance of mobile equipments spread all over the world has erected huge community network, mobile subscriber can obtain in community network, sharing data, makes intelligent perception technology create good using value by the collection to data, analysis for user's customized privatization service.
Intelligent perception is by carrying sharing individual by mobile Internet or obtaining the social perception task that data are carried out consciously, unconsciously cooperation has carried out complexity of awareness apparatus.Intelligent perception technology carries out perception activity by a large amount of universal mobile terminal device, overcomes the problem of awareness apparatus costliness, utilizes the mobile wisdom of people to carry out perception data in all directions.By analyzing the social of user, setting up the data-collecting mode being characterized as guide with user behavior, improve user's participation and Data Collection performance.
Data Collection is as a large key technology of intelligent perception, and the opportunistic Data Collection based on social action analysis becomes the main way of intelligent perception Data Collection.But opportunistic data collection techniques still faces some technical barriers at present: its calculating of the embedded device that (1) mobile subscriber adopts, storage capacity and battery power exist limitation.(2) how the social primary feature being intelligent perception and being different from other data perception patterns, extract the social property of people and to be quantified as computable unit be problem demanding prompt solution.(3) under general network condition, sensing node is the interaction data information when meeting only, and exchanges data chance is very valuable, and reduction time delay, the efficiency of transmission that improves become another challenge in opportunistic Data Collection.
Summary of the invention
The object of the invention is to solve how data to be precisely sent to by the mode that opportunistic forwards in intelligent perception application and there is the problem that multirow is properties user group.The present invention is by portraying BM25 model according to user property, calculate the similarity weights of user about specific behavior place, and send data to according to these weights that to have multirow be properties user, optimize the quantity of message copy in data transmission procedure, the data collection algorithm similar relative to other, the method has low-cost, high transmission rates characteristic.
This invention only considers the problem of single behavior property for the Data Transport Protocol in existing intelligent perception application, utilize the stability of user behavior, adopt server/user model, by server extraction user behavior attribute, and portray user behavior attribute by BM25 model, user/behavior place confederate matrix is stored in the middle of server formation, and the behavioural information immediate updating confederate matrix that server is uploaded according to user, guarantees the real-time of data, accuracy.When source user needs information to be sent to targeted customer, source user need ask for global information to server, and sends data by source user opportunistic, and user data privacy is guaranteed.Adopt ladder to increase progressively the mode combined with multicast in data transmission phase, effectively reduce message copy quantity, reduce and send energy consumption.According to relatively carrying out data retransmission about the correlation weights in behavior place between user, improve data transmission success.
Technical solution of the present invention is:
The invention provides a kind of is the opportunistic data transmission method in place based on multirow.Build Cloud Server, portray user property formation user/behavior place confederate matrix by BM25 and be stored in server.Source user to server request for data, and carries out opportunistic data retransmission according to user about the similarity weights of appointed place.
Explanation of nouns:
Timeslice ts
ij: the time that user i consumes at behavior place j;
User's mean activity timeslice number uts
i: user's sheet quantity of average activity time every day;
All user's mean activity timeslice number avts: all users sheet quantity of average activity time every day;
Duration regulates attribute E: for balancing Active duration between all users and unique user;
Behavior property BeA
ij: user i is about the correlation of behavior place j;
Place balanced nature BA
j: for balancing more with the less activity venue factor of flow of the people, the distribution situation of reflection people's behavior place in all users;
Behavior place weight w eight
ij: user i is to behavior place j correlation weights;
Behavior place threshold values th
j: j border, behavior place weights, user i behavior place weight w eight
ij>=th
jtime, think that user i is the Interests User of behavior place j.
Concrete steps:
Step 1: set number of users as n, place quantity is m, user i ∈ 1 ..., n} behavior place j ∈ 1 ..., the time that m} consumes is with timeslice quantity (time slice) ts
ijtolerance.The length (length of time slice) of timeslice is fixed as tl, if user i is T in the total time that behavior place j consumes
ij, then ts
ij=T
ij/ tl.Ts
ijreflection behavior place j is to the correlation of user i, and timeslice quantity is larger, and user is more relevant to this place.Each user i regularly submits the time T consumed about place j to server
ij, be called that behavior place is registered;
Step 2: the mobile trajectory data that server is submitted to according to user i, counting user i is to the timeslice vector T S in certain behavior place
i=(ts
i1, ts
i2... ts
im), and result of calculation is stored in server end with user/behavior place confederate matrix form.Server upgrades the information that in user/behavior place confederate matrix, this user is corresponding at every turn immediately when receiving the track data of user i, and will add up gained timeslice vector T S
isend to user.Wherein user/behavior place confederate matrix form is as shown in table 1:
Table 1: user/behavior place confederate matrix
Behavior place 1 | Behavior place 2 | Behavior place 3 | Behavior place 4 | |
User 1 | Timeslice ts 11 | Timeslice ts 12 | Timeslice ts 13 | Timeslice ts 14 |
User 2 | Timeslice ts 21 | Timeslice ts 22 | Timeslice ts 23 | Timeslice ts 24 |
User 3 | Timeslice ts 31 | Timeslice ts 32 | Timeslice ts 33 | Timeslice ts 34 |
User 4 | Timeslice ts 41 | Timeslice ts 42 | Timeslice ts 43 | Timeslice ts 44 |
Step 3: source user s specifies TBP=((p
1, th
1), (p
2, th
2) ..., (p
h, th
h)), h≤m, wherein p
jand th
j, j ∈ 1 ..., h} is respectively behavior place and corresponding behavior place threshold values; S sends behavior place vector P to server;
Step 4: server calculates all user's mean activity timeslice number avts, and sends to source user s.Wherein the computational methods of user's mean activity timeslice number avts are:
Step 5: server calculates place balanced nature vector BA (the place balanced nature BA that wherein BA vector all behavior places of specifying for source user are corresponding according to user/behavior place confederate matrix
jset), and be sent to source user s.Wherein, place balanced nature BA
jcomputational methods be:
Pv
jfor the total number of persons (flow of the people) of average access every day of behavior place j, namely in confederate matrix, jth row are not the number of 0.BA
jas global factor, it is considered that the relative importance of behavior place j.Known according to formula (2), given area total number of persons, more people arrived this place, and so the value of balance factor will be less.What balance factor reflected is the distribution situation of interested site in all personnel, balances the final behavior weights in the less but important behavior place of flow of the people with this.
Step 6: source user s, by user's mean activity timeslice number avts and place balanced nature vector BA, sends to each user r that meets, calculate separately about place j ∈ 1 ..., the weight w eight of h}
sjand weight
rj; Behavior place weight calculation method is as follows:
Calculate Active duration and regulate attribute E
i:
Wherein uts
irepresent that user i consumes activity time sheet sum every day,
duration regulates attribute representative user i to the consideration of timeslice sum.K
1, b is empirical parameter.B is for regulating user i timeslice ratio, and span is [0,1].When b value is 0 in representation formula not service time sheet ratio, will complete timeslice ratio be used when b value is 1
Calculating behavior factor B A:
BeA
ijrepresent that user i is to the degree of correlation of behavior place j, its value is higher, illustrates that user i is more relevant to place j.
User i for the computational methods of the weights of behavior place j is:
weight
ij=BeA
ij·BA
j(5)
Step: 7: enter the initiating line stage, if weight
rj>=weight
sjif this user is r
j, then source user by data retransmission to r
j, otherwise do not forward;
Step 8: repeat step: 6-step 7, until all h behavior place all searches out all corresponding all r
j;
Step 9: source user s deletes the data that self preserves, now source user is initialized h bar and increases progressively route;
Step: 10: the user r on every bar circuit
jinquire the weights Weight of user q about behavior place j that meet
qj;
Step 11: enter gradient incremental stages, if weight
qj>=weight
rjj, then r
jforward the data to q, r
jdelete data; Otherwise do not forward;
Step: 12: repeat step 10-step 11, until weight
qj>=th
j;
Step: 13: enter the multicast stage, in data lifetime, meets weight for any user q
qj>=th
jif meet any user t and meet
then user q copies data to user t, terminates.
Beneficial effect
The invention solves in intelligent perception application is place opportunistic data transmission problems about multirow.Through knowing at ONE platform emulation experiment show, be that place opportunistic transmission plan has following significant advantage relative to traditional single file:
1. by portraying many behavior properties of user, using the data retransmission foundation that weights are place as multirow, can effectively transfer data in the customer group with many behavior properties, improve the accuracy rate of transfer rate and data transmission.
2. have employed the data transfer mode that gradient increases progressively and multicast combines in data-gathering process, effectively reduce data trnascription quantity in repeating process, reduce transmission energy consumption.
Accompanying drawing explanation
Fig. 1 is the opportunistic data transmission method flow chart in place based on multirow.
Fig. 2 user/cloud platform interaction models.
Fig. 3 user/behavior place confederate matrix.
Fig. 4 multirow is locality data transmission method schematic diagram.
Embodiment
Embodiments of the present invention are introduced below in conjunction with accompanying drawing.
The invention provides a kind of is the opportunistic data transmission method in place based on multirow, the many behavior properties of the method to mobile subscriber are portrayed, use the data retransmission foundation that weights are place as multirow, can effectively transfer data in the customer group with many behavior properties.The concrete implementing procedure of the method as shown in Figure 1.The method needs Cloud Server support, calculates user data, and carry out real time data interworking in order to store.User/cloud platform interaction models as shown in Figure 2.
Concrete implementation step is:
Step 1: set number of users as n, place quantity is m, user i ∈ 1 ..., n} behavior place j ∈ 1 ..., the time that m} consumes is with timeslice quantity (time slice) ts
ijtolerance.The length (length of time slice) of timeslice is fixed as tl, if user i is T in the total time that behavior place j consumes
ij, then ts
ij=T
ij/ tl.Ts
ijreflection behavior place j is to the correlation of user i, and timeslice quantity is larger, and user is more relevant to this place.Each user i regularly submits the time T consumed about place j to server
ij, be called that behavior place is registered;
Step 2: the mobile trajectory data that server is submitted to according to user i, counting user i is to the timeslice vector T S in certain behavior place
i=(ts
i1, ts
i2... ts
im), and result of calculation is stored in server end with user/behavior place confederate matrix form.User/behavior place confederate matrix as shown in Figure 3.Server upgrades the information that in user/behavior place confederate matrix, this user is corresponding at every turn immediately when receiving the track data of user i, and will add up gained timeslice vector T S
isend to user;
Step 3: source user s specifies TBP=((p
1, th
1), (p
2, th
2) ..., (p
h, th
h)), h≤m, wherein p
jand th
j, j ∈ 1 ..., h} is respectively behavior place and corresponding behavior place threshold values; S sends behavior place vector P to server;
Step 4: server calculates all user's mean activity timeslice number avts, and sends to source user s.Wherein the computational methods of user's mean activity timeslice number avts are:
Step 5: server calculates place balanced nature vector BA (the place balanced nature BA that wherein BA vector all behavior places of specifying for source user are corresponding according to user/behavior place confederate matrix
jset), and be sent to source user s.Wherein, place balanced nature BA
jcomputational methods be:
Pv
jfor the total number of persons (flow of the people) of average access every day of behavior place j, namely in confederate matrix, jth row are not the number of 0.BA
jas global factor, it is considered that the relative importance of behavior place j.Known according to formula (2), given area total number of persons, more people arrived this place, and so the value of balance factor will be less.What balance factor reflected is the distribution situation of interested site in all personnel, balances the final behavior weights in the less but important behavior place of flow of the people with this.
Step 6 below-step 12 is data transfer phase, and process as shown in Figure 4.
Step 6: source user s, by user's mean activity timeslice number avts and place balanced nature vector BA, sends to each user r that meets, calculate separately about place j ∈ 1 ..., the weight w eight of h}
sjand weight
rj; Behavior place weight calculation method is as follows:
Calculate Active duration and regulate attribute E
i:
Wherein uts
irepresent that user i consumes activity time sheet sum every day,
duration regulates attribute representative user i to the consideration of timeslice sum.K
1, b is empirical parameter.B is for regulating user i timeslice ratio, and span is [0,1].When b value is 0 in representation formula not service time sheet ratio, will complete timeslice ratio be used when b value is 1
Calculating behavior factor B A:
BeA
ijrepresent that user i is to the degree of correlation of behavior place j, its value is higher, illustrates that user i is more relevant to place j.
User i for the computational methods of the weights of behavior place j is:
weight
ij=BeA
ij·BA
j(5)
Step: 7: enter the initiating line stage, if weight
rj>=weight
sjif this user is r
j, then source user by data retransmission to r
j, otherwise do not forward;
Step 8: repeat step: 6-step 7, until all h behavior place all searches out all corresponding all r
j;
Step 9: source user s deletes the data that self preserves, now source user is initialized h bar and increases progressively route;
Step: 10: the user r on every bar circuit
jinquire the weights Weight of user q about behavior place j that meet
qj;
Step 11: enter gradient incremental stages, if weight
qj>=weight
rjj, then r
jforward the data to q, r
jdelete data; Otherwise do not forward;
Step: 12: repeat step 10-step 11, until weight
qj>=th
j;
Step: 13: enter the multicast stage, in data lifetime, meets weight for any user q
qj>=th
jif meet any user t and meet
then user q copies data to user t, terminates.
Claims (1)
1. be the opportunistic data transmission method in place based on multirow, it is characterized in that, concrete steps are as follows:
Step 1: set number of users as n, place quantity is m, user i ∈ 1 ..., n} behavior place j ∈ 1 ..., the time that m} consumes is with timeslice quantity (time slice) ts
ijtolerance, the length of timeslice is fixed as tl, if user i is T in the total time that behavior place j consumes
ij, then ts
ij=T
ij/ tl;
Step 2: the mobile trajectory data that server is submitted to according to user i, counting user i is to the timeslice vector T S in certain behavior place
i=(ts
i1, ts
i2... ts
im), and result of calculation is stored in server with user/behavior place confederate matrix form; Server upgrades the information that in user/behavior place confederate matrix, this user is corresponding at every turn immediately when receiving the track data of user i, and will add up gained timeslice vector T S
isend to user;
Step 3: source user s specifies TBP=((p
1, th
1), (p
2, th
2) ..., (p
h, th
h)), h≤m, wherein p
jand th
j, j ∈ 1 ..., h} is respectively behavior place and corresponding behavior place threshold values; S sends behavior place vector P to server;
Step 4: server calculates all user's mean activity timeslice number avts, and sends to source user s, and wherein the computational methods of user's mean activity timeslice number avts are:
Step 5: server calculates place balanced nature vector BA according to user/behavior place confederate matrix, and is sent to source user s, wherein, place balanced nature BA
jcomputational methods be:
Pv
jfor the total number of persons of average access every day of behavior place j, namely in confederate matrix, jth row are not the number of 0; BA
jas global factor, it is considered that the relative importance of behavior place j;
Step 6: source user s, by user's mean activity timeslice number avts and place balanced nature vector BA, sends to each user r that meets, calculate separately about place j ∈ 1 ..., the weight w eight of h}
sjand weight
rj; Behavior place weight calculation method is as follows:
Calculate Active duration and regulate attribute E
i:
Wherein uts
irepresent that user i consumes activity time sheet sum every day,
duration regulates attribute representative user i to the consideration of timeslice sum.K
1, b is empirical parameter; B is for regulating user i timeslice ratio, and span is [0,1]; When b value is 0 in representation formula not service time sheet ratio, will complete timeslice ratio be used when b value is 1
Calculating behavior factor B A:
BeA
ijrepresent that user i is to the degree of correlation of behavior place j, its value is higher, illustrates that user i is more relevant to place j;
User i for the computational methods of the weights of behavior place j is:
weight
ij=BeA
ij·BA
j(5)
Step: 7: enter the initiating line stage, if weight
rj>=weight
sjif this user is r
j, then source user by data retransmission to r
j, otherwise do not forward;
Step 8: repeat step: 6 to step 7, until all h behavior place all searches out all corresponding all r
j;
Step 9: source user s deletes the data that self preserves, now source user is initialized h bar and increases progressively route;
Step: 10: the user r on every bar circuit
jinquire the weights Weight of user q about behavior place j that meet
qj;
Step 11: enter gradient incremental stages, if weight
qj>=weight
rjj, then r
jforward the data to q, r
jdelete data; Otherwise do not forward;
Step: 12: repeat step 10-step 11, until weight
qj>=th
j;
Step: 13: enter the multicast stage, in data lifetime, meets weight for any user q
qj>=th
jif meet any user t and meet
then user q copies data to user t, terminates.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510307475.XA CN104954986B (en) | 2015-06-05 | 2015-06-05 | A kind of opportunistic data transmission method based on more behavior places |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510307475.XA CN104954986B (en) | 2015-06-05 | 2015-06-05 | A kind of opportunistic data transmission method based on more behavior places |
Publications (2)
Publication Number | Publication Date |
---|---|
CN104954986A true CN104954986A (en) | 2015-09-30 |
CN104954986B CN104954986B (en) | 2018-04-10 |
Family
ID=54169263
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201510307475.XA Active CN104954986B (en) | 2015-06-05 | 2015-06-05 | A kind of opportunistic data transmission method based on more behavior places |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN104954986B (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105872957A (en) * | 2016-05-04 | 2016-08-17 | 西安交通大学 | Chance type data uploading method for crowd sensing |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101977226A (en) * | 2010-10-28 | 2011-02-16 | 北京航空航天大学 | Novel opportunity network data transmission method |
CN103747523A (en) * | 2014-01-14 | 2014-04-23 | 上海河广信息科技有限公司 | User position predicating system and method based on wireless network |
CN104199828A (en) * | 2014-07-26 | 2014-12-10 | 复旦大学 | Method for establishing social network based on transaction log data |
-
2015
- 2015-06-05 CN CN201510307475.XA patent/CN104954986B/en active Active
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101977226A (en) * | 2010-10-28 | 2011-02-16 | 北京航空航天大学 | Novel opportunity network data transmission method |
CN103747523A (en) * | 2014-01-14 | 2014-04-23 | 上海河广信息科技有限公司 | User position predicating system and method based on wireless network |
CN104199828A (en) * | 2014-07-26 | 2014-12-10 | 复旦大学 | Method for establishing social network based on transaction log data |
Non-Patent Citations (1)
Title |
---|
WEI-JEN HSU, DEBOJYOTI DUTTA, AHMED HELMY: "CSI: A paradigm for behavior-oriented profile-cast services in mobile networks", 《AD HOC NETWORKS》 * |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105872957A (en) * | 2016-05-04 | 2016-08-17 | 西安交通大学 | Chance type data uploading method for crowd sensing |
CN105872957B (en) * | 2016-05-04 | 2019-01-18 | 西安交通大学 | A kind of opportunistic data uploading method towards intelligent perception |
Also Published As
Publication number | Publication date |
---|---|
CN104954986B (en) | 2018-04-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN103024017B (en) | A kind of social networks important goal and Community Group recognition methods | |
CN111178408B (en) | Health monitoring model construction method and system based on federal random forest learning | |
CN105718465A (en) | Geofence generation method and device | |
CN103001805A (en) | Web user flow producing method based on user behavior analysis | |
CN103971555A (en) | Multi-level automated assessing and training integrated service method and system | |
Hassani et al. | Context-aware recruitment scheme for opportunistic mobile crowdsensing | |
CN103326899A (en) | Weighting network node importance assessment method based on network heterogeneity | |
CN104408306A (en) | Method for stimulating parked vehicles for cooperative retransmission to perform analysis modeling by using evolutionary game theory in vehicle ad hoc network (VANET) | |
CN104601586B (en) | The outsourcing statistical method that a kind of disclosure can verify that | |
CN105610941B (en) | A kind of data fragmentation caching method based on node grouping in mobile network | |
Zhang et al. | Cellular traffic offloading via link prediction in opportunistic networks | |
CN103179630A (en) | Data transmission method under opportunity network | |
CN104954986A (en) | Opportunity-type data transmission method based on multiple behavior sites | |
CN103488885A (en) | Microblogging network user behavior analyzing method based on MMSB | |
CN104915889A (en) | Method of acquiring comprehensive load model parameters in online mode based on daily load curve | |
CN111194045A (en) | Energy-saving method based on user group aggregation behavior model | |
CN107577727A (en) | A kind of One-male unit behavioral trait analysis method | |
CN106844463A (en) | A kind of lsa cache algorithm of pervasive game equilibrium | |
CN108595475B (en) | Cache node selection method in mobile social network | |
CN102595311A (en) | Geographical position information layering-based network knowledge output method and system | |
CN104936136A (en) | Data transfer method based on mobility summary | |
CN109299850A (en) | Satellite information support information flow design method based on complex network model | |
Zhang et al. | Location-based correlation estimation in social network via collaborative learning | |
YOSHIDA et al. | Information networks of open data promotion in local governments of Japan | |
Ma et al. | A data collection method based on the region division in opportunistic networks |
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 |