CN104320829B - Multi-hop ad hoc can dormancy routing algorithm - Google Patents
Multi-hop ad hoc can dormancy routing algorithm Download PDFInfo
- Publication number
- CN104320829B CN104320829B CN201410631017.7A CN201410631017A CN104320829B CN 104320829 B CN104320829 B CN 104320829B CN 201410631017 A CN201410631017 A CN 201410631017A CN 104320829 B CN104320829 B CN 104320829B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- routing
- 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.)
- Active
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
Abstract
Can dormancy routing algorithm the invention discloses the multi-hop ad hoc used suitable for regions such as coal mine gobs, it is that a kind of energy expenditure is less, the load more synchronization routing algorithm of wireless sensor network in a balanced way, whole wireless sensor network is initiated and set up by coordinator node, telegon sends " networking message ", other nodes are received after " networking message ", " networking message " is forwarded, and the source node for sending " networking message " is used as to the upstream node of the node, upload its data, the data sent for other nodes, forwarded by the upstream node of the node, all information finally converge at coordinator node, pass through the upload down forwarded with data of " networking message ", reach that networking and data are uploaded.Networking process is actually once newest routing table generating process, and organizing network has good environmental suitability, survivability and flexibility, it is adaptable to the networking of wireless sensor network under communication environment change drastic scene.
Description
Technical field
Can dormancy route the present invention relates to the multi-hop ad hoc of the routing algorithm of wireless sensor network, especially low energy consumption
Algorithm.
Background technology
In the routing algorithm of traditional wireless sensor network, generally the type of node is divided into three classes, the first kind is
Sink node, i.e. coordinator node, the effect of Sink node are responsible for the foundation of whole network, the convergence of sensing data, route
Calculate and control；Equations of The Second Kind is routing node, routing node can gathered data can play a part of route again, it is necessary to for a long time
Work come to keep network unimpeded, this kind of node cannot dormancy in sensor network；3rd class is terminal node,
The function of this kind of node only has the function that data acquisition and data are uploaded, and does not possess routing function, such node can be with dormancy.It is aobvious
So, under classical routing algorithm for wireless sensor, routing node and coordinator node are required for keeping work for a long time
State, can not dormancy.For colliery, subsurface environment is complicated, and needs many regions for disposing sensor node not grow
Phase powers, such as disposes sensor network nodes in coal mine gob, due to the slump in goaf, can only carry out one using battery
Secondary property is powered.In goaf monitoring sensor network, in order to ensure under certain energy supply, when extending the work of network
Between, sensor node needs dormancy.Obviously, the routing algorithm of traditional wireless sensor network can not meet the actual need in colliery
Ask.
The content of the invention
It is an object of the invention to：Propose that a kind of multi-hop ad hoc used suitable for regions such as coal mine gobs can
The characteristic of routing node and terminal node is combined together by dormancy routing algorithm, the algorithm, has both been ensured its data transfer and has been turned
The reliability of function is sent out, node dormancy when not enabling can be enable again, reduces the expense of energy, conventional wireless is solved and passes
Sensor network routing node power consumption is too high, can not dormancy problem, meet the data transportation requirements of long period low traffic.
To achieve the above object of the invention, the technical proposal of the invention is realized in this way：A kind of multi-hop ad hoc can dormancy
Routing algorithm, it is characterized in that the whole communication process of the routing algorithm with the next stage by being constituted：（1）Coordinator node is saved to route
Point initiates the networking commands stage；（2）Routing node networking stage；（3）Data uplink and downlink transfer stage；（3）Net dormancy
Stage.
Further, the routing node networking stage includes following specific steps：
Step 1-1：When each communication cycle starts, one " networking message " is broadcasted by the coordinator node in network,
Message content includes the address information of itself, the energy intensity value and signal strength values of itself；
Step 1-2：When network routing nodes receive " networking message " for the first time in a communication cycle, open immediately
A Local Area Networking timer is moved, the networking timer is used for the maximum time for limiting networking stage；When the node connects for the first time
When receiving " networking message ", then open the timer, and countdown, when countdown completion after, then declare this route save
The networking process of point terminates；
Step 1-3：Before step 1-2 networking timers countdown end, " networking disappears the routing node receiving
After breath ", energy intensity value and signal strength values are weighted and averagely obtain Route Selection value in by described in " mesh information ", this value
It is compared with the every energy and signal intensity weighted value in itself routing table：
If the routing iinformation bar number in the node route list is less than three, destination address, energy are registered in the routing table
And signal strength information；When registering routing table, the weighted value of the address information of destination node, energy and signal intensity is pressed into ascending order
Arrange and store；If the routing iinformation bar number in routing table is more than or equal to three and newly enters the weighted value of routing iinformation more than route
Minimum one weighted value in table, then need to update routing table；When updating routing table, energy and signal intensity in original routing table
A minimum routing iinformation of weighted value will be deleted, and newly enter routing iinformation and the routing iinformation retained, according to the big of weighted value
The mode of small ascending order arrangement, updates routing table；
If the routing iinformation bar number in routing table is more than or equal to three and the new weighted value for adding information is less than in routing table
Minimum one weighted value, then need not update the information in routing table；
Step 1-4：After step 1-3 completions, the routing node send this node it is unique once " networking message ", with
The networking process of triggering following routing node；Repeat step 1-3 continues waiting for " the networking message " that other nodes are sent, and updates section
The routing table of point；
Step 1-5：In step 1-2, if the timing of networking timer terminates, the networking function of the routing node is closed,
The node no longer receives and handled " networking message ", and the routing table of the node no longer updates.
Further, routing node includes following steps in data transfer phase：
Step 2-1：After step 1-5 completions, networking timer is reset, and the routing node is according to IEEE802.15.4's
Specification generates " data frame ", according to the up routing table of the node generated, chooses the maximum upstream node of weighted value in routing table
It is automatically " data frame " to one minor node its data of up transmission as up routing node address；Sending " data frame "
Afterwards, node needs to wait upstream node to reply " confirming to receive message "；
Step 2-2：In step 2-1, if the node for sending data does not receive " confirming to receive message " of upstream node,
Then node is needed to the upstream node retransmission data, retransmits " data frame " again if still without " confirmation receive information " is received, directly
It is equal to K times to the number of times for repeating to send, wherein, K is not more than five times, then judges that data are sent unsuccessful；If sending the section of data
Point receives upstream node " confirmation receive information ", then this data sends and terminated；
Step 2-3：In step 2-2, if destination node is more than K times, repeating transmission is not still replied, then routing node needs
Again upstream node is chosen, in this routing node routing table, deletes and sends unsuccessful upstream node address；Routing node weight
The new size according to weighted value chooses a maximum new upper row address of weighted value in the routing table, by the routing node address
The up routing node address of data is sent as this time, data frame is generated according to IEEE802.15.4 specification, and according to step
Rapid 2-1 data transmission procedure resends data, and waits Correspondent Node to confirm to receive reply, if Correspondent Node confirms to receive
Then judge that data are sent successfully；If upstream node does not reply " acknowledging receipt of message ", according to step 2-2, to up section
Point is resend " data frame "；If retransmitting after " data frame ", " acknowledging receipt of message " of Correspondent Node transmission is received, then is judged
Data are sent successfully；If still acknowledging receipt of message without receiving " if retransmit " data frame " again, until the number of times for repeating to send is equal to
K times then judge data send it is unsuccessful；
Step 2-4：Up routing node searches itself up routing table after " data frame " is received, then, according to 2-2 principles
Forward " data frame "；
Step 2-5：In data transfer phase, if node receives " control message frame " from telegon, mesh is judged first
Whether consistent with Self address mark address；If consistent, node transmits data or the execution of correlation according to the content of control message
Related instruction；If inconsistent, " control message frame " is somebody's turn to do with broadcast mode forwarding；Secondly hop count is judged, if should " control message
The hop count of frame " has been maxed out hop count and then abandons the control message；Forwarding is broadcasted if maximum hop count is not reaching to.
Further, the coordinator node includes following steps in data transmission procedure：
Step 3-1：As described in step 1-1, after a networking process is initiated, coordinator node is at data transfer
During, the data for waiting other nodes to be received to upload；
Step 3-2：In step 3-1, often receive after one " data frame ", coordinator node just starts a data and determined
When device, counting is timed, if resetting counter if next " data frame " is have received before timing terminates, and will " number
According to frame " content is stored, if the source node of the data is newly added node, stepped in the network registration table of coordinator node
Remember the address information of the source node, if the address information of the existing source node, need not be registered in network node registration form；
If Data Timer is timed to, judge that this data receiver terminates；
Step 3-3：During data transfer, if telegon needs to ask for data or control node to a certain node
State, then need to the node send " control message "；Determine when coordinator node sends " control message ", it is necessary to reset data
When device, it is ensured that coordinator node is still within data transmission procedure；" control message " is sent by way of broadcast, " control
In message " contain destination node address information, after other nodes are received, judge whether it is identical with own node address, if ground
Location information is differed with itself, is forwarded, until being communicated to destination node；If judging address information in control message and itself
Node address is consistent, then the instruction in control message is performed；" control message " regulation has maximum hop count M, when forwarding is super
Cross after M numbers, subsequently no longer " control message " is somebody's turn to do in forwarding；Telegon waits Correspondent Node to return after " control message " is sent
Multiple " data-message "；If the Data Timer time arrives, judge that this data receiver terminates, telegon is no longer waiting for Correspondent Node
Reply.
Further, node dormancy process includes following steps：
Step 4-l：Arrived when the Data Timer time, then after telegon thinks that data transmission procedure terminates, telegon section
Point carries timestamp to the whole network broadcast transmission " sleep messages " in sleep messages, meanwhile, coordinator node backup network node is stepped on
Remember table；Other nodes are after the sleep messages of broadcast are received according to the time in timestamp, it is considered to after transmission delay, and setting is stopped
The dormancy time, and forwarding " sleep messages " is broadcasted, it is then shut off wireless receiving and dispatching and associated peripheral circuits and empties routing table, one
Communication cycle is declared the closing of, into resting state, and according to the dormancy time of agreement, each node is voluntarily revived.
Further, the computational methods of the weighted value in the step 1-3 are as follows：Weighted value=a* cell voltage+b* signals
Intensity；Described a>0 is proportion of the cell voltage in weighted value, b>0 is the proportion that signal intensity accounts for weighted value, and a+b=1.
It is an advantage of the invention that：This method can reduce the energy expenditure of whole network, extend whole sensor network
Life cycle, there is more preferable adaptability, flexibility and survivability in terms of route.
Brief description of the drawings
Fig. 1 is that coordinator node broadcasts the process for setting up routing table；
Fig. 2 and Fig. 3 are the processes of routing node networking and broadcast forwarding mesh information；
Fig. 4 and Fig. 5 are a kind of typical network structures of routing algorithm formation；
Fig. 6 is a kind of typical path that node upstream data communication is passed through；
The flow chart of Fig. 7 node networkings；
The general nodes of Fig. 8 receive and forwarded the flow chart of data；
Fig. 9 coordinator nodes receive and forwarded the flow chart of data；
The general nodes of Figure 10 send the flow chart of data；
The flow chart of the general node dormancy processes of Figure 11；
Figure 12 telegons data transmission procedure sends the flow of control message.
Embodiment
Below by embodiment, and with reference to accompanying drawing, technical scheme is described in further detail.Ying Li
Solution, these embodiments are merely to illustrate the present invention rather than for limiting the scope of the present invention.
Embodiment：The multi-hop ad hoc of the present embodiment can dormancy routing algorithm be similar to flooding, but every time to association
It is all single-point direction propagation to adjust device node to send data, and networking is needed before communication, transmission data are carried out after networking again；Also
It is to say, carries out data transmission if desired between wireless sensor network node, it is necessary first to networking, node is preserved around respective
The upstream node routing iinformation in telegon direction is gone upward to, is carried out choosing the up of transmission data according to routing iinformation and weighted value
Node, receives the forwarding for connection (information in routing table) the progress data that the intermediate node of data is set up according to its own；
Final data converges at coordinator node, the inserting knot mode and underground coal mine ring of the route pattern combination colliery restricted clearance
Border characteristic implements deployment.
The routing table that each node is preserved in a communication cycle, the routing table includes the address, next of destination node
The address of hop node, the magnitude of voltage of next-hop node and signal strength values and the weighting of magnitude of voltage and signal strength values generation
Value, the weighted value is used in data transfer, relatively and determines to use in data transfer direction, and weighted value is larger to represent that this is up
The routing condition of route preferably, is more suitable for being transmitted.
So far it can be seen that this routing algorithm at least include it is following some：First, it is necessary to weight when each communication cycle starts
New to set up route, route has good real-time, and is needed at the end of communication cycle by current routing table removing；Its
Two, in view of underground coal mine restricted clearance radio condition is severe, goes upward to telegon direction and number is transmitted by the way of routing forwarding
According to descending issue order is by the way of broadcast, and broadcast mode keeps system redundancy to improve in stability, up fixed point
Biography ensure that certain efficiency of transmission；Third, at the end of a communication cycle, the general node in system is required for closing nothing
Line function, into resting state, can extend the life-span of node as far as possible.
It is as shown in Figure 1, Figure 2, Figure 3 shows the algorithmic procedure of route networking, coordinator node initiates the mistake of a networking in Fig. 1
Journey, the neighbor node of surrounding enters the wait time slot of networking after receiving the request of networking, and the message of coordinator node is deposited
In routing table entry, and start timer, the networking process of the node ends after wait networking timing terminates.These are coordinated
Neighbor node around device can also initiate a networking to the surrounding neighbours section of itself after the timing of networking timer terminates
Point, sends a networking message, and surrounding does not carry out the routing node of networking process after networking message is received, similarly,
Also the address of node information for initiating networking is stored in the routing table, and it is strong according to the energy and signal included in networking message
Angle value calculates the energy of networking message and the weighted value of signal intensity, and as the weighted value of the upstream node, what measurement was transmitted can
By property, and three upstream node addresses of storage weighted value highest in the routing table, save Internet resources.
When the networking process of the node ends, the node just enters data transfer phase, according in routing table
Route entry, selects weighted value highest upstream node address, and is sent to need the data of transmission.After end of transmission, etc.
Treat that upstream node response receives acknowledgement frame, confirm just to declare that current transmission process terminates after data receiver.If upstream node does not have
There is reply to receive to confirm, then restart data transfer procedure, delete the route upstream node information in the routing table first, remaining
Node in select weighted value highest node and carry out data transmission, similarly, upstream node response is waited after data transfer
Receive acknowledgement frame.Due to the limitation of working time and energy, restart data transfer procedure and only carry out three times.When third time restarts number
After transmit process failure, then declare bust this, be no longer attempt to retransmit data.Similarly, during data are forwarded,
Node can correct the address information for needing to transmit upstream node in data, be changed to itself up address, be then forwarded to
Row address.Wherein, the data structure of networking message is as shown in table 1：
The data structure of the networking message of table 1
| Energy intensity value | Frame length | Frame type | Telegon address | Node address | Check field |
| 100 | 01 | 0003 | xxxx |
Energy intensity value of the networking message package containing the node for initiating networking, the telegon address of network residing for the node and section
Point Self address, signal strength values are then to be generated when node is received by recipient.
During data transfer, if coordinator node needs to ask for the work of data or control node to a certain node
When making state, then need to send control message to the node., it is necessary to reset data timing during coordinator node transmission control message
Device, it is ensured that coordinator node is still within data transmission procedure.Control message is sent by way of broadcast, in control message
Containing partner address information, after other nodes are received, judge whether it is identical with own node address, if address information and itself
Differ, forward, until being communicated to destination node, the address information in control message is consistent with own node address if judging,
Then the instruction in control message is performed.In order to not allow control message unrestrictedly to be broadcasted in the entire network, then need
A life cycle is set to control message, is weighed with hop count the life cycle.When coordinator node sends control message,
Current hop count and maximum hop count are added in control message, is just abandoned if current hop count is more than the maximum hop count routing nodes such as energy
The control message.Wherein, control message is as shown in table 2.
The control message of table 2
| Energy intensity value | Frame length | Frame type | Telegon address | Node address | Data content | Maximum hop count | Current hop count | Check field |
| 100 | 05 | 0003 | 0000 |
It must be observed that the energy resource of routing node is still very limited amount of, and for cost consideration, routing node
Storage resource be also limited, the routing iinformation amount of each node storage has also been limited.When preserve routing iinformation when, when up to
To cannot have more upstream nodes again when preserving the upper limit, in order to match working time and energy and ensure internal resource can
By property, we set up routing address number as three, when the 4th routing iinformation arrives, first calculate the routing iinformation
Weighted value, if the routing iinformation relatively low higher than weighted value in routing table, replaces total number in routing iinformation, routing table still
Remain three.
When general node receives the data that other nodes are sent, weighted value highest is chosen according to preferential from routing table
Routing iinformation, forward the data to row address.After data forwarding, node can wait other side to confirm the message received,
The message for confirming to receive can be replied if Correspondent Node is received successfully, node is after the message for confirming to receive is received, a surname
Accuse repeating process success.If the message for confirming to receive is not received in certain time, after some time, restart and turn
Hair process, the data is chosen again other items in routing table, repeats repeating process.Surpass when forwarding unsuccessful number of times
Cross three times and then terminate current repeating process, in order to not cause message system chaotic, the message being forwarded will be dropped.Its
In, node data frame data structure is as shown in table 3.
The node data frame data structure of table 3
| Energy intensity | Frame length | Frame type | Telegon address | Sensor address | Upstream node address | Data content | Check field |
| 100 | 0x0d | 00 | 0003 | Xxxx |
Coordinator node is stored and handled after data message is received.Coordinator node is to the data come
Address information in information is registered, and forms a network node registration form.Can be independent in data transfer phase telegon
One of node into network is communicated, and the arbitrary node into existing network node registration form sends control and disappeared
Breath.The descending mode for finding node of telegon contains partner address information, other nodes receive it to broadcast in control message
Afterwards, judge whether identical with own node address, forwarded if address information is differed with itself, until being communicated to purpose section
Point, if judging, the address information in control message is consistent with own node address, and the instruction in control message is performed.And
And the control message has maximum hop count, after forwarding exceedes certain number of times, node then abandons the control message.
It is fully completed in the process of networking, data transfer, telegon is no longer received after Data Timer zero is waited
To new data message, then telegon declares that this communication cycle terminates, coordinator node to the whole network broadcast transmission dormancy instruction,
The time span of dormancy is included in dormancy instruction, notifies all nodes in network to enter resting state, and according to agreement
Time is voluntarily revived by each node.Other nodes in network are receiving the networking process instruction of coordinator node transmission
Afterwards, all operations at present in progress are terminated, broadcast forwarding dormancy instruction, to reach the purpose of dormancy node diffusion, is being sent
The peripheral circuit and wireless transmitter of itself are closed after finishing, is set according to the time span of agreement and starts dormancy timing
Device, revives, into normal operating conditions automatically into park mode, and according to the time of agreement.Wherein, the data of sleep messages
Structure is as shown in table 4.
The data structure of the sleep messages of table 4
| Energy intensity | Frame length | Frame type | Telegon address | Sensor address | Check field |
| 100 | 0x0d | 02 | 0003 | xxxx |
Fig. 4, Fig. 5 and Fig. 6 represent several typical network topology structures built under the routing algorithm, illustrate in data
The mode of row process, and the final characteristic for converging at telegon.Fig. 7 is node networking process, the time span of this process
By networking Timer Controlling, the timing of networking timer terminates networking process and terminated, the networking message received therebetween all can by with
In comparing and screen and ultimately generate the routing table under the node current communication cycle.Fig. 8 is that general node receives and forwarded number
According to flow chart.Fig. 9 is the flow chart that coordinator node received and forwarded data.Figure 10 is the flow that general node sends data
Figure.Figure 11 is the flow chart of general node dormancy process.Figure 12 is the stream of transmission control message in telegon data transmission procedure
Journey.
The communication cycle of each node is experience networking, data transfer, three processes of dormancy since revival.Entirely
Network formation is the node until reaching distalmost end from telegon to around spreading, and forms a complete wireless sensing
Device network.
Each node in network has unique address, and the address is used to distinguish other as the unique mark of node
Node.
Routing algorithm is the process based on networking：
Step 1-1：When each communication cycle starts, one " networking message " is broadcasted by the coordinator node in network,
Message content includes the address information of itself, the energy information of itself.
Step 1-2：Other nodes in network（Routing node）Receive that " networking disappears for the first time in a communication cycle
During breath ", start a Local Area Networking timer immediately, the networking timer is used to limit maximum time of networking stage, this when
Between for determination value, when the node receives " networking message " for the first time, then open the timer, and countdown, when
Countdown after completion, then declare that the networking process of this routing node terminates.
Step 1-3：Step b networking timers are countdowned before end, the routing node receive networking message it
Afterwards, after energy and signal intensity being weighted averagely, Route Selection value is obtained, by every energy in this value and itself routing table
Amount and signal intensity weighted value are compared.
If the routing iinformation bar number in the node route list is less than three, in the routing table registered address information and energy
Information, the weighted value of the address information and energy of destination node and signal intensity during registration routing table, arranged and deposited by ascending order
Storage.
If the routing iinformation bar number in routing table is more than or equal to three and newly enters the weighted value of routing iinformation more than routing table
The weighted value of middle minimum one, then need to update routing table.When updating routing table, energy and signal intensity add in original routing table
A minimum routing iinformation of weights will be deleted, and newly enter routing iinformation and the routing iinformation retained, according to the size of weighted value
The mode of ascending order arrangement, updates routing table.
If the routing iinformation bar number in routing table is more than or equal to three and the new weighted value for adding information is less than in routing table
Minimum one weighted value, then need not update the information in routing table, and this current new information that adds is abandoned.
Step 1-4：After step 2-3 completions, the routing node send this node it is unique once " networking message ", with
The networking process of triggering following routing node；Turning 2-3 continues waiting for " networking message " that other nodes are sent simultaneously, more new node
Routing table.
Step 1-5：In step 2-2, if the timing of networking timer terminates, the networking function of the routing node is closed,
The node no longer receives and handled " networking message ", and the routing table of the node no longer updates.Networking message processing procedure such as Fig. 7 institutes
Show.
Routing node is as follows in the process that data transfer phase sends data and reception data：
Step 2-1：After step 1-5 completions, networking timer is reset, and the routing node is according to IEEE802.15.4's
Specification generates " data frame ", according to the up routing table of the node generated, chooses the maximum upstream node of weighted value in routing table
As up routing node address, automatically to one minor node its data of up transmission.After data frame is sent, node needs
Destination node is waited to reply the message for confirming to receive.
Step 2-2：In step 2-1, if the node for sending data does not receive the message that Correspondent Node is acknowledged receipt of,
Node is needed to the Correspondent Node retransmission data, the retransmission data again if still without confirmation is received, until repeating what is sent
Number of times is equal to K times（K is typically chosen as five times）Then judge that data are sent unsuccessful.
If the node for sending data receives the message that Correspondent Node acknowledges receipt of data, this data, which is sent, to be terminated.
Step 2-3：In step 2-2, if destination node is more than K times（K is typically chosen as five times）Repeating transmission is not still replied,
Then node needs to choose upstream node again, in this node route list, deletes and sends unsuccessful upstream node address.Node
Again a maximum new upper row address of weighted value is chosen in the routing table according to the size of weighted value, the node address is made
The up routing node address of data is sent for this time, data frame is generated according to IEEE802.15.4 specification, and according to step
3-1 data transmission procedure resends data, and waits Correspondent Node to confirm to receive reply, if Correspondent Node confirms to receive
Judge that data are sent successfully.
If Correspondent Node does not reply " acknowledging receipt of message ", according to step 3-2, number is resend to Correspondent Node
According to.If after retransmission data, receiving the message of " the acknowledging receipt of " of Correspondent Node transmission, then judge that data are sent successfully.If still
Without confirmation then retransmission data again is received, then judge that data transmission is unsuccessful until the number of times for repeating to send is equal to K time.
The up routing nodes of step 2-4 search itself up routing table after " data frame " is received, then, according to 3-2 principles
Forward " data frame ".
Step 2-5：In data transfer phase, if node receives " control message frame " from telegon, mesh is judged first
Whether consistent with Self address mark address：If consistent, node transmits data or the execution of correlation according to the content of control message
Related instruction.If inconsistent, " control message frame " is somebody's turn to do with broadcast mode forwarding.Secondly hop count is judged, wherein, hop count is number
According to the number for reaching the node that destination node is passed through, often just add one by a node hop count, until reaching destination node, if
The hop count of " the control message frame " has been maxed out hop count and then abandons the control message.Broadcasted if maximum hop count is not reaching to
Forwarding.
Coordinator node is as follows in data transmission procedure：
Step 3-1：As described in step 1-1, after a networking process is initiated, coordinator node is at data transfer
During, the data for waiting other nodes to be received to upload.
Step 3-2：In step 3-1, often receive after one " data frame ", coordinator node just starts a data and determined
When device, counting is timed, if resetting counter if next " data frame " is have received before timing terminates, and by data
Content is stored, if the source node of the data is newly added node, and registration should in the network registration table of coordinator node
The address information of source node, if the address information of the existing source node, need not be registered in network node registration form.If number
It is timed to according to timer, then judges that this data receiver terminates.
Step 3-3：During data transfer, if telegon needs to ask for data or control node to a certain node
State, then need to the node send control message., it is necessary to reset data timing during coordinator node transmission control message
Device, it is ensured that coordinator node is still within data transmission procedure.Control message is sent by way of broadcast, in control message
Containing partner address information, after other nodes are received, judge whether it is identical with own node address, if address information and itself
Differ, forward, until being communicated to destination node, the address information in control message is consistent with own node address if judging,
Then the instruction in control message is performed.And the control message has maximum hop count, after forwarding exceedes certain number of times, section
Point then abandons the control message.After control message is sent, telegon waits Correspondent Node to reply data and message.If data
Timer time is arrived, then judges that this data receiver terminates, and telegon is no longer waiting for Correspondent Node reply.
The step of node dormancy process, is as follows：
Step 4-l：Arrived when the Data Timer time, then after telegon thinks that data transmission procedure terminates, telegon section
Point carries timestamp to the whole network broadcast transmission " sleep messages " in sleep messages, meanwhile, coordinator node backup network node is stepped on
Remember table.Other nodes set dormancy time after the sleep messages of broadcast are received according to the time in timestamp, and broadcast turns
The sleep messages are sent out, wireless receiving and dispatching and associated peripheral circuits is then shut off and empties routing table, a communication cycle declares the closing of,
Into resting state.And according to the dormancy time of agreement, each node is voluntarily revived.
The computational methods of weighted value are as follows：Weighted value=a* cell voltage+b* signal intensities, described a is that cell voltage exists
The proportion of weighted value, b is the proportion that signal intensity accounts for weighted value；And a+b=1.
Claims (5)
1. multi-hop ad hoc can dormancy routing algorithm, it is characterized in that the whole communication process of the routing algorithm is by with next stage group
Into：（1）Coordinator node initiates the networking commands stage to routing node；（2）Routing node networking stage；（3）Data uplink and
The downlink transfer stage；（4）Net dormancy stage；
The routing node networking stage includes following specific steps：
Step 1-1：When each communication cycle starts, one " networking message ", message are broadcasted by the coordinator node in network
Content includes the address information of itself, the energy intensity value and signal strength values of itself；
Step 1-2：When network routing nodes receive " networking message " for the first time in a communication cycle, start one immediately
Individual Local Area Networking timer, the networking timer is used for the maximum time for limiting networking stage；When the node is received for the first time
When " networking message ", then open the timer, and countdown, when countdown completion after, then declare this routing node
Networking process terminates；
Step 1-3：Before step 1-2 networking timers countdown end, the routing node is being received " networking message "
Afterwards, will described in " mesh information " energy intensity value and signal strength values be weighted and averagely obtain Route Selection value, this value and
Every energy and signal intensity weighted value in itself routing table are compared：
If the routing iinformation bar number in the node route list is less than three, destination address, energy and letter are registered in the routing table
Number strength information；When registering routing table, the weighted value of the address information of destination node, energy and signal intensity is arranged by ascending order
And store；If the routing iinformation bar number in routing table is more than or equal to three and newly enters the weighted value of routing iinformation more than in routing table
Minimum one weighted value, then need to update routing table；When updating routing table, energy and signal intensity weighting in original routing table
Being worth a minimum routing iinformation will be deleted, and newly enter routing iinformation and the routing iinformation retained, according to the size liter of weighted value
The mode of sequence arrangement, updates routing table；
If the routing iinformation bar number in routing table is more than or equal to three and the new weighted value for adding information is less than minimum in routing table
The weighted value of one, then need not update the information in routing table；
Step 1-4：After step 1-3 completions, the routing node send this node it is unique once " networking message ", to trigger
The networking process of follow-up routing node；Repeat step 1-3 continues waiting for " the networking message " that other nodes are sent, more new node
Routing table；
Step 1-5：In step 1-2, if the timing of networking timer terminates, the networking function of the routing node is closed, the section
Point no longer receives and handles " networking message ", and the routing table of the node no longer updates.
2. multi-hop ad hoc according to claim 1 can dormancy routing algorithm, it is characterized in that routing node is in data transfer
Stage includes following steps：
Step 2-1：Step 1-5 completion after, networking timer reset, the routing node according to IEEE802.15.4 specification
Generate " data frame ", according to the up routing table of the node generated, choose the maximum upstream node conduct of weighted value in routing table
Up routing node address, is automatically " data frame " to one minor node its data of up transmission；After " data frame " is sent,
Node needs to wait upstream node to reply " confirming to receive message "；
Step 2-2：In step 2-1, if the node for sending data does not receive " confirming to receive message " of upstream node, save
Point is needed to the upstream node retransmission data, retransmits " data frame " again if still without " confirmation receive information " is received, Zhi Daochong
The number of times sent is recurred to be equal to K times, wherein, K is not more than five times, then judges that data are sent unsuccessful；If the node for sending data is received
To upstream node " confirmation receive information ", then this data transmission terminates；
Step 2-3：In step 2-2, if destination node is more than K times, repeating transmission is not still replied, then routing node needs again
Upstream node is chosen, in this routing node routing table, deletes and sends unsuccessful upstream node address；Routing node is pressed again
Size according to weighted value chooses a maximum new upper row address of weighted value in the routing table, using the routing node address as
This time sends the up routing node address of data, and data frame is generated according to IEEE802.15.4 specification, and according to step 2-1
Data transmission procedure resend data, and wait Correspondent Node to confirm to receive and reply, sentence if Correspondent Node confirms to receive
Fixed number is according to sending successfully；If upstream node does not reply " acknowledging receipt of message ", according to step 2-2, to upstream node weight
It is new to send " data frame "；If retransmitting after " data frame ", " acknowledging receipt of message " of Correspondent Node transmission is received, then judges data
Send successfully；If still acknowledging receipt of message without receiving " if retransmit " data frame " again, until the number of times for repeating to send is equal to K times
Then judge that data are sent unsuccessful；
Step 2-4：Up routing node searches itself up routing table after " data frame " is received, then, is forwarded according to 2-2 principles
" data frame "；
Step 2-5：In data transfer phase, if node receives " control message frame " from telegon, target is judged first
Whether location is consistent with Self address；If consistent, node transmits the data of correlation according to the content of control message or performs correlation
Instruction；If inconsistent, " control message frame " is somebody's turn to do with broadcast mode forwarding；Secondly hop count is judged, if being somebody's turn to do " control message frame "
Hop count have been maxed out hop count and then abandon the control message；Forwarding is broadcasted if maximum hop count is not reaching to.
3. multi-hop ad hoc according to claim 2 can dormancy routing algorithm, it is characterized in that the coordinator node is in data
Transmitting procedure includes following steps：
Step 3-1：As described in step 1-1, after a networking process is initiated, coordinator node is at data transmission procedure
In, the data for waiting other nodes to be received to upload；
Step 3-2：In step 3-1, often receive after one " data frame ", coordinator node just starts a data timing
Device, is timed counting, if resetting counter if next " data frame " is have received before timing terminates, and by " data
Frame " content is stored, if the source node of the data is newly added node, is registered in the network registration table of coordinator node
The address information of the source node, if the address information of the existing source node, need not be registered in network node registration form；If
Data Timer is timed to, then judges that this data receiver terminates；
Step 3-3：During data transfer, if telegon needs to ask for the shape of data or control node to a certain node
State, then need to send " control message " to the node；, it is necessary to reset data timing during coordinator node transmission " control message "
Device, it is ensured that coordinator node is still within data transmission procedure；" control message " is sent by way of broadcast, and " control disappears
Breath " in contain destination node address information, after other nodes are received, judge whether it is identical with own node address, if address
Information is differed with itself, is forwarded, until being communicated to destination node；If judging, the address information in control message is saved with itself
Dot address is consistent, then the instruction in control message is performed；" control message " regulation has maximum hop count M, when forwarding is more than M
After number, subsequently no longer " control message " is somebody's turn to do in forwarding；Telegon waits Correspondent Node to reply after " control message " is sent
" data-message "；If the Data Timer time arrives, judge that this data receiver terminates, telegon is no longer waiting for Correspondent Node and returned
It is multiple.
4. multi-hop ad hoc according to claim 2 can dormancy routing algorithm, it is characterized in that node dormancy process include with
Under several steps：
Step 4-l：Arrived when the Data Timer time, then after telegon thinks that data transmission procedure terminates, coordinator node to
Timestamp is carried in the whole network broadcast transmission " sleep messages ", sleep messages, meanwhile, the registration of coordinator node backup network node
Table；Other nodes are after the sleep messages of broadcast are received according to the time in timestamp, it is considered to after transmission delay, set dormancy
Time, and forwarding " sleep messages " is broadcasted, it is then shut off wireless receiving and dispatching and associated peripheral circuits and empties routing table, one leads to
The letter cycle is declared the closing of, into resting state, and according to the dormancy time of agreement, each node is voluntarily revived.
5. multi-hop ad hoc according to claim 1 can dormancy routing algorithm, it is characterized in that the weighting in the step 1-3
The computational methods of value are as follows：Weighted value=a* cell voltage+b* signal intensities；Described a>0 is ratio of the cell voltage in weighted value
Weight, b>0 is the proportion that 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 CN104320829A (en) | 2015-01-28 |
| CN104320829B true 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) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| CN108075912B (en) * | 2016-11-11 | 2022-09-27 | 中兴通讯股份有限公司 | Method and device for determining network center node and equipment node |
| CN108617007A (en) * | 2016-12-01 | 2018-10-02 | 富士通株式会社 | Data transmission method and device |
| CN110798262B (en) * | 2019-10-23 | 2023-02-24 | 中国海洋大学 | Underwater wireless optical communication network |
| CN110839213B (en) * | 2019-10-25 | 2022-06-21 | 南京英锐祺科技有限公司 | Broadcasting method and system |
| CN113141579B (en) * | 2020-01-19 | 2022-05-13 | 深圳市云海物联科技有限公司 | Wireless communication method, device and system |
| CN113286347A (en) * | 2020-02-19 | 2021-08-20 | 摩点物联创意科技股份有限公司 | Wireless network construction method |
| CN111405611B (en) * | 2020-03-20 | 2022-09-06 | 兰笺(苏州)科技有限公司 | Wireless communication method and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1309266C (en) * | 2002-06-06 | 2007-04-04 | 摩托罗拉公司(在特拉华州注册的公司) | Protocol and structure for mobile nodes in a self-organizing communication network |
-
2014
- 2014-11-12 CN CN201410631017.7A patent/CN104320829B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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的无线通信网络节点设计与组网实现;王延年等;《纺织高校基础科学学报》;20120331;97-101 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104320829A (en) | 2015-01-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104320829B (en) | Multi-hop ad hoc can dormancy routing algorithm | |
| US7916666B2 (en) | Reliable broadcast protocol and apparatus for sensor networks | |
| CN105792305B (en) | A kind of ultra-low power consumption wireless data transmission network design method | |
| CN102340838B (en) | Medium access control method for prolonging network lifetime in wireless body area network | |
| CN103078795B (en) | Improve the cooperative routing method of throughput of wireless networks | |
| CN103338495B (en) | Two-way energy balance wireless sensing network route method based on LEPS | |
| CN103209435B (en) | Congestion control based wireless multi-hop network multicast method | |
| CN104394566A (en) | Fuzzy decision-based low-power dissipation self-adaption clustering multihop wireless sensor network topology control method | |
| CN102111912A (en) | Centralized construction method for Zigbee homogeneous tree-type wireless sensor network | |
| CN102413539B (en) | Geographical position-based large-scale wireless distribution type network self-adaptive cooperative routing method | |
| CN105072658B (en) | A kind of network data acquisition control system and wireless route method | |
| CN107222903A (en) | Method of data capture based on constructive interference in asynchronous low duty ratio WSN | |
| Lei et al. | Performance analysis and comparison of routing protocols in mobile ad hoc network | |
| CN109104704A (en) | Application and regulation method for aquaculture environment of internet of things regulator control system | |
| CN105050077B (en) | A kind of sub-clustering chain type wireless sensing network data transmission method | |
| CN106686680A (en) | Routing optimization system and method for Internet of Vehicles | |
| CN101860981A (en) | Routing method and system of wireless sensor network | |
| CN106412997B (en) | A kind of implementation method towards asynchronous sensor network HR-MM Radio Broadcasting Agreements | |
| CN102868507B (en) | Based on the segmentation ARQ method of transmission reliability | |
| CN107820225B (en) | Energy-balanced wireless sensor network node code distribution method | |
| CN110493843A (en) | 3D-GPSR method for routing based on circular ring shape omnidirectional antenna model | |
| CN102231891B (en) | Internet of things terminal data acquisition routing method | |
| CN110167095A (en) | A kind of mobile Ad-Hoc algorithm network routing based on Fermat point | |
| CN104486808B (en) | Duty cycle wireless sensor network minimum expectation postpones method for routing | |
| Roy et al. | Performance optimization of Ad Hoc on demand vector routing protocol in cognitive radio 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 |