CN103442382A - Topology control method for reducing inter-link interference - Google Patents

Topology control method for reducing inter-link interference Download PDF

Info

Publication number
CN103442382A
CN103442382A CN2013104165013A CN201310416501A CN103442382A CN 103442382 A CN103442382 A CN 103442382A CN 2013104165013 A CN2013104165013 A CN 2013104165013A CN 201310416501 A CN201310416501 A CN 201310416501A CN 103442382 A CN103442382 A CN 103442382A
Authority
CN
China
Prior art keywords
node
topology
limit
center control
max
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
Application number
CN2013104165013A
Other languages
Chinese (zh)
Other versions
CN103442382B (en
Inventor
王玺钧
盛敏
刘梦霞
翟道森
张琰
李建东
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xidian University
Original Assignee
Xidian University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xidian University filed Critical Xidian University
Priority to CN201310416501.3A priority Critical patent/CN103442382B/en
Publication of CN103442382A publication Critical patent/CN103442382A/en
Application granted granted Critical
Publication of CN103442382B publication Critical patent/CN103442382B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention discloses a topology control method for reducing inter-link interference, which mainly solves the problem that the reduction of the inter-link interference cannot be guaranteed existing in the prior art. The implementation process of the method comprises the following steps: constructing a maximum power topology by a central control node; traversing all edges in an edge set of the maximum power topology by the central control node by taking the interference of the edge as standard, deleting and optimizing the edge set to construct an entire network topology; broadcasting entire network topology information by the central control node to all nodes in a network except for the central control node; determining logic neighbor nodes of all the nodes except for the central control node in the network by the nodes except for the central control node according to the received entire network topology information and adjusting the transmitting powers of the nodes. The topology control method has the advantages that the energy consumption of the node is reduced and the inter-link interference is reduced, and can be used for a wireless sensing network.

Description

Reduce the topology control method disturbed between link
Technical field
The invention belongs to wireless communication field, particularly a kind of method that builds network topology structure, can be used for radio sensing network.
Background technology
Wireless sensor network is the wireless network that the small node by one group of random distribution forms by Ad hoc mode, and each small node consists of transducer, data processing unit and communication unit.Wireless sensor network combines transducer, low-power consumption, communication and the technology such as micro electronmechanical, has real-time data acquisition, Supervised Control and the functions such as information sharing and storage administration, is a kind of network communicating system that is full of development potentiality.
Energy reserving is the research aspect of two outbalances in wireless sensor network with reducing interference.Aspect topology control, a large amount of research work in recent years mainly focuses on how algorithm for design is to reduce the energy consumption of network node, several comparatively typical algorithms, the LMST algorithm that the article " Design and Analysis of an MST-Based Topology Control Algorithm " of delivering on IEEE Transactions on Wireless Communications as authors such as N.Li is mentioned, the LSP algorithm of mentioning in the article that the authors such as Y.Shen deliver on ACM SIGCOMM Computer Communication Review " A shortest-path-based topology control algorithm in wireless multi-hop networks " etc., be subjected to widely and paid close attention to, because the low energy consumption topological structure has sparse property usually, the characteristics such as node degree is low, therefore people generally believe that the topology of low energy consumption also means low the interference, so in this class algorithm, seldom have when reducing node energy consumption and take explicitly into account the interference how reduced between node.
Yet, be disclosed in energy reserving in the article that the authors such as M.Burkhart deliver on ACM MobiHoc2004 " Dose topology control reduce interference " and reduce between interference and do not have definite relation, also, a low energy consumption Topology Control Algorithm can not guarantee that its final topological structure is low the interference.
At present, in order to reduce interference, the researcher has proposed some Topology Control Algorithms.Difference according to interference model, these algorithms roughly can be divided into two large classes: a class is the interference of considering that a pair of node causes the node in its transmission range in communication process, the i.e. low interference Topology Control Algorithm of the interference model based on the limit noise spot, the LISE algorithm proposed in the article " Dose topology control reduce interference " of delivering on ACM MobiHoc2004 as authors such as M.Burkhart; Another kind of is the interference of considering that individual node causes the node in its transmission range, the i.e. low interference Topology Control Algorithm of the interference model based on a noise spot, the BIMA algorithm proposed in the article " Interference minimum network topologies for Networks ad hoc networks " of delivering on Wirel.Commun.Mob.Comput2012 as authors such as G.Feng.Due to when the Channel Assignment Problems of research based on the bottom topology or the scheduling problem, need the interference of considering that a pair of node causes the link that can communicate by letter in its transmission range in communication process, and above-mentioned two class algorithms all can't guarantee to reduce the interference between link, and then can't provide a good bottom topology.
Summary of the invention
The object of the invention is to the problem for above-mentioned prior art, propose a kind of topology control method disturbed between link that reduces, to reduce node energy consumption, reduce the interference between link, realize the bottom topology.
To achieve these goals, network topology control method of the present invention comprises the steps:
(1) network Zhong Chu center is controlled the outer all node u of joint o and is sent a Hello packet to center control nodes o, and center control nodes o obtains maximum power topology G max=(V (G max), E (G max)), V (G wherein max) be maximum power topology G maxnode set, E (G max) be maximum power topology G maxlimit set:
(2) the center control nodes o in network calculates the degree of disturbance on every limit in the maximum power topology:
(2a) center control nodes o judgement limit set E (G max) in any two limit (x i, y i) and (x j, y j) whether phase mutual interference, if limit (x j, y j) at least one node x is arranged jor y jat node x ior node y itransmission radius r scope in, limit (x i, y i) interfere with limit (x j, y j);
(2b) center control nodes o calculates limit set E (G max) in the degree of disturbance on every limit (x, y), at limit set E (G max) total number on the limit that statistics limit (x, y) interferes with in scope;
(3) center control nodes o builds full mesh topology G=(V (G), E (G)), the node set that wherein V (G) is full mesh topology G, comprise that center control nodes o and network Zhong Chu center control the outer all node u of joint o, gather on the limit that E (G) be constructed full mesh topology G;
(4) center control nodes o is recorded in the node set V of described full mesh topology G (G) and limit set E (G) in topological updating message MSG, and broadcasts this MSG message with all node u of mode outside joint o is controlled at network Zhong Chu center that flood;
(5) the outer all node u of joint o are controlled according to above-mentioned MSG message in network Zhong Chu center, determine the logic neighbors of oneself, and adjust the transmitting power of oneself.
The present invention has following advantage:
1) the present invention is owing to having considered the phase mutual interference of limit with limit when calculating interference, and the bottom topology that therefore adopts the inventive method to build, more be conducive to the link interference problem in processing channel distribution or link scheduling process;
2) the present invention is because the interference of take between link is weight, and considered the shortest path length between the arbitrary node combination in topology constructing, make the present invention to reduce node energy consumption under the prerequisite that guarantees Euclidean distance t-Spanner characteristic, reduce the interference between link.
The accompanying drawing explanation
Fig. 1 is the applicable wireless network scenario schematic diagram of the present invention;
Fig. 2 is the maximum power topological diagram formed during 50 meshed network scenes in Fig. 1;
Fig. 3 is realization flow figure of the present invention;
Fig. 4 is the sub-process figure that center control nodes of the present invention builds full mesh topology;
Fig. 5 is the present invention and the existing Topology Control Algorithm simulation comparison figure to node maximum interference degree;
Fig. 6 is the present invention and the existing Topology Control Algorithm simulation comparison figure to node maximum transmitted radius.
Embodiment
Below in conjunction with accompanying drawing, embodiment of the present invention is described in further detail.
With reference to Fig. 1, the wireless network that the present invention uses is comprised of n the homogeneity node be distributed in the two dimensional surface zone, supposes to control node o centered by one of them node, remains as controlling the outer all node u of joint o in network Zhong Chu center.Each node has unique authentication number No. ID, and can obtain it self positional information by GPS or other location technologies.In network, each internodal wireless channel is additive white Gaussian noise channel.All nodes are by omnidirectional antenna and node communication on every side, and maximum transmission power is P max.The transmitting power P of all nodes can regulate continuously between minimum and maximum, i.e. 0≤P≤P max.The transmission radius r that transmission range corresponding to the transmitting power of each node is this node, maximum transmission power P maxcorresponding transmission radius is the maximum transmitted radius R, between two nodes, exists the necessary and sufficient condition of wireless link to be less than or equal to the transmission radius r for the Euclidean distance between them.
In network, all nodes are all used maximum transmission power P maxthe topological structure formed during transmission is the maximum power topology, and as shown in Figure 2, the maximum power topological representation is: G max=(V (G max), E (G max)), V (G wherein max) be maximum power topology G maxnode set, E (G max) be maximum power topology G maxlimit set.The maximum power topology here is undirected topology, at limit set E (G max) in (x, y) and (y, x) be the same limit, in explanation afterwards, all with (x, y), mean.
With reference to Fig. 3, performing step of the present invention is as follows:
Step 1, center control nodes o builds maximum power topology G max.
(1a) all node u except center control nodes o in center control nodes o and network, form maximum power topology G maxnode set V (G max);
(1b) the outer all node u of joint o are controlled with maximum transmission power P in network Zhong Chu center maxsend a Hello packet, No. ID, the authentication number that comprises node u in this Hello packet and positional information by the mode flooded to center control nodes o;
(1c) center control nodes o receives in network the Hello packet except own all node u transmissions, and by the information recording in the Hello packet in the whole network informational table of nodes of oneself;
(1d) center control nodes o, according to the node location information in the whole network informational table of nodes of oneself, calculates any two node x in the whole network, the Euclidean distance d (x, y) between y:
d ( x , y ) = ( X x - X y ) 2 + ( Y x - Y y ) 2 ,
Wherein, (X x, Y x) be the position coordinates of node x, (X y, Y y) be the position coordinates of node y;
(1e) center control nodes o, according to the annexation between node maximum transmitted radius R and described Euclidean distance judgement any two points, obtains limit set E (G max) information, concrete determination methods is as follows:
If the Euclidean distance d (x, y) of limit (x, y) is less than or equal to node maximum transmitted radius R, during d (x, y)≤R, (x, y) ∈ E (G max);
If the Euclidean distance d (x, y) of limit (x, y) is greater than node maximum transmitted radius R, during d (x, y)>R,
Figure BDA0000381282360000042
wherein, ∈ means subordinate relation,
Figure BDA0000381282360000043
mean non-subordinate relation;
(1f) with node set V (G max) and limit set E (G max), jointly form maximum power topology: G max=(V (G max), E (G max.
Step 2, the center control nodes o in network calculates maximum power topology limit set E (G max) in the degree of disturbance on every limit.
(2a) center control nodes o is according to the limit set E (G of maximum power topology max) in the Euclidean distance d (x, y) on every limit (x, y), judgement limit set E (G max) in any two limit (x i, y i) and (x j, y j) whether phase mutual interference:
If limit (x j, y j) at least one node x is arranged jor y jat node x itransmission radius r scope in, limit (x i, y i) interfere with limit (x j, y j);
If limit (x j, y j) at least one node x is arranged jor y jat node y itransmission radius r scope in, limit (x i, y i) interfere with limit (x j, y j), otherwise (x i, y i) interference edge (x not j, y j);
(2b) center control nodes o calculates limit set E (G max) in the degree of disturbance on every limit (x, y), at limit set E (G max) total number on the limit that statistics limit (x, y) interferes with in scope.
Step 3, center control nodes o builds full mesh topology G=(V (G), E (G)).
With reference to Fig. 4, being implemented as follows of this step:
(3a) center control nodes o initialization full mesh topology and shortest path collection:
Center control nodes o is initialized to all nodes in the maximum power topology by the node set V of full mesh topology G (G), the limit of full mesh topology G set E (G) is initialized to all limits in the maximum power topology, and be every limit (x in limit set E (G), y) set up the traversal mark, be initialized as 1, mean not ergodic state, i.e. label (x, y)=1;
Center control nodes o sets up set of minimal paths P={p g(x, y) }, p wherein g(x, y) is any a pair of node combination<x in node set V (G), the shortest path of y>in full mesh topology G, if limit (x, y) ∈ E (G),
Figure BDA0000381282360000054
Figure BDA0000381282360000055
for empty set, if limit
Figure BDA0000381282360000056
center control nodes o computing node combination<x, the shortest path p of y>in full mesh topology G g(x, y), and be recorded to set of minimal paths P;
(3b) center control nodes o checks in limit set E (G) whether exist in the limit of ergodic state not, if do not exist, full mesh topology G has built, otherwise, center control nodes o gathers all traversals in E (G) by limit and is labeled as 1 limit and sorts from big to small by degree of disturbance, selects the limit of degree of disturbance maximum its traversal mark is made as to 0, means ergodic state,
Figure BDA0000381282360000052
and set up test topology
Figure BDA0000381282360000053
for the whole nodes in node set V (G),
Figure BDA0000381282360000061
for limit set E (G) removes limit
Figure BDA0000381282360000062
after set;
(3c) center control nodes o be take Euclidean distance as weight, adopts the shortest path tree algorithm, as dijkstra's algorithm, bellman-ford algorithm, and the computing node combination
Figure BDA0000381282360000063
in test topology
Figure BDA0000381282360000064
in shortest path
Figure BDA0000381282360000065
and decision node combination
Figure BDA0000381282360000066
in test topology
Figure BDA0000381282360000067
in shortest path can meet Euclidean distance t-Spanner characteristic:
| p G ^ ( x ^ , y ^ ) | &le; t &times; | p G max ( x ^ , y ^ ) | ,
Wherein
Figure BDA00003812823600000610
for the node combination
Figure BDA00003812823600000611
in test topology
Figure BDA00003812823600000612
in shortest path length,
Figure BDA00003812823600000613
for the node combination
Figure BDA00003812823600000614
at maximum power topology G maxin shortest path length, the parameter factors that t is the t-Spanner characteristic, value is 2 or 4;
If (3d) node combination
Figure BDA00003812823600000615
in test topology in shortest path
Figure BDA00003812823600000617
can meet Euclidean distance t-Spanner characteristic, center control nodes o performs step (3e), if can not meet, center control nodes o returns to step (3b);
(3e) center control nodes o finds out in set of minimal paths P and uses limit
Figure BDA00003812823600000618
all node combination<m, n>, form and to quote set T, if quoting set T is empty set, center control nodes execution step (3g), be not empty set if gather T, center control nodes execution step (3f);
(3f) center control nodes o be take Euclidean distance as weight, adopts the shortest path tree algorithm, as dijkstra's algorithm, bellman-ford algorithm, calculates all node combination<m that quote in set T, n>and in test topology
Figure BDA00003812823600000620
in shortest path, and judge that can it meet Euclidean distance t-Spanner characteristic, if all nodes combinations of quoting in set T can meet, center control nodes o execution step (3g), have at least one pair of node to be combined in test topology if quote in set T
Figure BDA00003812823600000621
in shortest path can't meet Euclidean distance t-Spanner characteristic, center control nodes o returns to step (3b);
(3g) center control nodes o upgrades topological state:
(3g1) center control nodes o is by limit
Figure BDA00003812823600000622
delete from limit set E (G), and node is combined
Figure BDA00003812823600000623
in test topology
Figure BDA00003812823600000626
in shortest path
Figure BDA00003812823600000624
with quote the set T in all nodes be combined in test topology in shortest path be updated in set of minimal paths P;
(3g2) center control nodes o upgrades the degree of disturbance on every limit in limit set E (G), according to the described method of step (2), recalculates the degree of disturbance on every limit (x, y) in limit set E (G), afterwards, returns to step (3b).
Step 4, center control nodes o is to the whole network broadcast topology updating message MSG message.
(4a) center control nodes o is recorded in the node set V of described full mesh topology G (G) and limit set E (G) in topological updating message MSG;
(4b) center control nodes o maximum transmission power, broadcast described MSG message with all node u of mode outside joint o is controlled at network Zhong Chu center that flood.
Step 5, network Zhong Chu center is controlled the outer all node u of joint o and is determined the logic neighbors of oneself according to described MSG message, and adjusts the transmitting power of oneself.
(5a) the outer all node u of joint o are controlled according to the full mesh topology information in described MSG message in network Zhong Chu center, and one on full mesh topology G jumped to neighbors v as the logic neighbors, and form logic neighbors collection: LN u=v ∈ V (G) | (u, v) ∈ E (G) }, wherein, the node set that V (G) is full mesh topology G, the limit set that E (G) is full mesh topology G;
(5b) the outer all node u of joint o are controlled according to described logic neighbors collection in network Zhong Chu center, the transmitting power of oneself are adjusted into to the needed minimum power of logic neighbors that can cover farthest
Figure BDA0000381282360000071
?
P LN u = max { p u , v | v &Element; LN u } .
Effect of the present invention can further illustrate by emulation:
(1) simulated conditions
Emulation adopts the MATLAB simulation software to realize.
In simulating scenes, network node is evenly distributed on a 1000 * 1000m at random 2on the two dimensional surface zone.In network, all nodes adopt identical maximum transmitted radius R=250m.The number of network node excursion is 50～100.
(2) emulation content and result
Emulation 1, be respectively at t under 2,4 condition, with the inventive method and existing LISE algorithm, maximum power Topology Control Algorithm NONE, the maximum interference degree of network carried out to simulation comparison, and result as shown in Figure 5.
Fig. 5 shows: with increasing of nodes, the maximum interference degree of the network that adopts LISE algorithm and maximum power Topology Control Algorithm to generate is obvious ascendant trend, and the ascendant trend that the maximum interference degree of the network that adopts the inventive method to generate increases with nodes is slow, even tend to be steady; And, in the situation for the same node point number, the maximum interference degree value of the network that adopts the inventive method to generate and average degree of disturbance value are much smaller than other two kinds of algorithms.
Emulation 2, be respectively at t under 2,4 condition, with the inventive method and existing LISE algorithm, maximum power Topology Control Algorithm NONE, the maximum transmitted radius of network carried out to simulation comparison, and result as shown in Figure 6.
Fig. 6 shows: the maximum transmitted radius of the network that adopts the inventive method to generate is better than other Topology Control Algorithm, because the maximum transmitted radius is directly proportional to maximum transmission power, therefore the inventive method can effectively reduce the transmitting power of node, this can prove the validity of the inventive method.

Claims (7)

1. a topology control method that reduces to disturb between link, comprise the steps:
(1) network Zhong Chu center is controlled the outer all node u of joint o and is sent a Hello packet to center control nodes o, and center control nodes o obtains maximum power topology G max=(V (G max), E (G max)), V (G wherein max) be maximum power topology G maxnode set, E (G max) be maximum power topology G maxlimit set:
(2) the center control nodes o in network calculates the degree of disturbance on every limit in the maximum power topology:
(2a) center control nodes o judgement limit set E (G max) in any two limit (x i, y i) and (x j, y j) whether phase mutual interference, if limit (x j, y j) at least one node x is arranged jor y jat node x ior node y itransmission radius r scope in, limit (x i, y i) interfere with limit (x j, y j);
(2b) center control nodes o calculates limit set E (G max) in the degree of disturbance on every limit (x, y), at limit set E (G max) total number on the limit that statistics limit (x, y) interferes with in scope;
(3) center control nodes o builds full mesh topology G=(V (G), E (G)), the node set that wherein V (G) is full mesh topology G, comprise that center control nodes o and network Zhong Chu center control the outer all node u of joint o, gather on the limit that E (G) be constructed full mesh topology G;
(4) center control nodes o is recorded in the node set V of described full mesh topology G (G) and limit set E (G) in topological updating message MSG, and broadcasts this MSG message with all node u of mode outside joint o is controlled at network Zhong Chu center that flood;
(5) the outer all node u of joint o are controlled according to above-mentioned MSG message in network Zhong Chu center, determine the logic neighbors of oneself, and adjust the transmitting power of oneself.
2. topology control method according to claim 1, wherein the described network Zhong Chu of step (1) center is controlled the outer all node u of joint o and is sent a Hello packet to center control nodes o, refers to node u maximum transmission power P maxsend the Hello packet of oneself to center control nodes o in the mode flooded.
3. topology control method according to claim 1, wherein the described center control nodes o of step (1) obtains maximum power topology G max=(V (G max), E (G max)), obtain as follows:
(1a) in center control nodes o and network except center control nodes o all node u form maximum power topology G maxnode set V (G max);
(1b) network Zhong Chu center is controlled the outer all node u of joint o and is sent the Hello packet of oneself, No. ID, the authentication number that comprises node u in this Hello packet and positional information to center control nodes o;
(1c) center control nodes o receives in network the Hello packet except own other all node u transmissions, and by the information recording in the Hello packet in the whole network informational table of nodes of oneself;
(1d) center control nodes o, according to the positional information in the whole network informational table of nodes, calculates any two points x in the whole network, the Euclidean distance d (x, y) between y;
(1e) center control nodes o, according to the annexation between node maximum transmitted radius R and described Euclidean distance d (x, y) judgement any two points, obtains maximum power topology G maxlimit set E (G max);
(1f) with node set V (G max) and described limit set E (G max), jointly form maximum power topology: G max=(V (G max), E (G max)).
4. topology control method according to claim 1, wherein the described center control nodes o of step (3) builds full mesh topology G=(V (G), E (G)), builds as follows:
(3a) initialization full mesh topology:
Center control nodes o is initialized to all nodes in the maximum power topology by the node set V of full mesh topology G (G), and the limit of full mesh topology G set E (G) is initialized to all limits in the maximum power topology;
Center control nodes o sets up set of minimal paths P={p g(x, y) }, p wherein g(x, y) is any a pair of node combination<x in node set V (G), the shortest path of y>in full mesh topology G, if limit (x, y) ∈ E (G),
Figure FDA0000381282350000025
Figure FDA0000381282350000026
for empty set, if limit
Figure FDA0000381282350000027
center control nodes o calculates p based on full mesh topology G g(x, y);
(3b) center control nodes o gathers all limits that were not traversed in E (G) by limit and sorts from big to small by degree of disturbance, selects the limit of degree of disturbance maximum
Figure FDA0000381282350000021
and set up test topology
Figure FDA0000381282350000022
for the whole nodes in node set V (G),
Figure FDA0000381282350000023
for limit set E (G) removes limit after set, if the limit in limit set E (G) all traveled through, full mesh topology G has built;
(3c) center control nodes o be take Euclidean distance as weight, the computing node combination
Figure FDA0000381282350000031
in test topology
Figure FDA0000381282350000032
in shortest path and judgement
Figure FDA0000381282350000034
can meet Euclidean distance t-Spanner characteristic, if can not meet, center control nodes o returns to step (3b), if can meet, center control nodes o performs step (3d);
(3d) center control nodes o finds out in set of minimal paths P and uses limit
Figure FDA0000381282350000035
all node combination<m, n>, form and to quote set: T ( x , y ) = { < m , n > | ( x ^ , y ^ ) &Element; p ( m , n ) , p ( m , n ) &Element; P } , If quote set T (x, y)for empty set, center control nodes o performs step (3f), if quote set T, is not empty set, center control nodes execution step (3e);
(3e) center control nodes o be take Euclidean distance as weight, and calculate and quote every couple of node combination<m in set T, n>in test topology
Figure FDA0000381282350000037
in shortest path
Figure FDA0000381282350000038
and judgement
Figure FDA0000381282350000039
can meet Euclidean distance t-Spanner characteristic, if there is at least one pair of node combination not meet, center control nodes o returns to step (3b), if quote all node combinations in set T, all can meet, center control nodes o execution step (3f);
(3f) center control nodes o is by limit from limit set E (G), leave out, if the limit that in limit set E (G), existence is not traversed, center control nodes o upgrades the degree of disturbance on limit in limit set E (G), and node is combined in test topology
Figure FDA00003812823500000312
in shortest path and quote and gather every couple of node combination<m in T, n>in test topology
Figure FDA00003812823500000314
in shortest path
Figure FDA00003812823500000315
be updated in set of minimal paths P, and return to step (3b), if the limit in limit set E (G) all traveled through, full mesh topology G has built.
5. topology control method according to claim 1, wherein in the described network of step (5) except center control nodes o all node u determine own logic neighbors according to described MSG message, and the transmitting power of adjustment oneself, carry out as follows:
(5a) node u, according to described MSG message, jumps neighbors v as the logic neighbors using one on full mesh topology G, and forms logic neighbors collection: LN u=v ∈ V (G) | (u, v) ∈ E (G) };
(5b) node u, according to the logic neighbors, is adjusted into the transmitting power of oneself the needed minimum power of logic neighbors that can cover farthest
Figure FDA00003812823500000316
,
Figure FDA00003812823500000317
6. topology control method according to claim 4, the shortest path in wherein said step (3a), step (3c) and step (3e), be by using dijkstra's algorithm or bellman-ford algorithm to calculate.
7. topology control method according to claim 4, the Euclidean distance T-spanner characteristic in wherein said step (3c), refer to the node combination
Figure FDA0000381282350000041
in test topology
Figure FDA0000381282350000042
in shortest path
Figure FDA0000381282350000043
meet
| p G ^ ( x ^ , y ^ ) | &le; t &times; | p G max ( x ^ , y ^ ) | ,
Wherein
Figure FDA0000381282350000045
| be the node combination
Figure FDA0000381282350000046
in test topology
Figure FDA0000381282350000047
in shortest path length,
Figure FDA0000381282350000048
for the node combination
Figure FDA0000381282350000049
at maximum power topology G maxin shortest path length, the parameter factors that t is the t-Spanner characteristic, value is 2 or 4.
CN201310416501.3A 2013-09-12 2013-09-12 Reduce the topology control method disturbing between link Active CN103442382B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310416501.3A CN103442382B (en) 2013-09-12 2013-09-12 Reduce the topology control method disturbing between link

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310416501.3A CN103442382B (en) 2013-09-12 2013-09-12 Reduce the topology control method disturbing between link

