CN107949027A - A kind of dynamic deferred route selecting methods of AODV based on Energy-aware - Google Patents
A kind of dynamic deferred route selecting methods of AODV based on Energy-aware Download PDFInfo
- Publication number
- CN107949027A CN107949027A CN201711112082.9A CN201711112082A CN107949027A CN 107949027 A CN107949027 A CN 107949027A CN 201711112082 A CN201711112082 A CN 201711112082A CN 107949027 A CN107949027 A CN 107949027A
- Authority
- CN
- China
- Prior art keywords
- node
- energy
- delay
- path
- packet
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of dynamic deferred route selecting methods of the AODV based on Energy-aware, when being chosen in AODV paths, consider two factors of route jumping figure and residue energy of node first, an energy assessment function are defined, optimal path is made decisions and chosen to path；The time delay that intermediate node is grouped according to residue energy of node dynamic adjustment forwarding RREQ, so as to increase the route participation of the higher node of dump energy；Destination node delay record RREQ packet, while use multipath routing policy, according to energy assessment function select optimal main road by with two alternate routings.Test result indicates that this method reduces network node death number to a certain extent, network entirety energy consumption has been saved, has extended network lifetime, network packet delivery ratio and throughput tradition AODV agreements relatively, which have, to be obviously improved.In addition, the number for restarting route finding process can be reduced using multipath routing policy, extra routing cost is effectively reduced.
Description
Technical Field
The invention belongs to the field of wireless communication networks, and particularly relates to an AODV dynamic delay routing method based on energy perception.
Technical Field
Most of nodes in the Ad-hoc wireless network depend on batteries with limited electric quantity to maintain operation, so how to more fully utilize the energy of the batteries to increase the life cycle of the wireless network in the Ad-hoc network as much as possible is a key problem faced at present. In the traditional Ad-hoc routing protocol, the traditional AODV routing protocol is based on the principle of minimum hop count, the node energy is not considered, and for a single network node, the node can be selected for multiple times in the routing process, so that some nodes are frequently used, the node energy consumption is faster than other nodes, the path including the node is failed, and the overall service life of the network is greatly shortened. It can be seen that the scheme with the minimum hop count has a large defect in energy optimization. The invention mainly considers two factors of node residual energy and path hop number, defines an energy evaluation function when making the optimal path selection, when the intermediate node forwards the packet, a delay is carried out according to the node residual energy, the route participation degree of the node with higher residual energy is increased, meanwhile, the destination node sets a delay recording time t, all the request packet caches before the delay overtime are recorded, and multipath routing is adopted, and the optimal three paths are selected according to the energy evaluation function, wherein one path is used as a main path, and the other two paths are used as alternative routes. According to the related research, the best performance can be achieved by selecting three routes. The adoption of the multipath routing can greatly reduce the times of restarting the route discovery process, thereby effectively reducing the extra routing overhead and preventing the excessive waste of node energy. Experimental results show that the improved method reduces the number of dead nodes to a certain extent, reduces the overall energy consumption of the network, prolongs the survival time of the network, and greatly improves the packet bottom-throwing filtering and the network throughput rate compared with the AODV protocol.
Disclosure of Invention
The invention aims to provide an AODV dynamic delay routing method based on energy perception on the basis of analyzing the defect of the existing Ad-hoc network AODV routing protocol in the aspect of energy optimization.
In order to achieve the purpose, the method comprises the following steps:
the first step is as follows:when selecting a path, considering two factors of the residual energy and the path hop count of a node, and defining an energy evaluation function F asmt Replacing the original ADOV routing protocol to take the routing standard according to the hop count as the standard of routing selection; the smaller the hop count of the path is, the more the node residual energy is, the smaller the energy evaluation function is, the more the path is preferentially considered.
The second step is that: setting node working energy threshold E th 20% of the initial energy of the node as a limiting condition for forwarding the route request; and simultaneously, adding a residual energy field of the RREQ grouping node for storing the residual energy of the nodes on the path.
The node receives the RREQ packet and then judges, if the RREQ packet is not the destination node, the RREQ packet needs to be forwarded, and at the moment, the node residual energy E is used rmn And a threshold value E th By comparison, if E rmn >E th Then forwarding is carried out immediately; if E rmn <E th And then discarded.
The third step: after the intermediate node receives the RREQ packet and before the node forwards the packet, the residual energy on the path is updated according to the information of each node on the path, and a time delay T is set for the forwarding packet dly The more the node energy is left, the shorter the time delay is, namely, the nodes with more residual energy participate in the path selection in a limited way, so that the route participation rate of the nodes with less residual energy is reduced;
the fourth step: the destination node does not immediately respond to the received first RREQ packet from the source node any more, a delay recording time t is set, all the RREQ request packet buffers arriving before delay overtime are collected, the destination node collects and quickly feeds evaluation information on a path back to the source node through the RREQ packet, and after the source node receives the RREQ packet, three routes meeting an energy evaluation function are selected, wherein one route is used as a main route, and two routes are used as alternative routes. According to the related research, the best performance can be achieved by selecting three routes. The adoption of the multipath routing can greatly reduce the times of restarting the route discovery process, thereby effectively reducing the extra route overhead and preventing the excessive waste of the node energy.
In the first step, the energy assessment function:
energy evaluation function F asmt The standard defined as the routing selection replaces the routing standard of the original ADOV routing protocol according to the hop count, and the formula is as follows: n is the hop count of the selected path;the residual energy of the node i can be obtained from the residual battery capacity; lambda [ alpha ] 1 、λ 2 The weight values are adjustable parameters, and the proportion of each factor in the path is determined.
The time delay in the third step is defined as:
T dly defining the delay set for forwarding packets according to the current node energy, and defining the RREQ packet delay by adopting a concave function in the method, wherein E init As the initial energy value of the node, E rmn D is the maximum delay value for the current energy value of the node. This means that the higher the remaining energy of the node, the shorter the delay, and vice versa. Studies have shown that the concave function has a very sensitive variation to the delay process.
The invention defines an energy evaluation function when selecting the optimal path, when the intermediate node forwards the packet, a delay is carried out according to the node residual energy, the route participation degree of the node with higher residual energy is increased, simultaneously the target node delay records all the request packet caches, and simultaneously, the multipath route is adopted to select three optimal paths according to the energy evaluation function. Experimental results show that the improved method reduces the number of dead nodes to a certain extent, reduces the overall energy consumption of the network, prolongs the survival time of the network, and greatly improves the packet bottom-throwing filtering and the network throughput rate compared with the AODV protocol.
Drawings
Fig. 1 shows the route establishment process of the present invention.
Fig. 2 is a comparison of the number of surviving nodes at different simulation times.
FIG. 3 is a graph of total energy consumption at different simulation times.
Fig. 4 shows the network lifetime at different mobility rates.
Fig. 5 is packet delivery rate at different mobility rates.
Detailed Description
The specific implementation of the present invention, namely the process of establishing a route, is described in detail with reference to the accompanying drawings:
the first step is as follows: when selecting a path, considering two factors of the residual energy and the path hop count of a node, and defining an energy evaluation function F asmt Replacing the original ADOV routing protocol to take the routing standard according to the hop count as the standard of routing selection; the smaller the hop count of the path is, the more the node residual energy is, the smaller the energy evaluation function is, the more the path is preferentially considered.
The second step is that: setting node working energy threshold value E th 20% of the initial energy of the node as a limiting condition for forwarding the route request; and simultaneously, adding a residual energy field of the RREQ grouping node for storing the residual energy of the nodes on the path. The residual energy value information of the nodes which pass through the RREQ packet at present is newly added in the RREQ packet, and each time each node forwards the RREQ packet, the information is added into the RREQ packet. The improved RREQ packet format is shown in table 1:
table 1 improved RREQ packet format
The node receives the RREQ packet and then judges, if the RREQ packet is not the destination node, the RREQ packet needs to be forwarded, and at the moment, the node residual energy E is used rmn And a threshold value E th By comparison, if E rmn >E th Then forwarding is carried out immediately; if E rmn <E th And then discarded.
The third step: after the intermediate node receives the RREQ packet and before the node forwards the packet, the residual energy on the path is updated according to the information of each node on the path, and a time delay T is set for the forwarding packet dly The more the node energy is left, the shorter the time delay is, namely, the nodes with more residual energy participate in the path selection in a limited way, so that the route participation rate of the nodes with less residual energy is reduced;
the fourth step: the destination node does not immediately respond to the received first RREQ packet from the source node, but starts delay recording, a delay recording time t is set, all the RREQ request packet buffers which arrive before delay overtime are collected, the destination node collects and quickly feeds evaluation information on a path back to the source node through the RREP packet, and after receiving the RREP packet, the source node selects three routes meeting an energy evaluation function, wherein one route is used as a main route, and two routes are used as alternative routes. According to the related research, the best performance can be achieved by selecting three routes. The adoption of the multipath routing can greatly reduce the times of restarting the route discovery process, thereby effectively reducing the extra route overhead and preventing the excessive waste of the node energy.
In the first step, the energy assessment function:
energy evaluation function F asmt The standard defined as the routing selection replaces the routing standard of the original ADOV routing protocol according to the hop count, and the formula is as follows: n is the hop count of the selected path;the residual energy of the node i can be obtained by the residual battery capacity; lambda 1 、λ 2 The weight values are adjustable parameters, and the proportion of each factor in the path is determined. Is here arranged asλ 1 ＝λ 2 =0.5, lambda is verified by multiple times of simulation of different value combinations 1 ＝λ 2 If the value is not less than 0.5, the optimum effect can be obtained in the aspects of network survival time, number of stored joints, total energy consumption and the like.
The time delay in the third step is defined as:
T dly defining as the time delay set for forwarding packet according to the current node energy, and defining RREQ packet time delay by adopting a concave function in the method, wherein E init As the initial energy value of the node, E rmn D is the maximum delay value for the current energy value of the node. This means that the higher the remaining energy of the node, the shorter the delay, and vice versa. Studies have shown that the concave function has a very sensitive variation to the delay process. Considering that the average end-to-end transmission time of a control packet of the traditional AODV protocol in simulation is 30ms, and the delay time can achieve the effect of delay around the end-to-end transmission time of the control packet, the maximum delay time D is defined to be 30ms.
And fourthly, the delay recording time t of the destination node for the RREQ packet is set to be 100ms, and when the delay recording time is set to be 100ms through simulation verification, the optimal path can be found while the optimization of the end-to-end delay is guaranteed.
Table 2 simulation parameters:
fig. 1 shows a specific process for establishing the route according to the present method.
Fig. 2 is a comparison of the number of surviving nodes under different simulation times, and it can be seen that the classical AODV protocol probably has one failing node in about 260s, the first failing node only occurs in about 350s in the method, and after the 600s simulation is finished, the classical AODV algorithm has 9 surviving nodes, the method has 26 surviving nodes, and the surviving nodes of the method are about 15% -20% more than those of the classical AODV.
Fig. 3 is a total energy consumption graph at different simulation times, and because the method selects some nodes with higher energy as much as possible to participate in selecting the route, the energy over consumption of the low-energy nodes is avoided, so that the number of nodes participating in forwarding at the same time is relatively small, that is, the total energy consumption is relatively smaller than that of the classical AODV.
Fig. 4 shows network lifetime at different mobility rates, and since the method adopts the route request forwarding and energy threshold method, the route participation opportunity of low-energy nodes is effectively avoided, the chance of route link breakage is reduced, and the network lifetime is prolonged to a certain extent.
In the packet delivery rate of fig. 5 at different moving rates, since the method preferentially selects the high-energy node to participate in the route, and reduces the route participation rate of the low-energy node, the probability of link breakage is effectively reduced, and the packet delivery rate is further improved.
Claims (3)
1. An AODV dynamic delay routing method based on energy perception is characterized in that:
the first step is as follows: when selecting a path, considering two factors of the residual energy and the path hop count of a node, and defining an energy evaluation function F asmt Replacing the original ADOV routing protocol to take the routing standard according to the hop count as the standard of routing selection; the smaller the hop number of the path is, the more the node residual energy is, the smaller the energy evaluation function is, and the more the path is considered preferentially;
the second step is that: setting node working energy threshold E th 20% of the initial energy of the node as a limiting condition for forwarding the route request; simultaneously, adding a residual energy field of the RREQ grouping node for storing the residual energy of the nodes on the path;
the node receives the RREQ packet and judges, if the RREQ packet is not the destination node, the RREQ packet needs to be forwarded, and at the moment, the residual energy E of the node is determined rmn And a threshold value E th By comparison, if E rmn >E th Then forwarding is carried out immediately; if E rmn <E th If yes, discarding;
the third step: after the intermediate node receives the RREQ packet and before the node forwards the packet, the residual energy on the path is updated according to the information of each node on the path, and a time delay T is set for the forwarding packet dly The more the node energy remains, the shorter the time delay, that is, the nodes with more residual energy participate in the path selection in a limited manner, thereby reducing the route participation rate of the nodes with less residual energy;
the fourth step: the destination node does not immediately respond to the received first RREQ packet from the source node, but starts delay recording, sets a delay recording time t, collects all the RREQ request packet buffers which arrive before delay overtime, collects and quickly feeds back evaluation information on the path to the source node through the RREP packet, and after the source node receives the RREP packet, selects three routes which meet the energy evaluation function, wherein one route is used as a main route and two routes are used as alternative routes; according to the related research, the three routes are selected to achieve the best performance; the adoption of the multipath routing can greatly reduce the times of restarting the route discovery process, thereby effectively reducing the extra route overhead and preventing the excessive waste of the node energy.
2. The method of claim 1, wherein the energy assessment function in the first step is:
energy evaluation function F asmt The standard defined as the routing selection replaces the routing standard of the original ADOV routing protocol according to the hop count, and the formula is as follows: n is the hop count of the selected path; e rmni The residual energy of the node i can be obtained by the residual battery capacity; lambda 1 、λ 2 The weight values are adjustable parameters, and the proportion of each factor in the path is determined.
3. The method as claimed in claim 1, wherein the RREQ packet delay in the third step is defined as:
T dly defining the delay set for forwarding packets according to the current node energy, and defining the RREQ packet delay by adopting a concave function in the method, wherein E init As the initial energy value of the node, E rmn D is the maximum delay value for the current energy value of the node. That means that the higher the residual energy of the node is, the shorter the delay thereof is, and conversely, the larger the delay is; studies have shown that the concave function has a very sensitive variation to the delay process.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711112082.9A CN107949027A (en) | 2017-11-13 | 2017-11-13 | A kind of dynamic deferred route selecting methods of AODV based on Energy-aware |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711112082.9A CN107949027A (en) | 2017-11-13 | 2017-11-13 | A kind of dynamic deferred route selecting methods of AODV based on Energy-aware |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107949027A true CN107949027A (en) | 2018-04-20 |
Family
ID=61933849
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711112082.9A Pending CN107949027A (en) | 2017-11-13 | 2017-11-13 | A kind of dynamic deferred route selecting methods of AODV based on Energy-aware |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107949027A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110121185A (en) * | 2019-06-17 | 2019-08-13 | 广东电网有限责任公司 | A kind of power distribution communication network route optimization method |
| CN110213805A (en) * | 2019-05-20 | 2019-09-06 | 惠州学院 | Wireless ad hoc network routing decision processing method and system |
| CN112423356A (en) * | 2020-10-28 | 2021-02-26 | 大连交通大学 | Unmanned equipment cluster AODV routing method based on energy balance |
| CN115150914A (en) * | 2022-06-23 | 2022-10-04 | 四川大学 | Efficient routing mechanism based on multipath routing |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101742554A (en) * | 2010-01-15 | 2010-06-16 | 南京邮电大学 | Congestion control method of multi-path transmission mechanism of wireless multimedia sensor network |
| CN101980565A (en) * | 2010-09-25 | 2011-02-23 | 重庆邮电大学 | QoS-based Ad Hoc network adaptive node speed multi-path routing method |
| CN102638862A (en) * | 2012-03-05 | 2012-08-15 | 中国人民解放军空军工程大学 | Realization method for large-scale wireless sensor network routing |
| CN104602302A (en) * | 2015-01-23 | 2015-05-06 | 重庆邮电大学 | ZigBee network energy balance routing method based on cluster structure |
-
2017
- 2017-11-13 CN CN201711112082.9A patent/CN107949027A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101742554A (en) * | 2010-01-15 | 2010-06-16 | 南京邮电大学 | Congestion control method of multi-path transmission mechanism of wireless multimedia sensor network |
| CN101980565A (en) * | 2010-09-25 | 2011-02-23 | 重庆邮电大学 | QoS-based Ad Hoc network adaptive node speed multi-path routing method |
| CN102638862A (en) * | 2012-03-05 | 2012-08-15 | 中国人民解放军空军工程大学 | Realization method for large-scale wireless sensor network routing |
| CN104602302A (en) * | 2015-01-23 | 2015-05-06 | 重庆邮电大学 | ZigBee network energy balance routing method based on cluster structure |
Non-Patent Citations (4)
| Title |
|---|
| 李旭等: "一种改进的移动自组织网多路径路由协议", 《兵工学报》 * |
| 王敏强等: "一种新的应用于Ad Hoc网络的能量感知路由协议", 《南京邮电学院学报》 * |
| 郭彦芳: "Ad Hoc 网络中 AODV 路由协议的研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 郭彦芳: "一种改进的就能量优化的AODV路由协议", 《通信系统与网络技术》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110213805A (en) * | 2019-05-20 | 2019-09-06 | 惠州学院 | Wireless ad hoc network routing decision processing method and system |
| CN110213805B (en) * | 2019-05-20 | 2021-02-02 | 惠州学院 | Wireless ad hoc network routing decision processing method and system |
| CN110121185A (en) * | 2019-06-17 | 2019-08-13 | 广东电网有限责任公司 | A kind of power distribution communication network route optimization method |
| CN110121185B (en) * | 2019-06-17 | 2020-12-08 | 广东电网有限责任公司 | Power distribution communication network route optimization method |
| CN112423356A (en) * | 2020-10-28 | 2021-02-26 | 大连交通大学 | Unmanned equipment cluster AODV routing method based on energy balance |
| CN112423356B (en) * | 2020-10-28 | 2022-10-18 | 大连交通大学 | Unmanned equipment cluster AODV routing method based on energy balance |
| CN115150914A (en) * | 2022-06-23 | 2022-10-04 | 四川大学 | Efficient routing mechanism based on multipath routing |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107949027A (en) | A kind of dynamic deferred route selecting methods of AODV based on Energy-aware | |
| CN107360612B (en) | A kind of data transmission method of the wireless sensor network based on ant colony multipath | |
| US8665890B2 (en) | Hybrid cross-layer routing protocol for MANETs | |
| TW200412805A (en) | Multiple path reactive routing in a mobile ad hoc network | |
| Persis et al. | Ant based multi-objective routing optimization in mobile ad-hoc network | |
| CN108449271A (en) | A kind of method for routing of monitoring path node energy and queue length | |
| CN108770003A (en) | A kind of self-organizing unmanned plane network routing discovering method based on particle group optimizing | |
| Mittal et al. | Performance analysis of AODV, OLSR, GRP and DSR routing protocols with database load in MANET | |
| Raju et al. | ZRP versus aodv and dsr: A comprehensive study on zrp performance on manets | |
| Jane et al. | Performance of efficient CBRP in mobile ad hoc networks (MANETS) | |
| Bitam et al. | QoSBeeManet: A new QoS multipath routing protocol for mobile ad-hoc networks | |
| Lutimath et al. | Energy aware multipath AODV routing protocol for mobile ad hoc network | |
| Savitha et al. | An energy aware enhanced AODV routing protocol in MANET | |
| KR101460879B1 (en) | Method and apparatus for message route in ad-hoc network | |
| Sivasankar et al. | Performance evaluation of energy efficient routing protocols for MANET | |
| Azad et al. | Performance comparison of proactive and reactive multicast routing protocols over wireless mesh networks | |
| Srinivasan et al. | Stability and energy aware multipath routing for mobile ad hoc networks | |
| SreeRangaRaju et al. | Optimized ZRP for MANETs and its Applications | |
| Zhou | Survey of ant colony routing protocols for mobile ad hoc networks | |
| Kumar et al. | An energy and traffic aware routing approach as an extension of aodv | |
| Tonk et al. | Performance comparison of ad-hoc network routing protocols using NS-2 | |
| Ilyas et al. | A survey on the fundamental and advanced mobile ad hoc network routing protocols | |
| Bisen et al. | Effect of pause time on DSR, AODV and DYMO routing protocols in MANET | |
| Goyal et al. | AntSens: an ant routing protocol for large scale wireless sensor networks | |
| KR101693395B1 (en) | Multipath routing method for quality of service guarantee in wireless multimedia sensor networks |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180420 |
|
| RJ01 | Rejection of invention patent application after publication |