CN107801227A - A kind of routing scheduling method towards wireless sensor network stratification analysis - Google Patents
A kind of routing scheduling method towards wireless sensor network stratification analysis Download PDFInfo
- Publication number
- CN107801227A CN107801227A CN201710891080.8A CN201710891080A CN107801227A CN 107801227 A CN107801227 A CN 107801227A CN 201710891080 A CN201710891080 A CN 201710891080A CN 107801227 A CN107801227 A CN 107801227A
- Authority
- CN
- China
- Prior art keywords
- node
- base station
- wireless sensor
- trip current
- sensor network
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- 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
Abstract
The present invention relates to a kind of routing scheduling method towards wireless sensor network stratification analysis, establish trip current using hierarchical parsing approach, trip current using the dump energy of neighbor node, the transmission energy for needing to consume, to base station distance and node degree as key factor.Using the element value of trip current eigenvalue of maximum character pair vector as the weight of three factors, the performance weights of each neighbor node are calculated, and carry out hierarchical ranking and consistency check.In the performance weights of all neighbor nodes, that node of performance maximum weight will be chosen as the via node of next-hop.The present invention can effectively improve node energy consumption, and finally improve the network life of wireless sensor network.
Description
Technical field
The present invention relates to wireless sensor network technology field, more particularly to one kind towards wireless sensor network stratification
The routing scheduling method of analysis.
Background technology
With increasingly ripe and the 5G epoch the arrival of 4G technologies, weight of the wireless sensor network as Future cellular networks
The problem of wanting one of part, especially improving the wireless sensor network life-span turns into the heat of wireless sensor network research already
Point and emphasis.Wireless sensor network is that a kind of node is realized in a manner of dynamic, Automatic-searching optimal path to base station transmission
New network is gathered, is widely used in the numerous areas such as military affairs, Industry Control, agricultural production.The limited energy of node supplies
Traditional routing algorithms should be caused can not to directly apply to wireless sensor network with disposal ability characteristic.Therefore, how to be saved in source
Difficult point of the effective route as research is found between point and base station.Traditional routing algorithm for wireless sensor is based on most short
Road thought, some nodes of network can be caused dead because of depleted of energy, and then it is multiple isolated to cause network to be divided into
Sub-network, have a strong impact on the connectedness and stability of network.Therefore, the research to the routing algorithm of node energy consumption has weight
The meaning wanted.
According to the mode of establishing of route, Wireless Sensor Network Routing Protocol can be divided into proactive routing protocol and reaction
Formula Routing Protocol.Existing Routing Protocol is divided into proactive routing protocol and Reactive routing protocols.Proactive routing protocol is again
Referred to as Proactive routing protocols or Table Driven agreement, in this agreement, using the packet of periodic broadcast route requests
Strategy, to tackle the change of topological structure, safeguard newest route.Proactive routing protocol is regardless of whether have communication requirement, often
The all periodic broadcast route request packet of individual node, the newest route of real-time servicing all nodes into network.Conventional master
Dynamic formula Routing Protocol includes DSDV agreements and OLSR agreements etc..Reactive routing protocols are also known as on-demand routing protocol, so-called " to press
Need " mean, route discovery is just only carried out when node needs communication, the Maintenance free route letter if it need not communicate
Breath.When source node needs to send data, local routing table is first checked with the presence or absence of available route, if there is then direct hair
Send, if there is no then broadcast route request bag, packet is retransmited after finding available route.Also, node only needs
Store the routing iinformation of required destination node.Therefore, Reactive routing protocols can be very good to adapt to energy, bandwidth and storage
Etc. resource-constrained, and node motion more frequently wireless network environment.Compared with proactive routing protocol, reaction equation route association
View reduces routing cost and storage overhead, saves energy resource, is suitable for the wireless environment that topology frequently changes.Cause
This, is normally limited for resources such as the energy of node, bandwidth, storages, and the fast-changing scene of network topology, reaction equation
Routing Protocol is more preferable than proactive routing protocol performance.Conventional Reactive routing protocols have the agreements such as DSR and AODV.
The content of the invention
The technical problems to be solved by the invention are to provide a kind of route towards wireless sensor network stratification analysis and adjusted
It degree method, can effectively improve node energy consumption, improve the network life of wireless sensor network.
The technical solution adopted for the present invention to solve the technical problems is：There is provided a kind of towards wireless sensor network stratification
The routing scheduling method of analysis, comprises the following steps：
(1) judge whether base station is reachable：According to source node and the relative position of base station, judge base station whether in the node
In reliable communication range；If source node directly terminates with base station communication, current route establishment process；Otherwise, step is turned to
Suddenly (2), the preferable node of performance is selected from neighbor node as next-hop；
(2) trip current is established：Transmission energy, the distance to base station that statistics neighbor node dump energy, needs consume
With the data of three key factors of node degree, then adjust statistics value and remove data dimension, by the data two after processing
Two do ratio after construct trip current；The eigenvalue of maximum of trip current and corresponding characteristic vector are asked, according to characteristic value inspection
Whether trip current is consistency matrix；If it is inconsistent, readjust statistics；Otherwise, step (3) is continued to；
(3) neighbor node of maximum performance weights is sought：Using three elements of characteristic vector in step (2) as described
The weighted value of three key factors, the performance weights of each neighbor node are calculated, then obtain the neighbour with maximum performance weights
Node is occupied, the node is optimal next-hop node；Judge whether present node can directly carry out reliable communication with base station；If
Cannot, then step (1) is gone to, based on present node, continues to select the via node of next-hop；Otherwise, current route
The process of foundation terminates.
Trip current is in the step (2)：Wherein, And Gi' represent to remove neighbor node dump energy after data dimension respectively, need the transmission energy that consumes
Amount, to the distance and node degree of base station.
By consistency checking index checking trip current whether it is consistency matrix in the step (2), wherein unanimously
Sex determination index is：RI is Distribution Value, λmaxIt is consistency matrix AiEigenvalue of maximum, p for key
The number of factor；As consistency ration value CR ＜ 0.1, then it represents that trip current meets coherence request.
Also include between the step (2) and step (3)：One constituent element element is obtained to certain in its last layer according to trip current
The weight vectors of element, the weight order of each scheme in lowermost layer for target is finally given, and carry out consistency checking realization
The step of Scheme Choice.
Beneficial effect
As a result of above-mentioned technical scheme, the present invention compared with prior art, has the following advantages that and actively imitated
Fruit：Transmission energy, the distance of neighbor node to base station that the present invention has considered the dump energy of neighbor node, needs consume
With the degree of neighbor node, the method that this four factors are analyzed by stratification is quantified, structure has uniformity characteristic
Trip current, finally selection have via node of the neighbor node of preferable performance as next-hop.The present invention effectively improves
Node energy consumption in network, increases network life.
Brief description of the drawings
Fig. 1 is the flow chart of the present invention；
Fig. 2 is stratification analysis model figure；
Fig. 3 is the detection zone schematic diagram with 100 sensor node random distributions.
Embodiment
With reference to specific embodiment, the present invention is expanded on further.It should be understood that these embodiments are merely to illustrate the present invention
Rather than limitation the scope of the present invention.In addition, it is to be understood that after the content of the invention lectured has been read, people in the art
Member can make various changes or modifications to the present invention, and these equivalent form of values equally fall within the application appended claims and limited
Scope.
Embodiments of the present invention are related to a kind of nodal hierarchy routing scheduling method towards mobile Ad hoc network, such as Fig. 1
It is shown, comprise the following steps：(1) judge whether source node and base station directly can reliably communicate；(2) mould is analyzed into stratification
Type is applied in four key factors of neighbor node, is built trip current and is calculated the performance weights of each neighbor node；(3)
Whether via node of node of the selection with maximum performance weights as next-hop, can be direct according to via node and base station
Ground reliable communication determines whether current route establishment process terminates.
Wherein, stratification analysis model is as shown in Fig. 2 be divided into three layers：Neighbor node performance weights are the destination layers of model；
Next layer is the factor layer of model, including the dump energy of neighbor node, needs the transmission energy, the neighbor node to base station that consume
Distance and neighbor node degree, four key factors；The bottom is the node of n neighbor node, wherein performance maximum weight
The via node of next-hop can be turned into.
As shown in figure 3, a wireless sensor network detecting system being made up of 100 network nodes, network are built below
Node is equably deployed in length of side 100m square areas, with node viExemplified by, emulation mould is carried out by MATLAB softwares
Intend calculating, to further illustrate the present invention.
Step 1：If node viWith base station (BS) node v0Distance be di, d0Represent the reference value of threshold distance, then two
The link relation of person judges according to following：
In the present embodiment, di0=57, d0=40,It is to meet the least energy that node is received and sent messages,WithRepresent respectively
Node viAnd vjDump energy.Although node viWith base station (BS) node v0Energy be satisfied by requiring, but di0＞ d0, because
This mi0=0, it is therefore desirable to find the neighbor node of better performances as via node.
Step 2：In node viReliable communication range in GiIndividual node constructs neighbor node set Vi={ v1',v
'2,…,v'j,…,v'Gi}。
The degree of transmission energy, neighbor node to base station distance and neighbor node that neighbor node dump energy, needs consume,
The data point reuse of four key factors and the operation of removal dimension are as follows：
In formula,It is node viNeighbor node v'jDump energy,It is node viNeighbor node v'jNeed to consume
Transmission energy, d (j, 0) is node viNeighbor node v'jTo base station v0Distance, GjIt is node viNeighbor node v'jDegree.
Then trip current is
Wherein,And Gi' represent to go respectively
Transmission energy, the distance and node degree to base station consumed except the neighbor node dump energy after data dimension, needs.
AiEigenvalue of maximum and corresponding characteristic vector be Wi=[w1 w2 w3 w4].Consistency checking index is：
RI is Distribution Value, λmaxIt is consistency matrix AiEigenvalue of maximum, p represent this method
The number of key factor, value 4.
In formula, the reference such as following table of RI Distribution Values, the n in form represents the quantitative value of key factor.
| n | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
| RI | 0 | 0 | 0.58 | 0.90 | 1.12 | 1.24 | 1.32 | 1.41 | 1.45 |
As consistency ration value CR<When 0.10, matrix AiMeet uniformity property, without adjusting again, otherwise to adjust
Trip current AiValue.Calculate node viEach neighbor node performance weights, calculation is as follows：
Step 3：According to being directed to node v in step 2iAll neighbor nodes performance weights, obtain with maximality
The node of energy weights：
Check base station v0Whether in nodeReliable communication range in.If, directly with base station v0Communication；Otherwise,
Step 1 is continued to, until reliable communication can be carried out with base station.
It is noted that the step of also including selecting scheme in step 2 and step 3, be specially：According to
Trip current obtains weight vectors of the constituent element element to certain element in its last layer, finally gives in lowermost layer each scheme for mesh
Target weight order, so as to carry out Scheme Choice.
Total weight order from top to down will be synthesized the weight under single criterion.
Key factor totally 4, their total hierarchial sorting weight are respectively [a1a2a3a4].Neighbor node includes n
[B1,…,Bn], they are respectively [b on the Mode of Level Simple Sequence weight of key factor1j,…,bnj].Now ask each in neighbor node
Weight of the factor on general objective, that is, seek the total hierarchial sorting weight [b of each factor of neighbor node1,…,bn], upper table institute is pressed in calculating
The mode of showing is carried out, i.e.,Total hierarchial sorting is also needed to make consistency check, examined still as level is always arranged
Sequence is successively carried out by high level to low layer like that.It is because while that each level has been subjected to the consistency check of Mode of Level Simple Sequence,
It is each that relatively judgment matrix all has more satisfied uniformity in pairs.But when integrated survey, the nonuniformity of each level is still
It is possible to accumulate, causes the more serious nonuniformity of final analysis result.
If in neighbor node the factor related with key factor in pairs compared with judgment matrix in single sequence through uniformity
Examine, it is CI (j) to try to achieve single sequence coincident indicator, and (j=1 ..., m), corresponding Aver-age Random Consistency Index is RI (j)
(CI (j), RI (j) try to achieve in Mode of Level Simple Sequence), then the neighbor node random consistency ration that always sorts be：
As CR ＜ 0.10, it is believed that total hierarchial sorting result has relatively satisfactory uniformity and receives the analysis result.
For raising of the prominent present invention to raising network communication of wireless sensor performance, now select the net of inventive network
Network life cycle is performance indications compared with LEACH the and HEED routing algorithms of classics.Sent out by MATLAB simulation calculations
In existing, the of the invention network life life-span, 25% is integrally lifted than LEACH routing algorithm, is integrally lifted than HEED routing algorithm
20%.As can be seen here, wireless sensor network routing scheduling algorithm of the invention is obviously improved to network life；Particularly pair
In large-scale wireless self-organization network, its performance boost effect becomes apparent.
Traditional wireless sensor and actor networks by dispatching algorithm largely simply consider single capacity factor or apart from because
Element, it is impossible to reflect the full characterization of wireless sensor network interior joint as much as possible, so cause in selection next-hop relaying section
The node with superperformance can not be selected when point as much as possible, so that the part of nodes in network is because energy consumes
To the greatest extent prematurely " death ", the connectedness of network is destroyed.Compared to traditional radio sensor network algorithm, road proposed by the present invention
By algorithm synthesis consider neighbor node dump energy, need consume transmission energy, the distance of neighbor node to base station and
The degree of neighbor node, the method that this four factors are analyzed by stratification is quantified, structure sentencing with uniformity characteristic
Set matrix, finally selection have via node of the neighbor node of preferable performance as next-hop.The present invention effectively improves
Node energy consumption in network, increases network life.
Claims (4)
1. a kind of routing scheduling method towards wireless sensor network stratification analysis, it is characterised in that comprise the following steps：
(1) judge whether base station is reachable：According to source node and the relative position of base station, judge base station whether in the reliable of the node
In communication range；If source node directly terminates with base station communication, current route establishment process；Otherwise, step is turned to
(2) the preferable node of performance, is selected from neighbor node as next-hop；
(2) trip current is established：Transmission energy, the distance and section to base station that statistics neighbor node dump energy, needs consume
The data of point three key factors of degree, then adjust statistics value and remove data dimension, the data after processing are done two-by-two
Trip current is constructed after ratio；The eigenvalue of maximum of trip current and corresponding characteristic vector are asked, is judged according to characteristic value inspection
Whether matrix is consistency matrix；If it is inconsistent, readjust statistics；Otherwise, step (3) is continued to；
(3) neighbor node of maximum performance weights is sought：Using three elements of characteristic vector in step (2) as described three
The weighted value of key factor, the performance weights of each neighbor node are calculated, then obtain the neighbours with maximum performance weights and save
Point, the node are optimal next-hop node；Judge whether present node can directly carry out reliable communication with base station；If can not
Then to go to step (1), based on present node, continue to select the via node of next-hop；Otherwise, current Route establishment
Process terminates.
2. the routing scheduling method according to claim 1 towards wireless sensor network stratification analysis, it is characterised in that
Trip current is in the step (2)：Wherein, With
Gi' respectively represent remove data dimension after neighbor node dump energy, need consume transmission energy, to base station distance and
Node degree.
3. the routing scheduling method according to claim 1 towards wireless sensor network stratification analysis, it is characterised in that
By consistency checking index checking trip current whether it is consistency matrix in the step (2), wherein consistency checking refers to
It is designated as：RI is Distribution Value, λmaxIt is consistency matrix AiEigenvalue of maximum, p be key factor
Number；As consistency ration value CR ＜ 0.1, then it represents that trip current meets coherence request.
4. the routing scheduling method according to claim 1 towards wireless sensor network stratification analysis, it is characterised in that
Also include between the step (2) and step (3)：Power of the one constituent element element to certain element in its last layer is obtained according to trip current
Weight vector, the weight order of each scheme in lowermost layer for target is finally given, and carry out consistency checking implementation selection
The step of.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710891080.8A CN107801227B (en) | 2017-09-27 | 2017-09-27 | Routing scheduling method for hierarchical analysis of wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710891080.8A CN107801227B (en) | 2017-09-27 | 2017-09-27 | Routing scheduling method for hierarchical analysis of wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107801227A true CN107801227A (en) | 2018-03-13 |
| CN107801227B CN107801227B (en) | 2021-01-26 |
Family
ID=61532652
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710891080.8A Active CN107801227B (en) | 2017-09-27 | 2017-09-27 | Routing scheduling method for hierarchical analysis of wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107801227B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109099967A (en) * | 2018-07-25 | 2018-12-28 | 梧州市兴能农业科技有限公司 | A kind of intelligent monitor system of Table Grape Cold Chain Logistics |
| CN111901846A (en) * | 2020-07-31 | 2020-11-06 | 浙江鑫网能源工程有限公司 | Ad-hoc network system adopting multiple NB-IoT node gateways |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130170504A1 (en) * | 2010-09-22 | 2013-07-04 | Fujitsu Limited | Routing method and node equipment |
| CN104093188A (en) * | 2014-07-18 | 2014-10-08 | 东北电力大学 | Novel cluster head election method for wireless sensor networks |
| CN105323818A (en) * | 2015-11-04 | 2016-02-10 | 天津理工大学 | Energy-saving clustering routing method based on network regional division and distances |
| US20160337875A1 (en) * | 2013-12-23 | 2016-11-17 | Orange | A method for configuring a network comprising several nodes, a method for transmitting data in said network, and corresponding equipment and computer program |
-
2017
- 2017-09-27 CN CN201710891080.8A patent/CN107801227B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130170504A1 (en) * | 2010-09-22 | 2013-07-04 | Fujitsu Limited | Routing method and node equipment |
| US20160337875A1 (en) * | 2013-12-23 | 2016-11-17 | Orange | A method for configuring a network comprising several nodes, a method for transmitting data in said network, and corresponding equipment and computer program |
| CN104093188A (en) * | 2014-07-18 | 2014-10-08 | 东北电力大学 | Novel cluster head election method for wireless sensor networks |
| CN105323818A (en) * | 2015-11-04 | 2016-02-10 | 天津理工大学 | Energy-saving clustering routing method based on network regional division and distances |
Non-Patent Citations (2)
| Title |
|---|
| 朱文志: ""无线传感器网络多路径路由协议研究"", 《信息科技辑》 * |
| 马振: ""基于多跳的无线传感器网络路由协议研究"", 《信息科技辑》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109099967A (en) * | 2018-07-25 | 2018-12-28 | 梧州市兴能农业科技有限公司 | A kind of intelligent monitor system of Table Grape Cold Chain Logistics |
| CN111901846A (en) * | 2020-07-31 | 2020-11-06 | 浙江鑫网能源工程有限公司 | Ad-hoc network system adopting multiple NB-IoT node gateways |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107801227B (en) | 2021-01-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106454905B (en) | A kind of improved wireless sense network hierarchical multichain path method | |
| CN104394566B (en) | A kind of low power consumption adaptive clustering and multi-hop wireless sensor network topology control method based on fuzzy decision | |
| Mazinani et al. | FMCR-CT: An energy-efficient fuzzy multi cluster-based routing with a constant threshold in wireless sensor network | |
| CN1299478C (en) | Route searching of detgredd of node based on radio self-organizing network and maitenance method thereof | |
| Tong et al. | A cross unequal clustering routing algorithm for sensor network | |
| CN109673034A (en) | A kind of wireless sensor network cluster routing method that must be searched for based on longicorn | |
| Torkestani | An adaptive backbone formation algorithm for wireless sensor networks | |
| Avokh et al. | Dynamic balanced spanning tree (DBST) for data aggregation in wireless sensor networks | |
| CN105979539B (en) | Based on the cluster-dividing method of fuzzy logic in mobile ad-hoc network | |
| Nabavi | An optimal routing protocol using multi-objective whale optimization algorithm for wireless sensor networks | |
| CN108616893A (en) | A kind of topology control method of high energy efficiency | |
| CN107801227A (en) | A kind of routing scheduling method towards wireless sensor network stratification analysis | |
| Rezaei et al. | Multi-hop routing algorithm using steiner points for reducing energy consumption in wireless sensor networks | |
| CN103369619B (en) | A kind of method based on degree self-adaptative adjustment dynamic aggregation tree | |
| Shahverdy et al. | A new paradigm for load balancing in WMNs | |
| CN116647890A (en) | Multi-attribute multi-metric routing decision method suitable for mobile AdHoc network | |
| CN106686652B (en) | Wireless sensor network topology control method | |
| Razooqi et al. | Enhanced Ant Colony Optimization for Routing in WSNs An Energy Aware Approach. | |
| Sedighimanesh et al. | Improving wireless sensor network lifetime using layering in hierarchical routing | |
| CN105722173A (en) | Large-scale WSNs topology control method based on two-way attraction mechanism | |
| Huang et al. | Creating small-world model for homogeneous wireless sensor networks | |
| Shi et al. | A clustering algorithm of ad-hoc network based on honeycomb division | |
| Nalluri et al. | An efficient energy saving sink selection scheme with the best base station placement strategy using tree based self organizing protocol for IoT | |
| Tiwari et al. | Comparison of clustering routing protocol in sensor networks: A study | |
| Mask et al. | The importance of energy efficient in wireless sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |