CN105764084A - Wireless sensor network multipath routing protocol realization method - Google Patents

Wireless sensor network multipath routing protocol realization method Download PDF

Info

Publication number
CN105764084A
CN105764084A CN201610082708.5A CN201610082708A CN105764084A CN 105764084 A CN105764084 A CN 105764084A CN 201610082708 A CN201610082708 A CN 201610082708A CN 105764084 A CN105764084 A CN 105764084A
Authority
CN
China
Prior art keywords
node
grid
packet
management node
management
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.)
Pending
Application number
CN201610082708.5A
Other languages
Chinese (zh)
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.)
Nanjing Post and Telecommunication University
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing Post and Telecommunication University
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 Nanjing Post and Telecommunication University filed Critical Nanjing Post and Telecommunication University
Priority to CN201610082708.5A priority Critical patent/CN105764084A/en
Publication of CN105764084A publication Critical patent/CN105764084A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/04—Arrangements for maintaining operational condition
    • 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
    • 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 invention discloses a wireless sensor network multipath routing protocol realization method. According to the method, a new routing protocol BRGNC (Braided multipath Routing protocol based on Grid with Network Coding) which meets the conditions and is completely based on an intersection multipath network coding model is designed according to the use difficulty of the intersection multipath network coding model by applying a virtual grid division method based on the geographical position. The protocol can still provide high transmission reliability and energy efficiency in a large-scale sensor network of poor link quality. Great energy consumption balancing can be guaranteed by the wireless sensor network multipath routing protocol realization method.

Description

A kind of wireless sense network multi-path routing realize method
Technical field
What the present invention relates to a kind of wireless sense network multi-path routing based on crossing multipath network encoding model realizes method, belongs to communication technical field.
Background technology
Owing to wireless sensor network node number is more and wireless link has unstability, traditional single footpath transmission is difficult to meet the requirement of network transmission.But multi-path routing can find mulitpath in a route finding process, make packet parallel transmission on mulitpath, thus reducing route discovery number of times, utilize the redundancy properties of multilink can improve the reliability of transmission and reduce control overhead and end-to-end delay simultaneously.
Network code is to be proposed equal to 2000 by Ahlswede, Cai, is an important breakthrough in recent years in Communication Studies field.It changes conventional data packet and receives the processing mode sent, and the packet received can be encoded at via node place, and send out after reconfiguring according to certain algorithm again.Network code applies to wireless sense network can increase handling capacity and the reliability of network, can also reduce energy consumption simultaneously, improves Network Load Balance, improves the safety of network.
According to whether node on multiple paths has coincidence, multipath route can be divided into two classes: non-intersect multipath route and intersects multipath route.The node of non-intersect multipath only occurs in one path, and some node intersected in multipath may reside in different paths.At present relatively influential non-intersect agreement includes the AOMDV agreement preferential based on jumping figure, the NCAOMDV agreement combined with network code, WMBR and multipath routing protocols (NCMR).
Although intersecting multipath network encoding model to prove to be better than non-intersect multipath encoding model, but it is still difficult to be used in wireless sensor network, because using this model to must assure that in the transmission range that node is in upper and lower hop node, and the spread scope of wireless sensor node is limited, so the multi-path routing being currently based on the wireless sense network that crossing multipath network encoding model is set up is less.And the present invention can solve problem above well.
Summary of the invention
Present invention aim at for above-mentioned the deficiencies in the prior art, what propose a kind of wireless sense network multi-path routing realizes method, the method is according to this use difficult point intersecting multipath network encoding model, use the method dividing virtual grid based on geographical position, devise a kind of novel Routing Protocol BRGNC (BraidedmultipathRoutingprotocolbasedonGridwithNetworkCod ing) meeting above-mentioned condition and being based entirely on crossing multipath network encoding model, this agreement can still provide significantly high transmission reliability and energy efficiency in the poor sensor network of large-scale link-quality.
The technical solution adopted for the present invention to solve the technical problems is: a kind of Wireless Sensor Network Routing Protocol realize method, wireless sensor network is divided into little virtual grid based on geographical position by the method, use among this grid and intersect multipath network code, such that it is able to still provide significantly high transmission reliability and energy efficiency in the poor sensor network of large-scale link-quality.The network routing protocol of the method includes netinit, Route establishment process, data transmission procedure and communication and safeguards four parts, and this Routing Protocol specifically includes following steps:
Step 1: network model initializes；
Local node and Sink node communication, obtain the logic ID of place virtual grid, and complete the virtual grid to network's coverage area with this and divide；
Network model has been initialized as the logic ID obtaining local node place virtual grid and has completed the virtual grid to network's coverage area with this and divide, including:
Step 1-1:Sink node broadcasts netinit packet；
Step 1-2: local node, after receiving the netinit packet of Sink node broadcast, obtains initialization data, and described initialization data includes Sink node numbering, Sink geographical position coordinates, virtual grid space D and time synchronization information；
Step 1-3: grid election management node
Node, after knowing self grid ID, can wait that a time period τ (τ < t), t refer to that one takes turns the duration that competition is required at random.Then send challenge message bag towards periphery, packet comprises grid ID and node ID.If being previously received, sending competition bag, the competition bag that other node is sent, first can judge that whether grid ID is identical with self, differing, abandon, the conduct management node that the identical node ID then selected in competition package informatin is minimum, and abandon sending competition bag.By the time, after the t time, each node can send to management node and confirm message.After the management node of each grid is selected, also can exchange information between adjacent grid and tell the other side the ID of this mesh-managing node.
Step 1-4: obtain optional nodal information
Management node elects and can send inquiry message to all nodes in this grid afterwards, and the energy value of oneself can be beamed back management node by node after receiving message.Owing to node energy each time initial is all full state, so all nodes can be counted optional set of node by management node.Except adding up the optional node of this grid, management node also can to the information of its optional node of adjacent trellis search, including node ID and residual energy value.
Step 1-5:PRR detects
PRR refers to the packet probability of acceptance (packetreceptionratio), method for surveying is management node is optional node distribution sending time slots, each optional node sends to adjacent grid in self time slot and detects packet, probe packets comprises node ID, source grid ID, source mesh-managing node ID and target gridding ID.The optional node of the adjacent grid of target can receive these probe packets, and statistics receives the quantity from the not probe packets of homology grid respectively, and these quantity informations are finally beamed back the management node of respective source grid respectively.After the information such as management node, obtaining the management node ID of adjacent grid, adjoins the optional node ID of grid and energy, PRRng and PRRgg, just can complete the foundation of adjacent gridding information table.
Step 2: Route establishment process；
After netinit, when target area, event occurs, source node produce data need to sink transmit time, it is necessary to setting up the intersecting paths of fixed number, its workflow is as follows simultaneously:
Step 2-1: source node calculates whether the grid Grad of self is 1, if being 1, representing and can directly communicate with sink, it is not necessary to set up route；If gradient is not 1, illustrating to need to forward through intermediate node, now source node sends path request message to the management node of this grid.
Step 2-2: after management node receives path request message, read stored gridding information table, judging whether the optional interstitial content adjacent grid more than path number, if there is no such grid then multipath is set up unsuccessfully, informs that source node selects single footpath mode to set up route；If there is such grid, enter step 2-3.
Step 2-3: management node calculates all weighted value cost satisfying condition grid, selects the maximum grid of cost value as down hop grid, and i-th adjoins grid costiCalculating consider the factor such as link circuit condition between grid energy, node number, grid:
cost i = E i N i &CenterDot; e &CenterDot; PRR g g ( i ) &CenterDot; &lsqb; S 0 - S i + 1 &rsqb;
PRRgg (i) represents the PRRgg between this grid and adjacent grid i, i.e. (this grid and neck connect the packet probability of acceptance between grid), Ni represents the optional node number of adjacent grid i, Ei represents the optional node energy summation of adjacent grid i, e representation node primary power, Si and S0 represents the Grad of adjacent grid i and this grid respectively, wherein i=1,2,3.
Step 2-4: after selecting down hop grid, management node can select forward node collection in down hop grid, the selection standard of forward node collection can be adjusted according to practical application request, if this application needs high reliability, selects node bigger for node adjacency data in grid bag probability of acceptance PRRng as forward node collection；If it is considered that balancing energy then selects node that the energy value of node is bigger as forward node collection.In crossing multipath network encoding model, reliability tends to be guaranteed, so generally can pay the utmost attention to Energy Consumption Factors, the present invention selects next-hop node collection by node energy priority principle.The node number of next-hop node collection is identical with multiple paths number, and then management node can produce Path selection message Path_select.
Step 2-5: after the management node of down hop receives Path selection message, can inform that the corresponding forward node of this grid enters forwarding state according to Path selection message, after the confirmation message of forward node to be received, the forward node of meeting upper hop grid sends OK message, feeds them into data and sends state.Meanwhile this management node can judge whether the gradient of oneself is 1, and gradient is 1 represent route and terminate, management node can directly using sink as down hop, if gradient is not 1, sends path request message and repeat the flow process of step 2-2～step 2-4；
Step 3: data transmission procedure；
Management node can inform the forward node of this grid at the forward node selecting down hop.When forward node is after the OK message that the management node receiving down hop sends, namely enter data transmission state.
The present invention adopts stochastic linear coding techniques, and first raw data packets is divided into m group by source node, and generally taking m is 3.In order to ensure the success rate of the first jumping, the number k of coded data packet can be producedmIndividual coded data packet down hop sends.kmSize select take into account the success rate of the first jumping and the transmission energy consumption of source node equally, it is contemplated that the computing capability of sensor node, the present invention uses below equation to calculate kmValue is:
km=| m/PRRgg|
PRR is the grid PRR between this grid and down hop gridgg.Send packet be encoded after packet, after each forward node receives packet, first group number can be judged, if a new group number, a memory space can be opened up for depositing this packet in memory block, the size of memory space is consistent with coding order number m, the corresponding life span t1 of each memory space；If existed before the group number received, then this packet is stored in the memory space of correspondence.
When meeting following condition, the packet of this memory space can be encoded forwarding by node: packet is filled with or arrives life span t1, and coding bag number is identical with memory space packet.Once these group data forward, forward node will record the group number forwarded, and just will not receive from the packet being marked with this group number later again.After these coded data packet finally pass to sink node, coding bag can, according to Gaussian elimination method, be decoded restoring initial data by sink.
Step 4: communication maintenance process；
Network needs to carry out the maintenance of a series of necessity upon initialization, makes system properly functioning.In this agreement, route maintenance mainly has the work in following two.
Step 4-1: management node maintenance: management node is elected when initializing, carries the data transmission in the mutual of management information and necessary situation in network work later, can be easier to death than the energy that ordinary node is easier to consume.Each management node is adopted disaster recovery mechanism by this agreement, once its energy is in critical moribund condition, management node can inquire about the residue energy of node in this grid, choose the maximum node of dump energy as next management node, data backup and this node broadcast message are informed the management node of this grid node and adjacent grid.
Step 4-2: re-establishing of path: along with the network operation, the energy of node and link-quality all can be varied from, so the path set up only has the life span of T.Will carrying out a network operation every T time, including the optional set of node redefined in grid, PRR detects again, updates adjacent gridding information table with this.The value view network actual motion state of T and determine, if the Link State shakiness rule T of network takes smaller value, on the contrary desirable higher value.Assuming that the speed that source node is given out a contract for a project is μ, when network operation, the energy of optional node selects threshold value EthresholdExpression formula is:
Ethreshold=μ T (ESD+ERX)
Wherein μ represents source node packet sending speed, T delegated path life span, ESDRepresentation node once sends the energy of consumption, ERXRepresentation node once receives the energy of consumption.Meeting dump energy and become optional node be more than or equal to the node of threshold value, management node also with the relevant information in the adjacent gridding information table of adjacent grid interactive modifying, and can re-establish path after network operation.
Beneficial effect:
1. crossing multipath network encoding model is applied in wireless sensor network by the present invention, the division of virtual grid is carried out by the geographical position of node, set up the route between grid, and adopt stochastic linear coding to carry out data transmission, such that it is able to successfully manage the region link failure being likely to occur in network.PRRgg between grid is that the poor words of link-quality are to be selected as down hop grid as the important parameter calculating weighted value cost, the path of foundation can around the poor region of downlink quality, thus ensureing the reliability that data are transmitted；Secondly can communicate maintenance every T time section, now neighboring region can be carried out again link-quality and detect, therefore can find the region of link failure comparatively timely, thus later reconstruction path time can detour this region.
2. the present invention ensure that good energy consumption balance.Setting up in path in process, the optional node energy summation of grid is the parameter calculating weighted value cost, and when other parameters are consistent, grid that gross energy is more big is more easy to be chosen as down hop grid；And in node selects, choose according to the principle of energy priority completely exactly.Therefore often safeguarding reconstruction path through T time section communication, the node on forward-path is the node that dump energy is relatively large, and therefore energy consumption balance can be ensured preferably.
Accompanying drawing explanation
Fig. 1 is the method flow diagram of the present invention.
Fig. 2 is the illustraton of model that virtual grid of the present invention divides.
Fig. 3 is Path selection message schematic diagram of the present invention.
Fig. 4 is that the present invention manages node and sets up the operational process schematic diagram in process in path.
Fig. 5 is coded data packet form schematic diagram of the present invention.
Detailed description of the invention
Below in conjunction with Figure of description, the invention is described in further detail.
What the invention provides a kind of Wireless Sensor Network Routing Protocol realizes method, the method divides virtual grid based on geographical position, devise the Routing Protocol of a kind of crossing multipath network encoding model, first according to the energy situation of grid, link-quality in routing procedure, the selecting factors down hop grids such as node number, again through grid interior nodes condition selecting " optimum " forward node collection, reduce the difficulty of the multi-path routing in the past setting up wireless sense network according to crossing multipath network encoding model.This agreement possesses good reliability and energy consumption balance, also is able to ensure well the transmitting of data when, Link State extreme difference very big in network size；Fig. 1 shows the technical process that this invention is main, including the initialization of network model, and the maintenance of status information between node, set up route, data are transmitted and route maintenance procedure, and concrete steps include:
Step 1: network model initializes:
The initialization of network model is to obtain the logic ID of local node place virtual grid and completing the virtual grid to network's coverage area with this and divide, as in figure 2 it is shown, include:
Step 1-1:Sink node broadcasts netinit packet；
Step 1-2: local node, after receiving the netinit packet of Sink node broadcast, obtains initialization data；
Step 1-3: grid election management node.Node, after knowing self grid ID, can wait a time period τ (τ < t) at random, then sends challenge message bag towards periphery, comprises grid ID and node ID in packet.If being previously received, sending competition bag, the competition bag that other node is sent, first can judge that whether grid ID is identical with self, differing, abandon, the conduct management node that the identical node ID then selected in competition package informatin is minimum, and abandon sending competition bag.By the time, after the t time, each node can send to management node and confirm message.After the management node of each grid is selected, also can exchange information between adjacent grid and tell the other side the ID of this mesh-managing node.
Step 1-4: obtain optional nodal information.Management node elects and can send inquiry message to all nodes in this grid afterwards, and the energy value of oneself can be beamed back management node by node after receiving message.Owing to node energy each time initial is all full state, so all nodes can be counted optional set of node by management node.Except adding up the optional node of this grid, management node also can to the information of its optional node of adjacent trellis search, including node ID and residual energy value.
Step 1-5:PRR detects.Management node is optional node distribution sending time slots, and each optional node sends to adjacent grid in self time slot and detects packet D.The optional node of the adjacent grid of target can receive these probe packets, and statistics receives the quantity from the not probe packets of homology grid respectively, and these quantity informations are finally beamed back the management node of respective source grid respectively.After the information such as management node, obtaining the management node ID of adjacent grid, adjoins the optional node ID of grid and energy, PRRng and PRRgg, just can complete the foundation of adjacent gridding information table.
Step 2: Route establishment process；
After netinit, when target area, event occurs, source node produce data need to sink transmit time, it is necessary to setting up the intersecting paths of fixed number, its workflow is as follows simultaneously:
Step 2-1: source node calculates whether the grid Grad of self is 1, if being 1, representing and can directly communicate with sink, it is not necessary to set up route；If gradient is not 1, illustrating to need to forward through intermediate node, now source node sends path request message to the management node of this grid.
Step 2-2: after management node receives path request message, read stored gridding information table, judging whether the optional interstitial content adjacent grid more than path number, if there is no such grid then multipath is set up unsuccessfully, informs that source node selects single footpath mode to set up route；If there is such grid, enter step 2-3.
Step 2-3: management node calculates all weighted value cost satisfying condition grid, selects the maximum grid of cost value as down hop grid, and i-th adjoins grid costiCalculating consider the factor such as link circuit condition between grid energy, node number, grid:
cost i = E i N i &CenterDot; e &CenterDot; PRR g g ( i ) &CenterDot; &lsqb; S 0 - S i + 1 &rsqb;
costiRepresenting the weighted value of the adjacent grid of i-th, PRRgg (i) represents the PRRgg between this grid and adjacent grid i, i.e. (this grid and neck connect the packet probability of acceptance between grid), NiRepresent the optional node number of adjacent grid i, EiRepresenting the optional node energy summation of adjacent grid i, e representation node primary power, Si and S0 represents the Grad of adjacent grid i and this grid respectively, and wherein i=1,2,3.
Step 2-4: after selecting down hop grid, management node can select forward node collection in down hop grid, the selection standard of forward node collection can be adjusted according to practical application request, if this application needs high reliability, selects node bigger for PRRng in node adjacency grid as forward node collection；If it is considered that balancing energy then selects node that the energy value of node is bigger as forward node collection.In crossing multipath network encoding model, reliability tends to be guaranteed, so Energy Consumption Factors generally can be paid the utmost attention to, the present invention selects next-hop node collection by node energy priority principle, the node number of next-hop node collection is identical with multiple paths number, then management node can produce Path selection message Path_select, message format is Fig. 3 such as, and the management node of down hop grid sends.
Step 2-5: after the management node of down hop receives Path selection message, can inform that the corresponding forward node of this grid enters forwarding state according to Path selection message, after the confirmation message of forward node to be received, the forward node of meeting upper hop grid sends OK message, feeds them into data and sends state.Meanwhile this management node can judge whether the gradient of oneself is 1, and gradient is 1 represent route and terminate, management node can directly using sink as down hop, if gradient is not 1, sends path request message and repeat the flow process of step 2-2～step 2-4；
The workflow of whole step 2 is as shown in Figure 4 above.
Step 3: data transmission procedure；
Management node can inform the forward node of this grid at the forward node selecting down hop.When forward node is after the OK message that the management node receiving down hop sends, namely enter data transmission state.
The present invention adopts stochastic linear coding techniques here, and first raw data packets is divided into m group by source node, and generally taking m is 3.In order to ensure the success rate of the first jumping, k can be producedmIndividual coded data packet down hop sends.kmSize select take into account the success rate of the first jumping and the transmission energy consumption of source node equally, it is contemplated that the computing capability of sensor node, the present invention uses below equation to calculate kmValue:
km=| m/PRRgg|
kmRepresent the number of the coded data packet sent, PRRggFor the grid data bag probability of acceptance between this grid and down hop grid, m represents the group number that raw data packets is divided.Send packet be encoded after packet, its data packet format such as Fig. 5.
After each forward node receives packet, first group number can be judged, if a new group number, a memory space can be opened up for depositing this packet in memory block, the size of memory space is consistent with coding order number m, the corresponding life span t1 of each memory space；If existed before the group number received, then this packet is stored in the memory space of correspondence.
When meeting following condition, the packet of this memory space can be encoded forwarding by node: packet is filled with or arrives life span t1, and coding bag number is identical with memory space packet.Once these group data forward, forward node will record the group number forwarded, and just will not receive from the packet being marked with this group number later again.After these coded data packet finally pass to sink node, coding bag can, according to Gaussian elimination method, be decoded restoring initial data by sink.
Step 4: communication maintenance process；
Network needs to carry out the maintenance of a series of necessity upon initialization, it is ensured that system is properly functioning.In this agreement, route maintenance mainly has the work in following two.
Step 4-1: management node maintenance: management node is elected when initializing, carries the data transmission in the mutual of management information and necessary situation in network work later, can be easier to death than the energy that ordinary node is easier to consume.Each management node is adopted disaster recovery mechanism by this agreement, once its energy is in critical moribund condition, management node can inquire about the residue energy of node in this grid, choose the maximum node of dump energy as next management node, data backup and this node broadcast message are informed the management node of this grid node and adjacent grid.
Step 4-2: re-establishing of path: along with the network operation, the energy of node and link-quality all can be varied from, so the path set up only has the life span of T.Will carrying out a network operation every T time, including the optional set of node redefined in grid, PRR detects again, updates adjacent gridding information table with this.The value view network actual motion state of T and determine, if the Link State shakiness rule T of network takes smaller value, on the contrary desirable higher value.Assuming that the speed that source node is given out a contract for a project is μ, when network operation, the energy of optional node selects threshold value EthresholdExpression formula:
Ethreshold=μ T (ESD+ERX)
Wherein μ represents source node packet sending speed, T delegated path life span, ESDRepresentation node once sends the energy of consumption, ERXRepresentation node once receives the energy of consumption.Meeting dump energy and become optional node be more than or equal to the node of threshold value, management node also with the relevant information in the adjacent gridding information table of adjacent grid interactive modifying, and can re-establish path after network operation.

