CN106658523B - Recognize the distributed topology approach that K channel-connectivity is constructed in AdHoc network - Google Patents
Recognize the distributed topology approach that K channel-connectivity is constructed in AdHoc network Download PDFInfo
- Publication number
- CN106658523B CN106658523B CN201610369203.7A CN201610369203A CN106658523B CN 106658523 B CN106658523 B CN 106658523B CN 201610369203 A CN201610369203 A CN 201610369203A CN 106658523 B CN106658523 B CN 106658523B
- Authority
- CN
- China
- Prior art keywords
- node
- subgraph
- conflict
- neighbors
- network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
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/14—Spectrum sharing arrangements between different networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
- H04W72/541—Allocation or scheduling criteria for wireless resources based on quality criteria using the level of interference
-
- 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
Abstract
The invention discloses the distributed topology approach for constructing K channel-connectivity in a kind of cognition Ad Hoc network, mainly solve the problems, such as that isolating for time user network interferes with each other with time user when multiple primary user's busy channels in the prior art.It realizes process are as follows: each node in 1. networks successively broadcasts HELLO packet twice, and receives the HELLO packet of initial neighbors, establishes local double bounce topology subgraph；2. constructing shortest path tree, and be locally generated subgraph according to certifiable user's connection of shortest path tree building based on local double bounce topology subgraph；3. jumping neighbors adjustment transmission power according to one be locally generated in subgraph and determining the logic neighbors of each node；4. constituting full mesh topology by the link between all nodes and node and its logic neighbors in network, and carry out channel selection.The present invention can guarantee time user network connection, eliminates time user's interference, saves channel resource, can be used for recognizing Ad Hoc network.
Description
Technical field
The invention belongs to wireless communication field, in particular to a kind of network topology structure based on building K channel-connectivity
Method can be used for recognizing Ad Hoc network.
Background technique
The topological structure of network is a highly important factor for influencing cognition Ad Hoc network performance, improves cognition Ad
The robustness of Hoc network, the fault-tolerant ability for enhancing network topology become the focus on research direction of Topology Control.Recognize Ad
User there are two types of in Hoc network, first is that primary user, the other is secondary user.Primary user enjoys the preferential right of channel.Work as master
When user occupancy channel, secondary user must make a concession the channel and be in silent status, it is more likely that influence the connectivity of time user.And
When multiple primary users occupy multiple channels, the right to use that a large amount of user makes a concession channel is had, this may be such that network
The case where segmentation, will be more serious, therefore, when busy channel resource occur in multiple primary users how to maintain cognition Ad Hoc network
Connectivity become a critical problem.In the article that the authors such as Xinjun Wang deliver on IEEE VTC 2014
In the algorithm of " Bi-Channel-Connected Topology Control in Cognitive Radio Networks " etc.
The connection that can guarantee time user network can also eliminate the interference between time user, but this method only has single primary user
Effect, when multiple primary users occur, it cannot be guaranteed that the connection of network, can not eliminate the interference of time user, to influence to recognize
The fault-tolerant ability of Ad Hoc network.
Summary of the invention
It is an object of the invention to be directed to above-mentioned problem of the prior art, propose to construct K in a kind of cognition Ad Hoc network
The distributed topology approach of channel-connectivity eliminates the interference between secondary user's to guarantee the connectivity of secondary user's network, from
And improve the fault-tolerant ability of cognition Ad Hoc network.
To achieve the above object, technical solution of the present invention includes the following:
(1) initialization network is that k point is connected to, k >=2, and each node u obtains a jump and double bounce abutment points respectively in network
Sequence number and location information；
(2) according to the sequence number and the local double bounce topology subgraph of location information foundation in step (1)And it calculatesIn
Any two have the link energy consumption weight w between the node x, y of connection relationshipp(x, y) and link range weight wd(x,y)；
(3) each node u building is locally generated subgraph S in networku:
(3a) initializes each node and is locally generated subgraph SuNode set V (Su) it is local double bounce topology subgraphIn
All nodes, initialize each node and be locally generated subgraph SuLine set E (Su) it is empty set；
(3b) is based on local double bounce topology subgraphEach node u is according to link energy consumption weight wp(x, y), building are with u
Root, the shortest path tree T of all nodes in local double bounce topology subgraphu=(V (Tu),E(Tu)), whereinFor all nodes in local double bounce topology subgraph, E (Tu) it is to constitute all sides of shortest path tree, and incite somebody to action
Line set E (the S for being locally generated subgraph is recorded in these sidesu) in, i.e. E (Su)≤E (Tu)∪E(Su)；
Each node u in (3c) network is according to shortest path tree TuThe node to conflict with oneself is found, conflict section is constituted
Point set CNu, and according to CNuWithBuilding conflict subgraph CSu=(V (CSu),E(CSu)), wherein
(3d) judgement conflict subgraph CSuIt whether is the connection of k-1 point: if so, by CSuIt is put into conflict subgraph set { CSu}
In；Otherwise, in local double bounce topology subgraphMiddle building k-1 point connection conflict subgraphIt enablesIt willIt is put into conflict subgraph set { CSuIn；
(3e) judges whether k-1 >=2 are true: if so, (3f) is thened follow the steps, otherwise, jumps to step (3m)；
(3f) initializes i=2, and wherein i indicates conflict subgraphIn i-th layer；
(3g) initializes j=1, and wherein j indicates conflict subgraph CSuIn j-th of conflicting nodes；
(3h) is enabledWherein { CSu}jIt indicates in conflict subgraph CSuJ-th of node conflict subgraph,Indicate (i-1)-th layer of conflict subgraph；
(3i) is for all nodes?In find corresponding conflicting nodes set CNuv, according to CNuv
WithConstruct i-th layer of conflict subgraphWhereinNode collectionSide collection
(3j) judgementWhether it is k-i point connection conflict subgraph: if so, then willIt is incorporated into conflict subgraph set
{CSuIn, otherwise, building k-i point connection conflict subgraphIt enablesAnd it willIt is incorporated into set { CSuIn；
(3k) judges whether j meets j=| { CSu|: if so, it executes step (3l), otherwise, j=j+1 jumps to step
(3h)；
(3l) judges whether i meets i=k-1: if so, it executes step (3m), otherwise, i=i+1 jumps to step (3g)；
(3m) is to set { CSuIn all conflict subgraphs generated using two channel-connectivity algorithm DBCC of distribution building it is sub
Set Su=(V (Su),E(Su)), wherein V (Su) indicate SuNode collection, E (Su) indicate SuSide collection；
(3n) each node u is locally generated subgraph S according to what the topology information that other nodes are sent updated oneselfuAnd logic
The neighbours that conflict collect LCNuv, subgraph S will be locally generateduOn one jump neighbors v as logic neighbors, and constitute logic neighbors
Collection: LCNu={ v ∈ V (Su)|(u,v)∈E(Su)}；
(3p) updates side collection information E (S)=E (S) ∪ E (Su), more new logic neighborhood information LCNu=V (Su), wherein E
(S) indicate that all nodes generate total side collection for generating figure, LCN in networkuIndicate the logic neighbors set of node u；
(4) each node u determines oneself transmission power in network, i.e., is adjusted to cover by transmission power all
Minimum power required for logic neighbors:
(5) link combinations between all nodes and each node and the logic neighbors of oneself in network are got up,
Constituting final full mesh topology, i.e. G=(V (G), E (G)), wherein V (G) is all nodes in network, E (G)=(u, v) | u ∈
V(G),v∈LCNu, wherein E (G) indicates the side collection in network G；
(6) channel distribution is carried out to each node u in the final full mesh topology constructed using greedy coloring algorithm.
The present invention has the advantage that
1) present invention is locally generated subgraph by distributed building, and combines power control and channel distribution makes time user
The independent sets of network do not constitute the cut set of network, when solving multiple multiple channels of primary users' occupancy, the disconnected situation of network,
To guarantee the connectivity of time user network, the K channel-connectivity of network is realized；
2) joint Power control of the present invention and channel distribution, not only reduce the transmission power of node, and decrease
The required number of channel, to save frequency spectrum resource.
3) present invention is eliminated secondary by carrying out channel distribution to each node u in the final full mesh topology constructed
Interference between user.
Detailed description of the invention
Fig. 1 is the applicable cognition Ad Hoc network schematic diagram of a scenario of the present invention；
Fig. 2 is realization general flow chart of the invention；
Fig. 3 is the maximum power topology formed in 50 meshed network scenes in the present invention；
Fig. 4 is the sub-process figure that building is locally generated subgraph in the present invention；
Fig. 5 is the exemplary diagram of interior joint u of the present invention building topology；
Fig. 6 is the simulating, verifying figure that topology is generated to the present invention；
Fig. 7 is the simulation comparison figure to obtained average transmission radius of the invention under different value of K；
Fig. 8 is the simulation comparison figure to obtained average channel number of the invention under different value of K；
Fig. 9 is the simulation comparison figure to obtained maximum channel number of the invention under different value of K.
Specific embodiment
Embodiment of the present invention is described in further detail below in conjunction with attached drawing.
Referring to Fig.1, the node group that the cognition Ad Hoc network that the present invention uses is distributed in two-dimensional surface region by n
At.Each node on behalf one time user, and there is unique sequence number, and can by GPS or other location technologies come
Obtain the location information of own.All nodes are influenced by multiple primary users, and primary user can be used in C channel
Any one channel.Each node can send data in C channel in any one channel, while in other all channels
Upper interception data, in addition to this each node physical structure, initial setting up, functional characteristic, in terms of be not present
Any difference.In a network, the wireless channel between arbitrary node is additive white Gaussian noise channel.Node by omnidirectional antenna with
Surroundings nodes communication, maximum transmission power is Pmax.The transmission power P of arbitrary node uuIt can connect between a minimum and a maximum
It is continuous to adjust, i.e. 0≤Pu≤Pmax.Radius r is transmitted for the transmission range corresponding to node transmitting power, between any two node
It is transmission radius r of the Euclidean distance between them less than or equal to node there are the necessary and sufficient condition of Radio Link.
Referring to Fig. 2, steps are as follows for realization of the invention:
Step 1, each node u sends the first node information HELLO-1 packet of oneself in network, and receives one and jump neighbors
The HELLO-1 packet of transmission.
The topological structure that (1a) is formed when node each in network uses maximum power transfer is maximum power topology,
As shown in figure 3, maximum power topological representation are as follows: Gmax=(V (Gmax),E(Gmax)), wherein V (Gmax) it is node set, indicate net
Network node, E (Gmax) it is line set, indicate existing Radio Link between node.
(2b) is located at all nodes in the transmission radius of node u, and the one of composition node u jumps neighbors collection Wherein secondary user v1Distance with secondary user u is 1 jump；
Each node u in (3c) network is with maximum transmission power PmaxNeighbors, which is jumped, to the one of u broadcasts a HELLO-1
It wraps, the location information of the sequence number containing node u and node u in HELLO-1 packet；
Each node u in network receives one and jumps neighbors with maximum transmission power PmaxThe HELLO-1 packet of broadcast.
Step 2, according to the first node information HELLO-1 packet in above-mentioned steps 1, each node u sends oneself in network
Second node information HELLO-2 packet, and receive one jump neighbors send HELLO-2 packet.
(2a) node u is used in all nodes that can be reached within double bounce including double bounce, forms the double bounce neighbors of node u
Collection∪ indicates two union of sets , &&
Expression also, wherein secondary user v2Distance with secondary user u is 2 jumps；
After each node u in (2b) network has received the HELLO-1 packet that all one jump neighbors transmission, with emission maximum
Power PmaxNeighbors, which is jumped, to the one of u broadcasts a HELLO-2 packet, the sequence of all jump neighbors containing u in HELLO-2 packet
Row number and location information；
Each node u in (2c) network receives one and jumps neighbors with maximum transmission power PmaxThe HELLO-2 packet of broadcast.
Step 3, each node u constructs oneself local double bounce topology subgraph in network
Each node u in (3a) network jumps the first node information HELLO-1 that neighbors is sent according to one received
With second node information HELLO-2 package informatin, obtains and record oneself all double bounce neighbors v12Sequence number and location information,
Wherein
(3b) each node u calculates any two according to the location information of oneself and the location information of double bounce neighbors
Minimum emissive power required for directly being transmitted between node x, y:Wherein,β is to receive noise
It than threshold value, is determined according to the sensitivity of receiver and bit error rate requirement, α is path-loss factor, and { u } indicates node u composition
Set, dx,yIt is node x, the Euclidean distance between y；
(3c) judges the connection relationship between double bounce neighbors according to the minimum emissive power of calculating, if Px,yLess than node
Maximum transmission power Pmax, it is determined that there are connection relationships between node x, y；Otherwise, there is no connections to close between node x, y
System；
(3d) each node u establishes local double bounce topology subgraph according to the connection relationship between double bounce neighborsWhereinNode set beLocal double bounce topology subgraphSide
Set are as follows:I.e. forIn any two nodeWhenWhen, by sideIt is put into local double bounce topology subgraphLine setIn；
(3e) each node u, which calculates any two, the link energy consumption weight between the node x, y of connection relationship: wp(x,
Y)=Px,y, whereinPx,yHave required for directly being transmitted between the node x, y of connection relationship for any two
Minimum sends power；
(3f) node u, which calculates any two, the link range weight between the node x, y of connection relationship: wd(x, y)=
dx,y, whereindx,yIt is that any two have Euclidean distance between the node x, y of connection relationship.
Step 4, each node u building is locally generated subgraph S in networku=(V (Su),E(Su)), and determine patrolling for oneself
Collect neighbors.
Referring to Fig. 4, this step is implemented as follows:
(4a) initializes each node and is locally generated subgraph SuNode set V (Su) it is local double bounce topology subgraphIn
All nodes, initialize each node and be locally generated subgraph SuLine set E (Su) it is empty set；
(4b) is based on local double bounce topology subgraphWith link energy consumption weight wp(x, y) is link weight, and node u passes through
Using dijkstra's algorithm, construct using u as root, the shortest path tree T of all nodes in local double bounce topology subgraphu=(V
(Tu),E(Tu)), whereinFor all nodes in local double bounce topology subgraph, E (Tu) it is to constitute shortest path
All sides of tree, to obtain the shortest path for reaching arbitrary node in local double bounce topology subgraph in subrange, and will
Locally connected subgraph S is recorded in these sidesuIn, i.e. E (Su)≤E (Tu)∪E(Su) ,≤indicate assignment；
Each node u in (4c) network is according to shortest path tree TuThe node to conflict with oneself is found, conflict section is constituted
Point set CNu, and according to CNuWithBuilding conflict subgraph CSu=(V (CSu),E(CSu)), wherein V (CSu)=CNu,
(4d) judges conflict subgraph CS according to maximum-flow algorithmuWhether it is the connection of k-1 point:
If so, by CSuIt is put into conflict subgraph set { CSuIn；
Otherwise, in local double bounce topology subgraphMiddle building k-1 point connection conflict subgraphIt enablesI.e.
It willIt is put into conflict subgraph set { CSuIn, k-1 point connected subgraph is constructed by following (4d1)-(4d2):
(4d1) basisConflicting nodes set CNu, the neighbors x and node for adding conflicting nodes v are to company, (v, x) institute
Side E (v, x) connect is arrivedIn, it is formedWhereinv∈CNu。
(4d2) judges according to maximum-flow algorithmWhether k-1 point is connected to: if so, it enablesOtherwise, it returns
To step (4d1)；
(4e) judges whether k-1 >=2 are true: if so, (4f) is thened follow the steps, otherwise, jumps to step (4m)；
(4f) initializes i=2, and wherein i indicates conflict subgraphIn i-th layer；
(4g) initializes j=1, and wherein j indicates conflict subgraph CSuIn j-th of conflicting nodes；
(4h) is enabledWherein { CSu}jIt indicates in conflict subgraph CSuJ-th of node conflict subgraph,Indicate (i-1)-th layer of conflict subgraph；
(4i) is for all nodes?In find corresponding conflicting nodes set CNuv, according to CNuv
WithConstruct i-th layer of conflict subgraphWhereinNode collectionSide collection
(4j) judges according to maximum-flow algorithmWhether it is a connection conflict subgraph k-i:
If so, willIt is incorporated into conflict subgraph set { CSuIn；
Otherwise, building k-i point connection conflict subgraphIt enablesAnd it willIt is incorporated into set { CSuIn,
K-i point connected subgraph is constructed by following (4j1)-(4j2)::
(4j1) basisConflicting nodes set CNuv, the neighbors x and node for adding conflicting nodes w are to (w, x) institute
Side E (w, x) of connection is arrivedIn, it is formedWhereinw∈CNuv。
(4j2) judges according to maximum-flow algorithmWhether it is the connection of k-1 point: if so, it enablesOtherwise,
Back to step (4j1)；
(4k) judges whether j meets j=| { CSu|: if so, it executes step (4l), otherwise, j=j+1 jumps to step
(4h)；
(4l) judges whether i meets i=k-1: if so, it executes step (4m), otherwise, i=i+1 jumps to step (4g)；
(4m) is to set { CSuIn all conflict subgraphs generated using two channel-connectivity algorithm DBCC of distribution building it is sub
Set Su=(V (Su),E(Su)), wherein V (Su) indicate SuNode collection, E (Su) indicate SuSide collection, the specific steps are as follows:
(4m1) is for set { CSuIn each conflict subgraphConstruction is locally generated subgraph T ' accordinglyu=(V
(T′u),E(T′u))；
(4m2) update is locally generated subgraph SuSide collection E (Su), i.e. E (Su)≤E (T 'u)∪E(Su), update is locally generated
Subgraph SuSide collection V (Su), i.e. V (Su)≤V (T 'u)∪V(Su), and by node V (T 'u) logic conflict neighbours collection is recorded
LCNuvIn, i.e. LCNuv=V (T 'u), then node u is by way of flooding LCNuvWith E (Su) topology information be sent to Su
In all nodes.
(4n) each node u is locally generated subgraph S according to what the topology information that other nodes are sent updated oneselfuAnd logic
The neighbours that conflict collect LCNuv, subgraph S will be locally generateduOn one jump neighbors v as logic neighbors, and constitute logic neighbors
Collection: LCNu={ v ∈ V (Su)|(u,v)∈E(Su)}；
(4p) updates side collection information E (S)=E (S) ∪ E (Su), more new logic neighborhood information LCNu=V (Su), wherein E
(S) indicate that all nodes generate total side collection for generating figure, LCN in networkuIndicate the logic neighbors set of node u；
By step (4c)-(4m), it is specifically locally generated subgraph SuResult as shown in figure 5, wherein first layer
Indicate the k-1 point connection conflict subgraph of node uThe second layer indicatesAny node v corresponding k-2 point be connected to punching
Prominent subgraphThird layer indicatesThe corresponding k-2 point connection conflict subgraph of any node vAny node w
Corresponding k-3 point connection conflict subgraphThe last layer indicates finally formed and is locally generated subgraph Su。
Wherein dijkstra's algorithm described in above-mentioned steps (4b) is referring to authors such as Xinjun Wang in IEEE VTC
Article " the Bi-Channel-Connected Topology Control in Cognitive Radio delivered on 2014
Networks"；The maximum-flow algorithm used in above-mentioned steps (4d) judge to conflict subgraph whether the connection of k-1 point in step (4j)
The maximum-flow algorithm of use judges that whether k-i point is connected to conflict subgraph, makees referring to Shimon Even and R.Endre Tarjan etc.
" the Network Flow and Testing Graph Connectivity " that person delivers.
Step 5, each node u determines oneself transmission power in network, i.e., is adjusted to cover by transmission power
Minimum power required for all logic neighbors:Wherein all logic neighbors of u
Required minimum power refers to the maximum value of the transmission power of all logic neighbors of u, pu,vIndicate the logic neighbors of u
The transmission power of v；
Step 6, according to the topological control process of above-mentioned steps 4- step 5, each node disjoint in network it is determining and oneself
Logic neighbors connection relationship, by the chain between all nodes and each node and the logic neighbors of oneself in network
Road combines, and constitutes final full mesh topology, i.e. G=(V (G), E (G)), wherein V (G) is all nodes in network, E (G)
=(u, v) | u ∈ V (G), v ∈ LCNu}.
Step 7, channel point is carried out to each node u in the final full mesh topology constructed using greedy coloring algorithm
Match.
(7a) node u sends power P with maximummaxBroadcast request distributes channel packet RAC on a common control channel, other
Node needs transfer packet again when receiving this packet, and until logic, conflict neighbours collect LCNuIn all nodes all receive
Until RAC packet；
(7b) logic conflict neighbours collect LCNuIn node after receiving RAC packet, check oneself the allocated channel, and
Feedback channels distribution packet AC give node u, the allocated channel of the node is wherein contained in channel distribution packet AC, if the section
Point is also unallocated, and packet AC is just denoted as empty packet by channel；
(7c) node u collects all LCNuIn node feedback AC packet, and from also unappropriated channel select master
The smallest channel of user occupancy probability, as the available channel of oneself.；
(7d) each node disjoint executes the above process, until 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 as -80dBm, and path-loss factor α value is 4.All nodes are using identical in network
Maximum transmission power, wherein maximum transmission power Pmax=256mW, corresponding maximum transmitted radius Rmax=400m.Assuming that main
User influences whether all secondary user nodes.
(2) emulation content and result
Emulation 1, the topologies that the present invention generates in the scene of 50 nodes are as shown in fig. 6, wherein
Fig. 6 (a) is maximum power topology；
Fig. 6 (b) is the topology that the method for the present invention generates, the channel of digital representation node distribution therein；
Fig. 6 (c) indicates the topology of time user network when primary user occupies a channel；
Fig. 6 (d) indicates the topology of time user network when two primary users occupy two channels；
Fig. 6 (e) indicates the topology of time user network when three primary users occupy three channels；
By Fig. 6 (a)-(e) as can be seen that the topology that the method for the present invention generates arbitrarily occupies k-1 channel in primary user
When, the network of secondary user is still connection.
Emulation 2, with the method for the present invention and maximum power topology MaxPower to the different value of K of node average transmission radius into
Row emulation, as a result as shown in Figure 7:
From fig.7, it can be seen that in network time user node number increase, the average transmission of maximum power topology MaxPower
Radius remains unchanged, and 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, therefore the method for the present invention can be very good to reduce the energy of node
Consumption, increases the life cycle of network.
Emulation 3, is carried out with the method for the present invention and different value of K of the maximum power topology MaxPower to required average channel number
Emulation, as a result as shown in Figure 8:
As seen from Figure 8, in network time user node number increase, the average channel of maximum power topology MaxPower
Number is linear to be increased, and average channel number needed for the method for the present invention is less, and increasing in network user node number, average
The number of channel slowly increases, and with the increase of k, average channel number also slowly increases.
Emulation 4, is carried out with the method for the present invention and different value of K of the maximum power topology MaxPower to required maximum channel number
Emulation, as a result as shown in Figure 9:
As seen from Figure 9, in network time user node number increase, needed for the maximum of maximum power topology MaxPower
The number of channel linearly increases, and the number of channel needed for the method for the present invention is maximum is less, and increasing in network user node number,
The number of channel needed for maximum slowly increases, and with the increase of k, and average channel number also slowly increases, from Fig. 8 and Fig. 9 it can be concluded that
Channel resource is not only greatly saved in the present invention, but also maintains the connectivity of network, so that network has good Shandong
Stick.
Claims (2)
1. recognizing the distributed topology approach for constructing K channel-connectivity in Ad Hoc network, include the following steps:
(1) initialization network is that k point is connected to, k >=2, and each node u obtains the sequence of a jump and double bounce abutment points respectively in network
Number and location information, i.e., each node u is in network with maximum transmission power PmaxIt is transmitted in radius to being located at apart from oneself
All nodes broadcast a first node information HELLO-1 packet and second node information HELLO-2 packet respectively, and receive one and jump neighbour
The HELLO-1 packet and HELLO-2 packet that node is sent, including the sequence number and location information of u node in the HELLO-1 packet,
The sequence number and location information of all jump neighbors in HELLO-2 packet containing u；
(2) according to the sequence number and the local double bounce topology subgraph of location information foundation in step (1)And it calculatesIn it is any
Two link energy consumption weight w having between the node x, y of connection relationshipp(x, y) and link range weight wd(x, y):
(2a) each node u based on the received one jump neighbors first node information HELLO-1 packet and second node information
HELLO-2 packet obtains and records the sequence number and location information of the HELLO-1 packet and HELLO-2 packet interior joint, these neighbors
Constitute double bounce neighbors collectionIt is described wherein including the sequence number and location information of u node in the HELLO-1 packet
The sequence number and location information of all jump neighbors in HELLO-2 packet containing u；
(2b) each node u calculates any two node according to the location information of oneself and the location information of double bounce neighbors
Minimum emissive power required for directly being transmitted between x, yWherein,β is received signal to noise ratio thresholding
Value determines that α is path-loss factor, d according to the sensitivity of receiver and bit error rate requirementx,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 there are connection relationships between node x, y；Otherwise, node x,
Connection relationship is not present between y；
(2c) each node u establishes local double bounce topology subgraph according to the connection relationship between double bounce neighborsWherein local topology subgraphNode set beLocal topology subgraphLine set are as follows:I.e. forIn any two nodeWhenWhen, side
(2d) according to local double bounce topology subgraph, calculating any two in each node u has between the node x, y of connection relationship
Link energy consumption weight: wp(x, y)=Px,y, whereinPx,yFor any two have connection relationship node x, y it
Between directly minimum required for transmission send power；
(2e) according to Euclidean distance, any two have node x, the distance between y weight of connection relationship: w in calculate node ud
(x, y)=dx,y, whereindx,yIt is that any two have Euclidean distance between the node x, y of connection relationship；
(3) each node u building is locally generated subgraph S in networku:
(3a) initializes each node and is locally generated subgraph SuNode set V (Su) it is local double bounce topology subgraphIn institute
There is node, initializes each node and be locally generated subgraph SuLine set E (Su) it is empty set；
(3b) is based on local double bounce topology subgraphEach node u is according to link energy consumption weight wp(x, y) is constructed using u as root,
The shortest path tree T of all nodes in local double bounce topology subgraphu=(V (Tu),E(Tu)), whereinFor
All nodes in local double bounce topology subgraph, E (Tu) it is to constitute all sides of shortest path tree, and office is recorded in these sides
Line set E (the S of portion's spanning subgraphu) in, i.e. E (Su) <=E (Tu)∪E(Su)；
Each node u in (3c) network is according to shortest path tree TuThe node to conflict with oneself is found, conflicting nodes set is constituted
CNu, and according to CNuWithBuilding conflict subgraph CSu=(V (CSu),E(CSu)), wherein V (CSu)=CNu,
(3d) judgement conflict subgraph CSuIt whether is the connection of k-1 point: if so, by CSuIt is put into conflict subgraph set { CSuIn；
Otherwise, in local double bounce topology subgraphMiddle building k-1 point connection conflict subgraphIt enablesIt willIt puts
Enter to conflict subgraph set { CSuIn；The building k-1 point connection conflict subgraphThe step of it is as follows:
(3d1) basisConflicting nodes set CNu, what the neighbors x and node for adding conflicting nodes v connected (v, x)
Side E (v, x) is arrivedIn, it is formedWhereinv∈CNu；
(3d2) judgementWhether it is connected to k-1 point: if so, it enablesOtherwise, step (3d1) is returned to；
(3e) judges whether k-1 >=2 are true: if so, (3f) is thened follow the steps, otherwise, jumps to step (3m)；
(3f) initializes i=2, and wherein i indicates conflict subgraphIn i-th layer；
(3g) initializes j=1, and wherein j indicates conflict subgraph CSuIn j-th of conflicting nodes；
(3h) is enabledWherein { CSu}jIt indicates in conflict subgraph CSuJ-th of node conflict subgraph,Table
Show (i-1)-th layer of conflict subgraph；
(3i) is for all nodes?In find corresponding conflicting nodes set CNuv, according to CNuvWithConstruct i-th layer of conflict subgraphWhereinNode collectionSide collection
(3j) judgementWhether it is k-i point connection conflict subgraph: if so, then willIt is incorporated into conflict subgraph set { CSu}
In, otherwise, building k-i point connection conflict subgraphIt enablesAnd it willIt is incorporated into set { CSuIn；It is described
Construct k-i point connection conflict subgraphThe step of it is as follows:
(3j1) basisConflicting nodes set CNuv, add conflicting nodes w neighbors x and node (w, x) is connected
Side E (w, x) arriveIn, it is formedWhereinw∈CNuv；
(3j2) judgementWhether k-i point is connected to: if so, then enableOtherwise step (3j1) is returned to；
(3k) judges whether j meets j=| { CSu|: if so, it executes step (3l), otherwise, j=j+1 jumps to step (3h)；
(3l) judges whether i meets i=k-1: if so, it executes step (3m), otherwise, i=i+1 jumps to step (3g)；
(3m) is to set { CSuIn all conflict subgraphs using two channel-connectivity algorithm DBCC of distribution building generation subtree Su
=(V (Su),E(Su)), wherein V (Su) indicate SuNode collection, E (Su) indicate SuSide collection, as follows carry out:
(3m1) is for set { CSuIn each conflict subgraphConstruction is locally generated subgraph T accordinglyu'=(V (Tu'),
E(Tu'))；
(3m2) update is locally generated subgraph SuSide collection E (Su), i.e. E (Su) <=E (Tu')∪E(Su), update is locally generated son
Scheme SuSide collection V (Su), i.e. V (Su) <=V (Tu')∪V(Su), and by node V (Tu') logic conflict neighbours collection LCN is recordeduv
In, i.e. LCNuv=V (Tu'), then node u is by way of flooding LCNuvWith E (Su) topology information be sent to SuIn
All nodes；
(3n) each node u is locally generated subgraph S according to what the topology information that other nodes are sent updated oneselfuWith logic conflict
Neighbours collect LCNuv, subgraph S will be locally generateduOn one jump neighbors v as logic neighbors, and constitute logic neighbors collection:
LCNu={ v ∈ V (Su)|(u,v)∈E(Su)}；
(3p) updates side collection information E (S)=E (S) ∪ E (Su), more new logic neighborhood information LCNu=V (Su), wherein E (S) table
Show that all nodes in network generate the side collection of total generation figure, LCNuIndicate the logic neighbors set of node u；
(4) each node u determines oneself transmission power in network, i.e., is adjusted to transmission power that all logics can be covered
Minimum power required for neighbors:
(5) 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) be network in all nodes, E (G)=(u, v) | u ∈ V
(G),v∈LCNu, wherein E (G) indicates the side collection in network G；
(6) channel distribution is carried out to each node u in the final full mesh topology constructed using greedy coloring algorithm, by as follows
Step carries out:
(6a) node u collects LCN to logic conflict neighboursuIn all nodes send power by way of flooding in public affairs with maximum
Request distribution channel packet RAC is sent in control channel altogether；
(6b) logic conflict neighbours collect LCNuIn node after receiving RAC packet, with maximum send power handle by way of unicast
Feedback channels distribution packet AC issues node u, informs the channel having been selected；
(6c) node u collects all LCNuIn node feedback AC packet, and from also unappropriated channel select primary user account for
With the smallest channel of probability, as the available channel of oneself.
2. the distributed topology approach of K channel-connectivity is constructed in cognition Ad Hoc network according to claim 1, wherein walking
Suddenly the shortest path tree T in (3b)uIt is constructed using dijkstra's algorithm or bellman-ford algorithm.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610369203.7A CN106658523B (en) | 2016-05-30 | 2016-05-30 | Recognize the distributed topology approach that K channel-connectivity is constructed in AdHoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610369203.7A CN106658523B (en) | 2016-05-30 | 2016-05-30 | Recognize the distributed topology approach that K channel-connectivity is constructed in AdHoc network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106658523A CN106658523A (en) | 2017-05-10 |
| CN106658523B true CN106658523B (en) | 2019-10-11 |
Family
ID=58848663
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610369203.7A Active CN106658523B (en) | 2016-05-30 | 2016-05-30 | Recognize the distributed topology approach that K channel-connectivity is constructed in AdHoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106658523B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107197425B (en) * | 2017-06-16 | 2019-08-06 | 韩冰青 | Isomery Energy-aware topology control method in wireless self-networking |
| CN109121098B (en) * | 2018-08-24 | 2021-05-25 | 京东方科技集团股份有限公司 | Method and system for allocating channel |
| CN110022562B (en) * | 2019-04-11 | 2022-04-01 | 池州学院 | Distributed channel allocation control method for mobile ad hoc network |
| CN111683413B (en) * | 2020-08-12 | 2020-11-10 | 成都极米科技股份有限公司 | Method, terminal, network access device and storage medium for establishing multilink connection |
| CN112468996B (en) * | 2020-12-14 | 2022-07-26 | 华东交通大学 | Network topology control method in cognitive Internet of vehicles |
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-05-30 CN CN201610369203.7A patent/CN106658523B/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 (2)
| Title |
|---|
| Achieving Bi-channel-Connectivity with Topology Control in Cognitive Ratio Network;X.wang;《IEEE》;20141231;全文 * |
| Generalized-Bi-Connectivity for Fault Tolerant Cognitive Radio Network;H.Liu;《IEEE》;20120831;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106658523A (en) | 2017-05-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104507168B (en) | Recognize the distribution topology control method of Ad Hoc networks | |
| CN106658523B (en) | Recognize the distributed topology approach that K channel-connectivity is constructed in AdHoc network | |
| Wu et al. | Forward‐node‐set‐based broadcast in clustered mobile ad hoc networks | |
| Sridhar et al. | Energy supported AODV (EN-AODV) for QoS routing in MANET | |
| JP2005518717A (en) | Collision-free route routing integrated between layers | |
| CN102546059A (en) | Non-supervision clustering-based distributed cooperative spectrum sensing method for cognitive self-organizing network | |
| Yu et al. | Cooperative bridges: topology control in cooperative wireless ad hoc networks | |
| Ammar et al. | Multi-hop LEACH based cross-layer design for large scale wireless sensor networks | |
| CN103974367A (en) | Error-tolerance and multi-path optimization method based on HEED algorithm in wireless sensor network | |
| Farooq | Multi-hop communication protocol for LoRa with software-defined networking extension | |
| CN112040528B (en) | Method for selecting control node of wireless ad hoc network center | |
| CN107846719A (en) | A kind of wireless sensor network routing method based on improvement gam algorithm | |
| US10499264B1 (en) | Role selection method in wireless communication networks | |
| Zheng et al. | A resource-efficient and scalable wireless mesh routing protocol | |
| Zhang et al. | Less is more: Learning more with concurrent transmissions for energy-efficient flooding | |
| CN106792744B (en) | The topology control method being connected to based on k point under two channel-connectivities of building | |
| CN106131887B (en) | Distribution topology control method based on serial interference elimination | |
| CN106658647A (en) | Relay selection algorithm based on interference perception | |
| Aslani et al. | Improving the performance of rpl routing protocol for internet of things | |
| CN115665860A (en) | Unmanned aerial vehicle ad hoc network resource allocation method based on migratory bird swarm characteristics | |
| Dai et al. | Efficient channel assignment under dynamic source routing in cognitive radio networks | |
| CN104219679B (en) | A kind of improved method for channel allocation in cognitive radio networks | |
| Xiao et al. | A novel energy entropy based on cluster head selection algorithm for wireless sensor networks | |
| Jayashree et al. | E/sup 2/LBC: an energy efficient load balanced clustering technique for heterogeneous wireless sensor networks | |
| Kumar et al. | A survey on routing techniques in zigbee wireless networks in contrast with other wireless networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |