CN109951886A

CN109951886A - A kind of self-organization of network method towards multi-element ecology observation

Info

Publication number: CN109951886A
Application number: CN201910217612.9A
Authority: CN
Inventors: 吴静; 喻婷; 江昊; 周建国; 解逸童; 郭蕾
Original assignee: Wuhan University WHU
Current assignee: Wuhan University WHU
Priority date: 2019-03-21
Filing date: 2019-03-21
Publication date: 2019-06-28
Anticipated expiration: 2039-03-21
Also published as: CN109951886B

Abstract

The invention proposes a kind of self-organization of network methods towards multi-element ecology observation.The nodal analysis method of present invention design multiplex roles directional aerial；Message package, a hop neighbor information table and the two-hop neighbors information table of design discovery adjacent node；It was found that the detection three times of adjacent neighbors；Slot allocation method after designing time division multiplexing mode combination directional aerial；Design control message；Design channel allocation algorithm.The deficiencies of present invention improves greatly the reusability in space, and Traditional Ecological can be overcome to monitor due to bring information drop-out after multi-hop, and time delay increases, is of great significance to field ecological monitoring quality is improved.

Description

A kind of self-organization of network method towards multi-element ecology observation

Technical field

The invention belongs to the communications field more particularly to a kind of self-organization of network methods towards multi-element ecology observation.

Background technique

Due to the influence of field geographical environment, each monitoring station position disperses and apart from farther out, and field operator is examined It examines environment and is often in depopulated zone, almost without terrestrial communication networks, work and life to operating personnel cause safely huge Influence and hidden danger, when field work meets danger or has special discovery, need in time with management board establish contact, report Situation is sought help.In addition, they need to transmit data, file, language in time in order to promote the task performance of field operator Sound, the information such as video, and cannot rely upon fixed Base communication facility, therefore, there is an urgent need to a kind of high-throughput, low delays Quick self-organizing network.

Existing solution has: being based on wireless mesh network, in wireless mesh network, any wireless device node is all It can be used as router, each node in network can send and receive signal, and be no longer dependent on some single node Performance, if nearest node breaks down or is interfered, network can automatically select other paths, entirely communicate Journey is unaffected；Wireless multimedia sensor network (WMSN) affixes one's name to a large amount of microsensor section inside monitoring region Point, WMSN perceive the media information in ambient enviroment by multimedia sensor node, these information can pass through single-hop It is transmitted to aggregation node with the mode of multi-hop relay, then aggregation node is analyzed and processed the data received, finally handle Treated that node is sent to user for analysis, by wireless communication formed one of modeMultihop self-organizing networkTo realize Comprehensive and effective environmental monitoring.But both the above monitoring mode is disadvantageous in that jointly: in mesh network and WMSN net Data carry out multi-hop transmission by intermediate node in network, and each skip to can all bring some delays less, with wireless network scale Expansion, jumper connection is more, and the total delay of accumulation will be bigger, the media application high for communicating requirements such as voice and videos, nothing Hair receives the too long problem that is delayed.Multi-hop rear stability is bad, due to the limitation of bandwidth, multipath fading, noise and signal interference Equal various factors, data the case where there may be discontinuous transmissions, cannot quick networking after link change.

Broadband is improved on the basis of being based on multiplex roles multiple antennas, increasing network flexibility and timeliness, emphasis will solve Certainly the problem of the following aspects:

Improve the correlation time between neighboring transmission node.For audio-video business, need to interact in real time, therefore, One node needs quickly to know around it there is which node.

Optimize the mechanism of transmission that self-organization of network controls information in the process.Mobile wireless network will be communicated, Control message is wanted to carry out the networking between node, forms network topology structure, allowing between communication node can quickly know and need Which to be reached by relay node.

Optimized allocation of resources improves the utilization rate of network.It, may when having multiple message in same channel concurrent transmission The loss of message is collided and caused, the handling capacity of network is reduced, therefore, it is necessary to a kind of channel resource allocation sides of optimization Method in limited Internet resources each message can correctly and quickly be reached.

Summary of the invention

In order to solve the above-mentioned technical problem, the technical scheme is that a kind of network towards multi-element ecology observation is from group Organization method, specifically includes the following steps:

Step 1: the nodal analysis method of design multiplex roles directional aerial；

Step 2: message package, a hop neighbor information table and the two-hop neighbors information table of design discovery adjacent node；

Step 3: finding the detection three times of adjacent neighbors；

Step 4: the slot allocation method after design time division multiplexing mode combination directional aerial；

Step 5: design control message.

Preferably, designing the nodal analysis method of multiplex roles directional aerial described in step 1 are as follows:

There is N number of node in network, each node has unique ID number, and ID value range is { 1,2,3 ... N }, each Node has m interface, and the value range of interface is { 1,2,3 ... ... m }, each Interface Controller n root antenna, antenna value range For { 1,2,3 ... n }；

P (Idn, mi, nj (a)) indicates that the jth root antenna on i-th of interface above n-th of node, a indicate antenna Angle；Antenna above each node distinct interface can work at the same time, but the antenna above same-interface mutually in the same time cannot It works at the same time；

Preferably, finding that the message package of adjacent node is hello message described in step 2；

Hello message is broadcasted in a jump range, cannot be forwarded；

Hello message are as follows:

HelloMessage (Reserved, Htime, HelloMessageSize, NodeId, Local Interface Address, TxAntennaID)；

Wherein,

Reserved: reserved field, it is necessary to be set as complete " 0 "；