Claims (5)

1. a Wireless Sensor Network Routing Protocol realize method, it is characterised in that wireless sensor network is divided into little virtual grid based on geographical position by described method, among this grid use intersect multipath network code, comprise the steps:
Step 1: network model initializes；
Local node and Sink node communication, obtain the logic ID of place virtual grid, and complete the virtual grid to network's coverage area with this and divide；
Step 2: Route establishment process；
After netinit, when target area, event occurs, source node produce data need to sink transmit time, set up the intersecting paths of fixed number simultaneously；
Step 3: data transmission procedure；
Management node can inform the forward node of this grid at the forward node selecting down hop, when forward node is after the OK message that the management node receiving down hop sends, namely enters data transmission state；
Step 4: communication maintenance process；
Network needs to carry out the maintenance of a series of necessity upon initialization, makes system properly functioning.
2. a kind of Wireless Sensor Network Routing Protocol according to claim 1 realize method, it is characterised in that the step 1 of described method includes:
Step 1-1:Sink node broadcasts netinit packet；
Step 1-2: local node, after receiving the netinit packet of Sink node broadcast, obtains initialization data, and described initialization data includes Sink node numbering, Sink geographical position coordinates, virtual grid space D and time synchronization information；
Step 1-3: grid election management node；
Node, after knowing self grid ID, can wait that a time period τ (τ < t), t refer to that one takes turns the duration that competition is required at random, then send challenge message bag towards periphery, comprise grid ID and node ID in packet；If being previously received, sending competition bag, the competition bag that other node is sent, first can judge that whether grid ID is identical with self, differing, abandon, the conduct management node that the identical node ID then selected in competition package informatin is minimum, and abandon sending competition bag；By the time, after the t time, each node can send to management node and confirm message；After the management node of each grid is selected, also can exchange information between adjacent grid and tell the other side the ID of this mesh-managing node；
Step 1-4: obtain optional nodal information；
Management node elects and can send inquiry message to all nodes in this grid afterwards, and the energy value of oneself can be beamed back management node by node after receiving message；Owing to node energy each time initial is all full state, so all nodes can be counted optional set of node by management node；Except adding up the optional node of this grid, management node also can to the information of its optional node of adjacent trellis search, including node ID and residual energy value；
Step 1-5:PRR detects；
PRR refers to the packet probability of acceptance, method for surveying is management node is optional node distribution sending time slots, and each optional node sends to adjacent grid in self time slot and detects packet, comprises node ID in probe packets, source grid ID, source mesh-managing node ID and target gridding ID；The optional node of the adjacent grid of target can receive these probe packets, statistics receives the quantity from the not probe packets of homology grid respectively, finally these quantity informations are beamed back respectively the management node of respective source grid, management node is obtaining the management node ID of adjacent grid, the adjacent optional node ID of grid and energy, after the information of PRRng and PRRgg, namely complete the foundation of adjacent gridding information table.
3. a kind of Wireless Sensor Network Routing Protocol according to claim 1 realize method, it is characterised in that the step 2 of described method includes:
Step 2-1: source node calculates whether the grid Grad of self is 1, if being 1, then represents and directly communicates with sink, it is not necessary to set up route；If gradient is not 1, illustrating to need to forward through intermediate node, now source node sends path request message to the management node of this grid；
Step 2-2: after management node receives path request message, read stored gridding information table, judging whether the optional interstitial content adjacent grid more than path number, if there is no such grid then multipath is set up unsuccessfully, informs that source node selects single footpath mode to set up route；If there is such grid, enter step 2-3；
Step 2-3: management node calculates all weighted value cost satisfying condition grid, select the maximum grid of cost value as down hop grid, the calculating of the adjacent grid costi of i-th considers the factor of link circuit condition between grid energy, node number, grid, it may be assumed that
cos t i = E i N i &CenterDot; e &CenterDot; PRR g g ( i ) &CenterDot; &lsqb; S 0 - S i + 1 &rsqb;
PRRgg (i) represents the PRRgg between this grid and adjacent grid i, Ni represents the optional node number of adjacent grid i, Ei represents the optional node energy summation of adjacent grid i, e representation node primary power, Si and S0 represents the Grad of adjacent grid i and this grid respectively, wherein i=1,2,3；
Step 2-4: after selecting down hop grid, management node can select forward node collection in down hop grid, the selection standard of forward node collection is adjusted according to practical application request, if this application needs high reliability, selects node bigger for node adjacency data in grid bag probability of acceptance PRRng as forward node collection；If it is considered that balancing energy then selects node that the energy value of node is bigger as forward node collection；The node number of next-hop node collection is identical with multiple paths number, and then management node can produce Path selection message Path_select；
Step 2-5: after the management node of down hop receives Path selection message, can inform that the corresponding forward node of this grid enters forwarding state according to Path selection message, after the confirmation message of forward node to be received, the forward node of meeting upper hop grid sends OK message, feeds them into data and sends state；Meanwhile this management node can judge whether the gradient of oneself is 1, and gradient is 1 represent route and terminate, management node can directly using sink as down hop, if gradient is not 1, sends path request message and repeat the flow process of step 2-2～step 2-4.
4. a kind of Wireless Sensor Network Routing Protocol according to claim 1 realize method, it is characterised in that the step 3 of described method includes:
Adopting stochastic linear coding techniques, first raw data packets is divided into m group by source node, and taking m is 3；In order to ensure the success rate of the first jumping, k can be producedmIndividual coded data packet down hop sends；kmSize select take into account the success rate of the first jumping and the transmission energy consumption of source node equally, it is contemplated that the computing capability of sensor node, use below equation calculate kmValue, it may be assumed that
km=| m/PRRgg|
PRR is the grid PRR between this grid and down hop gridgg；Send packet be encoded after packet, after each forward node receives packet, first group number can be judged, if a new group number, a memory space can be opened up for depositing this packet in memory block, the size of memory space is consistent with coding order number m, the corresponding life span t1 of each memory space；If existed before the group number received, then this packet is stored in the memory space of correspondence；
When meeting following condition, the packet of this memory space can be encoded forwarding by node: packet is filled with or arrives life span t1, and coding bag number is identical with memory space packet；Once these group data forward, forward node will record the group number forwarded, and just will not receive from the packet being marked with this group number later again；After these coded data packet finally pass to sink node, coding bag can, according to Gaussian elimination method, be decoded restoring initial data by sink.
5. a kind of Wireless Sensor Network Routing Protocol according to claim 1 realize method, it is characterised in that the step 4 of described method includes:
Step 4-1: management node maintenance；Management node is elected when initializing, network work later carries the data transmission in the mutual of management information and necessary situation, death can be easier to than the energy that ordinary node is easier to consume, each management node is adopted disaster recovery mechanism by the agreement of described method, once its energy is in critical moribund condition, management node can inquire about the residue energy of node in this grid, choose the maximum node of dump energy as next management node, data backup and this node broadcast message are informed the management node of this grid node and adjacent grid；
Step 4-2, re-establishing of path；Along with the network operation, the energy of node and link-quality all can be varied from, so the path set up only has the life span of T；Will carrying out a network operation every T time, including the optional set of node redefined in grid, PRR detects again, adjacent gridding information table is updated with this, the value view network actual motion state of T and determine, if the Link State shakiness rule T of network takes smaller value, on the contrary desirable higher value；Assuming that the speed that source node is given out a contract for a project is μ, when network operation, the energy of optional node selects threshold value EthresholdExpression formula, it may be assumed that
Ethreshold=μ T (ESD+ERX)
Meeting dump energy and become optional node be more than or equal to the node of threshold value, management node also with the relevant information in the adjacent gridding information table of adjacent grid interactive modifying, and can re-establish path after network operation.
CN201610082708.5A 2016-02-05 2016-02-05 Wireless sensor network multipath routing protocol realization method Pending CN105764084A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610082708.5A CN105764084A (en) 2016-02-05 2016-02-05 Wireless sensor network multipath routing protocol realization method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610082708.5A CN105764084A (en) 2016-02-05 2016-02-05 Wireless sensor network multipath routing protocol realization method

