CN106792744A - Topology control method based on k points connection under two channel-connectivities of structure - Google Patents
Topology control method based on k points connection under two channel-connectivities of structure Download PDFInfo
- Publication number
- CN106792744A CN106792744A CN201611093640.7A CN201611093640A CN106792744A CN 106792744 A CN106792744 A CN 106792744A CN 201611093640 A CN201611093640 A CN 201611093640A CN 106792744 A CN106792744 A CN 106792744A
- Authority
- CN
- China
- Prior art keywords
- node
- subgraph
- neighbors
- points
- channel
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- 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
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- 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
- H04W52/46—TPC being performed in particular situations in multi hop networks, e.g. wireless relay 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 topology control method of k points connection under two channel-connectivities based on structure, prior art is mainly solved when primary user takes any one channel, some time users lose communication capacity and cause network to isolate and the interference problem between secondary user.Its implementation process is：1. the HELLO bags twice of each node broadcasts in network, set up local double bounce topology subgraph2. it is based onSet up the topological subgraph G of 1 point of connection of part ku；3. according to GuThe connection of k points is locally generated subgraph S under the structure guarantee time channel-connectivity of user two；4. the jump neighbors in S adjusts transmission power；5. full mesh topology is constituted by the link between all nodes and its logic neighbors in network, carry out channel distribution.The present invention can ensure the connection of network k points while secondary two channel-connectivity of user network is ensured, eliminate time user and disturb, and improve the robustness of network, can be used in cognitive Ad Hoc networks.
Description
Technical field
The invention belongs to wireless communication field, more particularly to topology control method can be used for cognitive Ad Hoc networks.
Background technology
Among many factors of influence cognition Ad Hoc network performances, the topological structure of network is very important one
Aspect, thus how to optimize cognitive Ad Hoc networks topological structure, enhancing network topology fault-tolerant ability and be upper layer communication
Agreement provides the emphasis that good bottom topological support is Topology Control research.
Cognitive Ad Hoc networks family is divided into two classes, and a class is primary user, and another kind of is time user, and primary user enjoys channel
Preferential right, when primary user does not use channel, secondary user can use the channel.Because secondary user can only connect to opportunistic
Enter channel, the connectedness of secondary user network is easily influenceed by primary user, when primary user will use certain channel, secondary user
The channel will be vacated for the proper communication for protecting primary user and in silent status, node of mourning in silence can reduce time user network
Connectedness, the segmentation of network can be caused when serious, the influence connective to secondary user network in order to reduce primary user, researcher
Some Topology Control Algorithms, the article that such as Hai Liu authors deliver on IEEE ICCCN 2012 have been proposed
" Generalized-Bi-Connectivity for Fault Tolerant Cognitive Radio Network " and
Article " the Achieving Bi-Channel- that the authors such as Xijun Wang deliver on IEEE JSAC 2014
Connectivity with Topology Control in Cognitive Radio Networks " etc. can ensure time use
The connection of family network, and the interference between time user can be eliminated, but these methods only individually consider primary user's occupancy
After any one channel, the basic connectivity of network is merely ensured that.
When time user is because of depleted of energy in network or other emergency situations, such as hardware damage occurs and loses and other use
During the ability of family communication, it is equally possible to cause the segmentation of network so that effective connection cannot be set up between secondary user, in this feelings
Under condition, in order to strengthen the fault-tolerant ability of network, researcher has been proposed that some Topology Algorithms, and such as Ning Li authors are in IEEE
Article " the Localize Fault-Topology Control in Wireless Ad Hoc delivered on TPDS
Networks ", but the algorithm only individually considers the k points connection for ensureing network, does not consider influence of the primary user to secondary user, leads
Time user network is there may be segmentation when causing primary user to take any one channel so that cannot be set up between secondary user and effectively connected
Connect.
The content of the invention
It is an object of the invention to be directed to above-mentioned problem of the prior art, k under a kind of two channel-connectivities based on structure is proposed
The topology control method of point connection, so that after the channel that primary user arbitrarily takes network, secondary user network is still for k points connect
It is logical, it is ensured that when any k-1 node loses the communication capacity with other nodes, secondary user network remains to set up secondary user network
Effective connection, while the interference between time user is eliminated, the effective robustness for improving network.
To achieve these goals, it is of the invention to realize step including as follows：
(1) initialization network is the connection of k points, and each node u obtains the sequence number of a jump and two hop nodes respectively in network
And positional information, k >=2；
(2) local double bounce topology subgraph is set up according to sequence number and positional informationWherein,ForNode set,ForLine set；
(3) based on local double bounce topology subgraphEach node u sets up the topological subgraph G of part k-1 points connectionu；
The topological subgraph of (3a) initialization part k-1 point connectionsNode u is according to GuFind its neighbors set
PNu, and build the topological subgraph SN of k-1 points connectionu；
(3a1) initializes the topological subgraph of k-1 points connectionNode set
ForBy node setMiddle any two points are in GuIn corresponding side assignLine setI.e.Wherein, E (x, y) ∈ E (Gu),{ u } represents the collection of node u compositions
Close, PNuFor node u existsIn one jump neighbors set；
(3a2) judges with maximum-flow algorithmWhether it is the connection of k-1 points：If so, thenJump to step
(4) step (3b), otherwise, is performed；
(3b) initializes the topological subgraph of the 2nd k-1 points connection
(3b1) judgesWhether it is empty set：If so, then jumping to step (3c), otherwise, step is performed
(3b2)；
(3b2) judges with maximum-flow algorithmWhether it is the connection of k-1 points：If so, thenJump to step
(4)；Otherwise, will according to sequence node numberIn node m add vertex setI.e.Simultaneously by node setIn any two node existIn corresponding side assignI.e.Return to step (3b1), wherein,
(3c) initializes the topological subgraph of the 3rd k-1 points connection
(3c1) judges with maximum-flow algorithmWhether it is the connection of k-1 points：If so, thenJump to step
(4) step (3c2), otherwise, is performed；
(3c2) node u knows that its h jumps the information of neighbors according to step (1) and step (2), obtains V (Gu) all neighbours
NodeWill according to sequence node numberIn node w sequentially addNode setAnd Gu's
Node set V (Gu), i.e.,Simultaneously by node w and V (Gu) in
The incidence edge of node is addedLine set and GuLine set, i.e., Return to step (3c1), wherein, c ∈ V (Gu),And
(4) topological subgraph G is connected according to local k-1 pointsu, each node u calculates any two the node of annexation
Link energy consumption weight w between x, yp(x, y)=Px,yWith link range weight wd(x, y)=dx,y, wherein, x, y ∈ V (Gu),
Px,yThere is the node x of annexation for any two, the minimum transmit power required for directly being transmitted between y, dx,yIt is any two
The individual node x for having an annexation, the Euclidean distance between y；
(5) each node u builds and is locally generated subgraph S=(V (S), E (S)) in network, and according to being locally generated subgraph S
Obtain the logic conflicting nodes set LCN of each node uu, the node set of wherein V (S) expressions S, the side collection of E (S) expressions S
Close；
(6) each node u is locally generated subgraph S and logic according to what the topology information that other nodes v sends updated oneself
Conflict neighbors set LCNu, the jump neighbors on subgraph S will be locally generated as logic neighbors, constitute logic neighbors
Set：Wherein, v ∈ V (S) and E (u, v) ∈ E (S), i.e. node v belong to the node set V for being locally generated subgraph S
And the corresponding side E (u, v) of node u and v belong to the line set E (S) for being locally generated subgraph S (S)；
(7) each node u determines the transmission power of oneself in network, will transmission power be adjusted to cover it is all
Minimum power required for logic neighbors：Wherein, Pu,vNeeded for expression node u to node v
Minimum emissive power；
(8) link combinations between all nodes and each node and the logic neighbors of oneself in network are got up,
The final full mesh topology of composition, i.e. G=(V (G), E (G)), wherein, V (G) is all nodes in network, and E (G) is institute in network
There is side；
(9) channel distribution is carried out to each node u in the final full mesh topology G that has built using greedy coloring algorithm.
The invention has the advantages that：
1) joint Power control of the present invention and channel distribution, by Power Control so that primary user arbitrarily takes a channel
The k points connection of time user network is also ensured afterwards；Distribute different channels to by channel distribution the secondary user for interfering, from
And eliminate the interference between time user.
2) present invention is suitable for the topology of channel distribution by Power Control structure, it is to avoid the connectedness of complexity high is sentenced
It is disconnected, so as to reduce the overall complexity of algorithm.And secondary user only needs the local topology information, therefore algorithm can to transport in a distributed manner
OK.
3) joint Power control of the present invention and node degree control, reduce channel needed for the transmission power and network of node
Number.
Brief description of the drawings
Fig. 1 is the applicable cognitive Ad Hoc networks schematic diagram of a scenario of the present invention；
Fig. 2 realizes general flow chart for of the invention；
Fig. 3 is the peak power topology that the present invention is formed in 50 meshed network scenes；
Fig. 4 is that the sub-process figure for being locally generated subgraph is built in the present invention；
Fig. 5 is acquisition k-1 point connected subgraphs SN in the present inventionuWith local k-1 points topology subgraph GuSub-process figure；
Fig. 6 for the present invention in k-1 point connected subgraphs SNuMiddle structure spanning subgraph SNu' sub-process figure；
Fig. 7 in the present invention according to conflict subgraph CSuMiddle structure second order spanning subgraph Su' sub-process figure；
Simulating, verifying figures of the Fig. 8 to present invention generation topology；
Fig. 9 is simulation comparison figure of the average transmission radius obtained to the present invention under different value of K；
Figure 10 is simulation comparison figure of the average channel number obtained to the present invention under different value of K；
Figure 11 is simulation comparison figure of the maximum channel number obtained to the present invention under different value of K.
Specific embodiment
Embodiment of the present invention and effect are described in further detail below in conjunction with accompanying drawing.
Reference picture 1, the cognitive Ad Hoc networks that the present invention is used are distributed in the node group in two dimensional surface region by n
Into.Time user of each node on behalf one, and with unique sequence number, it is possible to by GPS or other location technologies come
Obtain the positional information of its own.All of node is influenceed by same primary user, and primary user can be using in C channel
Any one channel.Each node can send data in the channel of any one in C channel, while in other all letters
Interception data on road, in addition each node do not deposited at aspects such as physical arrangement, initial setting up, functional characteristic, parameter indexs
In any difference.In a network, the wireless channel between arbitrary node is additive white Gaussian noise channel.Node passes through omnidirectional antenna
Communicated with surroundings nodes, maximum transmission power is Pmax.The transmission power P of arbitrary node uuCan be between a minimum and a maximum
Continuously adjust, i.e. 0≤Pu≤Pmax.Transmission radius r is transmission range corresponding to node transmitting power, any two node it
Between to there is the necessary and sufficient condition of Radio Link be the transmission radius r of Euclidean distance between them less than or equal to node.
Reference picture 2, it is of the invention to realize that step is as follows：
Step 1, each node u sends the first node information HELLO-1 bags of oneself in network, and receives a jump neighbors
The HELLO-1 bags of transmission.
(1a) topological structure for being formed when each node is using maximum power transfer in network is peak power topology,
As shown in figure 3, peak power topological representation is：Gmax=(V (Gmax),E(Gmax)), wherein V (Gmax) it is node set, represent net
Network node, E (Gmax) it is line set, the Radio Link existed between representing node；
(1b) is located at all node v in the transmission radius of node u1, a jump neighbors set of composition node u Wherein, v1∈V(Gmax) and node u and v1Between there is annexation, i.e. both corresponding side E (u, v1)
Belong to E (Gmax), node v1It is 1 jump with the distance of node u；
Each node u in (1c) network is with maximum transmission power PmaxA HELLO-1 is broadcasted to a jump neighbors of u
Bag, the positional information of the sequence number containing node u and node u in the HELLO-1 bags；
Each node u in (1d) network receives one and jumps neighbors with maximum transmission power PmaxThe HELLO-1 bags of broadcast.
Step 2, the first node information HELLO-1 bags in above-mentioned steps 1, each node u sends oneself in network
Section Point information HELLO-2 bags, and receive one jump neighbors send HELLO-2 bags.
All nodes that (2a) node u is jumped using one and double bounce can be reached, the double bounce neighbors set of configuration node u Wherein, v2∈V(Gmax) and node v2At least with node u one jumps neighbors setIn
There is incidence edge in one node,For node u one jumps neighbors set, node v2It is 2 jumps with the distance of node u；
After each node u in (2b) network has received all one HELLO-1 bags for jumping neighbors transmission, with emission maximum
Power PmaxA HELLO-2 bag is broadcasted to a jump neighbors of u, and receives one and jump the HELLO-2 bags that neighbors sends,
Containing u all one jump the sequence number and positional information of neighbors in HELLO-2 bags.
Step 3, each node u builds the local double bounce topology subgraph of oneself in network
The first node information HELLO-1 that each node u in (3a) network sends according to the jump neighbors for receiving
With Section Point information HELLO-2 bags, oneself all double bounce neighbors v is obtained and recorded12Sequence number and positional information, wherein
(3b) each node u calculates any two according to the positional information of oneself and the positional information of double bounce neighbors
Minimum emissive power required for directly being transmitted between node x and yWherein,β is according to reception
The received signal to noise ratio threshold value that the sensitivity of machine and bit error rate requirement determine, α is path-loss factor, dx,yIt is node x, between y
Euclidean distance；
(3c) is according to the minimum emissive power P for calculatingx,y, the annexation between double bounce neighbors is judged, if Px,yIt is less than
The maximum transmission power P of nodemax, it is determined that there is annexation between node x and y；Otherwise, do not exist between node x and y
Annexation；
(3d) each node u sets up local double bounce topology subgraph according to the annexation between double bounce neighborsWhereinNode set be Line set beForIn any two node x and y, when the transimission power needed for x to y is less than its maximum transmission power, by node x and
The corresponding side E (x, y) of y assignI.e.Wherein, { u } represents the set of node u compositions.
Step 4, each node u builds the topological subgraph G of local k-1 points connection of oneself in networku。
Reference picture 4, this step is implemented as follows：
The topological subgraph of (4a) initialization part k-1 point connectionsBuild the topological subgraph SN of k-1 points connectionu：
(4a1) initializes the topological subgraph of k-1 points connectionNode set
ForBy node setMiddle any two points are in GuIn corresponding side assignLine setI.e.Wherein, E (x, y) ∈ E (Gu),{ u } represents the collection of node u compositions
Close, PNuFor node u existsIn one jump neighbors set；
(4a2) judges with maximum-flow algorithmWhether it is the connection of k-1 points：If so, thenJump to step
(4d), otherwise, performs step (4b)；
(4b) initializes the topological subgraph of the 2nd k-1 points connection
(4b1) judgesWhether it is empty set：If so, then jumping to step (4c), otherwise, step is performed
(4b2)；
(4b2) judges with maximum-flow algorithmWhether it is the connection of k-1 points：If so, thenJump to step
(4d), otherwise, will according to sequence node numberIn node m add the 2nd k-1 points topological subgraph of connection
Node setI.e.Simultaneously by node setIn any two node exist
Local double bounce topology subgraphIn corresponding side assignI.e.Return to step (4b1), wherein,
(4c) initializes the topological subgraph of the 3rd k-1 points connection
(4c1) judges with maximum-flow algorithmWhether it is the connection of k-1 points：If so, thenJump to step
(4d), otherwise, performs step (4c2)；
(4c2) node u knows that its h jumps the information of neighbors according to step 1 and step 2, obtains V (Gu) all neighborsWill according to sequence node numberIn node w sequentially addNode setAnd GuNode
Set V (Gu), i.e.,Simultaneously by node w and V (Gu) in it is any
Incidence edge E (c, w) of node c adds the topological subgraph of the 3rd k-1 points connectionLine set topological son is connected with part k-1 points
Figure GuLine set, i.e.,Return to step (4c1),
Wherein, c ∈ V (Gu),And
Above step (4a) arrives step (4c), as shown in Figure 5；
(4d) connects topological subgraph G according to local k-1 pointsu, each node u calculates any two the node of annexation
Link energy consumption weight w between x, yp(x, y)=Px,yWith link range weight wd(x, y)=dx,y, wherein, x, y ∈ V (Gu),
Px,yFor any two has the minimum transmit power required for directly being transmitted between the node x and y of annexation, dx,yIt is any two
The individual Euclidean distance having between the node x and y of annexation.
Step 5, each node u builds and is locally generated subgraph S in network, and determines the logic neighbors of oneself.
Each node u in (5a) network will be locally generated node set V (S) initialization of subgraph S=(V (S), E (S))
Topological subgraph G is connected into local k-1 pointsuIn all nodes, i.e.,Line set E (S) is initialized to sky
Collection；
(5b) connects topological subgraph G according to local k-1 pointsu, minimum generation is built with kruskal minimal spanning tree algorithms
Tree Tu, and according to k-1 point connected subgraphs SNu, with FLSSkAlgorithm builds the k-1 points connection spanning subgraph with minimum node degree
SNu'：
Reference picture 6, this step is implemented as follows：
(5b1) initialization k-1 point connection spanning subgraphs SNu'=(V (SNu'),E(SNu')), make SNu' line set E
(SNu') it is E (SNu), SNu' node set E (SNu') it is E (SNu)；
(5b2) is by E (SNu') in side with link range weight wp (x, y) be link energy consumption weight wd (x, y) descending arrange
Row, make m represent line set E (SNu') in element number, loop initialization factor i=0；
(5b3) judges whether i is equal to m：If so, jumping to step (5c), otherwise, step (5b4) is performed；
(5b4) is by line set E (SNu') in weight limit side E (x, y) from E (SNu') middle removal, i.e.,The side right is reset zero simultaneously and i=i+1 is made；With maximum-flow algorithm decision node
X and y are in SNu' in whether there is k-1 bars point uninterrelated path：If so, return to step (5b3), otherwise, by side E (x, y) addition
To k-1 points connection spanning subgraph SNu' in, i.e.,Return to step (5b3)；
(5c) is according to minimum spanning tree Tu=(V (Tu),E(Tu)) connect spanning subgraph SN with k-1 pointsu' build single order generation
Subgraph Su=(V (Su),E(Su)), SuNode set beSuLine set beAnd renewal is locally generated subgraph S, i.e.,Wherein, V (Tu) represent TuNode
Set, E (Tu) represent TuLine set,Represent assignment；
Each node u in (5d) network is according to single order spanning subgraph SuIts physics neighbors and conflict neighbors are found,
Respectively constitute neighbors set PNuWith conflict neighbors set CNu, and initialization logic conflict neighbors set LCNuAnd conflict
Subgraph CSu=(V (CSu),E(CSu)), wherein,
E(x,y)∈E(Gu), x, y ∈ CNu；The neighbors set of node u is defined as：Along SuOne jumps the collection that reachable all nodes are constituted
CloseI.e.The conflict neighbors set of node u is defined as：Along SuThe set that the reachable all nodes of double bounce are constitutedI.e. It is expressed as a jump neighbors set of node uIn each node the adjacent section of physics
The node set of point composition；
(5e) judges the neighbors set PN of u with maximum-flow algorithmuMiddle any two node is in conflict subgraph CSuIn be
It is no to there is k-1 bars point uninterrelated path：If so, then performing step (5f), otherwise, step (5g) is jumped to；
(5f) node u is in conflict subgraph CSuUpper structure second order spanning subgraph Su'：
Reference picture 7, this step is implemented as follows：
(5f1) node u is by second order spanning subgraph Su'=(V (Su′),E(Su')) in point set be initialized as CSuIn
All nodes, i.e.,Line set is initialized asWherein x, y ∈ V (Su'), E
(x,y)∈E(CSu), will node set V (Su') in any two points in conflict subgraph CSuIn corresponding side assign second order life
Into subgraph Su' line set E (Su')；
(5f2) is by E (Su') in side with link range weight wp (x, y) for link energy consumption weight wd (x, y) carries out descending
Arrangement, makes n represent set E (SNu') in element number, loop initialization factor j=0；
(5f3) judges whether j is equal to n：If so, jumping to step (5j), otherwise, step (5f4) is performed；
(5f4) is by E (Su') in weight limit side E (x, y) from E (Su') middle removal, i.e.,The side right is reset zero simultaneously and j=j+1 is made；The adjacent section of u is judged with maximum-flow algorithm
Point set PNuMiddle any two node is in Su' in whether there is k-1 bars point uninterrelated path：If so, return to step (5f3), no
Then, side E (x, y) is added to Su' in, i.e.,Return to step (5f3)；
(5g) judges the neighbors set PN of u with maximum-flow algorithmuMiddle any two node is in GuWhether there is k- in u
1 point uninterrelated path：If so, performing step (5h), otherwise, step (5i) is jumped to, wherein, GuU represent that local k-1 points connect
Logical topology subgraph GuRemove the spanning subgraph of node u and its incidence edge；
(5h) is according to step (5f1)-(5f4) in GuSecond order spanning subgraph S is built on uu', meanwhile, by neighbour's section of node u
Point set PNuNode P on middle any two node k-1 pathsk-1It is added to the logic conflict neighbors set LCN of node uu
In, i.e.,Step (5j) is jumped to, wherein, GuU represent the topological subgraph G of local k-1 points connectionuRemove
The spanning subgraph of node u and its incidence edge；
(5i) node u obtains its h and jumps neighborhood information using the method for step 1 and step 2, builds part h and jumps topology
FigureAndUpper structure second order spanning subgraph Su', wherein,RepresentRemove the life of node u and its incidence edge
Into subgraph：
(5i1) initialization part h jumps topological subgraphInitializationNode set be Line set
(5i2) node u knows that its h jumps the information of neighbors using the method for step 1 and step 2 by sending Hello bags,
ObtainAll neighborsBy nodeNeighbors w be added to point setRushed with logic
Prominent neighbors set LCNuIn, while side E (c, w) is added toLine set in, i.e., Wherein,And{ w } table
Show the set of node w compositions；
The neighbors set PN of (5i3) decision node uuMiddle any two node existsIn with the presence or absence of k-1 bars point not
Introductory path：If so, performing step (5i4), otherwise, return to step (5i2)；
(5i4) exists with reference to the method for step (5f1)-(5f4)Upper structure second order spanning subgraph Su', meanwhile, by PNu
Node P on middle any two node k-1 pathsk-1It is added to LCNuIn, i.e.,
(5j) node u is by second order spanning subgraph Su' line set E (Su') recorded the line set E for being locally generated subgraph S
(S) in, i.e.,By second order spanning subgraph Su' node set V (Su') recorded and be locally generated son
In the node set V (S) of figure S, i.e.,Node u is by way of flooding LCNuWith the topology of E (S)
Information is sent to all nodes in S；
(5k) each node u updates being locally generated subgraph S and patrolling for oneself according to the topology information that other nodes send
Collect conflict neighbors set LCNu, the jump neighbors v on subgraph S will be locally generated as logic neighbors, and constitute logic
Neighbors set：LNu=v ∈ V (S) | and (u, v) ∈ E (S) }, LNuRepresent the logic neighbors set of node u；
(5l) updates side collection informationAll node generations are total during wherein E (S') represents network
Generation figure line set；
Kruskal algorithms are delivered with reference to J.B.Kruskal on PASM 1956 wherein described in above-mentioned steps (5b) "
On the shortest spanning subtree of a graph and the traveling salesman
problem"pp.48-50；Utilization FLSS described in above-mentioned steps (5b)kMiddle inference builds Local Minimum node degree k-1 points and connects
Article " the Localized Fault- that logical subgraph algorithm is delivered with reference to authors such as Ning Li on IEEE TPDS 2006
Tolerant Topology Control in Wireless Ad Hoc Networks”；Used in above-mentioned steps 4 and step 5
Maximum-flow algorithm sentence it is local whether the connection of k-1 points, delivered with reference to authors such as ShimonEven and R.Endre Tarjan
“Network Flow and Testing Graph Connectivity”。
Step 6, each node u determines the transmission power of oneself in network, will transmission power be adjusted to cover
Minimum power required for all logic neighbors：Wherein, pu,vRepresent that u is saved to logic is adjacent
Minimum emissive power needed for point v.
Step 7, according to above topology control process, each node disjoint in network determines and the logic neighbors of oneself
Annexation, the link combinations between all nodes and each node and the logic neighbors of oneself in network are got up,
Constitute final full mesh topology, i.e. G=(V (G), E (G)), wherein V (G)=V (Gmax) it is all nodes in network, E (G) net
All sides in network, that is to say the set of the link composition in network between each node and the logic neighbors of oneself.
Step 8, channel point is carried out using greedy coloring algorithm to each node u in the final full mesh topology that has built
Match somebody with somebody.
(8a) node u maximum transmit power PmaxBroadcast request distributes channel bag RAC on a common control channel, other
Node needs transfer bag again when this bag is received, until logic conflict neighbors set LCNuIn all nodes all connect
Untill receiving RAC bags；
The logic conflict neighbors set LCN of (8b) node uuIn all nodes after RAC bags are received, check oneself
The channel of distribution, and feedback channels distribution bag AC gives node u, it is the allocated to contain the node in wherein channel distribution bag AC
Channel, empty bag is designated as if the also unallocated channel of the node by bag AC；
(8c) node u collects all LCNuIn node feedback AC bags, select primary from also unappropriated channel
The minimum channel of family acquistion probability, as the available channel of oneself；
(8d) each node disjoint performs said process, untill all nodes all distribute channel.
Effect of the invention can be further illustrated by emulation：
(1) simulated conditions
In simulating scenes, network node is evenly distributed on a 1000 × 1000m at random2Two dimensional surface region in,
The threshold value of received signal to noise ratio SNR is set to -80dBm, path-loss factor α values are 4；All nodes use phase in network
Same maximum transmission power, wherein maximum transmission power Pmax=256mW, corresponding maximum transmitted radius Rmax=400m；Assuming that
Primary user influences whether all of user node.
(2) emulation content and result
Emulation 1, generates topological network, as a result as shown in figure 8, wherein with the present invention in the scene of 50 nodes
Fig. 8 (a) is peak power topology；
Fig. 8 (b) is the topology of generation, and numeral therein represents the channel of node distribution；
The topology of time user network when Fig. 8 (c) represents that primary user takes a channel；
Fig. 8 (d) represents that primary user takes a channel, while when having a node to lose the communication capacity with other nodes
The topology of secondary user network；
Fig. 8 (e) represents that primary user takes a channel, while when having two nodes to lose the communication capacity with other nodes
The topology of secondary user network；
By Fig. 8 (a) -8 (e) as can be seen that the topology that the inventive method is generated arbitrarily takes a channel in primary user
When, the network of secondary user is still the connection of k-1 points.
Emulation 2, with the inventive method and existing peak power topology MaxPower to the different k of node average transmission radius
Value is emulated, as a result as shown in Figure 9.
As seen from Figure 9, with network time user node number increase, the average transmission of peak power topology MaxPower
Radius keeps constant, is 400m, and average transmission radius of the invention is continuous with the increase of in network user node number
Reduce, and with the increase of k, average transmission radius is continuously increased；Meanwhile, as k=2, the transmission radius of the inventive method is small
In CBCC algorithms, it is seen that the inventive method can well reduce the energy consumption of node, increase the life cycle of network.
Emulation 3, with the inventive method and existing peak power topology MaxPower to the different value of K of required average channel number
Emulated, as a result as shown in Figure 10.
As seen from Figure 10, with network time user node number increase, the average letter of peak power topology MaxPower
Road number linearly increases, and average channel number is less needed for the inventive method, and with network time user node number increase, put down
The equal number of channel slowly increases, and with the increase of k, average channel number also slowly increases, while the inventive method as k=2
Required average channel number is less than CBCC algorithms.
Emulation 4, is carried out with peak power topology MaxPower with the inventive method to the different value of K of required maximum channel number
Emulation, as a result as shown in figure 11.
From Figure 11, with increasing in network user node number, the maximum institute of peak power topology MaxPower
The number of channel is needed linearly to increase, the number of channel needed for the inventive method is maximum is less, and with the network increasing of user node number
Many, the maximum required number of channel slowly increases, and with the increase of k, average channel number also slowly increases, meanwhile, as k=2, this
The required maximum channel number of inventive method is less than maximum channel needed for CBCC algorithms.
Can show that the present invention not only greatlys save channel resource from Figure 10 and Figure 11, and ensure that the k points of network
Connection, so that network has good robustness.
Claims (9)
1. the topology control method based on k points connection under two channel-connectivities of structure, comprises the following steps：
(1) initialization network is the connection of k points, and each node u obtains sequence number and the position of a jump and two hop nodes respectively in network
Confidence ceases, k >=2；
(2) local double bounce topology subgraph is set up according to sequence number and positional informationWherein,ForNode set,ForLine set；
(3) based on local double bounce topology subgraphEach node u sets up the topological subgraph G of part k-1 points connectionu；
The topological subgraph of (3a) initialization part k-1 point connectionsNode u is according to GuFind its neighbors set PNu, and
Build the topological subgraph SN of k-1 points connectionu；
(3a1) initializes the topological subgraph of k-1 points connectionNode setForBy node setMiddle any two points are in GuIn corresponding side assignLine setI.e.Wherein, E (x, y) ∈ E (Gu),{ u } represents the collection of node u compositions
Close, PNuFor node u existsIn one jump neighbors set；
(3a2) judges with maximum-flow algorithmWhether it is the connection of k-1 points：If so, thenStep (4) is jumped to, it is no
Then, step (3b) is performed；
(3b) initializes the topological subgraph of the 2nd k-1 points connection
(3b1) judgesWhether it is empty set：If so, then jumping to step (3c), otherwise, step (3b2) is performed；
(3b2) judges with maximum-flow algorithmWhether it is the connection of k-1 points：If so, thenJump to step (4)；
Otherwise, will according to sequence node numberIn node m add vertex setI.e.Simultaneously by node setIn any two node existIn corresponding side assignI.e.Return to step (3b1), wherein,
(3c) initializes the topological subgraph of the 3rd k-1 points connection
(3c1) judges with maximum-flow algorithmWhether it is the connection of k-1 points：If so, thenStep (4) is jumped to,
Otherwise, step (3c2) is performed；
(3c2) node u knows that its h jumps the information of neighbors according to step (1) and step (2), obtains V (Gu) all neighborsWill according to sequence node numberIn node w sequentially addNode setAnd GuNode
Set V (Gu), i.e.,Simultaneously by node w and V (Gu) interior joint
Incidence edge addLine set and GuLine set, i.e., Return to step (3c1), wherein, c ∈ V (Gu),And
(4) topological subgraph G is connected according to local k-1 pointsu, each node u calculate any two have annexation node x, y it
Between link energy consumption weight wp(x, y)=Px,yWith link range weight wd(x, y)=dx,y, wherein, x, y ∈ V (Gu), Px,yTo appoint
Meaning two has the node x of annexation, the minimum transmit power required for directly being transmitted between y, dx,yIt is that any two has connection
The node x of relation, the Euclidean distance between y；
(5) each node u builds and is locally generated subgraph S=(V (S), E (S)) in network, and is obtained according to subgraph S is locally generated
The logic conflicting nodes set LCN of each node uu, the node set of wherein V (S) expressions S, the line set of E (S) expressions S；
(6) each node u is locally generated subgraph S and logic conflict according to what the topology information that other nodes v sends updated oneself
Neighbors set LCNu, the jump neighbors on subgraph S will be locally generated as logic neighbors, constitute logic neighbors collection
Close：Wherein, v ∈ V (S) and E (u, v) ∈ E (S), i.e. node v belong to the node set V (S) for being locally generated subgraph S
And the corresponding side E (u, v) of node u and v belong to the line set E (S) for being locally generated subgraph S；
(7) each node u determines the transmission power of oneself in network, will transmission power be adjusted to that all logics can be covered
Minimum power required for neighbors：Wherein, Pu,vNeeded for expression node u to node v most
Small transmission power；
(8) link combinations between all nodes and each node and the logic neighbors of oneself in network are got up, is constituted
Final full mesh topology, i.e. G=(V (G), E (G)), wherein, V (G) is all nodes in network, and E (G) is all sides in network；
(9) channel distribution is carried out to each node u in the final full mesh topology G that has built using greedy coloring algorithm.
2. the topology control method for being connected based on k points under two channel-connectivities of structure according to claim 1, wherein step (1)
It is middle obtain respectively one jump and double bounce neighbors sequence number and positional information, refer in network each node u with emission maximum work(
Rate PmaxA first node information HELLO-1 bag is broadcasted respectively to positioned at all nodes in oneself transmission radius
With Section Point information HELLO-2 bags, and receive one jump neighbors send HELLO-1 bags and HELLO-2 bags, wherein, this
HELLO-1 bags include the sequence number of u node and positional information, and containing u all one jump the sequence of neighbors in HELLO-2 bags
Number and positional information.
3. the topology control method that k points are connected under two channel-connectivities based on structure according to claim 1, wherein step
(2) local double bounce topology subgraph is set up inCarry out as follows：
First node information HELLO-1 bags and Section Point information of (2a) each node u according to the jump neighbors for receiving
HELLO-2 bags, obtain and record the sequence number and positional information of the HELLO-1 bags and HELLO-2 bag interior joints, these node structures
Into the double bounce neighbors collection of node uWherein described HELLO-1 bags include the sequence number of u node and positional information, described
Containing u all one jump the sequence number and positional information of neighbors in HELLO-2 bags；
(2b) each node u calculates any two node according to the positional information of oneself and the positional information of double bounce neighbors
Minimum emissive power required for directly being transmitted between x, yWherein,β is the spirit according to receiver
The received signal to noise ratio threshold value that sensitivity and bit error rate requirement determine, α is path-loss factor, dx,yIt is node x, it is European between y
Distance, if Px,yLess than the maximum transmission power P of nodemax, it is determined that node x, there is annexation between y；Otherwise, node x,
Do not exist annexation between y；
(2c) each node u sets up local double bounce topology subgraph according to the annexation between double bounce neighborsWhereinNode set beLocal double bounce topology subgraphSide collection
It is combined intoForIn any two node x and y, when between x and y required transimission power be less than its maximum transmitted work(
During rate, the corresponding side E (x, y) of node x and y is assignedI.e.Wherein, { u } represents node u groups
Into set.
4. the topology control method that k points are connected under two channel-connectivities based on structure according to claim 1, wherein step
(5) built in and be locally generated subgraph S, carried out as follows：
The node set V (S) that each node u in (5a) network will be locally generated subgraph S is initialized to the connection of local k-1 points and opens up
Flutter subgraph GuAll nodes, line set E (S) is initialized to empty set；
(5b) connects topological subgraph G according to local k-1 pointsu, minimum spanning tree T is built with minimal spanning tree algorithmu=(V
(Tu),E(Tu)), and according to k-1 point connected subgraphs SNu, with FLSSkAlgorithm builds the k-1 points with minimum node degree and connects
Spanning subgraph SNu'=(V (SNu'),E(SNu')), obtain single order spanning subgraph Su=(V (Su),E(Su)), renewal is locally generated
Subgraph S, i.e.,Wherein, V (Tu) represent TuNode set, E (Tu) represent TuLine set, V (SNu') represent
SNu' node set, E (SNu') represent SNu' line set, SuNode set beSu's
Line set is
Each node u in (5c) network is according to single order spanning subgraph SuFind its adjoining point set PNuWith conflicting nodes set
CNu, initialization logic conflict neighbors setAnd according to SuBuild second order spanning subgraph Su'=(V (Su′),E
(Su')), renewal is locally generated subgraph S, i.e.,Wherein, V (Su') it is Su' node set, E (Su') it is Su' side
Set；
(5d) is by neighbors set PNuIn node P of any two node on the k-1 paths in SvRecorded logic conflict adjacent
Node set LCNuIn, i.e.,Node u is by way of flooding LCNuTopology information with E (S) is sent out
Give all nodes in S.
5. the topology control method that k points are connected under two channel-connectivities based on structure according to claim 4, wherein step
FLSS is used in (5b)kAlgorithm, topological subgraph SN is connected according to k-1 pointsuBuild the k-1 points connection generation with minimum node degree
Subgraph SNu'=(V (SNu'),E(SNu')), carry out as follows：
(5b1) initialization k-1 point connection spanning subgraphsThat is SNu' line set E (SNu') it is E (SNu), node
Set E (SNu') it is E (SNu)；
(5b2) is by E (SNu') in side with link range weight wp(x, y) is link energy consumption weight wd(x, y) descending is arranged, by
It is secondary by weight limit side E (x, y) from E (SNu') middle removal, i.e.,Simultaneously by the side right
Reset zero；
(5b3) is with maximum-flow algorithm decision node x and y in SNu' in whether there is k-1 bars point uninterrelated path：If so, continuing
Remove weight limit side, otherwise, side E (x, y) is re-added to k-1 points connection spanning subgraph SNu' in, i.e.,E (the SN in having traveled through line setu') all sides.
6. the topology control method that k points are connected under two channel-connectivities based on structure according to claim 4, wherein step
(5c) node u is according to single order spanning subgraph SuBuild second order spanning subgraph Su', carry out as follows：
Each node u in (5c1) network is according to single order spanning subgraph SuIts physics neighbors and conflict neighbors are found, respectively
Constitute neighbors set PNuWith conflict neighbors set CNu, and initialization logic conflict neighbors set LCNuWith conflict subgraph
CSu=(V (CSu),E(CSu)), wherein,E(x,
y)∈E(Gu), x, y ∈ CNu；
(5c2) judges the neighbors set PN of uuIn any two node in conflict subgraph CSuIn with the presence or absence of k-1 bars point not phase
Close path：
If so, then node u is in CSuUpper structure second order spanning subgraph Su'=(V (Su′),E(Su')), wherein V (Su') represent Su'
Node set, E (Su') represent Su' line set；
Otherwise, the neighbors set PN of u is judgeduIn any two node in GuWhether there is k-1 bars point uninterrelated path in u：
If so, node u is in GuSecond order spanning subgraph S is built on uu′；Otherwise, node u need to obtain h and jump neighborhood information, build part h
Jump topological subgraphAndUpper structure second order spanning subgraph Su', wherein, GuU represent GuRemove
The spanning subgraph of node u and its incidence edge,RepresentRemove the spanning subgraph of node u and its incidence edge.
7. the topology control method that k points are connected under two channel-connectivities based on structure according to claim 6, wherein step
(5c2) interior joint u is in CSuUpper structure second order spanning subgraph Su', carry out as follows：
(5c2a) node u is by second order spanning subgraph Su' in point set be initialized as CSuIn all nodes, i.e.,Line set is initialized asWherein x, y ∈ V (Su'), E (x, y) ∈ E (CSu),
Will node set V (Su') in any two points in conflict subgraph CSuIn corresponding side assign second order spanning subgraph Su' side collection
Close E (Su'), node u is by CSuIn all sides, with link range weight wp (x, y) be link energy consumption weight wd (x, y) descending arrange
Row；
(5c2b) node u rejects S successivelyu' line set E (Su') in weight limit side E (x, y), and by the side right reset zero, sentence
The neighbors set PN of disconnected uuMiddle any two node is in Su' in whether there is k-1 bars point uninterrelated path：If so, continuing successively
Reject Su' side, otherwise, E (x, y) is rejoined into E (Su'), until having traveled through all sides untill, obtain second order spanning subgraph
Su'。
8. the topology control method that k points are connected under two channel-connectivities based on structure according to claim 6, wherein step
Part h is built in (5c2) and jumps topological subgraphCarry out as follows：
(5c2c) initialization part h jumps topological subgraphNode set be GuAll nodes, line set is GuAll sides,
I.e.
(5c2d) node u knows that h jumps the information of neighbors according to step (1) and step (2), and obtainsAll adjacent section
PointUpdate part h and jump topological subgraphWith logic conflict neighbors set LCNuIn, will node's
Neighbors w is added to point setWith logic conflict neighbors set LCNuIn, side E (c, w) is added toLine set
In, i.e.,Wherein,And{ w } represents the set of node w compositions；
(5c2e) existsThe neighbors set PN of middle judgement uuWhether there is the uncorrelated road of k-1 bars point between middle any two node
Footpath：If so, stopping updatingAnd carry outUpper structure second order spanning subgraph Su' operation, otherwise, node u continues to add
Hop node is added until set PNuMiddle any two node local h in the updated jumps topological subgraphIn there is k-1 bars point not
Introductory path, wherein,Represent and jump topological subgraph in local hIn delete son obtained by the side of node u and its association
Figure.
9. the topology control method that k points are connected under two channel-connectivities based on structure according to claim 1, wherein step
(9) channel distribution is carried out to each node u in the final full mesh topology that has built using greedy coloring algorithm in, by following step
Suddenly carry out：
(9a) node u is to the adjacent set LCN of logic conflictuIn all nodes with maximum transmit power by way of flooding in public affairs
Request distribution channel bag RAC is sent in control channel altogether；
(9b) logic conflict neighbors set LCNuIn node after RAC bags are received, the side for passing through unicast with maximum transmit power
Feedback channels distribution bag AC is issued node u by formula, is informed and is had been chosen by channel；
(9c) node u collects all LCNuIn node feedback AC bags, and from also unappropriated channel select primary user account for
With the channel that probability is minimum, as the available channel of oneself.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611093640.7A CN106792744B (en) | 2016-12-02 | 2016-12-02 | The topology control method being connected to based on k point under two channel-connectivities of building |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611093640.7A CN106792744B (en) | 2016-12-02 | 2016-12-02 | The topology control method being connected to based on k point under two channel-connectivities of building |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106792744A true CN106792744A (en) | 2017-05-31 |
| CN106792744B CN106792744B (en) | 2019-10-11 |
Family
ID=58882749
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611093640.7A Active CN106792744B (en) | 2016-12-02 | 2016-12-02 | The topology control method being connected to based on k point under two channel-connectivities of building |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106792744B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108616893A (en) * | 2018-03-21 | 2018-10-02 | 西安电子科技大学 | A kind of topology control method of high energy efficiency |
| CN112184911A (en) * | 2020-09-28 | 2021-01-05 | 嘉兴学院 | Non-popular grid model slice processing method |
| CN114531701A (en) * | 2022-02-25 | 2022-05-24 | 合肥工业大学 | Collaborative optimization method for data transmission reliability and topological robustness of heterogeneous network in extra-high voltage direct current control protection system |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104507168A (en) * | 2014-12-27 | 2015-04-08 | 西安电子科技大学 | Distributed topology control method for cognitive Ad Hoc network |
-
2016
- 2016-12-02 CN CN201611093640.7A patent/CN106792744B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104507168A (en) * | 2014-12-27 | 2015-04-08 | 西安电子科技大学 | Distributed topology control method for cognitive Ad Hoc network |
Non-Patent Citations (3)
| Title |
|---|
| H.LIU: "Generalized-Bi-Connectivity for Fault Tolerant Cognitive Radio Networks", 《IEEE》 * |
| N.LI: "Localized fault-tolerant topology control in wireless ad hoc networks", 《IEEE》 * |
| X.WANG: "Achieving Bi-Channel-Connectivity with Topology Control in Cognitive Radio Networks", 《IEEE》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108616893A (en) * | 2018-03-21 | 2018-10-02 | 西安电子科技大学 | A kind of topology control method of high energy efficiency |
| CN108616893B (en) * | 2018-03-21 | 2021-09-28 | 西安电子科技大学 | High-energy-efficiency topology control method |
| CN112184911A (en) * | 2020-09-28 | 2021-01-05 | 嘉兴学院 | Non-popular grid model slice processing method |
| CN112184911B (en) * | 2020-09-28 | 2023-11-14 | 嘉兴学院 | Non-popular grid model slicing processing method |
| CN114531701A (en) * | 2022-02-25 | 2022-05-24 | 合肥工业大学 | Collaborative optimization method for data transmission reliability and topological robustness of heterogeneous network in extra-high voltage direct current control protection system |
| CN114531701B (en) * | 2022-02-25 | 2023-08-11 | 合肥工业大学 | Cooperative optimization method for heterogeneous network in extra-high voltage direct current control protection system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106792744B (en) | 2019-10-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Khan et al. | Fuzzy-TOPSIS based cluster head selection in mobile wireless sensor networks | |
| CN109673035B (en) | Route establishing and maintaining method suitable for wireless self-organizing network | |
| CN104507168B (en) | Recognize the distribution topology control method of Ad Hoc networks | |
| Mansourkiaie et al. | Cooperative routing in wireless networks: A comprehensive survey | |
| Arya et al. | Performance analysis of deep learning-based routing protocol for an efficient data transmission in 5G WSN communication | |
| Ding et al. | Using partially overlapping channels to improve throughput in wireless mesh networks | |
| Ishibashi et al. | Topology and mobility considerations in mobile ad hoc networks | |
| Chaudhry et al. | Improving throughput and fairness by improved channel assignment using topology control based on power control for multi-radio multi-channel wireless mesh networks | |
| El Hajji et al. | Adaptive routing protocol for lifetime maximization in multi-constraint wireless sensor networks | |
| CN106658523B (en) | Recognize the distributed topology approach that K channel-connectivity is constructed in AdHoc network | |
| Sampath et al. | An ACO algorithm for effective cluster head selection | |
| CN106792744B (en) | The topology control method being connected to based on k point under two channel-connectivities of building | |
| Hussain et al. | Minimizing broadcast expenses in clustered ad-hoc networks | |
| Wang et al. | On channel assignment for multicast in multi-radio multi-channel wireless mesh networks: A survey | |
| Beheshtifard et al. | An adaptive channel assignment in wireless mesh network: the learning automata approach | |
| Zhu et al. | Dynamic interference minimization routing game for on-demand cognitive pilot channel | |
| Mu et al. | Performance analysis of the ZigBee networks in 5G environment and the nearest access routing for improvement | |
| CN105636144A (en) | Method for prolonging life period of zigbee network | |
| Zhang et al. | Less is more: Learning more with concurrent transmissions for energy-efficient flooding | |
| CN114374721A (en) | Power line and wireless communication fusion method and system for power internet of things | |
| CN106131887B (en) | Distribution topology control method based on serial interference elimination | |
| Zheng et al. | A reliable communication and load balancing scheme for resource-limited networks | |
| CN106793117B (en) | elastic virtual subnet mapping method in wireless mesh network | |
| Chiang et al. | A knowledge-based inference multicast protocol using adaptive fuzzy Petri nets | |
| Chauhan | Comparative study of clustering based algorithm in mobile ad-hoc network |
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 |