The sending cycle of Htime:Hello message indicates how long send a hello packet；

Message Size: the size of the hello message of composition；

NodeId: the ID number of node；

Local Interface Address: the interface IP address of this node；

Tx Antenna ID: the ID number of the transmission antenna of node；

A hop neighbor information table NeighborTable structure described in step 2 are as follows:

NeighborTable (Neighbor Main Table, Link type, N_status, N_vtime, Tx Ante Id),

Wherein,

The main address of Table: one hop neighbor of Neighbor Main；

Link type: the type of link, is respectively as follows: totally by 3 kinds

ASYM_LINK: asymmetric link sends the link right and wrong between the neighbors in the node and list of hello message Symmetrically, expression can receive the message of neighbors, but whether uncertain neighbors can receive the message of this node；

SYM_LINK: symmetric links, the link sent between the neighbors in the node and list of hello message is symmetrical 's.Expression can receive the message of neighbors, and neighbors can also receive the message of this node；

LOST_LINK: link disconnects；

N_status: the state of neighbours is divided into 3 kinds, is respectively as follows:

ASYM_NEIGH: asymmetric neighbours can receive the message of neighbors, whether can receive this to uncertain neighbors The message of node；

SYM_NEIGH: symmetrical neighbours can receive the message of neighbors, and neighbors can also receive disappearing for this node Breath；

NOT_NEIGH: not being neighborhood；

N_vtime: the life span of neighbours；

Tx Ante Id: the transmission antenna number when local node and the neighboring communication；

The 2_hop Neighbor Table structure of two-hop neighbors information table described in step 2 are as follows:

2_hop Neighbor Table (Neighbor Main Table, N_status, N_vtime, N_2hop_ address)

Wherein, N_2hop_address indicates the address of the two-hop neighbors of node；

Preferably, the detection process three times of the adjacent neighbors of detection discovery described in step 3 is as follows:

Step 3.1: node A broadcasts hello message, broadcasts in a jump range, Node-B receiver, if B is not received Hello does not give a response；If B has successfully received the hello packet of A, the hop neighbor table of oneself is inquired；According to neighbor table whether A is stored to decide whether to abandon the hello packet；If it does not exist, then the neighbours' time-to-live and setting A for updating A are the non-of oneself Symmetrical neighbours, and link is asymmetric；

Step 3.2: after node B receives hello packet, AS-ack packet, the structure of AS-ack packet can be replied to A are as follows:

AS-ack (Reserved, Htime, As-ackMessageSize, NodeId, Local Interface Address, TxAntennaID, NeighborTable)；

Wherein NeighborTable is the information of a hop neighbor information table；If A does not receive AS-ack packet, process terminates；

If A receives the AS-ack packet of B, B storage is arrived to the hop neighbor table of oneself, and neighbor state and link state are equal It is then the hop neighbor node j for node i with oneself new two-hop neighbors table according to a hop neighbor table of B to be symmetrical For, a hop neighbor node of i is exactly the two-hop neighbor node of j；

Step 3.3: if the success of step 3.2 process, node A can reply AS-ack packet to B, and AS-ack packet stores A The information such as a hop neighbor, if B does not receive AS-ack packet, process terminates；If B has successfully received the AS-ack packet of A, A is updated to Oneself one jumps symmetrical neighbours and link is symmetrical；Then the two-hop neighbors table of oneself is updated according to a hop neighbor table of A；

By the one cycle of step 3.1 to step 3.3, node A and B can know to can reliably be in communication with each other, Both sides' link is symmetric links and is symmetrical neighbours, we are only concerned symmetric links and symmetrical neighbor information here, in addition A Oneself a hop neighbor and two-hop neighbors information have been both known about with B；

Preferably, the slot allocation method after design time division multiplexing mode combination directional aerial described in step 4 are as follows:

Time slot is divided into many small time slots, every antenna of each node is allowed to send and receive hello in corresponding time slot Packet, is divided according to node ID number here, and the 1st time slot P (Id1, m (1,2,3 ... .m), n1 (a)), which is in, sends hello Bag-like state, i.e. first antenna above the 1st node all of the above interface send hello packet, P (Id (2,3,4 ... ... N), m (1,2,3 ... .m), n (a+ π)) in hello bag-like state is received, each time slot can complete 3.1 to the 3.3 of step 3 One cycle；

Second antenna above the 1st node all of the above interface of second time slot sends hello packet, remaining node It is in the antenna that the aerial angle of first node work differs 180 degree and receives hello bag-like state, have n above an interface Root antenna, such a node need n time slot to complete neighbours' discovery, and N number of node needs n*N time slot to complete neighbours' discovery；

Step 5: design control message；

Preferably, the control message designed in step 5 is in present node hop node broadcast control message around, It does not need all symmetrical neighbours of jump to be forwarded, it is only necessary to select part of nodes, these nodes are known as CTT node, pass through CTT node can strictly reach the symmetrical neighbor node of all double bounces；The collection that CTT node is constituted is combined into CTT set；

The detailed process that the CTT set is chosen are as follows:

Step 5.1: the CTT collection of definition node i is combined into S, and the collection that one jumps symmetrical neighbor node is combined into D1 (i), double bounce The collection of symmetrical neighbor node is combined into D2 (i), if a symmetrical neighbor node of jump of node i is j, definition node i overlay node The symmetrical neighbor node number of jump of j, definition node i in some set is covering number of the node i in some set；

