CN110366126A - Node latency optimal decision method and system are detached from mobile ad-hoc network - Google Patents
Node latency optimal decision method and system are detached from mobile ad-hoc network Download PDFInfo
- Publication number
- CN110366126A CN110366126A CN201910521771.8A CN201910521771A CN110366126A CN 110366126 A CN110366126 A CN 110366126A CN 201910521771 A CN201910521771 A CN 201910521771A CN 110366126 A CN110366126 A CN 110366126A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- detached
- value
- model
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/142—Network analysis or design using statistical or mathematical methods
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/06—Testing, supervising or monitoring using simulated traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/38—Services specially adapted for particular environments, situations or purposes for collecting sensor information
Abstract
The present invention provides be detached from Node latency optimal decision method and system in a kind of mobile ad-hoc network, comprising: two-dimensional random migration model is introduced, in each time interval, by changing step number N come the movement velocity of analog node；Obtain returning to time model by analyzing two extreme models, network when described two extreme models include: step number N and broadcast radius r while taking low interval value or high interval value；Comprehensively consider the timeliness of energy consumption and data, the optimal waiting time is calculated, it is detached from node to wait the connection request for the host node for carrying out automatic network within the optimal waiting time and rebuild connection, more than after the optimal waiting time, disengaging node directly sends data to base station.The present invention has comprehensively considered the timeliness of energy consumption and data, optimizes and is detached from optimal waiting time of the node of network before directly transmitting data in marine monitoring dynamic environment, has taken into account the timeliness of energy consumption and data.
Description
Technical field
The present invention relates to fields of communication technology, and in particular, to is detached from Node latency most in mobile ad-hoc network
Excellent decision-making technique and system.
Background technique
The real-time observation of ocean is always a very important research topic.Under this scene, various sensor (sections
Point) it is widely used in collecting different types of oceanographic data.The data of collection usually transmit between sensors, and by one or
Multiple host nodes are collected, and finally send base station or satellite for all data by gate node.
However, the randomness of marine environment is the challenge for guaranteeing to realize stabilized communication between node always.In order to cope with this
Kind dynamic environment, is effective using the connection between mobile ad-hoc network (MANET) Lai Jianli node.In addition, delay is held
Intermittent connection requirement can be supported by bearing network (DTN), it means that each node can temporarily save the data of collection and wait
Enter network to node and rebuilds connection.
The movement of ocean interior joint can be modeled as two-dimensional random migration, can represent to a certain extent continually changing
Ocean condition.If node removes network and reenters, actually there are two types of possibilities.One is that node returns to original cluster
It is communicated with former host node, the other is it can establish connection with the host node of other in network.We can easily see
It arrives, node and different broadcast radius for different number, both possibilities return to the shadow of network time to node is detached from
Sound can also change.
Therefore, for the node being detached from from network, two kinds of movements can be taken.First is that node will can be collected directly
Data be sent to base station, but cost is the more energy of consumption.Second is that node waits for a period of time and rejoins network
And host node is transmitted data to, this may will affect the timeliness of data.
The patent of Publication No. CN101489308B discloses a kind of active wait-for for wireless Ad Hoc network stream competition
Transmission method, node is after being successfully transmitted data message, even if still there is message to need to send, does not also immediately begin to wireless channel
Competition, but by wait active evacuation neighbor node and adjacent node, left in the data message being currently transmitted
Just start to send next data message after the disturbance range of oneself, in waiting time, node is switched to dormant state.
In dynamic marine environment, each disengaging node need to determine should to wait before directly transmitting data how long when
Between to balance the timeliness of energy consumption and data.Therefore, it is necessary to the controls that a kind of waiting time optimal decision method carries out node.
Summary of the invention
For the defects in the prior art, the object of the present invention is to provide be detached from node etc. in a kind of mobile ad-hoc network
To time optimal decision-making technique and system.
Node latency optimal decision method, packet are detached from a kind of mobile ad-hoc network provided according to the present invention
It includes:
Joint movements model foundation step: introducing two-dimensional random migration model, in each time interval, is walked by changing
Number N carrys out the movement velocity of analog node；
It returns to time model establishment step: obtaining returning to time model, described two poles by analyzing two extreme models
Network when end model includes: step number N and broadcast radius r while taking low interval value or high interval value；
Optimal waiting time solution procedure: comprehensively considering the timeliness of energy consumption and data, and the optimal waiting time is calculated,
It is detached from node to wait the connection request for the host node for carrying out automatic network within the optimal waiting time and rebuild connection, is being more than institute
After stating the optimal waiting time, it is detached from node and directly sends data to base station.
Preferably, the relationship of step number N and broadcast radius r are as follows:
Cov=1-eax+b
Wherein Cov indicates the coverage rate of network, and it is model parameter that x, which represents step number N and broadcast radius r, a and b,.
It preferably, include calculating two extreme models by analyzing the method that two extreme models obtain returning to time model
Weight.
Preferably, the timeliness index of coincidence attenuation model of data:
Value=Ae-at
Wherein Value indicates data in the value that the time is t, and A and a are model parameters, and e is natural constant；
The timeliness of data is the summation Value for all data values not sent in Node latency TT:
Preferably, after the timeliness for comprehensively considering energy consumption and data, the entire effectiveness P of Node latency TTAre as follows:
PT=ValueT-ET
Wherein, ETIt is the energy consumption of Node latency T, the desired utilization E (P of Node latency TT) are as follows:
ValueiIndicate the data value of Node latency i, PROBT=iIndicate that node is detached from when the waiting time is i to be returned to
The probability of network, MT indicate that node directly sends the energy consumption of data to base station.
Node latency optimizing decision system, packet are detached from a kind of mobile ad-hoc network provided according to the present invention
It includes:
Joint movements model building module: introducing two-dimensional random migration model, in each time interval, is walked by changing
Number N carrys out the movement velocity of analog node；
It returns to time model and establishes module: obtaining returning to time model, described two poles by analyzing two extreme models
Network when end model includes: step number N and broadcast radius r while taking low interval value or high interval value；
The optimal waiting time solves module: comprehensively considers the timeliness of energy consumption and data, the optimal waiting time is calculated,
It is detached from node to wait the connection request for the host node for carrying out automatic network within the optimal waiting time and rebuild connection, is being more than institute
After stating the optimal waiting time, it is detached from node and directly sends data to base station.
Preferably, the relationship of step number N and broadcast radius r are as follows:
Mono- e of Cov=1ax+b
Wherein Cov indicates the coverage rate of network, and it is model parameter that x, which represents step number N and broadcast radius r, a and b,.
It preferably, include calculating two extreme models by analyzing the method that two extreme models obtain returning to time model
Weight.
Preferably, the timeliness index of coincidence attenuation model of data:
Value=Ae-at
Wherein Value indicates data in the value that the time is t, and A and a are model parameters, and e is natural constant；
The timeliness of data is the summation Value for all data values not sent in Node latency TT:
Preferably, after the timeliness for comprehensively considering energy consumption and data, the entire effectiveness P of Node latency TTAre as follows:
PT=ValueT-ET
Wherein, ETIt is the energy consumption of Node latency T, the desired utilization E (P of Node latency TT) are as follows:
ValueiIndicate the data value of Node latency i, PROBT=iIndicate that node is detached from when the waiting time is i to be returned to
The probability of network, MT indicate that node directly sends the energy consumption of data to base station.
Compared with prior art, the present invention have it is following the utility model has the advantages that
The present invention has comprehensively considered the timeliness of energy consumption and data, optimizes in marine monitoring dynamic environment and is detached from network
Optimal waiting time of the node before directly transmitting data, taken into account the timeliness of energy consumption and data.
Detailed description of the invention
Upon reading the detailed description of non-limiting embodiments with reference to the following drawings, other feature of the invention,
Objects and advantages will become more apparent upon:
Fig. 1 is work flow diagram of the invention.
Specific embodiment
The present invention is described in detail combined with specific embodiments below.Following embodiment will be helpful to the technology of this field
Personnel further understand the present invention, but the invention is not limited in any way.It should be pointed out that the ordinary skill of this field
For personnel, without departing from the inventive concept of the premise, several changes and improvements can also be made.These belong to the present invention
Protection scope.
As shown in Figure 1, being detached from Node latency optimizing decision side in a kind of mobile ad-hoc network provided by the invention
Method, comprising:
Joint movements model foundation step: introducing two-dimensional random migration model, in each time interval, is walked by changing
Number N carrys out the movement velocity of analog node；
It returns to time model establishment step: obtaining returning to time model, described two poles by analyzing two extreme models
Network when end model includes: step number N and broadcast radius r while taking low interval value or high interval value；
Optimal waiting time solution procedure: comprehensively considering the timeliness of energy consumption and data, and the optimal waiting time is calculated,
It is detached from node to wait the connection request for the host node for carrying out automatic network within the optimal waiting time and rebuild connection, is being more than institute
After stating the optimal waiting time, it is detached from node and directly sends data to base station.
In order to simulate the movement of dynamic marine environment interior joint, invention introduces a two-dimensional random migration models, lead to
It crosses and changes parameter to distinguish different ocean conditions.The model is, in each time interval, node select random direction and to
Direction shifting moves a step.It can be with the movement velocity of analog node there are two types of method.One is step number N is changed, another kind is to change
The length l of each step.
In the present invention, different movement velocitys is described using step number is changed.That is, the length l of each step is
Constant, but step number N can change.It is mainly ocean condition that considering, which influences the factor of node speed,.When ocean condition is violent,
The direction of wave or wind may more frequently change, and dynamics is stronger so that node compared with tranquility with it is shorter when
Between mobile identical distance.Present invention assumes that at a certain time interval, node undergoes a complete random walk process:
Mobile N step, the length of every step are l, and the different motion speed of dynamic marine environment interior joint can preferably be reflected by changing N.
In order to calculate the time probability distribution for being detached from node and reconnecting network, the present invention assumes initially that two extreme items
Part, i.e. step number N and broadcast radius r all take two kinds of extreme networks of low value or high level.When N and r value is smaller, the covering of network
Range is also very low, and vice versa.In the lower network of coverage rate, if a node leaves the cluster at original place, its week
Collarette border may be without any other cluster, therefore the time probability distribution that node rejoins network in this case is equal to
Rejoin the original cluster of node.Meanwhile if the value of N and r is very big, because the ratio of uncovered area is much smaller than the fortune of node
Dynamic range is equal to then whether node can rejoin network and spreads a node at random in the zone to observe the node and be
It is no by the network coverage.
After analyzing two extreme models, model under normal operation can be inferred that, i.e. the value of N and r are neither
It is too low also less high, it can be indicated by the two extreme models multiplied by different weights.
(1) the time probability model of former cluster is returned
In the lower situation of the network coverage, when node removes cluster, based on the joint movements model provided, one is carried out
Time needed for serial emulation experiment test node rejoins original cluster.Step number N changes to 100 from 1 with table in emulation experiment
Show different movement velocitys.For 100,000 node of each velocity test.Data fitting is detached from network node weight for constructing
The time probability distribution of original cluster is newly added.The objective function of fitting is
Num=Atp
Wherein, num is the number of nodes for returning to original cluster, and t is the time for returning to original cluster.The result of parameter fitting are as follows:
A=35496.9, p=-1.4210
Parameter A is obtained divided by experiment interior joint sum
Prob=0.354969t-1.4210
Wherein, prob indicates that node returns to the time probability of original cluster in time t.
(2) network coverage model
It is obvious that with the increase of N and r, the network coverage also be will increase.Assuming that node is dispersed in the region of 100*100
Interior, number of nodes N is differed from 10 to 50, and broadcast radius r is also between 10 to 50.The present invention calculates network using statistical method
Coverage rate.Given N and r, firstly generates 100 networks, and spread 1 at random in each network, and 000 node is counted by net
The number of nodes of network covering, and calculate the average number of nodes by the network coverage of the heterogeneous networks with identical N and r.This is flat
Coverage rate of the ratio that mean is obtained divided by 1,000 as network.
According to experimental result, it can be observed that the relationship between the network coverage and N and r are as follows:
Cov=1-eax+b
Wherein Cov indicates the coverage rate of network, and it is model to be fitted that x, which represents number of nodes N or broadcast radius r, a and b,
Parameter.Both ends take logarithm to obtain
Ln (1-Cov)=ax+b
Binary function is introduced in a complete formula to obtain after indicating N and r
Ln (1-Cov)=krN+sN+mr+t
Wherein, k, s, m, t are that the result to fitting parameter, based on fitting experimental data is
K=-0.007137156.s=-0.023377563
M=-0.05977249.t=0.514174569
Therefore, the network coverage and the relational model of N and r are
Cov=1-ekrN+sN+mr+t
Wherein Cov indicates the coverage rate of network, and k, s, m, t are to fitted model parameters, and e is natural constant, and value is about
2.71828。
(3) network time model is returned to
The present invention using the node of two kinds of extreme cases return to network model synthesize under normal circumstances when returning to network
Between model, and calculate the weight of two extreme models.
With the increase of coverage rate, uncovered area becomes smaller and more dispersed, it means that the node of disengaging can lead to
It is mobile to rejoin network to cross shorter distance.Obviously, moving distance is directly related with the reconnect time of node.Cause
This, the present invention describes node using equieffective ratio for mobile distance, is defined as
Wherein, L is equieffective ratio, and Cov indicates the coverage rate of network, and 1-Cov indicates not yet covered with networks region, square
The distance that the separate node that root can reflect moves before rejoining network.
The time probability model and the quantity of the network coverage and node or wide of original cluster are rejoined based on separate node
The relational model between radius is broadcast, the probability P ROB that separate node rejoins network is expressed as
PROB=W*prob+ (1-W) * Cov
W is the weight of first model, and 1-W is the weight of the second model, and it is original that prob indicates that separate node rejoins
The time probability of cluster, Cov indicate the relational model between the network coverage and the quantity or broadcast radius of node.The calculating of W is public
Formula are as follows:
The ratio K of two Model Weights is
As can be seen from the above analysis, equieffective ratio L is bigger, and the cluster around separate node is fewer.In this case,
The weight of first model becomes larger, and K value becomes smaller.Therefore we assume that the ratio and equieffective ratio are highly relevant, it is clear that
They are negatively correlated, and there are linear relationship, the model being fitted according to experimental result are as follows:
Wherein, K is the weight ratio of two models, and L is equieffective ratio, and a and b are parameters to be fitted, based on data
Fitting result are as follows:
A=3.825.b=-5.30412
As t > 1, it is meant that the distance between boundary and separate node become larger, and the influence of uncovered area shape
Become smaller.That is, rejoining the probability distribution and coverage rate of time if node does not rejoin in a short time
It has little or nothing to do with.Therefore, present invention assumes that as t > 1, the probability for rejoining network time equally rejoins original cluster
Probability distribution.Therefore, as t > 1, the probability that separate node rejoins network is
In view of the timeliness of energy consumption and data, The present invention gives a kind of methods, to obtain the optimal waiting time.If
The timeliness index of coincidence attenuation model of data,
Value=Ae-at
Wherein Value indicates data in the value that the time is t, and A and a are model parameters.
Assuming that separate node determines that the waiting time before directly sending data to base station is T, and assume in a time
The data that host node is collected into interval are 1 units.Meanwhile data are continuously collected within the waiting time, so if node
Waiting time is T, then be T by the energy consumption that all these data are sent to head node, and the energy consumption for being sent to base station is M times,
That is MT.Certainly, the timeliness of data is the summation for all data values not sent in T, i.e.,
Wherein ValueTIndicating that data are worth after waiting T time, A and a are model parameters,
After the timeliness and energy consumption for comprehensively considering data, the waiting time is the entire effectiveness P of TTFor
PT=ValueT-ET
Wherein, ValueTIndicate that the waiting time is equal to the data value of T, ETIt is the energy consumption for the waiting time being equal to T.Cause
This, the waiting time is the desired utilization E (P of TT) are as follows:
ValueiIndicate that the waiting time is equal to the data value of i, PROBT=iIndicate that the time is that i disengaging node returns to network
Probability, MT indicate the energy consumption that data are directly sent to base station.
It is detached from Node latency optimal decision method according in a kind of above-mentioned mobile ad-hoc network, the present invention also provides
It is a kind of movable type ad-hoc network in be detached from Node latency optimizing decision system, comprising:
Joint movements model building module: introducing two-dimensional random migration model, in each time interval, is walked by changing
Number N carrys out the movement velocity of analog node；
It returns to time model and establishes module: obtaining returning to time model, described two poles by analyzing two extreme models
Network when end model includes: step number N and broadcast radius r while taking low interval value or high interval value；
The optimal waiting time solves module: comprehensively considers the timeliness of energy consumption and data, the optimal waiting time is calculated,
It is detached from node to wait the connection request for the host node for carrying out automatic network within the optimal waiting time and rebuild connection, is being more than institute
After stating the optimal waiting time, it is detached from node and directly sends data to base station.
One skilled in the art will appreciate that in addition to realizing system provided by the invention in a manner of pure computer readable program code
It, completely can be by the way that method and step be carried out programming in logic come so that the present invention provides and its other than each device, module, unit
System and its each device, module, unit with logic gate, switch, specific integrated circuit, programmable logic controller (PLC) and embedding
Enter the form of the controller that declines etc. to realize identical function.So system provided by the invention and its every device, module, list
Member is considered a kind of hardware component, and to include in it can also for realizing the device of various functions, module, unit
To be considered as the structure in hardware component；It can also will be considered as realizing the device of various functions, module, unit either real
The software module of existing method can be the structure in hardware component again.
Specific embodiments of the present invention are described above.It is to be appreciated that the invention is not limited to above-mentioned
Particular implementation, those skilled in the art can make a variety of changes or modify within the scope of the claims, this not shadow
Ring substantive content of the invention.In the absence of conflict, the feature in embodiments herein and embodiment can any phase
Mutually combination.
Claims (10)
1. being detached from Node latency optimal decision method in a kind of movable type ad-hoc network characterized by comprising
Joint movements model foundation step: introducing two-dimensional random migration model, in each time interval, by changing step number N
Carry out the movement velocity of analog node；
It returns to time model establishment step: obtaining returning to time model, described two extreme moulds by analyzing two extreme models
Network when type includes: step number N and broadcast radius r while taking low interval value or high interval value；
Optimal waiting time solution procedure: comprehensively considering the timeliness of energy consumption and data, and the optimal waiting time is calculated, and is detached from
Node waits the connection request for the host node for carrying out automatic network within the optimal waiting time and rebuilds connection, be more than it is described most
After the excellent waiting time, it is detached from node and directly sends data to base station.
2. being detached from Node latency optimal decision method, feature in movable type ad-hoc network according to claim 1
It is, the relationship of step number N and broadcast radius r are as follows:
Cov=1-eax+b
Wherein Cov indicates the coverage rate of network, and it is model parameter that x, which represents step number N and broadcast radius r, a and b,.
3. being detached from Node latency optimal decision method, feature in movable type ad-hoc network according to claim 1
It is, includes calculating the weight of two extreme models by analyzing the method that two extreme models obtain returning to time model.
4. being detached from Node latency optimal decision method, feature in movable type ad-hoc network according to claim 1
It is, the timeliness index of coincidence attenuation model of data:
Value=Ae-at
Wherein Value indicates data in the value that the time is t, and A and a are model parameters, and e is natural constant；
The timeliness of data is the summation Value for all data values not sent in Node latency TT:
5. being detached from Node latency optimal decision method, feature in movable type ad-hoc network according to claim 4
It is, after the timeliness for comprehensively considering energy consumption and data, the entire effectiveness P of Node latency TTAre as follows:
PT=ValueT-ET
Wherein, ETIt is the energy consumption of Node latency T, the desired utilization E (P of Node latency TT) are as follows:
ValueiIndicate the data value of Node latency i, PROBT=iIndicate that node is detached from when the waiting time is i returns to network
Probability, MT indicate node directly to base station send data energy consumption.
6. being detached from Node latency optimizing decision system in a kind of movable type ad-hoc network characterized by comprising
Joint movements model building module: introducing two-dimensional random migration model, in each time interval, by changing step number N
Carry out the movement velocity of analog node；
It returns to time model and establishes module: obtaining returning to time model, described two extreme moulds by analyzing two extreme models
Network when type includes: step number N and broadcast radius r while taking low interval value or high interval value；
The optimal waiting time solves module: comprehensively considering the timeliness of energy consumption and data, the optimal waiting time is calculated, be detached from
Node waits the connection request for the host node for carrying out automatic network within the optimal waiting time and rebuilds connection, be more than it is described most
After the excellent waiting time, it is detached from node and directly sends data to base station.
7. being detached from Node latency optimizing decision system, feature in movable type ad-hoc network according to claim 6
It is, the relationship of step number N and broadcast radius r are as follows:
Cov=1-eax+
Wherein Cov indicates the coverage rate of network, and it is model parameter that x, which represents step number N and broadcast radius r, a and b,.
8. being detached from Node latency optimizing decision system, feature in movable type ad-hoc network according to claim 6
It is, includes calculating the weight of two extreme models by analyzing the method that two extreme models obtain returning to time model.
9. being detached from Node latency optimizing decision system, feature in movable type ad-hoc network according to claim 6
It is, the timeliness index of coincidence attenuation model of data:
Value=Ae-at
Wherein Value indicates data in the value that the time is t, and A and a are model parameters, and e is natural constant；
The timeliness of data is the summation Value for all data values not sent in Node latency TT:
10. being detached from Node latency optimizing decision system, feature in movable type ad-hoc network according to claim 9
It is, after the timeliness for comprehensively considering energy consumption and data, the entire effectiveness P of Node latency TTAre as follows:
PT=ValueT-ET
Wherein, ETIt is the energy consumption of Node latency T, the desired utilization E (P of Node latency TT) are as follows:
ValueiIndicate the data value of Node latency i, PROBT=iIndicate that node is detached from when the waiting time is i returns to network
Probability, MT indicate node directly to base station send data energy consumption.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910521771.8A CN110366126B (en) | 2019-06-17 | 2019-06-17 | Optimal decision-making method and system for waiting time of off-node in mobile ad hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910521771.8A CN110366126B (en) | 2019-06-17 | 2019-06-17 | Optimal decision-making method and system for waiting time of off-node in mobile ad hoc network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110366126A true CN110366126A (en) | 2019-10-22 |
| CN110366126B CN110366126B (en) | 2020-08-04 |
Family
ID=68216262
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910521771.8A Active CN110366126B (en) | 2019-06-17 | 2019-06-17 | Optimal decision-making method and system for waiting time of off-node in mobile ad hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110366126B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113126576A (en) * | 2019-12-31 | 2021-07-16 | 北京国双科技有限公司 | Energy consumption optimization model construction method for gathering and transportation system and energy consumption control method for gathering and transportation system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101489308A (en) * | 2008-12-30 | 2009-07-22 | 中国人民解放军国防科学技术大学 | Active waiting transmission method used for wireless Ad Hoc network stream competition |
| CN104581750A (en) * | 2015-01-08 | 2015-04-29 | 陕西师范大学 | Construction method for opportunity network computable model |
| US20150195806A1 (en) * | 2014-01-03 | 2015-07-09 | Ajou University Industry-Academic Cooperation Foundation | Method and apparatus for predicting mobility based on relative mobile characteristics |
| US20170147728A1 (en) * | 2015-05-20 | 2017-05-25 | Saudi Arabian Oil Company | Parallel solution for fully-coupled fully-implicit wellbore modeling in reservoir simulation |
| CN107919918A (en) * | 2017-11-20 | 2018-04-17 | 中国人民解放军陆军工程大学 | The reliable acquisition method of Internet of Things data under a kind of mobile node auxiliary water |
-
2019
- 2019-06-17 CN CN201910521771.8A patent/CN110366126B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101489308A (en) * | 2008-12-30 | 2009-07-22 | 中国人民解放军国防科学技术大学 | Active waiting transmission method used for wireless Ad Hoc network stream competition |
| US20150195806A1 (en) * | 2014-01-03 | 2015-07-09 | Ajou University Industry-Academic Cooperation Foundation | Method and apparatus for predicting mobility based on relative mobile characteristics |
| CN104581750A (en) * | 2015-01-08 | 2015-04-29 | 陕西师范大学 | Construction method for opportunity network computable model |
| US20170147728A1 (en) * | 2015-05-20 | 2017-05-25 | Saudi Arabian Oil Company | Parallel solution for fully-coupled fully-implicit wellbore modeling in reservoir simulation |
| CN107919918A (en) * | 2017-11-20 | 2018-04-17 | 中国人民解放军陆军工程大学 | The reliable acquisition method of Internet of Things data under a kind of mobile node auxiliary water |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113126576A (en) * | 2019-12-31 | 2021-07-16 | 北京国双科技有限公司 | Energy consumption optimization model construction method for gathering and transportation system and energy consumption control method for gathering and transportation system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110366126B (en) | 2020-08-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Luo et al. | Self-learning based computation offloading for internet of vehicles: Model and algorithm | |
| Stojmenovic | Fog computing: A cloud to the ground support for smart things and machine-to-machine networks | |
| Chiwewe et al. | A distributed topology control technique for low interference and energy efficiency in wireless sensor networks | |
| Alam et al. | Convergence of MANET in communication among smart devices in IoT | |
| Wang et al. | Mobility based energy efficient and multi-sink algorithms for consumer home networks | |
| CN102271379A (en) | Energy-saving routing method of nodes of internet of things based on context-aware technology | |
| CN101715201B (en) | Method for acquiring information by sink node in wireless sensor network when moving | |
| CN103281233B (en) | A kind of ubiquitous sensor network system framework and its implementation | |
| CN101896002B (en) | Rapid data aggregation-oriented wireless sensor and actor network clustering method | |
| Xia et al. | Cluster-enabled cooperative scheduling based on reinforcement learning for high-mobility vehicular networks | |
| CN103019172A (en) | Self-organizing radio monitoring system and method | |
| CN110167054A (en) | A kind of QoS CR- LDP method towards the optimization of edge calculations node energy | |
| CN102065446B (en) | Topology control system and method orienting group mobile environment | |
| CN113156992A (en) | Three-layer architecture collaborative optimization system and method for unmanned aerial vehicle in edge environment | |
| Zhang et al. | AoI minimization for WSN data collection with periodic updating scheme | |
| CN110366126A (en) | Node latency optimal decision method and system are detached from mobile ad-hoc network | |
| Lin et al. | A review of data sets of short-range wireless networks | |
| Xie et al. | Dynamic d2d multihop offloading in multi-access edge computing from the perspective of learning theory in games | |
| CN103080969B (en) | Cooperative information collection system and cooperative information collection method | |
| CN105101334B (en) | A kind of more WBAN co-existin networks collaboration network-building methods | |
| Jiang et al. | Research on wireless sensor networks routing protocol for wetland water environment monitoring | |
| CN104320821B (en) | Initial networking and method for routing in a kind of alien frequencies wireless sensor network | |
| CN104601424B (en) | The passive transacter of master and method of probabilistic model are utilized in equipment control net | |
| CN106385687B (en) | A kind of distribution method and device of network baseband functions ratio | |
| CN102202402B (en) | Minimum competition window strategy MAC layer channel assignment method of wireless sensor network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |