CN107181613A - A kind of kautz tree topology control methods based on wireless sensor network - Google Patents
A kind of kautz tree topology control methods based on wireless sensor network Download PDFInfo
- Publication number
- CN107181613A CN107181613A CN201710324690.XA CN201710324690A CN107181613A CN 107181613 A CN107181613 A CN 107181613A CN 201710324690 A CN201710324690 A CN 201710324690A CN 107181613 A CN107181613 A CN 107181613A
- Authority
- CN
- China
- Prior art keywords
- kautz
- node
- trees
- tree
- topology
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/42—Loop networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/44—Star or tree networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- 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 invention discloses a kind of kautz tree topology control methods based on wireless sensor network, comprise the following steps：S1, one balance kautz tree of construction and correlation kautz ring structures；The tree network topology of S2, the n node based on imperfect kautz trees, the further general topology of design one kind referred to as BKTW (A BALANCED KAUTZ TREE BASED WSA)；S3, the topological structure for managing and adjusting BKTW.Each node according to topology rule safeguard d+2 (1 forerunner, 1 it is follow-up, d go out neighbours) individual connection, for supporting robustness.The topology supports any number of node, for supporting scalability, to handle the uncontrolled dynamic operation of node, the addition of such as node, exits and failure.The characteristics of this Topology Control has distribution, localization, low energy consumption, strong scalability.
Description
Technical field
The present invention relates to wireless senser field, and in particular to a kind of kautz tree topologies based on wireless sensor network
Control method.
Background technology
Wireless sensor network (Wireless Sensor Network/WSN) is made up of all multinodes, between node
Network topology structure is constituted, connection here refers to that the mutual signal of node covers the wireless connection to be formed, to net
The research of network Topology Control, present invention be directed to that ensuring the robustness of wireless sensor network in dynamic environment and correct
Property.Wireless sensor network is including industrial and agricultural production, and medical treatment ＆ health, Homeland Security is prevented and reduced natural disasters, home security, space
The numerous areas such as exploration and environmental protection has substantial amounts of application to attempt.
Wireless sensor network is all unattended in whole deployment, running, it is desirable to which sensor node must pass through
Local information completes constructing network topology in the form of self-organizing, and Monitoring Data is beamed back into control section in the way of wireless multi-hop
Point.Meanwhile, node failure, new node are added, node all makes wireless sensor network be faced with frequently the problems such as exit, can not be pre-
The topologies change seen.How Topology Control exactly sensor node to be solved, which builds network to self-organizing, is opened up
Flutter, which kind of topological structure can more effectively tackle node failure, which kind of topological structure is more beneficial for improving scalability and subtracted
The maintenance costs of few network.
But existing tree topology control algolithm discusses less to robustness.MST is minimum spanning tree, and MST possesses most
Small side right value sum, Prim algorithms and Kruskal algorithms are the MST generating algorithms of well known given figure.In MST structures
In, arbitrary node only one of which father node, arbitrary node failure will all be isolated all child nodes for causing the node.FT
The hop count sum that (Fat Tree) pursues all nodes to root node (base station) is minimum, and not all linkage length sum is minimum,
So make it that influence of the node failure to network connectivty is minimum.RBT (Robust Spanning Tree) integrates certain nodal point separation
From base station hop count, linkage length is used as link metric between the node and father node.The node nearer apart from base-station node is preferentially selected
Select the less path of intermediate node by data delivery return base station, apart from the node prioritizing selection linkage length of base-station node farther out compared with
Short link, is finally reached the balance of communication energy consumption, time delay (apart from base-station node hop count) and topological structure robustness.FT with
Though RBT can improve drawbacks described above to a certain extent, the leeway being also improved in performance.
The content of the invention
It is an object of the invention to overcome the shortcoming and deficiency of prior art there is provided it is a kind of robust, expansible based on
The kautz tree topology control methods of wireless sensor network.
The topological structure that Topology Control Algorithm is generated, researcher proposes openness, flatness, low node number of degrees etc.
It is required that, therefore, it is proposed to which the topology based on the stationary nodes number of degrees, mutual with other in the interference networks of the existing fixed number of degrees
Networking network is compared, and kautz figures have many unique topologicaies property.But the nodes of kautz figures are set-points, by node degree
Number and network diameter are determined.In fact, we can not ensure how many node adds wireless senser within the given time
Network (WSN), because WSN is typically dynamic, sensor node is frequently added and exited.In order to solve this problem, we
Balance kauzt trees and kautz ring structures, simulation Kautz figures are make use of, and ensures the wireless sensor network in dynamic environment
Robustness and correctness.Based on balance kautz trees and kautz ring structures, BKTW (A BALANCED KAUTZ are devised
TREE-BASED WSA), a kind of network topology effectively with stalwartness, it remains the desirable attributes of kautz figures, such as optimal straight
Footpath and fixed out-degree.The dynamic behaviour of node is handled using Topology Control Algorithm (node is added, exited).
A kind of kautz tree topology control methods based on wireless sensor network, comprise the following steps：
S1, one balance kautz tree of construction and correlation kautz ring structures；
S2, the n node based on imperfect kautz trees, further design a kind of general topology and are referred to as BKTW (A
BALANCED KAUTZ TREE-BASED WSA) tree network topology；
S3, the topological structure for managing and adjusting BKTW (A BALANCED KAUTZ TREE-BASED WSA).
Further, the step S3 includes：The extension and contraction of node scale, the addition of node, are exited and failure.
Further, the out-degree and in-degree of the balance kautz tree nodes are 2.
Further, the root node of the balance kautz trees has 3 child nodes, and each internal node at most has 2 sons
Node.
Further, the kautz rings are the sequence that node presses inverse time needle sort.
Further, balance kautz trees include complete kautz trees and imperfect kautz trees.
Further, complete kautz trees degree is 2, a diameter of 2；Imperfect kautz trees degree is 2, a diameter of 3, leaf node
Quantity is at least 6, is at most 12.
Further, leaf node of the sensor maps to the balance kautz trees.
Further, BKTW is the wireless sensor network topology based on the balance kautz trees.
Further, BKTW topological structure be node retain with its forerunner, it is follow-up and 2 go out neighbours altogether 4 connect；
On the other hand, its forerunner, it is follow-up and enter neighbours also keep with node altogether 4 be connected.
The present invention has the following advantages and effect relative to prior art
BKTW is an efficient network topology of robust, its all leaf node based on balance Kautz trees；In dynamic environment
In, it hasNetwork diameter and d+2 node out-degree.Average route distance compares logdN route away from
From short, and close to the route distance of complete Kautz digraphs.The delay of new node addition and message cost are at most respectively
2kl+ d+1 and 2kl+2d+2.The delay and message cost that processing node is exited at most are respectively (d-1) × kl+ d and d × (kl+
1).The delay of handling failure node and message cost are respectively 3kl+ d-1 and 3kl+d+1。
Brief description of the drawings
Fig. 1 is a kind of kautz tree topology control method flow charts based on wireless sensor network；
Fig. 2 is kautz trees and kautz ring figures；
Fig. 3 is algorithm 2, and the algorithm pattern of kautz rings is constructed in complete kautz trees；
Fig. 4 is complete kautz trees Ktree (2,2) and incomplete kautz trees IKtree (2,3,6) figure；
Fig. 5 is BKTW topology diagram.
Embodiment
With reference to embodiment and accompanying drawing, the present invention is described in further detail, but embodiments of the present invention are not limited
In this.
A kind of kautz tree topology control methods based on wireless sensor network, reference picture 1, it is comprised the steps of：
S1, one balance kautz tree of construction and correlation kautz ring structures；
S2, the n node based on imperfect kautz trees, further design a kind of general topology and are referred to as BKTW (A
BALANCED KAUTZ TREE-BASED WSA) tree network topology, the quantity of node is also arbitrary value；
S3, the topological structure for managing and adjusting BKTW (A BALANCED KAUTZ TREE-BASED WSA).
More specifically, following steps decomposition is referred to：
S1, construction balance kautz trees：Fig. 2 (a), Fig. 2 (b) and 2 (c) depict a unbalanced kautz tree respectively,
Balance but incomplete kautz trees and a balance and complete kautz trees.
Give a node x=xk...x2x1,A label is produced for its i-th child node so that for 1≤
I≤d,If meeting one of following the first two condition, Otherwise
(1)xk<x1-i+1≤x1
(2)x1<xkAnd xk-d-1<x1-i+1
OperationWithExpression travels through the node of Far Left and rightmost when m is walked from node x.OperationRepresent any i peer-to-peer x in itself, for exampleWithEqual to x in itself.Ergodic process is always selected often
First child in individual step reaches leftmost node, and selects last child in each step to reach rightmost
Node.For example,Represent the node 020,101,212 in Fig. 2 (c)； Represent the node 210,021,102 in Fig. 2 (c).
Such as Fig. 3, as follows in the constitution step of complete kautz trees kautz rings.
If the node x=x at rank kkxk-1...x2x1Last child node of its father node, then can be with
Node x right adjacent node is found after a circulation in algorithm 2.Otherwise, problem becomes to find node at rank k-1
xk-1...x2x1Right adjacent node yk-1...y2y1, then from node yk-1...y2y1Found during one step of traversal downwards leftmost
Node.If node xk-1...x2x1It is not its father node xk-2...x2x1Last child node, algorithm 2 will follow at one
Find right adjacent node after ring, and after being circulated at two responsive node x right side adjacent node.Otherwise, problem is at rank k-2
Find node xk-2...x2x1Right adjacent node yk-2...y2y1, then from node yk-2...y2y1Looked for during two steps of traversal
To leftmost node, etc..If node x represents to pass through node x from rank k any node1The path arrived to root node
One of middle rightmost, algorithm 2 is itself and the right adjacent node of another node distribution, and the node on behalf leads to from k grades of arbitrary nodes
Cross node (x1+ 1) mod (d+1) leftmost nodes into the path of root node.For example, 102 be such in Fig. 2 (c)
Node, and its right adjacent node is node 020, represent from k=3 grades of all nodes into the path of all root nodes it is most left
The node on side.In such a case, it is possible to find node x right adjacent node after being circulated at k-1 times.
S2, the me common networlc topologies BKTW construction rules based on incomplete kautz trees IKTree (d, k, n) are as follows：
For each peer-to-peer x=xk...x2x1, it maintains the total d+2 chain for going out neighbours to its forerunner, follow-up and d
Connect.Forerunner and follow-up determine in a distributed way.If node x right side adjacent node y=Radjacent (x) is not present in
In tree, then node y right side adjacent node z=Radjacent (y) is found.If node z is not appeared in tree, find
Its right adjacent node, the rest may be inferred.Node x forerunner can be found with similar method.
It is the peer-to-peer for meeting one of following condition that d, which go out neighbours,.For 1≤i≤d, condition is as follows.
If 1) peer-to-peerAppear in overlay network, then it is that i-th of peer-to-peer x goes out neighbours；
2) otherwise, ifAnd its forerunner y has the public suffix that length is k-1, then peer-to-peer y is to go out neighbour i-th
Occupy.
3) otherwise, ifAnd its follow-up z has the public suffix that length is k-1, then peer-to-peer z is to go out neighbour i-th
Occupy.
WithIt is defined as follows.
Represent for 1≤i≤d,Operation.If meeting one of following condition, Otherwise,
(1)xk<xk+i-1≤x1
(2)x1<xkAnd xk+i-1<x1+d+1
It is given Expression makes for 1≤i≤dBehaviour
Make.
S3, topology adjustment：As shown in figure 4, by the way that first child node of each leaf node is added into complete Kautz
In tree, it can directly extend KTree (d, k) to realize incomplete Kautz trees IKTree (d, k+1, dk+dk-1).In order to extend
BKTW topological structure, introduces the efficient solutions for only needing to carry out local operation in each existing node.For
Mark is in BKTWkxk-1...x2x1Existing node,
(1) useUpdate its logical identifier；
(2) useUpdate its descendant node x '=x 'kxk-1...x2x1Logical identifier；Its predecessor node is patrolled
Collect mark
Symbol is similarly updated；
(3) useUpdate it and go out neighbor nodeLogical identifier, for 1≤i≤d.
Fig. 5 (a) shows the topological structure of the BKTW based on complete Kautz trees KTree (2,2), and Fig. 5 (b) is drawn
Call the BKTW after topological expansion process.
The present invention provides a kind of robust, the expansible kautz tree topology control technologies based on wireless sensor network.
The technology includes herein below.The kautz trees of a balance and related kautz ring structures are make use of, based on the two structures
Devise an efficient BKTW of robust (A BALANCED KAUTZ TREE-BASED WSA) tree topology, first, Mei Gejie
Point is mapped to a leaf node in balance kautz trees, and uses corresponding leaf node and the label of IP address as its logic
And physical identifier.Secondly, each node safeguards d+2 connection according to topology rule, for supporting robustness, after first
When node failure, can connect second it is follow-up, analogized with secondary.In this topology, network diameter is k, and out-degree d is fixed
And be 2, node n is arbitrary value.The topology supports any number of node, for supporting scalability, to handle node not
The addition of in check dynamic operation, such as node, exit and failure.Obtaining the kautz rings of the other all nodes of any level
Afterwards, it is necessary to distance between any two node of the rank is measured according to their label clockwise and anticlockwise, choosing
Select path forwarding message as short as possible.This Topology Control have distribution, localization, low energy consumption, scalability by force
Feature.
Above-described embodiment is preferably embodiment, but embodiments of the present invention are not by above-described embodiment of the invention
Limitation, other any Spirit Essences without departing from the present invention and the change made under principle, modification, replacement, combine, simplification,
Equivalent substitute mode is should be, is included within protection scope of the present invention.
Claims (10)
1. a kind of kautz tree topology control methods based on wireless sensor network, it is characterised in that comprise the following steps：
S1, one balance kautz tree of construction and correlation kautz ring structures；
S2, the n node based on imperfect kautz trees, further design a kind of general topology and are referred to as BKTW (A BALANCED
KAUTZ TREE-BASED WSA) tree network topology；
S3, the topological structure for managing and adjusting BKTW (A BALANCED KAUTZ TREE-BASED WSA).
2. according to the method described in claim 1, it is characterised in that the step S3 includes：The extension and contraction of node scale,
The addition of node, exit and failure.
3. according to the method described in claim 1, it is characterised in that the out-degree and in-degree of the balance kautz tree nodes are 2.
4. according to the method described in claim 1, it is characterised in that the root node of the balance kautz trees has 3 child nodes,
Each internal node at most has 2 child nodes.
5. according to the method described in claim 1, it is characterised in that the kautz rings are the sequence that node presses inverse time needle sort.
6. according to the method described in claim 1, it is characterised in that the balance kautz trees include complete kautz trees and endless
Whole kautz trees.
7. method according to claim 6, it is characterised in that the complete kautz trees degree is 2, a diameter of 2；It is described endless
Whole kautz trees degree is 2, a diameter of 3, and the quantity of leaf node is at least 6, is at most 12.
8. according to the method described in claim 1, it is characterised in that leaf segment of the sensor maps to the balance kautz trees
Point.
9. according to the method described in claim 1, it is characterised in that BKTW is the wireless senser based on the balance kautz trees
Network topology.
10. after according to the method described in claim 1, it is characterised in that BKTW topological structure is that node retains and its forerunner,
Connected for 4 altogether after going out neighbours with 2；On the other hand, its forerunner, it is follow-up and enter neighbours and also keep 4 companies altogether with node
Connect.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710324690.XA CN107181613A (en) | 2017-05-10 | 2017-05-10 | A kind of kautz tree topology control methods based on wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710324690.XA CN107181613A (en) | 2017-05-10 | 2017-05-10 | A kind of kautz tree topology control methods based on wireless sensor network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107181613A true CN107181613A (en) | 2017-09-19 |
Family
ID=59832607
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710324690.XA Pending CN107181613A (en) | 2017-05-10 | 2017-05-10 | A kind of kautz tree topology control methods based on wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107181613A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109039920A (en) * | 2018-07-26 | 2018-12-18 | 广东工业大学 | A kind of algorithm constructing several depth and degree constraint minimum spanning tree |
| CN110049451A (en) * | 2019-04-03 | 2019-07-23 | 北京工业大学 | A kind of methods, devices and systems of the mobile ad hoc network information back towards field |
| CN111934901A (en) * | 2020-06-24 | 2020-11-13 | 合肥工业大学 | Topology control method and system of unmanned platform information-aware network |
| CN112532294A (en) * | 2020-11-06 | 2021-03-19 | 西安电子科技大学 | Robust topology control method, system, medium, device and terminal for tracing compensation |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080109573A1 (en) * | 2006-11-08 | 2008-05-08 | Sicortex, Inc | RDMA systems and methods for sending commands from a source node to a target node for local execution of commands at the target node |
| CN101222391A (en) * | 2007-11-30 | 2008-07-16 | 深圳国人通信有限公司 | Method for constructing topological tree in server/client terminal structure |
| CN104022928A (en) * | 2014-05-21 | 2014-09-03 | 中国科学院计算技术研究所 | Topology construction method of high-density server and system thereof |
-
2017
- 2017-05-10 CN CN201710324690.XA patent/CN107181613A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080109573A1 (en) * | 2006-11-08 | 2008-05-08 | Sicortex, Inc | RDMA systems and methods for sending commands from a source node to a target node for local execution of commands at the target node |
| CN101222391A (en) * | 2007-11-30 | 2008-07-16 | 深圳国人通信有限公司 | Method for constructing topological tree in server/client terminal structure |
| CN104022928A (en) * | 2014-05-21 | 2014-09-03 | 中国科学院计算技术研究所 | Topology construction method of high-density server and system thereof |
Non-Patent Citations (2)
| Title |
|---|
| DEKE GUO ET AL.: "Theory and Network Applications of Balanced Kautz Tree Structures", 《ACM TRANSACTIONS ON INTERNET TECHNOLOGY》 * |
| 郭得科: "基于Kautz图和Bloom滤波的对等网络研究", 《中国博士学位论文全文数据库（电子期刊）》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109039920A (en) * | 2018-07-26 | 2018-12-18 | 广东工业大学 | A kind of algorithm constructing several depth and degree constraint minimum spanning tree |
| CN109039920B (en) * | 2018-07-26 | 2020-10-09 | 广东工业大学 | Method for constructing a plurality of minimum spanning trees with depth and degree constraint |
| CN110049451A (en) * | 2019-04-03 | 2019-07-23 | 北京工业大学 | A kind of methods, devices and systems of the mobile ad hoc network information back towards field |
| CN110049451B (en) * | 2019-04-03 | 2021-07-16 | 北京工业大学 | Method, device and system for returning mobile ad hoc network information facing field |
| CN111934901A (en) * | 2020-06-24 | 2020-11-13 | 合肥工业大学 | Topology control method and system of unmanned platform information-aware network |
| CN112532294A (en) * | 2020-11-06 | 2021-03-19 | 西安电子科技大学 | Robust topology control method, system, medium, device and terminal for tracing compensation |
| CN112532294B (en) * | 2020-11-06 | 2021-10-29 | 西安电子科技大学 | Robust topology control method, system, medium, device and terminal for tracing compensation |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Qiu et al. | A greedy model with small world for improving the robustness of heterogeneous Internet of Things | |
| CN107181613A (en) | A kind of kautz tree topology control methods based on wireless sensor network | |
| Iyengar et al. | Biologically inspired cooperative routing for wireless mobile sensor networks | |
| CN101965715B (en) | Tie-Breaking in Shortest Path Determination | |
| EP2127223B1 (en) | System and method for automatically segmenting and merging routing domains within networks | |
| Srinivas et al. | Construction and maintenance of wireless mobile backbone networks | |
| Jain | A coherent approach for dynamic cluster-based routing and coverage hole detection and recovery in bi-layered WSN-IoT | |
| Mohammed et al. | Optimal routing in ad-hoc network using genetic algorithm | |
| Truong et al. | Multi-objective hierarchical algorithms for restoring wireless sensor network connectivity in known environments | |
| Lee et al. | Optimized bi-connected federation of multiple sensor network segments | |
| Mohammed et al. | Generating quality dominating sets for sensor network | |
| Tabatabaei | A new routing protocol for energy optimization in mobile ad hoc networks using the cuckoo optimization and the TOPSIS multi-criteria algorithm | |
| Smys et al. | Efficient self-organized backbone formation in mobile ad hoc networks (MANETs) | |
| Rana et al. | Energy-efficient routing for wireless sensor network using genetic algorithm and particle swarm optimisation techniques | |
| Hajjej et al. | Multi objective nodes placement approach in WSN based on nature inspired optimisation algorithms | |
| JP2019176460A (en) | Method and device for network management, non-temporary computer readable medium, computer program product and dataset | |
| CN107466057A (en) | A kind of WSN collecting methods based on region-growing method | |
| CN108011730A (en) | The method and device that looped network resource changes automatically in a kind of network management system | |
| Karkooki et al. | A genetic algorithm to improve lifetime of wireless sensor networks by load balancing | |
| Das et al. | An exhaustive survey on nature inspired metaheuristic algorithms for energy optimization in wireless sensor network | |
| Menaria et al. | An Efficient Fault-Tolerant Mechanism to Ameliorate Performance in Wireless Sensor Networks | |
| Sniatala et al. | Introduction to Algorithms for Wireless Sensor Networks | |
| Singh et al. | Performance improvement in AODV routing protocol with artificial intelligence | |
| Muthirayan et al. | Online algorithms for network robustness under connectivity constraints | |
| Kaur et al. | Several Routing Protocols, Features and Limitations for Wireless Mesh Network (WMN): A Review |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20170919 |