Step 5.2: initialization S is sky, jumps symmetrical neighbor table and the symmetrical neighbor table of double bounce according to the one of node i, obtains D1 (i) with D2 (i), the node for being chosen as CTT must be symmetrical neighbours with this node；

Step 5.3: according to node all in D1 (i), obtaining their covered nodes of institute in D2 (i) respectively Number；

Step 5.4: for any node in D1 (i), if the one of the node existence anduniquess jumps symmetrical neighbor node, This node is added in the set of S；

Step 5.5: if there is also the node not covered by any node in S in D2 (i), in D1 (i) not It is added into the node of S, its node in D2 (i) with maximal cover number is added in the set of S；

Step 5.6: jumping to step 5.5 until there is no the nodes not covered by any node in S in D2 (i)；

To judge which node forwards control message, need to safeguard a CTTSelector table.This table includes node CTTSelector.When CTTSelector receives control message, otherwise forwarding control message does not forward.CTTSelector lattice Formula is CTTSelector (CS_addr, CS_seq_num, CS_time), the meaning of each variable are as follows:

CS_addr: it is chosen as the address of node CTT.

The sequence number of CS_seq_num:CTTSelector collection.For distinguishing the new and old of CTTSelector collection.

CS_time: the retention time of the CTTSelector collection entry deletes the entry if expired.

After the selection for completing CTT node, control message, referred to herein as CT message are then designed, the CT message lifetime is most More double bounces, CT message structure be CtMessage (MessageSeqNo, ANSN, HopCount, Originator Address, Reserved, CTTSelectorAddress), the meaning of these fields are as follows:

MessageSeqNo:CT packet sequence number, for identifying whether to attach most importance to, the CT that multiple connection receives is grouped.It can be according to working as Before receive message sequence number and oneself storage newest a piece of news sequence number comparison selection be receive or abandon should Message.The repetition for both having avoided message in this way receives, reprocessing, but also node does not need to transmit control in order and disappear Breath.

ANSN:CTTSelector sequence number.It is corresponding with CTTSelector table, when CTTSelector set changes When, ANSN updates therewith.

HopCount: hop count.The maximum hop count of CT forwarding no longer forwards when for " 0 ", is set as 2 here.

Originator Address: the node address of CT grouping is generated.

Reserved: reserved field.It is necessary for complete " 0 ".

CTTSelectorAddress: the forwarding address of node CT.

Step 6: design channel allocation algorithm；

Preferably, step 6 design channel allocation algorithm utilizes the advantage and the multi channel advantage of multiplex roles of directional aerial The dual multiplexing for realizing time slot is turned the scheduling problem of channel resource by the topological abstract in network at figure using graph theory thought It is changed to the coloring problem of figure, allows all links in network that can assign to a two-way time slot；

Specific step is as follows for channel allocation algorithm described in step 6:

Step 6.1: definition current topological structure is binary group G<V, E>, G is a non-directed graph, and the degree of node i is node i One jump membership in symmetrical neighbor table.Matrix [A] expression of the coloring case of link, the chain between node i and node j Road element c of the color r in matrix [A]_i,j=r is indicated.The case where time slot occupied by link in network time slot square Battle array [B] indicates, the element d in matrix_i,j=e1 indicates that the e1 time slot gives node i transmission, and node j is received；d_j,i=e2 table Show that the e2 time slot gives node j transmission, node i receives；

Step 6.2: initialization G, [A], [B] is sky, according to topology diagram structural map G, V (P (Idn, mi, nj), P (Ida, mb, nc)), represent the of jth antenna in topology table above i-th of interface of n-th of node and a-th node C antenna above b interface has connection in topological structure.(n a)=1 indicates the link of n node and a node to E To be symmetrical, i.e., there is the link between two nodes of neighborhood in network, schemes G={ (V1, E1), (V2, E2) ... ... (Vn, En) }, n is the item number of link in topological diagram；

Step 6.3: according to node all in G, counting the degree of each node, then arranged from big to small according to the degree of node Sequence；

Step 6.4: start to colour to the maximum node of uncolored degree in step 6.3, coloring number is since 1, successively plus 1, By the different colours of the multilink under same interface, the multilink under distinct interface can be multiplexed same color, but all need To be different from the coloring of the hop neighbor of oneself, in addition certain links of node are crossed color not in node-coloring before Repeat coloring；

Step 6.5: jumping to step 6.4 and coloured until scheming all links in G；

Step 6.6: matrix A being determined according to the coloring number of link, determines coloring element c_i,j, size is respective links Coloring number；

Step 6.7: matrix [B] being determined by matrix [A], according to the element c in coloring matrix_i,j=r acquires d_i,j=2r-1, d_j,i=2r.Node i occupies the time slot that timeslot number is 2r-1 and sends, and the time slot that node j occupies 2r-1 receives, and similarly, node j is accounted for It is sent with the time slot that timeslot number is 2r, the time slot that node i occupies 2r receives.

Increase handling capacity the invention has the advantages that providing one kind and having, improves network efficiency, reduce the technology of time delay, it should Technology merges under the structural system of self-organizing network, by directional aerial with multiplex roles multichannel technology, is directional aerial Non-slotted channel is distributed, optimizes the selection mode of multihop path, quickly establishes the topological structure of the whole network, traditional data is improved and passes Defeated Slot Allocation Algorithm, at the same time in can send out business more.

Detailed description of the invention

Fig. 1: the procedure chart chosen for CTT；

Fig. 2: for traditional control message figure；

Fig. 3: for improved control message figure；

