CN106454905B - A kind of improved wireless sense network hierarchical multichain path method - Google Patents

A kind of improved wireless sense network hierarchical multichain path method Download PDF

Info

Publication number
CN106454905B
CN106454905B CN201611058667.2A CN201611058667A CN106454905B CN 106454905 B CN106454905 B CN 106454905B CN 201611058667 A CN201611058667 A CN 201611058667A CN 106454905 B CN106454905 B CN 106454905B
Authority
CN
China
Prior art keywords
node
energy
base station
sensor
network
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201611058667.2A
Other languages
Chinese (zh)
Other versions
CN106454905A (en
Inventor
韦世红
唐起超
焦中帅
孙梦璐
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN201611058667.2A priority Critical patent/CN106454905B/en
Publication of CN106454905A publication Critical patent/CN106454905A/en
Application granted granted Critical
Publication of CN106454905B publication Critical patent/CN106454905B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0215—Traffic management, e.g. flow control or congestion control based on user or device properties, e.g. MTC-capable devices
    • H04W28/0221—Traffic management, e.g. flow control or congestion control based on user or device properties, e.g. MTC-capable devices power availability or consumption
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0226—Traffic management, e.g. flow control or congestion control based on location or mobility
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0231—Traffic management, e.g. flow control or congestion control based on communication conditions
    • H04W28/0236—Traffic management, e.g. flow control or congestion control based on communication conditions radio quality, e.g. interference, losses or delay
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04—TPC
    • H04W52/18—TPC being performed according to specific parameters
    • H04W52/24—TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters
    • H04W52/242—TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters taking into account path loss
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • 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

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The present invention relates to a kind of improved wireless sense network hierarchical multichain path methods, belong to wireless sensor network technology field.For this method as unit of taking turns number, each round is divided into four-stage: 1) including the division stage of subregion, monitoring area is divided into m sub-regions according to optimal cluster head number at this stage；2) formation stages of subregion link, the interior sensor node from base station highest distance position of subregion begin setting up link, ultimately form single-link；3) the link formation stages of leader node, the sensor leader node from base station highest distance position begin setting up link, ultimately form tree；4) data transfer phase.The algorithm passes through static clustering, the generation of long-chain is avoided to a certain extent, the method for improving the competition weight of link formation stages and the recombination frequency of control node, preferably balances the network delay and network lifetime of wireless sense network, improves network performance.

Description