Publications (1)

Publication Number Publication Date
CN105764084A true CN105764084A (en) 2016-07-13

Family

ID=56329688

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610082708.5A Pending CN105764084A (en) 2016-02-05 2016-02-05 Wireless sensor network multipath routing protocol realization method

Country Status (1)

Country Link
CN (1) CN105764084A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106488482A (en) * 2016-09-12 2017-03-08 西安电子科技大学 Wireless sensor network optimizing method based on multi-Agent evolutionary Algorithm
CN106954242A (en) * 2017-02-24 2017-07-14 航天东方红卫星有限公司 A kind of satellite distributed dynamic multi-path method for routing based on network code
CN107547268A (en) * 2017-08-11 2018-01-05 昆明理工大学 A kind of mobile energy supplement method based on virtual backbone network
CN110223061A (en) * 2019-05-30 2019-09-10 杭州李奥信息科技有限公司 Gas station's wireless communication method
CN115801658A (en) * 2022-09-30 2023-03-14 哈尔滨工业大学 Network routing communication method based on geographic grids

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102595504A (en) * 2012-02-24 2012-07-18 南京理工大学 Dynamic multi-path OLSR (Optimized Link State Routing) routing method based on link congestion degree
KR20140074526A (en) * 2012-12-10 2014-06-18 동명대학교산학협력단 Localization Method for Wireless Sensor Network

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102595504A (en) * 2012-02-24 2012-07-18 南京理工大学 Dynamic multi-path OLSR (Optimized Link State Routing) routing method based on link congestion degree
KR20140074526A (en) * 2012-12-10 2014-06-18 동명대학교산학협력단 Localization Method for Wireless Sensor Network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
杜蔚琪（VICKY DU）: "基于网络编码的无线传感网多径路由协议的设计与实现", 《中国优秀硕士学位论文全文数据库（电子期刊）》 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106488482A (en) * 2016-09-12 2017-03-08 西安电子科技大学 Wireless sensor network optimizing method based on multi-Agent evolutionary Algorithm
CN106488482B (en) * 2016-09-12 2019-05-24 西安电子科技大学 Wireless sensor network optimizing method based on multi-Agent evolutionary Algorithm
CN106954242A (en) * 2017-02-24 2017-07-14 航天东方红卫星有限公司 A kind of satellite distributed dynamic multi-path method for routing based on network code
CN106954242B (en) * 2017-02-24 2020-04-10 航天东方红卫星有限公司 Satellite distributed dynamic multipath routing method based on network coding
CN107547268A (en) * 2017-08-11 2018-01-05 昆明理工大学 A kind of mobile energy supplement method based on virtual backbone network
CN110223061A (en) * 2019-05-30 2019-09-10 杭州李奥信息科技有限公司 Gas station's wireless communication method
CN115801658A (en) * 2022-09-30 2023-03-14 哈尔滨工业大学 Network routing communication method based on geographic grids