Fig. 4: for the flow chart of colouring algorithm；

Fig. 5: for network topology connection figure；

Fig. 6: for the method for the present invention flow chart.

Specific embodiment

Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other Embodiment shall fall within the protection scope of the present invention.

Traditional network is using single interface single channel transmission signal, and not only speed has an effect on network capacity to this mode slowly, and And the exclusive space division advantage of directional aerial is not fully used.Multiplex roles multichannel technology, can be reduced interference, makes in network Node can send multiple message simultaneously, increase the handling capacity of network.Assuming that there is N number of node in network, each node has Unique ID number, ID value range are { 1,2,3 ... N }, and each node has m interface, the value range of interface for 1,2, 3 ... ... m }, each Interface Controller n root antenna, antenna value range is { 1,2,3 ... n }, it defines P (Idn, mi, nj (a)), Indicate that the jth root antenna on i-th of interface above n-th of node, a indicate the angle of antenna.Note: each node difference connects Antenna above mouthful can work at the same time, but the antenna above same-interface cannot mutually work at the same time in the same time.These antenna is equal Even to be distributed in the range of 360 degree, the antenna number of each antenna configuration is more, and the field angle of each antenna is with regard to smaller, and energy is just It more concentrates, the distance of energy radiation is also corresponding remoter.

Which in outer ecological monitoring out of office, need to know around us there is combatant in real time, to carry out information Interaction.It can design a kind of for carrying out the message package of surrounding neighbours discovery, referred to herein as hello message, hello message is one Broadcast in range is jumped, cannot be forwarded.Hello message format be designed as HelloMessage (Reserved, Htime, HelloMessageSize, NodeId, Local Interface Address, TxAntennaID),

The meaning of each field are as follows:

Reserved: reserved field, it is necessary to be set as complete " 0 ".

The sending cycle of Htime:Hello message indicates how long send a hello packet.

Message Size: the size of the hello message of composition.

NodeId: the ID number of node.

Local Interface Address: the interface IP address of this node.

Tx Antenna ID: the ID number of the transmission antenna of node.

In order to store and in real time utilize neighbor node information, devise a hop neighbor information table NeighborTable and Two-hop neighbors information table 2_hop Neighbor Table structure；

One hop neighbor information table structure is NeighborTable (Neighbor Main Table, Link type, N_ Status, N_vtime, Tx Ante Id), wherein the meaning of each field are as follows:

The main address of Table: one hop neighbor of Neighbor Main.

Link type: the type of link, is respectively as follows: totally by 3 kinds

ASYM_LINK: asymmetric link sends the link right and wrong between the neighbors in the node and list of hello message Symmetrically, expression can receive the message of neighbors, but whether uncertain neighbors can receive the message of this node.

SYM_LINK: symmetric links, the link sent between the neighbors in the node and list of hello message is symmetrical 's.Expression can receive the message of neighbors, and neighbors can also receive the message of this node.

LOST_LINK: link disconnects.

ASYM_NEIGH: asymmetric neighbours can receive the message of neighbors, whether can receive this to uncertain neighbors The message of node.

SYM_NEIGH: symmetrical neighbours can receive the message of neighbors, and neighbors can also receive disappearing for this node Breath.

NOT_NEIGH: not being neighborhood.

N_vtime: the life span of neighbours.

Tx Ante Id: the transmission antenna number when local node and the neighboring communication.

2_hop Neighbor Table (Neighbor Main Table, N_status, N_vtime, N_2hop_ ), address wherein N_2hop_address indicate node two-hop neighbors address.

Step 3: finding the detection three times of adjacent neighbors；

The detection process three times of the adjacent neighbors of detection discovery described in step 3 is as follows:

In order to successfully find adjacent node, and phase mutual energy accurately and reliably communicates, it is necessary to complete bi-directional verification, i.e. A Node can send out message to B, and A knows that B can be sent out to oneself；B sends out message to A, and B knows that A can send out message to B.In this case it needs The detection three times of neighbours is completed, detection process is as follows:

Step 3.1: node A broadcasts hello message, broadcasts in a jump range, Node-B receiver, if B is not received Hello does not give a response.If B has successfully received the hello packet of A, the hop neighbor table of oneself is inquired.According to neighbor table whether A is stored to decide whether to abandon the hello packet.If it does not exist, then the neighbours' time-to-live and setting A for updating A are the non-of oneself Symmetrical neighbours, and link is asymmetric.

Step 3.2: after node B receives hello packet, AS-ack packet can be replied to A, the structure of AS-ack packet is AS-ack (Reserved, Htime, As-ackMessageSize, NodeId, Local Interface Address, TxAntennaID, NeighborTable), wherein NeighborTable be a hop neighbor information table information.If A does not receive AS-ack packet, mistake Journey terminates.If A receives the AS-ack packet of B, B storage is arrived to the hop neighbor table of oneself, and neighbor state and link state are equal It is then the hop neighbor node j for node i with oneself new two-hop neighbors table according to a hop neighbor table of B to be symmetrical For, a hop neighbor node of i is exactly the two-hop neighbor node of j；

Step 3.3: if detection two processes success, node A can reply AS-ack packet to B, and AS-ack packet stores A's The information such as one hop neighbor, if B does not receive AS-ack packet, process terminates.If B has successfully received the AS-ack packet of A, A is updated to certainly Oneself one jumps symmetrical neighbours and link is symmetrical.Then the two-hop neighbors table of oneself is updated according to a hop neighbor table of A.

