CN108616893B - High-energy-efficiency topology control method - Google Patents
High-energy-efficiency topology control method Download PDFInfo
- Publication number
- CN108616893B CN108616893B CN201810236642.XA CN201810236642A CN108616893B CN 108616893 B CN108616893 B CN 108616893B CN 201810236642 A CN201810236642 A CN 201810236642A CN 108616893 B CN108616893 B CN 108616893B
- Authority
- CN
- China
- Prior art keywords
- node
- network
- nodes
- link
- list
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/04—TPC
- H04W52/18—TPC being performed according to specific parameters
- H04W52/24—TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters
- H04W52/245—TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters taking into account received signal strength
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/04—TPC
- H04W52/38—TPC being performed in particular situations
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention belongs to the technical field of wireless resource allocation, and discloses an energy-efficient topology control method, which comprises the steps of firstly loading network parameters and determining a performance target of a network; establishing a neighbor list of each node in the wireless Ad Hoc network; calculating the optimal power of each node according to the network performance target; and constructing a network topology structure with the optimal node degree according to the optimal power of the nodes. The invention can be used for optimizing a large-scale wireless Ad Hoc network, so that the network has the advantages of high energy efficiency and optimal connectivity. The invention is innovated in simultaneously considering the energy consumption problem and connectivity of the network and provides a topology control method for improving the energy efficiency and the communication efficiency of the network.
Description
Technical Field
The invention belongs to the technical field of wireless resource allocation, and particularly relates to an energy-efficient topology control method
Background
Currently, the current state of the art commonly used in the industry is such that:in the wireless Ad Hoc network, the topology of the wireless Ad Hoc network describes connectivity information of the entire network, including node information in the network and connection conditions between nodes. The topology control is to construct a network topology by adjusting the transmission power of nodes with the aim of network high energy efficiency and connectivity under the condition that network resources are generally limited. The topology control technology is a key technology for improving the network energy efficiency, and the aim of optimizing the network performance is fulfilled by adjusting the transmitting power of the nodes. Li proposes a topology control method based on a minimum spanning tree for the problem of low energy consumption, but the network topology constructed by the method is rareSparse, network segmentation is easily caused, and data cannot be transmitted among one or more network branches; li proposes a CBTC method based on signal arrival angle, but the method has more control information and the overall overhead is too large. The method disclosed by the invention can realize high energy efficiency of the network, ensures that the network has the determined node degree K, and avoids the network from being too sparse or dense.
In summary, the problems of the prior art are as follows:
(1) the node transmit power setting is too large, causing the node energy to drain quickly so that the node fails.
(2) The node spacing is too large, and the network topology structure is too sparse, so that the data transmission efficiency of the nodes is low.
The difficulty and significance for solving the technical problems are as follows:
topology control of a wireless Ad Hoc network is a problem of adjusting the transmission power of each node, reducing the transmission power of the node as much as possible, and maintaining network connectivity at the same time. Only by adopting proper topology control measures to adjust the transmission power of the nodes, the network can effectively balance the relations in the aspects of network connectivity, energy characteristics and the like, and a topology structure with low power consumption and high throughput is constructed on the basis of ensuring the connectivity. The topology control technology of the wireless Ad Hoc network is a key technology for improving the network energy efficiency, and the aim of optimizing the network performance is fulfilled by adjusting the transmitting power of nodes.
A difficulty with existing topology control techniques is how to allocate transmit power to each node so that the wireless Ad Hoc network is connected while minimizing the maximum or total node transmit power.
Disclosure of Invention
Aiming at the problems in the prior art, the invention provides a topology control method with high energy efficiency.
The invention is realized in such a way that an energy-efficient topology control method comprises the following steps: loading network parameters; establishing a neighbor list of each node in the wireless Ad Hoc network; calculating the optimal power of each node; and constructing a network topology structure according to the optimal power and the optimal node degree of the nodes.
Further, the energy-efficient topology control method includes the steps of:
the method comprises the following steps: loading network parameters and determining a performance target of the network;
step two: each node acquires information of a neighbor node and establishes a neighbor list;
step three: each node calculates the optimal transmitting power meeting the network performance target;
step four: and the nodes construct a network topology structure with the optimal node degree according to the optimal power.
Further, the first step specifically includes:
(1) and loading network parameters, specifically comprising the cruising ability of the nodes in the network and the communication efficiency of the nodes.
(a) Nodal endurance StiThe finger node i can adapt to complex environment, and cannot rapidly lose effectiveness and continuously work.
(b) Node communication efficiency IiRefers to the ability of node i to transmit data quickly in the network.
(2) A network performance target is determined. Maximizing the node endurance function StiAnd node communication efficiency function IiAnd constructing an optimization evaluation function w (i) comprehensively considering the cruising ability of the node and the communication efficiency of the node.
Wherein, alpha and beta are regulating coefficients; stiEndurance, St, of finger node imaxThe maximum cruising ability of the finger node i; i isiCommunication efficiency of finger node I, ImaxRefers to the maximum communication efficiency of node i.
Further, the second step specifically includes:
(1) each node in the wireless Ad Hoc network transmits power P at the maximummaxSending Hello messages, including nodesID number, current remaining energy value E and initial energy value E of node0After receiving the hello (i) packet of the node i, any node j acquires the received signal strength RSSI of the node ji(j) The minimum transmission power p required for ensuring the transmission power when the receiving node correctly receives the data in the free space model is calculatedij。
(2) After node j sends Hello message from node i, replying reply message (including ID (j), minimum transmitting power p of node i)ij、Ej、RSSIi(j) ) message to node i, node i adds the information of node j to its own neighbor list.
Further, the third step specifically includes:
(1) the method comprises the steps of sorting information in a neighbor list of any node i (i is 1,2, and N is the total number of nodes in the network) in an increasing mode according to transmitting power, sequentially selecting the transmitting power in the neighbor list and calculating an optimization evaluation function value w (j) corresponding to the transmitting power; the current transmission power pijThe ID number and the optimized evaluation function w (j) value of the corresponding neighbor node j are put into an optimized evaluation list of the node i;
(2) analyzing the value of w (j) corresponding to a neighbor node j of any node i (i is 1,2, …, N) in the network, and when the value of w (j) does not change any more, the corresponding transmission power is the optimal transmission power p of the node ioptiAnd the information (including ID (j), p) of the adjacent nodes corresponding to the transmitting power larger than the optimal transmitting power in the evaluation listij、Ej、RSSIi(j) ) is deleted.
Further, the fourth step specifically includes:
(1) all nodes send Hello messages carrying evaluation lists of the nodes in sequence, and after receiving the Hello messages of the node j, the node i acquires the evaluation list information of the node j and judges whether the node i exists in the evaluation list of the node j or not; if the node I exists, the node I sends a Hello message to the node j, and after receiving the Hello message of the node I, the node j judges whether the node I exists in an evaluation list of the node I; if yes, the node i and the node j are in respective communication ranges; if not, then node i is not at node jWithin communication range, there is no link between two nodes. The node i adds the information of the node j into a bidirectional area list of a conical area l (l is more than or equal to 1 and less than or equal to K) according to the two-dimensional coordinate position of the node j, wherein j islRepresenting the neighbor nodes of the node i in the l area; markl(i,jl) Represents a link (i, j)l) Is initially zero, indicating no connection, and lists the bi-directional regions of node i by w (j)l) Sorting from small to large;
(2) and (6) topology optimization.
Further, the (2) specifically includes:
step one, when the node i is equal to 1, marking
Is 1 in which
The neighbor node with the minimum optimization evaluation function value in the bidirectional area list representing the i;
and step two, when the node i is equal to 2,
representing node i and node
A link between, determining the link
Whether intersection exists with other links (u, v) marked as 1 in the network, namely whether intersection exists between the connecting lines of the links;
case 1: if it is not
No crossing with (u, v), the mark is made
Case 2: if it is not
And (u, v) is crossed, and a link with a smaller optimization evaluation function value is selected, so that whether a link with a smaller optimization evaluation function value exists or not is judged
Is established, marked
mark1(u, v) ═ 0; otherwise marking
mark1(u, v) ═ 1; then based on the marked link
Until all the neighbor nodes of the node i are judged;
step three, respectively marking the link states between all nodes in the 2 nd, 3 rd, … th and K-th conical domains and the node i according to the step two;
step four, when the node i is 3,4, …, N, repeating step two and step three, and marking the link state;
and step five, connecting all the links with the link state marked as 1 to complete the configuration optimization of the network topology.
Another object of the present invention is to provide a wireless communication system of the energy-efficient topology control method.
In summary, the advantages and positive effects of the invention are:the method comprises the steps of establishing a node endurance function and a node communication efficiency function by analyzing the influence of node transmitting power and residual energy of neighbor nodes on the node energy consumption, network connectivity and other performances and taking the node transmitting power as an adjusting factor, and establishing an optimized evaluation function taking the node endurance and the node communication efficiency as targets. The invention provides a high-energy-efficiency topology control method, which takes node transmitting power as a control condition, calculates optimized evaluation function values under different transmitting powers and adopts power when the optimized evaluation function tends to be stableAnd optimizing the power for the nodes, and further constructing a topological structure determined by the node degree by realizing the local optimization of each node by using the power. The following results show that the method can effectively utilize the node energy and prolong the life cycle of the network.
TABLE 3 variation of average residual energy/mJ of network nodes with method operation times under different methods
| Number of times of operation of the |
0 | 10 | 20 | 30 | 40 | 50 |
| XTC process | 30 | 23.4 | 16.6 | 10.3 | 4.5 | 0 |
| The method of the invention | 30 | 27.2 | 23.1 | 19 | 15.1 | 11.3 |
TABLE 4 variation of network energy/mJ with node number under different methods
| Number of nodes in |
80 | 100 | 120 | 140 | 160 | 180 | 200 |
| XTC process | 6.8 | 6.4 | 5.8 | 5.3 | 4.7 | 4.3 | 4.9 |
| The method of the invention | 8 | 6.9 | 6.7 | 6.4 | 5.8 | 5.6 | 5.3 |
Drawings
Fig. 1 is a flowchart of an energy-efficient topology control method according to an embodiment of the present invention.
Fig. 2 is a graph of node weights as a function of node average power according to an embodiment of the present invention.
Fig. 3 is a graph of average power of nodes versus the number of network nodes according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail with reference to the following embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The invention researches a topology control method aiming at a network topology structure, and optimizes the network topology structure by taking the performance of optimizing network energy efficiency and connectivity as a target under the limited node energy constraint condition. The method is suitable for wireless communication in various fields such as military affairs and disaster relief, and improves network performance.
As shown in fig. 1, the energy-efficient topology control method provided in the embodiment of the present invention includes the following steps:
s101: loading network parameters and determining a performance target of the network;
s102: each node acquires information of a neighbor node and establishes a neighbor list;
s103: each node calculates the optimal transmitting power meeting the network performance target;
s104: and the nodes construct a network topology structure with the optimal node degree according to the optimal power.
The application of the principles of the present invention will now be described in further detail with reference to the accompanying drawings.
The topology control method with high energy efficiency provided by the embodiment of the invention comprises the following steps:
the method comprises the following steps: and loading the network parameters.
(1) And loading network parameters, specifically comprising the cruising ability of the nodes in the network and the communication efficiency of the nodes.
(a) Nodal endurance StiThe finger node i can adapt to complex environment, and cannot rapidly lose effectiveness and continuously work.
(b) Node communication efficiency IiRefers to the ability of node i to transmit data quickly in the network.
(2) A network performance target is determined. Maximizing the node endurance function StiAnd node communication efficiency function IiAnd constructing an optimization evaluation function w (i) comprehensively considering the cruising ability of the node and the communication efficiency of the node.
Wherein, alpha and beta are regulating coefficients; stiEndurance, St, of finger node imaxThe maximum cruising ability of the finger node i; i isiCommunication efficiency of finger node I, ImaxRefers to the maximum communication efficiency of node i.
Step two: establishing a neighbor list of each node in the wireless Ad Hoc network:
(a) each node in the wireless Ad Hoc network transmits power P at the maximummaxSending a Hello message including an ID number of the node, a current remaining energy value E of the node, and an initial energy value E0After receiving the hello (i) packet of the node i, any node j includes the ID number of the node i and the current residual energy value E of the node iiAnd an initial energy value E0iAnd obtaining the received signal strength RSSI of the node ji(j) The minimum transmitting power p required by the transmitting node when ensuring the receiving node correctly receives the data in the free space model is calculatedij。
(b) After node j sends Hello message from node i, replying reply message (including ID (j), minimum transmitting power p of node i)ij、Ej、RSSIi(j) ) message to node i, node i adds the information of node j to its own neighbor list.
Step three: calculating the optimal power of each node;
(a) the method comprises the steps of sorting information in a neighbor list of any node i (i is 1,2, and N is the total number of nodes in the network) in an increasing mode according to transmitting power, sequentially selecting the transmitting power in the neighbor list and calculating an optimization evaluation function value w (j) corresponding to the transmitting power; the current transmission power pijThe ID number and the optimized evaluation function w (j) value of the corresponding neighbor node j are put into an optimized evaluation list of the node i;
(b) analyzing the value of w (j) corresponding to a neighbor node j of any node i (i is 1,2, …, N) in the network, and when the value of w (j) does not change any more, the corresponding transmission power is the optimal transmission power p of the node ioptiAnd the information (including ID (j), p) of the adjacent nodes corresponding to the transmitting power larger than the optimal transmitting power in the evaluation listij、Ej、RSSIi(j) ) is deleted. In this way, each node in the wireless Ad Hoc network determines its own optimal transmission power.
Step four: and constructing a network topology structure according to the optimal power and the optimal evaluation list of the nodes. And constructing a network topology structure on the basis of the determined node degree K, wherein the number of neighbor nodes of each node in the network is less than or equal to K. The communication range of any node in the network is ViI.e. the node is at the optimum transmit power poptiCoverage of at ViTaking a node i as a center, leading out k rays and converting V intoiEqually divided into K conical domains.
(a) All nodes send Hello messages carrying the evaluation lists in sequence, and after receiving the Hello messages of the node j, the node i acquires the evaluation list information of the node j and judges whether the node i exists in the evaluation list of the node j. If the node I exists, the node I sends a Hello message to the node j, and the node j judges after receiving the Hello message of the node IWhether the node is in the evaluation list of the node i or not is judged, if yes, the node i and the node j are in respective communication range; if not, the node i is not in the communication range of the node j, and no link exists between the two nodes. The node i adds the information of the node j into a bidirectional area list of a conical area l (l is more than or equal to 1 and less than or equal to K) according to the two-dimensional coordinate position of the node j (wherein the bidirectional area list comprises a conical area serial number l and an adjacent node identification ID (j)l) Optimization of evaluation value w (j)l) Link markl(i, j)). Wherein j islRepresenting the neighbor nodes of the node i in the l area; markl(i,jl) Represents a link (i, j)l) Is initially zero, indicating no connection. The bidirectional area list of the node i is according to w (j)l) Sorting from small to large.
(b) And (6) topology optimization.
Step 1: when node i is 1, marking
Is 1 in which
And the neighbor node with the minimum optimization evaluation function value in the bidirectional area list representing the i.
Step 2: when the node i is equal to 2,
representing node i and node
A link between, determining the link
Whether there is a cross with other links (u, v) in the network that have been marked 1, i.e. whether there is an intersection of the lines between the links.
Case 1: if it is not
No crossing with (u, v), the mark is made
Case 2: if it is not
And (u, v) is crossed, and a link with a smaller optimization evaluation function value is selected, so that whether a link with a smaller optimization evaluation function value exists or not is judged
If it is not
Is established, marked
mark1(u, v) ═ 0; otherwise marking
mark1(u, v) ═ 1. The link is then marked according to step 2
Until all the neighboring nodes of the node i are judged.
And step 3: marking link states between all nodes in the 2 nd, 3 rd, … th, K-th conical domain and the node i according to the step 2;
and 4, step 4: when the node i is 3,4, …, N, repeating the steps 2 and 3, and marking the link state;
and 5: and finally, connecting all the links with the link states marked as 1 to complete the optimization of the network topology.
The application effect of the present invention will be described in detail with reference to the simulation.
1. Simulation conditions
The simulation area is set to be a square area of 600m by 600m, the number of nodes in the network varies from 80 to 150, all the nodes are randomly distributed in the network, and the Poisson mean value of the randomly distributed nodes is 15. The maximum transmitting power of the node is 5mW, and the initial energy of the node is 1000 mJ.
2. Emulated content
Referring to fig. 2, the graph shows that when the node transmission power is continuously reduced, the weight of the node is gradually reduced until no obvious change exists, and the result proves the correctness of the algorithm provided by the invention, and the multi-objective optimization problem in the invention has an optimal value.
As shown in fig. 3, the graph shows that the average transmission power of the node gradually decreases with the increase of the network size, but the average transmission power of the network is smaller in the method provided in this chapter, and the method can more efficiently utilize the energy of the node on the premise of ensuring the network performance.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.
Claims (2)
1. An energy-efficient topology control method, the energy-efficient topology control method comprising: loading network parameters; establishing a neighbor list of each node in the wireless ad hoc network; calculating the optimal power of each node; constructing a network topology structure according to the optimal power of the nodes and the node degree K; compared with the existing method, the method realizes the high energy efficiency and connectivity of the wireless AdHoc network;
the energy-efficient topology control method comprises the following steps:
the method comprises the following steps: loading network parameters and determining a performance target of the network;
step two: each node acquires information of a neighbor node and establishes a neighbor list;
step three: each node calculates the optimal transmitting power meeting the network performance target;
step four: the nodes construct a network topology structure with the optimal node degree according to the optimal power;
the first step specifically comprises:
1.1, loading network parameters, specifically comprising the cruising ability of nodes in a network and the communication efficiency of the nodes;
1.1.1 node endurance StiThe finger node i can adapt to complex environments, and cannot rapidly lose effectiveness and continuously work;
1.1.2 node communication efficiency IiRefers to the ability of node i to transmit data quickly in the network;
1.2 determining a network performance target; maximizing the node endurance function StiAnd node communication efficiency function IiConstructing an optimization evaluation function w (i) comprehensively considering the cruising ability of the nodes and the communication efficiency of the nodes;
wherein, alpha and beta are regulating coefficients; stiEndurance, St, of finger node imaxThe maximum cruising ability of the finger node i; i isiCommunication efficiency of finger node I, ImaxThe maximum communication efficiency of the node i;
the second step specifically comprises:
2.1 Each node in a Wireless AdHoc network transmits at a maximum power PmaxSending a Hello message including an ID number of the node, a current remaining energy value E of the node, and an initial energy value E0After receiving the hello (i) packet of the node i, any node j includes the ID number of the node i and the current residual energy value E of the node iiAnd an initial energy value E0iAnd obtaining the received signal strength RSSI of the node ji(j) Is calculated in a free space model, and ensures that the minimum transmitting power p required by a transmitting node when a receiving node correctly receives dataij；
2.2 after node j sends and receives Hello message from node i, replying response message to node i, wherein the response message includes ID (j), minimum transmitting power p of node iij、Ej、RSSIi(j) The node i adds the information of the node j into a neighbor list of the node i;
the third step specifically comprises:
3.1 in the networkThe information in the neighbor list of any node i is sorted in an increasing mode according to the transmitting power, wherein i is 1,2, and N is the total number of the nodes in the network, the transmitting power in the neighbor list is sequentially selected, and an optimization evaluation function value w (j) corresponding to the transmitting power is calculated; the current minimum transmitting power pijThe ID number and the optimized evaluation function w (j) value of the corresponding neighbor node j are put into an optimized evaluation list of the node i;
3.2 analyzing the value of w (j) corresponding to the neighbor node j of any node i in the network, i being 1,2, …, when the value of w (j) does not change any more, the corresponding transmission power is the optimal transmission power p of the node ioptiAnd the information of the adjacent nodes corresponding to the transmitting power larger than the optimal transmitting power in the evaluation list, wherein the information comprises ID (j) and pij、Ej、RSSIi(j) Deleting;
the fourth step specifically comprises:
4.1 all nodes send Hello messages carrying evaluation lists of the nodes in sequence, and after receiving the Hello messages of the node j, the node i acquires the evaluation list information of the node j and judges whether the node i exists in the evaluation list of the node j or not; if the node I exists, the node I sends a Hello message to the node j, and after receiving the Hello message of the node I, the node j judges whether the node I exists in an evaluation list of the node I; if yes, the node i and the node j are in respective communication ranges; if the node I does not exist, the node I is not in the communication range of the node j, and a link does not exist between the two nodes; adding the information of the node j into a bidirectional area list of a conical area l by the node i according to the two-dimensional coordinate position of the node j, wherein l is more than or equal to 1 and less than or equal to K, the list comprises a conical area serial number l and an adjacent node identification ID (j)l) Optimization of evaluation value w (j)l) Link markl(i,jl)，jlRepresenting the neighbor nodes of the node i in the l area; markl(i,jl) Represents a link (i, j)l) Is initially zero, indicating no connection, and lists the bi-directional regions of node i by w (j)l) Sorting from small to large;
4.2 topology optimization;
the 4.2 specifically comprises:
4.2.1 when node i is 1,marking
Is 1 in which
The neighbor node with the minimum optimization evaluation function value in the bidirectional area list representing the i;
4.2.2 when node i is 2,
representing node i and node
A link between, determining the link
Whether intersection exists with other links (u, v) marked as 1 in the network, namely whether intersection exists between the connecting lines of the links;
case 1: if it is not
No crossing with (u, v), the mark is made
Case 2: if it is not
And (u, v) is crossed, and a link with a smaller optimization evaluation function value is selected, so that whether a link with a smaller optimization evaluation function value exists or not is judged
If it is not
Is established, marked
mark1(u, v) ═ 0; otherwise marking
mark1(u, v) ═ 1; then based on the marked link
Until all the neighbor nodes of the node i are judged;
4.2.3 labeling the link states between all nodes in the 2 nd, 3 rd, … th, K-th taper domain and node i, respectively, according to 4.2.2;
4.2.4 when node i is 3,4, …, N, repeat 4.2.2, 4.2.3, perform link status marking;
and step five, connecting all the links with the link state marked as 1 to complete the optimization of the network topology.
2. A wireless communication system of the energy efficient topology control method of claim 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810236642.XA CN108616893B (en) | 2018-03-21 | 2018-03-21 | High-energy-efficiency topology control method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810236642.XA CN108616893B (en) | 2018-03-21 | 2018-03-21 | High-energy-efficiency topology control method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108616893A CN108616893A (en) | 2018-10-02 |
| CN108616893B true CN108616893B (en) | 2021-09-28 |
Family
ID=63659297
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810236642.XA Active CN108616893B (en) | 2018-03-21 | 2018-03-21 | High-energy-efficiency topology control method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108616893B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112019372B (en) * | 2020-06-23 | 2023-03-31 | 北京农业信息技术研究中心 | Vegetable wireless monitoring network topology virtualization control method and device |
| CN112350318B (en) * | 2020-11-16 | 2022-07-01 | 北京交通大学 | AC power distribution network topology identification method based on breadth-first search algorithm |
| CN113382464B (en) * | 2021-06-03 | 2022-11-18 | 北京银河信通科技有限公司 | Directional ad hoc network power control method based on minimum spanning tree |
| CN115883364B (en) * | 2022-12-21 | 2023-11-07 | 中山大学 | Dynamic optimization method for distributed network controller |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102546230A (en) * | 2010-12-08 | 2012-07-04 | 中国科学院声学研究所 | Overlay-network topological optimization method in P2P (Peer-To-Peer) streaming media system |
| CN103179655A (en) * | 2013-04-07 | 2013-06-26 | 东南大学 | Distributed node power control method in mobile ad hoc network |
| CN103945425A (en) * | 2013-01-23 | 2014-07-23 | 中国科学院声学研究所 | Topology optimization method and nodes in wireless sensor network |
| CN104853365A (en) * | 2015-05-11 | 2015-08-19 | 浙江理工大学 | Wireless sensing networks topology construction method based on lossy link state prediction |
| CN105791026A (en) * | 2016-04-19 | 2016-07-20 | 浙江理工大学 | Potential competing topological control method based on power and energy optimization |
| CN106792744A (en) * | 2016-12-02 | 2017-05-31 | 西安电子科技大学 | Topology control method based on k points connection under two channel-connectivities of structure |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070214254A1 (en) * | 2006-03-07 | 2007-09-13 | Anatoly Aguinik | Method and system for topology discovery in an ad hoc network |
| US9497639B2 (en) * | 2012-03-06 | 2016-11-15 | Qualcomm Incorporated | Methods and apparatus for adapting femtocell properties based on changes detected in network topology |
-
2018
- 2018-03-21 CN CN201810236642.XA patent/CN108616893B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102546230A (en) * | 2010-12-08 | 2012-07-04 | 中国科学院声学研究所 | Overlay-network topological optimization method in P2P (Peer-To-Peer) streaming media system |
| CN103945425A (en) * | 2013-01-23 | 2014-07-23 | 中国科学院声学研究所 | Topology optimization method and nodes in wireless sensor network |
| CN103179655A (en) * | 2013-04-07 | 2013-06-26 | 东南大学 | Distributed node power control method in mobile ad hoc network |
| CN104853365A (en) * | 2015-05-11 | 2015-08-19 | 浙江理工大学 | Wireless sensing networks topology construction method based on lossy link state prediction |
| CN105791026A (en) * | 2016-04-19 | 2016-07-20 | 浙江理工大学 | Potential competing topological control method based on power and energy optimization |
| CN106792744A (en) * | 2016-12-02 | 2017-05-31 | 西安电子科技大学 | Topology control method based on k points connection under two channel-connectivities of structure |
Non-Patent Citations (1)
| Title |
|---|
| Distributed Topology Control With Lifetime Extension Based on Non-Cooperative Game for Wireless Sensor Networks;Mengmeng Xu;《IEEE SENSORS JOURNAL》;20160501;第3332-3341页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108616893A (en) | 2018-10-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108616893B (en) | High-energy-efficiency topology control method | |
| Zhang et al. | Novel dynamic source routing protocol (DSR) based on genetic algorithm‐bacterial foraging optimization (GA‐BFO) | |
| Zhang et al. | New approach of multi-path reliable transmission for marginal wireless sensor network | |
| Liu et al. | Adaptive repair algorithm for TORA routing protocol based on flood control strategy | |
| Zhang et al. | A novel multicast routing method with minimum transmission for WSN of cloud computing service | |
| CN113645143B (en) | Optimization method and device for air trunking communication network | |
| CN109688540B (en) | Ad Hoc network physical topology non-cooperative inference system | |
| CN106972880A (en) | A kind of low-complexity joint method for precoding of transmitting terminal and relaying based on SWIPT technologies | |
| CN108684065A (en) | Relay selection method based on ant group optimization in a kind of car networking | |
| CN105959912B (en) | Based on the aggregation node localization method for improving discrete differential algorithm | |
| AR et al. | Heal nodes specification improvement using modified chef method for group Based Detection Point Network | |
| CN112911585B (en) | Method for enhancing survivability of wireless sensor network | |
| Rajan et al. | Node replacement based energy optimization using enhanced salp swarm algorithm (Es2a) in wireless sensor networks | |
| Elsway et al. | Energy-aware disjoint dominating sets-based whale optimization algorithm for data collection in WSNs | |
| Samanta et al. | Optimal load distribution of cluster head in fault-tolerant wireless sensor network | |
| Ma et al. | New AODV routing method for mobile wireless mesh network (MWMN) | |
| CN106685819A (en) | AOMDV protocol energy saving method based on node energy division | |
| Hung et al. | A moving direction proposal to save energy consumption for mobile sink in wireless sensor network | |
| CN112954584B (en) | Unmanned aerial vehicle communication network route planning method based on quantum annealing algorithm | |
| Hasson et al. | Developed clustering approaches to enhance the data transmissions in WSNs | |
| CN110972206B (en) | Multi-hop routing method for realizing routing path of 5G Internet of things network | |
| Kord et al. | ALQARM: An ant-based load and QoS aware routing mechanism for IoT | |
| CN108990128B (en) | Route design method based on mobile perception in mobile network | |
| Haenggi | A geometry-inclusive fading model for random wireless networks | |
| Zhang et al. | New Method of MSCA for Edge Computing |
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 |