CN105872957B - A kind of opportunistic data uploading method towards intelligent perception - Google Patents
A kind of opportunistic data uploading method towards intelligent perception Download PDFInfo
- Publication number
- CN105872957B CN105872957B CN201610289867.2A CN201610289867A CN105872957B CN 105872957 B CN105872957 B CN 105872957B CN 201610289867 A CN201610289867 A CN 201610289867A CN 105872957 B CN105872957 B CN 105872957B
- Authority
- CN
- China
- Prior art keywords
- node
- passenger
- website
- data
- bus
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/80—Services using short range communication, e.g. near-field communication [NFC], radio-frequency identification [RFID] or low energy communication
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
- H04W40/14—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on stability
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W48/00—Access restriction; Network selection; Access point selection
- H04W48/20—Selecting an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of opportunistic data uploading method towards intelligent perception, firstly, the node for completing intelligent perception task need actively by sampled data take near bus station and be transmitted to any passenger's node μ that waitsa, μaAs data carrier；Data carrier μaMeeting constructing local network simultaneously maintains local area network to exist, and the data that passenger's node that other connections enter the local area networks in bus station or bus calculates oneself carry effectiveness, and are sent to data carrier μa；Data carrier μaOptimal node μ is selected according to respective algorithmsbAnd data are forwarded, and μaNo longer hold data and no longer local area network is maintained to exist, and μbAs new data carrier；If μbIt gets off in the bus station for being provided with WIFI access point, then completes the upload of data, terminate repeating process, otherwise μbRepeat the repeating process.The present invention can effectively improve the overall efficiency that data upload in intelligent perception network.
Description
[technical field]
The present invention relates to a kind of opportunistic data uploading method towards intelligent perception.
[background technique]
As the continuous growth of Intelligent mobile equipment number and the insertion of more multisensor, intelligent perception are just becoming solution
A kind of effective means of extensive perception task in urban area, task requester can be incited somebody to action by corresponding intelligent perception platform
It perceives the mobile node that numerous tasks are distributed in city to go to complete, and no longer needs largely to arrange that fixed sensor is counted
According to collection.Sensing node, if directly carrying out data upload by cellular network, will lead to excessive movement after completion task
The generation of campus network, if uploading data indirectly in such a way that chance uploads, can face biggish uploads postpone and
Repeatedly forward the energy consumption for causing node excessive.In order to improve the participation enthusiasm of user, need to design suitable upload side
Method can either reduce the expense in data upload process, energy consumption to minimize the interference to user, and can reduce the upper of data
Delay is passed to improve transfer efficiency in data.
[summary of the invention]
The purpose of the present invention is to provide a kind of opportunistic data uploading method towards intelligent perception, to solve above-mentioned skill
Art problem.The data uploading method selects a small amount of bus station to be arranged according to by the public bus network number of bus station first
WIFI access point, the upload for perception data in intelligent perception network；This method designs reasonable forwarder selection mechanism,
Carry effectiveness according to the data of node selects suitable node to feel in passenger's node cluster in bus station and bus
Data are finally taken to WIFI website by a certain passenger's node for going to WIFI website and uploaded in data by the forwarding of primary data
Heart S, so that eliminating data uploads expense.This data uploading method is expired using the steady contact duration between bus passenger node
The complete forwarding of sufficient data reduces the upload of data and postpones, while utmostly subtracting using fast moving for bus carrier
Few interference normally gone on a journey to passenger's node, improves the participation enthusiasm of node.
To achieve the goals above, the present invention adopts the following technical scheme:
A kind of modem towards intelligent perception network can quick method for uploading, comprising the following steps:
Step 1: the building of new connection collection: data carrier (bus passenger) uaAutomatic constructing local network, data carrier
Other passenger's nodes connection at the position L of place bus station enters the network and constitutes new connection collection Q (ua,L)；
Step 2: the trip stable factor of most probable destination calculates: Q (ua, L) in each passenger's node according to the time
History in time limit HT, which is gone on a journey, to be recorded, this time the position x that gets on the bus of trip*And departure time section h*It is automatic to calculate most probable mesh
Ground ymaxTrip probability value Pu(ymax|x*h*)；
Then according to calculating trip stable factor；
Step 3: node carries effectiveness and calculates: the node of each passenger's node u from host computer oneself that new connection is concentrated is taken
Band effectiveness, and data carrier is sent to by local area network；
Step 4: the selection of forward node: if data carrier waits in website or rides in the car, data are carried
Person uaIn Q (ua,L)∪uaNode set in selection carry effectiveness maximum passenger's node and carry data；If data carry
Data are then handed to Q (u at get-off stop by persona, L) in carry the maximum passenger's node of effectiveness；
Step 5: repeat repeating process: data carrier repeats step 1 to four, the presence of local area network is maintained, in new website
Q (the u of point position La, L) in be forwarded the selection of node, until data carrier reaches WIFI website, complete perception data
Upload.
Further, in step 2,
Pu(ymax|x*h*): passenger's node u is in period h*From x*Under conditions of website is got on the bus, website y is gone tomaxProbability；
x*: this time bus trip originates website；h*: this time period of trip, h*∈ the morning, afternoon, at night }；ymax: Cheng Kejie
Point u is in period h*From x*Under conditions of website is got on the bus, most probable trip purpose；Passenger's node u is in period h*
From x*Under conditions of website is got on the bus, y is gone tomaxThe history trip number of website；R: all public bus network set；BSQ (r): public
The website sequence that intersection road r is passed through；REM(r,x*): public bus network r is in x*Set of sites after website；
Trip stable factor calculates according to the following formula:
Su(ymax|x*h*): passenger's node u is in period h*From x*Website goes to ymaxThe trip stable factor of website；Passenger's node u is in period h*From x*Under conditions of website is got on the bus, y is gone tomaxThe history trip number of website；
∑x∈B∑y∈B∑h∈Hexyh(u): all history trip number of passenger's node u.
Further, in step 3, the node of passenger's node u carries effectiveness and is calculate by the following formula:
Utility (u): passenger's node u carries the effectiveness of data；F: passenger's node u most probable destination ymaxType,
If it is WIFI website, then F=1, if it is common website, F=0；D: passenger's node u current location L and ymaxAway from
From；A, b, c: describe respectively WIFI website, common website, distance weight factor.
Further, it is assumed that effectiveness calculates the possible maximum of first factor and second factor in function right half part
Value is set as m and n, then a, b, and the setting method of tri- weight factors of c is as follows:
The setting of weight a consider passenger's node stablize trip factor maximum value as 0.5 (i.e. only round-trip a line
Road)；The setting of weight b has considered not only the stable trip factor, it is also contemplated that the WIFI connection entropy of most probable destination,
SEmax(b) maximum value that entropy is connected in all bus stations is indicated；The maximum value of distance is 1, so c weight factor is set as
n.According to experiment effect, the ratio of m and n is recommended to be respectively set as 0.9 and 0.1. here
Further, the current location L and y of passenger's node umaxDistance be specially station number.
The invention discloses a kind of opportunistic data uploading method towards intelligent perception is appointed firstly, completing intelligent perception
The node of business needs that sampled data is actively taken to neighbouring bus station and is transmitted to any passenger's node μ that waitsa, μaBecome
Data carrier；Data carrier μaMeeting constructing local network simultaneously maintains local area network to exist, other in bus station or bus
The data that passenger's node that connection enters the local area network calculates oneself carry effectiveness, and are sent to data carrier μa；Data are taken
Band person μaOptimal node μ is selected according to respective algorithmsbAnd data are forwarded, and μaNo longer hold data and no longer maintains local area network
In the presence of, and μbAs new data carrier；If μbIt gets off in the bus station for being provided with WIFI access point, then completes data
Upload, terminate repeating process, otherwise μbRepeat the repeating process.
Compared with prior art, the beneficial effects of the present invention are:
Data upload process is limited in public transit system by the method for the present invention, by the moving contact of passenger's node, is carried
Data reach WIFI website and complete to upload, to save upload expense；This method utilizes contact stable between bus passenger node
Time meets the complete forwarding of relatively large data；This method considers the motion state for participating in node, utilizes public transport carrier
Fast move reduce the upload of data delay；This method devises reasonable forwarder selection mechanism and effectively prevents counting
According to the redundancy issue in repeating process；This method reduces the influence to passenger's node normal activity to the full extent, only needs data
Carrier completes the forwarding or upload of data after getting off, and other parts are all that system is automatically performed, and participates in without node, from
And improve the participation enthusiasm of node.
[Detailed description of the invention]
Fig. 1 is the block flow diagram of the opportunistic data uploading method of the invention towards intelligent perception.
[specific embodiment]
Explanation and specific embodiment are described in further details the present invention with reference to the accompanying drawing:
A kind of system that the opportunistic data uploading method towards intelligent perception is based on of the present invention, including in data collection
Heart S, bus station b (b ∈ B), public bus network r (r ∈ R) and passenger's node u (u ∈ U)；Wherein, B is the set of bus station, R
For the set of public bus network, U is the set of passenger's node.
The system selects a small amount of bus station setting WIFI to access firstly the need of according to institute's via line number of bus station
Point (is set as WIFI website wb (wb ∈ WB) it is recommended that choosing 1%~2% bus station that route is most in the set of bus station
It is set to WIFI website), remaining website exists as common website gb (gb ∈ GB)；WB is WIFI Website Hosting, and GB is ormal station
Point set；Data upload the connection entropy that platform calculates each common website Yu WIFI set of sites WB, and calculation formula is as follows:
SE (b): the entropy of WIFI website is reached by all routes of common website b (b ∈ GB)；Xbr: a public transport road
Line r slave site b starts the number of the WIFI website passed through afterwards (uplink and downlink separately considers)；
The node that intelligent perception task is completed in entire urban area needs that sampled data is actively taken to neighbouring public transport
Website is simultaneously transmitted to any passenger's node μ that waitsa, μaAs data carrier；
Data carrier uaThe automatic constructing local network of meeting, if uaOther wait at a certain bus station, the website multiplies
The local area network can be newly added in objective node；If uaIt gets on the bus in a certain bus station, ride in a bus interior other existing passengers' sections
The local area network can be newly added in point；If uaIt rides in a bus and is stopped in a certain website, the passenger's node meeting got on the bus at the website
The local area network is newly added；
U is newly added at website LaAll passenger's node Q (u of the local area network of establishmenta, L) it all can be according to time limit certain time
History in TH records by bus, this time the position x that gets on the bus of trip*And departure time section h*Calculate most probable destination ymax's
Go on a journey probability value Pu(ymax|x*h*):
Pu(ymax|x*h*): passenger's node u is in period h*From x*Under conditions of website is got on the bus, website y is gone tomaxProbability；
ymax: passenger's node u is in period h*From x*Under conditions of website is got on the bus, most probable trip purpose；Passenger's section
Point u is in period h*From x*Under conditions of website is got on the bus, y is gone tomaxThe history trip number of website；R: all public bus network collection
It closes；BSQ (r): the public bus network r website sequence passed through；REM(r,x*): public bus network r is in x*Set of sites after website；
Obtain ymaxTrip probability after, then calculate stablize trip the factor:
Su(ymax|x*h*): passenger's node u is in period h*From x*Website goes to ymaxThe trip stable factor of website；Passenger's node u is in period h*From x*Under conditions of website is got on the bus, y is gone tomaxThe history trip number of website；
∑x∈B∑y∈B∑h∈Hexyh(u): all history trip number of passenger's node u.
Q(ua, L) in each passenger's node u can be autonomous in conjunction with station number between oneself current location and destination
Calculate node carries effectiveness:
Utility (u): passenger's node u carries the effectiveness of data；F: passenger's node u most probable destination ymaxType,
If it is WIFI website, then F=1, if it is common website, F=0；D: passenger's node u current location L and ymaxDistance
(station number)；A, b, c: describe respectively WIFI website, common website, distance weight factor；
Assuming that effectiveness, which calculates the ratio of first factor and second factor in function right half part, is set as m:n, then a,
The setting method of tri- weight factors of b, c is as follows:
The setting of weight a consider passenger's node stablize trip factor maximum value as 0.5 (i.e. only round-trip a line
Road)；The setting of weight b has considered not only the stable trip factor, it is also contemplated that the WIFI connection entropy of most probable destination,
SEmax(b) maximum value that entropy is connected in all bus stations is indicated；The maximum value of distance is 1, so c weight factor is set as
n.According to experiment effect, the ratio of m and n is recommended to be set as 0.9 and 0.1 here；
Q(ua, L) in each passenger's node can by the carrying effectiveness calculated by local area network be sent to data carry
Person；If data carrier waits in website or rides in the car, data carrier uaIt can be in Q (ua,L)∪uaNode collection
Selection carries the maximum node of effectiveness to carry data in conjunction；If data carrier uaAt get-off stop, then data are turned
Give Q (ua, L) in carry the maximum passenger's node of effectiveness；
Data carrier always can Q (u at different locationsa, L) and node connection concentrates and is forwarded the selection of node,
Until data carrier arrival WIFI website, data collection center is upload the data to by WIFI, then the data upload process
It completes.
Refering to Figure 1, a kind of opportunistic data uploading method towards intelligent perception of the present invention, including following step
It is rapid:
Data carrier u firstaCan constructing local network, other and uaPassenger's node of same site location L can connect into
Enter the local area network as forward node Candidate Set Q (ua,L)；Q(ua, L) in each node can according to history by bus record infer
Most probable trip purpose out, and calculate the trip stable factor of the destination；Type later in conjunction with the destination and
Be presently at a distance from position, each node can calculate the carrying effectiveness Utility (u) of oneself, and be sent to data carrying
Person ua；Data carrier uaAccording to the carrying effectiveness of each passenger's node in oneself status and Q (u, L), decide whether to turn
It sends out data and whom is transmitted to；Data carrier carries out optimal forwarding section with the movement of bus carrier at new website
The selection of point uploads data to data center S by WIFI, is transmitted through in the data until data carrier arrival WIFI website
Journey terminates.
The method of the present invention detailed process includes the following steps:
Step 1: the building of new connection collection: data carrier uaConstructing local network, other sections at the site location L of place
Point connection enters the network and constitutes new connection collection Q (ua,L)；
Step 2: the trip stable factor of most probable destination calculates: Q (ua, L) in each passenger's node according to certain
History in time limit HT, which is gone on a journey, to be recorded, this time the position x that gets on the bus of trip*And departure time section h*Calculate most probable mesh
Ground ymaxTrip probability value Pu(ymax|x*h*):
Pu(ymax|x*h*): passenger's node u is in period h*From x*Under conditions of website is got on the bus, website y is gone tomaxProbability；
x*: this time bus trip originates website；h*: this time period of trip, h*∈ the morning, afternoon, at night }；ymax: Cheng Kejie
Point u is in period h*From x*Under conditions of website is got on the bus, most probable trip purpose；Passenger's node u is in period h*
From x*Under conditions of website is got on the bus, y is gone tomaxThe history trip number of website；R: all public bus network set；BSQ (r): public
The website sequence that intersection road r is passed through；REM(r,x*): public bus network r is in x*Set of sites after website；
Trip stable factor is then calculated according to the following formula:
Su(ymax|x*h*): passenger's node u is in period h*From x*Website goes to ymaxThe trip stable factor of website；Passenger's node u is in period h*From x*Under conditions of website is got on the bus, y is gone tomaxThe history trip number of website；
∑x∈B∑y∈B∑h∈Hexyh(u): all history trip number of passenger's node u；
Step 3: node carries effectiveness and calculates: the node of each passenger's node u from host computer oneself that new connection is concentrated is taken
Band effectiveness:
Utility (u): passenger's node u carries the effectiveness of data；F: passenger's node u most probable destination ymaxType,
If it is WIFI website, then F=1, if it is common website, F=0；D: passenger's node u current location L and ymaxDistance
(station number)；A, b, c: describe respectively WIFI website, common website, distance weight factor；
After the completion of calculating, the carrying effectiveness of oneself is sent to data carrier by local area network；
Step 4: the selection of forward node: Q (ua, L) in each passenger's node the carrying effectiveness calculated is passed through
Local area network is sent to data carrier；If data carrier waits in website or rides in the car, data carrier uaMeeting
In Q (ua,L)∪uaNode set in selection carry effectiveness maximum node and carry data；If data carrier is getting off
At website, then data are handed into Q (ua, L) in carry the maximum passenger's node of effectiveness；
Step 5: repeat repeating process: data carrier maintains the presence of local area network, the new connection of L in new site position
Collect Q (ua, L) in be forwarded the selection of node, until data carrier reaches WIFI website, complete the upload of perception data；
Step 6: the data upload process terminates.
For the validity for further verifying the method for the present invention, pass through follow-up investigation to Beijing's inner part public transport and base
Simulated experiment is uploaded in the data that the true trip data of Beijing's bus passenger is carried out, to the feasibility and effect of the invention
It is assessed.On-site inspection is, contact whether stable in order to verify the local area network set up between bus passenger under real scene
Whether the time is able to satisfy the forwarding duration of most of perception datas, it has been observed that either in bus station or bus,
The local area network of establishment is all more stable, can satisfy the forwarding of stablizing of data, while bus passenger goes on a journey a stop when driving
Between about two minutes, the data of 100M size can be transmitted completely by local area network and be finished, thus using bus passenger as
Transmitting medium can satisfy some characteristics needed for perception data uploads.Simulated experiment is mainly from following three performance indicators to this
Data uploading method is assessed: (1) upload success rate: the ratio that data successfully upload；(2) average to upload delay: in data
Average duration needed for passing；(3) interstitial content averagely average hop count: is participated in needed for data forwarding process.Experiment with
Machine generates the data upload requests at 50000 different time different locations, is divided into ten groups and is verified.By to experiment point
Analysis is it is found that the upload success rate of each group of data can reach 90% or more, the especially number of segment in morning peak and evening peak
According to successful upload rate be even more to have reached 99%；The average upload delay of data is only 67.23 minutes, this is far superior to other
Some research institutes propose method；In repeating process each time, the number of participant is forwarded also only to need 2.13, due to
Hop count is greatly reduced, then the energy consumption in repeating process is also accordingly reduced.By testing above the experiment of the inventive method
Card, it can be seen that the inventive method can effectively improve the comprehensive performance of data upload.
Claims (4)
1. a kind of opportunistic data uploading method towards intelligent perception, which comprises the following steps:
Step 1: the building of new connection collection: one carries the bus passenger for needing to upload data as data carrier uaAutomatic group
Local area network is built, other passenger's nodes connection where data carrier at the L of bus station position enters the network and constitutes new connection
Collect Q (ua,L)；
Step 2: the trip stable factor of most probable destination calculates: Q (ua, L) in each passenger's node according to time limit
History in HT, which is gone on a journey, to be recorded, this time the position x that gets on the bus of trip*And departure time section h*It is automatic to calculate most probable destination
ymaxTrip probability value Pu(ymax|x*h*)；
Then according to calculating trip stable factor；
Step 3: node carries effectiveness and calculates: each passenger's node u that new connection is concentrated carries effect from the node of host computer oneself
With, and data carrier is sent to by local area network；
Step 4: the selection of forward node: if data carrier waits in website or rides in the car, data carrier ua
In Q (ua,L)∪uaNode set in selection carry effectiveness maximum passenger's node and carry data；If data carrier exists
At get-off stop, then data are handed into Q (ua, L) in carry the maximum passenger's node of effectiveness；
Step 5: repeat repeating process: data carrier repeats step 1 to four, the presence of local area network is maintained, in new website point
Set the Q (u of La, L) in be forwarded the selection of node, until data carrier reaches WIFI website, complete the upper of perception data
It passes；
In step 2,
Pu(ymax|x*h*): passenger's node u is in period h*From x*Under conditions of website is got on the bus, website y is gone tomaxProbability；x*: this
Secondary bus trip originates website；h*: this time period of trip, h*∈ the morning, afternoon, at night }；ymax: passenger's node u exists
Period h*From x*Under conditions of website is got on the bus, most probable trip purpose；Passenger's node u is in period h*From x*It stands
Under conditions of point is got on the bus, y is gone tomaxThe history trip number of website；R: all public bus network set；BSQ (r): public bus network
The website sequence that r is passed through；REM(r,x*): public bus network r is in x*Set of sites after website；
Trip stable factor calculates according to the following formula:
Su(ymax|x*h*): passenger's node u is in period h*From x*Website goes to ymaxThe trip stable factor of website；Multiply
Objective node u is in period h*From x*Under conditions of website is got on the bus, y is gone tomaxThe history trip number of website；
∑x∈B∑y∈B∑h∈Hexyh(u): all history trip number of passenger's node u；
In step 3, the node of passenger's node u carries effectiveness and is calculate by the following formula:
The effectiveness of Utility (u): passenger's node u carrying data, Utinity (u) ∈ (0,1]；F: passenger's node u most probable mesh
Ground ymaxType, if it is WIFI website, then F=1, if it is common website, F=0；SE(ymax): website ymaxWith
The connection entropy of WIFI set of sites WB；D: passenger's node u current location L and ymaxDistance；A, the station WIFI b, c: is described respectively
Point, common website, distance weight factor.
2. a kind of opportunistic data uploading method towards intelligent perception according to claim 1, which is characterized in that passenger
The node of node u carries in the right-hand component of effectiveness formula, and first factor and the possible maximum value of second factor are set
For m and n, then a, the setting method of tri- weight factors of b, c are as follows:
What the setting of weight a considered passenger's node stablizes trip factor maximum value as 0.5；The setting of weight b not only considers
The stable trip factor is arrived, it is also contemplated that the WIFI connection entropy of most probable destination, SEmax(b) it indicates in all bus stations
Connect the maximum value of entropy；The maximum value of distance is 1, so c weight factor is set as n；The value of m and n is set as 0.9 and 0.1.
3. a kind of opportunistic data uploading method towards intelligent perception according to claim 1, which is characterized in that passenger
The current location L and y of node umaxDistance be specially station number.
4. a kind of opportunistic data uploading method towards intelligent perception according to claim 1, which is characterized in that choose
1%~2% most bus station of route is set as WIFI website in the set of bus station.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610289867.2A CN105872957B (en) | 2016-05-04 | 2016-05-04 | A kind of opportunistic data uploading method towards intelligent perception |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610289867.2A CN105872957B (en) | 2016-05-04 | 2016-05-04 | A kind of opportunistic data uploading method towards intelligent perception |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105872957A CN105872957A (en) | 2016-08-17 |
| CN105872957B true CN105872957B (en) | 2019-01-18 |
Family
ID=56630302
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610289867.2A Active CN105872957B (en) | 2016-05-04 | 2016-05-04 | A kind of opportunistic data uploading method towards intelligent perception |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105872957B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101771964A (en) * | 2010-01-06 | 2010-07-07 | 北京航空航天大学 | Information correlation based opportunistic network data distributing method |
| CN103297503A (en) * | 2013-05-08 | 2013-09-11 | 南京邮电大学 | Mobile terminal swarm intelligent perception structure based on layered information extraction server |
| CN104881800A (en) * | 2015-06-03 | 2015-09-02 | 西北工业大学 | Mobile-crowd-sourcing-sensing-based motivation system realization method |
| CN104954986A (en) * | 2015-06-05 | 2015-09-30 | 南京邮电大学 | Opportunity-type data transmission method based on multiple behavior sites |
| CN105183543A (en) * | 2015-08-28 | 2015-12-23 | 中国科学技术大学苏州研究院 | Crowd-sourcing calculation online task allocation method based on mobile social network |
-
2016
- 2016-05-04 CN CN201610289867.2A patent/CN105872957B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101771964A (en) * | 2010-01-06 | 2010-07-07 | 北京航空航天大学 | Information correlation based opportunistic network data distributing method |
| CN103297503A (en) * | 2013-05-08 | 2013-09-11 | 南京邮电大学 | Mobile terminal swarm intelligent perception structure based on layered information extraction server |
| CN104881800A (en) * | 2015-06-03 | 2015-09-02 | 西北工业大学 | Mobile-crowd-sourcing-sensing-based motivation system realization method |
| CN104954986A (en) * | 2015-06-05 | 2015-09-30 | 南京邮电大学 | Opportunity-type data transmission method based on multiple behavior sites |
| CN105183543A (en) * | 2015-08-28 | 2015-12-23 | 中国科学技术大学苏州研究院 | Crowd-sourcing calculation online task allocation method based on mobile social network |
Non-Patent Citations (3)
| Title |
|---|
| Community Detecting Oriented Directed and Weighted Network in Mobile Crowd Sensing;Jian AN;《 2015 IEEE 12th Intl Conf on Ubiquitous Intelligence and Computing and 2015 IEEE 12th Intl Conf on Autonomic and Trusted Computing and 2015 IEEE 15th Intl Conf on Scalable Computing and Communications and Its Associated Workshops (UIC-ATC-ScalCom)》;20150814;全文 |
| Mobile Crowd Sensing for Internet of Things: A Credible Crowdsourcing Model in Mobile-Sense Service;Jian An;《2015 IEEE International Conference on Multimedia Big Data》;20150422;全文 |
| 移动群智感知应用;陈荟慧;《中兴通讯技术》;20140105;全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105872957A (en) | 2016-08-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Liu et al. | The sharing at roadside: Vehicular content distribution using parked vehicles | |
| CN102404817B (en) | Networking method and system for wireless sensor network based on multiple sink nodes | |
| Cai et al. | Networked electric vehicles for green intelligent transportation | |
| Lee | Classification of node degree based on deep learning and routing method applied for virtual route assignment | |
| CN105611502B (en) | A kind of indoor locating system and method based on WiFi Mesh network | |
| CN104640168B (en) | Vehicular ad hoc network method for routing based on Q study | |
| Ahmad et al. | Real-time route planning and data dissemination for urban scenarios using the Internet of Things | |
| CN103974373B (en) | A kind of In-vehicle networking method for routing and device | |
| CN105307232A (en) | Routing optimization method for vehicular self-organized network based on connection probabilities | |
| CN103337142A (en) | Wireless networking method for electric energy meter management system | |
| CN107205254B (en) | Mobile sink node access and interference rejection method and system based on tight delay constraint | |
| CN103444231B (en) | Find the method and system of nodes set | |
| CN103209454A (en) | Double-cluster-head election method based on node competitive values and soft thresholds | |
| CN102984200B (en) | Method applicable for scene with multiple sparse and dense vehicular ad hoc networks (VANETs) | |
| CN102833160A (en) | Contact predication based large-scale mobile delay tolerant network cluster-based routing method and system thereof | |
| CN106131912A (en) | The mobile Sink method of data capture of wireless sensor network based on tree-shaped bunch | |
| CN104010047B (en) | A kind of disconnected transport information of appearance based on Android propagates prototype system | |
| CN104754683A (en) | Wireless sensor network data acquisition method based on multi-hop routing and mobile elements | |
| CN106936909A (en) | A kind of method of Traffic information demonstration based on numerical nomenclature network with retrieving | |
| Li et al. | An effective MEC sustained charging data transmission algorithm in VANET-based smart grids | |
| Turcanu et al. | Duplicate suppression for efficient floating car data collection in heterogeneous LTE-DSRC vehicular networks | |
| CN104853396A (en) | Chain wireless sensor network oriented clustering routing system and methods thereof | |
| CN103369620A (en) | WSN (wireless sensor network)-oriented minimum transmission multicast routing method | |
| CN104835316A (en) | Traffic flow density-based solution to problem of VANET sparse connectivity | |
| CN105872957B (en) | A kind of opportunistic data uploading method towards intelligent perception |
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 |