By step 3.1 to 3.3, node A and B can know that both sides' link is pair to can reliably be in communication with each other Claim link and be symmetrical neighbours, we are only concerned symmetric links and symmetrical neighbor information here, and in addition A and B has been both known about certainly Oneself hop neighbor and two-hop neighbors information.

Carry out neighbour discovery, need to carry out two nodes of neighbours' discovery antenna reiving/transmitting state must on the contrary, I.e. a node is sent, another node receives.

What the antenna of two nodes of progress neighbours' discovery was in alignment with.The standard of alignment is determining of working of two nodes 180 degree is differed to the deflection of the direction of antenna.

But if each node sends hello packet simultaneously in network, it is certain to that the collision of message occurs, therefore devise A kind of slot allocation method after time division multiplexing mode combination directional aerial, is divided into many small time slots for time slot, allows each section Every antenna of point sends and receives hello packet in corresponding time slot, is divided according to node ID number here, the 1st time slot P (Id1, m (1,2,3 ... .m), n1 (a)), which is in, sends hello bag-like state, i.e. above the 1st node all of the above interface First antenna sends hello packet, and P (Id (2,3,4 ... ... N), m (1,2,3 ... .m), n (a+ π)), which is in, receives hello packet State can complete the detection three times of step 2 in this time slot.Above the 1st node all of the above interface of second time slot Second antenna send hello packet, remaining node is in the antenna that the aerial angle that first node works differs 180 degree Hello bag-like state is received, because there is n root antenna above an interface, such a node needs n time slot to complete neighbours' hair Existing, N number of node needs n*N time slot to complete neighbours' discovery.

By this slot allocation method, the advantage of the more directional aerials of multiplex roles is taken full advantage of, makes the same time multiple More antennas above interface work at the same time, and not only effectively avoid the conflict of message, another small time slot only has several millis Second time, therefore the time for having carried out wheel neighbours' discovery is also very short, refer to significantly the discovery efficiency of neighbours with reliably Property.

Step 5: design control message；

Preferably, the control message designed in step 5 utilizes a kind of controlling mechanism of optimization, the control of redesign disappears When the maximum feature of breath is present node to a hop node broadcast control message around, do not need all one jump symmetrical neighbours into Row forwarding, it is only necessary to select part of nodes, these nodes are known as CTT node, can strictly reach all two by CTT node Jump symmetrical neighbor node.The detailed process that CTT set is chosen are as follows:

Step 5.6: jumping to step 5.5 until there is no the nodes not covered by any node in S in D2 (i).

The process chosen below with Fig. 1 come illustratively CTT；

The first step, node i chooses node 1 and is used as its CTT, because its node 1 is the exclusive node to node a.Second step, Node i choose node 2 be used as its CTT because 2 cover 3 uncovered node b, c, d, then select node 4 as CTT, all symmetrical neighbor node of double bounce of the CTT coverage finally chosen.

CS_addr: it is chosen as the address of node CTT.

Originator Address: the node address of CT grouping is generated.

Reserved: reserved field.It is necessary for complete " 0 ".

CTTSelectorAddress: the forwarding address of node CT.

Fig. 2 is traditional control message figure, and Fig. 3 is improved control message figure.The circle of white is two hop nodes, black Circle be forward control message node.Fig. 3 and Fig. 4 comparison is it is found that the self-organizing network process after optimization greatly reduces out Pin.

Step 6: design channel allocation algorithm；

Step 6 designs channel allocation algorithm and realizes time slot using the multi channel advantage of advantage and multiplex roles of directional aerial Dual multiplexing, using graph theory thought, by the topological abstract in network at figure, by the scheduling problem of channel resource be converted to figure Color problem allows all links in network that can assign to a two-way time slot；

Node of the topology connections maps of channel allocation algorithm in network is exchanged with each other neighbor information and control message Calculating is obtained.The whole flow process figure of colouring algorithm of the present invention is as shown in Figure 4.After the completion of neighbor discovery process, control packet is sent, First obtain whole network topology connections maps, then by topology connections maps and to solve the problems, such as all with mathematical linguistics be depicted come, Then the colouring algorithm of orientation multiplex roles is executed, the coloring case of output link finally converts time slot allocation for coloring problem Problem completes the distribution of the channel resource of each link.

Related definition

Before specifically introducing channel allocation algorithm, some relevant contracts are first defined.

Define 1 one orderly binary group<V, E>, it is denoted as G, G indicates a non-directed graph, represents the topology knot in network Structure.V (P (Idn, mi, nj), P (Ida, mb, nc)) represents the jth number in topology table above i-th of interface of n-th of node C antenna above b-th of interface of antenna and a-th of node has connection in topological structure.(n a)=1 indicates No. n to E The link of node and a node be it is symmetrical, i.e., have the link between two nodes of neighborhood in network.Assuming that in network Link be all two-way link.

Define the degree that the membership in a hop neighbor table of 2 node is is known as node i.

Defining 3 colorings matrix [A] indicates the coloring case of link.Element c in matrix_i,j=r indicates node i and node j Between link color number be r.

The case where defining time slot occupied by the link in 4 time slot matrixes [B] expression network.Element d in matrix_i,j=e1 Indicate that the e1 time slot gives node i transmission, node j is received；d_j,i=e2 indicates that the e2 time slot gives node j transmission, node I is received.

Algorithm description

Step 6.1: tectonic network topological diagram

Such as current topological diagram be G=

