CN104320829A - Multi-hop self-organizing sleep routing algorithm - Google Patents
Multi-hop self-organizing sleep routing algorithm Download PDFInfo
- Publication number
- CN104320829A CN104320829A CN201410631017.7A CN201410631017A CN104320829A CN 104320829 A CN104320829 A CN 104320829A CN 201410631017 A CN201410631017 A CN 201410631017A CN 104320829 A CN104320829 A CN 104320829A
- Authority
- CN
- China
- Prior art keywords
- node
- routing
- data
- networking
- 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.)
- Granted
Links
Classifications
-
- 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/246—Connectivity information discovery
-
- 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/02—Power saving arrangements
- H04W52/0203—Power saving arrangements in the radio access network or backbone network of wireless communication networks
- H04W52/0206—Power saving arrangements in the radio access network or backbone network of wireless communication networks in access points, e.g. base stations
-
- 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)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a multi-hop self-organizing sleep routing algorithm which is applicable to the areas such as an underground goaf of a coal mine. The multi-hop self-organizing sleep routing algorithm is a synchronous routing algorithm which is small in energy consumption and balanced in load. An entire wireless sensor network is initiated and established by a coordinator node, a coordinator sends a 'networking message', other nodes forward the 'networking message' after receiving the 'networking message', a source node which sends the 'networking message' is used as the upstream node of the node, the data of the node are uploaded, the data sent from other nodes are forwarded through the upstream node of the node, and all information is finally converged on the coordinator node. Networking and data uploading are achieved through downstream forwarding of the 'networking message' and the uploading of the data. The networking process is actually the process of generating a latest routing table, and the organized network has good environmental adaptation, survivability and flexibility. The multi-hop self-organizing sleep routing algorithm is suitable for networking of the wireless sensor network under the condition that a communication environment changes dramatically.
Description
Technical field
The present invention relates to the routing algorithm of wireless sensor network, the multi-hop ad hoc of especially low energy consumption can dormancy routing algorithm.
Background technology
In the routing algorithm of traditional wireless sensor network, usually the type of node be divided three classes, the first kind is Sink node, i.e. coordinator node, and the effect of Sink node is the responsible foundation of whole network, the convergence of sensing data, router-level topology and control; Equations of The Second Kind is routing node, and routing node image data can play again the effect of route, needs work for a long time to come to keep network unimpeded, and this category node cannot dormancy in sensor network; 3rd class is terminal node, and the function of this category node only has the function of data acquisition and data upload, does not possess routing function, and this category node can dormancy.Obviously, under classical routing algorithm for wireless sensor, routing node and coordinator node all need to keep operating state for a long time, can not dormancy.For colliery, subsurface environment is complicated, and needs a lot of regions disposing sensor node to power for a long time, such as, disposes sensor network nodes in coal mine gob, due to the slump in goaf, battery can only be adopted to carry out disposable power supply.In the monitoring sensor network of goaf, in order to ensure that extend the operating time of network, sensor node needs dormancy under certain energy supply.Obviously, the routing algorithm of traditional wireless sensor network cannot meet colliery actual demand.
Summary of the invention
The object of the invention is to: propose a kind of be applicable to multi-hop ad hoc that the region such as coal mine gob uses can dormancy routing algorithm, the characteristic of routing node and terminal node combines by this algorithm, both the reliability of its transfer of data and forwarding capability had been ensured, node dormancy when not enabling can be enable again, reduce the expense of energy, solve traditional wireless sensor networks routing node power consumption too high, cannot dormancy problem, meet the data transportation requirements of long period low traffic.
To achieve the above object of the invention, technical scheme of the present invention is achieved in that a kind of multi-hop ad hoc can dormancy routing algorithm, it is characterized in that the whole communication process of this routing algorithm forms by with the next stage: (1) coordinator node initiates the networking commands stage to routing node; (2) the routing node networking stage; (3) data uplink and the downlink transfer stage; (3) the net dormancy stage.
Further, the described routing node networking stage comprises following concrete steps:
Step 1-1: when each communication cycle starts, is broadcasted one " networking message " by the coordinator node in network, and message content comprises self address information, the energy intensity value of self and signal strength values;
Step 1-2: when network routing nodes receives " networking message " for the first time in a communication cycle, start a Local Area Networking timer immediately, this networking timer is for limiting the maximum time in networking stage; When this node first time receives " networking message ", then open this timer, and countdown, after having countdowned, then declare that the networking process of this routing node terminates;
Step 1-3: before end countdowned by step 1-2 networking timer, this routing node is after receiving " networking message ", energy intensity value in described " mesh information " and signal strength values are weighted and on average obtain Route Selection value, this value compares with the every bar energy in self routing table and signal strength signal intensity weighted value:
If the routing iinformation number in this node route list is less than three, then register destination address, energy and signal strength information in the routing table; During registration routing table, the weighted value of the address information of destination node, energy and signal strength signal intensity is arranged by ascending order and stores; If the routing iinformation number in routing table is more than or equal to three and the weighted value newly the entering routing iinformation weighted value that is greater than in routing table minimum one, then need to upgrade routing table; When upgrading routing table, in original routing table, energy and the minimum routing iinformation of signal strength signal intensity weighted value are by deleted, newly enter the routing iinformation of routing iinformation and reservation, mode arrange according to the size ascending order of weighted value, renewal routing table;
If the routing iinformation number in routing table is more than or equal to three and the weighted value newly the adding information weighted value that is less than in routing table minimum one, then without the need to upgrading the information in routing table;
Step 1-4: after step 1-3 completes, this routing node send this node unique once " networking message ", with the networking process of triggering following routing node; Repeat " networking message " that step 1-3 continues to wait for that other node is sent, the more routing table of new node;
Step 1-5: in step 1-2, if the timing of networking timer terminates, then close the networking function of this routing node, this node no longer accepts and processes " networking message ", and the routing table of this node no longer upgrades.
Further, routing node comprises following step at data transfer phase:
Step 2-1: after step 1-5 completes, networking timer resets, this routing node generates " Frame " according to the specification of IEEE802.15.4, according to the up routing table of generated node, choose the maximum upstream node of weighted value in routing table as up routing node address, automatically to up transmission one minor node its data i.e. " Frame "; After transmission " Frame ", node needs to wait for that upstream node replys " confirmation receipt message ";
Step 2-2: in step 2-1, if the node sending data does not receive " the confirmation receipt message " of upstream node, then node needs to this upstream node retransmission data, if still without receiving " confirming reception information ", again retransmit " Frame ", until the number of times repeating to send equals K time, wherein, K is not more than five times, then decision data sends unsuccessful; If the node sending data receives upstream node " confirm reception information ", then this secondary data sends and terminates;
Step 2-3: in step 2-2, if destination node is more than K time, retransmit and still do not reply, then routing node needs again to choose upstream node, in this routing node routing table, deletes and sends unsuccessful upstream node address; Routing node chooses the new upper row address of maximum one of weighted value in the routing table according to the size of weighted value again, this routing node address is sent the up routing node address of data as this time, Frame is generated according to the specification of IEEE802.15.4, and resend data according to the data transmission procedure of step 2-1, and wait for that Correspondent Node confirms to receive reply, if Correspondent Node confirms to receive, decision data sends successfully; If upstream node is not replied " acknowledging receipt of message ", then, according to step 2-2, resend " Frame " to upstream node; If after retransmitting " Frame ", receive " acknowledging receipt of message " that Correspondent Node sends, then decision data sends successfully; If still acknowledge receipt of message without receiving ", again retransmit " Frame ", until the number of times repeating to send equals K time, then decision data transmission is unsuccessful;
Step 2-4: up routing node after receiving " Frame ", then searches self up routing table, forwards " Frame " according to 2-2 principle.
Step 2-5: at data transfer phase, if node receives " control message frame " from telegon, first judges that whether destination address is consistent with Self address; If consistent, then node transmits relevant data according to the content of control message or performs relevant instruction; If inconsistent, then forward with broadcast mode and be somebody's turn to do " control message frame "; Next judges jumping figure, if the jumping figure being somebody's turn to do " control message frame " reaches maximum hop count, abandons this control message; If do not reach maximum hop count, broadcast forwarding.
Further, this coordinator node comprises following step at data transmission procedure:
Step 4-1: as described in step 1-1, after initiation networking process, coordinator node is just in data transmission procedure, the data that other node of wait-receiving mode is uploaded;
Step 4-2: in step 4-1, after often receiving one " Frame ", coordinator node just starts a Data Timer, carry out timer counter, if have received before timing terminates next " Frame ", counter reset, and " Frame " content is stored, if the source node of these data is newly added nodes, in the network registration table of coordinator node, then register the address information of this source node, if there is the address information of this source node, then need not register in network node registration form; If Data Timer is timed to, then judges that this secondary data receives and terminate;
Step 4-3: in the process of transfer of data, if telegon needs the state asking for data or Controlling vertex to a certain node, then needs to send " control message " to this node; When coordinator node sends " control message ", need to reset Data Timer, ensure that coordinator node is still in data transmission procedure; " control message " is sent by the mode of broadcast, containing destination node address information in " control message ", after other node receives, judges whether identical with own node address, if address information is not identical with self, forwards, until be communicated to destination node; If the address information in judgement control message is consistent with own node address, then perform according to the instruction in control message; " this control message " regulation has maximum hop count M, and after forwarding is more than M number, follow-up no longer forwarding is somebody's turn to do " control message "; Telegon, after transmission " control message ", waits for that Correspondent Node replys " data-message "; If the Data Timer time arrives, then judge that this secondary data receives and terminate, telegon no longer waits for that Correspondent Node is replied.
Further, node dormancy process comprises following step:
Step 3-l: arrive when the Data Timer time, then after telegon thinks that data transmission procedure terminates, coordinator node to the whole network broadcast transmission " sleep messages ", with timestamp in sleep messages, meanwhile, coordinator node backup network node registration form; Other node after the sleep messages receiving broadcast according to the time in timestamp, after considering transmission delay, setting dormancy time, and " sleep messages " is somebody's turn to do in broadcast forwarding, then close wireless receiving and dispatching and associated peripheral circuits and empty routing table, a communication cycle declares the closing of, and enters resting state, and according to the dormancy time of agreement, each node is revived voluntarily.
Further, the computational methods of the weighted value in described step 1-3 are as follows: weighted value=a* cell voltage+b* signal strength signal intensity; Described a>0 is the proportion of cell voltage in weighted value, and b>0 is the proportion that signal strength signal intensity accounts for weighted value, and a+b=1.
Advantage of the present invention is: the energy ezpenditure of whole network can reduce by the method, extends the life cycle of whole sensor network, has better adaptability, flexibility and survivability in route.
Accompanying drawing explanation
Fig. 1 is the process that routing table is set up in coordinator node broadcast;
Fig. 2 and Fig. 3 is the process that routing node networking and broadcast forward mesh information;
Fig. 4 and Fig. 5 is the typical network configuration of one that this routing algorithm is formed;
Fig. 6 is a kind of typical path of node upstream data communication process;
The flow chart of Fig. 7 node networking;
The flow chart of the general node reception of Fig. 8 and forwarding data;
The flow chart of the reception of Fig. 9 coordinator node and forwarding data;
The general node of Figure 10 sends the flow chart of data;
The flow chart of the general node dormancy process of Figure 11;
The flow process that Figure 12 telegon data transmission procedure transmits control message.
Embodiment
Below by embodiment, and by reference to the accompanying drawings, technical scheme of the present invention is described in further detail.Should be understood that these embodiments only for illustration of the present invention instead of for limiting the scope of the invention.
Embodiment: the multi-hop ad hoc of the present embodiment can be similar to flooding by dormancy routing algorithm, but send data to coordinator node is all single-point direction propagation at every turn, needs networking, carry out transmission data again after networking before communication; That is, if need between wireless sensor network node to carry out transfer of data, first networking is needed, node preserves the upstream node routing iinformation going upward to telegon direction separately around, carry out according to routing iinformation and weighted value choosing the upstream node sending data, the forwarding of data is carried out in the connection (information in routing table) that the intermediate node receiving data is set up according to himself; Final data converges at coordinator node, and this route pattern is implemented to dispose in conjunction with the inserting knot mode of colliery restricted clearance and underground coal mine environmental characteristics.
The routing table that each node is preserved in a communication cycle, this routing table comprises the weighted value that the address of destination node, the address of next-hop node, the magnitude of voltage of next-hop node and signal strength values and magnitude of voltage and signal strength values generate, this weighted value is used for when transfer of data, relatively and determine to use in data transfer direction, the routing condition of this up route of the larger expression of weighted value is better, is more suitable for transmitting.
So far can find out this routing algorithm at least comprise following some: one, when each communication cycle starts, need to re-establish route, route has good real-time, and at the end of communication cycle, need current routing table to remove; They are two years old, in view of underground coal mine restricted clearance radio condition is severe, go upward to telegon direction and adopt the mode of routing forwarding to transmit data, descending issue an order all adopts the mode of broadcast, broadcast mode keeping system redundancy can improve stability, and up fixed point is uploaded and be ensure that certain efficiency of transmission; Its three, at the end of a communication cycle, the general node in system all need close radio function, enter resting state, the life-span of node can be extended as much as possible.
Be the algorithmic procedure of route networking as shown in Figure 1, Figure 2, Figure 3 shows, in Fig. 1, coordinator node initiates the process of a networking, neighbor node around enters the wait time slot of networking after receiving the request of networking, and by the message of coordinator node stored in routing table, and starting timer, after wait networking timing terminates, the networking process of this node ends.Neighbor node around these telegons is after the timing of networking timer terminates, also a networking can be initiated to the surrounding neighbours node of self, send a networking message, do not carry out the routing node of networking process after receiving networking message around, similarly, also the address of node information initiating networking will be stored in the routing table, and calculate the energy of networking message and the weighted value of signal strength signal intensity according to the energy comprised in networking message and signal strength values, as the weighted value of this upstream node, weigh the reliability of transmission, and store three the highest upstream node addresses of weighted value in the routing table, save Internet resources.
When the networking process of this node ends, this node just enters data transfer phase, according to the route entry in routing table, selects the upstream node address that weighted value is the highest, and sends to it data needing transmission.After end of transmission, wait for upstream node response confirmation of receipt frame, after confirming data receiver, just declare that current transmission process terminates.If upstream node does not reply confirmation of receipt, then restart data transfer procedure, delete this route upstream node information first in the routing table, in remaining node, select the highest node of weighted value carry out transfer of data, similarly, after transfer of data, wait for upstream node response confirmation of receipt frame.Due to operating time and energy quantitative limitation, restart data transfer procedure and only carry out three times.After third time restarts data transfer procedure failure, then declare bust this, do not reattempt data retransmission.Similarly, in the process of forwarding data, node can correct the address information needing to transmit upstream node in data, changes self up address into, then sends to self upper row address.Wherein, the data structure of networking message is as shown in table 1:
The data structure of table 1 networking message
| Energy intensity value | Frame length | Frame type | Telegon address | Node address | Check field |
| 100 | ? | 01 | 0003 | xxxx | ? |
Networking message comprises the energy intensity value of the node of initiating networking, and the telegon address of network residing for this node and node Self address, signal strength values is then generated by recipient when node receives.
In the process of transfer of data, if when coordinator node needs to ask for the operating state of data or Controlling vertex to a certain node, then need to transmit control message to this node.When coordinator node transmits control message, need to reset Data Timer, ensure that coordinator node is still in data transmission procedure.Control message is sent by the mode of broadcast, containing partner address information in control message, after other node receives, judge whether identical with own node address, if address information is not identical with self, forward, until be communicated to destination node, if judge, the address information in control message is consistent with own node address, then perform according to the instruction in control message.In order to not allow control message unrestrictedly broadcast in the entire network, so need to set a life cycle to control message, this life cycle is weighed with jumping figure.When coordinator node transmits control message, in control message, add current jumping figure and maximum hop count, maximum hop count routing node can be waited just to abandon this control message if current jumping figure is greater than.Wherein, control message is as shown in table 2.
Table 2 control message
| Energy intensity value | Frame length | Frame type | Telegon address | Node address | Data content | Maximum hop count | Current jumping figure | Check field |
| 100 | ? | 05 | 0003 | 0000 | ? | ? | ? | ? |
Must see, the energy resource of routing node remains very limited, and for cost consideration, the storage resources of routing node is also limited, and the routing iinformation amount that each node stores also limits to some extent.When preserving routing iinformation, above just more upstream node can not be had again in limited time when reaching to preserve, in order to mate operating time and energy and ensure the reliability of internal resource, we set up routing address number is three, when the 4th routing iinformation arrives, first calculate the weighted value of this routing iinformation, if higher than the lower routing iinformation of weighted value in routing table, then replace routing iinformation, the total number in routing table still remains three.
When general node receives the data that other node sends, preferentially choose the highest routing iinformation of weighted value according to from routing table, give upper row address by data retransmission.After data retransmission, node can wait for that the other side confirms the message received, if Correspondent Node receives successfully, can reply the message confirming to receive, and node, after the message receiving the confirmation reception, declares this repeating process success.If when not receiving the message confirming to receive in certain hour, then after some time, restart repeating process, these data chosen other in routing table again, repeats repeating process.When the unsuccessful number of times of forwarding then stops current repeating process more than three times, in order to not cause message system chaotic, this message be forwarded will be dropped.Wherein, node data frame data structure is as shown in table 3.
table 3node data frame data structure
| Energy intensity | Frame length | Frame type | Telegon address | Sensor address | Upstream node address | Data content | Check field |
| 100 | 0x0d | 00 | 0003 | Xxxx | ? | ? | ? |
Coordinator node, after receiving data message, carries out Storage and Processing.Coordinator node is registered the address information in the data message come, and forms a network node registration form.Can communicate to one of them node in network separately at data transfer phase telegon, transmit control message to the arbitrary node existed in network node registration form.The mode of the descending searching node of telegon is broadcast, containing partner address information in control message, after other node receives, judge whether identical with own node address, if address information is not identical with self, forward, until be communicated to destination node, if judge, the address information in control message is consistent with own node address, then perform according to the instruction in control message.And this control message has maximum hop count, after forwarding exceedes certain number of times, node then abandons this control message.
All complete in the process of networking, transfer of data, telegon no longer receives new data message after wait Data Timer zero, then telegon declares that this communication cycle terminates, coordinator node is to the whole network broadcast transmission dormancy instruction, the time span of dormancy is comprised in dormancy instruction, all nodes in informing network enter resting state, and are revived voluntarily by each node according to the time of agreement.Other node in network is after the networking process instruction receiving coordinator node transmission, stop all operations carried out at present, broadcast forwards dormancy instruction, to reach the object of dormancy node diffusion, after being sent, closing self peripheral circuit and wireless transmitter, setting according to the time span of agreement and start doze output, entering park mode, and automatically revive according to the time of agreement, enter normal operating conditions.Wherein, the data structure of sleep messages is as shown in table 4.
The data structure of table 4 sleep messages
| Energy intensity | Frame length | Frame type | Telegon address | Sensor address | Check field |
| 100 | 0x0d | 02 | 0003 | xxxx | ? |
Several typical network topology structure that Fig. 4, Fig. 5 and Fig. 6 build under representing this routing algorithm, illustrates the mode of data uplink process, and finally converges at the characteristic of telegon.Fig. 7 is node networking process, the time span of this process is by networking Timer Controlling, the timing of networking timer terminates networking process and namely terminates, and the networking message received therebetween all can be used to compare and screen and routing table under final this node current communication cycle of generation.Fig. 8 is the flow chart of the reception of general node and forwarding data.Fig. 9 is the flow chart of coordinator node reception and forwarding data.Figure 10 is the flow chart that general node sends data.Figure 11 is the flow chart of general node dormancy process.Figure 12 is the flow process transmitted control message in telegon data transmission procedure.
The communication cycle of each node is from reviving, experience networking, transfer of data, dormancy three processes.It is spread towards periphery from telegon that whole network is formed, until arrive the node of distalmost end, forms a complete wireless sensor network.
Each node in network has unique address, this address as the unique identification of node for distinguishing other node.
Routing algorithm is the process based on networking:
Step 1-1: when each communication cycle starts, is broadcasted one " networking message " by the coordinator node in network, and message content comprises self address information, the energy information of self.
Step 1-2: when other node (routing node) in network receives " networking message " for the first time in a communication cycle, start a Local Area Networking timer immediately, this networking timer is for limiting the maximum time in networking stage, this time is a determined value, when this node first time receives " networking message ", then open this timer, and countdown, after having countdowned, then declare that the networking process of this routing node terminates.
Before step 1-3: step b networking timer is countdowned and is terminated, this routing node is after receiving networking message, energy and signal strength signal intensity are weighted on average, obtain Route Selection value, the every bar energy in this value and self routing table and signal strength signal intensity weighted value are compared.
If the routing iinformation number in this node route list is less than three, then registered address information and energy information in the routing table, during registration routing table, arranges the weighted value of the address information of destination node and energy and signal strength signal intensity by ascending order and stores.
If the routing iinformation number in routing table is more than or equal to three and the weighted value newly the entering routing iinformation weighted value that is greater than in routing table minimum one, then need to upgrade routing table.When upgrading routing table, in original routing table, energy and the minimum routing iinformation of signal strength signal intensity weighted value are by deleted, newly enter the routing iinformation of routing iinformation and reservation, mode arrange according to the size ascending order of weighted value, renewal routing table.
If the routing iinformation number in routing table is more than or equal to three and the weighted value newly the adding information weighted value that is less than in routing table minimum one, then without the need to upgrading the information in routing table, and current this is newly added information abandon.
Step 1-4: after step 2-3 completes, this routing node send this node unique once " networking message ", with the networking process of triggering following routing node; Turn " networking message " that 2-3 continues to wait for that other nodes are sent, the more routing table of new node simultaneously.
Step 1-5: in step 2-2, if the timing of networking timer terminates, then close the networking function of this routing node, this node no longer accepts and processes " networking message ", and the routing table of this node no longer upgrades.Networking message processing procedure as shown in Figure 7.
The process that routing node sends data and reception data at data transfer phase is as follows:
Step 2-1: after step 1-5 completes, networking timer resets, this routing node generates " Frame " according to the specification of IEEE802.15.4, according to the up routing table of generated node, choose the maximum upstream node of weighted value in routing table as up routing node address, automatically to up transmission one minor node its data.After transmission Frame, node needs to wait for that destination node replys the message confirming to receive.
Step 2-2: in step 2-1, if the node sending data does not receive the message that Correspondent Node acknowledges receipt of, then node needs to this Correspondent Node retransmission data, if still without receiving confirmation, retransmission data again, until the number of times repeating to send equals K time (K generally elects five times as), then decision data transmission is unsuccessful.
If the node sending data receives the message that Correspondent Node acknowledges receipt of data, then this secondary data sends and terminates.
Step 2-3: in step 2-2, if destination node more than K time (K generally elects five times as) retransmit still do not reply, then node needs again to choose upstream node, in this node route list, delete send unsuccessful upstream node address.Node chooses the new upper row address of maximum one of weighted value in the routing table according to the size of weighted value again, this node address is sent the up routing node address of data as this time, Frame is generated according to the specification of IEEE802.15.4, and resend data according to the data transmission procedure of step 3-1, and wait for that Correspondent Node confirms to receive reply, if Correspondent Node confirms to receive, decision data sends successfully.
If Correspondent Node is not replied " acknowledging receipt of message ", then, according to step 3-2, resend data to Correspondent Node.If after retransmission data, receive the message of " acknowledging receipt of " that Correspondent Node sends, then decision data sends successfully.If still without receiving confirmation, retransmission data again, until the number of times repeating to send equals K time, then decision data transmission is unsuccessful.
The up routing node of step 2-4 after receiving " Frame ", then searches self up routing table, forwards " Frame " according to 3-2 principle.
Step 2-5: at data transfer phase, if node receives " control message frame " from telegon, first judge that whether destination address is consistent with Self address: if consistent, then node transmits relevant data according to the content of control message or performs relevant instruction.If inconsistent, then forward with broadcast mode and be somebody's turn to do " control message frame ".Next judges jumping figure, wherein, jumping figure be data arrive destination node the number of node of process, often just add one through a node jumping figure, until arrive destination node, if the jumping figure of " control message frame " maximum hop count should be reached, abandon this control message.If do not reach maximum hop count, broadcast forwarding.
Coordinator node is as follows at data transmission procedure:
Step 4-1: as described in step 1-1, after initiation networking process, coordinator node is just in data transmission procedure, the data that other node of wait-receiving mode is uploaded.
Step 4-2: in step 4-1, after often receiving one " Frame ", coordinator node just starts a Data Timer, carry out timer counter, if have received before timing terminates next " Frame ", counter reset, and data content is stored, if the source node of these data is newly added nodes, in the network registration table of coordinator node, then register the address information of this source node, if there is the address information of this source node, then need not register in network node registration form.If Data Timer is timed to, then judges that this secondary data receives and terminate.
Step 4-3: in the process of transfer of data, if telegon needs the state asking for data or Controlling vertex to a certain node, then needs to transmit control message to this node.When coordinator node transmits control message, need to reset Data Timer, ensure that coordinator node is still in data transmission procedure.Control message is sent by the mode of broadcast, containing partner address information in control message, after other node receives, judge whether identical with own node address, if address information is not identical with self, forward, until be communicated to destination node, if judge, the address information in control message is consistent with own node address, then perform according to the instruction in control message.And this control message has maximum hop count, after forwarding exceedes certain number of times, node then abandons this control message.After transmitting control message, telegon waits for that Correspondent Node replys data and message.If the Data Timer time arrives, then judge that this secondary data receives and terminate, telegon no longer waits for that Correspondent Node is replied.
The step of node dormancy process is as follows:
Step 3-l: arrive when the Data Timer time, then after telegon thinks that data transmission procedure terminates, coordinator node to the whole network broadcast transmission " sleep messages ", with timestamp in sleep messages, meanwhile, coordinator node backup network node registration form.Other node sets dormancy time according to the time in timestamp after the sleep messages receiving broadcast, and broadcast forwards this sleep messages, then close wireless receiving and dispatching and associated peripheral circuits and empty routing table, a communication cycle declares the closing of, and enters resting state.And according to the dormancy time of agreement, each node is revived voluntarily.
The computational methods of weighted value are as follows: weighted value=a* cell voltage+b* signal strength signal intensity, and described a is the proportion of cell voltage in weighted value, and b is the proportion that signal strength signal intensity accounts for weighted value; And a+b=1.
Claims (6)
1. multi-hop ad hoc can dormancy routing algorithm, it is characterized in that the whole communication process of this routing algorithm forms by with the next stage: (1) coordinator node initiates the networking commands stage to routing node; (2) the routing node networking stage; (3) data uplink and the downlink transfer stage; (3) the net dormancy stage.
2. multi-hop ad hoc according to claim 1 can dormancy routing algorithm, it is characterized in that the described routing node networking stage comprises following concrete steps:
Step 1-1: when each communication cycle starts, is broadcasted one " networking message " by the coordinator node in network, and message content comprises self address information, the energy intensity value of self and signal strength values;
Step 1-2: when network routing nodes receives " networking message " for the first time in a communication cycle, start a Local Area Networking timer immediately, this networking timer is for limiting the maximum time in networking stage; When this node first time receives " networking message ", then open this timer, and countdown, after having countdowned, then declare that the networking process of this routing node terminates;
Step 1-3: before end countdowned by step 1-2 networking timer, this routing node is after receiving " networking message ", energy intensity value in described " mesh information " and signal strength values are weighted and on average obtain Route Selection value, this value compares with the every bar energy in self routing table and signal strength signal intensity weighted value:
If the routing iinformation number in this node route list is less than three, then register destination address, energy and signal strength information in the routing table; During registration routing table, the weighted value of the address information of destination node, energy and signal strength signal intensity is arranged by ascending order and stores; If the routing iinformation number in routing table is more than or equal to three and the weighted value newly the entering routing iinformation weighted value that is greater than in routing table minimum one, then need to upgrade routing table; When upgrading routing table, in original routing table, energy and the minimum routing iinformation of signal strength signal intensity weighted value are by deleted, newly enter the routing iinformation of routing iinformation and reservation, mode arrange according to the size ascending order of weighted value, renewal routing table;
If the routing iinformation number in routing table is more than or equal to three and the weighted value newly the adding information weighted value that is less than in routing table minimum one, then without the need to upgrading the information in routing table;
Step 1-4: after step 1-3 completes, this routing node send this node unique once " networking message ", with the networking process of triggering following routing node; Repeat " networking message " that step 1-3 continues to wait for that other node is sent, the more routing table of new node;
Step 1-5: in step 1-2, if the timing of networking timer terminates, then close the networking function of this routing node, this node no longer accepts and processes " networking message ", and the routing table of this node no longer upgrades.
3. multi-hop ad hoc according to claim 2 can dormancy routing algorithm, it is characterized in that routing node comprises following step at data transfer phase:
Step 2-1: after step 1-5 completes, networking timer resets, this routing node generates " Frame " according to the specification of IEEE802.15.4, according to the up routing table of generated node, choose the maximum upstream node of weighted value in routing table as up routing node address, automatically to up transmission one minor node its data i.e. " Frame "; After transmission " Frame ", node needs to wait for that upstream node replys " confirmation receipt message ";
Step 2-2: in step 2-1, if the node sending data does not receive " the confirmation receipt message " of upstream node, then node needs to this upstream node retransmission data, if still without receiving " confirming reception information ", again retransmit " Frame ", until the number of times repeating to send equals K time, wherein, K is not more than five times, then decision data sends unsuccessful; If the node sending data receives upstream node " confirm reception information ", then this secondary data sends and terminates;
Step 2-3: in step 2-2, if destination node is more than K time, retransmit and still do not reply, then routing node needs again to choose upstream node, in this routing node routing table, deletes and sends unsuccessful upstream node address; Routing node chooses the new upper row address of maximum one of weighted value in the routing table according to the size of weighted value again, this routing node address is sent the up routing node address of data as this time, Frame is generated according to the specification of IEEE802.15.4, and resend data according to the data transmission procedure of step 2-1, and wait for that Correspondent Node confirms to receive reply, if Correspondent Node confirms to receive, decision data sends successfully; If upstream node is not replied " acknowledging receipt of message ", then, according to step 2-2, resend " Frame " to upstream node; If after retransmitting " Frame ", receive " acknowledging receipt of message " that Correspondent Node sends, then decision data sends successfully; If still acknowledge receipt of message without receiving ", again retransmit " Frame ", until the number of times repeating to send equals K time, then decision data transmission is unsuccessful;
Step 2-4: up routing node after receiving " Frame ", then searches self up routing table, forwards " Frame " according to 2-2 principle;
Step 2-5: at data transfer phase, if node receives " control message frame " from telegon, first judges that whether destination address is consistent with Self address; If consistent, then node transmits relevant data according to the content of control message or performs relevant instruction; If inconsistent, then forward with broadcast mode and be somebody's turn to do " control message frame "; Next judges jumping figure, if the jumping figure being somebody's turn to do " control message frame " reaches maximum hop count, abandons this control message; If do not reach maximum hop count, broadcast forwarding.
4. multi-hop ad hoc according to claim 3 can dormancy routing algorithm, it is characterized in that this coordinator node comprises following step at data transmission procedure:
Step 4-1: as described in step 1-1, after initiation networking process, coordinator node is just in data transmission procedure, the data that other node of wait-receiving mode is uploaded;
Step 4-2: in step 4-1, after often receiving one " Frame ", coordinator node just starts a Data Timer, carry out timer counter, if have received before timing terminates next " Frame ", counter reset, and " Frame " content is stored, if the source node of these data is newly added nodes, in the network registration table of coordinator node, then register the address information of this source node, if there is the address information of this source node, then need not register in network node registration form; If Data Timer is timed to, then judges that this secondary data receives and terminate;
Step 4-3: in the process of transfer of data, if telegon needs the state asking for data or Controlling vertex to a certain node, then needs to send " control message " to this node; When coordinator node sends " control message ", need to reset Data Timer, ensure that coordinator node is still in data transmission procedure; " control message " is sent by the mode of broadcast, containing destination node address information in " control message ", after other node receives, judges whether identical with own node address, if address information is not identical with self, forwards, until be communicated to destination node; If the address information in judgement control message is consistent with own node address, then perform according to the instruction in control message; " this control message " regulation has maximum hop count M, and after forwarding is more than M number, follow-up no longer forwarding is somebody's turn to do " control message "; Telegon, after transmission " control message ", waits for that Correspondent Node replys " data-message "; If the Data Timer time arrives, then judge that this secondary data receives and terminate, telegon no longer waits for that Correspondent Node is replied.
5. multi-hop ad hoc according to claim 3 can dormancy routing algorithm, it is characterized in that node dormancy process comprises following step:
Step 3-l: arrive when the Data Timer time, then after telegon thinks that data transmission procedure terminates, coordinator node to the whole network broadcast transmission " sleep messages ", with timestamp in sleep messages, meanwhile, coordinator node backup network node registration form; Other node after the sleep messages receiving broadcast according to the time in timestamp, after considering transmission delay, setting dormancy time, and " sleep messages " is somebody's turn to do in broadcast forwarding, then close wireless receiving and dispatching and associated peripheral circuits and empty routing table, a communication cycle declares the closing of, and enters resting state, and according to the dormancy time of agreement, each node is revived voluntarily.
6. multi-hop ad hoc according to claim 2 can dormancy routing algorithm, it is characterized in that the computational methods of the weighted value in described step 1-3 are as follows: weighted value=a* cell voltage+b* signal strength signal intensity; Described a>0 is the proportion of cell voltage in weighted value, and b>0 is the proportion that signal strength signal intensity accounts for weighted value, and a+b=1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410631017.7A CN104320829B (en) | 2014-11-12 | 2014-11-12 | Multi-hop ad hoc can dormancy routing algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410631017.7A CN104320829B (en) | 2014-11-12 | 2014-11-12 | Multi-hop ad hoc can dormancy routing algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104320829A true CN104320829A (en) | 2015-01-28 |
| CN104320829B CN104320829B (en) | 2017-10-24 |
Family
ID=52375980
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410631017.7A Active CN104320829B (en) | 2014-11-12 | 2014-11-12 | Multi-hop ad hoc can dormancy routing algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104320829B (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105611614A (en) * | 2016-01-05 | 2016-05-25 | 上海建工集团股份有限公司 | Self-feedback sleep awakening method and system for wireless monitoring routing node |
| CN106550437A (en) * | 2015-09-21 | 2017-03-29 | 北京晶点科技有限公司 | Reduce the device and method of ZigBee-network system power consumption |
| CN108075912A (en) * | 2016-11-11 | 2018-05-25 | 中兴通讯股份有限公司 | The definite method, apparatus and device node of Network Central Node |
| CN108617007A (en) * | 2016-12-01 | 2018-10-02 | 富士通株式会社 | Data transmission method and device |
| CN110798262A (en) * | 2019-10-23 | 2020-02-14 | 中国海洋大学 | Underwater wireless optical communication network |
| CN110839213A (en) * | 2019-10-25 | 2020-02-25 | 南京英锐祺科技有限公司 | Broadcasting method and system |
| CN111405611A (en) * | 2020-03-20 | 2020-07-10 | 兰笺(苏州)科技有限公司 | Wireless communication method and system |
| CN113141579A (en) * | 2020-01-19 | 2021-07-20 | 深圳市云海物联科技有限公司 | Wireless communication method, device and system |
| CN113286347A (en) * | 2020-02-19 | 2021-08-20 | 摩点物联创意科技股份有限公司 | Wireless network construction method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2003105502A1 (en) * | 2002-06-06 | 2003-12-18 | Motorola, Inc., A Corporation Of The State Of Delaware | Protocol and structure for mobile nodes in a self-organizing communication network |
| CN101272330A (en) * | 2008-04-14 | 2008-09-24 | 哈尔滨炎升科技有限公司 | Data transmission and positioning system based on wireless sensor network technology |
| CN102761941A (en) * | 2011-04-28 | 2012-10-31 | 北京云天创科技有限公司 | Wireless intelligent network protocol with ultra-low power consumption |
| CN103338142A (en) * | 2013-06-05 | 2013-10-02 | 山东大学 | A wireless self-organizing networking system based on the IEEE 802.15.4g and a working method |
-
2014
- 2014-11-12 CN CN201410631017.7A patent/CN104320829B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2003105502A1 (en) * | 2002-06-06 | 2003-12-18 | Motorola, Inc., A Corporation Of The State Of Delaware | Protocol and structure for mobile nodes in a self-organizing communication network |
| CN101272330A (en) * | 2008-04-14 | 2008-09-24 | 哈尔滨炎升科技有限公司 | Data transmission and positioning system based on wireless sensor network technology |
| CN102761941A (en) * | 2011-04-28 | 2012-10-31 | 北京云天创科技有限公司 | Wireless intelligent network protocol with ultra-low power consumption |
| CN103338142A (en) * | 2013-06-05 | 2013-10-02 | 山东大学 | A wireless self-organizing networking system based on the IEEE 802.15.4g and a working method |
Non-Patent Citations (1)
| Title |
|---|
| 王延年等: "基于ZigBee的无线通信网络节点设计与组网实现", 《纺织高校基础科学学报》 * |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106550437A (en) * | 2015-09-21 | 2017-03-29 | 北京晶点科技有限公司 | Reduce the device and method of ZigBee-network system power consumption |
| CN106550437B (en) * | 2015-09-21 | 2021-03-26 | 浙江吉利控股集团有限公司 | Device and method for reducing energy consumption of ZigBee network system |
| CN105611614B (en) * | 2016-01-05 | 2019-12-24 | 上海建工集团股份有限公司 | Method and system for self-feedback dormancy awakening of routing node for wireless monitoring |
| CN105611614A (en) * | 2016-01-05 | 2016-05-25 | 上海建工集团股份有限公司 | Self-feedback sleep awakening method and system for wireless monitoring routing node |
| CN108075912B (en) * | 2016-11-11 | 2022-09-27 | 中兴通讯股份有限公司 | Method and device for determining network center node and equipment node |
| CN108075912A (en) * | 2016-11-11 | 2018-05-25 | 中兴通讯股份有限公司 | The definite method, apparatus and device node of Network Central Node |
| CN108617007A (en) * | 2016-12-01 | 2018-10-02 | 富士通株式会社 | Data transmission method and device |
| CN110798262A (en) * | 2019-10-23 | 2020-02-14 | 中国海洋大学 | Underwater wireless optical communication network |
| CN110798262B (en) * | 2019-10-23 | 2023-02-24 | 中国海洋大学 | Underwater wireless optical communication network |
| CN110839213A (en) * | 2019-10-25 | 2020-02-25 | 南京英锐祺科技有限公司 | Broadcasting method and system |
| CN113141579B (en) * | 2020-01-19 | 2022-05-13 | 深圳市云海物联科技有限公司 | Wireless communication method, device and system |
| CN113141579A (en) * | 2020-01-19 | 2021-07-20 | 深圳市云海物联科技有限公司 | Wireless communication method, device and system |
| CN113286347A (en) * | 2020-02-19 | 2021-08-20 | 摩点物联创意科技股份有限公司 | Wireless network construction method |
| CN111405611A (en) * | 2020-03-20 | 2020-07-10 | 兰笺(苏州)科技有限公司 | Wireless communication method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104320829B (en) | 2017-10-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104320829A (en) | Multi-hop self-organizing sleep routing algorithm | |
| CN105792305B (en) | A kind of ultra-low power consumption wireless data transmission network design method | |
| US10045291B2 (en) | Relay functionality of battery powered devices | |
| US7916666B2 (en) | Reliable broadcast protocol and apparatus for sensor networks | |
| CN107211368B (en) | Network of nodes, battery-powered node and method of managing a battery-powered node | |
| US9860730B2 (en) | Network discovery by battery powered devices | |
| US20120327792A1 (en) | Method for Discovering and Maintaining Routes in Smart Meter Networks | |
| CN101489276B (en) | Multicast routing method for Ad Hoc network | |
| US9456258B2 (en) | Transmission timing for battery powered devices | |
| CN103338495B (en) | Two-way energy balance wireless sensing network route method based on LEPS | |
| CN104301965A (en) | Wireless sensor network inhomogeneous cluster node scheduling method | |
| CN106028398A (en) | Underwater wireless sensor network topology control method based on energy consumption balance | |
| CN110062433A (en) | A kind of LoRa recurrent network of low-power consumption | |
| CN102111912A (en) | Centralized construction method for Zigbee homogeneous tree-type wireless sensor network | |
| CN105873169A (en) | Wireless ad-hoc network communication method | |
| CN104936249A (en) | Route self-healing method suitable for wireless network | |
| US8300756B2 (en) | Intermittent operative communication apparatus adaptively controlling the timing of waiting data reception and a method therefor | |
| CN102946649A (en) | Wireless sensor network topology construction method based on spanning tree | |
| CN105634964B (en) | A kind of mobile ad-hoc network and its multicast route method | |
| CN105050077B (en) | A kind of sub-clustering chain type wireless sensing network data transmission method | |
| CN106412997B (en) | A kind of implementation method towards asynchronous sensor network HR-MM Radio Broadcasting Agreements | |
| KR100915555B1 (en) | Query-based ZigBee Mesh Routing Protocol | |
| CN107820225B (en) | Energy-balanced wireless sensor network node code distribution method | |
| CN115190559A (en) | Networking and control method of multi-scene-oriented Internet of things equipment | |
| Rosyidi et al. | Energy harvesting aware protocol for 802.11-based Internet of Things 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP02 | Change in the address of a patent holder |
Address after: 221116 No. 1 University Road, copper mountain, Jiangsu, Xuzhou Patentee after: China University of Mining & Technology Address before: 221116 Jiangsu Province, Xuzhou City Quanshan District of Wenchang campus of China University of Mining and Technology Patentee before: China University of Mining & Technology |
|
| CP02 | Change in the address of a patent holder |