CN1738270A - Method for building self-organized network skeleton structure - Google Patents
Method for building self-organized network skeleton structure Download PDFInfo
- Publication number
- CN1738270A CN1738270A CN 200410064253 CN200410064253A CN1738270A CN 1738270 A CN1738270 A CN 1738270A CN 200410064253 CN200410064253 CN 200410064253 CN 200410064253 A CN200410064253 A CN 200410064253A CN 1738270 A CN1738270 A CN 1738270A
- Authority
- CN
- China
- Prior art keywords
- node
- backbone
- self
- adjacent
- 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.)
- Granted
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a construction method of self-organizing network main structure for realizing a self-organizing network with better rate of expansion, smaller size of main structure and less consumption of network system to improve the transmission efficiency and the property of network. The invention comprises: setting the type of start nodes of all nodes as initial nodes which send the status information pack periodically; setting all initial nodes as main nodes or auxiliary nodes according to the received status information pack of adjacent nodes; the auxiliary nodes receive the status information of adjacent nodes and send the 'adjacent nodes status information pack' periodically; the main codes generate and cooperate the auxiliary nodes to complete the arrangement of connected nodes according to the received 'adjacent nodes status information pack'; when said arrangement is completed, all the nodes of network adjust the type of nodes according to the received adjacent nodes status information pack in present period and the last period.
Description
Technical field
The present invention relates to a kind of construction method of network, relate in particular to a kind of construction method of self-organized network skeleton structure.
Background technology
Network can be divided into two big classes on structure is formed: the network of fixed infrastructure and the network of no fixed infrastructure are arranged.
Have be provided with in the network of fixed infrastructure fixing, by the interconnective network node of wired mode, these nodes have constituted the basic architecture of network, as Cellular Networks, local wireless Access Network (WLAN).In the Cellular Networks, infrastructure network is made up of the base station, is the center with the base station, and circle (regular hexagon) zone in the base station radius constitutes one " sub-district ", and fixing equally distributed base station is realized the covering of network to the somewhere jointly.The base station of user's mobile device and sub-district of living in directly connects, and all data all are transmitted to the user by the base station, generally interconnects by wired mode between the base station, and the base station is furnished with special-purpose switching equipment and finishes exchange, forwarding to user data.
In the local wireless Access Network, access point AP (Access Point) has constituted the foundation structure of network.Portable terminal in the transceiver coverage of each AP can insert the internet by AP, and all user data are all transmitted by AP.In this type of wireless network, " access point " (base station, the AP etc.) in portable terminal and its communication range connect, and the business datum of being transmitted is all by " access point " processing forward.When terminal shifts out and enters in the communication range of another " access point " in the communication range of " access point ", between new and old " access point ", switch, make their can be in whole network continuous seamless communications that carries out.But the terminal that is positioned at outside system's " access point " coverage then can't be got in touch with system's foundation, can't directly set up communication link between the terminal.Whole topology of networks is fixed, and is determined by the distribution of basic network equipment.
The network of no fixed infrastructure does not have special-purpose " access point " or special-purpose switching equipment, but by one group of spontaneous a kind of distributed communication network that forms of user terminal, is called as " self-organizing network " (Ad hoc network).
Self-organizing network is used in some special environment, such as the area that does not have in provisional environment such as meeting room, office, classroom and family or conventional communication networks to cover or can't operate as normal, set up and be used for the issue of information and shared LAN.Owing to there is not fixing network node, therefore need to make up a kind of new-type network structure, wherein do not have fixed infrastructure, and form by user terminal is spontaneous, be a kind of distributed communication network.
In self-organizing network, the data passes between the adjacent end need not passed through base station device forwards such as (or AP), but directly sets up the communication link of " end-to-end " between these two terminals.Therefore each portable terminal all has routing and switching function, and when non-adjacent terminal need be communicated by letter, terminal self can dynamically be searched for effective route, transmits packet by other-end, in the mode of " multi-hop " data information transfer is arrived the final purpose terminal.Therefore, the characteristics of self-organizing network are " no center insert " and " multi-hop ", and the center access is arranged and be that the network of the fixed infrastructure that comprises special equipment of single-hop networks is different.
In the initial self-organizing network, node all belongs to same type, internodal connected relation is decided by physical index parameters such as euclidean distance between node pair, signal transmitter power, antenna gain, path loss, signal receiver sensitivity, and at this moment, we claim that all nodes are start node.As shown in Figure 1.
Be the overhead that reduces self-organizing network, the scaling concern that improves network router efficiency, solution self-organizing network, can be according to internodal interconnected relationship, the selected part node becomes interim regional center (being called backbone node) in network, is responsible for the system information of other nodes in its coverage and safeguards; Other nodes are called leg gusset.The leg gusset that part can be communicated with backbone node is designated as the connection node, all backbone nodes constitute the network that is interconnected by being communicated with node, in order to the node system information between the exchange zones of different, all backbone nodes and connection node can cover whole network fully.As shown in Figure 2, node A, B, C, D, E are backbone node among the figure, and Node B 1, B2, C1, C2, D1, D2, E1 are for being communicated with node, and other nodes are leg gusset.Backbone node, connection node, leg gusset and annexation each other thereof have constituted " the virtual backbone structure " of self-organizing network.
In the virtual backbone structure of self-organizing network, when node u, the mutual Data transmission of v, then directly transmit if u, v are adjacent, if u, v are non-conterminous, then data are transmitted by the virtual backbone structure.That is: source node sends the data to its adjacent backbone node, backbone node is sought " to the shortest path of the backbone node adjacent with receiving node " in the virtual backbone structure, and send data to " backbone node adjacent " with receiving node, by " backbone node adjacent " data are sent to receiving node again with receiving node.Therefore the virtual backbone structures shape length of the used route of data passes (that is: the jumping figure of route) between any two nodes in the network.
Specifically, referring to Fig. 2, in network, when leg gusset S need be when leg gusset K sends data, S at first sends route inquiry bag, inquire the route of K, because K and S are non-conterminous, therefore will transmit this route inquiry bag by the backbone node B of S correspondence, successively, other are received the backbone node of this route inquiry bag or are communicated with node and will continue to transmit this route inquiry bag (leg gusset is not transmitted), after the backbone node E of K correspondence receives route inquiry bag, answer routing iinformation to node S, and then set up the effective route (S-B-B1-A-C2-C-C1-E-K) from S to K.
Information transmitted can be divided into two classes in the self-organizing network: data message, system information.Data message is meant user's data designated of transmitting from source terminal to the purpose terminal; System information then refers to other information that need propagate except that the user specifies the data of transmission in network, comprise the state information of network, the time synchronization information of network, the route search maintenance information in the network etc., these information all need be broadcasted in the certain limit of network.The propagation of system information is the chief component of network overhead.Network overhead is nonlinear exponential increase with the expansion of network size, therefore when the scale of self-organizing network enlarges, must propagate the system information of network and effectively control, to keep network overhead within the acceptable range.
In the virtual backbone structure of self-organizing network, the index of estimating a virtual backbone structural behaviour mainly comprises: the rate of spread of the scale of backbone structure (backbone node and be communicated with the quantity summation of node), backbone structure and set up the expense (in setting up process, the byte number summation of the packets of information that all nodes send) of backbone structure.Wherein the rate of spread S of backbone structure is meant under the initial condition of network and (does not set up backbone structure), and the shortest path length in the network between any two node u, v is D
G(u, v); After setting up backbone structure, the shortest path length in the network between u, v is D
G1(u, v), its both ratio, promptly
In present self-organizing network research, the method that some self-organized network skeleton structures are set up has been proposed.
At Peng-Jun Wan, Khaled M.Alzoubi, Ophir Fireder etc. is published in Journal of Communications and Networks, Vol4, in the paper of No.1 March 2002 " Distributed Construction of Connected Dominating Setin Wireless Ad Hoc Networks ", a kind of method (method 1) that is used for the self-organized network skeleton network struction has been proposed.In the method, a kind of selection strategy that is communicated with node has been proposed: promptly all backbone nodes all are provided with one and are communicated with sign K, at initial condition K=0.Select a backbone node A in backbone node, it is communicated with sign K and is set to 1, i.e. K=1.Initiate to be communicated with the option program of node by backbone node A.For the backbone node B of any K=0, search in the backbone node of its K=1 near, select a backbone node C nearest apart from backbone node B.Then, backbone node B is set to be communicated with node to the intermediate node on the link between the C.
At Khaled Alzoubi, Xiang-Yang Li, Yu Wang, Peng-Jun Wan, Ophir Frieder etc. is published in IEEE Transactions on Parallel andDistributed System, Vol.14, No.5, in the paper of May 2003 " GeometricSpanners for Wireless Ad Hoc Networks ", a kind of method (method 2) that is used for the self-organized network skeleton network struction is disclosed.In the method, each leg gusset is broadcasted the routing iinformation of its backbone node within the double bounce.Find it itself is the intermediate node that connects backbone node B and backbone node C as leg gusset A, and other sequence numbers of leg gusset D that can connect B and C are bigger than the sequence number of A, then leg gusset A is provided with the own connection node that is.
But, in above-mentioned construction method (1), though the self-organizing network that makes up has the small scale and the little advantage of network system expense of backbone structure, but owing to only be to guarantee that all backbone nodes are communicated with, be not communicated with link and guarantee all to exist between the adjacent backbone node of any three jumpings, the rate of spread that therefore may produce self-organizing network is very big, can not guarantee that network has reliable controllability.
And in above-mentioned construction method (2), though the self-organizing network of structure has the rate of spread of convergence, determine voluntarily by relevant leg gusset owing to be communicated with node.Under non-conterminous situation between relevant leg gusset, cause easily between two three adjacent two backbone node B within jumping and C to exist many to be communicated with links, thereby its backbone structure is larger, very big network system expense is especially arranged.
By Fig. 3 the above-mentioned situations that may produce many connection links are described.If u, v are backbone nodes, w, x, s, t are auxiliary nodes; In left figure, because w, x are non-conterminous, can't hear the packets of information that it sends mutually, cause w, x to be set as the connection node that is communicated with u and v simultaneously; In right figure, can't hear the packets of information that it sends between w, x and s, the t mutually, cause w, x and s, t to be set as the connection node that is communicated with u and v simultaneously.
For the increasing needs of the scale that satisfies self-organizing network, a kind of construction method of new self-organized network skeleton structure need to be proposed, good to reach the rate of spread, have the less backbone structure scale and the effect of network system expense simultaneously.
Summary of the invention
An object of the present invention is to provide a kind of construction method of self-organized network skeleton structure, utilize this construction method, realize the good and backbone structure small scale of a kind of rate of spread, and the little self-organizing network of network system expense, thereby improve the efficiency of transmission and the network performance of network effectively.
Construction method according to a kind of self-organized network skeleton structure of the present invention is a kind of in the terminal of self-organizing network, essential characteristic parameter according to terminal, selection portion divides specific terminal to come the method for building network backbone structure, it comprises: the start node type of all nodes is set to start node, and start node periodically sends the state information bag; According to the state information bag of the adjacent node that receives, all start nodes are set to backbone node or leg gusset; Leg gusset receives the state information of adjacent node, and periodically sends " adjacent node state information bag "; According to " the adjacent node state information bag " that receive, backbone node is initiated also and leg gusset is finished the setting that is communicated with node together; Finish be communicated with being provided with of node after, the state information bag of the adjacent node that the state information bag of the adjacent node that all nodes in the network receive according to its current period and last cycle receive is adjusted the node type of node.When in finishing node type adjustment and self-organizing network, not having start node, just realized the building process of self-organizing network.
According to another object of the present invention is the construction method that proposes a kind of self-organized network skeleton structure, and " broadcast node " is set in the method, is used to reduce this network of network expense.It comprises step: when a backbone node remains non-" broadcast node " state duration R (R＞0), this backbone node is provided with oneself and is " broadcast node ", and initiate " broadcast node selection course ", send " broadcast node search information " (BQ); After receiving BQ for the connection node of non-" broadcast node ", this connection node writes self networks unique identification sign indicating number in " forward node 1 or 2 " territory in " broadcast node search information ", and transmits this BQ to adjacent connection node or backbone node; When another received this BQ for the backbone node of non-" broadcast node ", this backbone node setting was from as " broadcast node ", himself network unique identification sign indicating number write this BQ, and this BQ is transmitted to its adjacent connection node; According to the information in " forward node " territory of record in its BQ that receives bag, the connection node in this territory sends " broadcast node confirmation " (BR) simultaneously; After receiving BR, the connection node is provided with oneself and is " broadcast node ".
By with reference to below in conjunction with the content in the description of the drawings and claims, and
Along with more complete understanding of the invention, other purposes of the present invention and effect will be returned become clear more and easy to understand.
Description of drawings
Hereinafter with reference to accompanying drawing, describe the present invention in detail by embodiment, wherein:
Fig. 1 shows the schematic diagram of start node in the existing self-organized network skeleton structure;
Fig. 2 shows the schematic diagram of backbone node, leg gusset and the connection node of existing self-organizing network;
Fig. 3 shows in-problem schematic diagram in the existing self-organizing network construction method;
Fig. 4 represents the schematic diagram of the initial condition of self-organizing network of the present invention;
Fig. 5 represents the backbone node of self-organizing network of the present invention and the schematic diagram of leg gusset.
Fig. 6 represents the chain graph of two backbone nodes of connection of self-organizing network of the present invention;
Fig. 7 represents definite schematic diagram of the connection node of self-organizing network of the present invention;
Fig. 8 represents the flow chart of construction method of the self-organized network skeleton structure of one embodiment of the present of invention;
Fig. 9 shows the flow chart that start node in the construction method of self-organized network skeleton structure of one embodiment of the invention is set to backbone node and leg gusset;
Figure 10 show that backbone node in the construction method of self-organized network skeleton structure is according to an embodiment of the invention initiated and and leg gusset come together to be provided with the flow chart of connection node;
Figure 11 shows in the construction method of self-organized network skeleton structure according to an embodiment of the invention the node type of non-start node is adjusted flow chart;
Figure 12 represents broadcast node schematic diagram of the present invention (wherein square nodes is a broadcast node);
Figure 13 shows the product process figure of " broadcast node " in the construction method of self-organized network skeleton structure of one embodiment of the invention;
Figure 14 represents that self-organized network skeleton structure is structured in the network protocol layer;
Figure 15 represents the comparison on the rate of spread of the present invention and prior art;
Figure 16 represents the comparison on network size of the present invention and prior art;
Figure 17 represents the comparison on overhead of the present invention and prior art;
Figure 18 represents the comparison of the present invention and prior art broadcast node quantity when the node sum changes;
Figure 19 represents the comparison of the present invention and prior art broadcast message coverage rate when the node sum changes;
Figure 20 represents the comparison of the present invention and prior art broadcast node quantity when the transmission radius change;
Figure 21 represents the comparison of the present invention and prior art broadcast message coverage rate when the transmission radius change;
Embodiment
In self-organizing network, each terminal (being node) all has the function of route switching, can send and receive information transmitted in the network, and two adjacent end (being node) can directly be set up the communication link of " end-to-end ".In self-organizing network, " adjacent node " is meant two nodes that have physical connection therebetween, and in cordless communication network, this kind physical connection refers generally to wireless connections.
Hereinafter, the construction method with the self-organized network skeleton structure that in conjunction with the accompanying drawings the present invention proposed is described in detail.
The construction method feature of network backbone infrastructure of the present invention comprises:
1. the terminal in the self-organizing network is categorized as four types (start node, backbone node, connection node, leg gussets); The starting type of node is a start node; All backbone nodes and connection node constitute the backbone structure of network;
2. each node periodic (period T＞0 second) sends its own state information bag (the network unique identification sign indicating number that comprises the backbone node of its own network unique identification sign indicating number, state parameter W, type, oneself correspondence); Each leg gusset and be communicated with the state information that node is collected its adjacent node, and regularly send " neighbor node state information bag " (the network unique identification sign indicating number ID of backbone node that comprises network unique identification sign indicating number ID, its neighbor node correspondence of its oneself network unique identification sign indicating number ID, state parameter W, type, its neighbor node);
3. the content of state parameter W comprises: all neighbor node quantity of node, current current current transmission load condition quantized value, the current computing capability of node of movement rate, the historical transmission success rate of node, node of energy reserve situation quantized value, node of node take percentage, node ID.
4. when in the adjacent node of initial node during no backbone node, in all adjacent start nodes, the type that satisfies the start node oneself of selective rule K1 (W) is set to backbone node, and sends the state information bag of oneself; Here K1 (W) can be but be not limited to be: the weighted value maximum of energy maximum, storage capacity maximum, traffic load minimum, computing capability free time maximum, historical transmission success rate maximum or above-mentioned any a plurality of parameters, when the above-mentioned parameter of a plurality of nodes equates, be that less important selection is according to (above-mentioned parameter is the main foundation of selecting) then with ID maximum or ID minimum.
5. we are that " ID minimum " is example with K1 (W), and in Fig. 4, the ID of all nodes is labeled as 1,2 successively ..., all nodes be " start node ", the black connecting line represents that node is adjacent.So node 1 and node 2 can find its satisfy " do not have backbone node in the neighbor node, and himself satisfy the criterion of " K1 (W)---ID minimum ", thus node 1 and node 2 will to be provided with own be backbone node, as shown in Figure 5.
6. when initial node is received the state information bag that adjacent backbone node sends, then according to selective rule K2 (W), select one of them backbone node as own corresponding backbone node, the type that oneself is set is a leg gusset, and send " backbone node selection packets of information " to this backbone node, it be the backbone node of own correspondence that statement is selected it.Here the implication of K2 (W) and above-mentioned K1 (W) are similar, but both concrete definition can be identical or different in actual applications.For example, in regular K1 (W),, then in regular K2 (W), both can select the backbone node that is of ID maximum, also can select the backbone node that is of ID minimum if selection ID maximum is backbone node.
We are that " ID minimum " is example with K2 (W) still, in network shown in Figure 4, node 3,4 ... 12 with the state information bag of receiving that respectively backbone node 1 and backbone node 2 send, and then oneself is set for leg gusset, and to select node 1 or node 2 be its corresponding backbone node, as shown in Figure 5.
1. after backbone node u receives " the neighbor node state information bag " that its neighbours' leg gusset sends, learn in Q jumping scope (here if calculate, Q can get 2,3,4 ... Deng, but in order to reduce the operation burden of network, get Q more than or equal to 2 and smaller or equal to 3 for preferred plan) have another backbone node v, and the network unique identification sign indicating number of u is littler than v, determine that then node u is the active initiator (i.e. the side of settinging) of unique connection node selection course, u can connect in the link of u and v one of appointment at all and satisfy selective rule K3 (W
P) link as the connecting path between u and the v (this will guarantee to be communicated with the uniqueness of the connection link of backbone node u and v), and the node on this link sends " the backbone node path is selected bag ", after leg gusset on this link was received this " the backbone node path is selected bag ", it oneself was set to be communicated with node; Selective rule K3 (W
P) can be: the arithmetic mean that note can be communicated with the W value of the auxiliary node on the link of two backbone nodes is W
P, then have minimum W
PWhat be worth is selected, perhaps has maximum W
PWhat be worth is selected.
Network unique identification sign indicating number with u is an example than the little of v above, the active initiator who node u is defined as being communicated with the node selection course has been described, but also can be set at when the network unique identification sign indicating number of u during, node u is defined as being communicated with the active initiator of node selection course than v big.As long as above-mentioned setting make to be communicated with the selection of node only by a backbone node, rather than select, just can guarantee to be communicated with the uniqueness of the connection link of backbone node u and v by a plurality of backbone nodes.
Here we so that " W of node equals node ID, K3 (W
P) for having minimum W
PValue selected " criterion be example, in network shown in Figure 6, by receiving " neighbor node state information bag ", backbone node 1 and backbone node 2 all can be known and have two paths between them, respectively by node 3,8 or 7,12; Because the ID of node 1 is littler than node 2,, calculate the W of these two links therefore with the active initiator of node 1 as connection node selection course
PValue, and according to K3 (W
P) rule selects node 3 and node 8 for being communicated with node, sets up the unique connection link between backbone node 1 and the backbone node 2.As shown in Figure 7.
8. the setting of above-mentioned backbone node, leg gusset, connection node is a dynamic process.Each node all periodically receives the state information bag of its neighbours' node, and current all information of neighbor nodes are recorded in the neighbor node tabulation, when node finds that the tabulation of its neighbor node tabulation last one-period has the variation of M%, perhaps when auxiliary node or when being communicated with the node N continuous and time not receiving the state information bag that sends from its corresponding backbone node, then the Status Type of oneself is set is the concurrent packets of information that does well of start node to this node; Wherein 1≤M≤100,1＜N＜+∞;
Fig. 8 is the flow chart of the construction method of self-organized network skeleton structure according to an embodiment of the invention.
In Fig. 8, at first,, all nodes all are set to start node, and obtain the state information bag (S10) of this node in initial state;
Then, each start node sends the state information bag of self periodically (period T＞0 second), and each start node periodically receives the state information bag that adjacent node sends simultaneously.In the state information bag, the network unique identification sign indicating number of the backbone node of the node correspondence of start node all is set to sky (step S20).
Then, according to the state information bag of the adjacent node that receives, all start nodes are arranged to backbone node or leg gusset (step S30), its detailed process as shown in Figure 9.
In Fig. 9, the node current type is a start node, at first, judges whether to receive the state information bag (step S301) of adjacent bone dry contact.
If receive the state information bag of adjacent bone dry contact,, in the adjacent bone dry contact, select a backbone node that satisfies selective rule K2 (W), with its backbone node as this start node correspondence just according to selective rule K2 (W); Simultaneously, this start node oneself is set to leg gusset, and in the state information bag of oneself, add the network unique identification sign indicating number of the network unique identification sign indicating number of this backbone node as the corresponding backbone node of this leg gusset, the state information bag of this leg gusset is carried out corresponding modify.Wherein, selective rule K2 (W) selects or the selection of maximum W value according to minimum W value, still is maximum W value but select minimum W value, the character (step S302) of the concrete state parameter W that then depends in the network struction to be concerned about.Then, this leg gusset sends " backbone node selection packets of information " (S303) to this backbone node, and periodically sends state information bag (S307).
If do not receive the state information bag of adjacent bone dry contact, then judge whether to receive the state information bag (S304) of adjacent start node.When not receiving the state information bag of adjacent start node, this start node oneself is set to backbone node, revises its state information bag (S305) simultaneously, and periodically sends state information bag (S307).When receiving the state information bag of adjacent start node, just the adjacent start node with all of this start node is compared, judge whether it is the start node that satisfies selective rule K1 (W).If satisfy, just oneself is set to backbone node, revises its state information bag (S306) simultaneously, otherwise just this start node is not provided with, and is about to this node fundamental type and remains start node, periodically sends state information bag (S307) simultaneously.Wherein, selective rule K1 (W) selects or the selection of maximum W value according to minimum W value, still is the character of the maximum W value concrete state parameter that then depends in the network struction to be concerned about but select minimum W value.
After above-mentioned steps is finished, carry out the node type setting of next start node.So circulation all is configured to backbone node or leg gusset until the node type of all start nodes.
Get back to Fig. 8 below.Finish all start nodes are arranged to backbone node or leg gusset after, leg gusset receives the state information of adjacent node, and periodically sends adjacent node state information (S40).Wherein the adjacent node state information comprises: the network unique identification sign indicating number of the network unique identification sign indicating number of the network unique identification sign indicating number of node, state parameter W, node type, adjacent node and the backbone node of adjacent node correspondence.
Next, after receiving the adjacent node state information, backbone node is initiated also and leg gusset is finished the setting (S50) that is communicated with node together, and its concrete setting up procedure as shown in figure 10.
In Figure 10, node u current type is a backbone node.At first, after receiving adjacent node state information (S501), via route search, this backbone node u judges whether there is other backbone node (S502) in double bounce or three jumping scopes.If exist, just the network unique identification sign indicating number of node u and the network unique identification sign indicating number of other backbone node are compared, therefrom select the backbone node v (S503) of network unique identification sign indicating number greater than the network unique identification sign indicating number of backbone node u.If there is this kind backbone node v, just according to selective rule K3 (W), u can connect at all and specifies a link that satisfies selective rule K3 (W) as the connecting path between u and the v in the link of u and v, and the node on this link sends " the backbone node path is selected bag " (S504).Wherein, selective rule K3 (W) is the mean value W that select to be communicated with the W value of the auxiliary node on the link of two backbone nodes
PHas minimum W
PValue or have maximum W
PValue.But select minimum W
PValue is maximum W still
PThe character of the concrete state parameter that value depends in the network struction to be concerned about.
Judge whether leg gusset is received " backbone node path select bag " (S505).After receiving " the backbone node path is selected bag ", leg gusset oneself is set to be communicated with node (S506), and leg gusset is revised the state information bag of self, and periodically sends state information bag (S507).
In self-organizing network, also need the non-start node that has existed in the network to be carried out node type adjustment (S60) according to the position relation of adjacent node and the existing resource situation of node, its adjustment process is as shown in figure 11.
In Figure 11, in self-organizing network, each non-start node all periodically receives " the neighbor state packets of information " of its adjacent node, and writes down current all adjacent node information (step S601).According to all adjacent node information of record, this non-start node compares the adjacent node information list of the last one-period of the adjacent node information list of current period and record, judges whether the variation (step S602) of M%.If exist, just this node is set to start node, and revises state information bag (step S603), otherwise keeps the origin node situation, does not carry out node type adjustment (step S606).
According to the adjacent node information that receives, backbone node judges whether occur backbone node (step S604) in its adjacent node, if, this node is set to start node, and modification state information bag (step S603), otherwise keep the origin node situation, do not carry out node type adjustment (step S606).
According to the adjacent node information that receives, judge this node whether N continuous time do not receive the state information bag (step S605) that sends from its corresponding backbone node, if, this node is set to start node, and modification state information bag (step S603), otherwise keep the origin node situation, do not carry out node type adjustment (step S606).
In above-mentioned discussion, M and N can select to set according to the concrete applied environment of network, and 1≤M≤100,1＜N＜+∞.Then, according to top processing method, this node is carried out node type once more determine start node.
Make up self-organized network skeleton structure according to above-mentioned explanation, when there is not start node in all nodes in the network and does not need to adjust, just realized the building process of whole self-organized network skeleton structure.
In the method for structure self-organizing network of the present invention,, in node types, also defined a kind of additivity type " broadcast node " in order to obtain littler network system expense.This additivity type can be provided with simultaneously with the above-mentioned fundamental type of node." broadcast node " only is suitable for all backbone nodes and is communicated with node.
Describe " broadcast node " constant current journey really in detail below in conjunction with accompanying drawing.
After system information is received by certain the node S in the network, and this system information need be forwarded, then have only when node S be backbone node or when being communicated with node, node S just transmits this system information;
Establish broadcast node: in foundation shown in Figure 2 in the network configuration of backbone node, leg gusset and connection node, double bounce or three is jumped between adjacent backbone node and has all been set up the connection link arbitrarily.When in the network during transmitting broadcast information, in fact we only need to select whole backbone nodes and part in the network to be communicated with node as broadcast node, transmit a broadcast message by broadcast node, can guarantee information cover the whole network, as shown in figure 12, among Figure 12, square nodes is a broadcast node.。
Figure 13 shows the product process figure of broadcast node.
In Figure 13, at first, adjudicate certain backbone node and whether be in non-" broadcast node " state continuance R time (R＞0) state (step S701) that remains, if, with regard to mark oneself is " broadcast node " simultaneously, and send " broadcast node search information " (being designated as BQ) (comprising: broadcast node is selected sequence number, initiated backbone node, forward node 1, forward node 2) to its adjacent connection node.Backbone node is initiated " broadcast node selection ", and this node is " initiation backbone node " (the step S702) of BQ for this reason, otherwise carries out the state justify of next backbone node.
Then, judge whether the node that receives BQ is broadcast node (step S703).
If receive the node of this BQ when being broadcast node, this node abandons this BQ bag (step S704).
Judge whether the node that receives this BQ is to be communicated with node (step S705).Be communicated with node and himself is non-broadcast node if receive the node of this BQ and be, just its oneself network unique identification sign indicating number write in " forward node 1 (2) " territory of BQ and and transmit this BQ (step S706) to its adjacent connection node or backbone node.
Judge whether the node that receives this BQ is backbone node (step S707).If receive the node of this BQ and be backbone node M and himself is non-broadcast node, then mark oneself is a broadcast node, with its oneself network unique identification sign indicating number write BQ " initiation backbone node " territory, transmit this BQ to its adjacent connection node, M sends " broadcast node confirmation " (being designated as BR) (step S708) according to the information of " forward node 1,2 " of record in its BQ that receives bag to the connection node of network unique identification sign indicating number in " forward node 1 (2) " territory simultaneously.
Next, the connection node of receiving this BR be provided with oneself for " broadcast node " (S709).
For all " broadcast node ", when changing, correspondingly this node addition type is set to non-" broadcast node " (S710) when the basic status type of " broadcast node " (be backbone node, be communicated with node).
After finishing being provided with of above-mentioned fundamental node type (start node, backbone node, connection node and leg gusset) and addition type node (broadcast node), just realized a kind of self-organizing network that can improve network transmission efficiency and reduce the network system expense.
Usually, the structure of self-organized network skeleton structure is to carry out in network protocol layer as shown in figure 14.
Our emulation the performance curve of three kinds of algorithms, simulated conditions is as follows: at the even random distribution N node (10≤N≤100) in 100 meters * 100 meters zone, each node effective transmission radius be 40 meters, each emulated data point is to repeat the arithmetic mean of emulation 100 times.
(assembly average is got in emulation 100 times for N, R) parameter for every group.In the emulation, the performance index parameter of system comprises: broadcast node quantity, broadcast message coverage rate are defined as follows:
● broadcast node quantity: in network, be labeled as the node sum of " broadcast node ", equal the number of times that the broadcast message bag is forwarded in each broadcast message transmission; Broadcast node quantity is few more, and the Internet resources expense that broadcasting is caused is few more.
● the broadcast message repetition rate: when each broadcast node was transmitted the broadcast message bag, its all adjacent nodes can both be received this information; In each broadcasting process, the number of times summation that all nodes receive this information is defined as the broadcast message repetition rate with the ratio of network node sum; This value is low more, shows that the broadcast node distribution of network is more reasonable, and the broadcast overhead of system is more little, and its theoretical desirable lower bound is 1.
Figure 15～Figure 21 has provided when node transmission radius is 25,40,55,70, under the different number of nodes, and the comparison of algorithm performance.(on behalf of document [3] method, BB, AA represent document [2] method, CC to represent method of the present invention)
Beneficial effect
In sum, according to the construction method of a kind of self-organizing network of the present invention, the strategy of stipulating in the application of the invention correspondingly determines that the Status Type of node makes up (comprising basic status type and additivity type) backbone structure of self-organizing network.Provisioning Policy by improvement connection node provides a kind of rate of spread good and backbone structure small scale, and the little self-organizing network of network system expense, thereby improves the efficiency of transmission and the network performance of network effectively.
In the self-organizing networking, select wherein part of nodes conduct " broadcast node ".Need to broadcast being sent to all nodes in the whole network in the system information, be responsible for transmitting by " broadcast node " and transmit, other information in the system information are then by backbone node be communicated with node and be responsible for transmitting and transmit.The forwarding of system information broadcasting is only finished by specific node (backbone node, connection node, broadcast node) like this, has reduced the hop count of system information.And in transmission network, the propagation of system information is the chief component of network overhead, has reduced the expense of network thus.
In the self-organized network skeleton structure that makes up according to the present invention, have distributed nature, be suitable for extensive self-organizing network, in maintenance process, have adaptivity, can guarantee the efficient and the reliability of data transmission in network.
In the present invention, be communicated with node and be by one in the backbone node (ID bigger or less one) and select according to the rule of determining, therefore between u, v, have only an intermediate node that is communicated with on the link to be designated as the connection node, reduced the scale of virtual backbone structure.
It should be appreciated by those skilled in the art that the self-organizing network construction method that is used for to improve network transmission efficiency and reduces the network system expense disclosed in this invention, can on the basis that does not break away from content of the present invention, make various modifications.Disclosed in this manual only is example, is not limited to this.Protection scope of the present invention should be determined by the content of affiliated claims.
Claims (23)
1, a kind of construction method of self-organized network skeleton network configuration, it comprises step:
(a) each node is set to start node;
(b) each start node periodically sends the state information bag, and periodically receives the state information bag that adjacent node sends;
(c) according to the state information bag of the described adjacent node that receives, described start node is set to backbone node or leg gusset;
(d) according to the adjacent node state information that receives, only in described leg gusset, set the connection node by a backbone node in the described backbone node, be communicated with structure backbone network structure between node and other backbone nodes by this.
2, the construction method of self-organized network skeleton structure as claimed in claim 1, wherein step (c) further comprises:
(c1) if start node receives the state information bag that the adjacent bone dry contact sends, then select the backbone node of one of them backbone node, and this start node is set to leg gusset as this start node correspondence;
(c2) described leg gusset is revised its state information bag, and sends " backbone node selection packets of information " to the backbone node of described correspondence.
3, the construction method of self-organized network skeleton structure as claimed in claim 2, wherein step (c) further comprises:
(c3) when start node receives only the state information bag that adjacent start node sends and do not receive the state information bag that the adjacent bone dry contact sends, then adjacent with all start node is compared, and the start node that satisfies predetermined rule is set to backbone node.
4, the construction method of self-organized network skeleton structure as claimed in claim 3, wherein step (c) further comprises:
(c4) do not receive the state information bag that state information bag that adjacent node sends and adjacent bone dry contact send at start node, just this start node is set to backbone node.
5, in the construction method as claim 1,2,3 or 4 described self-organized network skeleton structures, wherein in the state information bag, the network unique identification sign indicating number of the pairing backbone node of start node is empty.
6, the construction method of self-organized network skeleton structure as claimed in claim 1, wherein step (d) further comprises:
(d1) " the adjacent node state information bag " that receives according to backbone node u, route search two skips to another backbone node v in the three jumping scopes;
(d2) if the network unique identification sign indicating number of backbone node u less than the network unique identification sign indicating number of backbone node v, in all links between u and v, backbone node u specifies a link that satisfies to select pre-defined rule as the connecting path between u and the v;
(d3) behind the connecting path of selecting between Wangue dry contact u and the v, the leg gusset of backbone node u on this connecting path sends " the backbone node path is selected bag ";
(d4) after receiving " the backbone node path is selected bag ", all leg gussets on this connecting path oneself are set to be communicated with node.
7, the construction method of self-organized network skeleton structure as claimed in claim 1 further comprises:
(e) after finishing being provided with of described connection node,, the non-start node in the network is carried out the node type adjustment according to the position relation of described adjacent node and the existing resource situation of described each node.
8, the construction method of self-organized network skeleton structure as claimed in claim 7, wherein step (e) further comprises:
(e1) each non-start node all periodically receives the state information bag of adjacent node and writes down current all adjacent node information;
(e2) described each non-start node compared the adjacent node information of current period and the adjacent node information of last one-period according to all adjacent node information of record; When finding that the tabulation of current adjacent node tabulation adjacent node of last one-period surpasses the variation of regulation, should be adjusted into start node by non-start node;
9, during the construction method of self-organized network skeleton structure as claimed in claim 7, wherein step (e) further comprises:
(e4) when being communicated with the state information bag that node or leg gusset N continuous time do not receive that its corresponding backbone node sends, node should be communicated with or leg gusset is adjusted into start node.
10, in the construction method as claim 1,2,3 and 4 described self-organized network skeleton structures, wherein said state information bag is the state information of node in network, comprises network unique identification sign indicating number, state parameter W, the node type of node, the network unique identification sign indicating number of the pairing backbone node of this node.
11, in the construction method of self-organized network skeleton structure as claimed in claim 6, wherein state parameter W is that current current current transmission load condition quantized value, the current computing capability of node of movement rate, the historical transmission success rate of node, node of energy reserve situation quantized value, node of all adjacent node quantity, node of node one of takies in the percentage, perhaps the weighted average of above-mentioned a plurality of parameters.
12. the construction method of self-organized network skeleton structure according to claim 2, in described step (c1), described start node is to the selection of described backbone node, be to select to take percentage as current current current transmission load condition quantized value, the current computing capability of node of movement rate, the historical transmission success rate of node, node of energy reserve situation quantized value, node of all neighbor node quantity, node of the node of state parameter, node ID is maximum or minimum value; Perhaps selecting the network unique identification sign indicating number of node is maximum or minimum value.
13. the construction method of self-organized network skeleton structure according to claim 3, described predetermined rule is, selection takies percentage as current transmission load condition quantized value, the current computing capability of node of all neighbor node quantity, the node of the node of state parameter current energy reserve situation quantized value, node current movement rate, the historical transmission success rate of node, node, and node ID is maximum or minimum value; Perhaps selecting the network unique identification sign indicating number of node is maximum or minimum value.
14, the construction method of self-organized network skeleton structure according to claim 6, in step (d2), described selective rule is: the arithmetic mean of establishing the W value of the auxiliary node on the link that can be communicated with two backbone nodes is W
P, then select to have minimum W
PThe auxiliary node of value perhaps selects to have maximum W
PThe auxiliary node of value is as being communicated with node.
15, as the construction method of claim 1,2,3 and 4 described self-organized network skeleton structures, can further include step:
(h) after having determined the node fundamental type of self-organizing network, the selection portion partial node is as " broadcast node " in all backbone nodes and connection node.
16, the construction method of self-organized network skeleton structure as claimed in claim 15, wherein step (h) can also comprise:
(h1) when a backbone node remains non-" broadcast node " state duration R (R＞0), this backbone node is provided with oneself and is " broadcast node ", and initiation " broadcast node selection ".
17, the construction method of self-organized network skeleton structure as claimed in claim 15, wherein step (h) can also comprise:
(h2) backbone node of " broadcast node " sends " broadcast node search information " (BQ) to adjacent connection node;
(h3) after receiving BQ for the connection node of non-" broadcast node ", this connection node writes self networks unique identification sign indicating number in " forward node 1 or 2 " territory in " broadcast node search information ", and transmits this BQ to adjacent connection node or backbone node;
(h4) after another backbone node for non-" broadcast node " receives this BQ, then this backbone node setting is certainly as " broadcast node ", himself network unique identification sign indicating number is write " initiation backbone node " territory of this BQ, and this BQ is transmitted to its adjacent connection node; According to the information in " forward node " territory of record in its BQ that receives bag, the connection node in this territory sends " broadcast node confirmation " (BR) simultaneously;
(h5) the connection node of receiving BR is provided with oneself and is " broadcast node ".
18, the construction method of self-organized network skeleton structure as claimed in claim 15, wherein step (h) can also comprise:
(h6) if receive when the node of BQ is " broadcast node " that this node abandons this BQ information.
19, the construction method of self-organized network skeleton structure as claimed in claim 15, wherein addition type can only be backbone node or be communicated with node for the fundamental type of the node of " broadcast node ".
20, the construction method of self-organized network skeleton structure as claimed in claim 1, wherein the state information bag that receives of node and the information in " adjacent node state information bag " only relate to this node double bounce within the state information of adjacent node.
21, the construction method of self-organized network skeleton structure as claimed in claim 16 wherein can also comprise step:
When the basic status type of " broadcast node " be backbone node, when being communicated with node and changing, this node is set to non-" broadcast node ".
22, the construction method of self-organized network skeleton structure as claimed in claim 16, wherein said " broadcast node search information " comprise broadcast node selection sequence number, initiate backbone node territory, forward node territory; Wherein initiate the backbone node information of storage initiation BQ in the backbone node territory, the connection nodal information of BQ is transmitted in storage in the forward node territory.
23, as the construction method of claim 15 or 16 described self-organized network skeleton structures, wherein system information can only be passed through " broadcast node ", backbone node and the forwarding of connection node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100642531A CN100440832C (en) | 2004-08-20 | 2004-08-20 | Method for building self-organized network skeleton structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100642531A CN100440832C (en) | 2004-08-20 | 2004-08-20 | Method for building self-organized network skeleton structure |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1738270A true CN1738270A (en) | 2006-02-22 |
| CN100440832C CN100440832C (en) | 2008-12-03 |
Family
ID=36080936
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100642531A Expired - Fee Related CN100440832C (en) | 2004-08-20 | 2004-08-20 | Method for building self-organized network skeleton structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100440832C (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101940055A (en) * | 2008-02-08 | 2011-01-05 | 雅虎公司 | Location tracking based on proximity-based ad hoc network |
| CN102137335A (en) * | 2011-02-26 | 2011-07-27 | 无锡泛联物联网科技股份有限公司 | High-reliability radio broadcast method based on backbone structure |
| CN102271342A (en) * | 2011-09-13 | 2011-12-07 | 智格网信息科技(上海)有限公司 | Rapid deploying method and device of wireless ad hoc network |
| CN102547903A (en) * | 2012-01-18 | 2012-07-04 | 北京航空航天大学 | Network backbone node selecting method for wireless sensor based on compressed sensing |
| CN111491324A (en) * | 2019-01-29 | 2020-08-04 | 电信科学技术研究院有限公司 | Method, device and storage medium for maintaining virtual backbone network |
| CN111542077A (en) * | 2020-04-30 | 2020-08-14 | 哈尔滨海能达科技有限公司 | Communication node selection method and device |
| CN113938842A (en) * | 2021-08-27 | 2022-01-14 | 中国电子科技集团公司第五十四研究所 | Method, network equipment and system for self-organizing network root node election |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1309266C (en) * | 2002-06-06 | 2007-04-04 | 摩托罗拉公司(在特拉华州注册的公司) | Protocol and structure for mobile nodes in a self-organizing communication network |
| US6788650B2 (en) * | 2002-06-06 | 2004-09-07 | Motorola, Inc. | Network architecture, addressing and routing |
| US6879574B2 (en) * | 2002-06-24 | 2005-04-12 | Nokia Corporation | Mobile mesh Ad-Hoc networking |
| CN100351829C (en) * | 2003-06-13 | 2007-11-28 | 中国科学院计算技术研究所 | Self-organizing dynamic network computer system structure |
-
2004
- 2004-08-20 CN CNB2004100642531A patent/CN100440832C/en not_active Expired - Fee Related
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101940055A (en) * | 2008-02-08 | 2011-01-05 | 雅虎公司 | Location tracking based on proximity-based ad hoc network |
| CN101940055B (en) * | 2008-02-08 | 2013-07-10 | 雅虎公司 | Location tracking based on proximity-based ad hoc network |
| CN102137335A (en) * | 2011-02-26 | 2011-07-27 | 无锡泛联物联网科技股份有限公司 | High-reliability radio broadcast method based on backbone structure |
| CN102137335B (en) * | 2011-02-26 | 2013-07-10 | 无锡泛联物联网科技股份有限公司 | High-reliability radio broadcast method based on backbone structure |
| CN102271342A (en) * | 2011-09-13 | 2011-12-07 | 智格网信息科技(上海)有限公司 | Rapid deploying method and device of wireless ad hoc network |
| CN102271342B (en) * | 2011-09-13 | 2014-09-24 | 智格网信息科技(上海)有限公司 | Rapid deploying method and device of wireless ad hoc network |
| CN102547903B (en) * | 2012-01-18 | 2014-04-16 | 北京航空航天大学 | Network backbone node selecting method for wireless sensor based on compressed sensing |
| CN102547903A (en) * | 2012-01-18 | 2012-07-04 | 北京航空航天大学 | Network backbone node selecting method for wireless sensor based on compressed sensing |
| CN111491324A (en) * | 2019-01-29 | 2020-08-04 | 电信科学技术研究院有限公司 | Method, device and storage medium for maintaining virtual backbone network |
| CN111491324B (en) * | 2019-01-29 | 2022-04-01 | 大唐移动通信设备有限公司 | Method, device and storage medium for maintaining virtual backbone network |
| CN111542077A (en) * | 2020-04-30 | 2020-08-14 | 哈尔滨海能达科技有限公司 | Communication node selection method and device |
| CN111542077B (en) * | 2020-04-30 | 2023-04-14 | 哈尔滨海能达科技有限公司 | Communication node selection method and device |
| CN113938842A (en) * | 2021-08-27 | 2022-01-14 | 中国电子科技集团公司第五十四研究所 | Method, network equipment and system for self-organizing network root node election |
| CN113938842B (en) * | 2021-08-27 | 2022-10-11 | 中国电子科技集团公司第五十四研究所 | Method, network equipment and system for self-organizing network root node election |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100440832C (en) | 2008-12-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100576826C (en) | A kind of vehicle-mounted Ad hoc network cluster dividing method based on the signal bonding strength | |
| CN1224281C (en) | Mobile AD-HOC network based on weighting quality measuration and executive function thereof | |
| CN100591029C (en) | Multi-jump wireless self-organizing network construction method based on partition tree | |
| US8072928B2 (en) | Optimal time slot assignment for networks | |
| CN105813129A (en) | Resource allocation method based on D2D clustering | |
| CN109041127A (en) | The adaptive stabilizing cluster-dividing method and system of load balancing suitable for highly dynamic radio network | |
| CN101594281A (en) | Collecting network data of wireless sensor method, system and relevant device | |
| CN101827421B (en) | DSR cooperative routing method based on channel state information and router | |
| CN101431810A (en) | Cross-layer cooperated routing method supporting multi-speed transmission in Ad Hoc network | |
| CN105873007A (en) | Method for discovering neighbor nodes in wireless ad hoc network of switchable beam antenna | |
| CN108834100A (en) | A kind of efficient broadcast routing method | |
| CN103391595A (en) | Mine emergency rescue wireless mesh network routing method based on cross-layer link state feedback | |
| CN1738270A (en) | Method for building self-organized network skeleton structure | |
| CN103560966A (en) | Opportunistic network route mixing method based on network coding and copying | |
| CN103533597A (en) | Unstructured mobile peer-to-peer coverage network and construction and maintenance methods thereof | |
| CN104901885B (en) | A kind of Security routing system of selection of geographical location information auxiliary | |
| Yu et al. | Enhanced Bluetree: A mesh topology approach forming Bluetooth scatternet | |
| Shayesteh et al. | An innovative clustering algorithm for MANETs based on cluster stability | |
| CN114040471B (en) | Distributed topology control method and terminal based on Bluetooth network | |
| CN112689275B (en) | Novel non-uniform power forming method for BLE mesh network | |
| CN112533262B (en) | Multi-path on-demand routing method of rechargeable wireless sensor network | |
| Papadopoulos et al. | A mobility-supporting MAC scheme for bursty traffic in IoT and WSNs | |
| Belghith et al. | A distributed clustering algorithm without an explicit neighborhood knowledge | |
| CN102202000B (en) | Routing selection method based on node property in social transportation in opportunistic network | |
| Chaturvedi et al. | Energy aware route selection algorithm for cross layer design over MANET |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20081203 Termination date: 20150820 |
|
| EXPY | Termination of patent right or utility model |