Publications (2)

Publication Number Publication Date
CN103442382A true CN103442382A (en) 2013-12-11
CN103442382B CN103442382B (en) 2016-05-25

Family

ID=49696034

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310416501.3A Active CN103442382B (en) 2013-09-12 2013-09-12 Reduce the topology control method disturbing between link

Country Status (1)

Country Link
CN (1) CN103442382B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103826280A (en) * 2014-03-10 2014-05-28 广州银禾网络通信有限公司 Mobile communication network route optimizing method and system
CN106131887A (en) * 2016-07-08 2016-11-16 西安电子科技大学 Distribution topology control method based on serial interference elimination
CN111277953A (en) * 2020-02-22 2020-06-12 杜义平 Communication network stability processing method and system and electronic equipment
CN114389956A (en) * 2022-01-03 2022-04-22 中国电子科技集团公司第二十研究所 Network topology automatic connection method based on interference node

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050075104A1 (en) * 2003-10-07 2005-04-07 Microsoft Corporation Model and method for computing performance bounds in multi-hop wireless networks
CN103200689A (en) * 2013-04-01 2013-07-10 东南大学 Link distribution method used for multichannel wireless Mesh network
CN103200643A (en) * 2013-03-28 2013-07-10 西安电子科技大学 Distributed fault-tolerant topology control method based on dump energy sensing

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050075104A1 (en) * 2003-10-07 2005-04-07 Microsoft Corporation Model and method for computing performance bounds in multi-hop wireless networks
CN103200643A (en) * 2013-03-28 2013-07-10 西安电子科技大学 Distributed fault-tolerant topology control method based on dump energy sensing
CN103200689A (en) * 2013-04-01 2013-07-10 东南大学 Link distribution method used for multichannel wireless Mesh network

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
XIJUN WANG,MIN SHENG,MENGXIA LIU,DAOSEN ZHAI,YAN ZHANG: "RESP: A k-Connected Residual Energy-Aware Topology Control Algorithm for Ad Hoc Networks", 《WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC)》, 10 April 2013 (2013-04-10), pages 1009 - 1013 *
王东，李发，李晓鸿: "一种QoS保证的容错拓扑控制算法", 《武汉大学学报·信息科学版》, vol. 35, no. 5, 31 May 2010 (2010-05-31), pages 512 - 515 *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103826280A (en) * 2014-03-10 2014-05-28 广州银禾网络通信有限公司 Mobile communication network route optimizing method and system
CN103826280B (en) * 2014-03-10 2017-05-17 广州银禾网络通信有限公司 Mobile communication network route optimizing method and system
CN106131887A (en) * 2016-07-08 2016-11-16 西安电子科技大学 Distribution topology control method based on serial interference elimination
CN106131887B (en) * 2016-07-08 2019-02-19 西安电子科技大学 Distribution topology control method based on serial interference elimination
CN111277953A (en) * 2020-02-22 2020-06-12 杜义平 Communication network stability processing method and system and electronic equipment
CN111277953B (en) * 2020-02-22 2020-11-13 杜义平 Communication network stability processing method and system and electronic equipment
CN114389956A (en) * 2022-01-03 2022-04-22 中国电子科技集团公司第二十研究所 Network topology automatic connection method based on interference node
CN114389956B (en) * 2022-01-03 2024-03-15 中国电子科技集团公司第二十研究所 Network topology automatic connection method based on interference node