A kind of improved wireless sense network hierarchical multichain path method
Technical field
The invention belongs to wireless sensor network technology fields, are related to a kind of improved wireless sense network hierarchical multilink Method.
Background technique
Wireless sense network (Wireless Sensor Networks, WSNs) is largely sensed by being deployed in monitoring region Device node is in communication with each other the multihop self-organizing network system to be formed, and is the important technology form of Internet of Things bottom-layer network.It is wireless to pass Sense net is made of the sensor node of a large amount of energy constraints, these sensor deployments are in monitoring area, for collecting the number on periphery According to sending base station to.In recent years, since wireless sense network has self-organizing, the deployment skills such as fast, high fault tolerance and strong concealment Art advantage is widely used in the fields such as environmental monitoring, target following and battlefield investigation.In wireless sensor network, the energy of node It measures very limited, once battery consumption is complete, is charged to node or to replace battery typically unpractical.Therefore, how The problems such as improving energy efficiency, balanced node energy consumption, extending network life, network is avoided to divide becomes as wireless sensing The important topic of device network routing protocol research.
In order to solve these problems, many scholars, expert propose various routing Energy Saving Strategies, and WSNs is layered road The comparison used by agreement is more, main category include: based on link, based on tree, based on grid, based on the Routing Protocol in region, Wherein the Routing Protocol research based on link is the most extensive.
There are the deficiencies of three aspects for PEGASIS agreement, first is that chain generating algorithm generates long-chain between will lead to adjacent node； Second is that energy consumption is unbalanced between chain head node choosing method will lead to node；Third is that chain head node reselection frequency increases communication Expense.
For relevant issues existing in the prior art, the present invention is passed through based on more classical PEGASIS algorithm The division of subregion effectively avoids the generation of long-chain.For each subregion, the method for using static clustering first is kept away Exempt from dynamic clustering and excessively recombinated bring energy loss, according to the dump energy of node, selects leader node.Then to institute Some leader nodes establish link, finally by the dump energy of node, the neighbor density of node and apart from base station away from From the root node of selection and base station communication forms tree-like network topology structure.Link reconfiguration is carried out in wireless sense network In the process, by the recombination frequency of control node, the balance of network delay and network lifetime is reached, network is improved Performance.
Summary of the invention
In view of this, the purpose of the present invention is to provide a kind of improved wireless sense network hierarchical multichain path method, it should Method selects frequency by the routing rule of control node and the recombination of node, is guaranteeing few sensor node energy consumption While, network delay is reduced, the balance of network delay and network lifetime is reached, improves network performance.
In order to achieve the above objectives, the invention provides the following technical scheme:
A kind of improved wireless sense network hierarchical multichain path method, this method specifically includes the following steps:
S1: after monitoring area disposes node, base station sends initial message InitialMSG, receives InitialMSG The sensor node of message reports the information such as self-position, id；Base station obtains nodal information, counts node total number, monitoring area Interior nodes are known using location technology oneself, to the distance of base station, then determines the gradation levels of oneself according to these range informations level；
S2: base station divides monitoring area according to the sensor node information of collection, by issuing AdverinfoMSG message makes the sensor node of monitoring area that different subregions be added；
S3: it in each subregion, since the sensor node farthest from base station, by comparing energy distance, is formed Single-link, the sensor node energy in subregion are higher than EaveIt is elected as candidate cluster head, base station is by comparing the surplus of candidate cluster head Complementary energy selects the maximum candidate cluster head of dump energy to become leader node；
S4: to the leader node elected, since the sensor node farthest from base station, node i to be added is waited By comparing with the competition weight w (i, j) that has been added to the node j linked, select small w (i, j) to sequentially add link, finally Tree-like hierarchical structure is formed between all leader nodes, root node therein is determined according to proportion function Q, it is complete with base station At communication.
Further, in step sl, sensor node gradation levels level is defined are as follows:
Wherein, ceil () is the function that rounds up, disttoBSFor the distance of sensor node to base station,It is the critical distance of free space propagation model and multipath fading model.
Further, in step s 2, the determination of subregion number is according to load balancing factors LBF, the load balance Factor LBF is defined as:
Wherein, head_num is the number of clusters mesh of monitoring area, xiFor the node number that i-th of cluster includes, u is being averaged for cluster The node number for including；The value of load balancing factors LBF is smaller to show that network cluster dividing makes cluster interior nodes number more uniform, each cluster The load that head undertakes is also relatively more balanced.
Further, in step s3, cluster interior nodes broadcast helloMSG in respective communication radius, obtain neighbor information List, neighbor information list entry are as follows:
CID(I) NID(i) Er(i) RSSI(i)
Wherein CID (I) is the id of cluster where i-th of neighbor node；NID (i) is the node i d of node i；ErIt (i) is node The dump energy of i work at present wheel number；RSSI (i) is the received signal strength indication of node i；
Define energy distance are as follows:
Wherein, E0(j) that indicate is the r wheel primary power of destination node j, Er(j) what is indicated is destination node j in r The dump energy of wheel, Ploss (i, j) indicate is node i reach destination node j energy loss, be defined as Ploss (i, J)=pt(i)-rssi (j), wherein what rssi (j) was indicated is destination node j received signal intensity；It follows that Ploss (i, j) is bigger, illustrates to be lost between node i and node j very big；Conversely, illustrating that very little is lost；
Subregion dump energy mean value with N number of sensor node are as follows:
Wherein, the energy consumption of each round is that the Energy Transport Model of foundation wireless sense network is got, specific to calculate public affairs Formula are as follows:
Eeach=2kNEelec+kNEDA+kNεfsd2+kNε4 mp。
Specifically, wireless energy transfer model calculation formula is
Wherein, ETX(k, d) is to send energy consumed by k bit data, wherein EelecFor the loss of energy of transmit circuit, With number, modulation, filtering and signal propagate etc. factors it is related.εfs、εmpRespectively free space propagation model and multipath fading Energy required for model power amplifies.If d < d0, power amplifier then uses free-space propagation Model；Conversely, then using multipath fading model.
ERXWhat (k, d) was indicated is to receive energy consumed by k bit data, and expression formula can indicate are as follows: ERX(k, d)= kEelec, it is E that the data packet for merging x, which becomes the energy consumption of single data packet,fuse(x,k), calculation formula are as follows: Efuse(x,k)=xkEDA Wherein, EDAEnergy consumption when each data packet is merged for node.
Further, in step s 4, the competition weight between leader node are as follows:
Wherein, what Ploss (i, j) was indicated is the energy loss that node i reaches next-hop node j, and level (j) is referred to The gradation levels of node j distance BS；Proportion function Q is defined asWherein, ErIt (i) is node i in r The dump energy of wheel, it is close that ρ (i) is defined as the neighbor node that node i is obtained according to the message frame of base station broadcast in communication radius r Degree, calculation formula are as follows:
Wherein, Neighbor_alive (i) indicates neighbor node number of the node i within the scope of communication radius r；
After the selection for completing root node, data transfer phase is entered, in each subregion, leader node is passed It is defeated；Leader first generates a token packet, and selects the arbitrary end of chain, then this packet is sent along chain hop-by-hop； Since chain end, the data of acquisition and the token packet received are transferred to next-hop neighbor node, neighbor node by node together The data of oneself and the data received are subjected to the neighbor node that fusion is then forwarded to oneself, until leader node receives Token packet and data；In the communication completed between leader node that next stage is similar, final data is received by root node, Just the direct communication with base station is completed.
Further, which, by the recombination frequency of control node, saves sensor node, passes through as unit of taking turns number Setting wheel number control function round controls sensor node recombination frequency, defined function round are as follows:
Wherein EiniIt is initial total energy.
The beneficial effects of the present invention are: compared with the conventional method, the present invention is in node amount of survival, residue of network organization energy The harmonious aspect network performance of amount, network delay, network lifetime, network energy is more excellent: the present invention is by by node Distributed areas be divided into multiple subregions, the generation of long-chain between node is avoided to a certain extent, when reducing the transmission of data packet Prolong；Subregion interior nodes according to weight function selection it is next enter chain node, which has comprehensively considered the road between node The dump energy of diameter loss and node, reduces node energy consumption, forms single-link.When carrying out head node selection, comprehensively consider The dump energy of node, the gradient of node and path loss, less network delay, also balanced network energy consumption. Hierarchical tree structure is formed between Leader node, and root node is determined according to proportion function Q, it is finally complete with base station by root node At communication, multi-hop transmission is taken full advantage of.To sum up, the present invention effectively balanced network energy consumption and network delay, preferably prolongs The life span of network is grown.
Detailed description of the invention
In order to keep the purpose of the present invention, technical scheme and beneficial effects clearer, the present invention provides following attached drawing and carries out Illustrate:
Fig. 1 is algorithm flow chart of the invention；
Fig. 2 is the energy consumption model of wireless sense network；
Fig. 3 is Wireless Sensor Network Topology illustrated example.
Specific embodiment
Below in conjunction with attached drawing, a preferred embodiment of the present invention will be described in detail.
In the present embodiment, application network model is specific as follows: N number of sensor node is randomly distributed in monitoring region, BS Region distant location is monitored positioned at distance；The sensor node of isomorphism will all remain static once disposing, and have identical Primary power, and cannot supply, BS thinks that energy is unlimited, and BS is fixed；Data link is symmetrically, that is, to save Point Si can be communicated with node Sj, and node Sj can also be communicated with node Si；Sensor node is known that the location information of oneself, This position may be to be obtained with location technology, can also be calculated at a distance from arbitrary node by signal strength；Each There is sensor node the whole network uniquely to identify ID number.
Fig. 1 is algorithm flow chart of the invention, as shown, the step of algorithm is as follows:
Step 1, after monitoring area disposes node, base station sends initial message InitialMSG, receives The sensor node of InitialMSG message reports the information such as self-position, id, and base station obtains nodal information, and statistics node is total Number, monitoring area interior nodes are known using location technology oneself, to the distance of base station, then to be determined certainly according to these range informations Oneself gradation levels level, level are defined asWherein, ceil () is the letter that rounds up Number.disttoBSFor the distance of sensor node to base station,It is free space propagation model and multipath fading The critical distance of model.
Step 2, base station divides monitoring area according to the sensor node information of collection, by issuing AdverinfoMSG message makes the sensor node of monitoring area that different subregions be added.For the process of sub-zone dividing In, the determination method of best number of clusters: according to load balancing factors LBF, is defined as:
Wherein, head_num is the number of clusters mesh of monitoring area, xiFor the node number that i-th of cluster includes, u is being averaged for cluster The node number for including.The value is smaller to show that network cluster dividing makes cluster interior nodes number more uniform, the load that each cluster head undertakes It is relatively more balanced.When the sensor node number of the sensor node of selection is 100, obtained by comparing network performance analysis Out, monitoring area is divided region is 9 proper.
Step 3, in each subregion, since the sensor node farthest from base station, by comparing energy distance, shape At single-link, for the sensor node in subregion by comparing Eave, select leader node.Energy distance definition are as follows:
Wherein, E0(j) that indicate is the r wheel primary power of mesh node j, Er(j) what is indicated is that destination node j takes turns in r Dump energy, Ploss (i, j) indicate is node i reach destination node j energy loss, be defined as Ploss (i, j) =pt(i)-rssi (j), wherein what rssi (j) was indicated is destination node j received signal intensity.It follows that Ploss (i, J) bigger, illustrate to be lost between node i and node j very big；Conversely, illustrating that very little is lost.Fig. 2 is that the energy of wireless sense network disappears Consume model.
Subregion dump energy mean value with N number of sensor node isIts In, the energy consumption of each round is specific calculation formula are as follows: E based on the Energy Transport Model according to wireless sense networkeach =2kNEelec+kNEDA+kNεfsd2+kNε4 mp。
Referring to Fig. 3 wireless sensing net topology, N number of node is shared in monitoring area, is divided into m sub-regions, sensor section Point is specifically divided into 5 classes: (1) only sending the ordinary node of energy loss；(2) have and send energy loss, receive energy loss Ordinary node；(3) there is the leader node for sending energy loss and data fusion loss；(4) have and send energy damage Consumption, the leader node for receiving energy loss and data fusion loss；(5) have and be sent to base station energy loss, receive energy The root node of amount loss and data fusion loss, according to classical wireless sense network energy consumption mode, the energy of a wheel Consume EeachAre as follows:
In formula,What is indicated is the energy consumption that final leader node transmits packets to BS,Refer to cluster The interior energy consumption for sending data packet,Refer to the energy consumption of received data packet in cluster,It is to receive leader section The energy consumption of point,It is the energy consumption for sending leader node, EfuseIt is the energy consumption of fused data packet.
Step 4, since the sensor leader node farthest from base station, wait node i to be added by comparing and Through the competition weight w (i, j) of the node j of link is added, link is sequentially added according to the small w (i, j) of selection, it is final all Tree-like hierarchical structure is formed between leader node, root node therein is determined according to proportion function Q, is completed with base station logical Letter.
The competition weight of leader intermediate node are as follows:
Wherein, what Ploss (i, j) was indicated is the energy loss that node i reaches next-hop node j, and level (j) is referred to The gradation levels of node j distance BS.The purpose that the gradation levels for considering node are added in competition weight is for data transmission It is transmitted as far as possible to the direction of nearly base station location, saves propagation delay time.Proportion function Q is defined as:
Wherein, Er(i) dump energy taken turns for node i in r, ρ (i) are the neighbor node density of node i, calculation formula Are as follows:
Wherein, Neighbor_alive (i) indicates neighbor node number of the node i within the scope of communication radius r.
The selection for completing root node, enters data transfer phase.In each subregion, leader node-node transmission. Leader first generates a token packet, and selects the arbitrary end of chain, then this packet is sent along chain hop-by-hop.From Chain end starts, and the data of acquisition and the token packet received are transferred to next-hop neighbor node by node together, and neighbor node will The data of oneself and the data received carry out the neighbor node that fusion is then forwarded to oneself, until leader node receives token Packet and data.In the communication completed between leader node that next stage is similar, final data is received by root node, is just completed With the direct communication of base station.
This algorithm is, by the recombination frequency of control node, to save sensor node due to excessively heavy as unit of taking turns number The additional energy loss of group bring, preferably extends network life.By setting wheel number control function round to sensor Node recombination frequency is controlled, defined function round are as follows:
Wherein, EiniIt is initial total energy.For example, the initial stage that sensor node is set up in link, the energy of node still compares More abundant.As round<0.2, without the recombination of link, the energy consumption excessively recombinated is saved, to the later period, round> When 0.8, when node energy is not very much, each round link will be recombinated, and preferably extend network life in this way.
Finally, it is stated that preferred embodiment above is only used to illustrate the technical scheme of the present invention and not to limit it, although logical It crosses above preferred embodiment the present invention is described in detail, however, those skilled in the art should understand that, can be Various changes are made to it in form and in details, without departing from claims of the present invention limited range.

