CN101521955B - Method for collecting data under opportunity network - Google Patents
Method for collecting data under opportunity network Download PDFInfo
- Publication number
- CN101521955B CN101521955B CN2009100814653A CN200910081465A CN101521955B CN 101521955 B CN101521955 B CN 101521955B CN 2009100814653 A CN2009100814653 A CN 2009100814653A CN 200910081465 A CN200910081465 A CN 200910081465A CN 101521955 B CN101521955 B CN 101521955B
- Authority
- CN
- China
- Prior art keywords
- information
- node
- vehicle
- vehicle node
- message
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The invention provides a method for collecting data under an opportunity network, which comprises the following steps: firstly, information is issued, collecting nodes are used for broadcasting periodically, and a middle node is used for feedback; the information is transmitted; when two vehicle nodes meet, the meeting frequency, the buffering area occupation quantity and general situation information lists of the vehicle nodes and gateway nodes are exchanged, and then the message exchange and the recording management can be realized by a priority mechanism; finally, the information is collected, and the information of the vehicle nodes are collected by the gateway nodes according to the priority mechanism. In the method, the sensing information is issued by adopting a periodic issuing strategy with feedback information, thus the information issuing distributing efficiency is increased, and the controllability of network load in an information collecting process is increased; in addition, different priority levels are set for different kinds of collecting information, different information transmitting and buffering area managing mechanisms are adopted, thus the success ratio for collecting information is increased as a whole, and the practicability of data collection under the opportunity network is increased.
Description
Technical field
The invention belongs to the communications field, relate to a kind of data transmission method, be specifically related to the method for data capture under a kind of opportunistic network.
Background technology
The main feature of opportunistic network is because node density is sparse, reasons such as node mobility is very fast, network node is divided into a plurality of isolated connected regions, may there be a path end to end between source node and the destination node, node motion makes node and other node meet and forms communication opportunity, and data are along with node moves and forwarding between mobile node and realize transmission.
Opportunistic network has many concrete application scenarioss, and as interspace network, wild animal detects network, military battlefield network, self-organizing In-vehicle networking etc.Data gathering problem under this network context always is a research focus both domestic and external.
Under the background of urban area, along with the continuous development of wireless sensor network, increasing city perception information is constantly collected and is utilized, for example environmental protection tests such as noise, air quality information, traffic information, or even mobile information on services such as picture of mobile telephone, blog.This category information has the advantages that data volume is big, postpone tolerance, and the opportunistic network that is suitable for utilizing city vehicle to form carries out data collection, satisfies the needs of city perception information collection and statistics.
Spray series transmission method mainly refers to Spray and Wait algorithm and Spray and Focus algorithm, in Spray and Wait mechanism, source node uses a territory of message to specify the copy number that allows, and uses the method based on binary tree to produce message copying.This mechanism was made up of Spray stage and two stages of Wait stage: the Spray stage, suppose that the current message of node only allows to produce L part copy, running into when not having the neighbours of this message of buffer memory via node, give neighbor node with message copying, and the copy task that will be left in two, finishes [(L-1)/2] part by this neighbor node, self finish remaining part [(L-1)/2], when the remaining a copy task of node, node changes the Wait stage over to, waits for being transmitted to destination node.Compare and only allow the 2-HOP algorithm of source node dispatch messages copy further to improve transmission performance.
Spray and Focus (SF) has improved the Wait stage among the Spray and Wait (SW).After the Spray stage is distributed to the different via node of L with message, L different via node will be waited for up to running into destination node in the SW mechanism, and in the SF mechanism, message constantly is forwarded to the high node of value of utility from the low node of value of utility, up to running into destination node.When the node value of utility distributes when suitable at network, SF mechanism can greatly reduce the Network Transmission time-delay, improves the transmission success rate.In concrete implementation process, general with acquisition node as the information source node in the Spray method, gateway node is as the destination node of Spray method.
At the data gathering problem under the opportunistic network, the researcher has proposed some data collection background and methods both at home and abroad, for example: DakNet is that MIT Media Lab researcher falls behind the rural area exploitation for India, be used to provide the network system of cheap Internet information gathering service, the DakNet network comprises: be deployed in the kiosk equipment that each village has storage and short-distance wireless communication function, be installed in MAPs (the Mobile Access Points) equipment on ply rural area and the cities and towns public transit vehicle, and being deployed in the AP equipment that cities and towns are connected to Internet, these equipment all are equipped with 802.11 wave points.The villager sends to kiosk equipment to data such as mail and information request by Wi-Fi by simple and easy PDA equipment, or from the corresponding information of kiosk device downloads; The bus that comes and goes the rural area through near the kiosk equipment time, MAPs data download or upload the data of request last time from kiosk; When bus arrived cities and towns, MAPs was connected to by AP and carries out swap data on the Internet.DakNet is by the over-over communication between MAPs and kiosk equipment, the AP equipment, and for the rural area provides the Internet information service of intermittent cheapness, but network delay is very big, and DakNet is fit to some can tolerate the service of delay, as email, and government notice etc.The Wizzy that the nomadic people that similar system also is included as Finland the north provide the SaamiNetwork Connectivity of network insertion service and provide Internet to insert for remote rural area, South Africa, Wizzy realizes above-mentioned MAPs function by a courier who carries big capacity USB memory device.These data collection methods all can not be suitable for the application scenarios that a large amount of perception informations are collected under the urban background.
Summary of the invention
The present invention proposes the method for data capture under a kind of opportunistic network.At the information launch phase, the present invention adopts the acquisition node periodic broadcast, and intermediate node feedack distribution mechanisms has improved efficiency for issuing, and has improved the controllability of offered load.In the forwarding of information with converge the stage, the present invention has set different priority to different Information Monitorings, and adopt different forwards and buffering area administrative mechanism, and improved the success rate of information gathering generally, improved the practicality of data collection under the chance networking.
Method of data capture under a kind of opportunistic network may further comprise the steps:
Step 1: the periodic broadcasting of acquisition node has ageing perception information, and wherein release cycle will be set according to the communication distance of wireless network and the average speed of surrounding vehicles node;
In the release cycle set-up and calculated, release cycle T is
Wherein r represents internodal communication radius, and l represents the vertical range of the concrete road vehicle of publisher node, and v represents the average rate travel of vehicle node.
Step 2: vehicle node is returned response message after receiving perception information.
Step 3: acquisition node will determine whether to continue broadcasting according to the response message number, wherein, the broadcasting number upper limit will be done experimental setting according to perception information priority, adjacent vehicle dense degree, it is high more promptly to work as perception information priority, adjacent vehicle is sparse more, and the broadcasting number upper limit is provided with greatly more.Otherwise perception information priority is low more, and the proximate vehicle dense degree is big more, and the broadcasting number upper limit is provided with more for a short time.
Step 4: after receiving the perception information of issue, each vehicle node has the independent frequency of meeting, the just buffering area of two boundaries, an and profile information tabulation that influenced by gateway node.When two vehicle node are met, exchange separately with the frequency of meeting of gateway node, buffering area occupation quantity and profile information tabulation.
The frequency of meeting is a vehicle node as the meet total degree of forward node in the middle of in special time with gateway node, sets and the gateway node high more node of frequency that meets, and suitablely more does middle forward node.
The profile information tabulation comprises the interior existing perception information tabulation of vehicle node and discards information list, wherein existing perception information tabulation expression vehicle node inside canned data ID gather tabulation, discarded information list represents to be uploaded to gateway node perception information ID tabulation.Receive new perception information or meet when carrying out information interaction that when vehicle node each tabulation will be upgraded according to actual modification information with gateway node.
If discarded information spinner comprises discarded type of message and identifies and be uploaded to corresponding node ID number of gateway node, main this information of explanation has been collected and has been finished, corresponding ID perception is invalid, and the vehicle node of storage corresponding ID perception information can be deleted it in the network.
Step 5: vehicle node is carried out message after receiving new and the frequency of meeting gateway node, buffering area occupation quantity and profile information tabulation, comprises the steps:
1) if when meeting, there is the not emergence message of storage in the other side's vehicle node, and this vehicle node of frequency ratio height that meets of the other side's vehicle node and gateway node, and then this emergence message that this vehicle node is stored is transmitted to the other side's vehicle node;
2) if the lower limit of the buffering area no show correspondence of the other side's vehicle node, and the other side's vehicle node and gateway node this vehicle node of frequency ratio height that meets, but then this vehicle node general information and deferred message that the other side's vehicle node is not stored is transmitted to the other side's vehicle node;
3) check discarded information in the profile information tabulation that the other side's vehicle node sends,, then delete the perception information of the corresponding ID of this vehicle node if there is discarded information;
4) if there is not the vehicle node that satisfies above condition, then this vehicle node continues to hold this message, up to the gateway node forwarding perception information that meets, when the perception information in the buffering area is expired, then directly delete this perception information.
Step 6: after the message, vehicle node is if receive new perception information, whether the perception information amount in the buffering area of then checking is more than high threshold, if more than the high threshold of buffering area, then wait for when next two vehicle node are met, but this vehicle node is transmitted to the deferred message in the buffering area the other side's vehicle node that does not reach the buffering area lower limit.There is not the other side's vehicle node that does not reach the buffering area lower limit as if in the wait process, and the buffering area of this vehicle node of emergency message adding is arranged again, but then delete the deferred message of this vehicle node buffer stores; All the other situations then this vehicle node continue to hold this message, up to the gateway node forwarding perception information that meets, when the perception information in the buffering area is expired, then directly delete this perception information.
Step 7: gateway node is safeguarded a priority scheduling district, and when vehicle node and gateway node met, vehicle node sent profile information and tabulates to gateway node, and the frequency of meeting of renewal and gateway node.
Upgrade the frequency of meeting with the gateway node total degree that is about to meet and add 1.
The priority scheduling district comprises emergence message formation, general information formation and deferred message formation, wherein the emergence message queue priority is not the highest, the deferred message queue priority is not minimum, comprises the perception information ID that is sent to gateway node and the vehicle node ID of corresponding this perception information of preservation in this zone.
Step 8: after gateway node is received profile information tabulation, check the summary message content, and check the existing information list of gateway node itself,, then send to discarded information that should perception information if wherein exist and identical perception information during profile information is tabulated; Otherwise, then with the vehicle node ID in the tabulation of this profile information and with the profile information tabulation in different perception information ID put into the priority scheduling district.
Step 9: the limit priority of gateway node from the priority scheduling district chosen corresponding vehicle node ID in not, and broadcasting contains limit priority other perception information ID of storage to some extent and the request message of corresponding vehicle node ID, and the response of wait vehicle node, if in given time, do not receive response, then delete corresponding vehicle ID and perception information ID, continue to choose other vehicles ID in the highest level formation, broadcasting contains limit priority other perception information ID of storage to some extent and the request message of corresponding vehicle node ID.
Step 10: after vehicle node is received the request message of gateway node, send the response message of corresponding perception information ID in the corresponding requests message.If receive the discarded information that gateway node sends in the step 8, then delete the vehicle node perception information corresponding itself, and the discarded Information ID of correspondence is put into the profile information tabulation with discarded information.
Step 11: after gateway node is received the response message of vehicle node, the existing information list of storage and renewal priority scheduling district and gateway node itself; Forward step 7 to, collection process is carried out in circulation.
Method of data capture under a kind of opportunistic network of the present invention, compared with prior art, its advantage is:
(1) in the method, the periodicity publishing policy of band feedback information is adopted in the perception information issue, when improving efficiency for issuing, has improved the controllability of offered load in the infonnation collection process.
(2) in the method, carry out classification to different perception informations is ageing, in the forwarding of perception information with converge in the process, do different processing according to different message levels, improve the power that is gathered into of the interior perception information of whole network, improved the practicality of information gathering under the opportunistic network.
Description of drawings
Fig. 1 is the distribution scene instance graph under the method for data capture urban area background under a kind of opportunistic network of the present invention;
Fig. 2 is the flow chart of the method for data capture under a kind of opportunistic network of the present invention;
Fig. 3 is the information issue flow chart of the method for data capture under a kind of opportunistic network of the present invention;
Fig. 4 is the setting schematic diagram of the release cycle T of the method for data capture under a kind of opportunistic network of the present invention;
Fig. 5 is the information forwarding process figure of the method for data capture under a kind of opportunistic network of the present invention;
The scene schematic diagram that Fig. 6 transmits for the information of the method for data capture under a kind of opportunistic network of the present invention;
Fig. 7 converges flow chart for the information of the method for data capture under a kind of opportunistic network of the present invention;
Fig. 8 is the scene schematic diagram that the information of the method for data capture under a kind of opportunistic network of the present invention converges;
Fig. 9 for a kind of opportunistic network of the present invention method of data capture down the reaction type dissemination method of launch phase and direct forwarding dissemination method compare average number of broadcast times---information is disseminated the number broken line graph;
Figure 10 for a kind of opportunistic network of the present invention down method of data capture and the serial collection method of Spray compare success rate---information is disseminated the number broken line graph.
Embodiment
The present invention is described in further detail below in conjunction with accompanying drawing.
In the present embodiment, be set in the simulating area that the emulation border is 5000～ten thousand metres, the mobility of equipment satisfies Random Way-Point mobility model, and this mobility model is a kind of mobility model the most general under mobile ad-hoc network and the opportunistic network.Under Random Way-Point mobility model, each node is chosen one of 0～2 π angle at random, a random velocity v in velocity interval
RwpAnd the time T of travelling at random in scope.In time, node travels by deciding angle and speed at T, if run into the zone boundary, then travels by reflection direction.Through behind the T, stop a period of time T
Stop, choose angle again, speed, running time setting in motion.
The equipment movement speed v
RwpSpan be (10～20) m/s, running time T is 50s, dwell time is T
StopBe 10s.Internodal communication radius is 100m.As shown in Figure 1, acquisition node mainly is meant the information collecting device under the urban background, for example mobile phone distribution apparatus, temperature-sensitive equipment distribution apparatus, atmospheric monitoring distribution apparatus etc.Vehicle node mainly comprises the vehicle that possesses wireless forwarding and memory function.Gateway node mainly refers to link to each other with backbone network is mainly used in the central server that the city perception information is gathered.Formation mainly is meant the vehicle inside memory, and in the memory device of central server, and design is used for storing corresponding perception information a slice storage area in logic.In the simulating area, gateway node carries out the exchange of data to all vehicle node and the acquisition node in the zone.
Method of data capture under a kind of opportunistic network as shown in Figure 2, is divided into three phases, comprises the steps:
Information launch phase (step 1 to three), as shown in Figure 3:
Step 1: in this example, the node of setting 30 fixed positions at random is as acquisition node, every 3min produces one and has ageing new perception information, the perception information size is 30k, 100 vehicles are as middle forward node, the forward node buffering area is 3M, acquisition node is periodically broadcasted perception information, wherein release cycle will be set according to the communication distance and the surrounding vehicles average speed of wireless network, as shown in Figure 4, set release cycle according to formula, concrete release cycle T formula is:
Wherein, r represents internodal communication radius, and l represents the vertical range of publisher node apart from road vehicle, and v represents the average rate travel of vehicle node.This mainly is not omit vehicle in order to guarantee in release cycle each time, promptly between twice issue, prevented vehicle through and given out information.Yet in this example, owing to adopted Random Way-Point mobility model, there is not notion apart from road distance, suppose that acquisition node all is arranged on the limit, track, be l=0m, and communication radius is r=100m, and the vehicle rate travel is 10～20m/s, is (10～20) s so can send the scope of period T according to above-mentioned formula, in order to simplify the emulation complexity, here set release cycle and be set at 10s, 15s, three kinds of situations of 20s are tested.
Step 2: vehicle node is returned response message after receiving the perception information of acquisition node periodic broadcast, has received perception message with the notice acquisition node, is beneficial to acquisition node Control Network scale like this.
Step 3: acquisition node will determine whether to continue broadcasting according to the response message number, wherein broadcast number upper limit E, expression is distributed to same perception information by the acquisition node launch phase number upper limit of vehicle node, to do experimental setting according to perception information priority, two factors of adjacent vehicle dense degree, it is high more promptly to work as perception information priority, proximate vehicle is sparse more, and broadcasting number upper limit E is provided with greatly more.Otherwise perception information priority is low more, and the proximate vehicle dense degree is big more, and broadcasting number upper limit E is provided with more for a short time.
According to practical situations, perception information priority is high more, and (perception information priority is represented the urgent degree of information gathering in the actual application, for example: some pictorial informations that mobile phone is uploaded, it is just lower that it uploads urgent degree, its perception information priority is just lower, and the vehicle traffic information collects service because its ageing having relatively high expectations, it to upload urgent degree just higher, its perception information priority is just higher), need more forward node to work in coordination with forwarding more.Corresponding adjacent vehicle dense degree is many more, i.e. the vehicle node total number of near zone, and shared time of launch phase is few more, should adopt less relatively vehicle node more, promptly suitably reduce broadcasting number upper limit L,, improve the information gathering success rate to alleviate channel confliction and publisher node energy consumption.
When collection joint adjacent vehicle dense degree was sparse more, the shared time of launch phase was long more, should adopt more vehicle node to work in coordination with more and carry out the collection of information, promptly improved broadcasting number upper limit L, to reach certain information gathering success rate.In this example, be limited on the broadcasting number: emergence message disseminates number: general information is disseminated number: postpone tolerant information and disseminate number, it is than being 3: 2: 1, even always disseminate number and be under 30 the situation, it is 15 that emergence message disseminates number, it is 10 that general information is disseminated number, and it is 5 that the delay tolerant information is disseminated number.
Information is transmitted the stage (step 4 to six), as shown in Figure 5:
Step 4: each vehicle node will be safeguarded a frequency of meeting with gateway node, two buffer threshold boundaries of height, and a profile information tabulation, the frequency of meeting mainly refers to the meet total degree of the interior vehicle node of special time as middle forward node and gateway node here.The profile information tabulation comprises the existing perception information tabulation of intranodal and discards information list, wherein existing perception information tabulation represent vehicle node inside canned data ID gather tabulation, discarded information list representative has been uploaded to gateway node perception information ID and has tabulated.
In the present embodiment, as shown in Figure 6, but vehicle node A vehicle node B reaches communication range in moving process, and the collision probability of vehicle node A and gateway node is 5, and buffer occupancy is 13%, and discarded Information ID tabulation is: 223,6,9; Emergence message ID tabulation is 41,56,7,1; General information ID tabulation is: 432,325; Postpone the tabulation of tolerable Information ID: 721,845.The collision probability of vehicle node B and gateway node is 15, and buffer occupancy is 25%, and discarded Information ID tabulation is 2,38,59,595,983; Emergence message ID tabulation is 7,32,9,56,78,223; General information ID tabulation is 521,325; Postponing the tabulation of tolerable Information ID is 845.The frequency of meeting V for the number of times that meets of gateway node, the low-buffer district threshold setting of all vehicle node is 70%, high buffer threshold is set at 90%, and the profile information tabulation comprises that information is: perception information ID tabulation of preservation (emergence message ID tabulation, general information ID tabulation, the tabulation of delay tolerable Information ID) and the tabulation of discarded Information ID.After two vehicle node A, B meet, the exchange frequency of meeting, buffer occupancy and profile information tabulation, for the vehicle node that information flow direction is more suitable for referencial use, to improve the power that is gathered into of perception information.
Step 5: vehicle node is received the frequency of meeting, after the tabulation of buffer size and profile information, and will be according to receiving that message does following processing:
1) if when meeting, there is the not emergence message of storage in the other side's vehicle node, and this vehicle node of frequency ratio height that meets of the other side's vehicle node and gateway node, and then this emergence message that this vehicle node is stored is transmitted to the other side's vehicle node.In the present embodiment, as shown in Figure 6, for vehicle A, B, obviously after vehicle node A receives the profile information tabulation of vehicle node B, the collision probability 15 of finding vehicle B is than this vehicle joint collision probability 5 height, so according to this condition, contrast emergence message tabulation separately, the emergence message ID that vehicle B node is not deposited is that 41 and 1 perception information is transmitted to vehicle node B.
2) if the lower limit of the buffering area no show correspondence of the other side's vehicle node, and the other side's vehicle node and gateway node this vehicle node of frequency ratio height that meets, but then this vehicle node general information and deferred message that the other side's vehicle node is not stored is transmitted to the other side's vehicle node.In the present embodiment, in Fig. 6, obviously for vehicle node A, the buffering area of vehicle node B 25% does not reach corresponding lower limit 70%, and collision probability 5 will be lower than 15 of Node B, so according to this condition, vehicle A with general information ID be 432 be that 721 perception information is transmitted to vehicle node B with postponing the tolerable Information ID.
3) check discarded information in the profile information tabulation that the other side's vehicle node sends,, then delete the perception information of the corresponding ID of this vehicle node if there is discarded information.As Fig. 6, for vehicle node B, it checks the discarded information list 223 of the vehicle node A transmission of receiving, 6,9, and check the tabulation of node self-information, emergence message 9 and 223 all belongs to discarded information in the information of finding to have deposited, so deletion corresponding informance 9,223.Concerning vehicle node A, check the discarded information list of Node B, and check this node internal information, find that there is not discarded information in this intranodal perception information, so do not discard information deletion.
4) if there is not the vehicle node that satisfies above condition, then this vehicle node continues to hold this message, up to the gateway node forwarding perception information that meets, when the perception information in the buffering area is expired, then directly delete this perception information.
Step 6: vehicle node in the repeating process is if receive new perception information, whether the perception information amount in the buffering area of then checking is more than high threshold, if more than the high threshold of buffering area, then wait for when next two vehicle node are met, but this vehicle node is transmitted to the deferred message in the buffering area the other side's vehicle node that does not reach the buffering area lower limit.There is not the other side's vehicle node that does not reach the buffering area lower limit as if in the wait process, and the buffering area of this vehicle node of emergency message adding is arranged again, but then delete the deferred message of this vehicle node buffer stores; All the other situations then this vehicle node continue to hold this message, up to the gateway node forwarding perception information that meets, when the perception information in the buffering area is expired, then directly delete this perception information.For example, as shown in Figure 6, for vehicle node A and B, meet through this, vehicle node A and B do not reach buffering area boundary 70%, so A and B will check whether existing information lost efficacy, if exist fail message then to delete, otherwise continue to hold this information, up to meeting with gateway node or all the other vehicle node.
Information converges the stage (step 7 to ten one), as shown in Figure 7:
Step 7: gateway node is safeguarded a priority scheduling district and an existing information list, and when vehicle node and gateway node met, vehicle node sent profile information and tabulates to gateway node, and the frequency of meeting of renewal and gateway node.In this example, the priority scheduling district comprises emergence message formation, general information formation and postpones the tolerable message queue.When vehicle node and gateway node met, vehicle node was tabulated to the profile information that gateway node sends vehicle node itself, and the frequency of meeting of renewal and gateway node, and the total degree that promptly meets adds 1.As shown in Figure 8, gateway node is safeguarded an existing information list, comprise an ID formation of having received: 2,14,42,435,653,322,546,32,22,36,764,312,56, and safeguard a priority scheduling district, comprise the emergence message formation, general information formation and the formation of delay tolerant information.After but vehicle node A and B and gateway node arrived communication range, with the profile information tabulation of transmission itself, and the renewal collision probability, vehicle node A added 1 to 11 from 10, and vehicle node B adds 1 to 8 from 7.
Step 8: after gateway node is received the profile information tabulation, check the summary message content, each bar ID to summary info, check the existing information list of gateway node itself, if wherein exist and the identical perception information of ID during profile information is tabulated, then send discarded information (discarded information publishing policy mainly is the perception information of having received in order to reduce, and promptly redundant information takies the probability of the network bandwidth, vehicle node buffering area in whole network) that should perception information ID; Otherwise, then put into priority scheduling district corresponding priorities scheduling queue with the vehicle node ID in this profile information tabulation and with perception information ID.In implementation process, if required perception information ID belongs to emergence message, then will hold the vehicle ID of this information and the emergency message formation afterbody that Information ID is put into the priority scheduling zone, the information of all the other types is also so handled.As shown in Figure 8, gateway node is checked the profile information tabulation of vehicle node B, with 35,443 and vehicles identifications B all put into 3 formation afterbodys of correspondence in priority scheduling district, for message id 435, finding to have preserved this message in the gateway node, is 435 discarded message so will send corresponding ID to vehicle node B, and the vehicle node category-A is like the processing as Node B.
Step 9: the limit priority of gateway node from the priority scheduling district chosen corresponding vehicle node ID in not, and broadcasting contains limit priority other perception information ID of storage to some extent and the request message of corresponding vehicle node ID, and waits for the response of vehicle node.In this example, the emergency message queue priority is the highest, preferentially choose corresponding informance ID and vehicle ID from this formation head, if wherein there is not any effective information ID, then check in the general general information formation of priority and whether have any request message, if still do not have any effective information ID, then continue to check to postpone the tolerable formation, and wait-for-response.If in given time, be in the 0.2s, not receive response in this example, then delete corresponding vehicle ID and perception information ID, continue to choose other vehicles ID in the highest level formation, broadcasting contains limit priority other perception information ID of storage to some extent and the request message of corresponding vehicle node ID.In Fig. 8, gateway node is preferentially chosen ID from urgent message queue be 35B, and become request message to send to vehicle node B this information package.After receiving that corresponding ID is 35 perception information, choose 4A successively, 27A, 443B, 456A, 782A make similar operations.Wherein character string A, B etc. represent the ID value of vehicle node, the ID of 35,4,27,443,456,782 expression perception informations.
Step 10: after vehicle node is received the request message of gateway node, send the response message of corresponding perception information ID in the corresponding requests message.If receive the discarded information that gateway node sends in the step 8, then delete the vehicle node perception information corresponding itself, and the discarded Information ID of correspondence is put into the profile information tabulation with discarded information.In Fig. 8, after vehicle node B received and is 435 discarded message from the gateway node content, ID was 435 a perception information and to the corresponding contents in the profile information tabulation in the deletion internal memory; Receiving that ID from gateway node is behind 35 the request message, is that 35 perception information sends to gateway node with ID.
Step 11: after gateway node was received the response message of vehicle node, storage was also upgraded existing information list; Corresponding perception information in the deletion priority scheduling district, as in this example, the 35B in the deletion priority scheduling zone, and perception information ID numbers 35 put into existing information list, and forward step 7 then to, circulate and carry out collection process.
As shown in Figure 9, this figure is at the information launch phase, and the dissemination method that the present invention's (step 1 is to step 3) adopts and the comparison diagram of the sending method of directly meeting are being set under different interstitial content (the being the different vehicle node density) situation.Dark straight line, dark dotted line, light straight line represent that respectively this algorithm launch phase release cycle is set at c=20 among Fig. 9, c=15, successfully issue the number of broadcast times of DT=10 the perception information that dark chain-dotted line represents under the c=10 situation, the c=15 that dark dotted line is represented is the needed number of broadcast times of the sending method of directly meeting.As can be seen from the figure, owing to utilized the characteristic of radio broadcasting itself, except under the very sparse situation of node density, be provided with under the situation 3 kinds of different broadcast cycle parameters, the dissemination method that this method adopts all is better than the sending method of directly meeting aspect broadcast cycle, and under the urban background of reality, the very sparse situation of vehicle node is very rare, can see, the reaction type dissemination method has improved information distributing efficiency, has strengthened the practicality that the collection of opportunistic network number is used under the urban background.
As shown in figure 10, this figure be the inventive method and simple Spray series methods (promptly utilize Spray series transmission method do data collect use) be gathered into the power comparison diagram.As can be seen from the figure, the light color chain-dotted line, dark straight line, dark chain-dotted line is represented total different emergence message of diffuse information number T in the actual emulation process respectively, general information, the data collection success rate broken line that postpones tolerant information, dark dotted line, lighter curve, on behalf of the Spray algorithm, the light color straight line adopt respectively and emergence message respectively, and general information postpones the same information of tolerant information and disseminates broken line graph under the number situation, as can be seen from the figure, disseminate under the certain situation of number in information, the inventive method is compared with the Spray method that same perception information disseminates number because the forwarding and the information of the setting priority that adopts converge strategy, the power that is gathered into of emergence message and general information all is enhanced, and to postponing the tolerable method, though success rate slightly descends, overall success rate influence is less, illustrate that promptly this strategy according to priority classification is because simple Spray method has improved the practicality of information gathering generally.
Claims (8)
1. the method for data capture under the opportunistic network is characterized in that this method may further comprise the steps:
Step 1: acquisition node is periodically broadcasted has ageing perception information, and wherein release cycle is set according to the communication distance of wireless network and the average speed of surrounding vehicles node;
Step 2: vehicle node is returned response message to acquisition node after receiving perception information;
Step 3: acquisition node will determine whether to continue broadcasting according to the response message number, wherein, the broadcasting number upper limit is done experimental setting according to perception information priority and adjacent vehicle dense degree, it is high more promptly to work as perception information priority, adjacent vehicle is sparse more, and the broadcasting number upper limit is provided with greatly more; Otherwise perception information priority is low more, and the proximate vehicle dense degree is big more, and the broadcasting number upper limit is provided with more for a short time;
Step 4: after receiving the perception information of issue, each vehicle node has the independent buffering area that is subjected to meet frequency and two boundaries of height that gateway node influences, and a profile information tabulation; When two vehicle node are met, exchange separately with the frequency of meeting of gateway node, buffering area occupation quantity and profile information tabulation;
The described frequency of meeting is meant that mainly vehicle node is as the total degree that meets of middle forward node and gateway node in the special time; Described profile information tabulation comprises the existing perception information tabulation of intranodal and discards information list, wherein existing perception information tabulation represent vehicle node inside canned data ID gather tabulation, discarded information list representative has been uploaded to gateway node perception information ID and has tabulated;
Step 5: vehicle node is carried out message after receiving new and the frequency of meeting gateway node, buffering area occupation quantity and profile information tabulation;
Step 6: vehicle node in the repeating process is if receive new perception information, whether the perception information amount in the buffering area of then checking is more than high threshold, if more than the high threshold of buffering area, then wait for when next two vehicle node are met, but this vehicle node is transmitted to the deferred message in the buffering area the other side's vehicle node that does not reach the buffering area lower limit; If do not have the other side's vehicle node that does not reach the buffering area lower limit in the wait process, and have emergency message to add the buffering area of this vehicle node again, but then delete the deferred message of this vehicle node buffer stores; All the other situations then this vehicle node continue to hold this message, up to the gateway node forwarding perception information that meets, when the perception information in the buffering area is expired, then directly delete this perception information;
Step 7: gateway node is safeguarded a priority scheduling district, and when vehicle node and gateway node met, vehicle node sent profile information and tabulates to gateway node, and the frequency of meeting of renewal and gateway node;
Step 8: after gateway node is received the profile information tabulation, check the summary message content, and check the existing information list of gateway node itself, if wherein exist and identical perception information during profile information is tabulated, then send discarded information that should perception information; Otherwise, then with the vehicle node ID in the tabulation of this profile information and with the profile information tabulation in different perception information ID put into the priority scheduling district;
Step 9: the limit priority of gateway node from the priority scheduling district chosen corresponding vehicle node ID in not, and broadcasting contains limit priority other perception information ID of storage to some extent and the request message of corresponding vehicle node ID, and the response of wait vehicle node, if in given time, do not receive response, then delete corresponding vehicle ID and perception information ID, continue to choose other vehicles ID in the highest level formation, broadcasting contains limit priority other perception information ID of storage to some extent and the request message of corresponding vehicle node ID;
Step 10: after vehicle node is received the request message of gateway node, send the response message of corresponding perception information ID in the corresponding requests message; If receive the discarded information that gateway node sends in the step 8, then delete the vehicle node perception information corresponding itself, and the discarded Information ID of correspondence is put into the profile information tabulation with discarded information;
Step 11: after gateway node is received the response message of vehicle node, the existing information list of storage and renewal priority scheduling district and gateway node itself; Forward step 7 to, collection process is carried out in circulation.
2. according to the method for data capture under the described a kind of opportunistic network of claim 1, it is characterized in that: in the described step 1, in the release cycle set-up and calculated, release cycle T is
Wherein r represents internodal communication radius, and l represents the vertical range of publisher node apart from road vehicle, and v represents the average rate travel of vehicle node.
3. according to the method for data capture under the described a kind of opportunistic network of claim 1, it is characterized in that: in the described step 4, the frequency of meeting is the meet total degree of vehicle node as middle forward node and gateway node in special time, set and the gateway node high more node of frequency that meets, forward node in the middle of suitable more the doing.
4. according to the method for data capture under the described a kind of opportunistic network of claim 1, it is characterized in that: in the described step 4, the profile information tabulation comprises the interior existing perception information tabulation of vehicle node and discards information list, wherein existing perception information tabulation expression vehicle node inside canned data ID gather tabulation, discarded information list represents to be uploaded to gateway node perception information ID tabulation; Receive new perception information or meet when carrying out information interaction that when vehicle node each tabulation will be upgraded according to actual modification information with gateway node.
5. according to the method for data capture under the described a kind of opportunistic network of claim 1, it is characterized in that: in the described step 5, the process of message comprises the steps:
1) if when meeting, there is the not emergence message of storage in the other side's vehicle node, and this vehicle node of frequency ratio height that meets of the other side's vehicle node and gateway node, and then this emergence message that this vehicle node is stored is transmitted to the other side's vehicle node; Described the other side's vehicle node exists the emergence message of not storage to be meant the unexistent emergence message of storing in this vehicle node of the other side's vehicle node;
2) if the lower limit of the buffering area no show correspondence of the other side's vehicle node, and the other side's vehicle node and gateway node this vehicle node of frequency ratio height that meets, but then this vehicle node general information and deferred message that the other side's vehicle node is not stored is transmitted to the other side's vehicle node;
3) check discarded information in the profile information tabulation that the other side's vehicle node sends,, then delete the perception information of the corresponding ID of this vehicle node if there is discarded information;
4) if there is not the vehicle node that satisfies above condition, then this vehicle node continues to hold this message, up to the gateway node forwarding perception information that meets, when the perception information in the buffering area is expired, then directly delete this perception information.
6. according to the method for data capture under the described a kind of opportunistic network of claim 1, it is characterized in that: in the described step 7, upgrade the frequency of meeting with the gateway node total degree that is about to meet and add 1.
7. according to the method for data capture under the described a kind of opportunistic network of claim 1, it is characterized in that: in the described step 7, the priority scheduling district comprises emergence message formation, general information formation and deferred message formation, wherein the emergence message queue priority is not the highest, the deferred message queue priority is not minimum, comprises the perception information ID that is sent to gateway node and the vehicle node ID of corresponding this perception information of preservation in this zone.
8. according to the method for data capture under the described a kind of opportunistic network of claim 1, it is characterized in that: in the described step 8, discarded information comprises that discarded type of message identifies and be uploaded to corresponding node ID number of gateway node, illustrating that this information has been collected finishes, corresponding ID perception is invalid, and the vehicle node of storage corresponding ID perception information is deleted it in the network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100814653A CN101521955B (en) | 2009-04-08 | 2009-04-08 | Method for collecting data under opportunity network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100814653A CN101521955B (en) | 2009-04-08 | 2009-04-08 | Method for collecting data under opportunity network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101521955A CN101521955A (en) | 2009-09-02 |
| CN101521955B true CN101521955B (en) | 2011-01-05 |
Family
ID=41082267
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009100814653A Expired - Fee Related CN101521955B (en) | 2009-04-08 | 2009-04-08 | Method for collecting data under opportunity network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101521955B (en) |
Families Citing this family (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102045809B (en) * | 2009-10-16 | 2013-06-05 | 南京理工大学 | Routing method of opportunistic network based on wireless radio frequencies |
| CN102598594A (en) * | 2009-11-04 | 2012-07-18 | 丰田自动车株式会社 | Gateway device for vehicles |
| CN101808306B (en) * | 2010-01-07 | 2013-05-15 | 北京航空航天大学 | Self-adapting urgent message announcement method based on vehicle network |
| CN101977226B (en) * | 2010-10-28 | 2012-12-05 | 北京航空航天大学 | Novel opportunity network data transmission method |
| CN101959225B (en) * | 2010-11-05 | 2013-12-18 | 南京工业大学 | Method for transmitting data in intermittently-connected mobile network |
| CN102724291A (en) * | 2012-05-23 | 2012-10-10 | 北京经纬恒润科技有限公司 | Vehicle network data acquisition method, unit and system |
| US8704679B2 (en) * | 2012-06-27 | 2014-04-22 | GM Global Technology Operations LLC | Framework for packet processing for secure V2V applications on resource-constrained platforms |
| CN102917372A (en) * | 2012-10-18 | 2013-02-06 | 北京理工大学 | Internet of vehicles hierarchical model design method orienting to multi-scene data exchange |
| CN104125152B (en) * | 2013-04-23 | 2018-04-10 | 浙江大学 | A kind of method that In-vehicle networking reliability is improved based on car borne gateway |
| CN106656819B (en) * | 2017-02-06 | 2019-09-20 | 中国人民解放军理工大学 | A kind of DTN chance prediction method for routing based on timetable |
| CN106992930B (en) * | 2017-06-12 | 2018-05-01 | 陕西师范大学 | A kind of opportunistic network routing method based on approach frequency |
| CN109688179B (en) * | 2017-10-19 | 2021-06-22 | 华为技术有限公司 | Communication method and communication device |
| CN111445681B (en) * | 2020-03-26 | 2021-08-03 | 上海海事大学 | Road-leaving cooperative interaction system and interaction method in port environment |
| CN111935664B (en) * | 2020-07-20 | 2023-04-18 | 杭州电子科技大学 | Network data real-time collection method based on dynamic feedback |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2005060170A1 (en) * | 2003-12-19 | 2005-06-30 | Telefonaktiebolaget Lm Ericsson (Publ) | Fast/opportunistic distributed resource reallocation for established connections in a multihop network |
| CN1679358A (en) * | 2002-08-08 | 2005-10-05 | 哈里公司 | Multiple path reactive routing in a mobile ad hoc network |
| CN101098373A (en) * | 2006-06-30 | 2008-01-02 | 中国科学院软件研究所 | Mobile decision approach for data gathering set in wireless sensor network |
| WO2008001271A3 (en) * | 2006-06-30 | 2008-04-03 | Nokia Corp | Opportunistic routing protocol in ad hoc networks |
-
2009
- 2009-04-08 CN CN2009100814653A patent/CN101521955B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1679358A (en) * | 2002-08-08 | 2005-10-05 | 哈里公司 | Multiple path reactive routing in a mobile ad hoc network |
| WO2005060170A1 (en) * | 2003-12-19 | 2005-06-30 | Telefonaktiebolaget Lm Ericsson (Publ) | Fast/opportunistic distributed resource reallocation for established connections in a multihop network |
| CN101098373A (en) * | 2006-06-30 | 2008-01-02 | 中国科学院软件研究所 | Mobile decision approach for data gathering set in wireless sensor network |
| WO2008001271A3 (en) * | 2006-06-30 | 2008-04-03 | Nokia Corp | Opportunistic routing protocol in ad hoc networks |
Non-Patent Citations (1)
| Title |
|---|
| 孙利民.机会移动传感器网络中的自适应数据收集机制.《通信学报》.2008,第29卷(第11期),第186页-第193页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101521955A (en) | 2009-09-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101521955B (en) | Method for collecting data under opportunity network | |
| Yuan et al. | Toward efficient content delivery for automated driving services: An edge computing solution | |
| CN108012244B (en) | Cluster-based road vehicle-mounted self-organizing network data service communication system and method | |
| Nafi et al. | A VANET based intelligent road traffic signalling system | |
| Xing et al. | Utility maximization for multimedia data dissemination in large-scale VANETs | |
| CN102625237B (en) | Method for selecting optimum relay in communication between wayside device and vehicle | |
| CN105722231B (en) | A kind of design method for the vehicle-mounted net MAC protocol of multichannel continuously coordinated | |
| CN104080056B (en) | The message distributing method of the vehicular ad hoc network perceived based on degree of communication probability | |
| CN106211260B (en) | Position information self-adaptive opportunistic routing method in Internet of vehicles | |
| CN101431784B (en) | Optimized data transmission method based on geographical position in vehicle-mounted network | |
| CN106255153B (en) | Vehicle under car networking with caching capabilities divides group's cooperation transmission method | |
| CN101795292A (en) | Opportunity network architecture based on urban public transport | |
| CN102694859B (en) | Vehicular self-organization network region content distribution method based on network codes | |
| Liya et al. | A randomized algorithm for roadside units placement in vehicular ad hoc network | |
| Lee et al. | An energy efficient vehicle to pedestrian communication method for safety applications | |
| CN106254474A (en) | Heterogeneous nodes cooperation caching method based on fountain codes under car networking | |
| CN106230550A (en) | There is under car networked environment the coding and transmission method of caching capabilities | |
| Turcanu et al. | A multi-hop broadcast wave approach for floating car data collection in vehicular networks | |
| Trullols-Cruces et al. | A cooperative vehicular network framework | |
| CN101808306B (en) | Self-adapting urgent message announcement method based on vehicle network | |
| Gong et al. | Content downloading with the assistance of roadside cars for vehicular ad hoc networks | |
| Sheu et al. | A distributed taxi hailing protocol in vehicular ad-hoc networks | |
| Shirani et al. | Store-carry-forward message dissemination in vehicular ad-hoc networks with local density estimation | |
| Wang et al. | An edge-assisted data distribution method for vehicular network services | |
| Luan et al. | Enabling content distribution in vehicular ad hoc 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 | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110105 Termination date: 20150408 |
|
| EXPY | Termination of patent right or utility model |