CN102595553A - Management method of routing table of graded wireless sensor network - Google Patents
Management method of routing table of graded wireless sensor network Download PDFInfo
- Publication number
- CN102595553A CN102595553A CN2012100450201A CN201210045020A CN102595553A CN 102595553 A CN102595553 A CN 102595553A CN 2012100450201 A CN2012100450201 A CN 2012100450201A CN 201210045020 A CN201210045020 A CN 201210045020A CN 102595553 A CN102595553 A CN 102595553A
- Authority
- CN
- China
- Prior art keywords
- node
- routing
- wireless sensor
- sensor network
- routing table
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a management method of a routing table of a graded wireless sensor network, wherein a node in the wireless sensor network is divided into a sink node, a routing node and an end node, wherein the sink node is responsible for collecting uplink data of the wireless sensor network and forwarding downlink signaling; the routing node is responsible for forwarding uplink data and downlink data; and the end node is responsible for collecting sensor data and reporting to the previous stage of node. The method is characterized in that the management method of the routing table comprises the following steps that: the sink node restores the complete routing table of the wireless sensor network; the routing node stores a next hop child node which can reach a downlink destination node and stores an uplink father node; and the end node does not store the downlink routing table, but stores the uplink father node. According to the invention, the downlink routing table is stored in a graded manner through introducing the routing node, the transmission efficiency is improved, and thus the network cost is convenient to control.
Description
Technical field
The present invention relates to a kind of wireless sensor network technology, relate in particular to a kind of wireless sensor network method for managing route table of classification.
Background technology
At present behind the wireless sensor networking, descending routing table all be centralized stores on aggregation node (gateway), therefore each down when signaling is to node, all need be in signaling packet with on tediously long descending routing table.The method can produce following negative effect:
1) wireless sensor network is a kind of network of low bandwidth, and tediously long routing table makes the effective transmission speed of wireless sensor network and payload reduce greatly.
2) in wireless sensor network; Frontier node is low-cost, low-power consumption basically; Therefore cpu performance, RAM capacity, the ROM capacity of node all are very limited, be not fit to handle big packet, and the limited RAM capacity of node have determined the length of descending routing table; Also just limit the maximum networking progression of wireless sensor network, promptly limited network coverage.
Summary of the invention
The present invention provides a kind of wireless sensor network method for managing route table of classification for addressing the above problem, and has improved transmission rate, is convenient to the Control Network cost.
In order to solve the problems of the technologies described above, the present invention is able to solve through following technical proposals:
A kind of wireless sensor network method for managing route table of classification; Node division is aggregation node, routing node and frontier node in the said wireless sensor network; Wherein aggregation node is responsible for the collection of wireless sensor network upstream data and the forwarding of downlink signaling; Routing node is responsible for transmitting the up-downgoing data, and frontier node is responsible for the collecting sensor data and is reported to even higher level of node, is characterised in that method for managing route table is following:
Aggregation node is preserved the complete routing table of wireless sensor network, and routing node is preserved next jumping child node that can arrive descending destination node and preserved up father node, and frontier node is not preserved descending routing table but preserved up father node.
Said routing node is preserved and is chosen three node when next that can arrive descending destination node jumped child node and back up mutually, chooses three father nodes when preserving up father node and backs up mutually.
Choosing three father nodes when said frontier node is preserved up father node backs up mutually.
When data uplink, frontier node is chosen optimum father node (routing node or aggregation node), as the following jumping address of up route, sends data.After routing node is received this packet, choose optimum father node equally and up transmit data, up to arriving aggregation node (gateway).
When data downstream, gateway from complete routing table, choose the following jumping child node that arrives destination node after, send data to routing node.Routing node from the descending routing table of preserving, choose the following hop node that arrives destination node after, send data, and the like, up to arriving destination node.
The wireless sensor network method for managing route table of classification provided by the invention has following beneficial effect:
1, preserves descending routing table through introducing the routing node classification, make the transmission package length of wireless sensor network reduce greatly, not only improved transmission rate, also increased the payload of single bag.
2, as long as improve the RAM or the ROM capacity of indivedual routing nodes, just can improve the coverage of whole wireless sensor network, when improving network coverage, network cost has also obtained effective control.
Description of drawings
Fig. 1 is a network topological diagram of the present invention;
Fig. 2 is the routing table of aggregation node of the present invention;
Fig. 3 is routing node R of the present invention
1Descending routing table;
Fig. 4 is routing node R of the present invention
2, R
3, R
4Descending routing table;
Fig. 5 is routing node R of the present invention
1Up routing table
Fig. 6 is routing node R of the present invention
2, R
3, R
4Up routing table
Fig. 7 is routing node C of the present invention
1, C
2, C
3Up routing table.
Embodiment
Below in conjunction with embodiment the present invention is described in further detail:
Embodiment 1:
Node in the wireless sensor network is divided into aggregation node, routing node, frontier node, and G is an aggregation node, R
1, R
2, R
3, R
4Be routing node, C
1, C
2, C
3Be frontier node, network topological diagram is as shown in Figure 1.
Aggregation node (gateway) is responsible for the collection of wireless sensor network upstream data and the forwarding of downlink signaling as the top-most node of wireless sensor network, preserves the complete routing table of wireless sensor network.According to topological diagram, the complete routing table that aggregation node is preserved is as shown in Figure 2.
Routing node is as the intermediate node of wireless sensor network; Be responsible for transmitting the up-downgoing data; Preservation can arrive next jumping child node (choosing three node backs up mutually) of descending destination node, and preserves up father node (choosing three father nodes backs up mutually).According to topological diagram, routing node R
1, R
2, R
3, R
4Descending routing table respectively like Fig. 3, shown in 4, routing node R
1, R
2, R
3, R
4Up routing table respectively like Fig. 5, shown in 6.
Frontier node is responsible for the collecting sensor data and is reported to even higher level of node (routing node or aggregation node) as the least significant end node of wireless sensor network.Do not preserve descending routing table, preserve up father node (choosing three father nodes backs up mutually).According to topological diagram, frontier node C1, C2, the up routing table of C3 are as shown in Figure 7.
When data uplink, frontier node is chosen optimum father node (routing node or aggregation node), as the following jumping address of up route, sends data.After routing node is received this packet, choose optimum father node equally and up transmit data, up to arriving aggregation node (gateway).For example the up path of frontier node C1 transmission data is: C1---->R2---->R1---->G.
When data downstream, gateway from complete routing table, choose the following jumping child node that arrives destination node after, send data to routing node.Routing node from the descending routing table of preserving, choose the following hop node that arrives destination node after, send data, and the like, up to arriving destination node.For example assigning signaling to the following walking along the street strength of C1 is: G---->R1---->R2---->C1.
Above-described embodiment is a kind of preferable scheme of the present invention, is not that the present invention is done any pro forma restriction, under the prerequisite that does not exceed the technical scheme that claim puts down in writing, also has other variant and remodeling.
Claims (3)
1. the wireless sensor network method for managing route table of a classification; Node division is aggregation node, routing node and frontier node in the said wireless sensor network; Wherein aggregation node is responsible for the collection of wireless sensor network upstream data and the forwarding of downlink signaling; Routing node is responsible for transmitting the up-downgoing data, and frontier node is responsible for the collecting sensor data and is reported to even higher level of node, is characterised in that method for managing route table is following:
Aggregation node is preserved the complete routing table of wireless sensor network, and routing node is preserved next jumping child node that can arrive descending destination node and preserved up father node, and frontier node is not preserved descending routing table but preserved up father node.
2. matching process according to claim 1 is characterized in that: said routing node is preserved and is chosen three node when next that can arrive descending destination node jumped child node and back up mutually, chooses three father nodes when preserving up father node and backs up mutually.
3. matching process according to claim 1 is characterized in that: choose three father nodes when said frontier node is preserved up father node and back up mutually.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012100450201A CN102595553A (en) | 2012-02-27 | 2012-02-27 | Management method of routing table of graded wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012100450201A CN102595553A (en) | 2012-02-27 | 2012-02-27 | Management method of routing table of graded wireless sensor network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102595553A true CN102595553A (en) | 2012-07-18 |
Family
ID=46483643
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012100450201A Pending CN102595553A (en) | 2012-02-27 | 2012-02-27 | Management method of routing table of graded wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102595553A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102883396A (en) * | 2012-09-03 | 2013-01-16 | 苏州两江科技有限公司 | Directional wireless data transmitting method in wireless sensor network |
| CN103856950A (en) * | 2012-12-03 | 2014-06-11 | 施耐德电器工业公司 | Communication method, transceiver stations and associated computer programs |
| CN104270799A (en) * | 2014-10-14 | 2015-01-07 | 北京源清慧虹信息科技有限公司 | Downlink routing setup method and downlink data transmission method in wireless network |
| CN104469906A (en) * | 2014-11-18 | 2015-03-25 | 无锡悟莘科技有限公司 | Low-power-consumption wireless networking method |
| CN105656787A (en) * | 2016-02-26 | 2016-06-08 | 浪潮通用软件有限公司 | Data transmission method based on communication routing table |
| CN112423364A (en) * | 2020-11-06 | 2021-02-26 | 青岛安然物联网科技有限公司 | Wireless mobile ad hoc communication method and system |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1642129A (en) * | 2004-01-14 | 2005-07-20 | 电子科技大学 | Nucleus tree self-organizing dynamic route algorithm |
| WO2005119981A1 (en) * | 2004-05-28 | 2005-12-15 | International Business Machines Corporation | Wireless sensor network |
| CN101420445A (en) * | 2007-10-25 | 2009-04-29 | 厦门大学 | Fast routing protocol of wireless sensor network |
| EP2296407A1 (en) * | 2009-09-10 | 2011-03-16 | Fujitsu Limited | Wireless communication network and adaptive routing communication method thereof |
| CN201813548U (en) * | 2010-09-19 | 2011-04-27 | 北京邮电大学 | Display control system, and communication system, display device and display control device thereof |
| CN102291798A (en) * | 2011-09-29 | 2011-12-21 | 中国电子科技集团公司第五十四研究所 | Wireless multi-hop sensor network-based routing method |
-
2012
- 2012-02-27 CN CN2012100450201A patent/CN102595553A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1642129A (en) * | 2004-01-14 | 2005-07-20 | 电子科技大学 | Nucleus tree self-organizing dynamic route algorithm |
| WO2005119981A1 (en) * | 2004-05-28 | 2005-12-15 | International Business Machines Corporation | Wireless sensor network |
| CN101420445A (en) * | 2007-10-25 | 2009-04-29 | 厦门大学 | Fast routing protocol of wireless sensor network |
| EP2296407A1 (en) * | 2009-09-10 | 2011-03-16 | Fujitsu Limited | Wireless communication network and adaptive routing communication method thereof |
| CN201813548U (en) * | 2010-09-19 | 2011-04-27 | 北京邮电大学 | Display control system, and communication system, display device and display control device thereof |
| CN102291798A (en) * | 2011-09-29 | 2011-12-21 | 中国电子科技集团公司第五十四研究所 | Wireless multi-hop sensor network-based routing method |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102883396A (en) * | 2012-09-03 | 2013-01-16 | 苏州两江科技有限公司 | Directional wireless data transmitting method in wireless sensor network |
| CN103856950A (en) * | 2012-12-03 | 2014-06-11 | 施耐德电器工业公司 | Communication method, transceiver stations and associated computer programs |
| CN103856950B (en) * | 2012-12-03 | 2019-07-30 | 施耐德电器工业公司 | Communication means, transceiver station and relevant computer program |
| CN104270799A (en) * | 2014-10-14 | 2015-01-07 | 北京源清慧虹信息科技有限公司 | Downlink routing setup method and downlink data transmission method in wireless network |
| CN104469906A (en) * | 2014-11-18 | 2015-03-25 | 无锡悟莘科技有限公司 | Low-power-consumption wireless networking method |
| CN105656787A (en) * | 2016-02-26 | 2016-06-08 | 浪潮通用软件有限公司 | Data transmission method based on communication routing table |
| CN112423364A (en) * | 2020-11-06 | 2021-02-26 | 青岛安然物联网科技有限公司 | Wireless mobile ad hoc communication method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102595553A (en) | Management method of routing table of graded wireless sensor network | |
| CN106487684B (en) | A kind of method for routing based on link-quality and queuing delay | |
| SG10201710086RA (en) | A multi-hop networking protocol for wide-area energy harvesting sensor network deployments | |
| CN102769885B (en) | Method for realizing routing in sensor network and sensor network | |
| US8605591B2 (en) | System and method for optimizing packet routing in a mesh network | |
| CN106559330A (en) | A kind of dynamic path planning method based on SDN | |
| CN106209669A (en) | Towards SDN data center network maximum of probability path stream scheduling method and device | |
| CN106817739A (en) | A kind of wireless sensor and actor networks based on mobile sink node Energy Efficient are by agreement | |
| CN107852773A (en) | A kind of method of data transfer, relevant device and system | |
| CN103068002A (en) | Efficient routing method of high rate-wireless personal area network (HR-WPAN) mesh network | |
| CN102186145B (en) | Geographical position and speed information based aerial high-speed self-organization routing method | |
| CN106789649B (en) | Layer two multi-path fast routing method based on labels | |
| CN102355405B (en) | Method for routing and forwarding packet of power line communication system of low-voltage distribution network | |
| CN103856399A (en) | Ad Hoc backup route algorithm based on stability | |
| CN102395162A (en) | Method and system for transmitting multihop wireless sensor network data | |
| CN104284388A (en) | Mobile Ad Hoc network independent clustering and routing method | |
| CN103619045A (en) | Route establishing method and system of low-consumption lossy network | |
| CN106937349A (en) | Wireless sensor and actor networks based on mobile sink node and ant group algorithm are by agreement | |
| CN103096411B (en) | Based on the Internet of Things communication means of reverse power restriction route protocol | |
| CN102316527A (en) | Multi-path ad hoc on-demand distance vector (AODV) routing method based on service quality sensing | |
| CN101986728B (en) | Cross-layer multicast communication method with high delivery ratio and low time delay | |
| Moeller et al. | Backpressure routing made practical | |
| CN103716242A (en) | Routing method and system | |
| CN103686916A (en) | Multi-path data transmission method of industrial wireless sensor network based on surplus energy and expected transmission count | |
| CN103686921B (en) | Chance type forwarding method based on energy collection in movable relay system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20120718 |