Claims (3)

1. a kind of improved wireless sense network hierarchical multichain path method, it is characterised in that: this method specifically includes the following steps:
S1: after monitoring area disposes node, base station sends initial message InitialMSG, receives InitialMSG message Sensor node report self-position, id, dump energy message；Base station obtains nodal information, counts node total number, monitored space Domain interior nodes are known using location technology oneself, to the distance of base station, then determines the gradient etc. of oneself according to these range informations Grade level；
S2: base station divides monitoring area according to the sensor node information of collection, by issuing broadcast message AdverinfoMSG makes the sensor node of monitoring area that different subregions be added；
S3: it in each subregion, since the sensor node farthest from base station, by comparing energy distance, is formed single-stranded Road, the sensor node energy in subregion are higher than subregion dump energy mean value EaveIt is elected as candidate cluster head, base station passes through ratio Compared with the dump energy of candidate cluster head, the maximum candidate cluster head of dump energy is selected to become leader node；
S4: to the leader node elected, since the sensor node farthest from base station, node i to be added is waited to pass through The competition weight w (i, j) for comparing and having been added to the node j linked selects small w (i, j) to sequentially add link, final all Leader node between form tree-like hierarchical structure, root node therein is determined according to proportion function Q, is completed with base station logical Letter；
In step sl, sensor node gradation levels level is defined are as follows:
Wherein, ceil () is the function that rounds up, disttoBSFor the distance of sensor node to base station,It is The critical distance of free space propagation model and multipath fading model, εfs、εmpRespectively free space propagation model and multipath declines Subtract energy required for model power amplifies；
In step s3, cluster interior nodes broadcast neighbours in respective communication radius and establish request message helloMSG, obtain adjacent Information list is occupied, neighbor information list entry is as follows:
CID(I) NID(i) Er(i) RSSI(i)
Wherein CID (I) is the id of cluster where i-th of neighbor node；NID (i) is the node i d of node i；Er(i) current for node i The dump energy of active wheel number；RSSI (i) is the received signal strength indication of node i；
Define energy distance are as follows:
Wherein, E0(j) that indicate is the r wheel primary power of destination node j, Er(j) what is indicated is that destination node j takes turns in r Dump energy, Ploss (i, j) indicate is node i reach destination node j energy loss, be defined as Ploss (i, j) =pt(i)-rssi (j), wherein pt(i) signal strength sent for node i, what rssi (j) was indicated is that destination node j is received Signal strength；It follows that Ploss (i, j) is bigger, illustrate to be lost between node i and node j very big；Conversely, illustrating loss very It is small；
Subregion dump energy mean value with N number of sensor node are as follows:
Wherein, EeachIndicate the energy consumption of each round, E0For the primary power of node, r is current emulation wheel number；For tool There are the sensor network of N number of node, the energy consumption of each round is defined as:
Eeach=2kNEelec+kNEDA+kNεfsd2+kNε4 mp
Wherein, message length is k bit, EelecTo send or receive energy consumed by circuit 1 bit data of every processing, EDAFor The energy loss of 1 bit of node processing, εfs、εmpRespectively free space propagation model and multipath fading model power amplify institute The energy needed；
In step s 4, the competition weight between leader node are as follows:
Wherein, Er(j) dump energy for being node j, what Ploss (i, j) was indicated is the energy damage that node i reaches next-hop node j Consumption, level (j) refer to the gradation levels of node j distance BS；Proportion function Q is defined asWherein, Er(i) dump energy taken turns for node i in r, dtoBSFor the distance of sensor node to base station, ρ (i) be defined as node i according to The message frame of base station broadcast obtains the neighbor node density in communication radius r, and calculation formula isWherein, Neighbor_alive (i) indicates node i within the scope of communication radius r Neighbor node number；
After the selection for completing root node, data transfer phase is entered, in each subregion, leader node-node transmission；It is first First leader generates a mark and wraps token, and selects the arbitrary end of chain, then this packet is sent along chain hop-by-hop； Since chain end, the data of acquisition and the token packet received are transferred to next-hop neighbor node, neighbor node by node together The data of oneself and the data received are subjected to the neighbor node that fusion is then forwarded to oneself, until leader node receives Token packet and data；In the communication completed between leader node that next stage is similar, final data is received by root node, Just the direct communication with base station is completed.
2. a kind of improved wireless sense network hierarchical multichain path method according to claim 1, it is characterised in that: in step In rapid S2, the determination of subregion number is according to load balancing factors LBF, the load balancing factors LBF is defined as:
Wherein, head_num is the number of clusters mesh of monitoring area, xiFor the node number that i-th of cluster includes, u is that being averaged for cluster includes Node number；The value of load balancing factors LBF is smaller to show that network cluster dividing makes cluster interior nodes number more uniform, and each cluster head is held The load of load is also relatively more balanced.
3. a kind of improved wireless sense network hierarchical multichain path method according to any one of claim 1 to 2, special Sign is: this method, by the recombination frequency of control node, saves sensor node as unit of taking turns number, takes turns number by setting Control function roun controls sensor node recombination frequency, and defined function round isWherein, rcurFor current emulation wheel number, rmaxNumber, E are taken turns for maximum emulationiniIt is just Beginning gross energy, EeachFor the energy consumption of each round.
CN201611058667.2A 2016-11-25 2016-11-25 A kind of improved wireless sense network hierarchical multichain path method Active CN106454905B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201611058667.2A CN106454905B (en) 2016-11-25 2016-11-25 A kind of improved wireless sense network hierarchical multichain path method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201611058667.2A CN106454905B (en) 2016-11-25 2016-11-25 A kind of improved wireless sense network hierarchical multichain path method

