CN103582007A - Routing method and device for sensor network, sensor node and network - Google Patents
Routing method and device for sensor network, sensor node and network Download PDFInfo
- Publication number
- CN103582007A CN103582007A CN201310611330.XA CN201310611330A CN103582007A CN 103582007 A CN103582007 A CN 103582007A CN 201310611330 A CN201310611330 A CN 201310611330A CN 103582007 A CN103582007 A CN 103582007A
- Authority
- CN
- China
- Prior art keywords
- node
- etx
- routed path
- father node
- father
- 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
Images
Classifications
-
- 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
- Mobile Radio Communication Systems (AREA)
Abstract
The embodiment of the invention discloses a routing method and a device of a sensor network, a sensor node and a network. The method comprises the following steps: step 1, selecting an optimum routing path to an aggregation node according to a minimum weight algorithm, performing data transmission through the optimum routing path, wherein the optimum routing path is the ETX (End-of-Text) minimum path; step 2, updating the ETX of the optimum routing path in unit time for every preset period; step 3, if in the preset period with preset quantity, the ETX of the optimum routing path presents progressive increase trend, updating a father node, carrying out data transmission through the updated father node, and executing the step 2. The father node is updated through accumulated link quality, therefore update of the minimum routing path is implemented, network congestion is reduced, network load is balanced, and service life of the sensor network is prolonged.
Description
Technical field
The present invention relates to radio network technique, relate in particular to a kind of method for routing, device and sensor node and network of sensor network.
Background technology
At present, the wireless sensor network (Wireless Sensor Network, WSN) of low cost, low-power consumption and easily deployment has been widely used in the middle of the application such as real time environment monitoring.Conventionally, a large amount of wireless sensor nodes are deployed in the middle of indoor and outdoor surroundings, according to application demand, regularly gather environmental data (as humiture, illumination, gas etc.), all wireless sensor nodes send to convergence node (Sink node) by the form of Ad hoc by the data that collect, and Sink node is connected with server.Therefore but for wireless sensor network, its node is conventionally battery-powered, how to allow network node efficient operation the prolong network lifetime be one of main bugbear of facing of wireless sensor network.
In wireless sensor network, the height of node efficiency carries out that energy that a specific task consumes weighs often by sensor node, wherein receives packet, sends the tasks such as packet and taken most node energy consumption.Therefore, how to design effective data acquisition Routing Protocol, reduce data packet retransmission number of times and become the important means of saving network energy consumption.In prior art, the data acquisition Routing Protocol comparatively generally using is to converge tree protocol (Collection Tree Protocol, CTP) by people's designs such as Philips Levis.The groundwork principle of CTP agreement is based on allowing the node of disposing in network by calculating the own route that the expected transmission times of aggregation node (Expected Transmission Count, ETX) is decided to packet.That is: after network design, except the acquiescence ETX of aggregation node is 0, the default value of the ETX of other all nodes is positive infinity.The all wireless sensor nodes that comprise aggregation node all the ETX value of periodic broadcasting oneself to oneself neighbor node.The ETX value of aggregation node is 0, and except aggregation node, other all nodes calculate the ETX value (supposing that nodename is A) of oneself in the following manner:
1) node A calculates oneself to the ETX value of each neighbor node (being assumed to be Node B), i.e. the ETX value of link (or being called limit) AB, and namely node A is every successfully transmits a packet to the needed expected transmission times of Node B;
2), after the ETX value of the link between all nodes has been calculated, all nodes are selected the own path with minimum ETX to aggregation node by minimal weight algorithm, as the routed path of oneself.Wherein, the ETX value of a paths equals the ETX sum on all limits on this path.For example: if node A is node A-> Node B-> node C-> node D-> node S to the path of aggregation node (being assumed to be S), the ETX value in the path from node A to aggregation node S equals the ETX value of limit AB so, the ETX value that adds top BC, the ETX value that adds top CD, adds the ETX value of top DS.After finding the have minimal weight path of (being ETX), this path is the data routing paths from node A transmission packet to aggregation node, and the packets need of node A could finally arrive aggregation node by the forwarding of Node B, C, tri-nodes of D.
Yet the data routing method based on CTP method, due to the unsteadiness of wireless link, has time delay large, can not effectively avoid network congestion, thereby cause the loss of packet, the problem of waste Internet resources.
Summary of the invention
In view of this, the embodiment of the present invention provides a kind of method for routing, device and sensor node and network of sensor network, to reduce network congestion.
First aspect, the embodiment of the present invention provides a kind of method for routing of sensor network, and described method comprises:
Step 2, every through a predetermined period, the ETX of described best routed path in the renewal unit interval;
Step 3, if in the predetermined period of default number, the ETX of described best routed path presents and increases progressively trend, upgrades father node, by the father node after upgrading, carries out the transmission of data, performs step 2.
Further, described according to minimal weight algorithm, select best routed path before, also comprise:
In the unit of account time, arrive the ETX of every paths of aggregation node.
Further, described renewal father node comprises:
The request of changing father node is sent to all neighbor nodes;
Receive the average ETX that each neighbor node is sent, the average ETX that each neighbor node is sent is that respective neighbours node is included the node that sends the request of changing father node in the existing bunch of average ETX of whole bunch afterwards, wherein, the described existing bunch of all child nodes that comprise respective neighbours node and respective neighbours node, bunch average ETX be the mean value of the ETX of the link that forms of each child nodes of respective neighbours node and respective neighbours node;
Selection has the neighbor node of minimum average B configuration ETX as new father node, and changes father node information.
Second aspect, the embodiment of the present invention also provides a kind of route device of sensor network, and described device comprises:
Select module, for choose the best routed path of aggregation node according to minimal weight algorithm, by described best routed path, carry out the transmission of data, wherein, described best routed path is the path of expected transmission times ETX minimum;
ETX update module, through a predetermined period, upgrades the ETX of described best routed path in the unit interval for every;
Father node update module, if in the predetermined period in default number, the ETX of described best routed path presents and increases progressively trend, upgrades father node, by the father node after upgrading, carries out the transmission of data, triggers ETX update module.
Further, described device also comprises:
Computing module, arrives the ETX of every paths of aggregation node in the time for unit of account.
Further, described father node update module comprises:
Send submodule, for the request of changing father node is sent to all neighbor nodes;
Receive submodule, for receiving the average ETX that each neighbor node is sent, the average ETX that each neighbor node is sent is that respective neighbours node is included the node that sends the request of changing father node in the existing bunch of average ETX of whole bunch afterwards, wherein, the described existing bunch of all child nodes that comprise respective neighbours node and respective neighbours node, bunch average ETX be the mean value of the ETX of the link that forms of each child nodes of respective neighbours node and respective neighbours node;
Chooser module, for selecting the neighbor node with minimum average B configuration ETX as new father node, and changes father node information.
The third aspect, the embodiment of the present invention also provides a kind of sensor node, and described sensor node comprises the route device of described sensor network.
Fourth aspect, the embodiment of the present invention also provides a kind of sensor network, and described sensor network comprises described sensor node.
The method for routing of the sensor network that the embodiment of the present invention provides, device and sensor node and network are by accumulation link-quality, carry out the renewal of father node, thereby upgrade best routed path, reduced network congestion, balance offered load, reduced the re-transmission energy consumption of node, balanced internodal energy consumption, effectively realize energy-conservationly, effectively extend life-span of sensor network.
Accompanying drawing explanation
Fig. 1 is the flow chart of the method for routing of the sensor network that provides of first embodiment of the invention;
Fig. 2 is the schematic diagram of the renewal father node in the method for routing of the sensor network that provides of first embodiment of the invention;
Fig. 3 is the schematic diagram of the route device of the sensor network that provides of second embodiment of the invention.
Embodiment
Below in conjunction with drawings and Examples, the present invention is described in further detail.Be understandable that, specific embodiment described herein is only for explaining the present invention, but not limitation of the invention.It also should be noted that, for convenience of description, in accompanying drawing, only show part related to the present invention but not full content.
The first embodiment
Fig. 1 is the realization flow figure of the method for routing of the sensor network that provides of first embodiment of the invention, and details are as follows for the method:
In step 101, according to minimal weight algorithm, choose the best routed path of aggregation node, by described best routed path, carry out the transmission of data.
Need forwarding data according to minimal weight algorithm, to select best routed path to the sensor node of aggregation node, by described best routed path, carry out the transmission of data, wherein, described best routed path is the path of ETX minimum.Wherein, described minimal weight represents minimum transfer number of times; Described ETX is expected transmission times (Expected Transmission Count), for weighing the transmission energy consumption between sensor node, article one, the ETX of link successfully transmits a packet to the estimation of the required the number of transmissions of aggregation node, the number of transmissions taking comprising re-transmission to every on this link.
Exemplary, described according to minimal weight algorithm, select best routed path before, also comprise:
In the unit of account time, arrive the ETX of every paths of aggregation node.
Need forwarding data in the sensor node unit of account time of aggregation node self to the ETX value of every link on the path of aggregation node, ETX value by self to every link on the path of aggregation node, accumulation is added and obtains self to the ETX in the path of aggregation node.
In step 102, every through a predetermined period, the ETX of described best routed path in the renewal unit interval.
Every through a predetermined period, need forwarding data in the renewal unit interval, self to arrive the ETX of the described best routed path of aggregation node to the sensor node of aggregation node.In the process of data acquisition, after m the packet of the every transmission of all nodes except aggregation node, the ETX in the used path to aggregation node that upgrades in time, whole operation is called one-period.Wherein m can be determined by the operation conditions of network, and for example m can be 10.
In step 103, if in the predetermined period of default number, the ETX of described best routed path presents and increases progressively trend, upgrades father node, by the father node after upgrading, carries out the transmission of data, performs step 102.
For example, if in the predetermined period of default number (3 predetermined period), need forwarding data to find that to the sensor node of aggregation node oneself presents and increase progressively trend to the ETX of the described best routed path of aggregation node, may there is congestion condition in this paths of differentiating in network, upgrade father node, by the father node after upgrading, carry out the transmission of data, father node after renewal has the best routed path of oneself, thereby upgraded, need forwarding data to the best routed path of the sensor node of aggregation node, by the best routed path after upgrading, carry out the transmission of data, continue execution step 102.Wherein, father node be in sensor network sensor node to the nearest node of range sensor node on the best routed path of aggregation node, the Packet Generation that sensor node gathers oneself is given the father node of oneself, after father node is received this packet, be transmitted to again the father node of father node oneself, by that analogy, until packet arrives aggregation node.
Exemplary, described renewal father node comprises following sub-step:
Sub-step 1031, sends to all neighbor nodes by the request of changing father node.Need forwarding data, to the sensor node of aggregation node, the request that oneself will change father node is sent to all neighbor nodes.
Sub-step 1032, receive the average ETX that each neighbor node is sent, the average ETX that each neighbor node is sent is that respective neighbours node is included the node that sends the request of changing father node in the existing bunch of average ETX of whole bunch afterwards, wherein, the described existing bunch of all child nodes that comprise respective neighbours node and respective neighbours node, bunch average ETX be the mean value of the ETX of the link that forms of each child nodes of respective neighbours node and respective neighbours node.
Need forwarding data to receive to the sensor node of aggregation node the average ETX that each neighbor node is sent, described average ETX is that neighbor node is included the node that sends the request of changing father node in the existing bunch of average ETX of whole bunch afterwards, wherein, the described existing bunch of all child nodes that comprise respective neighbours node and respective neighbours node, bunch average ETX be the mean value of the ETX of the link that forms of each child nodes of respective neighbours node and respective neighbours node.Wherein, in sensor network, need sensor node to carry out the child nodes that the node of data retransmission is this sensor node.Each neighbor node and its all child nodes that have are one bunch, all neighbor nodes are received after the request that needs the replacing father node that forwarding data sends to the sensor node of aggregation node, quantity based on existing data traffic with the child nodes oneself having had, calculating need forwarding data also to include in after existing bunch to the sensor node of aggregation node the node sending request, the average ETX of whole bunch, and the average ETX calculating is sent to and needs forwarding data to the sensor node of aggregation node.
Sub-step 1033, selects the neighbor node with minimum average B configuration ETX as new father node, and changes father node information.
Need forwarding data collecting after all neighbor nodes beam back the average ETX that comes to the sensor node of aggregation node, select in all neighbor nodes, there is the neighbor node of minimum average ETX as own new father node, by the own Packet Generation collecting afterwards, give new father node, by new father node, helped oneself to complete the forwarding of data, and the father node information of change oneself, the father node that is about to own storage changes to new father node, oneself completes data retransmission before once changing father node upper by new father node help later.
Fig. 2 is the schematic diagram of the renewal father node in the method for routing of the sensor network that provides of first embodiment of the invention.As shown in Figure 2, node N1, N2 ..., Ni ..., current parent's node of Nm-1 is Nm, nodes X 1 ..., the father node of Xn is Xi, node Ni and nodes X i be neighbor node each other.Suppose that node Ni finds in the predetermined period of default number, find that ETX presents continuous ascendant trend, node Ni starts following father node update mechanism so:
Node Ni sends to all neighbor nodes by the demand that oneself will change father node.
Each neighbor node and its child nodes having are one bunch, as shown in Figure 2, and node N
mand m-1 child nodes { N
1, N
2..., N
i..., N
m-1form one bunch, node Y and n thereof child nodes { X
1..., X
nform one bunch.Node Y is after receiving that node Ni changes the demand of father node, by node N
isee the child nodes being Myself temporarily, then calculate new child nodes set, i.e. { N
i, X
1..., X
naverage ETX to oneself, then the average ETX calculating is sent back to node N
i.Suppose N
mn
ifor node N
mwith node N
ibetween link, E (N
mn
i) expression node N
isend packet to node N
mrequired expected transmission times, i.e. node N
ito node N
mbetween the ETX value of link, A (N
m) representative bunch interior nodes is average often successfully sends a packet to node N
mexpected transmission times, wherein, 1≤i≤m-1, i ∈ N, N is natural number set,
Node N
iafter receiving the return value of all neighbor nodes, select the node that is transferred to own minimum average ETX as own new father node, complete the conversion of father node.
The present embodiment is by choosing the best routed path of aggregation node according to minimal weight algorithm, every through a predetermined period, upgrade the ETX of described best routed path in the unit interval, if in the predetermined period of default number, the ETX of described best routed path presents and increases progressively trend, upgrade father node, thereby upgrade best routed path, reduced network congestion, balance offered load, reduced the re-transmission energy consumption of node, balanced internodal energy consumption, effectively realize energy-conservationly, effectively extend life-span of sensor network.
The second embodiment
Fig. 3 is the schematic diagram of the route device of the sensor network that provides of second embodiment of the invention.The route device of the sensor network described in the present embodiment is for realizing the method for routing of the sensor network described in the first embodiment.As shown in Figure 3, the route device of the sensor network described in the present embodiment comprises: select module 301, ETX update module 302 and father node update module 303, described device also comprises computing module 304.
Wherein, select module 301 for choose the best routed path of aggregation node according to minimal weight algorithm, by described best routed path, carry out the transmission of data, wherein, described best routed path is the path of expected transmission times ETX minimum.Described selection module 301, for realizing the step 101 of the method for routing of the sensor network described in the first embodiment, repeats no more here.
If father node update module 303 is in the predetermined period in default number, the ETX of described best routed path presents and increases progressively trend, upgrades father node, by the father node after upgrading, carries out the transmission of data, triggers ETX update module.Described father node update module 303, for realizing the step 103 of the method for routing of the sensor network described in the first embodiment, repeats no more here.
Exemplary, described father node update module comprises:
Send submodule, for the request of changing father node is sent to all neighbor nodes;
Receive submodule, for receiving the average ETX that each neighbor node is sent, the average ETX that each neighbor node is sent is that respective neighbours node is included the node that sends the request of changing father node in the existing bunch of average ETX of whole bunch afterwards, wherein, the described existing bunch of all child nodes that comprise respective neighbours node and respective neighbours node, bunch average ETX be the mean value of the ETX of the link that forms of each child nodes of respective neighbours node and respective neighbours node;
Chooser module, for selecting the neighbor node with minimum average B configuration ETX as new father node, and changes father node information.
The present embodiment is by selecting module to choose the best routed path of aggregation node according to minimal weight algorithm, every through a predetermined period, ETX update module is upgraded the ETX of described best routed path in the unit interval, if in the predetermined period of default number, the ETX of described best routed path presents and increases progressively trend, father node update module is upgraded father node, realize the renewal of best routed path, reduced network congestion, balance offered load, reduced the re-transmission energy consumption of node, balanced internodal energy consumption, effectively realize energy-conservation, effectively extend the life-span of sensor network.
The 3rd embodiment
The 3rd embodiment provides a kind of sensor node, and the sensor node described in the present embodiment comprises the route device of the sensor network described in the second embodiment, and the route device of described sensor network comprises:
Select module, for choose the best routed path of aggregation node according to minimal weight algorithm, by described best routed path, carry out the transmission of data, wherein, described best routed path is the path of expected transmission times ETX minimum;
ETX update module, through a predetermined period, upgrades the ETX of described best routed path in the unit interval for every;
Father node update module, if in the predetermined period in default number, the ETX of described best routed path presents and increases progressively trend, upgrades father node, by the father node after upgrading, carries out the transmission of data, triggers ETX update module.
Sensor node described in the present embodiment is realized the renewal of best routed path by the route device of sensor network, reduced network congestion, balance offered load, reduced the re-transmission energy consumption of node, balanced internodal energy consumption, effectively realize energy-conservationly, effectively extend life-span of sensor network.
The 4th embodiment
The 4th embodiment provides a kind of sensor network, sensor network described in the present embodiment comprises the sensor node described in the second embodiment, described sensor network also comprises other nodes, the neighbor node of described sensor node for example, wherein, described sensor node comprises the route device of sensor network, and the route device of described sensor network comprises:
Select module, for choose the best routed path of aggregation node according to minimal weight algorithm, by described best routed path, carry out the transmission of data, wherein, described best routed path is the path of expected transmission times ETX minimum;
ETX update module, through a predetermined period, upgrades the ETX of described best routed path in the unit interval for every;
Father node update module, if in the predetermined period in default number, the ETX of described best routed path presents and increases progressively trend, upgrades father node, by the father node after upgrading, carries out the transmission of data, triggers ETX update module.
Sensor network described in the present embodiment utilizes the transmission ETX of routed path of the route device periodic monitoring oneself of sensor network by having the sensor node of the route device of sensor network, and ETX value presents and increases progressively trend in the predetermined period of continuous default number, upgrade the father node of oneself, thereby renewal routed path, reduced network congestion, balance offered load, reduced the re-transmission energy consumption of node, balanced internodal energy consumption, effectively realize energy-conservationly, effectively extend life-span of sensor network.
Note, above are only preferred embodiment of the present invention and institute's application technology principle.Skilled person in the art will appreciate that and the invention is not restricted to specific embodiment described here, can carry out for a person skilled in the art various obvious variations, readjust and substitute and can not depart from protection scope of the present invention.Therefore, although the present invention is described in further detail by above embodiment, the present invention is not limited only to above embodiment, in the situation that not departing from the present invention's design, can also comprise more other equivalent embodiment, and scope of the present invention is determined by appended claim scope.
Claims (8)
1. a method for routing for sensor network, is characterized in that, described method comprises:
Step 1, chooses the best routed path of aggregation node according to minimal weight algorithm, by described best routed path, carry out the transmission of data, and wherein, described best routed path is the path of expected transmission times ETX minimum;
Step 2, every through a predetermined period, the ETX of described best routed path in the renewal unit interval;
Step 3, if in the predetermined period of default number, the ETX of described best routed path presents and increases progressively trend, upgrades father node, by the father node after upgrading, carries out the transmission of data, performs step 2.
2. method according to claim 1, is characterized in that, described according to minimal weight algorithm, select best routed path before, also comprise:
In the unit of account time, arrive the ETX of every paths of aggregation node.
3. method according to claim 1 and 2, is characterized in that, described renewal father node comprises:
The request of changing father node is sent to all neighbor nodes;
Receive the average ETX that each neighbor node is sent, the average ETX that each neighbor node is sent is that respective neighbours node is included the node that sends the request of changing father node in the existing bunch of average ETX of whole bunch afterwards, wherein, the described existing bunch of all child nodes that comprise respective neighbours node and respective neighbours node, bunch average ETX be the mean value of the ETX of the link that forms of each child nodes of respective neighbours node and respective neighbours node;
Selection has the neighbor node of minimum average B configuration ETX as new father node, and changes father node information.
4. a route device for sensor network, is characterized in that, described device comprises:
Select module, for choose the best routed path of aggregation node according to minimal weight algorithm, by described best routed path, carry out the transmission of data, wherein, described best routed path is the path of expected transmission times ETX minimum;
ETX update module, through a predetermined period, upgrades the ETX of described best routed path in the unit interval for every;
Father node update module, if in the predetermined period in default number, the ETX of described best routed path presents and increases progressively trend, upgrades father node, by the father node after upgrading, carries out the transmission of data, triggers ETX update module.
5. device according to claim 4, is characterized in that, described device also comprises:
Computing module, arrives the ETX of every paths of aggregation node in the time for unit of account.
6. according to the device described in claim 4 or 5, it is characterized in that, described father node update module comprises:
Send submodule, for the request of changing father node is sent to all neighbor nodes;
Receive submodule, for receiving the average ETX that each neighbor node is sent, the average ETX that each neighbor node is sent is that respective neighbours node is included the node that sends the request of changing father node in the existing bunch of average ETX of whole bunch afterwards, wherein, the described existing bunch of all child nodes that comprise respective neighbours node and respective neighbours node, bunch average ETX be the mean value of the ETX of the link that forms of each child nodes of respective neighbours node and respective neighbours node;
Chooser module, for selecting the neighbor node with minimum average B configuration ETX as new father node, and changes father node information.
7. a sensor node, is characterized in that, described sensor node comprises the route device of the sensor network described in any one in claim 4-6.
8. a sensor network, is characterized in that, described sensor network comprises sensor node claimed in claim 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310611330.XA CN103582007A (en) | 2013-11-26 | 2013-11-26 | Routing method and device for sensor network, sensor node and network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310611330.XA CN103582007A (en) | 2013-11-26 | 2013-11-26 | Routing method and device for sensor network, sensor node and network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103582007A true CN103582007A (en) | 2014-02-12 |
Family
ID=50052706
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310611330.XA Pending CN103582007A (en) | 2013-11-26 | 2013-11-26 | Routing method and device for sensor network, sensor node and network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103582007A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103889065A (en) * | 2014-02-28 | 2014-06-25 | 中国农业大学 | Wireless body area network data transmission scheduling method and device |
| CN104301966A (en) * | 2014-10-17 | 2015-01-21 | 中国科学院上海微系统与信息技术研究所 | Semi-structured transmission dispatching method orienting wireless sensor network data collection |
| CN104519544A (en) * | 2014-12-29 | 2015-04-15 | 无锡清华信息科学与技术国家实验室物联网技术中心 | Method and device for planning routing in wireless sensor network |
| CN107408334A (en) * | 2015-03-13 | 2017-11-28 | 富士通株式会社 | Control device, control program and sensor node |
| CN107872390A (en) * | 2016-09-28 | 2018-04-03 | 华为数字技术（苏州）有限公司 | A kind of route selection method and message forwarding equipment |
| CN112367643A (en) * | 2020-10-30 | 2021-02-12 | 珠海市深瑞智联科技有限公司 | Wireless sensor connection and remote upgrading method and monitoring system thereof |
| CN112533263A (en) * | 2020-11-25 | 2021-03-19 | 广州技象科技有限公司 | Sensor network path optimization method, device, equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090232014A1 (en) * | 2006-03-30 | 2009-09-17 | Matthias Kutschenreuter | Method for Determining a Route Distance Value |
| CN101765143A (en) * | 2010-03-17 | 2010-06-30 | 华中科技大学 | Routing metric method for opportunistic routing in wireless mesh network |
| CN102448140A (en) * | 2011-12-22 | 2012-05-09 | 无锡儒安科技有限公司 | Route selection method based on wireless sensor network path forwarding quality |
-
2013
- 2013-11-26 CN CN201310611330.XA patent/CN103582007A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090232014A1 (en) * | 2006-03-30 | 2009-09-17 | Matthias Kutschenreuter | Method for Determining a Route Distance Value |
| CN101765143A (en) * | 2010-03-17 | 2010-06-30 | 华中科技大学 | Routing metric method for opportunistic routing in wireless mesh network |
| CN102448140A (en) * | 2011-12-22 | 2012-05-09 | 无锡儒安科技有限公司 | Route selection method based on wireless sensor network path forwarding quality |
Non-Patent Citations (1)
| Title |
|---|
| 刘昌阳: "《北京交通大学硕士学位论文，基于TDMA的工业无线传感器网络中收集树协议的评估和改进研究》", 31 December 2012 * |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103889065A (en) * | 2014-02-28 | 2014-06-25 | 中国农业大学 | Wireless body area network data transmission scheduling method and device |
| CN104301966A (en) * | 2014-10-17 | 2015-01-21 | 中国科学院上海微系统与信息技术研究所 | Semi-structured transmission dispatching method orienting wireless sensor network data collection |
| CN104301966B (en) * | 2014-10-17 | 2018-01-05 | 中国科学院上海微系统与信息技术研究所 | The semi-structured transmission dispatching method of Wireless Sensor Networks Data Collection |
| CN104519544A (en) * | 2014-12-29 | 2015-04-15 | 无锡清华信息科学与技术国家实验室物联网技术中心 | Method and device for planning routing in wireless sensor network |
| CN104519544B (en) * | 2014-12-29 | 2017-12-12 | 无锡清华信息科学与技术国家实验室物联网技术中心 | A kind of method and device that route is planned in wireless sensor network |
| CN107408334A (en) * | 2015-03-13 | 2017-11-28 | 富士通株式会社 | Control device, control program and sensor node |
| CN107872390A (en) * | 2016-09-28 | 2018-04-03 | 华为数字技术（苏州）有限公司 | A kind of route selection method and message forwarding equipment |
| CN112367643A (en) * | 2020-10-30 | 2021-02-12 | 珠海市深瑞智联科技有限公司 | Wireless sensor connection and remote upgrading method and monitoring system thereof |
| CN112367643B (en) * | 2020-10-30 | 2021-06-22 | 珠海市深瑞智联科技有限公司 | Wireless sensor connection and remote upgrading method and monitoring system thereof |
| CN112533263A (en) * | 2020-11-25 | 2021-03-19 | 广州技象科技有限公司 | Sensor network path optimization method, device, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103582007A (en) | Routing method and device for sensor network, sensor node and network | |
| Anisi et al. | Energy harvesting and battery power based routing in wireless sensor networks | |
| US9647942B2 (en) | Content centric and load-balancing aware dynamic data aggregation | |
| US8750100B2 (en) | Avoiding broken links in smart meter networks for loop-free routing of packets | |
| Villaverde et al. | InRout–A QoS aware route selection algorithm for industrial wireless sensor networks | |
| Förster et al. | Froms: A failure tolerant and mobility enabled multicast routing paradigm with reinforcement learning for WSNs | |
| CN1561509A (en) | Energy aware network management | |
| Amiri et al. | DABPR: A large-scale internet of things-based data aggregation back pressure routing for disaster management | |
| CN103999510A (en) | Assisted intelligent routing for minimalistic connected object networks | |
| CN103338495B (en) | Two-way energy balance wireless sensing network route method based on LEPS | |
| CN104038991A (en) | Long-distance line type wireless sensor network cross-layer communication method | |
| Wu et al. | Wireless powered mobile edge computing for industrial internet of things systems | |
| Gupta et al. | Energy aware data collection in wireless sensor network using chain based PEGASIS | |
| CN103532845B (en) | Method for routing for intermittent connection wireless sensor network | |
| CN101873663A (en) | Multi-path routing algorithm based on energy sensing reliability | |
| Lemercier et al. | Communication architectures and technologies for advanced smart grid services | |
| Chaudhary et al. | Review paper on energy-efficient protocols in wireless sensor networks | |
| Lin et al. | Maximum data collection rate routing for data gather trees with data aggregation in rechargeable wireless sensor networks | |
| Singh et al. | A review on Internet of Multimedia Things (IoMT) routing protocols and quality of service | |
| Guerriero et al. | A biobjective optimization model for routing in mobile ad hoc networks | |
| Shakshuki et al. | Software agent-based directed diffusion in wireless sensor network | |
| Srinidhi et al. | Hybrid energy efficient and QoS aware algorithm to prolong IoT network lifetime | |
| Izadi et al. | Quality control of sensor network data | |
| Anand et al. | Analyzing the performance of diverse leach algorithms for wireless sensor networks | |
| Rani et al. | Enhancing QoS in Wireless Sensor Networks Using Dynamic Energy-Efficient Multimode Transmission with the Network Adaptive Multimode Transmission LEACH Protocol |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20140212 |