V1=(P (Id1, m2, n2), P (Id4, m3, n4)), E1=(Isosorbide-5-Nitrae)=1

V2=(P (Id1, m2, n4), P (Id3, m1, n2)), E2=(1,3)=1

V3=(P (Id1, m3, n1), P (Id2, m1, n3)), E3=(1,2)=1

V4=(P (Id2, m2, n2), P (Id3, m3, n4)), E4=(2,3)=1

V5=(P (Id3, m1, n3), P (Id4, m3, n1)), E5=(3,4)=1

V6=(P (Id3, m2, n2), P (Id6, m3, n4)), E6=(3,6)=1

V7=(P (Id3, m2, n3), P (Id8, m1, n1)), E7=(3,8)=1

V8=(P (Id4, m2, n2), P (Id5, m2, n4)), E8=(4,5)=1

V9=(P (Id4, m2, n4), P (Id6, m1, n2)), E9=(4,6)=1

V10=(P (Id6, m1, n3), P (Id7, m3, n1)), E10=(6,7)=1

V11=(P (Id6, m3, n1), P (Id8, m1, n3)), E11=(6,8)=1

}

Topological diagram is as shown in Figure 5

The 2nd antenna under digital representation interface number and day wire size beside node, such as 22 the 2nd interfaces of expression.

Step 6.2: counting the degree of each node according to G, then sort from small to large according to the degree of node.The calculating knot of degree Fruit is

Node1=3；Node2=2；Node3=5；Node4=4；

Node5=1；Node6=4；Node7=1；Node8=2；

The sequence section fruit of degree from big to small:

node3、node4、node6、node1、node2、node8、node5、node7

Ranking results may not be unique.This is because having the possible more than one of the node of identical degree, when this is not influenced The distribution section fruit of gap.

Step 6.3: being coloured according to the sequence of degree to all links of node and construct coloring matrix element

Colour principle: multilink under same interface different colours, the multilink under distinct interface can be multiplexed Same color, but require the coloring of the hop neighbor different from oneself；Certain links of node in node-coloring before It is not repeated to colour by color excessively；

The degree of node 3 is maximum, first gives node3 coloring, by G it is found that 2, No. 3 antennas on node3 interface 1, above interface 2 2, No. 3 antennas, the corresponding link of No. 4 antennas above interface 3 needs to colour, give E (3,1) according to coloring principle, E (3,6), E (3,2) No. 1 color, E (3,4), E (3,8) No. 2 colors.

Then it is coloured to node4, No. 2 antennas on node4 interface 1, No. 4 antennas on interface 2, the Isosorbide-5-Nitrae number on interface 3 The corresponding link of antenna needs to colour.Because E (3,4) by be No. 2 colors, therefore E (4,5), E (4,6), E (4,1) No. 3 colors.

Then it is coloured to node6,2, No. 3 antennas on node6 interface 1,1, No. 3 corresponding chains of antenna above interface 3 Road needs to colour because E (3,6) and E (4,6) are coloured, therefore E (6,7) and E (6,8) No. 4 colors.

Then it is coloured to node1, the 2 of node1 interface 2, the corresponding link of No. 1 antenna of No. 4 antennas, interface 3 needs Color, because of E (3,1), E (4,1) is coloured, and node3 occupies 1 and No. 2 color, and node4 occupies No. 3 colors, therefore node1 is only Need it is different with neighbor node color, i.e. E (1,2) No. 4 colors.

According to above four step, the equal all coloring of link in G is schemed.

The coloring matrix element constructed are as follows: c_3,1=1, c_3,6=1, c_3,2=1, c_3,4=2, c_3,8=2, c_4,5=3, c_4,6 =3, c_4,1=3, c_6,7=4, c_6,8=4, c_1,2=4

Step 6.4: time slot matrix element is constructed according to coloring matrix element

Distribute time slot principle: since link is two-way, so distribution timeslot number is twice of chromatic number.

According to the element c in coloring matrix_i,jThe rule that=r distributes time slot is as follows: it is 2r-1's that node i, which occupies timeslot number, Time slot is sent, and the time slot that node j occupies 2r-1 receives.Similarly, the time slot that node j occupies that timeslot number is 2r is sent, and node i occupies The time slot of 2r receives.

The time slot matrix element constructed are as follows: d_3,1=1, d_1,3=2, d_3,6=1, d_6,3=2, d_3,2=1, d_2,3=2, d_3,4 =3, d_4,3=4, d_3,8=3, d_8,3=4, d_4,5=5, d_5,4=6, d_4,6=5, d_6,4=6, d_4,1=5, d_1,4=6, d_6,7=7, d_7,6 =8, d_6.8=7, d_8,6=8, d_1,2=7, d_2,1=8

As can be seen that this Slot Allocation Algorithm realizes effective multiplexing of time slot.For the network of 8 nodes, if Node does not configure directional aerial and multiplex roles, will need 22 time slots (a total of 11 links in network) that could cover entire net Network.But only need 8 time slots can be complete herein according to the Slot Allocation Algorithm of the characteristic of directional aerial and multiplex roles design All standing whole network increases the reusability of time slot, increases the capacity of network.When the interstitial content in network increases, open up When flutterring structure and becoming more sophisticated, the algorithm of time slot allocation proposed in this paper will be more advantageous.

Specific embodiment described herein is only an example for the spirit of the invention.The neck of technology belonging to the present invention The technical staff in domain can make various modifications or additions to the described embodiments or replace by a similar method In generation, however, it does not deviate from the spirit of the invention or beyond the scope of the appended claims.