Publications (2)

Publication Number Publication Date
CN106454905A CN106454905A (en) 2017-02-22
CN106454905B true CN106454905B (en) 2019-11-22

Family

ID=58218704

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201611058667.2A Active CN106454905B (en) 2016-11-25 2016-11-25 A kind of improved wireless sense network hierarchical multichain path method

Country Status (1)

Country Link
CN (1) CN106454905B (en)

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107257565B (en) * 2017-06-02 2020-07-14 西安电子科技大学 Wireless sensor network reliability calculation method based on energy and transmission
CN108092826B (en) * 2018-01-17 2020-11-06 重庆邮电大学 Wireless sensor network security model based on backbone node security role hierarchy
CN108513332B (en) * 2018-04-26 2020-05-26 江西理工大学 Clustering routing method and system
CN108650697B (en) * 2018-05-04 2020-09-01 南京大学 Data routing method in long-distance linear wireless sensor network
CN108834095A (en) * 2018-07-03 2018-11-16 深圳大图科创技术开发有限公司 Maritime meteorology information Perception system
CN109041075B (en) * 2018-08-22 2022-04-12 西安空间无线电技术研究所 Energy-limited network wireless energy transmission control method and system
CN110366231A (en) * 2019-07-16 2019-10-22 启迪云控(北京)科技有限公司 A kind of information processing method and its system
CN111818476B (en) * 2020-07-07 2023-03-31 安全能力生态聚合(北京)运营科技有限公司 Visual operation and maintenance platform system
CN112333654A (en) * 2020-10-28 2021-02-05 华北电力大学 Energy local equalization topology control algorithm for improving robustness of wireless sensor network
CN112929939B (en) * 2021-02-07 2022-04-08 电子科技大学 Ad Hoc network clustering method and device based on Bubble frame
CN113543058A (en) * 2021-05-26 2021-10-22 武汉理工大学 Dust monitoring and processing system based on Wi-Fi Mesh

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104410997A (en) * 2014-12-29 2015-03-11 重庆邮电大学 Method for establishing hierarchical topology structure applied to wireless sensor network
CN105764111A (en) * 2014-12-18 2016-07-13 镇江坤泉电子科技有限公司 Wireless-sensing-network autonomous routing method
CN106102075A (en) * 2016-08-25 2016-11-09 广东工业大学 The cluster-dividing method divided based on hierarchical region in radio sensing network and system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105764111A (en) * 2014-12-18 2016-07-13 镇江坤泉电子科技有限公司 Wireless-sensing-network autonomous routing method
CN104410997A (en) * 2014-12-29 2015-03-11 重庆邮电大学 Method for establishing hierarchical topology structure applied to wireless sensor network
CN106102075A (en) * 2016-08-25 2016-11-09 广东工业大学 The cluster-dividing method divided based on hierarchical region in radio sensing network and system

