CN102281610A - Routing method for wireless equipment self-adaptive tree-shaped network - Google Patents
Routing method for wireless equipment self-adaptive tree-shaped network Download PDFInfo
- Publication number
- CN102281610A CN102281610A CN2011102630115A CN201110263011A CN102281610A CN 102281610 A CN102281610 A CN 102281610A CN 2011102630115 A CN2011102630115 A CN 2011102630115A CN 201110263011 A CN201110263011 A CN 201110263011A CN 102281610 A CN102281610 A CN 102281610A
- Authority
- CN
- China
- Prior art keywords
- node
- wireless
- network
- routing
- block
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 24
- 230000005540 biological transmission Effects 0.000 claims abstract description 11
- 230000008859 change Effects 0.000 claims description 8
- 230000006978 adaptation Effects 0.000 claims description 7
- 230000009191 jumping Effects 0.000 claims description 4
- 230000008520 organization Effects 0.000 claims description 3
- 230000008569 process Effects 0.000 claims description 3
- 238000005265 energy consumption Methods 0.000 abstract description 5
- 238000010586 diagram Methods 0.000 description 7
- 230000007246 mechanism Effects 0.000 description 5
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 239000007795 chemical reaction product Substances 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000005855 radiation Effects 0.000 description 1
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 invention discloses a routing method for a wireless equipment self-adaptive tree-shaped network. By the method, wireless terminal equipment and a wireless relay router are dynamically bound, or a parent-child relation of wireless relay nodes is adjusted according to data transmission quantity of the terminal equipment within a period of time at present. By the method, the addressing hop count of routing nodes to the terminal equipment is lowered; therefore, the routing method of the wireless equipment self-adaptive tree-shaped network is provided, so that the energy consumption of the wireless network is reduced, and a broadcast signal conflict rate is optimized.
Description
Technical field
The present invention relates to networking technology area, relate in particular to a kind of method for routing of wireless device self adaptation tree network.
Background technology
A kind of traditional wireless network addressing scheme is: be similar to ICP/IP protocol, the addressing of address Network Based.Specifically, receive data when a wireless routing node and give the correct time, can carry out to present networks or other forwarded according to routing table.Transmit different with wired router, because the broadcast characteristic of wireless signal, every other wireless nodes in radiation scope all can be handled this signal at link layer, if the broadcast singal destination address is not the network that receives node, then can cause once the inspection of invalid link layer Frame.
The characteristics of prior art are:
1. wireless routing node transmission burden is heavy, and energy consumption is big.
2. the radio broadcasting addressing is frequent, and signal conflict causes error rate height.
3. data source is longer to the topological path of data endpoint, causes propagation delay time long.
In the wireless network of tree topology, the present invention is on the basis that does not change the standard radio Routing Protocol, by designing a kind of mechanism, this mechanism foundation is the volume of transmitted data of interior terminal equipment for the previous period, dynamically wireless terminal device and wireless relay router are bound, or adjusted the set membership of wireless repeater node.Reduced the addressing jumping figure of routing node, thereby a kind of method for routing of wireless device self adaptation tree network is provided, and then optimized the energy resource consumption of this wireless network, broadcast singal collision rate terminal equipment.
Summary of the invention
For overcoming the defective of prior art, the invention provides a kind of method for routing of wireless device self adaptation tree network, this method is by the volume of transmitted data according to the terminal equipment in ought be for the previous period, dynamically wireless terminal device and wireless relay router are bound, or adjusted the set membership of wireless repeater node; Reduced the addressing jumping figure of routing node, thereby optimized the energy resource consumption of this wireless network, broadcast singal collision rate terminal equipment.
The transmission quantity of each equipment is defined as 1 unit data, then equipment is considered as leafy node, according to Huffman coded system organization network, Huffman sets inner node and is considered as wireless routing node; After the initialization, according to following steps update algorithm flow process:
S1: certain leafy node is received 1 unit data;
S2: this leafy node of pointed;
Is S3: ID number that judges this leafy node minimum in Block? if then change S4, otherwise the node of ID minimum exchange father node pointer and ID number among this node and the Block forwards S4 then to;
S4: increase this node transmission quantity unit data;
S5: judge that this node is a root? if then stop, otherwise the father node of this node of pointed forwards S3 to.
After node 13 is received 1 unit data among the step S1 owing to be in node among the same Block with node 13 and have 5,6,7,8,9,10,11,12,13,14,15}, so node 13 will with node 5 exchanges, and then increase a digit.
The beneficial effect that technical solution of the present invention is brought: in the network, routing node volume of transmitted data sum that all are wireless reduces, and energy consumption reduces.Radio broadcasting addressing frequency (the broadcasting number of unit interval) reduces.Data source reduces to the propagation delay time of data endpoint.
Description of drawings
In order to be illustrated more clearly in the embodiment of the invention or technical scheme of the prior art, to do to introduce simply to the accompanying drawing of required use in embodiment or the description of the Prior Art below, apparently, accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is a tree network topological diagram of the present invention;
Fig. 2 is an initialization tree network structure chart among the present invention;
Fig. 3 is a network topology update algorithm flow chart among the present invention;
Fig. 4 is the state diagram after node 13 is received 1 unit data on the basis of Fig. 2 among the present invention;
Fig. 5 is the state diagram after node 13 is received 1 unit data on the basis of Fig. 4 among the present invention;
Fig. 6 is that node 13 is received state diagram behind 1 unit data on the basis of Fig. 5 among the present invention;
Fig. 7 is that node 13 is received state diagram behind 1 unit data again on the basis of Fig. 6 among the present invention;
Fig. 8 is the state diagram after node 13 and node 2 exchanges on the basis of Fig. 7 among the present invention;
Fig. 9 is the more state diagram behind the New count of node 0 on the basis of Fig. 8 among the present invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the invention, the technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that is obtained under the creative work prerequisite.
In tree-shaped wireless network, according to the volume of transmitted data of wireless terminal device for the previous period, dynamically wireless terminal device and wireless routing node are bound by a kind of mechanism, effectively in the work, reach the following parameter of optimization at network:
In the network, routing node volume of transmitted data sum that all are wireless reduces, and energy consumption reduces.
Radio broadcasting addressing frequency (the broadcasting number of unit interval) reduces.
Data source reduces to the propagation delay time of data endpoint.
In the wireless network of tree topology, the present invention is on the basis that does not change the standard radio Routing Protocol, by designing a kind of mechanism, this mechanism foundation is the volume of transmitted data of interior terminal equipment for the previous period, dynamically wireless terminal device and wireless relay router are bound, or adjusted the set membership of wireless repeater node.Promptly, equipment that volume of transmitted data is bigger and close root routing node binding, the little equipment of volume of transmitted data with bind away from the root routing node, reduced the addressing jumping figure of routing node to terminal equipment, thereby provide a kind of method for routing of wireless device self adaptation tree network, and then the energy resource consumption of this wireless network, broadcast singal collision rate have been optimized.
Below the tree network topology is made an explanation, and introduce the tree network of wireless device on this basis.
Tree (tree) is the finite set K that comprises the individual node of n (n＞0), and has defined one concern N in K, and N meets the following conditions:
(1) have and only have a node K0, he does not have the forerunner for concerning N, claims K0 root node for tree.Abbreviate root (root) as.
(2) except that K0, each node among the K has and only has a forerunner for concerning N.
(3) each node among the K can have m follow-up (m＞=0) concerning concerning N.
As shown in Figure 1, this figure has presented a tree network, has wherein bound the plurality of sub node under the Yuan Xing node, the node that has child node is called as " inner node ", and wherein the most special node is that table number is the node of " 0 ", there is not a limit upwards in it, is called as root node; Wherein square node is not bound any node downwards, does not have the node of child node, is called as " leafy node ".
In wireless device network, usually there is a root node, it is wireless router, in order to receive the data outside the wireless tree network, and in wireless mode, transmit to target device through some relay routers, or reception is from the data of terminal equipment, the forwarded outside this wireless network.Therefore, relay router is considered to inner node, and wireless terminal is considered to leafy node.
With Fig. 1 is example, and traditional network addressing mode is: when there are data the outside will be when node (0) flows to node (15), must be through so a series of routers (path): 0=＞1=＞4 arrive 15 at last.When data volume was bigger, the transmission path that data are passed through was constant.If the bigger equipment of transmitted data amount is in the bottom of this tree network " misfortune ", then the router on this transmission path will consume ample resources.
This tradition addressing method is with reference to the design of the Routing Protocol of cable network, yet, under wireless environment, fully can be more flexible.Give formal description and the hypothesis that goes wrong below.
1) this network is a tree network.
2) data flow to certain leafy node from present networks is outside through root node and inner node, or flow to external network from certain leafy node through root node and inner node.
3) in the stable moment of network topology, data are unique from the path that root node flows to leafy node, and promptly data are that limit along network flows to or flows out, and vice versa.
4) establish a certain amount of data M, through root node flow to leafy node through inner node (Rx1, Rx2, Rx3...Rxi)
Then wherein the expense of each inner node is M.
5) if inner node is present on some the data transfer paths, then expense adds up.
6) the corresponding wireless router of inner node, the corresponding wireless terminal of leafy node.
7) relation of the corresponding upper strata router in the limit of father node connexon node and lower floor's router.
8) each router can only distribute N address downwards at most, promptly is with N child node.
9) in the network in twos node can pass through wireless broadcast communication, and exchange pertinent information.
Ask: when the data volume dynamic change, how reconstruct tree network topology makes this network internal node expense sum minimum.
As shown in Figure 2: the node internal digital is the transmitted data amount of this node, is the sum of transmitted data amount of child node.Each inner node can attach 3 child nodes at most, and near the numeral the node is the ID of this node, and method to set up is: at same one deck, increase from left to right; At different layers, increase from top to bottom; The ID that data volume equates forms a Block.
The present case of Fig. 2 is that the data of each terminal equipment transmission quantity are 1 all, have 11 terminal equipments, 5 routing devices.
The mode of initialization network is: the transmission quantity of each equipment is defined as 1Unit, then equipment is considered as leafy node, according to Huffman coded system organization network, Huffman sets inner node and is considered as wireless routing node.After the initialization, according to network topology update algorithm flow chart.
The beneficial effect that technical solution of the present invention is brought:
In the network, routing node volume of transmitted data sum that all are wireless reduces, and energy consumption reduces.
Radio broadcasting addressing frequency (the broadcasting number of unit interval) reduces.
Data source reduces to the propagation delay time of data endpoint.
Fig. 3 is network topology update algorithm flow chart among the present invention, and is specific as follows:
S1: certain leafy node is received 1 unit data;
S2: this leafy node of pointed;
Is S3: ID number that judges this leafy node minimum in Block? if then change S4, otherwise the node of ID minimum exchange father node pointer and ID number among this node and the Block forwards S4 then to;
S4: increase this node transmission quantity unit data;
S5: judge that this node is a root? if then stop, otherwise the father node of this node of pointed forwards S3 to.
Based on Fig. 2, certain is after constantly node 13 is received 1 unit data, according to algorithm, because the node that is among the same Block with node 13 has { 5,6,7,8,9,10,11,12,13,14,15}, so node 13 will with node 5 exchange, and then increase a digit.State as shown in Figure 4.
Based on Fig. 4, because the node 13 of this moment is not the root of this tree obviously, so need to consider the father node 1 of node 13.Because node 1 residing Bolck is: { 1} is a Block the inside ID minimum, so need not exchange, direct count adds 1.As shown in Figure 5.
Based on Fig. 5, node 1 still is not a root, thus need to consider its father node 0.Because node 0 residing Block is: { 0} is a Block the inside ID minimum, so need not exchange, direct count adds 1.As shown in Figure 6.
Based on Fig. 6, after node 13 was received a unit data again, after network was adjusted, state became Fig. 7.
Based on Fig. 7, after node 13 was received data again, network change was slightly different.Because the Block under the current node 13 is that { 2,3,4,13}, node 13 at first will exchange with node 2, and counting adds 1 then, and exchange this time has inner node to participate in.The result as shown in Figure 8.
The father node of node 13 also repeats same process then, and end product as shown in Figure 9.
In the practice, this network can restPose (Fig. 2) at set intervals, repeats above-mentioned algorithm again.
More than the method for routing of a kind of wireless device self adaptation tree network that the embodiment of the invention provided is described in detail, used specific case herein principle of the present invention and execution mode are set forth, the explanation of above embodiment just is used for helping to understand method of the present invention and core concept thereof; Simultaneously, for one of ordinary skill in the art, according to thought of the present invention, the part that all can change in specific embodiments and applications, in sum, this description should not be construed as limitation of the present invention.
Claims (5)
1. the method for routing of a wireless device self adaptation tree network, it is characterized in that, this method is dynamically bound wireless terminal device and wireless relay router by the volume of transmitted data according to the terminal equipment in ought be for the previous period, or the set membership of adjustment wireless repeater node; Reduced the addressing jumping figure of routing node, thereby optimized the energy resource consumption of this wireless network, broadcast singal collision rate terminal equipment.
2. the method for claim 1 is characterized in that, the transmission quantity of each equipment is defined as 1 unit data, then equipment is considered as leafy node, and according to Huffman coded system organization network, Huffman sets inner node and is considered as wireless routing node; After the initialization, according to following steps update algorithm flow process:
S1: certain leafy node is received 1 unit data;
S2: this leafy node of pointed;
Is S3: ID number that judges this leafy node minimum in Block? if then change S4, otherwise the node of ID minimum exchange father node pointer and ID number among this node and the Block forwards S4 then to;
S4: increase this node transmission quantity unit data;
S5: judge that this node is a root? if then stop, otherwise the father node of this node of pointed forwards S3 to.
3. method as claimed in claim 1 or 2 is characterized in that, after node 13 is received 1 unit data among the step S1, because the node that is among the same Block with node 13 has { 5,6,7,8,9,10,11,12,13,14,15}, thus node 13 will with node 5 exchange, and then increase a digit.
4. the method for claim 1 is characterized in that, the node 13 among the step S2 is not the root of this tree obviously, so need to consider the father node 1 of node 13; Because node 1 residing Bolck is: { 1} is a Block the inside ID minimum, so need not exchange, direct count adds 1.
5. the method for claim 1 is characterized in that, node 1 still is not a root among the step S5, so need to consider its father node 0; Because node 0 residing Block is: { 0} is a Block the inside ID minimum, so need not exchange, direct count adds 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110263011.5A CN102281610B (en) | 2011-09-06 | 2011-09-06 | Routing method for wireless equipment self-adaptive tree-shaped network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110263011.5A CN102281610B (en) | 2011-09-06 | 2011-09-06 | Routing method for wireless equipment self-adaptive tree-shaped network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102281610A true CN102281610A (en) | 2011-12-14 |
| CN102281610B CN102281610B (en) | 2014-04-30 |
Family
ID=45106713
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110263011.5A Expired - Fee Related CN102281610B (en) | 2011-09-06 | 2011-09-06 | Routing method for wireless equipment self-adaptive tree-shaped network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102281610B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104869603A (en) * | 2015-05-08 | 2015-08-26 | 中山大学 | ZigBee routing method suitable for wireless monitoring and controlling network |
| CN109693379A (en) * | 2017-10-20 | 2019-04-30 | Cl产权管理有限公司 | Method for manufacturing the equipment of three-dimension object with operating adding type |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101282569A (en) * | 2007-04-03 | 2008-10-08 | 中兴通讯股份有限公司 | Self-adaption management method for wireless transmission network containing base station and wireless relay station |
| CN101668323A (en) * | 2008-09-05 | 2010-03-10 | 华为技术有限公司 | Access station selecting method, switching method, accessing method and equipment |
| CN101835202A (en) * | 2010-04-01 | 2010-09-15 | 武汉鸿象信息技术有限公司 | Cooperative load balancing method based on multihop relay in heterogeneous wireless network |
-
2011
- 2011-09-06 CN CN201110263011.5A patent/CN102281610B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101282569A (en) * | 2007-04-03 | 2008-10-08 | 中兴通讯股份有限公司 | Self-adaption management method for wireless transmission network containing base station and wireless relay station |
| CN101668323A (en) * | 2008-09-05 | 2010-03-10 | 华为技术有限公司 | Access station selecting method, switching method, accessing method and equipment |
| CN101835202A (en) * | 2010-04-01 | 2010-09-15 | 武汉鸿象信息技术有限公司 | Cooperative load balancing method based on multihop relay in heterogeneous wireless network |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104869603A (en) * | 2015-05-08 | 2015-08-26 | 中山大学 | ZigBee routing method suitable for wireless monitoring and controlling network |
| CN104869603B (en) * | 2015-05-08 | 2018-08-14 | 中山大学 | A kind of ZigBee method for routing suitable for wireless monitor control network |
| CN109693379A (en) * | 2017-10-20 | 2019-04-30 | Cl产权管理有限公司 | Method for manufacturing the equipment of three-dimension object with operating adding type |
| US11364686B2 (en) | 2017-10-20 | 2022-06-21 | Concept Laser Gmbh | Method for operating an apparatus for additively manufacturing of three-dimensional objects |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102281610B (en) | 2014-04-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20130121335A1 (en) | Dynamic multicast mode selection in a communication network | |
| CN104883285B (en) | The network-building method and multi-mode radio communication equipment of a kind of network | |
| US20120155463A1 (en) | Increased Communication Opportunities with Low-Contact Nodes in a Computer Network | |
| CN102185782B (en) | Data transmission method and device of multilink transparent transmission interconnection network | |
| CN108156584A (en) | The communication means and system of a kind of bluetooth equipment and its mesh networks | |
| CN113765544B (en) | Dual-mode heterogeneous field area network multipath concurrent transmission method, system and device based on HPLC and RF | |
| CN104735744B (en) | A kind of design method of the multi-hop relay routing based on terminal direct connection communication | |
| CN103200643B (en) | Based on the distributed fault-tolerance topology control method of dump energy perception | |
| JP2013055451A5 (en) | ||
| CN103957158A (en) | Determining method and device for flow forwarding path and communication system | |
| CN102368727A (en) | Crossed IP network TRILL network communication method, system thereof and devices | |
| CN103501236A (en) | Method and device for generating network control plane logical topology | |
| CN104993990A (en) | Multi-gateway technology of intelligent housing system | |
| CN103596276A (en) | Wireless network channel distribution strategy based on channel interval | |
| CN102801622A (en) | Transmitting method and device for data messages | |
| CN103974363A (en) | Non-gateway node, wireless mesh network and wireless mesh network data forwarding method | |
| US20160050040A1 (en) | Radio communication system and radio communication method | |
| CN110391981B (en) | Apparatus, method, and medium for establishing a source routing tree for gateway nodes in a mesh network | |
| CN102281610B (en) | Routing method for wireless equipment self-adaptive tree-shaped network | |
| Mahmud et al. | Improved rpl for iot applications | |
| CN105072586A (en) | Management method for forwarding of broadcast message in embedded wireless ad hoc network | |
| CN105050148A (en) | Implementation method for routing of wireless sensor network | |
| CN108810912A (en) | A kind of system and method for realizing Mesh networkings based on LoRa | |
| CN103354567A (en) | Method for synchronizing media access control (MAC) addresses and device | |
| JP2012070367A (en) | Multi-hop communication method, multi-hop communication system, and communication terminal |
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 | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20160721 Address after: 3, building 830002, executive building, 58 Qianjin Street, Tianshan, Xinjiang, Urumqi Patentee after: Xinjiang Rui net IKEA Technology Co., Ltd. Address before: 510006 teaching experiment center, east campus, Zhongshan University, Panyu District, Guangdong, C401, China Patentee before: Sun Yat-sen University |
|
| 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: 20140430 Termination date: 20170906 |