Similar Documents

Publication Publication Date Title
CN105764084A (en) Wireless sensor network multipath routing protocol realization method
CN103905306B (en) A kind of route exchanging method suitable for GEO/LEO bilayer Constellation Networks
CN101729331B (en) Clustering method and device, routing method and device of cluster head and base station
CN102448138B (en) Method for clustering hierarchical routing protocols of wireless sensor network
CN102316546B (en) Multipath routing method based on communication sequence
CN106100720B (en) The fast route convergence optimization method of LEO/MEO satellite network
CN107453801A (en) A kind of Layered Multipath method for routing towards satellite network
CN104639552A (en) Linked network wireless high-speed communication protocol
CN108174412A (en) A kind of RPL multi-path data transmission mechanisms of load balancing
CN102036338A (en) Sensor network real-time routing method based on data-driven link estimation
CN106792973A (en) Cluster head election and its shift process in a kind of energy heterogeneous wireless sensor network
CN103561445A (en) Wireless sensor network multi-path routing method based on network coding
CN105897577B (en) A kind of immune method for repairing route of rechargeable wireless sensor network
CN105764114A (en) Underwater wireless sensor network topology control method based on balanced energy consumption
CN107360612A (en) A kind of data transmission method of the wireless sensor network based on ant colony multipath
Han et al. Time-varying topology model for dynamic routing in LEO satellite constellation networks
CN103929782A (en) Resource leveling multi-path routing method applicable to industrial wireless sensor network
CN104135751A (en) Non-uniform clustering routing method suitable for subway tunnel
CN103763751B (en) Data transmission method and system of wireless sensor network
CN102857989A (en) Self-adaptive routing method oriented to mobile sensor network
CN106358256B (en) A kind of multirobot control coordinator&#39;s production method
CN102983948B (en) A kind of radio sensing network self-adaption cluster transmission method and device thereof
Biradar et al. Agent-driven backbone ring-based reliable multicast routing in mobile ad hoc networks
CN104601306A (en) Link retransmission method in wireless sensor network
Wei et al. Network Coding Based Reliable Multi-path Routing in Wireless Sensor Network

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20160713

RJ01 Rejection of invention patent application after publication