Also Published As

Publication number Publication date
CN103442382B (en) 2016-05-25

Similar Documents

Publication Publication Date Title
Ahmed et al. Internet of Things (IoT) for smart precision agriculture and farming in rural areas
Mahmud et al. Adaptive hello interval in FANET routing protocols for green UAVs
Brar et al. Energy efficient direction-based PDORP routing protocol for WSN
Bagci et al. An energy aware fuzzy approach to unequal clustering in wireless sensor networks
Mao et al. An improved fuzzy unequal clustering algorithm for wireless sensor network
CN103200643B (en) Based on the distributed fault-tolerance topology control method of dump energy perception
Feng et al. Improved energy-balanced algorithm for underwater wireless sensor network based on depth threshold and energy level partition
Wang et al. Energy-efficient localized routing in random multihop wireless networks
Wen et al. Energy-efficient and delay-aware distributed routing with cooperative transmission for Internet of Things
CN105050095B (en) A kind of topological construction method of the heterogeneous wireless sensor net based on energy predicting
CN102244914A (en) Route recognizing method applicable to multihop wireless network
CN103442382B (en) Reduce the topology control method disturbing between link
CN107222900A (en) A kind of wireless sensor network node collaboration method based on dynamic chain
Micheletti et al. CER-CH: combining election and routing amongst cluster heads in heterogeneous WSNs
Qiu et al. A 3-D topology evolution scheme with self-adaption for industrial Internet of Things
Mohiddin et al. Routing path estimation based on RWS method for competent energy dissipation employing X-layer network
Waqas et al. A game theoretical approach for topology control in wireless ad hoc networks with selfish nodes
Pandey et al. Energy conservation and efficient data collection in WSN-ME: a survey
CN103826282A (en) Set partitioning multi-hop routing method based on dump energy
Datta Modified Ant-AODV-VANET routing protocol for vehicular adhoc network
Asif et al. Variable rate adaptive modulation (vram) for introducing small-world model into wsns
CN110049465A (en) A kind of water area monitoring communication means based on WSN
Gharajeh A neural-MCDM-based routing protocol for packet transmission in mobile ad hoc networks
CN104301983B (en) A kind of Poewr control method based on the estimation of multiple step format channel status
Benmahdi et al. Greedy forwarding routing schemes using an improved K-means approach for wireless sensor networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant