CN102802166A - Improved Zigbee network lamination method - Google Patents
Improved Zigbee network lamination method Download PDFInfo
- Publication number
- CN102802166A CN102802166A CN2012103399207A CN201210339920A CN102802166A CN 102802166 A CN102802166 A CN 102802166A CN 2012103399207 A CN2012103399207 A CN 2012103399207A CN 201210339920 A CN201210339920 A CN 201210339920A CN 102802166 A CN102802166 A CN 102802166A
- Authority
- CN
- China
- Prior art keywords
- layering
- acknowledgement frame
- plies
- frame
- node
- 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
Abstract
The invention discloses an improved Zigbee network lamination method. The invention discloses the improved Zigbee network lamination method which specifically comprises the following steps of: a Zigbee network is built, wherein the initialization level number of a coordinator is 0, the number of initialization levels of the other nodes is a maximum value (greater than the maximal estimation level number of the network), and the coordinator begins to broadcast lamination affirming frame; the node updated a mechanism and self level number according to the level number after receiving the lamination affirming frame, namely, the level number is updated to be the smaller value between the current level number and forwarding times of the lamination affirming frame; and meanwhile, the lamination affirming frame is forwarded until the lamination affirming frame is to distributed to the whole network. A node possibly receives the lamination affirming frame for multiple times, a frame forwarding control mechanism is introduced in order to prevent resources wasting, namely, not all of the lamination affirming frame are forwarded and only the lamination affirming frame which enables the updated level number to be smaller is forwarded. The Zigbee network lamination method provided by the invention solves the problem that the node level number can not reflect the distance of node and a network coordinator in certain cases.
Description
Technical field
The invention belongs to the wireless sensor network technology field, relate to improvement Zigbee network hierarchy method.
Background technology
Because wireless sensor network prolongs the focus that whole network life has become current research thereby optimize routing algorithm, is the problem that routing algorithm optimization at first will solve and network is carried out rational level division.What the Zigbee network was used is a kind of bunch of tree-shaped topological structure; Though each node also has a number of plies in this structure; But it is that which of telegon is for child node that this number of plies is just reacted node; The degree of depth on can reaction distance under the stable condition, but the degree of depth that the number of plies can't reaction distance can appear under the full situation of the subset of some nodes.Like the situation among Fig. 1: dark node is represented telegon among the figure, and white nodes is represented router node.Node A is nearer apart from telegon; But this moment, the son node number of telegon reached maximum, can not hold new node and add, so A selects another nearer with it Node B to add network; This moment, the number of plies of A was 2, but in fact A is that 1 node is identical apart from the distance of telegon and the number of plies.Because the appearance of this situation; When the Zigbee network does not have host computer to participate in and when carrying out the whole network routing optimality voluntarily; Node level can not reflect the range information between the node fully, thereby can not get optimal solution, even the result after optimizing makes data send the node less than the edge of network.
Carry the deficiency of layered approach to the Zigbee network, expect that a kind of node level can reflect the Zigbee network hierarchy method of nodal distance.
Summary of the invention
The object of the present invention is to provide a kind of improved Zigbee network hierarchy method, substitute the Zigbee network and carry layered approach, solve the problem that node level can not reflect this node and network coordinator distance relation, the basis is provided for further optimizing routing algorithm.
Improved Zigbee network hierarchy method provided by the invention takes following technical scheme to realize:
1st, initialization
After the Zigbee network was set up, the telegon initialization number of plies was 0, and sent the layering acknowledgement frame, and the layering acknowledgement frame that telegon sends will be received by the all-router node in telegon transmitting power scope; The data that the layering acknowledgement frame carries are the number of times that is forwarded of layering acknowledgement frame self, and this initial value that is forwarded number of times is 1; Router node is initialized as an arbitrary value greater than the present networks maximum estimated number of plies with the number of plies of self;
2nd, upgrade self number of plies
After router node in the Zigbee network is received the layering acknowledgement frame; The number of times that is forwarded of the layering acknowledgement frame self that self number of plies and layering acknowledgement frame is entrained is compared; If the former value is greater than the latter's value; Then router node is updated to the number of times that is forwarded of the entrained layering acknowledgement frame of layering acknowledgement frame self with self number of plies, otherwise router node does not upgrade the number of plies;
3rd, transmit the layering acknowledgement frame
After if router node is received the layering acknowledgement frame; Upgraded self number of plies; Then the number of times that is forwarded of router node layering acknowledgement frame self that the layering acknowledgement frame is entrained adds 1; And this layering acknowledgement frame transmitted, if router node does not upgrade the number of plies, then do not transmit this layering acknowledgement frame.
Advantage of the present invention and good effect
1) the improved Zigbee network hierarchy method of the present invention's proposition, its layering acknowledgement frame sends to router node with the inundation routing mode, and this mode need not calculated route does not need maintaining routing list yet, thereby has reduced the calculating energy consumption of node.
2) the inventive method is improved the inundation routing mode, all layering acknowledgement frames is not transmitted, and only transmits to make and upgrades the layering acknowledgement frame that the number of plies diminishes, and has reduced the waste of resource, avoids occurring data implosion problem.
3) in the inventive method, when the inundation process finished, the number of plies value of each node is the minimum hop count value between node itself and the telegon for this reason, and promptly the number of plies of each node can reflect the distance relation between itself and the telegon.
Description of drawings
Fig. 1 is a Zigbee network hierarchy method sketch map;
Fig. 2 is improved Zigbee network hierarchy method flow diagram;
Fig. 3 is the even distribution situation lower network of a node layering analogous diagram;
Fig. 4 layering actual motion scene;
Process institute captured packets sketch map is confirmed in Fig. 5 layering;
Fig. 6 telegon infonnation collection process institute captured packets sketch map.
Embodiment
Below in conjunction with accompanying drawing example embodiment of the present invention is done a description.For the sake of brevity, be not that all characteristics of embodiment are all described.In following description, well-known function or structure in those wireless senser fields are not described in detail.
Embodiment 1:
Use NS2 (Network Simulator Version 2) that a kind of improved Zigbee network hierarchy that the present invention proposes is carried out emulation.
Use NS2 to carry out network simulation, need to use C++ and OTcl language combined programming, promptly need write interpolation or the modification that the C++ code is accomplished assemblies such as Routing Protocol, and then write the OTcl script emulation at bottom.But the concrete structure of NS2 and programmed method list of references [1], institutes such as yellow Ji, Feng Suili, the Qin Lijiao nationality " NS network analog and protocol emulation " of writing books, People's Telecon Publishing House, 2006 years.
Need write the corresponding program of Routing Protocol with C Plus Plus at bottom and realize the method that the present invention proposes.The programming thinking is following according to the inventive method:
1st, initialization
After the Zigbee network was set up, the telegon initialization number of plies was 0, and sent the layering acknowledgement frame, and the layering acknowledgement frame that telegon sends will be received by the all-router node in telegon transmitting power scope; The data that the layering acknowledgement frame carries are the number of times that is forwarded of layering acknowledgement frame self, and this initial value that is forwarded number of times is 1; Router node is initialized as 255 with self the number of plies (the Zigbee network maximum estimated number of plies is 4 layers in the present embodiment, so the initial value of the router node number of plies is set to get final product greater than 4, is set to 255 in this experimental example);
2nd, upgrade self number of plies
After router node in the Zigbee network is received the layering acknowledgement frame; The number of times that is forwarded of the layering acknowledgement frame self that self number of plies and layering acknowledgement frame is entrained is compared; If the former value is greater than the latter's value; Then router node is updated to the number of times that is forwarded of the entrained layering acknowledgement frame of layering acknowledgement frame self with self number of plies, otherwise router node does not upgrade the number of plies;
3rd, transmit the layering acknowledgement frame
After if router node is received the layering acknowledgement frame; Upgraded self number of plies; Then the number of times that is forwarded of router node layering acknowledgement frame self that the layering acknowledgement frame is entrained adds 1; And this layering acknowledgement frame transmitted, if router node does not upgrade the number of plies, then do not transmit this layering acknowledgement frame.
Simulating scenes: in being of a size of the place of 50m*50m, 101 nodes that evenly distribute carry out the simulation of layering; Below be the OTcl script:
Carry out the setting of global variable.
Node configuration:
Configuration data flow model
Simulation result is as shown in Figure 3.Can obviously find out in equally distributed network among Fig. 3; Node has been divided into different levels; The node of different levels is distinguished with circular, square, 3 kinds of shapes of hexagon, and the numeral that the node top is shown is the level of node, simultaneously layer with layer between the interval also equate.
Embodiment 2:
In the network that the CC2430 chip is formed, realize improved Zigbee network hierarchy method.
The CC2430 chip be TI/Chipcon company produce meet IEEE802.15.4 agreement and the technological 2.4GHz radio system single-chip of ZigBee, be an integrated resolution system (SOC) on the sheet of equipment needed thereby.The particulars list of references [2] of CC2430 chip, institutes such as Li Wenzhong, the Duan Chaoyu nationality " Zigbee2006 wireless network and wireless location under battle conditions " of writing books, publishing house of BJ University of Aeronautics & Astronautics, 2008 years.
The Zigbee protocol stack has been realized the networking and the node address distribution function of network, and present embodiment is write respective code in application layer on this basis, realizes improved Zigbee network hierarchy method.The programming thinking is following according to the inventive method:
1st, initialization
After the Zigbee network was set up, the telegon initialization number of plies was 0, and sent the layering acknowledgement frame, and the layering acknowledgement frame that telegon sends will be received by the all-router node in telegon transmitting power scope; The data that the layering acknowledgement frame carries are the number of times that is forwarded of layering acknowledgement frame self, and this initial value that is forwarded number of times is 1; Router node is initialized as 255 with self the number of plies (the Zigbee network maximum estimated number of plies is 4 layers in the present embodiment, so the initial value of the router node number of plies is set to get final product greater than 4, is set to 255 in this experimental example);
2nd, upgrade self number of plies
After router node in the Zigbee network is received the layering acknowledgement frame; The number of times that is forwarded of the layering acknowledgement frame self that self number of plies and layering acknowledgement frame is entrained is compared; If the former value is greater than the latter's value; Then router node is updated to the number of times that is forwarded of the entrained layering acknowledgement frame of layering acknowledgement frame self with self number of plies, otherwise router node does not upgrade the number of plies;
3rd, transmit the layering acknowledgement frame
After if router node is received the layering acknowledgement frame; Upgraded self number of plies; Then the number of times that is forwarded of router node layering acknowledgement frame self that the layering acknowledgement frame is entrained adds 1; And this layering acknowledgement frame transmitted, if router node does not upgrade the number of plies, then do not transmit this layering acknowledgement frame.
The part key code is following:
Transmitted power is provided with function:
Send function S end_Common_Data (uint8*buf, uint16addr, uint8Leng; CId_t cid; Uint8power) comprise 5 parameters in the function, data, destination address, data length, order id and transmitting power, wherein ordering id is the variable of enumeration type; Before sending, need carry out power setting according to the value of power at present.
Telegon mainly contains 2 kinds of orders: layering order and hierarchical information are collected order.The layering order, telegon sends the layering acknowledgement frame with minimum power, confirms the degree of depth of oneself according to other each nodes of this frame; Hierarchical information is collected order, sends the information gathering frame, makes the node in the network that its hierarchical information is converged to telegon, and telegon is stored the information of whole network.Corresponding these the two kinds of orders of other nodes have different responses.
Nodes records self depth information data structure:
In order to test the actual motion effect of improved Zigbee network hierarchy method, adopt 3 CC2430 chips to form topological structure shown in Figure 4.Wherein node 0x0001 (with networking time distribute to the numbering of 16 short addresses of node as node) and 0x143E all are in one times of communication range of telegon 0x0000.Use packet catcher that wireless data packet is analyzed, Fig. 5 and Fig. 6 are respectively layering and confirm process and telegon infonnation collection process institute captured packets.
APS Cluster Id is layering order 0x0003 among Fig. 5, is the own degree of depth of respective nodes for hop count among the APS Payload.Can find out among the figure that node 0x0001 and 0x143E have all received the layering acknowledgement frame that telegon sends, and upgrade the own degree of depth, transmit.
APS Cluster Id is information gathering order 0x0004 among Fig. 6, is the depth information of respective nodes (comprising the node address and the degree of depth) among the APS Payload.Can find out among the figure that telegon 0x0000 at first sends information gathering order, node 0x0001 and 0x143E send to telegon 0x0000 with oneself depth information after receiving order.
Claims (1)
1. improved Zigbee network hierarchy method is characterized in that this method comprises:
1st, initialization
After the Zigbee network was set up, the telegon initialization number of plies was 0, and sent the layering acknowledgement frame, and the layering acknowledgement frame that telegon sends will be received by the all-router node in telegon transmitting power scope; The data that the layering acknowledgement frame carries are that the layering acknowledgement frame self is forwarded number of times, and this initial value that is forwarded number of times is 1; Router node is initialized as an arbitrary value greater than the present networks maximum estimated number of plies with the number of plies of self;
2nd, upgrade self number of plies
After router node in the Zigbee network is received the layering acknowledgement frame; Self number of plies self is forwarded number of times with the entrained layering acknowledgement frame of layering acknowledgement frame compares; If the former value is greater than the latter's value; Then router node is updated to the number of times that is forwarded of the entrained layering acknowledgement frame of layering acknowledgement frame self with self number of plies, otherwise router node does not upgrade the number of plies;
3rd, transmit the layering acknowledgement frame
After if router node is received the layering acknowledgement frame; Upgraded self number of plies; Then the number of times that is forwarded of router node layering acknowledgement frame self that the layering acknowledgement frame is entrained adds 1; And this layering acknowledgement frame transmitted, if router node does not upgrade the number of plies, then do not transmit this layering acknowledgement frame.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012103399207A CN102802166A (en) | 2012-09-14 | 2012-09-14 | Improved Zigbee network lamination method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012103399207A CN102802166A (en) | 2012-09-14 | 2012-09-14 | Improved Zigbee network lamination method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102802166A true CN102802166A (en) | 2012-11-28 |
Family
ID=47201108
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012103399207A Pending CN102802166A (en) | 2012-09-14 | 2012-09-14 | Improved Zigbee network lamination method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102802166A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105744593A (en) * | 2014-12-09 | 2016-07-06 | 华为数字技术（苏州）有限公司 | Node networking method and device |
| CN106297349A (en) * | 2016-08-31 | 2017-01-04 | 重庆交通大学 | A kind of DAS (Driver Assistant System) based on ZigBee |
| CN108933735A (en) * | 2017-05-27 | 2018-12-04 | 华为技术有限公司 | A kind of method, device and equipment that message is sent |
| CN111866983A (en) * | 2020-06-19 | 2020-10-30 | 青海师范大学 | Underwater node layering method based on shortest hop distance |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102196058A (en) * | 2011-05-19 | 2011-09-21 | 清华大学深圳研究生院 | Method for maintaining address compression control table in 6LoWPAN (lowpan) protocol |
-
2012
- 2012-09-14 CN CN2012103399207A patent/CN102802166A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102196058A (en) * | 2011-05-19 | 2011-09-21 | 清华大学深圳研究生院 | Method for maintaining address compression control table in 6LoWPAN (lowpan) protocol |
Non-Patent Citations (2)
| Title |
|---|
| VIKAS KAWADIA ET.AL: "Principles and Protocols for Power Control in Wireless Ad Hoc Networks", 《IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS》 * |
| 陆剑: "ZigBee无线传感器网络研究", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105744593A (en) * | 2014-12-09 | 2016-07-06 | 华为数字技术（苏州）有限公司 | Node networking method and device |
| CN105744593B (en) * | 2014-12-09 | 2019-11-12 | 华为数字技术（苏州）有限公司 | A kind of node method of network entry and device |
| CN106297349A (en) * | 2016-08-31 | 2017-01-04 | 重庆交通大学 | A kind of DAS (Driver Assistant System) based on ZigBee |
| CN108933735A (en) * | 2017-05-27 | 2018-12-04 | 华为技术有限公司 | A kind of method, device and equipment that message is sent |
| CN108933735B (en) * | 2017-05-27 | 2020-12-25 | 华为技术有限公司 | Method, device and equipment for sending message |
| US11246056B2 (en) | 2017-05-27 | 2022-02-08 | Huawei Technologies Co., Ltd. | Packet sending method, apparatus, and device |
| US11792682B2 (en) | 2017-05-27 | 2023-10-17 | Huawei Technologies Co., Ltd. | Packet sending method, apparatus, and device |
| CN111866983A (en) * | 2020-06-19 | 2020-10-30 | 青海师范大学 | Underwater node layering method based on shortest hop distance |
| CN111866983B (en) * | 2020-06-19 | 2021-02-19 | 青海师范大学 | Underwater node layering method based on shortest hop distance |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102158983B (en) | Method for constructing 6LoWPAN wireless sensor network | |
| Neto et al. | MH-LEACH: A distributed algorithm for multi-hop communication in wireless sensor networks | |
| CN103052130B (en) | A kind of wireless multimedia sensor network data fusion method based on rough set | |
| CN103200643B (en) | Based on the distributed fault-tolerance topology control method of dump energy perception | |
| CN103298054A (en) | Wireless sensor network cluster routing protocol based on node depth | |
| CN104539542B (en) | A kind of low energy consumption based on mobile Sink Data Collections route tree shears method | |
| CN101420445A (en) | Fast routing protocol of wireless sensor network | |
| CN104320796A (en) | Wireless sensor network data transmission method based on LEACH protocol | |
| CN104602302B (en) | It is a kind of based on cluster structured ZigBee-network balancing energy method for routing | |
| CN101420463A (en) | Wireless sensor network address allocation mechanism | |
| CN103095577B (en) | Context-sensitive Uneven Cluster routing algorithm | |
| CN103929782B (en) | A kind of resources balance multi-path route method suitable for industrial wireless sensor network | |
| CN102769885B (en) | Method for realizing routing in sensor network and sensor network | |
| CN103269506A (en) | Mobile wireless sensor network routing method of interference sensing | |
| CN106559731A (en) | A kind of sewage monitoring wireless sensor network | |
| CN102802166A (en) | Improved Zigbee network lamination method | |
| Sengul et al. | A survey of adaptive services to cope with dynamics in wireless self-organizing networks | |
| CN106162798A (en) | The joint Power distribution of radio sensing network energy acquisition node cooperation transmission and relay selection method | |
| CN102238683A (en) | Routing information acquisition and transmission method for wireless mesh network | |
| Hazra et al. | Exploring biological robustness for reliable multi-UAV networks | |
| CN113411766B (en) | Intelligent Internet of things comprehensive sensing system and method | |
| CN103826282B (en) | Set based on dump energy divides multi-hop routing method | |
| Cao Minh et al. | DISON: a self-organizing network management framework for wireless sensor networks | |
| Yang et al. | A path planning method for mobile sink in farmland wireless sensor network | |
| Sultan et al. | Wireless sensor networks designs and protocols: a survey |
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: 20121128 |