Also Published As

Publication number Publication date
CN106454905A (en) 2017-02-22

Similar Documents

Publication Publication Date Title
CN106454905B (en) A kind of improved wireless sense network hierarchical multichain path method
Sabet et al. A decentralized energy efficient hierarchical cluster-based routing algorithm for wireless sensor networks
Jain et al. Clustering protocols in wireless sensor networks: A survey
CN102036308B (en) Energy balancing wireless sensor network clustering method
CN102497679B (en) Static clustering algorithm for wireless sensor network
CN107360612B (en) A kind of data transmission method of the wireless sensor network based on ant colony multipath
Meelu et al. Energy efficiency of cluster‐based routing protocols used in wireless sensor networks
Tong et al. A cross unequal clustering routing algorithm for sensor network
CN104410997A (en) Method for establishing hierarchical topology structure applied to wireless sensor network
CN103200643A (en) Distributed fault-tolerant topology control method based on dump energy sensing
CN109511152A (en) A kind of balanced cluster-dividing method of terminaloriented communication access net perception monitoring
CN107995667A (en) A kind of energy consumption balance method for routing of controllable cluster scale
CN108541038A (en) A kind of route selection method and system of wireless sensor network
Nabavi An optimal routing protocol using multi-objective whale optimization algorithm for wireless sensor networks
Pradhan et al. A survey on hierarchical clustering algorithm for wireless sensor networks
Kaur et al. Comparative analysis of clustering protocols for wireless sensor networks
Tan et al. A distributed and dynamic data gathering protocol for sensor networks
Ahir et al. Energy efficient clustering algorithm for data aggregation in wireless sensor network
Xu A modified AODV routing protocol using in WSN based on ant colony algorithm
CN107801227A (en) A kind of routing scheduling method towards wireless sensor network stratification analysis
Rasheed et al. Cluster-quality based hybrid routing for large scale mobile multi-hop networks
Wang et al. NHEED: An energy-efficient multi-hop routing protocol based on HEED
Ilyas et al. A survey on the fundamental and advanced mobile ad hoc network routing protocols
Kodali Energy efficient routing in multi-level LEACH for WSNs
Sivakumar et al. An energy efficient routing technique to improve the performance of wireless sensor network through adaptive tree based sink relocation

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