CN112689314B - Multi-hop wireless sensor network data path optimization method based on memory allocation - Google Patents
Multi-hop wireless sensor network data path optimization method based on memory allocation Download PDFInfo
- Publication number
- CN112689314B CN112689314B CN202011530120.4A CN202011530120A CN112689314B CN 112689314 B CN112689314 B CN 112689314B CN 202011530120 A CN202011530120 A CN 202011530120A CN 112689314 B CN112689314 B CN 112689314B
- Authority
- CN
- China
- Prior art keywords
- data
- wireless sensor
- memory
- sensor network
- bandwidth
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Abstract
The invention discloses a data path optimization method of a multi-hop wireless sensor network based on memory allocation, relates to the technical field of wireless sensing, and aims to solve the problems that the use condition of memories of relay nodes and whether data are correctly allocated are not considered in the conventional data path allocation method, so that more packet loss data and error data can be generated in the data transmission process, and the data transmission accuracy is reduced.
Description
Technical Field
The invention relates to the technical field of wireless sensing, in particular to a multi-hop wireless sensor network data path optimization method based on memory allocation.
Background
The information-physical numerical control machine tool system can realize high integration and real-time interaction of physical components and sensing layer information as an important direction in the technical field of wireless sensing. The multi-hop wireless sensor network is an important component of an information-physical numerical control system and is responsible for data acquisition/transmission and assistance in fault information diagnosis. In the data transmission process, due to the limitations of memory and bandwidth, the unreasonable data path can reduce the accuracy of data transmission and the real-time performance of the system, which is very disadvantageous to an information-physical numerically-controlled machine tool system highly dependent on data precision, and the function of the system is greatly limited. Therefore, it is necessary to optimize the data transmission path to ensure the accuracy of the data and the rapidity of the transmission process
The wireless sensor can meet the performance expansion requirement of an information-physical numerical control system due to higher flexibility, and the problems of unchanged installation and difficult wiring of the traditional wired sensor are solved. Along with the increase of intelligent algorithms carried by a numerical control system, the number of the adapted sensors is increased, and the performance of the wired sensor is greatly limited due to the defects of the wired sensor. On the contrary, the wireless sensor can easily solve the problem of limited installation conditions, namely the requirement of the physical numerical control machine tool on the type and the number of the sensors.
The multi-hop network can realize long-distance low-loss transmission of data and interconnection and integration of information of a plurality of manufacturing units, thereby achieving the aims of centralized management of production data and improvement of the working efficiency of the wireless sensor network.
The existing data path configuration method does not consider the use condition of the memory of each relay node and whether the data is correctly distributed, so that more packet loss data and error data are generated in the data transmission process, the data transmission accuracy is reduced, and the processing process is influenced. Meanwhile, too high memory usage rate will increase the burden of the wireless network system, resulting in increased data transmission delay and affected real-time performance of the system.
Disclosure of Invention
The purpose of the invention is: aiming at the problems that the existing data path configuration method does not consider the use condition of the memory of each relay node and whether the data is correctly distributed, so that more packet loss data and error data are generated in the data transmission process, and the data transmission accuracy is reduced, the method for optimizing the data path of the multi-hop wireless sensor network based on the memory distribution is provided.
The technical scheme adopted by the invention to solve the technical problems is as follows: the method for optimizing the data path of the multi-hop wireless sensor network based on memory allocation comprises the following steps:
the method comprises the following steps: constructing a multi-hop wireless sensor network, wherein the multi-hop wireless sensor network comprises a shared memory, a logic storage and a processor;
step two: representing the relationship of each element in the multi-hop wireless sensor network by using a fuzzy graph;
step three: establishing a quintuple for describing data flow of the multi-hop wireless sensor network, wherein the quintuple comprises a processor identifier, a bandwidth requirement, a memory requirement and data flow starting and ending time elements;
step four: establishing a bandwidth boundary condition, a memory boundary condition and a data overlapping condition which meet the data flow of the multi-hop wireless sensor network based on a full time spectrum theory and by combining a fuzzy graph and a quintuple, and then establishing an MILP problem according to the established bandwidth boundary condition, memory boundary condition and data overlapping condition;
step five: and solving the MILP problem through MATLAB to obtain the optimal solution of the multi-hop wireless sensor network data path based on memory allocation, namely the optimized multi-hop wireless sensor network data path.
Further, the bandwidth boundary condition meeting the data flow of the multi-hop wireless sensor network is as follows:
if no relay node exists in the multi-hop network, the bandwidth boundary condition is
Wherein T iskIs a time operator;
if the multi-hop network has the relay station to perform secondary transmission on the data, the bandwidth boundary condition should be
Wherein d isi，djRespectively representing the bandwidth requirements of the base station and the relay station,
indicating that no relay station node exists in the multi-hop network and the kth data flow f in the set piiThe correspondence with the path ft is such that,
indicating that the multi-hop network has a relay station to perform secondary transmission on data, wherein the kth data stream f in the set piiThe correspondence relationship with the path ft, F denotes a data flow, F denotes a set of data flows, and bw (e) denotes a bandwidth upper limit.
Further, the memory boundary condition meeting the data flow of the multi-hop wireless sensor network is performed by a condition that a logic cache region is mapped to a shared memory, and the condition that the logic cache region is mapped to the shared memory includes:
if the multi-hop network does not have the relay station node, the multi-hop network is represented as
Wherein, the binary variable Alb,m＝{0,1}，lb∈LB,m∈M，A lb,m0 indicates that data in the logical buffer can be transferred to the shared memory, alb,m1 means that the data in the logical buffer cannot be transferred to the shared memory;
if the multi-hop network has the relay station to carry out secondary transmission on the data, the data is expressed as
Wherein, MIDlbi,lbjDenotes a base station S {0,1}iWhether or not to transmit data to the relay station Sj。
Further, the memory boundary condition meeting the data flow of the multi-hop wireless sensor network is as follows:
wherein, size (b)j) And size (b)i) Respectively, size (m) represents the total amount of memory, life (lb) represents the logical buffer lb at time TkIs effective.
Further, the data overlapping condition satisfying the data flow of the multi-hop wireless sensor network is represented as:
wherein M isbIs a shared memory valid first address.
Further, the specific process of the fifth step is as follows:
establishing a bandwidth boundary condition weight factor c1Memory boundary weight factor c2Carrying out weighted optimization on the non-inferior solution, and solving W as c1bw(ei) The minimum value of c2 (sigma bi) is the optimal solution of the multi-hop wireless sensor network data path, wherein c is1，c2∈[0,1]，c1+c2＝1。
Further, the fuzzy graph is represented as: g ═ V, E)
Wherein, V ═ LB ═ P { [ u ] M, M is a shared memory, LB is a logical storage, P is a processor, and set E represents bandwidth requirements between the logical cache and the processor element, and between the shared memory and the processor element in the fuzzy graph.
Further, the quintuple is represented by:
fi＝(pi,lbi,di,(t1)i,(t2)i) The method comprises the steps that read-write access from a processing unit of a sensor to a logic buffer area under certain bandwidth requirements is expressed;
fi＝(pi,mi,di,(t1)i,(t2)i) The method comprises the following steps that read-write access from a processing unit to a shared memory is expressed under a certain bandwidth requirement;
ft(p,lb)＝(p,v’0)∪(v’0,v’1),...,(v’klb) represents the data flow path experienced by the sensor processing unit p to the logical buffer;
ft(p,m)＝(p,v’0)∪(v’0,v’1),...,(v’km) represents the data flow path traversed by processing unit p to shared memory;
wherein p isiProcessing unit, lb, representing a corresponding sensoriA logical buffer representing an access, diIndicates the bandwidth requirement, t1And t2Indicating the start and end times of the read and write access.
The invention has the beneficial effects that:
1. by adopting the method, the influence of the memory, the bandwidth utilization rate and the data overlapping on the multi-hop wireless sensor network is fully considered, the data transmission boundary condition based on the memory allocation is established, the accuracy of data transmission can be effectively ensured, and the data transmission accuracy is obviously improved compared with the existing path planning method.
2. By adopting the method, the MILP non-inferior solution is weighted and optimized under the condition of ensuring accurate data transmission, the influence of the memory and bandwidth utilization rate of the data transmission node of the multi-hop wireless sensor network on the data transmission efficiency is reasonably balanced, the aim of reducing the data transmission delay is fulfilled, and the average data transmission delay is about 60 percent lower than that of the existing method.
Drawings
FIG. 1 is a diagram of an example of the present application;
FIG. 2 is a graph comparing experimental results of the present application with conventional path and non-bad path problem data;
fig. 3 is a graph comparing the experimental results of the average delay of the present application with the conventional path and the non-inferior path.
Detailed Description
The first embodiment is as follows: referring to the present embodiment, a method for optimizing a data path of a multi-hop wireless sensor network based on memory allocation according to the present embodiment includes the following steps:
the method comprises the following steps: constructing a multi-hop wireless sensor network, wherein the multi-hop wireless sensor network comprises a shared memory, a logic storage and a processor;
step two: representing the relationship of each element in the multi-hop wireless sensor network by using a fuzzy graph;
step three: establishing a quintuple for describing data flow of the multi-hop wireless sensor network, wherein the quintuple comprises a processor identifier, a bandwidth requirement, a memory requirement and data flow starting and ending time elements;
step four: establishing a bandwidth boundary condition, a memory boundary condition and a data overlapping condition which meet the data flow of the multi-hop wireless sensor network based on a full time spectrum theory and by combining a fuzzy graph and a quintuple, and then establishing an MILP problem according to the established bandwidth boundary condition, memory boundary condition and data overlapping condition;
step five: and solving the MILP problem through MATLAB to obtain the optimal solution of the multi-hop wireless sensor network data path based on memory allocation, namely the optimized multi-hop wireless sensor network data path.
Step 1: simplifying the wireless sensor multi-hop network into a basic hardware structure consisting of a shared memory M, a logic memory LB and a processor element P, and representing the basic hardware structure by a fuzzy graph G (V, E); elements in the sets M, LB and P respectively represent a shared memory element, a logical cache element, and a processor element in the fuzzy graph, where V ═ LB @ P @ M;
set E represents the bandwidth requirements between the logical cache and the processor elements, and between the shared memory and the processor elements in the fuzzy graph. Wherein the bandwidth between adjacent nodes is expressed in kilobytes per second (KBps);
step 2: establishing a five-tuple fi ═ (pi, lbi, di, (t1) i, (t2) i) indicates read-write access to the logical buffer by the processing unit of the sensor under certain bandwidth requirements. Wherein pi represents a processing unit of a corresponding sensor, lbi represents an accessed logic buffer area, di represents a bandwidth requirement, and t1 and t2 represent the start and end time of read-write access; the size of the logical buffer is represented by size (lbi), wherein lbi ∈ LB; similarly, fi ═ i, (t1) i, (t2) i) indicates read-write access from the processing unit to the shared memory under certain bandwidth requirements;
ft (p, lb) ═ p, v '0 @ (v' 0, v '1),., (v' k, lb) represents the data flow path experienced by sensor processing unit p to the logical cache; similarly, ft (p, m) ═ p, v '0 @, (v' 0, v '1) @, (v' k, m) represents the data flow path experienced by processing unit p to shared memory; a set π is established representing all paths in the fuzzy graph G, i.e., ft ∈ π. A binary variable Pf, pi ═ {0,1} represents a correspondence relationship between the data stream fi and the path ft;
and step 3: establishing a time operator
All time dependent items in the data stream are processed. Wherein T represents a set of all time operators in the fuzzy graph, and the number of elements in the set T is positively correlated with the number of processing units and logical cache regions;
the boundary conditions of the data stream at any time include:
bandwidth boundary conditions, in order to ensure that the data stream is valid, at any point in time, the total amount of transmitted data must not exceed the bandwidth upper bound bw (e), and based on this, two situations may occur:
if there is no relay node in the multi-hop network, the bandwidth boundary condition is,
wherein Tk is a time operator;
if the multi-hop network has the relay station to perform secondary transmission on the data, the boundary condition should be
Wherein d isi，djRespectively representing the bandwidth requirements of the base station and the relay station;
mapping conditions of the logic cache regions and the shared memory are used for ensuring that the content of each logic cache region can be distributed to the corresponding shared memory, if the multi-hop network does not have the relay station node, the relay station node is arranged
And the binary variable Alb, M ═ {0,1}, LB ∈ LB, and M ∈ M indicates whether the data in the logical buffer can be transmitted to the shared memory. If the multi-hop network has the relay station to carry out secondary transmission on the data, the mapping condition is as follows,
wherein, MIDlbi,lbjDenotes a base station S {0,1}iWhether or not to transmit data to the relay station Sj；
The boundary conditions of the memory are set to be,the total amount of data in the logical cache should not exceed the shared memory capacity, i.e.
Wherein, size (b)j) And size (b)i) Respectively representing the size of data volume in the logical buffer area, size (m) representing the total memory, life (lb) representing that the logical buffer area lb is effective at the time point Tk;
data overlap boundary condition, in order to ensure the accuracy of data, the data of two logical buffers are not allowed to overlap in the shared memory in memory allocation, i.e. Db1+ size (b1) ≦ Db2, where Db1 and Db2 are the first addresses of the data transferred by the two logical buffers. Meanwhile, in order to ensure that the data of the logical cache region can be effectively transferred to the shared memory, the first address of the data of the logical cache region should be allocated after the effective first address of the shared memory, that is:
And 4, step 4: establishing an MILP problem according to boundary conditions, and introducing the MILP problem into MATLAB to solve a non-inferior solution;
establishing a bandwidth boundary condition weight factor c1 and a memory boundary weight factor c2, performing weighted optimization on a non-inferior solution, and solving that the minimum value of W (c 1bw (ei) c2(Σ bi) is the optimal solution of the data path of the multi-hop wireless sensor network, wherein c1, c2 is epsilon [0,1], and c1+ c2 is 1.
Example (b):
referring to fig. 1, an information-physical system composed of two information-physical numerically controlled machine tools is shown as follows after simplification: 3 logic memories of 4MB are respectively connected to the corresponding three sensor processor units, the sensor 1 and the sensor 2 are sensing elements of the machine tool 1, the sensor 3 is a sensing element of the machine tool 2, and sensing data of the two information-physical machine tools can be sent to a 512M shared memory by the base station 1, the base station 2 and the base station 3; the comparison paths contained in the figure are the conventional path and the non-inferior path.
At time t-0, the wireless sensor 1 generates a data stream and ends at time t-4, and the wireless sensor 3 generates a data stream and ends at time t-6, so that the two data streams can be represented as f1 ═ p1, lb1,260,0,4, and f3 ═ p3, lb3,450,0, 6; the data stream of the wireless sensor 2 occurs at time t2 and ends at time t4, which may be denoted as f2 ═ p2, lb2,280,2, 8. When the time t is 5, the processors P1 and P2 write data into the shared memory, and the data flow is f4 ═ (P1, m,260,5,8), and f5 ═ P2, m,280,5, 8); the data flow generated by the processor P3 writing data into the shared memory at time t-7 is f6 ═ P3, m,450,7, 8;
the data transmission path in the example includes 7 effective paths:
a first path ft1(p1, m) ═ p1, v0 ═ u (v' 0, s1) u (s1, v1) u (v1, s2) u (s2, v3) u (v3, m);
the second path is as follows: ft2(p2, m) ═ p2, v '0 ═ cov (v' 0, s1) cov (s1, v1) cov (v1, s2) cov (s2, v3) cov (v3, m);
the third path: ft3(p3, m) ═ p3, v "0 ═ gou (v" 0, s3) gou (s3, v4) gou (v4, m);
the fourth path: ft4(p3, m) ═ p3, v '"0 ═ co (v'" 0, s1) co (s1, v1) co (v1, s2) co (s2, v3) co (v3, m);
fifth route: ft5(p1, lb1) ═ (p1, lb 1);
sixth route: ft6(p1, lb2)) ═ (p2, lb 2);
seventh route: ft7(p1, lb3) ═ (p3, lb 3);
the seven paths can satisfy Pfi, where pi is 1, that is, there are three valid paths that allow the sensor processor to access the corresponding logical cache, and four valid paths that allow the data in the logical cache to be transferred to the shared memory;
the time operators T1, T2,
wherein T1 ═ {0,1,2,3}, T2 ═ 2,3}, T3 ═ 0,1,2,3,4,5 };
considering that the data transmission path of the cyber-physical numerically controlled machine tool 1 is far and must include a relay station to perform secondary transmission on the data, the boundary condition of the bandwidth should beComprises the following steps:
if the transmission path of the information-physical numerical control machine tool 2 is relatively close and does not include a relay station, the boundary conditions of the bandwidth are as follows:
if the information-physical numerical control machine tool 2 needs the relay station to transmit data for the second time, the boundary condition is similar to that of the machine tool 1;
because the information-physical numerically-controlled machine tool 1 comprises the relay station to perform secondary transmission on data, the mapping conditions of the logic cache area and the shared memory are as follows:
if the relay station node does not exist in the data transmission path of the information-physical numerical control machine tool 2, the mapping condition is as follows:
otherwise, the mapping conditions of the machine tool 2 are similar to those of the machine tool 1;
at any time, the total amount of data information transmitted by the data path should be less than the total amount of the shared memory, so the memory boundary conditions are:
the sensing data of each machine tool should be distributed in order in the shared memory, and the data between the two buffers is not allowed to overlap in the distribution, so Db1+ size (b1) ≦ Db 2; the first address of the data in the logical cache should be allocated after the effective first address of the shared memory, i.e.
Establishing an MILP problem according to boundary conditions, and leading the problem into MATLAB to solve to obtain two paths, wherein the path 1: the sensor data of the machine tool 1 is transmitted to the shared memory through the base station 1 and the base station 2, and the sensor data of the machine tool 2 is transmitted to the shared memory only through the base station 3; route 2: the sensor data of the machine tool 1 and the machine tool 2 are transmitted to the shared memory after being sent to the base station 2 through the base station 1;
setting the boundary condition weight factor c1 to be 0.55 and the memory boundary weight factor c2 to be 0.45, and substituting W to c1bw (ei) c2(Σ bi) to obtain W1 and W2; the optimal solution of the data path of the multi-hop wireless sensor network is min { W1, W2}, the optimal solution of the data path of the multi-hop network obtained after solving is path 1, and path 2 is a non-inferior solution;
FIG. 2 is a graph comparing experimental results of the method of the present invention with conventional path and non-bad path problem data. The conventional path does not include the base station 2, and meanwhile, the conventional path needs to rely on the base station 3 as a relay station to transmit data because the base station 1 is far away from the router. In the figure, the ordinate is the total data amount, the packet loss data amount, and the error data amount of each path, and the abscissa is the data amount. The total data transmission amount in 120 minutes is 166320B, and it can be seen that no error data occurs by the method of the present invention, the packet loss data is only 14B, and the occurrence of packet loss data is because white noise exists in the data transmission process and affects the data transmission effect. By adopting a non-bad path, the data volume of a node at a certain time is overlarge due to the fact that the weight between the bandwidth and the memory is not considered, so that the system load is increased, and the number of the packet loss data and the number of error data are more than those of the method. In the conventional path, due to lack of limitation of boundary conditions, in the data transmission process, a data overflow condition occurs, so that a large amount of lost data and error data exist in the transmitted data. It can be seen that the performance of the method proposed by the present invention is always superior to other methods.
FIG. 3 is a graph comparing the average delay of the method of the present invention with the average delay of the conventional path and the non-bad path. The abscissa is time and the ordinate is the average delay. It can be seen that, in the data transmission process, the method of the present invention considers the memory and bandwidth utilization rate of each relay station, so that the average delay is 25ms, and compared with the average delay of 75ms for a non-bad path and the average delay of 106ms for a conventional path, the delay reduction effect is obvious. Meanwhile, along with the increase of data load, the delay jitter frequency of the method is less than that of other paths, and the data transmission is more stable. Compared with the prior art, the method provided by the invention has the advantage that the average data transmission delay is reduced by about 60%.
It should be noted that the detailed description is only for explaining and explaining the technical solution of the present invention, and the scope of protection of the claims is not limited thereby. It is intended that all such modifications and variations be included within the scope of the invention as defined in the following claims and the description.
Claims (2)
1. The method for optimizing the data path of the multi-hop wireless sensor network based on memory allocation is characterized by comprising the following steps of:
the method comprises the following steps: constructing a multi-hop wireless sensor network, wherein the multi-hop wireless sensor network comprises a shared memory, a logic storage and a processor;
step two: representing the relationship of each element in the multi-hop wireless sensor network by using a fuzzy graph;
step three: establishing a quintuple for describing data flow of the multi-hop wireless sensor network, wherein the quintuple comprises a processor identifier, a bandwidth requirement, a memory requirement and data flow starting and ending time elements;
step four: establishing a bandwidth boundary condition, a memory boundary condition and a data overlapping condition which meet the data flow of the multi-hop wireless sensor network based on a full time spectrum theory and by combining a fuzzy graph and a quintuple, and then establishing an MILP problem according to the established bandwidth boundary condition, memory boundary condition and data overlapping condition;
step five: solving the MILP problem through MATLAB to obtain an optimal solution of a multi-hop wireless sensor network data path based on memory allocation, namely the optimized multi-hop wireless sensor network data path;
the bandwidth boundary condition meeting the data flow of the multi-hop wireless sensor network is as follows:
if no relay node exists in the multi-hop network, the bandwidth boundary condition is
Wherein T iskIs a time operator;
if the multi-hop network has the relay station to perform secondary transmission on the data, the bandwidth boundary condition should be
Wherein d isi，djRespectively representing the bandwidth requirements of the base station and the relay station,
indicating that no relay station node exists in the multi-hop network and the kth data flow f in the set piiThe correspondence with the path ft is such that,
indicating that the multi-hop network has a relay station to perform secondary transmission on data, wherein the kth data stream f in the set piiThe correspondence with the path ft, F denotes a data stream, F denotes a set of data streams, bw (e) denotes a bandwidth upper limit, e denotes a bandwidth limit,
indicating the data flow path experienced by the ith sensor processing unit pi through the ith logical buffer lbi,
a transpose representing a data flow path experienced by the ith logical buffer lbi through the jth logical buffer lbj;
the memory boundary condition meeting the data flow of the multi-hop wireless sensor network is performed through a condition that a logic cache region is mapped to a shared memory, and the condition that the logic cache region is mapped to the shared memory comprises the following steps:
if the multi-hop network does not have the relay station node, the multi-hop network is represented as
Where m represents memory, a binary variable Alb,m＝{0,1}，lb∈LB,m∈M，Alb,m0 indicates that data in the logical buffer can be transferred to the shared memory, alb,m1 means that the data in the logical buffer cannot be transferred to the shared memory;
if the multi-hop network has the relay station to carry out secondary transmission on the data, the data is expressed as
Wherein, MIDlbi,lbjDenotes a base station S {0,1}iWhether or not to transmit data to the relay station Sj；
The memory boundary conditions meeting the data flow of the multi-hop wireless sensor network are as follows:
wherein, size (lb)j) And size (lb)i) Respectively, size (m) represents the total amount of memory, life (lb) represents the logical buffer lb at time TkIs effective, Albj,mRepresenting a binary variable;
the data overlapping condition meeting the data flow of the multi-hop wireless sensor network is represented as follows:
wherein M isbFor sharing the effective first address of the memory, DlbiIndicating the data head address of the ith logical buffer, DlbjIndicating the data head address of the jth logical buffer;
the fuzzy graph is represented as: g ═ V, E)
Wherein, V ═ LB ═ P ≧ u {, M is shared memory, LB is logical storage, P is processor, set E represents the bandwidth demand between logical buffer and processor element, shared memory and processor element in the fuzzy graph;
the quintuple is represented as:
fi＝(pi,lbi,di,(t1)i,(t2)i) The method comprises the steps that read-write access from a processing unit of a sensor to a logic buffer area under certain bandwidth requirements is expressed;
fi＝(pi,mi,di,(t1)i,(t2)i) The method comprises the following steps that read-write access from a processing unit to a shared memory is expressed under a certain bandwidth requirement;
ft(p,lb)＝(p,v’0)∪(v’0,v’1),...,(v’klb) represents the data flow path experienced by the sensor processing unit p to the logical buffer;
ft(p,m)＝(p,v’0)∪(v’0,v’1),...,(v’km) represents the data flow path traversed by processing unit p to shared memory;
wherein p isiProcessing unit, lb, representing a corresponding sensoriA logical buffer representing an access, diIndicates the bandwidth requirement, t1And t2And v represents the process of accessing the data of the current equipment.
2. The method for optimizing the data path of the multi-hop wireless sensor network based on the memory allocation as claimed in claim 1, wherein the concrete process of the step five is as follows:
establishing a bandwidth boundary condition weight factor c1Memory boundary weight factor c2Carrying out weighted optimization on the non-inferior solution, and solving W as c1bw(ei) The minimum value of c2 (sigma lbi) is the optimal solution of the multi-hop wireless sensor network data path, wherein c1，c2∈[0,1]，c1+c2＝1，eiIndicating the upper limit of the bandwidth between the nodes of the ith path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011530120.4A CN112689314B (en) | 2020-12-22 | 2020-12-22 | Multi-hop wireless sensor network data path optimization method based on memory allocation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011530120.4A CN112689314B (en) | 2020-12-22 | 2020-12-22 | Multi-hop wireless sensor network data path optimization method based on memory allocation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112689314A CN112689314A (en) | 2021-04-20 |
| CN112689314B true CN112689314B (en) | 2021-09-14 |
Family
ID=75450687
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011530120.4A Active CN112689314B (en) | 2020-12-22 | 2020-12-22 | Multi-hop wireless sensor network data path optimization method based on memory allocation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112689314B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102695180A (en) * | 2011-03-23 | 2012-09-26 | 中兴通讯股份有限公司 | Mixed sink node WSN and data collection method thereof |
| US8811188B1 (en) * | 2006-06-05 | 2014-08-19 | Purdue Research Foundation | Protocol for secure and energy-efficient reprogramming of wireless multi-hop sensor networks |
| CN104202772A (en) * | 2014-09-09 | 2014-12-10 | 河海大学常州校区 | Mobile Sink data collection method applied to wireless sensor network and used for node internal-memory resource sharing |
| WO2015114466A2 (en) * | 2014-01-28 | 2015-08-06 | King Abdullah University Of Science And Technology | Buffer sizing for multi-hop networks |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9357472B2 (en) * | 2010-04-27 | 2016-05-31 | International Business Machines Corporation | Adaptive wireless sensor network and method of routing data in a wireless sensor network |
-
2020
- 2020-12-22 CN CN202011530120.4A patent/CN112689314B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8811188B1 (en) * | 2006-06-05 | 2014-08-19 | Purdue Research Foundation | Protocol for secure and energy-efficient reprogramming of wireless multi-hop sensor networks |
| CN102695180A (en) * | 2011-03-23 | 2012-09-26 | 中兴通讯股份有限公司 | Mixed sink node WSN and data collection method thereof |
| WO2015114466A2 (en) * | 2014-01-28 | 2015-08-06 | King Abdullah University Of Science And Technology | Buffer sizing for multi-hop networks |
| CN104202772A (en) * | 2014-09-09 | 2014-12-10 | 河海大学常州校区 | Mobile Sink data collection method applied to wireless sensor network and used for node internal-memory resource sharing |
Non-Patent Citations (1)
| Title |
|---|
| Optimal wireless sensor networks (WSNs) deployment: minimum cost with lifetime constraint;Kenan Xu 等1;《IEEE International Conference on Wireless and Mobile Computing, Networking And Communications (WiMob)》;20051231;第3卷;第1-8页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112689314A (en) | 2021-04-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9025457B2 (en) | Router and chip circuit | |
| US9426099B2 (en) | Router, method for controlling router, and program | |
| US9075747B2 (en) | Bus controller and control unit that outputs instruction to the bus controller | |
| US9961005B2 (en) | Bus system and computer program | |
| Dahel et al. | Designing flexibility into cellular manufacturing systems | |
| CN103685053B (en) | Network processor load balancing and scheduling method based on residual task processing time compensation | |
| CN101119308A (en) | Routing device and method of wireless mobile self-organizing network of dynamic assurance service quality | |
| US10305825B2 (en) | Bus control device, relay device, and bus system | |
| CN104484233A (en) | Method of allocating resources | |
| CN105094751A (en) | Memory management method used for parallel processing of streaming data | |
| CN105072032B (en) | A kind of method and system of definite network-on-chip routed path | |
| CN105376297A (en) | SDN controller quantity adjustment and controller and switch mapping method | |
| CN105095109A (en) | Cache access method, cache access router and computer system | |
| CN112689314B (en) | Multi-hop wireless sensor network data path optimization method based on memory allocation | |
| CN108804347A (en) | A kind of cache layer, collecting system and method for industrial big data convergence | |
| CN101488923A (en) | Implementing method for network-on-chip data packet encoding optimization | |
| CN100579050C (en) | System and method for node band width equitable distribution on elastic grouping ring | |
| CN104320343A (en) | Electric energy perception cross-domain virtual network mapping method and system | |
| CN109981794A (en) | Processing method, device and electronic equipment based on block chain meshed network | |
| CN115426221A (en) | Gateway device of Internet of things | |
| CN110611578B (en) | Method and device for allocating network resources | |
| Zhou | Wireless sensor network deployment in cyberphysical machine tool system based on optimal allocation of memory buffers | |
| CN112001141A (en) | Brain network inspired medium-large scale on-chip interconnection system synthesis method | |
| Liu et al. | Non‐inferior Nash strategies for routing control in parallel‐link communication networks | |
| Tran-Dang et al. | A Distributed Resource Allocation Algorithm for Task Offioading in Fog-enabled IoT Systems |
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 |