CN103297342A - Energy-saving ZigBee network tree topology formation method - Google Patents
Energy-saving ZigBee network tree topology formation method Download PDFInfo
- Publication number
- CN103297342A CN103297342A CN2013100659118A CN201310065911A CN103297342A CN 103297342 A CN103297342 A CN 103297342A CN 2013100659118 A CN2013100659118 A CN 2013100659118A CN 201310065911 A CN201310065911 A CN 201310065911A CN 103297342 A CN103297342 A CN 103297342A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- father node
- true
- great
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses an energy-saving ZigBee network tree topology formation method. According to the energy-saving ZigBee network tree topology formation method, the number of connected ZRs and the number of connected ZEDs are recorded in a neighbor table of a father node and sent through a beacon frame; when a child node joins in the network, a GreatNZR or a GreatNZED is selected preferentially as the father node of a TRUE; the beacon frame is monitored again after the child node joins the network successfully and a judgement is made, when the self is a ZR, the GreatNZR belongs to other father nodes of the TRUE, the father node of the self is not capable of joining into other nodes and connection requests of other nodes are available, network is disconnected, the GreatNZR is selected as a new father node of the TRUE, network addresses are distributed by the new father node, and the new father node rejoins in the network. Therefore, waste of network address resources is reduced, network capacity is fully utilized, and the phenomenon that energy of nodes close to the root is over-consumed due to the excessive depth of the network is avoided.
Description
Technical field
The present invention relates to a kind of ZigBee network tree topology formation method, especially a kind ofly avoid producing unnecessary isolated node to reach real network capacity and to avoid the long energy-conservation ZigBee network tree topology formation method of the network degree of depth.
Background technology
A low-speed wireless territory net (LR-WPAN) is as the main flow framework of current and even following wireless sensor network, and its most outstanding characteristics and requirement is exactly energy-conservation.Be the LR-WPAN of carrier with the ZigBee technology, its long working life, cost are low, and can carry out the network service of self-organizing and self-healing in extensive multiduty network environment.In the ZigBee network layer, the role of equipment in network classified: ZigBee telegon (ZigBee Coordinator-ZC), ZigBee router (ZigBee Router-ZR) and ZigBee terminal equipment (ZigBee End Device-ZED).ZC starts and controls whole network, storage networking relevant information, all working of responsible whole PAN telegon; ZR is responsible for transmission information and is connected with providing, and can connect telegon or other routers, also can admit the adding of child node simultaneously; ZED can send or reception information, but can not participate in routing procedure, can not connect any child node, can only connect telegon or router as child node.
The node that adds the ZigBee network is formed a logic tree by the association process that the MAC layer provides, when the node in the network allows a new node to add network, just formed set membership between them, each node that enters network can obtain 16 network addresss that are used for route and transfer of data that father node is its distribution.Therefore, logical tree structure is as shown in Figure 1 since a root node, and initiate node is as the child node that has node, and with this, tree structure goes from strength to strength.Straight links connection among Fig. 1 represents father-subrelation.Node A is root (root) node of whole tree structure, and Node B, C and D are 3 sons (Children) nodes of node A; Node D is father (Parent) node of node E; Node A and D are former generation (Ancestors) nodes of node E; Node F is offspring (Descendant) node of node C, and in like manner, all nodes beyond the node A all are the descendent node of node A.
When network formed, the ZigBee telegon at first will be stipulated 3 parameters as required: the child node number that each father node can connect at most
The routing node number that can connect at most in the child node
The depth capacity of network
Wherein
Should more than or equal to
, so just can guarantee telegon or router can connect at least (
-
) individual terminal node.
Be that the network degree of depth is
dFather node be side-play amount between its child node addresses distributed, can be by formula
Calculate.If a father node
Be 0 o'clock, just no longer possess the ability of distributing the address for its child node, namely can not allow other node add network by it again, new node can only be sought another father node; If a father node
Greater than 0 o'clock, then can accept other node became its child node, and will whether have routing capabilities to the different address of child node distribution according to child node.Utilize
As side-play amount, to the child node distribution network address with routing capabilities, it can be the address of first routing node distribution ratio related with it oneself big 1, the side-play amount of all being separated by between the address of related routing node with it afterwards
, be that all routing nodes distribute the address by that analogy.The network degree of depth one of regulation telegon is decided to be 0 in the ZigBee agreement, and its network address also one is decided to be 0.The address of supposing father node is
, for its
Individual routing node, its address assignment formula is as follows
Terminal node distributes the address and distributes the address different for routing node, the
nThe individual null terminator Null node address of association with it is
Can be calculated as follows
Fig. 2 provided one have maximum child node number (
) be 6, maximum routing node number (
) be 4, the network depth capacity (
) be 3 ZigBee network, utilize formula (1) to calculate
Be worth as shown in table 1.
Table 1
| The network depth d | Side-play amount Cskip (d) |
| 0 | 31 |
| 1 | 7 |
| 2 | 1 |
| 3 | 0 |
Parameter
The tree structure that has determined network from root to the jumping figure the farthest terminal node, distance just,
Determined the diameter of network indirectly.In Fig. 2, network design centered by the ZigBee telegon, so the scope of real network (diameter) be greater than
And less than 2
.
When a ZigBee node wanted to add a network, its can pass to other nodes in the one jumping communication range with the information that the form of broadcasting will ask to connect; Receive that other nodes that are present in the known network of request link information pass an information back can for the node require to add network; The ZigBee node that requires at last to add can return an adding information and become a full member of this network according to suitable father node of Information Selection of receiving again.In the process that these information (beacon frame) transmit mutually, this node just can learn therefrom that one jumps some essential informations of scope interior nodes and it is left in the pre-set space that is used for the storage information of neighbor nodes in the ZigBee structure, i.e. the neighbor table of this node.ZC and the ZR that has added network can periodically send beacon frame, can listen to beacon frame as the child node ZR or the ZED that are connected in the network.The content of neighbor table can certainly arrange some essential informations of neighbor node according to user's the reservation position of needs in beacon load subdomain according to the ZigBee agreement and definite.Yet, the set information of ZigBee neighbor table has extended address at present, the network address, node type, the relation of neighbor node and present node and link-quality indication (LQI) etc., but do not record ZR that father node connects and the number of ZED, namely as long as father node possesses the ability of distributing the address for its child node, just can become the father node of child node indiscriminately, be that father node reception child node is carried out at random, cause some node to distribute and become isolated node less than the address, cause the waste of network address resources, be far from the network capacity that reaches real; Perhaps cause the degree of depth of network long, the node energy near root is consumed excessively, severe patient finally causes network paralysis.
Shown in Figure 3 is exactly the exemplary of the existing problem of prior art, because node C adds the randomness of network, if the network depth capacity (
) be 2, node F just can not add network, makes node F become isolated node, has caused the waste of network address resources; And if the network depth capacity (
) be 3, node F can not become the child node of a hop node D, can only become the child node of two hop node C, causes the degree of depth of network long, and the node energy near root is consumed excessively.
Summary of the invention
The present invention is in order to solve the above-mentioned technical problem of existing in prior technology, to provide a kind of and avoid producing unnecessary isolated node to reach real network capacity and to avoid the long energy-conservation ZigBee network tree topology formation method of the network degree of depth.
Technical solution of the present invention is: a kind of energy-conservation ZigBee network tree topology formation method is characterized in that having the following steps:
A. the ZR number and the ZED number that connect of father node recording and sending
A1. in neighbor table, record the ZR that connects and the number of ZED;
A2. send beacon frame with the reservation position in the beacon load subdomain as Great NZR flag bit and Great NZED flag bit, when setting Great NZR is TRUE, expression again linking number more than 2 ZR, when Great NZED is TRUE, expression again linking number more than 2 ZED;
When b. child node adds network, carry out according to following steps successively:
B1. send and connect the network request and monitor beacon frame in the network;
B2. as having father node, the then minimum father node of chosen distance telegon jumping figure;
If the identical father node of no jumping figure, then by father node distribution network address, network adds successfully;
Do you if the identical father node of jumping figure is arranged, judge it oneself is ZR?
Not, then preferentially selecting Great NZED is the father node of TRUE, by father node distribution network address, adds the network success;
Be, then preferentially selecting Great NZR is the father node of TRUE, by father node distribution network address, adds the network success;
B3. monitor beacon frame again, when oneself be ZR, Great NZR is arranged is that other father node, oneself the father node of TRUE do not have ability to add other node and when the adding network request of other node is arranged, disconnecting network connection and selecting Great NZR is the new father node of TRUE, by new father node distribution network address, add the network success again; Otherwise, repeat the b3 step.
The present invention records the ZR number that connects and ZED number and sends by beacon frame in the neighbor table of father node; When child node added network, preferentially selecting Great NZR was that father node or the Great NZED of TRUE is the father node of TRUE; Node also will be monitored beacon frame and judgement after adding the network success again, be ZR as oneself, Great NZR is arranged is that other father node, oneself the father node of TRUE do not have ability to add other node and when the connection request of other node is arranged, disconnecting network connection and selecting Great NZR is the new father node of TRUE, father node distribution network address by new adds network again.The present invention avoids the overhead of network, its child node adds network selectively and can readjust the father node that connects as required, avoid node to can not get the address because of unreasonable distribution, then become unnecessary isolated node, reduce the waste of network address resources, reached real network capacity; Also can avoid the degree of depth of network long, the node energy near root is consumed excessively, finally cause the phenomenon of network paralysis.
Description of drawings
Fig. 1, Fig. 2, Fig. 3 are DESCRIPTION OF THE PRIOR ART figure.
Fig. 4 is the design sketch that embodiment of the invention network tree topology forms.
Fig. 5 is the flow chart of the embodiment of the invention.
Embodiment
As shown in Figure 4: the parameter of setting in the network is respectively Cm=4, Rm=3, Lm=2 or 3.The filling in of the generation of telegon (ZigBee Coordinator-ZC), the selection of channel, each node neighbor table, beacon frame sends and the equal same prior art of step such as father node distribution network address.Difference with the prior art is to carry out according to following steps:
A. the ZR number and the ZED number that connect of father node A, G, B, D recording and sending
A1. in neighbor table, record the ZR that connects and the number of ZED;
A2. send beacon frame as Great NZR flag bit and other 1bit as Great NZED flag bit with the 1bit in the reservation position in the beacon load subdomain, when setting Great NZR is TRUE, expression again linking number more than 2 ZR, when Great NZED is TRUE, expression again linking number more than 2 ZED;
When b. child node adds network, carry out according to step shown in Figure 5 successively:
B1. send and connect the network request and monitor beacon frame in the network;
B2. as having father node, the then minimum father node of chosen distance telegon jumping figure;
If the identical father node of no jumping figure, then by father node distribution network address, network adds successfully;
Do you if the identical father node of jumping figure is arranged, judge it oneself is ZR?
Not, then preferentially selecting Great NZED is the father node of TRUE, and next selects Great NZED is the father node of FALSE, and by father node distribution network address, network adds successfully;
Be, then preferentially selecting Great NZR is the father node of TRUE, and next selects Great NZR is the father node of FALSE, and by father node distribution network address, network adds successfully;
By father node distribution network address, add the network success;
B3. monitor beacon frame again, when oneself be ZR, Great NZR is arranged is that other father node, oneself the father node of TRUE do not have ability to add other node and when the adding network request of other node is arranged, disconnecting network connection and selecting Great NZR is the new father node of TRUE, by new father node distribution network address, add the network success again; Otherwise, repeat the b3 step.
Order with node C, E, F adds network successively, Lm=2 is example:
The network of node C adds step:
B1. node C sends connection request and monitors beacon frame in the network;
B2. find to exist father node B, D, father node B, D that chosen distance telegon jumping figure is minimum;
Because father node B, the father node that the D jumping figure is identical judge it oneself is ZR?
Node C is ZR, and then preferentially selecting Great NZR is the father node of TRUE, and because father node B, D are the father node that Great NZR is TRUE, then by father node D distribution network address, network adds successfully;
B3. node C monitors beacon frame again and judges, though node C is ZR and Great NZR is arranged is other father node B of TRUE, but whether the father node D of oneself also has the ability to add other node, no matter have the connection request of other node all not reconnect, and continues to monitor the beacon frame in the network.
The network of node E adds step:
B1. node E sends connection request and monitors beacon frame in the network;
At this moment, node C continues to monitor beacon frame and judges, though node C is ZR and Great NZR is arranged is other father node B of TRUE, other node but the father node D of oneself also has the ability to add, can't listen to simultaneously the connection request of node E again, so do not reconnect, still continue to monitor the beacon frame in the network;
B2. find to exist father node D, the minimum father node D of chosen distance telegon jumping figure then, because of the identical father node of no jumping figure, then by father node D distribution network address, network adds successfully;
B3. node E is after adding the network success, also continue to monitor beacon frame and judge, though node E oneself is ZR, the father node D ability of oneself does not add other node, but be other father node of TRUE because there not being Great NZR, the connection request that does not yet listen to other nodes does not reconnect, and continues to monitor.
The network of node F adds step:
B1. node F sends connection request and monitors beacon frame in the network;
At this moment, node E can not listen to the request of node F; And node C oneself is ZR because satisfying simultaneously, it is that other father node B, oneself the father node D of TRUE do not have ability to add other node and the connection request of node F is arranged that Great NZR is arranged, then disconnecting network connection and selecting Great NZR is that the Node B of TRUE is new father node, by new father node B distribution network address, add the network success again.
B2. node F finds to exist father node D, the minimum father node D of chosen distance telegon jumping figure then, and because of the identical father node of no jumping figure, then by father node D distribution network address, network adds successfully.
B3. node F owing to oneself be ZED, will no longer connect other nodes after adding the network success.
Even avoided Node B to have the ability to set up father node, node F can not add network, makes node F become isolated node, has caused the phenomenon of the waste of network address resources.
Order with node C, E, F adds network successively, Lm=3 is example:
The network of node C adds step:
B1. node C sends connection request and monitors beacon frame in the network;
B2. find to exist father node G, B, D, I, father node B, D that chosen distance telegon jumping figure is minimum;
Because father node B, the father node that the D jumping figure is identical judge it oneself is ZR?
Node C is ZR, and then preferentially selecting Great NZR is the father node of TRUE, and because father node B, D are the father node that Great NZR is TRUE, then by father node D distribution network address, network adds successfully;
B3. node C monitors beacon frame again and judges, though node C is ZR, it is other father node of TRUE that Great NZR is arranged, and the father node of oneself is capable other node that adds also, no matter whether there is the connection request of other node all not reconnect, continues to monitor the beacon frame in the network.
The network of node E adds step:
B1. node E sends connection request and monitors beacon frame in the network;
At this moment, node C continues to monitor beacon frame and judges, though oneself be ZR, it is other father node of TRUE that Great NZR is arranged, other node but the father node D of oneself also has the ability to add, simultaneously can't listen to the connection request of node E again, so do not reconnect, still continue to monitor the beacon frame in the network;
B2. find to exist father node D, the minimum father node D of chosen distance telegon jumping figure then, because of the identical father node of no jumping figure, then by father node D distribution network address, network adds successfully;
B3. node E is after adding the network success, also continue to monitor beacon frame and judge, though oneself be ZR, the father node D ability of oneself does not add other node, but because not listening to other father node that Great NZR is TRUE, the connection request that does not yet listen to other nodes does not reconnect yet, and continues to monitor;
The network of node F adds step:
B1. node F sends connection request and monitors beacon frame in the network;
At this moment, node E can not listen to the request of node F; And node C oneself be ZR because satisfying simultaneously, Great NZR is arranged is that other father node, oneself the father node D of TRUE do not have ability to add the connection request of other node and node F, then disconnecting network connection and selecting Great NZR is that the Node B of TRUE is new father node, by new father node B distribution network address, network adds success again.
B2. find to exist father node D, the minimum father node D of chosen distance telegon jumping figure then, because of the identical father node of no jumping figure, then by father node D distribution network address, network adds successfully.
B3. node F owing to oneself be ZED, will no longer connect other nodes after adding the network success.
Avoided node F to become the child node of father node C, avoided the degree of depth of network long, made near the outspent phenomenon of the node energy of root.
Claims (1)
1. energy-conservation ZigBee network tree topology formation method is characterized in that having the following steps:
A. the ZR number and the ZED number that connect of father node recording and sending
A1. in neighbor table, record the ZR that connects and the number of ZED;
A2. send beacon frame with the reservation position in the beacon load subdomain as Great NZR flag bit and Great NZED flag bit, when setting Great NZR is TRUE, expression again linking number more than 2 ZR, when Great NZED is TRUE, expression again linking number more than 2 ZED;
When b. child node adds network, carry out according to following steps successively:
B1. send and connect the network request and monitor beacon frame in the network;
B2. as having father node, the then minimum father node of chosen distance telegon jumping figure;
If the identical father node of no jumping figure, then by father node distribution network address, network adds successfully;
Do you if the identical father node of jumping figure is arranged, judge it oneself is ZR?
Not, then preferentially selecting Great NZED is the father node of TRUE, by father node distribution network address, adds the network success;
Be, then preferentially selecting Great NZR is the father node of TRUE, by father node distribution network address, adds the network success;
B3. monitor beacon frame again, when oneself be ZR, Great NZR is arranged is that other father node, oneself the father node of TRUE do not have ability to add other node and when the adding network request of other node is arranged, disconnecting network connection and selecting Great NZR is the new father node of TRUE, by new father node distribution network address, add the network success again; Otherwise, repeat the b3 step.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2013100659118A CN103297342A (en) | 2013-03-01 | 2013-03-01 | Energy-saving ZigBee network tree topology formation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2013100659118A CN103297342A (en) | 2013-03-01 | 2013-03-01 | Energy-saving ZigBee network tree topology formation method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103297342A true CN103297342A (en) | 2013-09-11 |
Family
ID=49097682
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2013100659118A Pending CN103297342A (en) | 2013-03-01 | 2013-03-01 | Energy-saving ZigBee network tree topology formation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103297342A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103476148A (en) * | 2013-09-24 | 2013-12-25 | 中国科学院上海微系统与信息技术研究所 | Wireless sensor network |
| CN104394604A (en) * | 2014-11-26 | 2015-03-04 | 武汉理工大学 | Wireless ad hoc network based electronic price biding system and communication method |
| CN105873027A (en) * | 2016-04-13 | 2016-08-17 | 南京大学 | Planning method for static Zigbee network |
| CN106341250A (en) * | 2015-07-10 | 2017-01-18 | 南宁富桂精密工业有限公司 | Network device and network address initialization allocation method |
| CN108024316A (en) * | 2017-11-30 | 2018-05-11 | 惠州市物联微电子有限公司 | A kind of tree topology wireless self-organizing network nodes enter network control method |
| CN108391299A (en) * | 2018-01-26 | 2018-08-10 | 乐鑫信息科技（上海）有限公司 | The method that isolated node is removed in Mesh network |
| CN111245663A (en) * | 2020-03-16 | 2020-06-05 | 国网四川省电力公司成都供电公司 | Dynamic construction method of video monitoring network |
| CN112492057A (en) * | 2020-11-16 | 2021-03-12 | 电子科技大学 | Address self-configuration method of fixed root node |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101868041A (en) * | 2010-05-14 | 2010-10-20 | 南京瀚之显电子科技有限公司 | Zigbee wireless sensor network of master and slave tree types, construction method and routing protocol |
| CN102076053A (en) * | 2011-02-18 | 2011-05-25 | 南京信息工程大学 | Method for quickly repairing Zigbee wireless sensor network |
-
2013
- 2013-03-01 CN CN2013100659118A patent/CN103297342A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101868041A (en) * | 2010-05-14 | 2010-10-20 | 南京瀚之显电子科技有限公司 | Zigbee wireless sensor network of master and slave tree types, construction method and routing protocol |
| CN102076053A (en) * | 2011-02-18 | 2011-05-25 | 南京信息工程大学 | Method for quickly repairing Zigbee wireless sensor network |
Non-Patent Citations (2)
| Title |
|---|
| LIU DAN: "An Efficient Improvement Approach for Topology Formation in zigBee Network", 《INFORMATION AND COMMUNICATION TECHNOLOGIES 2012 WORLD COFERENCE》 * |
| 刘丹: "基于网络层的低速个域网节能方法研究", 《基于网络层的低速个域网节能方法研究》 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103476148A (en) * | 2013-09-24 | 2013-12-25 | 中国科学院上海微系统与信息技术研究所 | Wireless sensor network |
| CN104394604A (en) * | 2014-11-26 | 2015-03-04 | 武汉理工大学 | Wireless ad hoc network based electronic price biding system and communication method |
| CN106341250A (en) * | 2015-07-10 | 2017-01-18 | 南宁富桂精密工业有限公司 | Network device and network address initialization allocation method |
| CN106341250B (en) * | 2015-07-10 | 2019-11-22 | 南宁富桂精密工业有限公司 | Network equipment and network address initialize distribution method |
| CN105873027A (en) * | 2016-04-13 | 2016-08-17 | 南京大学 | Planning method for static Zigbee network |
| CN105873027B (en) * | 2016-04-13 | 2019-03-29 | 南京大学 | A kind of planing method of static state Zigbee network |
| CN108024316A (en) * | 2017-11-30 | 2018-05-11 | 惠州市物联微电子有限公司 | A kind of tree topology wireless self-organizing network nodes enter network control method |
| CN108391299A (en) * | 2018-01-26 | 2018-08-10 | 乐鑫信息科技（上海）有限公司 | The method that isolated node is removed in Mesh network |
| CN108391299B (en) * | 2018-01-26 | 2020-05-22 | 乐鑫信息科技（上海）股份有限公司 | Method for removing isolated node in Mesh network |
| CN111245663A (en) * | 2020-03-16 | 2020-06-05 | 国网四川省电力公司成都供电公司 | Dynamic construction method of video monitoring network |
| CN112492057A (en) * | 2020-11-16 | 2021-03-12 | 电子科技大学 | Address self-configuration method of fixed root node |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103297342A (en) | Energy-saving ZigBee network tree topology formation method | |
| Zhixiang et al. | Three-layered routing protocol for WSN based on LEACH algorithm | |
| CN102185749B (en) | Method for avoiding routing loop by adopting tree topology relationship | |
| CN104080112A (en) | Method for improving service reliability of wireless self-organizing network | |
| CN104754688A (en) | Routing method for entangled state based wireless Mesh quantum communication network | |
| CN108174412A (en) | A kind of RPL multi-path data transmission mechanisms of load balancing | |
| US8340116B2 (en) | Node scheduling and address assignment within an ad-hoc communication system | |
| Kaur et al. | Clustering in wireless sensor networks-a survey | |
| Jaiswal et al. | An optimal QoS-aware multipath routing protocol for IoT based wireless sensor networks | |
| Al-Harbawi et al. | Improved tree routing (ImpTR) protocol for ZigBee network | |
| Del-Valle-Soto et al. | An efficient multi-parent hierarchical routing protocol for WSNs | |
| Spandan et al. | Data aggregation protocols in wireless sensor networks | |
| Elhabyan et al. | Weighted tree based routing and clustering protocol for WSN | |
| Khan et al. | Minimum spanning tree based routing strategy for homogeneous WSN | |
| Wang et al. | An energy-balanced ant-based routing protocol for wireless sensor networks | |
| Abusaimeh et al. | Balancing the power consumption speed in flat and hierarchical WSN | |
| Afsar | Effective data aggregation using a hierarchical multi-layered scheme for large-scale sensor networks | |
| Bachir et al. | Localized max-min remaining energy routing for wsn using delay control | |
| Mishra et al. | Fault tolerant multi cluster head data aggregation protocol in WSN (FMCDA) | |
| Chaudet et al. | Building an efficient overlay for publish/subscribe in wireless sensor networks | |
| Avinash et al. | Performance analysis of different routing protocols in cognitive radio networks | |
| CN113225721B (en) | Networking and data communication implementation method of Bluetooth chain network | |
| Kang et al. | Structure-based id assignment for sensor networks | |
| Bajaber et al. | Distributed energy balanced clustering for wireless sensor networks | |
| Sampath et al. | Energy efficient routing strategies for large scale wireless sensor in heterogeneous networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20130911 |
|
| RJ01 | Rejection of invention patent application after publication |