Claims

1. a kind of self-organization of network method towards multi-element ecology observation characterized by comprising

Step 3: finding the detection three times of adjacent neighbors；

Step 5: design control message；

Step 6: design channel allocation algorithm.

2. the self-organization of network method according to claim 1 towards multi-element ecology observation, it is characterised in that: in step 1 The nodal analysis method of the design multiplex roles directional aerial are as follows:

There is N number of node in network, each node has unique ID number, and ID value range is { 1,2,3 ... N }, each node Have m interface, the value range of interface is { 1,2,3 ... ... m }, each Interface Controller n root antenna, antenna value range be 1, 2,3……n}；

P (Idn, mi, nj (a)) indicates that the jth root antenna on i-th of interface above n-th of node, a indicate the angle of antenna Degree；Antenna above each node distinct interface can work at the same time, but the antenna above same-interface mutually in the same time cannot be same When work.

3. the self-organization of network method according to claim 1 towards multi-element ecology observation, it is characterised in that: in step 2 The message package of the discovery adjacent node is hello message；

Hello message is broadcasted in a jump range, cannot be forwarded；

Hello message are as follows:

Wherein,

Reserved: reserved field, it is necessary to be set as complete " 0 "；

Message Size: the size of the hello message of composition；

NodeId: the ID number of node；

Local Interface Address: the interface IP address of this node；

Tx Antenna ID: the ID number of the transmission antenna of node；

NeighborTable (Neighbor Main Table, Link type, N_status, N_vtime, Tx Ante Id),

Wherein,

The main address of Table: one hop neighbor of Neighbor Main；

Link type: the type of link, is respectively as follows: totally by 3 kinds

ASYM_LINK: asymmetric link, the link sent between the neighbors in the node and list of hello message is asymmetric , indicate the message that can receive neighbors, but whether uncertain neighbors can receive the message of this node；

SYM_LINK: symmetric links, sending the link between the neighbors in the node and list of hello message is symmetrical, table Show the message that can receive neighbors, and neighbors can also receive the message of this node；

LOST_LINK: link disconnects；

ASYM_NEIGH: asymmetric neighbours can receive the message of neighbors, whether can receive this node to uncertain neighbors Message；

SYM_NEIGH: symmetrical neighbours can receive the message of neighbors, and neighbors can also receive the message of this node；

NOT_NEIGH: not being neighborhood；

N_vtime: the life span of neighbours；

2_hop Neighbor Table (Neighbor Main Table, N_status, N_vtime, N_2hop_address)

Wherein, N_2hop_address indicates the address of the two-hop neighbors of node.

4. the self-organization of network method according to claim 1 towards multi-element ecology observation, it is characterised in that: in step 3 The detection process three times of the detection discovery adjacent neighbors is as follows:

Step 3.1: node A broadcasts hello message, broadcasts in a jump range, Node-B receiver, if B does not receive hello, no It gives a response；If B has successfully received the hello packet of A, the hop neighbor table of oneself is inquired；It determines according to whether neighbor table stores A It is fixed whether to abandon the hello packet；If it does not exist, then the neighbours' time-to-live and setting A that update A are the asymmetric neighbours of oneself, And link is asymmetric；

If A receives the AS-ack packet of B, B storage is arrived to the hop neighbor table of oneself, and neighbor state and link state are pair Claim, then according to a hop neighbor table of B come with oneself new two-hop neighbors table i.e. for a hop neighbor node j of node i, A hop neighbor node of i is exactly the two-hop neighbor node of j；

Step 3.3: if the success of step 3.2 process, node A can reply AS-ack packet to B, and AS-ack packet stores the one of A The information such as hop neighbor, if B does not receive AS-ack packet, process terminates；If B has successfully received the AS-ack packet of A, A is updated to oneself One jump symmetrical neighbours and link is symmetrical；Then the two-hop neighbors table of oneself is updated according to a hop neighbor table of A；

By the one cycle of step 3.1 to step 3.3, node A and B can know to can reliably be in communication with each other, both sides Link is symmetric links and is symmetrical neighbours, we are only concerned symmetric links and symmetrical neighbor information here, in addition A and B Oneself a hop neighbor and two-hop neighbors information are both known about.

5. the self-organization of network method according to claim 1 towards multi-element ecology observation, it is characterised in that: in step 4 Slot allocation method after the design time division multiplexing mode combination directional aerial are as follows:

Time slot is divided into many small time slots, every antenna of each node is allowed to send and receive hello packet in corresponding time slot, this In be to be divided according to node ID number, the 1st time slot P (Id1, m (1,2,3 ... .m), n1 (a)), which is in, sends hello bag-like State, i.e. first antenna above the 1st node all of the above interface send hello packet, P (Id (2,3,4 ... ... N), m (1,2,3 ... .m), n (a+ π)) in hello bag-like state is received, each time slot can complete the one of 3.1 to the 3.3 of step 3 Secondary circulation；

Second antenna above the 1st node all of the above interface of second time slot sends hello packet, remaining node and the The antenna of the aerial angle difference 180 degree of one node work, which is in, receives hello bag-like state, has n root day above an interface Line, such a node need n time slot to complete neighbours' discovery, and N number of node needs n*N time slot to complete neighbours' discovery.

6. the self-organization of network method according to claim 1 towards multi-element ecology observation, it is characterised in that: in step 5 The control message of design does not need all one and jumps symmetrical neighbours in present node hop node broadcast control message around It is forwarded, it is only necessary to select part of nodes, these nodes are known as CTT node, can strictly reach by CTT node all The symmetrical neighbor node of double bounce；The collection that CTT node is constituted is combined into CTT set；

