CN103945484B - Farmland wireless self-organized network topology density associated path selection optimization method - Google Patents
Farmland wireless self-organized network topology density associated path selection optimization method Download PDFInfo
- Publication number
- CN103945484B CN103945484B CN201410087797.3A CN201410087797A CN103945484B CN 103945484 B CN103945484 B CN 103945484B CN 201410087797 A CN201410087797 A CN 201410087797A CN 103945484 B CN103945484 B CN 103945484B
- Authority
- CN
- China
- Prior art keywords
- node
- cluster
- energy
- cluster head
- message
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- 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 present invention relates to a kind of farmland wireless self-organized network topology density associated path selection optimization method, including：S1：Calculate node energy is voted, and determines cluster head；S2：The node that cluster head is received in predetermined threshold value is added, and carries out cluster operation；S3：The node operated for not completing cluster presses presetting method as child node in cluster；S4：Energy advantage node is chosen in child node in cluster as pseudo- cluster head；S5：Networking is reversely spread with pseudo- cluster head according to cluster head；S6：All nodes are carried out environment information acquisition and are reported by network routing；S7：Determine whether that cluster head reaches energy and approaches target；S8：Target is approached if there is cluster head and reach energy, mark next round carries out election of cluster head, terminates epicycle collection, if reaching energy in the absence of cluster head approaches target, epicycle collection terminates.The present invention improves cluster efficiency, reduces cluster head selection number of times, improves network entirety efficiency.
Description
Technical field
The present invention relates to technical field of electronic communication, more particularly to a kind of association of farmland wireless self-organized network topology density
Path selection optimization method.
Background technology
Routing Protocol is the core technology of wireless self-organization network Internet, and traditional wireless self-organization network is based on carrying
High quality-of-service (Quality of Service, QoS) and network fairness aspect propose many agreements and improved method, this
The emphasis of a little agreement researchs is mainly reduction end-to-end delay, avoids channel congestion, increase network utilization, reduce and average energy
Consumption etc..
Find by literature search, self-organizing network routing algorithm can be divided mainly into plane Routing Protocol and be assisted with hierarchy routing
View.Flood routing agreement is most a kind of traditional plane Routing Protocol, and source node is middle to all neighbor node broadcast data packets
Node to be received continue after packet and forwards packet with the forms of broadcasting, until data are diffused into up to destination node, for it is wireless from
For tissue network, the formula that floods route is simple, easily realization, without carrying out the foundation of network topological information and safeguarding, does not also count
The calculating calculated the optimal routed path of selection and bring and energy consumption；Its shortcoming is also it will be apparent that substantial amounts of data are overlapping, to converge
Node can receive many parts of data from same node, and propagate this number according to the huge waste that will cause network communications capability,
Network integrated communication inefficiency, while because mass data forwarding brings huge energy to consume, node energy consumption equalization problem is more
Cannot ensure.To solve this problem, researcher proposes the plane Routing Protocol of series of optimum.Perkins CE etc. are proposed
AODV Routing Protocols, by source node broadcasts by request message RREQ, receive node checks itself routing table of the message, if
There is effective routing and then reply message RREP.The method for routing foundation of AODV agreements is relatively simple, in solving the agreement that floods
Data overlap problem, also have stronger adaptability to the change of network topology structure, but it is the disadvantage is that, route establishment process is deposited
In blindness broadcast issue, process expense being set up greatly, and easily producing the problem of message storm, route building efficiency is low, does not examine
Consider node load situation, congestion is easily produced at critical path and node, each node is both needed to protect route link information
Deposit, safeguard, energy consumption expense is big.Hierarchical routing algorithm is main based on clustering route protocol, and LEACH is by Heinzelman et al.
The self adaptation cluster Routing Protocol of proposition, its cluster thought is through in most clustering route protocols thereafter.LEACH is calculated
In method, all nodes turn into cluster head by a certain Probability p, and the node broadcasts message as cluster head completes level route construction.Due to
LEACH algorithm cluster head random-selection nodes, so the easily death of accelerating part low energy node, shortens overall network existence week
Phase, its innovatory algorithm such as LEACH-C, DEEC, CHCS etc. are carrying out introducing node energy when cluster head is selected, remaining according to node
Energy height chooses cluster head, and the additional energy for forwarding cluster head is uniformly distributed between high-energy node, but due to still using LEACH cores
Heart cluster thought, so algorithm above has following point, 1. cluster head quantity is different according to algorithm difference, in practical application most
Good cluster head quantity is difficult to determine that 2. distributed cluster head selection algorithm easily causes cluster head skewness, centralized cluster head selection algorithm
Aggregation node is needed frequently to obtain all nodal informations, the big 3. cluster head of algorithm expense and aggregation node direct communication, and farmland is certainly
Tissue network coverage is big, huge apart from aggregation node leader cluster node communication energy consumption farther out or cannot realize and converge section
The direct communication of point.Patent of invention " wireless sensor network diffusion routing algorithm based on connection "（Notification number：
CN101902795A）There is provided a kind of diffusion routing algorithm of energy consumption balance, node each preserves link information, is believed according to connection
Breath finds the next-hop node address of routed path, and all nodes are carried out successively, until data successfully arrive at destination node, while
Consider that energy is balanced between the node of computing resource during path is selected, the method solve only in plane Routing Protocol
The uneven problem of energy consumption, other problemses are still present.A kind of patent of invention " wireless sensor network route based on energy ezpenditure
Optimized algorithm "（Notification number：102802175A）, " a kind of routing algorithm for wireless sensor of energy efficient "（Notification number：
102802230A）A kind of plane road based on energy optimization is each provided by the algorithm optimization with hierarchy routing, but simply pin
Energy optimization is carried out to prior art, and does not solve otherwise problem, practicality is not high.
Existing plane Routing Protocol is in order to avoid data overlap in Flood routing agreement, and inefficiency problem is general to use
The routed path system of selection of distributed or centralization, but the method needs the arbitrary node on path to safeguard on the path of place
Whole node routing informations, for key position node, may in storage and maintenance network most of node routing iinformation,
As network size increases, it is added significantly to node and calculates storage resource and energy consumption expense.In addition under the conditions of large scale network
Distributed diffusion routing algorithm the Route establishment phase also there are problems that blindly broadcast and message, Route establishment convergence slowly,
Efficiency is low；The Routing Protocol of centralization needs the frequent collector node information of aggregation node, and algorithm communication overhead is big, and for network
The situation of structure change needs the overall situation to readjust, and very flexible, efficiency are low, waste is big.It is minimum based on minimum hop count or path
The plane Routing Protocol of energy, easily causes that critical path node tasks are heavy, the problem of energy consumption rapidly.
For the hierarchical routing based on cluster algorithm, energy consumption balance routing algorithm causes node by different modes
Cluster head is served as in turn, so that cluster head additional energy is average between node, its major defect is that cannot ensure that all nodes are equal
Access network, particularly with the relative isolated node that only there is connection with some or a few node in network topology,
If connected node does not turn into cluster head, the node also cannot set up communication connection and turn into actual isolated section with cluster head
Point.Selection in the prior art to cluster head is more based on energy constraint, it is not intended that node location is distributed, easily causes cluster head point
Cloth is uneven, and produces more isolated nodes or even cause networking to fail.In the research of existing clustering route protocol, it is considered that
Cluster head and aggregation node are direct communications, and each cluster head is equal with aggregation node communication power consumption, actual due to nodal distance
The distance of aggregation node is each unequal, and bigger emitted energy is needed at a distance of aggregation node cluster head farther out, so power consumption is equal
Hypothesis it is obviously invalid, for extensive farmland self-organizing network application, because overlay area is big, cluster head is saved with converging
Common batteries node is possibly even reached between point to be beyond one's reach single-hop communication distance.Cluster head selection based on energy weight,
Need to collect cluster interior nodes information in every wheel, some algorithm is also needed to calculate the average nodal energy in the whole network or cluster, and algorithm is opened
Pin is larger.In the prior art, cluster head needs the number of nodes difference of burden, and burden is different to cause network energy consumption unbalanced, this
The computing resource of exterior node leader cluster node is limited, if cluster interior nodes quantity is excessive, will also result in the congestion of communication in cluster, reduces logical
Letter efficiency.The cluster head system of selection of prior art uploads interval and is divided into " wheel " by information gathering, and node energy is carried out when often wheel starts
How much the collection of amount state, after exchanging energy information, election of cluster head is carried out according to dump energy, and election process is complicated, communication meter
Calculate expense big, increased the average energy consumption of node, and cluster head may in turn be served as in many rounds by certain or certain several nodes,
Cause unnecessary waste.
The content of the invention
The technical problems to be solved by the invention are the basic collections for how meeting large scale network under complex environment
Can require and 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 selection optimization side
Method, including specific following steps：
S1：Calculate node energy is voted, and determines cluster head；
S2：The node that the cluster head is received in predetermined threshold value is added, and carries out cluster operation；
S3：The node operated for not completing the cluster presses presetting method as child node in cluster；
S4：Energy advantage node is chosen in child node in the cluster as pseudo- cluster head；
S5：Networking is reversely spread with the pseudo- cluster head according to the cluster head；
S6：All nodes are carried out environment information acquisition and are reported by network routing；
S7：Determine whether that cluster head reaches energy and approaches target；
S8：Target is approached if there is cluster head and reach the energy, mark next round carries out the election of cluster head, terminates this
Wheel collection, if reaching the energy in the absence of cluster head approaches target, epicycle collection terminates.
Specifically, the node for being operated for not completing the cluster searches for Network Access Point with planar diffusion routing mode,
And child node in the cluster as cluster where access point.
Specifically, the node enters resting state according to the different priorities of order that the collection of complete grouped network is uploaded.
Further, the step S1 is further included：
S11：A node in arbitrary node carries out self energy balane operation, obtains the node residual energy
Transmission power after amount information, topology power control；
S12：The nodal information is sent to topological neighbor node with the transmission power；
S13：The node compares the residue of neighbor node according to the nodal information that the topological neighbor node feeds back is received
Energy information；
S14：Dump energy highest neighbor node is chosen, message of voting is sent to；
S15：The franchise of the energy grade calculate node of topological density index and node according to node region
Weight：
Computing formula is：
Wherein, the topological neighbours' quantity of node i record, as node topology density index, is designated as node degree NDi；Node i is received
It is cumulative to draw aggregate votes as node energy grade V after the ballot message sent to neighbor nodei；
S16：Node broadcasts itself election weight to neighbor node；
S17：If the great election weight in its all neighbor node of the franchise of certain node, the node turns into cluster head simultaneously
Broadcast cluster message.
Further, also include after the step S17：
When node receives the cluster message of the cluster head broadcast, a cluster head is selected by preset rules, send feedback message
And the cluster is added, cluster head calculates cluster interior nodes average energy according to feedback message.
Specifically, remaining node category of the nodal information comprising node ID, residue energy of node and in addition to this node
Property information.
Further, the step S4 is further included：
S41：Obtain the cluster interior nodes average energy；
S42：Judge that the energy of child node accesses the size of cluster interior nodes average energy with it；
S43：If less than the node average energy in the cluster, child node is the energy of the child node in the cluster
Energy weak tendency node, if the energy of the child node is more than the node average energy, child node in the cluster in the cluster
It is the energy advantage node, as the pseudo- cluster head.
Further, the step S5 is further included：
S51：Aggregation node sends reverse route diffusion start message, initiates upper strata plane Route establishment；
S52：Cluster head receives the start message that aggregation node sends with pseudo- leader cluster node within aggregation node one is jumped,
Preserve itself routing iinformation and forward routing diffusion message；
S53：When cluster head carries out the forwarding of routing diffusion message with pseudo- leader cluster node, itself routing iinformation is joined message
In；
S54：If cluster head successively receives a plurality of routing diffusion message, the optimal road of selection path energy with pseudo- leader cluster node
By path and preserve forwarding；
S55：All cluster heads and pseudo- cluster head add the upper strata plane road by and routing table to be reported to the convergence step by step
Node.
Further, the step S7 is further included：
S71：It is initial that the cluster head calculates the node according to the cluster interior nodes energy information collected in election process
Average energy；
S72：The cluster head is with the initial average energy of cluster interior nodes to approach target；
S73：Often wheel data acquisition terminates, and all cluster heads judge whether itself present energy approaches target more than described；
S74：If any one cluster head dump energy approaches target described in being not more than, send described to the aggregation node
Cluster head rotation message.
Optimization side is selected by using a kind of presently disclosed farmland wireless self-organized network topology density associated path
Method, it is different according to different zones node topology density, using netted, cluster（Star）The mixed logic dynamic mode that shape structure is combined is right
Data transfer path is in optimized selection, it is ensured that the connection of network node is accessed, and reduces performance, the energy consumption expense of routing algorithm,
It is constraint with node energy consumption, efficiently, accurately solves the equilibrium problem between network performance and energy consumption, meanwhile, solve existing
Technique algorithm expense is big, the problems such as cluster agreement cannot ensure Connectivity, plane routing protocol packet storm, using node
Density associates cluster, and cluster is completed according to Node distribution situation, improves cluster efficiency, and the side of cluster head rotation is approached using energy
Formula, reduces cluster head selection number of times, improves network entirety efficiency.
Brief description of the drawings
The features and advantages of the present invention can be more clearly understood from by reference to accompanying drawing, accompanying drawing is schematical without that should manage
Solution is to carry out any limitation to the present invention, in the accompanying drawings：
Fig. 1 shows that a kind of farmland wireless self-organized network topology density associated path selection in the embodiment of the present invention is excellent
The step of change method flow chart；
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 the directional diffusion plane road in implementing of the invention by method and step flow chart；
Fig. 4 shows a kind of farmland wireless self-organized network topology node density associated path choosing in the embodiment of the present invention
Preferentially change method schematic diagram.
Specific embodiment
Below in conjunction with accompanying drawing, embodiments of the present invention is described in detail.
As shown in figure 1, optimizing the invention provides a kind of selection of farmland wireless self-organized network topology density associated path
Method, including specific following steps：
Step S1：Calculate node energy is voted, and determines cluster head.Wherein, node gathers what is uploaded according to networking is completed
Order is different successively to enter resting state.
Specifically, all nodes are started simultaneously at carries out election of cluster head, is selected in neighbor node by residue energy of node height
Take dump energy soprano to be voted, number of votes obtained is carried out topological Density Weighted, the most node of final poll by each node
As cluster head.All mid-side node selections add the cluster up to cluster head, and the approximant cluster head rotation mechanism of energy is also included during being somebody's turn to do.
Further, have that network size is big, Node distribution is uneven, total in extensive farmland wireless self-organization network application
The problems such as body monitoring time is long, acquisition interval is big, channel condition is responsible, energy constraint is strict, is different from wireless Ad Hoc tradition
How research, meet that basic collection type of the large scale network again under complex environment can be required and the balance between limited energy consumption turns into
The research emphasis of farmland wireless self-organization network Routing Protocol.
Further, step S1 is further included：
Step S11：A node in arbitrary node carries out self energy balane operation, obtains residue energy of node letter
Transmission power after breath, topology power control.
Step S12：With transmission power to topological neighbor node sending node information.Wherein, nodal information includes node
Node ID, residue energy of node and remaining node attribute information in addition to this node.
Step S13：Node compares the dump energy of neighbor node according to the nodal information that topological neighbor node feeds back is received
Information.
Step S14：Dump energy highest neighbor node is chosen, message of voting is sent to.
Step S15：The choosing of the energy grade calculate node of topological density index and node according to node region
Lift weight,
Computing formula is：
Wherein, the topological neighbours' quantity of node i record, as node topology density index, is designated as node degree NDi；Node i is received
It is cumulative to draw aggregate votes as node energy grade V after the ballot message sent to neighbor nodei。
Step S16：Node broadcasts itself election weight to neighbor node.
Step S17：If the great election weight in its all neighbor node of the franchise of certain node, the node turns into cluster
Head simultaneously broadcasts cluster message.
Step S11- steps S17 also has following characteristics, too high in order to avoid there is certain Area Node density, and causes cluster head
The situation that over-burden, to the supported maximum node number setting limitation of cluster head, if beyond maximum limitation, no longer receiving section
Point is added, and cluster head preferential receipt is nearer away from itself, i.e. the big node of received signal strength carries out cluster.It is finally all to fail to add
The node of cluster, referred to as with respect to isolated node, the stage is built into mixed logic dynamic.The supported maximum node quantity of cluster head is according to it
Distance between aggregation node, i.e. hop count are determined, after mixed logic dynamic structure is completed, by the cluster internal segment close to aggregation node
Point quantity is adjusted accordingly.
Further, also include after step S17：When node receives the cluster message of cluster head broadcast, by preset rules
One cluster head of selection, sends feedback message and adds cluster, and cluster head calculates cluster interior nodes average energy according to feedback message.
Step S2：The node that cluster head is received in predetermined threshold value is added, and carries out cluster operation.
Step S3：The node operated for not completing cluster presses method for predicting as child node in cluster.
Specifically, for not completing the node of cluster operation with planar diffusion routing mode search Network Access Point, and into
Child node in the cluster of cluster where access point.
Step S4：Energy advantage node is chosen in child node in cluster as pseudo- cluster head.
Further, step S4 is further included：
Step S41：Obtain cluster interior nodes average energy.
Step S42：Judge that the energy of child node accesses the size of cluster interior nodes average energy with it.
Step S43：If the energy of child node is less than cluster interior nodes average energy, child node is energy weak tendency section in cluster
Point, if the energy of child node is more than cluster interior nodes average energy, child node is energy advantage node in cluster, used as pseudo- cluster head.
Specifically, all relative isolated nodes, send planar diffusion route message, and selection adjacent node is added, as this
The child node of cluster, if there is multiphase neighbor node simultaneously, the great node of prioritizing selection franchise；Pass through with respect to isolated node
Hinged node turns into the child node of certain cluster, obtains the cluster interior nodes average energy, judges it itself is energy state, if less than in cluster
Node average energy, then be energy weak tendency node, keeps child status constant, if being more than cluster interior nodes average energy, for
Energy advantage node, as " pseudo- cluster head ", upper strata plane route construction is together carried out with cluster head.
Further, all nodes carry out environment information acquisition, and now, all pseudo- cluster heads are accordingly to be regarded as cluster head, are saved with converging
Point carries out upper strata plane road by networking.During cluster, all nodes are operated in general mode, and its communication radius is controlled for topology
Adjustment result afterwards, more than between the maximum communication radius and minimal communications radius under general mode；By cluster head and pseudo- cluster
The upper strata skeleton planes route network of head node composition is operated in enhancement mode, and leader cluster node communication radius are generally general mode
3-5 times of maximum communication radius, relevant with node hardware design and node deployment distribution, concrete numerical value is main with the present invention interior
Appearance is unrelated, and proper communication between adjacent cluster head is can guarantee that in the present invention, and link is route in planar diffusion, and one jumps scope to increase
Plus communication radius are calculated.
Step S5：Networking is reversely spread with pseudo- cluster head according to cluster head.
Further, step S5 is further included：
Step S51：Aggregation node sends reverse route diffusion start message, initiates upper strata plane Route establishment.
Step S52：Cluster head receives the start message that aggregation node sends with pseudo- leader cluster node within aggregation node one is jumped,
Preserve itself routing iinformation and forward routing diffusion message.Step S53：Cluster head carries out routing diffusion message and turns with pseudo- leader cluster node
During hair, during itself routing iinformation is joined message.
Step S54：If cluster head successively receives a plurality of routing diffusion message with pseudo- leader cluster node, selection path energy is optimal
Routed path and keep forwarding.Distinguishingly, the route message relay times for first receiving are few, then energetic optimum.
Step S55：All cluster heads and pseudo- cluster head add upper strata plane road by and routing table to be reported to convergence section step by step
Point.
Specifically, by aggregation node broadcast reverse route diffusion start message, upper strata plane Route establishment is initiated；Converge section
After leader cluster node receives the Route establishment message of aggregation node initiation within the jump of point one, itself routing iinformation is preserved, and forward
Routing diffusion message, the routing iinformation comprising the node in message；Remaining leader cluster node receives the road of other leader cluster nodes transmission
By diffusion message, preserve routing iinformation, and add itself routing iinformation to continue to forward in messages, if certain node successively receive it is many
Bar routing diffusion message, then select the optimal routed path of path energy, the route message in general first receiving, hop count
Few energetic optimum；Circulated more than repeating, until all cluster heads add route.
Further, after upper strata plane Route establishment is completed, network route is set up and is completed.Data are initiated by cluster head to return
Report is caught, the ambient parameter that all nodes will be collected carries out passback and reports.
Step S6：All nodes are carried out environment information acquisition and are reported by network routing.
Step S7：Determine whether that cluster head reaches energy and approaches target.
Further, step S7 is further included：
Step S71：Cluster head is according to the cluster interior nodes initial average energy of energy information calculate node collected in election process.
Step S72：Cluster head is with the initial average energy of cluster interior nodes to approach target.
Step S73：Often wheel data acquisition terminates, and all cluster heads judge whether itself present energy is more than and approach target.
Step S74：If any one cluster head dump energy is not more than is approached target, cluster head rotation is sent to aggregation node
Message.
Further, when certain node i first time is when cluster head is selected, according to the cluster interior nodes energy letter collected in election process
Breath tries to achieve the initial average energy of node, is designated asCluster head i is with the initial average energy of nodeTo approach target, data are often taken turns
At the end of collection, whether all cluster heads judge itself present energy more than target is approached, i.e.,If any any one cluster head
Condition is not satisfied, then send cluster head rotation message to aggregation node, and next round collection carries out cluster head rotation election when starting, such as
All nodes are satisfied by the condition, then keep current cluster head constant；If carrying out cluster head rotation election, associated by topological density
The cluster and election of cluster head method in energy consumption calculation dynamic clustering stage are carried out, and the process for most starting is jumped to after the completion of cluster and is continued
Cluster head energy is approached.
Step S8：Target is approached if there is cluster head and reach energy, mark next round carries out election of cluster head, terminates epicycle and adopts
Collection, if reaching energy in the absence of cluster head approaches target, epicycle collection terminates.I.e. leader cluster node constitutes backbone network with aggregation node
Network, is reversely spread from top to bottom from aggregation node, and message is sent by aggregation node, after a jump cluster head receives message, note
Itself routing iinformation is recorded, and continues to E-Packet, until all leader cluster nodes add backbone route.
The present invention completes cluster according to node topology Density Distribution situation, improves cluster efficiency, and cluster head is approached using energy
The mode of rotation, reduces cluster head selection number of times, improves network entirety efficiency, and the mixed logic dynamic mode combined using net cluster is solved
Fringe node it is connective with message storm the problems such as, improve overall performance of network and efficiency.
For the ease of understanding and the farmland wireless self-organized network topology density associated path in the application embodiment of the present invention
The step of selection optimization method, energy consumption calculation dynamic clustering that Fig. 2 is associated to topological density respectively with Fig. 3 and directional diffusion are flat
The step of face method for routing, is described in detail.As shown in Fig. 2 the energy consumption calculation of the topological density association in the embodiment of the present invention
Dynamic clustering flow chart of steps.
Specifically, step S21：Node self energy consumption calculation broadcast energy information.
Step S22：Receive contrast neighbor node energy and voted to energy highest node.
Step S23：Collect ballot and combine own node degree calculating election weight.
Step S24：Weight information is broadcasted to neighbor node.
Step S25：Whether decision node weight information is local maxima weight.
Step S26：If node weights are local maxima weight, the node turns into cluster head, broadcasts cluster message, otherwise etc.
Cluster head cluster message to be received.
Step S27：Receive ordinary node and add cluster.
Step S28：Judge whether to receive cluster message.
Step S29：If receiving cluster message, select a cluster head by preset rules and add.
Step S30, if not receiving cluster message, as relative isolated node.
As shown in figure 3, the directional diffusion plane road in the embodiment of the present invention is by method and step flow chart.
Specifically, step S31：Routing diffusion message is sent with respect to isolated node.
Step S32：Selection sets up connection up to node, and weight high node is selected if having multiple up to node.
Step S33：Obtain the node average energy of cluster where tie point.
Step S34：Judge whether isolated node energy is more than the average energy of the node for accessing cluster.
Step S35：If isolated node energy more than access cluster node average energy, energy advantage isolated node into
It is pseudo- cluster head.
Step S36：If isolated node energy is not more than the average energy of the node for accessing cluster, energy inferior position isolated node
As child node in cluster.
Step S37：Aggregation node sends reversely diffusion route message.
Step S38：Whether cluster head or pseudo- cluster head judge to receive message routing hop count less than itself hop count.
Step S39：If receiving hop count in message is less than itself hop count, receives message cluster head and record itself road
By information.
Step S40：If receiving hop count in message is not less than itself hop count, ignore the message.
Step S41：Itself route is added to continue to forward in message.
Step S42：All cluster heads add plane road that routing table is reported into aggregation node step by step after with pseudo- cluster head.
As Fig. 4 shows, a kind of farmland wireless self-organized network topology node density associated path in the embodiment of the present invention
Selection optimization method schematic diagram.
Specifically, for example：Self energy balane is carried out for arbitrary node i, residue energy of node information RE is obtainediTopology
Transmission power P after Power Control（i）To its topological neighbor node broadcast node message, the node ID comprising node i in message
With the information such as residue energy of node；Node i receives the broadcast message that its topological neighbor node is sent, relatively more all neighbor nodes
Dump energy information, chooses the maximum node j of dump energy, is sent to message of voting；The topological neighbours' quantity of node i record,
As node topology density index, node degree ND is designated asi；It is cumulative to draw after node i receives the ballot message that neighbor node is sent
Aggregate votes are used as node energy grade Vi；With reference to node topology density index, calculate node election weight.Computing formula is as follows：
Node i elects weight to neighbor node broadcast, if the weight information for receiving neighbor node is more than self information, no
Send itself weight；The node of last broadcast election weight information, its election weight highest, as cluster head, broadcasts cluster
Message；After remaining node receives the cluster message of cluster head, send and add message, the cluster is added, if node receives multiple cluster heads
Cluster message, then select the small cluster head of node degree to add.
A kind of farmland wireless self-organized network topology density associated path selection optimization method disclosed in this invention, it is integrated
Plane road by with two kinds of advantages of routing mode of clustering routing, foundation forms the mixed logic dynamic mode of net cluster combination, and its advantage exists
In, local cluster greatly reduce the number of nodes in participating in plane reticular route, it is to avoid large scale network foundation, safeguard road
By table expense with it is poorly efficient, while net cluster mixed method can very well solve Clustering Algorithm cannot ensure that fringe node is connective
Problem, the huge transmitting energy that distal end leader cluster node directly communicates with aggregation node is avoided during cluster head is added into plane reticular route
Consumption.
Further, a kind of farmland wireless self-organized network topology density associated path selection optimization side disclosed by the invention
Node topology density association clustering mechanism in method, not only considers node energy simultaneously it is also contemplated that node institute when cluster head is selected
In the node topology density in region, topology density big node in region has priority higher as cluster head, gives full play to
Cluster route the advantage for clustered node efficiency high；A kind of approximant cluster head rotation mechanism of energy is further comprises simultaneously, is being entered
After the selection of cluster head of row, cluster head role is persistently served as by the cluster head, average nodal energy is to approach in cluster during selecting
Target, when cluster head dump energy is less than or equal to target is approached, cluster head no longer serves as the cluster head of next one, re-starts cluster
Head selection.The advantage of the method in avoiding frequently cluster head selection, save algorithm expense, although the energy consumption in the short time
Portfolio effect is not good, but for a long time apparently, still maintains good balancing energy effect.
Further, the present invention proposes that the mixed logic dynamic mode that StarNet combines uses double layer design, and upper strata uses plane
Routing Protocol, lower floor uses cluster Routing Protocol, has complementary advantages, and cluster a route to be valid solves plane road by large scale network
The problems such as middle message storm and big routing table maintenance expense, and plane road solves cluster route and cannot ensure by then essence
The problem of network connectivty, wherein, cluster head selection be cluster route key, the present invention include topological density association into
Cluster mechanism, network node compact district node maximum probability cluster, efficiency high, and lax area's small probability cluster, with reference to using plane road
By mode, cluster agreement can be avoided in the poor efficiency of node dispersion area or the problem of network-in-dialing cannot be realized, meanwhile, the present invention
In the also included approximant cluster head rotation mechanism of energy, reduce the round for carrying out cluster head selection, cluster head is protected in continuous round
Hold constant, decrease upper strata plane road by frequent maintenance update, reduce protocol overhead.
Optimization side is selected by using a kind of presently disclosed farmland wireless self-organized network topology density associated path
Method, it is different according to different zones node topology density, using netted, cluster（Star）The mixed logic dynamic mode that shape structure is combined is right
Data transfer path is in optimized selection, it is ensured that the connection of network node is accessed, and reduces performance, the energy consumption expense of routing algorithm,
It is constraint with node energy consumption, efficiently, accurately solves the equilibrium problem between network performance and energy consumption, meanwhile, solve existing
Technique algorithm expense is big, the problems such as cluster agreement cannot ensure Connectivity, plane routing protocol packet storm, using node
Density associates cluster, and cluster is completed according to Node distribution situation, improves cluster efficiency, and the side of cluster head rotation is approached using energy
Formula, reduces cluster head selection number of times, improves network entirety efficiency.
Although being described in conjunction with the accompanying embodiments of the present invention, those skilled in the art can not depart from this hair
Various modifications and variations are made in the case of bright spirit and scope, such modification and modification are each fallen within by appended claims
Within limited range.
Claims (8)
1. farmland wireless self-organized network topology density associated path selects optimization method, it is characterised in that including specific following
Step：
S1：Calculate node energy is voted, and determines cluster head；
S2：The node that the cluster head is received in predetermined threshold value is added, and carries out cluster operation；
The predetermined threshold value includes：It is too high in order to avoid there is certain Area Node density, and the cluster head situation that over-burden is caused,
To the supported maximum node number setting limitation of cluster head, if beyond maximum limitation, no longer receiving node is added, and cluster head is preferential
Receive nearer away from itself, i.e. the big node of received signal strength carries out cluster；The supported maximum node quantity of cluster head is according to it
Distance between aggregation node, i.e. hop count are determined；
S3：The node operated for not completing the cluster presses presetting method as child node in cluster；
The presetting method includes：The node operated for not completing cluster searches for network insertion with planar diffusion routing mode
Child node in point, and the cluster as cluster where access point；
S4：Energy advantage node is chosen in child node in the cluster as pseudo- cluster head；
S5：Networking is reversely spread with the pseudo- cluster head according to the cluster head；
S6：All nodes are carried out environment information acquisition and are reported by network routing；
S7：Determine whether that cluster head reaches energy and approaches target；
S8：Target is approached if there is cluster head and reach the energy, mark next round carries out the election of cluster head, terminates epicycle and adopts
Collection, if reaching the energy in the absence of cluster head approaches target, epicycle collection terminates；
Wherein, step S1 is further included：
S11：A node in arbitrary node carries out self energy balane operation, obtains the residue energy of node letter
Transmission power after breath, topology power control；
S12：The nodal information is sent to topological neighbor node with the transmission power；
S13：The node compares the dump energy of neighbor node according to the nodal information that the topological neighbor node feeds back is received
Information；
S14：Dump energy highest neighbor node is chosen, message of voting is sent to；
S15：The election weight of the energy grade calculate node of topological density index and node according to node region：
Computing formula is：
Wherein, the topological neighbours' quantity of node i record, as node topology density index, is designated as node degree NDi；Node i receives neighbour
It is cumulative to draw aggregate votes as node energy grade V after occupying the ballot message that node is senti；
S16：Node broadcasts itself election weight to neighbor node；
S17：If the great election weight in its all neighbor node of the franchise of certain node, the node turns into cluster head and broadcasts
Cluster message.
2. the method for claim 1, it is characterised in that for not completing node that the cluster operates with planar diffusion
Routing mode searches for child node in Network Access Point, and the cluster as cluster where access point.
3. the method for claim 1, it is characterised in that the order that the node is uploaded according to the collection of complete grouped network is not
It is same successively to enter resting state.
4. the method for claim 1, it is characterised in that also include after the step S17：
When node receives the cluster message of the cluster head broadcast, a cluster head is selected by preset rules, send feedback message and add
Enter the cluster, cluster head calculates cluster interior nodes average energy according to feedback message；
The preset rules include：After node receives the cluster message of cluster head, send and add message, add the cluster, if node is received
To the cluster message of multiple cluster heads, then the small cluster head of node degree is selected to add.
5. the method for claim 1, it is characterised in that the nodal information comprising node ID, residue energy of node with
And remaining node attribute information in addition to this node.
6. the method for claim 1, it is characterised in that the step S4 is further included：
S41：Obtain the cluster interior nodes average energy；
S42：Judge that the energy of child node accesses the size of cluster interior nodes average energy with it；
S43：If the energy of the child node is less than the node average energy in the cluster, child node is energy in the cluster
Weak tendency node, if the energy of the child node is more than the node average energy in the cluster, child node is institute in the cluster
Energy advantage node is stated, as the pseudo- cluster head.
7. the method for claim 1, it is characterised in that the step S5 is further included：
S51：Aggregation node sends reverse route diffusion start message, initiates upper strata plane Route establishment；
S52：Cluster head receives the start message that aggregation node sends with pseudo- leader cluster node within aggregation node one is jumped, and preserves
Itself routing iinformation simultaneously forwards routing diffusion message；
S53：When cluster head carries out the forwarding of routing diffusion message with pseudo- leader cluster node, during itself routing iinformation is joined message；
S54：If cluster head successively receives a plurality of routing diffusion message, the optimal route road of selection path energy with pseudo- leader cluster node
Footpath simultaneously preserves forwarding；
S55：All cluster heads and pseudo- cluster head add the upper strata plane road by and being reported to routing table step by step and described converging section
Point.
8. the method for claim 1, it is characterised in that the step S7 is further included：
S71：It is initially average that the cluster head calculates the node according to the cluster interior nodes energy information collected in election process
Energy；
S72：The cluster head is with the initial average energy of cluster interior nodes to approach target；
S73：Often wheel data acquisition terminates, and all cluster heads judge whether itself present energy approaches target more than described；
S74：If any one cluster head dump energy approaches target described in being not more than, the cluster head rotation is sent to aggregation node
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 CN103945484A (en) | 2014-07-23 |
| CN103945484B true 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) |
Families Citing this family (15)
| 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 |
| CN108024305A (en) * | 2016-09-26 | 2018-05-11 | 北京信威通信技术股份有限公司 | A kind of system of selection of centralized control node for self-organizing network |
| WO2018098754A1 (en) * | 2016-11-30 | 2018-06-07 | 深圳天珑无线科技有限公司 | Cluster head selection method for 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 |
| WO2018098759A1 (en) * | 2016-11-30 | 2018-06-07 | 深圳天珑无线科技有限公司 | Method for selecting cluster head in distributed network, node, and system |
| CN107294852B (en) * | 2017-07-01 | 2019-12-27 | 台州学院 | Network routing method using topology dispersed short path set |
| 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 |
| CN109062272A (en) * | 2018-09-05 | 2018-12-21 | 佛山铮荣科技有限公司 | Rice irrigation intelligent observing and controlling system |
| CN110490266B (en) * | 2019-08-23 | 2022-04-22 | 北京邮电大学 | Sensor data uploading and sensor fault detection method and device |
| 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 |
| CN113556286B (en) * | 2021-05-31 | 2022-07-29 | 北京邮电大学 | Communication method and system of peer-to-peer network |
| CN116740087B (en) * | 2023-05-31 | 2024-05-24 | 湖北工业大学 | 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 |
|---|
| 一种基于分簇的优化定向扩散路由协议;梁小宇;《武汉理工大学学报》;20110831;第33卷(第4期);第1-2节 * |
| 基于剩余能量和节点度的无线传感器网络分簇算法;傅菊平等;《计算机应用研究》;20110131;第28卷(第1期);全文 * |
| 能量高效的无线传感器网络分簇路由算法研究;乔学工;《太原理工大学博士学位论文》;20121130;第4.5.1-4.5.4，5.3.2-5.3.3节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103945484A (en) | 2014-07-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103945484B (en) | Farmland wireless self-organized network topology density associated path selection optimization method | |
| CN102036308B (en) | Energy balancing wireless sensor network clustering method | |
| CN104486715B (en) | A kind of mobile sensor network cluster-dividing method based on geographical location information | |
| CN106454905B (en) | A kind of improved wireless sense network hierarchical multichain path method | |
| CN101394321B (en) | Non-uniform clustering method for cluster wireless sensor network based on energy balance | |
| CN102497679B (en) | Static clustering algorithm for wireless sensor network | |
| CN104410997B (en) | A kind of clustering topology construction method for wireless sensor network | |
| CN101442787B (en) | Energy-saving routing method for wireless sensor network based on power control | |
| CN105246117B (en) | A kind of implementation method of the energy-saving routing protocol suitable for mobile wireless Sensor Network | |
| CN101198167B (en) | Hybrid network system combining cell network and self-organizing network, and constructing method thereof | |
| CN101674630A (en) | Implementation method of cross-layer routing capable of perceiving congestion | |
| Meelu et al. | Energy efficiency of cluster‐based routing protocols used in wireless sensor networks | |
| CN104540173A (en) | Wireless sensor network mobile data collecting method based on arborescence cluster structure | |
| CN101594281A (en) | Collecting network data of wireless sensor method, system and relevant device | |
| CN106304229A (en) | A kind of software definition wireless Mesh netword based on content storage | |
| CN103415055A (en) | Wireless sensor network coordinator re-selection algorithm based on assistance of cellular network | |
| CN113395660A (en) | WSNs mobile convergence node self-adaptive position updating energy consumption optimization method based on tree | |
| CN105898764A (en) | Multi-stage energy heterogeneous wireless sensor network deployment method | |
| Mishra et al. | Survey on recent clustering algorithms in wireless sensor networks | |
| CN105792338B (en) | A kind of low energy consumption network design method based on correlation of nodes and ONU modularization suspend mode | |
| CN108834100A (en) | A kind of efficient broadcast routing method | |
| CN102811461B (en) | The load-balancing method merged with Cellular Networks based on Sensor Network | |
| CN108696880A (en) | A kind of orientation spanning tree cross-layer communication method based on power control | |
| Kaur et al. | Comparative analysis of clustering protocols for wireless sensor networks | |
| CN109309944B (en) | A kind of wireless multi-hop network topology discovery 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 |
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 |
|
| CP03 | Change of name, title or address |