CN100461763C - Radio senser network up and down isomeric routing method - Google Patents
Radio senser network up and down isomeric routing method Download PDFInfo
- Publication number
- CN100461763C CN100461763C CNB2006100861400A CN200610086140A CN100461763C CN 100461763 C CN100461763 C CN 100461763C CN B2006100861400 A CNB2006100861400 A CN B2006100861400A CN 200610086140 A CN200610086140 A CN 200610086140A CN 100461763 C CN100461763 C CN 100461763C
- Authority
- CN
- China
- Prior art keywords
- route
- node
- descending
- routing
- change
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
A routing method of radio transducer network with heaterostructure in uplink and downlink includes sending uplink route request URREQ using gathering node as object by transducer node to set up uplink route, selecting node with minimum skit as father node to form path of uplink route after route reply URREP is received, setting up downlink route by utilizing broadcast mode and using path with direction opposite to uplink route as path of downlink route. In the method, different means is applied to set up path of uplink route and path of downlink route.
Description
Technical field
The present invention relates to wireless sensor network, the method for routing of a kind of radio senser network up and down isomeric of more specifically saying so.
Background technology
Wireless sensor network is by having the intensive intelligent autonomous measurement and control network system that is laid in unattended guarded region and constitutes of communication and the small sensor node of computing capability in a large number, can independently finishing appointed task according to environment.The collection of perception information is one of main task of wireless sensor network, and the pattern of acquisition of information mainly contains time driving, event-driven, inquiry etc., can find when analyzing its information flow, and topmost have two category informations to transmit.One class is to be transmitted by the information of sensor node to aggregation node, is generally perception information; Another kind of is to be transmitted by the information of aggregation node to sensor node, is generally control information.
To be called up transmission to the transmission of aggregation node by sensor node, the route of process be called up route; Aggregation node is called descending transmission to the transmission of sensor node, the route of process be called descending route.
As a data collection network, the data volume maximum of up transmission, the target of the up route of each node is all aggregation node.Therefore, tackle up method for routing foundation key design and optimization, make that it is most effective, performance is best.
The target of descending route is very many, but the routing table size is subjected to the restriction of node machine hardware.Therefore, descending route is mainly considered the possibility, the reliability that realize, and how research reduces network overhead.
But the method for routing of the wireless sensor network that is applied to is not generally distinguished up route and descending route at present, adopts same strategy, and this makes the up router efficiency of data volume maximum reduce, and network overhead and time delay increase.
Summary of the invention
The objective of the invention is to overcome above-mentioned the deficiencies in the prior art, a kind of method for routing of wireless sensor network up-downgoing isomery is proposed, when each sensor node is set up route in described network, up route and descending route promptly according to data source address, up, the downlink data transmission of destination address difference, transmit the different method for routing of employing to up, downlink data in different ways.The wireless sensor network of being set up is the network topology of tree type, and each node has only also must a father node.
According to above-mentioned design, the basic ideas of its up route are:
1) each node all attempts to set up the up route of oneself.When new adding of node or route inefficacy, need set up up route, when the route life cycle finishes, upgrade up route.
2) node of the up route of a need foundation (or renewal) is sent out the route requests that target is an aggregation node, set up up route and the jumping figure neighbor node littler and sent out routing reply than this node, not setting up neighbor node that up route or jumping figure be not less than this node does not send out routing reply and does not transmit route requests yet, if can not receive routing reply after the node of the up route of a need foundation (or renewal) is sent out the route requests that target is an aggregation node, then jumping figure changed into maximum back and retransmit route requests.
3) select the node of jumping figure minimum as route (father node).
4) life cycle is the random number between the Tmin to Tmax.
Carry out step by step when 5) communicating by letter and confirm.
The technical step of being set up up route by above-mentioned thinking is:
This node of S1-1 sends out route requests URREQ up;
S1-2 waits for up routing reply URREP;
Whether S1-3 receives up routing reply URREP within a certain period of time, if receive, changes S1-4; Otherwise change S1-8;
When S1-4 receives up routing reply URREP, judge that whether this node routing table is empty, if empty, changes S1-5, otherwise changes S1-6;
The S1-5 routing table is empty, at up routing table record father node address and jumping figure;
S1-6 routing table non-NULL, hop count in more up routing reply URREP and the up routing table keeps the little up route of jumping figure;
It is random number between Tmin～Tmax that S1-7 is provided with up route life time, and Tmin=10 second, Tmax=20 second, life time expires laggard walking along the street by reconstruction, changes S1-1.
The very many characteristics of target that descending route is then noticed in the foundation of descending route adopt routing policy as required, and its basic ideas are: the mode with broadcasting is set up descending routing table, and makes full use of existing up route.Carry out end-to-end affirmation.According to such thinking set up the technical step of descending route be:
Whether S4-1 has aggregation node to arrive the descending route of destination node, if having, changes S4-7; Otherwise, change S4-2;
S4-2 broadcast downstream route requests DRREQ;
S4-3 waits for descending routing reply DRREP;
S4-4 declares and receives DRREP whether within a certain period of time, changes S4-5 if receive; Otherwise, change S4-2;
S4-5 receives descending routing reply DRREP, records descending routing table;
S4-6 is provided with descending route life time, changes S4-7;
S4-7 presses capable routing table transmission packet and jumps to next;
Can S4-8 judge the affirmation bag that receive end-end within a certain period of time, if receive, changes S4-11; Otherwise, change S4-9;
S4-9 does not receive and confirms bag that number of retransmissions adds 1;
S4-10 judges that re-transmission is inferior whether greater than N, if greater than N, changes S4-2; Otherwise, change S4-7;
S4-11 upgrades descending route life time.
When carrying out the data transmission by up route, if losing efficacy, up route then carried out route maintenance, its technical step is:
S2-1 sends data to father node;
S2-2 waits for upstream data affirmation bag UACK, declares and whether can receive affirmation bag UACK within a certain period of time, if receive then end, otherwise changes S2-3;
S2-3 does not receive upstream data affirmation bag UACK, and number of retransmissions adds 1;
Whether S2-4 judges number of retransmissions greater than N, if greater than N, changes S2-5; Otherwise change S2-1;
S2-5 changes S1-1, rebulids up route.
The step of handling up route requests is:
S3-1 receives up route requests URREQ;
S3-2 declares the jumping figure among the URREQ whether〉jumping figure of this node.If greater than, then change S3-3, otherwise finish;
S3-3 sends up routing reply URREP
The step of handling descending route requests is:
S5-1 receives descending route requests DRREQ;
Whether S5-2 declares this node is destination node, if change S5-3; Otherwise, change S5-4;
S5-3 sends out descending routing reply DRREP to descending route requests DRREQ by up routing table;
S5-4 continues broadcast downstream route requests DRREQ.
The step of the descending routing reply of node processing is:
S6-1 receives descending routing reply DRREP;
Whether S6-2 declares this node is forward node among the DRREP.If change S6-3; Otherwise, finish;
S6-3 note walking along the street by, descending route life cycle is set;
Whether S6-4 declares this node is aggregation node, if finish; Otherwise, change S6-5;
S6-5 continues converting downlink routing reply DRREP by up route.
The invention has the beneficial effects as follows: in the methods of the invention, up route belongs to a kind of active route, so the efficient height, network overhead and time delay are little, and algorithm is simple and easy to realize.When up route is set up, need not broadcasting, only need in a jumping scope, to carry out.Because route always is in the state of having set up, can transmit immediately when up transmission, time delay is very little.Up routing table is very little, is one only, is used to write down father node, and therefore foundation and maintenance are simple.The wireless sensor network of being set up is the network topology of tree type, and each node has only also must a father node, so guarantee information transmits reliable.Descending route is taked the same paths opposite with up route direction, makes the foundation of descending routing table littler than common routing method on demand expense, need not safeguard (depending on up route maintenance), and is simpler, is easier to realize.
Description of drawings
Fig. 1 is the flow process that node is set up up route among the present invention
Fig. 2 is the flow process that upstream data sends
Fig. 3 is a process of handling up route requests
Fig. 4 is the flow process that aggregation node is set up descending route and downlink data transmission
Fig. 5 is a process of handling descending route requests
Fig. 6 is the process of the descending routing reply of node processing
Fig. 7 is up route requests URREQ packet format
Fig. 8 is up routing reply URREP packet format
Fig. 9 is descending route requests DRREQ packet format
Figure 10 is descending routing reply DRREP packet format
Embodiment
The present invention will be further described below in conjunction with a specific embodiment and accompanying drawing thereof.
Contrast Fig. 1, the handling process that the up route of present embodiment is set up is:
This node of S1-1 sends out route requests URREQ up.The URREQ packet format sees also Fig. 7, wherein contains the jumping figure of this node.
S1-2 waits for the up routing reply URREP in the 1 jumping scope.The URREP packet format sees also Fig. 8, comprising the jumping figure of sending out the URREQ node.
Whether S1-3 receives URREP within a certain period of time.If receive, change S1-4; Otherwise change S1-8.
When S1-4 receives URREP, judge whether this node routing table is empty.If empty, change S1-5; Otherwise change S1-6.
The S1-5 routing table is empty, at up routing table record father node address and jumping figure.
S1-6 routing table non-NULL, relatively hop count in URREP and the up routing table keeps the little up route of jumping figure.
S1-7 is provided with up route life time, and the peek value is the random number between 10 seconds to 20 seconds.
The S1-8 jumping figure is set to maximum
Contrast Fig. 2, the handling process of carrying out the data transmission by up route is:
S2-1 sends data to father node
S2-2 waits for upstream data affirmation bag UACK, declares within a certain period of time whether can receive UACK.Finish if receive then; Otherwise change S2-3.
S2-3 does not receive UACK, and number of retransmissions adds 1.
S2-4 judges that whether number of retransmissions is greater than 3.If greater than 3, change S2-5; Otherwise change S2-1.
S2-5 changes S1-1, rebulids up route.
Contrast Fig. 3, the flow process of handling up route requests is:
S3-1 receives URREQ.
S3-2 declares the jumping figure among the URREQ whether〉jumping figure of this node.If greater than, then change S3-3; Otherwise finish.
S3-3 sends up routing reply URREP.
Contrast Fig. 4, the handling process that descending route is set up and data send is:
Whether S4-1 has aggregation node to arrive the descending route of destination node, if having, changes S4-7; Otherwise, change S4-2.
S4-2 broadcast downstream route requests DRREQ.The DRREQ packet format sees also Fig. 9, and wherein destination address is the node address that finally will search, and DRREQ ID is the numbering of DRREQ.
S4-3 waits for descending routing reply DRREP.Figure 10 is the DRREP form.
S4-4 declares and receives DRREP whether within a certain period of time.Change S4-5 if receive; Otherwise, change S4-2.
S4-5 receives DRREP, records descending routing table.
S4-6 is provided with descending route life time, and the peek value is 30 seconds.Change S4-7.
S4-7 presses capable routing table transmission packet and jumps to next.
Can S4-8 judge the affirmation bag that receive end-end within a certain period of time, if receive, changes S4-11; Otherwise, change S4-9.
S4-9 does not receive and confirms bag that number of retransmissions adds 1.
S4-10 judges that re-transmission is inferior whether greater than 3.If greater than 3, change S4-2; Otherwise, change S4-7.
S4-11 upgrades descending route life time.
Contrast Fig. 5, the flow process of handling descending route requests is:
S5-1 receives DRREQ.
Whether S5-2 declares this node is destination node.If change S5-3; Otherwise, change S5-4.
S5-3 sends out answer DRREP to DRREQ by up routing table.In the DRREP form, destination address is the node address that finally will search, and this node address is the address of node of sending out DRREP, and the address of forward node is the address of up routing node.
S5-4 continues broadcast downstream route requests (DRREQ).
Contrast Fig. 6, the flow process of handling descending routing reply is:
S6-1 receives DRREP.
Whether S6-2 declares this node is forward node among the DRREP.If change S6-3; Otherwise, finish.
S6-3 note walking along the street by, descending route life cycle is set.
Whether S6-4 declares this node is aggregation node.If finish; Otherwise, change S6-5.
S6-5 continues to transmit DRREP by up route.
Claims (5)
1. the method for routing of radio senser network up and down isomeric is characterized in that, when each sensor node is set up route in the described network, up route and descending route in different ways:
The step that its up route is set up:
This node of S1-1 sends out route requests (URREQ) up;
S1-2 waits for up routing reply (URREP);
Whether S1-3 receives up routing reply (URREP) within a certain period of time, if receive, changes S1-4; Otherwise change S1-8;
When S1-4 receives up routing reply (URREP), judge that whether this node routing table is empty, if empty, changes S1-5, otherwise changes S1-6;
The S1-5 routing table is empty, at up routing table record father node address and jumping figure;
S1-6 routing table non-NULL, hop count in more up routing reply (URREP) and the up routing table keeps the little up route of jumping figure;
It is random number between Tmin～Tmax that S1-7 is provided with up route life time, and Tmin=10 second, Tmax=20 second, life time expires laggard walking along the street by reconstruction, changes S1-1.
The S1-8 jumping figure is set to maximum
The step that its descending route is set up:
Whether S4-1 has aggregation node to arrive the descending route of destination node, if having, changes S4-7; Otherwise, change S4-2;
S4-2 broadcast downstream route requests (DRREQ);
S4-3 waits for descending routing reply (DRREP);
S4-4 declares and receives descending routing reply (DRREP) whether within a certain period of time, changes S4-5 if receive; Otherwise, change S4-2;
S4-5 receives descending routing reply (DRREP), records descending routing table;
S4-6 is provided with descending route life time, changes S4-7;
S4-7 presses capable routing table transmission packet and jumps to next;
Can S4-8 judge the affirmation bag that receive end-end within a certain period of time, if receive, changes S4-11; Otherwise, change S4-9;
S4-9 does not receive and confirms bag that number of retransmissions adds 1;
S4-10 judges that re-transmission is inferior whether greater than N, if greater than N, changes S4-2; Otherwise, change S4-7;
S4-11 upgrades descending route life time.
2. according to the method for routing of the described radio senser network up and down isomeric of claim 1, it is characterized in that when carrying out the data transmission by up route, then carried out route maintenance if up route loses efficacy, its technical step is:
S2-1 sends data to father node;
S2-2 waits for upstream data affirmation bag (UACK), declares and whether can receive affirmation bag (UACK) within a certain period of time, if receive then end, otherwise changes S2-3;
S2-3 does not receive upstream data affirmation bag (UACK), and number of retransmissions adds 1;
Whether S2-4 judges number of retransmissions greater than N, if greater than N, changes S2-5; Otherwise change S2-1;
S2-5 changes S1-1, rebulids up route.
3. according to the method for routing of the described radio senser network up and down isomeric of claim 1, it is characterized in that the step of handling up route requests is:
S3-1 receives up route requests (URREQ);
S3-2 declares the jumping figure in the up route requests (URREQ) whether〉jumping figure of this node, if greater than, then change S3-3, otherwise finish;
S3-3 sends up routing reply (URREP)
4. according to the method for routing of the described radio senser network up and down isomeric of claim 1, it is characterized in that the step of handling descending route requests is:
S5-1 receives descending route requests (DRREQ);
Whether S5-2 declares this node is destination node, if change S5-3; Otherwise, change S5-4;
S5-3 sends out descending routing reply (DRREP) to descending route requests (DRREQ) by up routing table;
S5-4 continues broadcast downstream route requests (DRREQ).
5. according to the method for routing of the described radio senser network up and down isomeric of claim 1, it is characterized in that the step of the descending routing reply of node processing is:
S6-1 receives descending routing reply (DRREP);
Whether S6-2 declares this node is forward node in the descending routing reply (DRREP), if change S6-3; Otherwise, finish;
S6-3 note walking along the street by, descending route life time is set;
Whether S6-4 declares this node is aggregation node, if finish; Otherwise, change S6-5;
S6-5 continues converting downlink routing reply (DRREP) by up route.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100861400A CN100461763C (en) | 2006-09-04 | 2006-09-04 | Radio senser network up and down isomeric routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100861400A CN100461763C (en) | 2006-09-04 | 2006-09-04 | Radio senser network up and down isomeric routing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1933445A CN1933445A (en) | 2007-03-21 |
| CN100461763C true CN100461763C (en) | 2009-02-11 |
Family
ID=37879074
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100861400A Expired - Fee Related CN100461763C (en) | 2006-09-04 | 2006-09-04 | Radio senser network up and down isomeric routing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100461763C (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109120537A (en) * | 2017-06-23 | 2019-01-01 | 迈普通信技术股份有限公司 | Multicast tree calculation method and device |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101969679A (en) | 2009-07-27 | 2011-02-09 | 华为技术有限公司 | Method, equipment and system for selecting route discovery |
| CN101895952B (en) * | 2010-07-16 | 2012-09-12 | 山东省计算中心 | Multi-route establishment method and parallel data transmission method of wireless sensor network |
| CN102457980B (en) * | 2010-10-14 | 2014-07-02 | 中国移动通信集团公司 | Data transmission method and system in sensor network |
| CN102480770B (en) * | 2010-11-22 | 2015-07-08 | 中国科学院沈阳自动化研究所 | Autonomous networking method for wireless meter-reading system of electric energy meter |
| CN102664716B (en) * | 2012-04-13 | 2014-08-06 | 南通大学 | Wireless sensor network data collection method applied to real-time monitoring |
| CN102711213A (en) * | 2012-05-14 | 2012-10-03 | 南京邮电大学 | Wireless sensor network routing method based on residual energy |
| CN103678767B (en) * | 2013-11-08 | 2016-08-31 | 南通大学 | Equivalent circuit macro model of laminar composite magneto-dependent sensor method for building up |
| CN114025312A (en) * | 2021-11-09 | 2022-02-08 | 上海遨有信息技术有限公司 | Method and system for broadcasting downlink route |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1606292A (en) * | 2003-07-14 | 2005-04-13 | 三星电子株式会社 | Route update protocol for a wireless sensor network |
| WO2005119981A1 (en) * | 2004-05-28 | 2005-12-15 | International Business Machines Corporation | Wireless sensor network |
| WO2006069067A2 (en) * | 2004-12-20 | 2006-06-29 | Sensicast Systems | Method for reporting and accumulating data in a wireless communication network |
-
2006
- 2006-09-04 CN CNB2006100861400A patent/CN100461763C/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1606292A (en) * | 2003-07-14 | 2005-04-13 | 三星电子株式会社 | Route update protocol for a wireless sensor network |
| WO2005119981A1 (en) * | 2004-05-28 | 2005-12-15 | International Business Machines Corporation | Wireless sensor network |
| WO2006069067A2 (en) * | 2004-12-20 | 2006-06-29 | Sensicast Systems | Method for reporting and accumulating data in a wireless communication network |
Non-Patent Citations (4)
| Title |
|---|
| 无线传感器网络中一种基于能量策略的路由算法. 李国华，田辉，崔鸿雁，沈树群.电子与信息学报，第28卷第1期. 2006 |
| 无线传感器网络中一种基于能量策略的路由算法. 李国华，田辉，崔鸿雁，沈树群.电子与信息学报，第28卷第1期. 2006 * |
| 无线传感器网络方向性分区路由算法. 刘云璐，柴乔林，赵晋.计算机应用，第26卷第1期. 2006 |
| 无线传感器网络方向性分区路由算法. 刘云璐，柴乔林，赵晋.计算机应用，第26卷第1期. 2006 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109120537A (en) * | 2017-06-23 | 2019-01-01 | 迈普通信技术股份有限公司 | Multicast tree calculation method and device |
| CN109120537B (en) * | 2017-06-23 | 2020-10-16 | 迈普通信技术股份有限公司 | Multicast tree calculation method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1933445A (en) | 2007-03-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100461763C (en) | Radio senser network up and down isomeric routing method | |
| CN101179499B (en) | Method for wireless self-organizing of monitoring system to form tree-shaped routing | |
| Li et al. | Pipeline slot based fast rerouting scheme for delay optimization in duty cycle based M2M communications | |
| CN102547942B (en) | Wireless sensor network intelligent gateway applied to greenhouse environment monitoring | |
| CN103458487B (en) | Network code perception cross-layer energy-saving routing method in wireless sense network | |
| CN102438298B (en) | Trusted energy-saving data convergence method for wireless sensor network | |
| CN103236974B (en) | A kind of method of checking meter for power line carrier based on dynamic routing algorithm | |
| CN104639552A (en) | Linked network wireless high-speed communication protocol | |
| CN109949559A (en) | Micropower kilowatt meter reading-out system and equipment based on wireless sensor network | |
| CN107222900B (en) | Wireless sensor network node cooperation method based on dynamic chain | |
| CN102595550A (en) | Self-adaptive wireless sensor network routing method based on cross-layer optimization | |
| CN201905101U (en) | Remote orchard intelligent irrigation system based on ZigBee and GPRS (general packet radio service) | |
| CN103916939A (en) | Wireless chain-type transmission system | |
| CN101483901A (en) | Topology control method used for wireless sensor network middleware | |
| CN103476099A (en) | Double dormancy method for wireless sensor nodes | |
| CN105072658A (en) | Network data collection control system and wireless routing method | |
| CN102413163A (en) | Method and device for collecting ground wireless sensor data by high-speed rail motor cars | |
| CN101394418B (en) | General computation data processing control method based on mobile proxy | |
| CN102983948A (en) | Adaptive clustering transmission method and device for wireless sensor network | |
| Liu et al. | A survey of transport protocol for wireless sensor networks | |
| PalChaudhuri et al. | Design of adaptive overlays for multi-scale communication in sensor networks | |
| CN105978946A (en) | Internet of things system framework based on content center network | |
| CN112423364B (en) | Wireless mobile ad hoc communication method and system | |
| CN101291285A (en) | Novel wireless sensor network routing method forming convergence gradient | |
| CN204102313U (en) | A kind of master-slave mode information collecting device being used for microenvironment monitoring based on WSN |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090211 Termination date: 20160904 |