The detailed process that the CTT set is chosen are as follows:

Step 5.1: the CTT collection of definition node i is combined into S, and the collection that one jumps symmetrical neighbor node is combined into D1 (i), and double bounce is symmetrical The collection of neighbor node is combined into D2 (i), if the one of node i jumps symmetrical neighbor node as j, definition node i overlay node j, determines A jump symmetrical neighbor node number of the adopted node i in some set is covering number of the node i in some set；

Step 5.2: initialization S is sky, jumps symmetrical neighbor table and the symmetrical neighbor table of double bounce according to the one of node i, obtain D1 (i) and D2 (i), the node for being chosen as CTT must be symmetrical neighbours with this node；

Step 5.3: according to node all in D1 (i), obtaining their covered node numbers of institute in D2 (i) respectively；

Step 5.4: for any node in D1 (i), if the one of the node existence anduniquess jumps symmetrical neighbor node, by this Node is added in the set of S；

Step 5.5: if there is also the nodes not covered by any node in S in D2 (i), for not added in D1 (i) Its node in D2 (i) with maximal cover number is added in the set of S the node for entering S；

To judge which node forwards control message, need to safeguard that a CTTSelector table, this table include node CTTSelector, when CTTSelector receives control message, otherwise forwarding control message does not forward, CTTSelector lattice Formula is CTTSelector (CS_addr, CS_seq_num, CS_time), the meaning of each variable are as follows:

CS_addr: it is chosen as the address of node CTT；

The sequence number of CS_seq_num:CTTSelector collection；For distinguishing the new and old of CTTSelector collection；

CS_time: the retention time of the CTTSelector collection entry deletes the entry if expired；

After the selection for completing CTT node, control message, referred to herein as CT message, CT message lifetime most two are then designed Jump, CT message structure be CtMessage (MessageSeqNo, ANSN, HopCount, Originator Address, Reserved, CTTSelectorAddress), the meaning of these fields are as follows:

MessageSeqNo:CT packet sequence number, for identifying whether to attach most importance to, the CT that multiple connection receives is grouped；It can be according to currently connecing The sequence number comparison selection for receiving the newest a piece of news that the sequence number of message is stored with oneself is to receive or abandoning this disappears Breath；The repetition for both having avoided message in this way is received, is reprocessed, but also node does not need transmitting control message in order；

ANSN:CTTSelector sequence number；It is corresponding with CTTSelector table, when CTTSelector set changes, ANSN updates therewith；

HopCount: hop count；The maximum hop count of CT forwarding no longer forwards when for " 0 ", is set as 2 here；

Originator Address: the node address of CT grouping is generated；

Reserved: reserved field；It is necessary for complete " 0 "；

CTTSelectorAddress: the forwarding address of node CT.

7. the self-organization of network method according to claim 1 towards multi-element ecology observation, it is characterised in that: step 6 is set The dual multiplexing that channel allocation algorithm realizes time slot using the multi channel advantage of advantage and multiplex roles of directional aerial is counted, using figure The scheduling problem of channel resource is converted to the coloring problem of figure by the topological abstract in network at figure by thought, is allowed in network All links can assign to a two-way time slot；

Step 6.1: definition current topological structure is binary group G<V, E>, G is a non-directed graph, and the degree of node i is the one of node i Jump the membership in symmetrical neighbor table；Matrix [A] expression of the coloring case of link, the link institute between node i and node j Element c of the color r in matrix [A]_i,j=r is indicated；The case where time slot occupied by link in network time slot matrix [B] is indicated, the element d in matrix_i,j=e1 indicates that the e1 time slot gives node i transmission, and node j is received；d_j,i=e2 is indicated The e2 time slot gives node j transmission, and node i receives；

Step 6.2: initialization G, [A], [B] be sky, according to topology diagram structural map G, V (P (Idn, mi, nj), P (Ida, Mb, nc)), b-th for representing the jth antenna and a-th of node in topology table above i-th of interface of n-th of node connects C antenna above mouthful has connection in topological structure；(n a)=1 indicates that the link of n node and a node is symmetrical to E , i.e., there is the link between two nodes of neighborhood in network, scheme G={ (V1, E1), (V2, E2) ... ... (Vn, En) }, N is the item number of link in topological diagram；

Step 6.3: according to node all in G, counting the degree of each node, then sorted from large to small according to the degree of node；

Step 6.4: starting to colour to the maximum node of uncolored degree in step 6.3, coloring number is since 1, successively plus 1, will be same Multilink under one interface different colours, the multilink under distinct interface can be multiplexed same color, but require not It is same as the coloring of the hop neighbor of oneself, in addition certain links of node have been crossed the no longer heavy of color in node-coloring before Multiple coloring；

Step 6.5: jumping to step 6.4 and coloured until scheming all links in G；

Step 6.6: matrix A being determined according to the coloring number of link, determines coloring element c_i,j, size is the coloring of respective links Number；

Step 6.7: matrix [B] being determined by matrix [A], according to the element c in coloring matrix_i,j=r acquires d_i,j=2r-1, d_j,i =2r；Node i occupies the time slot that timeslot number is 2r-1 and sends, and the time slot that node j occupies 2r-1 receives, similarly, when node j is occupied The time slot that gap number is 2r is sent, and the time slot that node i occupies 2r receives.