CN103945484A - Farmland wireless self-organizing network topology density correlation path selecting and optimizing method - Google Patents
Farmland wireless self-organizing network topology density correlation path selecting and optimizing method Download PDFInfo
- Publication number
- CN103945484A CN103945484A CN201410087797.3A CN201410087797A CN103945484A CN 103945484 A CN103945484 A CN 103945484A CN 201410087797 A CN201410087797 A CN 201410087797A CN 103945484 A CN103945484 A CN 103945484A
- Authority
- CN
- China
- Prior art keywords
- node
- bunch
- energy
- cluster
- head
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a farmland wireless self-organizing network topology density correlation path selecting and optimizing method. The method includes the steps that firstly, node energy is calculated, voting is carried out, and cluster heads are determined; secondly, nodes within a preset threshold value are received by the cluster heads and added, and clustering operation is carried out; thirdly, nodes corresponding to which clustering operation is not completed become intra-cluster sub-nodes according to a pre-established method; fourthly, energy advantage nodes are selected from the intra-cluster sub-nodes to serve as fake cluster heads; fifthly, reverse scattering and networking are carried out according to the cluster heads and the fake cluster heads; sixthly, environment information collecting and reporting are carried out on all nodes through a networking route; seventhly, whether a cluster head arrives at an energy approximating target or not is judged; eighthly, if a cluster head arrives at the energy approximating target, the next round is marked to carry out cluster head election, collection of the current round ends, and otherwise collection of the round ends. By means of the method, clustering efficiency is improved, cluster head selection frequency is lowered, and overall network energy efficiency is improved.
Description
Technical field
The present invention relates to electronic communication field, relate in particular to a kind of farmland wireless self-organized network topology density associated path and select optimization method.
Background technology
Routing Protocol is the core technology of wireless self-organization network network layer, traditional wireless self-organization network is based on (the Quality of Service that improves service quality, QoS) and network fairness aspect proposed many agreements and improved one's methods, the emphasis of these agreement researchs is mainly reduction end-to-end delay, avoid channel congestion, increase network utilization, reduce with average energy consumption etc.
Find by literature search, self-organizing network routing algorithm mainly can be divided into plane Routing Protocol and hierarchical routing.Flood routing agreement is the most a kind of traditional plane Routing Protocol, source node is to all neighbor node broadcast data packet, intermediate node continues with forms of broadcasting forwarding data bag after receiving packet, until data diffusion arrives destination node, for wireless self-organization network, the formula route of flooding simply, easily realize, without foundation and the maintenance of carrying out network topological information, is not calculated yet and is selected optimum routed path and calculating and the energy consumption brought; Its shortcoming is also apparent, a large amount of data are overlapping, aggregation node can be received the many parts of data from same node, the huge waste of network communications capability will be caused and propagate this piece of data, network integrated communication inefficiency, bring huge energy consumption because mass data forwards, node energy consumption equalization problem cannot ensure more simultaneously.For head it off, researcher has proposed the plane Routing Protocol of series of optimum.The AODV Routing Protocol that Perkins CE etc. propose, by source node broadcast request message RREQ, receives that the node of this message is searched self routing table, if exist effective routing to reply message RREP.The method for routing foundation of AODV agreement is relatively simple, solve the overlapping problem of data in the agreement that floods, the variation of network topology structure is also had to stronger adaptability, but its shortcoming has been, there is blindly broadcast issue in Route establishment process, process of establishing expense is large, and easily produces the problem of message storm, and route building efficiency is low, do not consider node load situation, critical path and Nodes easily produce congested, and each node all needs route link information to preserve, safeguard, energy consumption expense is large.Hierarchical routing algorithm is mainly taking clustering route protocol as main, and LEACH is the self adaptation cluster Routing Protocol being proposed by people such as Heinzelman, and its cluster thought is in most clustering route protocols thereafter.In LEACH algorithm, all nodes become a bunch head by a certain Probability p, become the node broadcasts message of bunch head, complete level route construction.Due to LEACH algorithm cluster head random-selection node, so easily death of the low-yield node of accelerating part, shorten overall network life cycle, it improves algorithm as LEACH-C, DEEC, CHCS etc. are carrying out all introducing node energy when bunch head is selected, choose a bunch head according to residue energy of node height, the extra energy consumption that bunch head is forwarded is uniformly distributed between high energy node, but owing to still adopting LEACH core cluster thought, so all there is following point in above algorithm, 1. a bunch quantity is different according to algorithm difference, in practical application, a best bunch quantity is difficult to determine that 2. Distributed cluster head selection algorithm easily causes a bunch skewness, a centralized bunch of selection algorithm needs aggregation node frequently to obtain all nodal informations, algorithm expense is bunch head and aggregation node direct communication greatly 3., and farmland self-organizing network coverage is large, the leader cluster node communication energy consumption far away apart from aggregation node is huge or cannot realize and the direct communication of aggregation node.Patent of invention " based on the wireless sensor network diffusion routing algorithm connecting " (notification number: CN101902795A) provides a kind of diffusion routing algorithm of energy consumption balance, node is preserved link information separately, find the next-hop node address of routed path according to link information, all nodes carry out successively, until data successfully arrive destination node, in the process of selecting paths, consider between the node of energy and computational resource balanced simultaneously, the method has only solved the problem of energy consumption inequality in plane Routing Protocol, and other problems still exists.Patent of invention " a kind of wireless sensor network Routing Optimization Algorithm consuming based on energy " (notification number: 102802175A), " a kind of routing algorithm for wireless sensor of energy efficient " (notification number: 102802230A) provide respectively a kind of plane road based on energy optimization by with the algorithm optimization of level route, but just carry out energy optimization for prior art, and unresolved otherwise problem, practicality is not high.
Existing plane Routing Protocol is for fear of data overlap in Flood routing agreement, inefficiency problem, distributed or the centralized routed path system of selection of general employing, but the method needs the arbitrary node on path to safeguard the whole node-routing information on path, place, for key position node, the routing iinformation of most of node in storage and maintenance network possibly, along with network size increases, has significantly increased node and has calculated storage resources and energy consumption expense.In addition also there is the blindly problem such as broadcast and message storm in the Route establishment phase in the distributed diffusion routing algorithm under large scale network condition, and Route establishment convergence is slow, efficiency is low; Centralized Routing Protocol needs the frequent collector node information of aggregation node, and algorithm communication overhead is large, and situation about changing for network configuration needs the overall situation to readjust, and very flexible, efficiency is low, waste is large.Based on the plane Routing Protocol of minimum hop count or path least energy, easily cause critical path node task heavy, the problem that energy consumes rapidly.
For the hierarchical routing taking cluster algorithm as master, energy consumption balance routing algorithm makes node serve as in turn a bunch head by different modes, thereby by average between node outer bunch neck energy consumption, its major defect is to ensure the equal access network of all nodes, especially for only have with some or a few node the relative isolated node connecting in network topology, if connected node does not become a bunch head, this node also cannot establish a communications link and become actual isolated node with a bunch head.In prior art, be main to the selection of bunch head mainly with energy constraint, do not consider that node location distributes, easily cause a bunch skewness, even cause networking failure and produce more isolated node.In existing clustering route protocol research, it is generally acknowledged that bunch head and aggregation node are direct communications, and each bunch of head communicated by letter with consuming energy with aggregation node and equated, actual in the distance of nodal distance aggregation node is each unequal, bunch head far away at a distance of aggregation node needs larger emitted energy, the hypothesis equal so consume energy is obviously false, for the application of extensive farmland self-organizing network, because overlay area is large, between bunch head and aggregation node, even may reach the common batteries node single-hop communication distance that is beyond one's reach.Bunch head based on energy weight is selected, need to be in every bunch interior nodes information of collection of taking turns, some algorithm also need to calculate the whole network or bunch in average nodal energy, algorithm expense is larger.In prior art, the number of nodes difference that bunch head need to be born, burden difference can cause network energy consumption unbalanced, and the computational resource of node cluster head node is limited in addition, if bunch interior nodes quantity is too much, in also can causing bunch, communication is congested, reduces communication efficiency.A bunch system of selection of prior art is uploaded interval by information gathering and is divided into " wheel ", every wheel while beginning carried out the collection of node energy state, exchange after energy information, how much carry out election of cluster head according to dump energy, election process complexity, communication computing cost is large, has increased the average energy consumption of node, and bunch head may be served as in turn by certain or certain several nodes in many rounds, has caused unnecessary waste.
Summary of the invention
Technical problem to be solved by this invention is how to meet the basic acquisition performance of large scale network under complex environment to require the equilibrium problem between limited energy consumption.
For this purpose, the present invention proposes a kind of farmland wireless self-organized network topology density associated path and select optimization method, comprise concrete following steps:
S1: computing node energy is voted, determines bunch head;
S2: the node in described bunch of head reception predetermined threshold value adds, and carries out cluster operation;
S3: child node in becoming bunch by presetting method for the node that does not complete the operation of described cluster;
S4: choose energy advantage node in child node as pseudo-bunch head in described bunch;
S5: carry out diffuse in reverse direction networking according to described bunch of head and described puppet bunch head;
S6: all nodes are carried out environment information acquisition and reported by network routing;
S7: judged whether that a bunch head reaches energy and approaches target;
S8: approach target if exist a bunch head to reach described energy, mark next round is carried out described election of cluster head, finishes epicycle collection, approaches target if do not exist a bunch head to reach described energy, and epicycle collection finishes.
Particularly, for the node that does not complete the operation of described cluster with planar diffusion routing mode search network access point, and become access point place bunch bunch in child node.
Particularly, described node basis completes the different resting states that successively enter of order that group network collection is uploaded.
Further, described step S1 further comprises:
S11: a described node in arbitrary node is carried out to self-energy calculating operation, obtain the transmitting power after described residue energy of node information, topological power control;
S12: send described nodal information to topological neighbor node with described transmitting power;
S13: described node is according to the nodal information of receiving described topological neighbor node feedback, relatively the dump energy information of neighbor node;
S14: choose the neighbor node that dump energy is the highest, send ballot message to it;
S15: the election weight according to the energy grade computing node of the topological density index of node region and node:
Computing formula is:
Wherein, node i records topological neighbours' quantity, as node topology density index, is designated as node degree ND
i; Node i receives after the ballot message that neighbor node sends, and cumulatively show that aggregate votes are as node energy grade V
i;
S16: node is to neighbor node broadcast self election weight;
S17: if the franchise of certain node is great in the election weight of its all neighbor nodes, this node becomes bunch head and broadcasts cluster message.
Further, after described step S17, also comprise:
Receive the cluster message of described bunch of head broadcast when node, select a bunch of head by preset rules, send feedback message and add described bunch, bunch head is according to feedback message compute cluster interior nodes average energy.
Particularly, described nodal information comprises node ID, residue energy of node and all the other node attribute information except this node.
Further, described step S4 further comprises:
S41: obtain described bunch interior nodes average energy;
S42: judge the energy of child node and the size of its access bunch interior nodes average energy;
S43: if the energy of described child node is less than described node average energy in described bunch, child node is energy weak tendency node in described bunch, if the energy of described child node is greater than described node average energy in described bunch, child node is described energy advantage node in described bunch, as described puppet bunch head.
Further, described step S5 further comprises:
S51: aggregation node sends reverse routing diffusion start message, initiates upper strata plane Route establishment;
S52: aggregation node one is jumped with intra-cluster head and pseudo-leader cluster node and received the described start message that aggregation node sends, preserves self routing iinformation and forwards routing diffusion message;
S53: when bunch head and pseudo-leader cluster node carry out routing diffusion message repeating, in all self routing iinformation being joined message;
S54: if bunch head and pseudo-leader cluster node are successively received many routing diffusion messages, the routed path of selecting paths energetic optimum preservation forward;
S55: all bunches of heads and a pseudo-bunch head add described upper strata plane road by, and routing table is reported to described aggregation node step by step.
Further, described step S7 further comprises:
S71: described bunch of head calculates the initial average energy of described node according to the described bunch of interior nodes energy information of collecting in election process;
S72: described bunch of head with the initial average energy of bunch interior nodes for approaching target;
S73: often take turns data acquisition and finish, all bunches of heads judge self current energy approaches target described in whether being greater than;
S74: if any one bunch dump energy is approached target described in being not more than, send a described bunch great wheel to described aggregation node and change message.
Select optimization method by adopting the disclosed a kind of farmland of the present invention wireless self-organized network topology density associated path, according to zones of different node topology density difference, adopt netted, bunch mixing routing mode that (star) shape structure combines, data transfer path is in optimized selection, guarantee the connection access of network node, reduce the performance of routing algorithm, energy consumption expense, taking node energy consumption as constraint, efficiently, solve accurately the equilibrium problem between network performance and energy consumption, simultaneously, solve prior art algorithm expense large, cluster agreement cannot ensure Connectivity, the problems such as plane routing protocol packet storm, adopt the associated cluster of node density, complete cluster according to node distribution situation, improve cluster efficiency, adopt energy to approach the mode that bunch great wheel is changed, reduce bunch head and select number of times, improve network entirety efficiency.
Brief description of the drawings
Can more clearly understand the features and advantages of the present invention by reference to accompanying drawing, accompanying drawing is schematically to should not be construed as the present invention is carried out to any restriction, in the accompanying drawings:
Fig. 1 shows the flow chart of steps of a kind of farmland wireless self-organized network topology density associated path selection optimization method in the embodiment of the present invention;
Fig. 2 shows the energy consumption calculation dynamic clustering flow chart of steps of the topological density association in the embodiment of the present invention;
Fig. 3 shows directional diffusion plane road in the invention process by method step flow chart;
A kind of farmland wireless self-organized network topology node density associated path that Fig. 4 shows in the embodiment of the present invention is selected optimization method schematic diagram.
Embodiment
Below in conjunction with accompanying drawing, embodiments of the present invention is described in detail.
As shown in Figure 1, the invention provides a kind of farmland wireless self-organized network topology density associated path and select optimization method, comprise concrete following steps:
Step S1: computing node energy is voted, determines bunch head.Wherein, node basis completes the different resting states that successively enter of order that networking collection is uploaded.
Particularly, all nodes start to carry out election of cluster head simultaneously, choose dump energy soprano vote by residue energy of node height in neighbor node, and number of votes obtained is carried out topological Density Weighted by each node, and the final maximum node of poll becomes a bunch head.Week mid-side node selection can reach a bunch head and add this bunch, also comprises approximant bunch of great wheel system of changing planes of energy in this process.
Further, in the wireless self-organization network application of extensive farmland, there is the problems such as network size is large, node skewness, overall monitoring time is long, acquisition interval is large, channel condition is responsible, energy constraint is strict, be different from wireless Ad Hoc tradition research, how to meet large scale network the more basic collection type under complex environment can require balance between limited energy consumption to become the research emphasis of farmland wireless self-organization network Routing Protocol.
Further, step S1 further comprises:
Step S11 a: node in arbitrary node is carried out to self-energy calculating operation, obtain the transmitting power after residue energy of node information, topological power control.
Step S12: with transmitting power to topological neighbor node sending node information.Wherein, nodal information comprises node node ID, residue energy of node and all the other node attribute information except this node.
Step S13: node is according to the nodal information of receiving topological neighbor node feedback, relatively the dump energy information of neighbor node.
Step S14: choose the neighbor node that dump energy is the highest, send ballot message to it.
Step S15: according to the election weight of the energy grade computing node of the topological density index of node region and node,
Computing formula is:
Wherein, node i records topological neighbours' quantity, as node topology density index, is designated as node degree ND
i; Node i receives after the ballot message that neighbor node sends, and cumulatively show that aggregate votes are as node energy grade V
i.
Step S16: node is to neighbor node broadcast self election weight.
Step S17: if the franchise of certain node is great in the election weight of its all neighbor nodes, this node becomes bunch head and broadcasts cluster message.
Step S11-step S17 also has following characteristics, for fear of occurring that certain Area Node density is too high, and cause bunch head situation that over-burden, a bunch supported maximum node number is set to restriction, if exceed this maximum constraints, no longer receiving node adds, and bunch head preferentially receives apart from self nearer, and the node that received signal strength is large carries out cluster.Finally all nodes of failing to add bunch, are called relative isolated node, enter and mix the route construction stage.A bunch supported maximum node quantity is according to the distance between itself and aggregation node, and jumping figure determines, mixes after route construction completing, by from aggregation node, bunch interior nodes quantity close to adjusts accordingly.
Further, also comprise after step S17: receive a bunch cluster message for head broadcast when node, select a bunch of head by preset rules, transmission feedback message also adds bunch, and bunch head is according to feedback message compute cluster interior nodes average energy.
Step S2: the node that bunch head receives in predetermined threshold value adds, and carries out cluster operation.
Step S3: child node in becoming bunch by method for predicting for the node that does not complete cluster operation.
Particularly, for the node that does not complete cluster operation with planar diffusion routing mode search network access point, and become access point place bunch bunch in child node.
Step S4: bunch in choose energy advantage node in child node as pseudo-bunch head.
Further, step S4 further comprises:
Step S41: obtain a bunch interior nodes average energy.
Step S42: judge the energy of child node and the size of its access bunch interior nodes average energy.
Step S43: if the energy of child node is less than a bunch interior nodes average energy, bunch in child node be energy weak tendency node, if the energy of child node is greater than a bunch interior nodes average energy, bunch in child node be energy advantage node, as pseudo-bunch head.
Particularly, all relative isolated nodes, send planar diffusion route message, select adjacent node to add, and become the child node of this bunch, if there is heterogeneous neighbor node simultaneously, preferentially select the node that franchise is great; . isolated node becomes the child node of certain bunch by hinged node relatively, obtain this bunch of interior nodes average energy, judge it self is energy state, if be less than a bunch interior nodes average energy, be energy weak tendency node, keep child node state constant, if be greater than a bunch interior nodes average energy, be energy advantage node, become " pseudo-bunch head ", with bunch first same upper strata plane route construction of carrying out.
Further, all nodes carry out environment information acquisition, and now, all puppets bunch head is all considered as a bunch head, carry out upper strata plane road by networking with aggregation node.In cluster process, all nodes are operated in general mode, and its communication radius is the adjustment result after topology is controlled, and is greater than between the maximum communication radius and minimal communications radius under general mode; The upper strata trunk plane route network being made up of bunch head and pseudo-leader cluster node is operated in enhancement mode, leader cluster node communication radius is generally 3-5 times of general mode maximum communication radius, distribute relevant with node hardware designs and node deployment, concrete numerical value and main contents of the present invention are irrelevant, can ensure in the present invention proper communication between adjacent cluster head, in planar diffusion route link, a jumping scope is calculated to increase communication radius.
Step S5: carry out diffuse in reverse direction networking according to bunch head and pseudo-bunch head.
Further, step S5 further comprises:
Step S51: aggregation node sends reverse routing diffusion start message, initiates upper strata plane Route establishment.
Step S52: aggregation node one is jumped with intra-cluster head and pseudo-leader cluster node and received the start message that aggregation node sends, preserves self routing iinformation and forwards routing diffusion message.Step S53: when bunch head and pseudo-leader cluster node carry out routing diffusion message repeating, in all self routing iinformation being joined message.
Step S54: if bunch head and pseudo-leader cluster node are successively received many routing diffusion messages, the routed path of selecting paths energetic optimum maintenance forward.Distinguishingly, the route message relay times of first receiving is few, energetic optimum.
Step S55: all bunches of heads and a pseudo-bunch head add upper strata plane road by, and routing table is reported to aggregation node step by step.
Particularly, broadcast reverse routing diffusion start message by aggregation node, initiate upper strata plane Route establishment; Aggregation node one is jumped with interior leader cluster node and is received after the Route establishment message of aggregation node initiation, preserves self routing iinformation, and forwards routing diffusion message, comprises the routing iinformation of this node in message; . all the other leader cluster nodes are received the routing diffusion message that other leader cluster nodes send, preserve routing iinformation, and in message, add self routing iinformation to continue to forward, if certain node is successively received many routing diffusion messages, the routed path of selecting paths energetic optimum, in general the route message of first receiving, the few energetic optimum of hop count; Repeat with cocycle, until all bunches of heads all add route.
Further, when completing after the plane Route establishment of upper strata, network route has been set up.Play data passback by a bunch hair and report, all nodes return the environmental parameter collecting to report.
Step S6: all nodes are carried out environment information acquisition and reported by network routing.
Step S7: judged whether that a bunch head reaches energy and approaches target.
Further, step S7 further comprises:
Step S71: bunch head is according to bunch initial average energy of interior nodes energy information computing node of collecting in election process.
Step S72: bunch head with the initial average energy of bunch interior nodes for approaching target.
Step S73: often take turns data acquisition and finish, all bunches of heads judge whether self current energy is greater than and approach target.
Step S74: approach target if any one bunch dump energy is not more than, send a bunch great wheel to aggregation node and change message.
Further, when certain node i is for the first time elected bunch time, try to achieve the initial average energy of node according to a bunch interior nodes energy information of collecting in election process, be designated as
a bunch i is with the initial average energy of node
for approaching target, every when taking turns data acquisition and finishing, all bunches of heads judge whether self current energy is greater than and approach target,
do not meet this condition if any any cluster head, send a bunch great wheel to aggregation node and change message, when next round collection starts, carry out a bunch great wheel and change election, as all nodes all meet this condition, keep when prevariety constant; Change election if carry out a bunch great wheel, undertaken by the cluster in the energy consumption calculation dynamic clustering stage of topological density association and election of cluster head method, after cluster completes, jump to the process continuation bunch energy starting most and approach.
Step S8: approach target if exist a bunch head to reach energy, mark next round is carried out election of cluster head, finishes epicycle collection, approaches target if do not exist a bunch head to reach energy, and epicycle collection finishes.Be leader cluster node and aggregation node composition backbone network, carry out diffuse in reverse direction from top to bottom from aggregation node, send message by aggregation node, one jumps a bunch head receives after message, record self routing iinformation, and continue to E-Packet, until all leader cluster nodes add backbone route.
The present invention completes cluster according to node topology density distribution situation, improve cluster efficiency, adopt energy to approach the mode that bunch great wheel is changed, reduce bunch head and select number of times, improve network entirety efficiency, adopt the mixing routing mode of net bunch combination, solved the problems such as fringe node connectedness and message storm, improve overall performance of network and efficiency.
Select optimization method for the ease of understanding the farmland wireless self-organized network topology density associated path in the embodiment of the present invention with application, Fig. 2 and Fig. 3 respectively step of the step to the associated energy consumption calculation dynamic clustering of topological density and directional diffusion plane method for routing are elaborated.As shown in Figure 2, the energy consumption calculation dynamic clustering flow chart of steps of the topological density association in the embodiment of the present invention.
Particularly, step S21: node oneself energy consumption calculation broadcast energy information.
Step S22: receive contrast neighbor node energy and vote to the highest node of energy.
Step S23: collect ballot in conjunction with self node degree calculating election weight.
Step S24: to neighbor node broadcast weight information.
Step S25: whether decision node weight information is local weight limit.
Step S26: if node weights is local weight limit, this node becomes a bunch head, broadcast cluster message, otherwise wait for a reception bunch cluster message.
Step S27: receive ordinary node and add bunch.
Step S28: judge whether to receive cluster message.
Step S29: if receive cluster message, select a bunch of head and add by preset rules.
Step S30, if do not receive cluster message, becomes relative isolated node.
As shown in Figure 3, the directional diffusion plane road in the embodiment of the present invention is by method step flow chart.
Particularly, step S31: isolated node sends routing diffusion message relatively.
Step S32: selection can reach node and connect, if there are multiple nodes that reach to select weight high node.
Step S33: the node average energy of obtaining tie point place bunch.
Step S34: judge whether isolated node energy is greater than the average energy of node of access bunch.
Step S35: if isolated node energy is greater than the average energy of node of access bunch, energy advantage isolated node becomes pseudo-bunch head.
Step S36: if isolated node energy is not more than the average energy of node of access bunch, energy inferior position isolated node become bunch in child node.
Step S37: aggregation node sends diffuse in reverse direction route message.
Step S38: bunch head or pseudo-bunch of head judgement receive whether message routing jumping figure is less than self hop count.
Step S39: in message, hop count is less than self hop count if receive, receives that a message bunch head records self routing iinformation.
Step S40: in message, hop count is not less than self hop count if receive, ignores this message.
Step S41: add self route continuation forwarding in message.
Step S42: all bunches of heads and pseudo-bunch head all add plane road by after routing table is reported to aggregation node step by step.
As Fig. 4 illustrates, a kind of farmland wireless self-organized network topology node density associated path in the embodiment of the present invention is selected optimization method schematic diagram.
Particularly, for example: carry out self-energy calculating for arbitrary node i, obtain residue energy of node information RE
itransmitting power P(i after the control of topology power) to its topological neighbor node broadcast node message, in message, comprise the information such as node ID and residue energy of node of node i; Node i is received the broadcast that its topological neighbor node is sent, and the dump energy information of more all neighbor nodes is chosen the node j of dump energy maximum, sends ballot message to it; Node i records topological neighbours' quantity, as node topology density index, is designated as node degree ND
i; Node i receives after the ballot message that neighbor node sends, and cumulatively show that aggregate votes are as node energy grade V
i; In conjunction with node topology density index, computing node election weight.Computing formula is as follows:
Node i is to neighbor node broadcast election weight, if receive, the weight information of neighbor node is greater than self information, does not send self weight; The node of last broadcast election weight information, its election weight is the highest, becomes a bunch head, broadcast cluster message; All the other nodes are received after the cluster message of bunch head, send and add message, add this bunch, if node is received the cluster message of multiple bunches of heads, select bunch head that node degree is little to add.
A kind of farmland disclosed in this invention wireless self-organized network topology density associated path is selected optimization method, the advantage of integrated planar route and two kinds of routing modes of clustering routing, set up the mixing routing mode that forms net bunch combination, it is advantageous that, local cluster has greatly reduced the number of nodes in participation plane reticular route, avoid large scale network foundation, the expense of maintaining routing list and poor efficiency, net bunch mixed method can finely solve Clustering Algorithm and cannot ensure the problem of fringe node connectedness simultaneously, bunch head is added to the huge transmitting energy consumption of having avoided distant cluster head node directly to communicate by letter with aggregation node in plane reticular route.
Further, a kind of farmland disclosed by the invention wireless self-organized network topology density associated path is selected the associated cluster mechanism of the node topology density in optimization method, in the time that selecting, bunch head not only considers that node energy also will consider the node topology density of node region simultaneously, the region large node of topology density has higher priority to become a bunch head, gives full play to cluster route for the high advantage of clustered node efficiency; Also comprised approximant bunch of great wheel system of changing planes of a kind of energy simultaneously, after carrying out the selection of primary cluster head, continue to serve as a bunch brilliance look by this bunch of head, with select time bunch in average nodal energy for approaching target, when a bunch dump energy is less than or equal to while approaching target, bunch bunch head that head is no longer served as next one, re-starts bunch head and selects.The advantage of the method is to have avoided frequently bunch head to select, and has saved algorithm expense, although the energy consumption balance poor effect in the short time it seems for a long time, still kept good balancing energy effect.
Further, the mixing routing mode that the present invention proposes StarNet's combination adopts double layer design, upper strata adopts plane Routing Protocol, lower floor adopts cluster Routing Protocol, have complementary advantages, cluster a route to be valid has solved plane road by message storm in large scale network and the problem such as routing table maintenance expense is large, plane road has been solved cluster route and cannot have been ensured the problem of network connectivty by essence, wherein, it is the key of cluster route that bunch head is selected, the cluster mechanism of the topological density association that the present invention comprises, the large probability cluster of network node compact district node, efficiency is high, and lax district small probability cluster, in conjunction with adopting plane routing mode, can avoid cluster agreement maybe cannot realize the problem of network-in-dialing in the poor efficiency of node dispersion area, simultaneously, the approximant bunch of great wheel system of changing planes of energy also comprising in the present invention, reduce and carried out the round that bunch head is selected, bunch head is keeping constant in round continuously, also reduced upper strata plane road by frequent maintenance upgrade, reduce protocol overhead.
Select optimization method by adopting the disclosed a kind of farmland of the present invention wireless self-organized network topology density associated path, according to zones of different node topology density difference, adopt netted, bunch mixing routing mode that (star) shape structure combines, data transfer path is in optimized selection, guarantee the connection access of network node, reduce the performance of routing algorithm, energy consumption expense, taking node energy consumption as constraint, efficiently, solve accurately the equilibrium problem between network performance and energy consumption, simultaneously, solve prior art algorithm expense large, cluster agreement cannot ensure Connectivity, the problems such as plane routing protocol packet storm, adopt the associated cluster of node density, complete cluster according to node distribution situation, improve cluster efficiency, adopt energy to approach the mode that bunch great wheel is changed, reduce bunch head and select number of times, improve network entirety efficiency.
Although described by reference to the accompanying drawings embodiments of the present invention, but those skilled in the art can make various modifications and variations without departing from the spirit and scope of the present invention, such amendment and modification all fall into by within claims limited range.
Claims (9)
1. farmland wireless self-organized network topology density associated path is selected optimization method, it is characterized in that, comprises concrete following steps:
S1: computing node energy is voted, determines bunch head;
S2: the node in described bunch of head reception predetermined threshold value adds, and carries out cluster operation;
S3: child node in becoming bunch by presetting method for the node that does not complete the operation of described cluster;
S4: choose energy advantage node in child node as pseudo-bunch head in described bunch;
S5: carry out diffuse in reverse direction networking according to described bunch of head and described puppet bunch head;
S6: all nodes are carried out environment information acquisition and reported by network routing;
S7: judged whether that a bunch head reaches energy and approaches target;
S8: approach target if exist a bunch head to reach described energy, mark next round is carried out described election of cluster head, finishes epicycle collection, approaches target if do not exist a bunch head to reach described energy, and epicycle collection finishes.
2. the method for claim 1, is characterized in that, for the node that does not complete the operation of described cluster with planar diffusion routing mode search network access point, and become access point place bunch bunch in child node.
3. the method for claim 1, is characterized in that, described node basis completes the different resting states that successively enter of order that group network collection is uploaded.
4. the method for claim 1, is characterized in that, described step S1 further comprises:
S11: a described node in arbitrary node is carried out to self-energy calculating operation, obtain the transmitting power after described residue energy of node information, topological power control;
S12: send described nodal information to topological neighbor node with described transmitting power;
S13: described node is according to the nodal information of receiving described topological neighbor node feedback, relatively the dump energy information of neighbor node;
S14: choose the neighbor node that dump energy is the highest, send ballot message to it;
S15: the election weight according to the energy grade computing node of the topological density index of node region and node:
Computing formula is:
Wherein, node i records topological neighbours' quantity, as node topology density index, is designated as node degree ND
i; Node i receives after the ballot message that neighbor node sends, and cumulatively show that aggregate votes are as node energy grade V
i;
S16: node is to neighbor node broadcast self election weight;
S17: if the franchise of certain node is great in the election weight of its all neighbor nodes, this node becomes bunch head and broadcasts cluster message.
5. method as claimed in claim 4, is characterized in that, after described step S17, also comprises:
Receive the cluster message of described bunch of head broadcast when node, select a bunch of head by preset rules, send feedback message and add described bunch, bunch head is according to feedback message compute cluster interior nodes average energy.
6. method as claimed in claim 4, is characterized in that, described nodal information comprises node ID, residue energy of node and all the other node attribute information except this node.
7. the method for claim 1, is characterized in that, described step S4 further comprises:
S41: obtain described bunch interior nodes average energy;
S42: judge the energy of child node and the size of its access bunch interior nodes average energy;
S43: if the energy of described child node is less than described node average energy in described bunch, child node is energy weak tendency node in described bunch, if the energy of described child node is greater than described node average energy in described bunch, child node is described energy advantage node in described bunch, as described puppet bunch head.
8. the method for claim 1, is characterized in that, described step S5 further comprises:
S51: aggregation node sends reverse routing diffusion start message, initiates upper strata plane Route establishment;
S52: aggregation node one is jumped with intra-cluster head and pseudo-leader cluster node and received the described start message that aggregation node sends, preserves self routing iinformation and forwards routing diffusion message;
S53: when bunch head and pseudo-leader cluster node carry out routing diffusion message repeating, in all self routing iinformation being joined message;
S54: if bunch head and pseudo-leader cluster node are successively received many routing diffusion messages, the routed path of selecting paths energetic optimum preservation forward;
S55: all bunches of heads and a pseudo-bunch head add described upper strata plane road by, and routing table is reported to described aggregation node step by step.
9. the method for claim 1, is characterized in that, described step S7 further comprises:
S71: described bunch of head calculates the initial average energy of described node according to the described bunch of interior nodes energy information of collecting in election process;
S72: described bunch of head with the initial average energy of bunch interior nodes for approaching target;
S73: often take turns data acquisition and finish, all bunches of heads judge self current energy approaches target described in whether being greater than;
S74: if any one bunch dump energy is approached target described in being not more than, send a described bunch great wheel to described aggregation node and change message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410087797.3A CN103945484B (en) | 2014-03-11 | 2014-03-11 | Farmland wireless self-organized network topology density associated path selection optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410087797.3A CN103945484B (en) | 2014-03-11 | 2014-03-11 | Farmland wireless self-organized network topology density associated path selection optimization method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103945484A true CN103945484A (en) | 2014-07-23 |
| CN103945484B CN103945484B (en) | 2017-06-30 |
Family
ID=51192910
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410087797.3A Active CN103945484B (en) | 2014-03-11 | 2014-03-11 | Farmland wireless self-organized network topology density associated path selection optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103945484B (en) |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104469797A (en) * | 2014-11-28 | 2015-03-25 | 北京农业信息技术研究中心 | Method for generating sequence prediction on basis of farmland wireless network intra-cluster data sparsity |
| CN107294852A (en) * | 2017-07-01 | 2017-10-24 | 台州学院 | A kind of network route method using the scattered short path collection of topology |
| CN108024305A (en) * | 2016-09-26 | 2018-05-11 | 北京信威通信技术股份有限公司 | A kind of system of selection of centralized control node for self-organizing network |
| WO2018098759A1 (en) * | 2016-11-30 | 2018-06-07 | 深圳天珑无线科技有限公司 | Method for selecting cluster head in distributed network, node, and system |
| WO2018098749A1 (en) * | 2016-11-30 | 2018-06-07 | 深圳天珑无线科技有限公司 | Message broadcasting method in distributed network and node |
| WO2018098752A1 (en) * | 2016-11-30 | 2018-06-07 | 深圳天珑无线科技有限公司 | Message broadcast method for distributed network and node |
| WO2018098754A1 (en) * | 2016-11-30 | 2018-06-07 | 深圳天珑无线科技有限公司 | Cluster head selection method for distributed network, node and system |
| CN108344480A (en) * | 2018-01-25 | 2018-07-31 | 北京农业信息技术研究中心 | A kind of poultry automatic weighing method and system |
| CN109062272A (en) * | 2018-09-05 | 2018-12-21 | 佛山铮荣科技有限公司 | Rice irrigation intelligent observing and controlling system |
| US10425788B2 (en) | 2018-02-08 | 2019-09-24 | King Fahd University Of Petroleum And Minerals | Equal distance different members node placement method and system |
| CN110490266A (en) * | 2019-08-23 | 2019-11-22 | 北京邮电大学 | A kind of sensing data uploads, Transducer-fault Detecting Method and device |
| CN111654869A (en) * | 2020-05-13 | 2020-09-11 | 中铁二院工程集团有限责任公司 | Wireless network ad hoc network method |
| CN113556286A (en) * | 2021-05-31 | 2021-10-26 | 北京邮电大学 | Communication method and system of peer-to-peer network |
| CN112887947B (en) * | 2021-01-14 | 2021-12-03 | 南通大学 | Bluetooth Mesh clustering networking method for double-layer block chain |
| CN116740087A (en) * | 2023-05-31 | 2023-09-12 | 湖北工业大学 | Efficient search method and system for area segmentation for multi-phase system connectivity judgment |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101267391A (en) * | 2008-03-27 | 2008-09-17 | 上海交通大学 | Wireless sensor network topology control method based on non-uniform sections |
-
2014
- 2014-03-11 CN CN201410087797.3A patent/CN103945484B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101267391A (en) * | 2008-03-27 | 2008-09-17 | 上海交通大学 | Wireless sensor network topology control method based on non-uniform sections |
Non-Patent Citations (3)
| Title |
|---|
| 乔学工: "能量高效的无线传感器网络分簇路由算法研究", 《太原理工大学博士学位论文》 * |
| 傅菊平等: "基于剩余能量和节点度的无线传感器网络分簇算法", 《计算机应用研究》 * |
| 梁小宇: "一种基于分簇的优化定向扩散路由协议", 《武汉理工大学学报》 * |
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104469797B (en) * | 2014-11-28 | 2017-12-05 | 北京农业信息技术研究中心 | Sparse base generation method in the farmland wireless network cluster of sequence prediction |
| CN104469797A (en) * | 2014-11-28 | 2015-03-25 | 北京农业信息技术研究中心 | Method for generating sequence prediction on basis of farmland wireless network intra-cluster data sparsity |
| CN108024305A (en) * | 2016-09-26 | 2018-05-11 | 北京信威通信技术股份有限公司 | A kind of system of selection of centralized control node for self-organizing network |
| WO2018098759A1 (en) * | 2016-11-30 | 2018-06-07 | 深圳天珑无线科技有限公司 | Method for selecting cluster head in distributed network, node, and system |
| WO2018098749A1 (en) * | 2016-11-30 | 2018-06-07 | 深圳天珑无线科技有限公司 | Message broadcasting method in distributed network and node |
| WO2018098752A1 (en) * | 2016-11-30 | 2018-06-07 | 深圳天珑无线科技有限公司 | Message broadcast method for distributed network and node |
| WO2018098754A1 (en) * | 2016-11-30 | 2018-06-07 | 深圳天珑无线科技有限公司 | Cluster head selection method for distributed network, node and system |
| CN107294852B (en) * | 2017-07-01 | 2019-12-27 | 台州学院 | Network routing method using topology dispersed short path set |
| CN107294852A (en) * | 2017-07-01 | 2017-10-24 | 台州学院 | A kind of network route method using the scattered short path collection of topology |
| CN108344480A (en) * | 2018-01-25 | 2018-07-31 | 北京农业信息技术研究中心 | A kind of poultry automatic weighing method and system |
| CN108344480B (en) * | 2018-01-25 | 2023-12-22 | 北京农业信息技术研究中心 | Automatic weighing method and system for poultry |
| US10425788B2 (en) | 2018-02-08 | 2019-09-24 | King Fahd University Of Petroleum And Minerals | Equal distance different members node placement method and system |
| US10602328B2 (en) | 2018-02-08 | 2020-03-24 | King Fahd University Of Petroleum And Minerals | Rotating clusterhead wireless network for pipeline monitoring |
| US10602327B2 (en) | 2018-02-08 | 2020-03-24 | King Fahd University Of Petroleum And Minerals | Method for power consumption reduction in a wireless linear network |
| CN109062272A (en) * | 2018-09-05 | 2018-12-21 | 佛山铮荣科技有限公司 | Rice irrigation intelligent observing and controlling system |
| CN110490266A (en) * | 2019-08-23 | 2019-11-22 | 北京邮电大学 | A kind of sensing data uploads, Transducer-fault Detecting Method and device |
| CN111654869A (en) * | 2020-05-13 | 2020-09-11 | 中铁二院工程集团有限责任公司 | Wireless network ad hoc network method |
| CN111654869B (en) * | 2020-05-13 | 2022-07-29 | 中铁二院工程集团有限责任公司 | Wireless network ad hoc network method |
| CN112887947B (en) * | 2021-01-14 | 2021-12-03 | 南通大学 | Bluetooth Mesh clustering networking method for double-layer block chain |
| CN113556286A (en) * | 2021-05-31 | 2021-10-26 | 北京邮电大学 | Communication method and system of peer-to-peer network |
| CN116740087A (en) * | 2023-05-31 | 2023-09-12 | 湖北工业大学 | Efficient search method and system for area segmentation for multi-phase system connectivity judgment |
| CN116740087B (en) * | 2023-05-31 | 2024-05-24 | 湖北工业大学 | Efficient search method and system for area segmentation for multi-phase system connectivity judgment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103945484B (en) | 2017-06-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103945484A (en) | Farmland wireless self-organizing network topology density correlation path selecting and optimizing method | |
| Gajjar et al. | FAMACROW: Fuzzy and ant colony optimization based combined mac, routing, and unequal clustering cross-layer protocol for wireless sensor networks | |
| CN100591029C (en) | Multi-jump wireless self-organizing network construction method based on partition tree | |
| Li et al. | Adaptive quality-of-service-based routing for vehicular ad hoc networks with ant colony optimization | |
| CN101415248B (en) | Method for establishing layer-striding dynamic source route protocol based on load balance | |
| CN101969396B (en) | Time delay and bandwidth resource-based relay selection method | |
| CN101394321B (en) | Non-uniform clustering method for cluster wireless sensor network based on energy balance | |
| CN106454905B (en) | A kind of improved wireless sense network hierarchical multichain path method | |
| CN100442786C (en) | Tree structure based routing method | |
| CN106131912B (en) | The mobile Sink method of data capture of wireless sensor network based on tree-shaped cluster | |
| CN102264114B (en) | ZigBee sensor network tree route low-expense optimization method | |
| CN1984020A (en) | Method and device for transmitting data | |
| CN104540173A (en) | Wireless sensor network mobile data collecting method based on arborescence cluster structure | |
| CN104053175A (en) | Internet of Things sensing layer topology control method | |
| CN101711048A (en) | Method for choosing gateway in integrating process of mobile self-organization network and Internet | |
| CN100512226C (en) | Method for forming fine convergence gradient in sensor network | |
| CN103108374B (en) | A kind of energy-saving routing algorithm of mixed structure mine emergency management and rescue wireless mesh network | |
| CN110324877A (en) | Relaying robot method for routing based on servo backbone network Yu Vikor multi-standard decision | |
| CN107404745A (en) | A kind of fire detector remote detecting system based on MANET | |
| CN103415055A (en) | Wireless sensor network coordinator re-selection algorithm based on assistance of cellular network | |
| CN102695212B (en) | Method for balancing loads of ad-hoc network gateways | |
| Attia et al. | Advanced greedy hybrid bio-inspired routing protocol to improve IoV | |
| CN102984781A (en) | Neighbor node judgment method for wireless ad hoc network route | |
| CN103237331B (en) | Path selection method for multi-hop cellular network of fixed relay | |
| CN108834100A (en) | A kind of efficient broadcast routing method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: 1107, block a, Nongke building, No. 11, Shuguang garden middle road, Haidian District, Beijing, 100097 Patentee after: Information technology research center of Beijing Academy of agricultural and Forestry Sciences Address before: 100097 318b, block a, agricultural science building, 11 Shuguang Huayuan Middle Road, Haidian District, Beijing Patentee before: BEIJING RESEARCH CENTER FOR INFORMATION TECHNOLOGY IN AGRICULTURE |