CN107196859A - Message forwarding method, broadcasting method, acknowledgement messaging method and communication equipment - Google Patents

Message forwarding method, broadcasting method, acknowledgement messaging method and communication equipment Download PDF

Info

Publication number
CN107196859A
CN107196859A CN201710591785.8A CN201710591785A CN107196859A CN 107196859 A CN107196859 A CN 107196859A CN 201710591785 A CN201710591785 A CN 201710591785A CN 107196859 A CN107196859 A CN 107196859A
Authority
CN
China
Prior art keywords
message
broadcast
node
response
routing iinformation
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
Application number
CN201710591785.8A
Other languages
Chinese (zh)
Other versions
CN107196859B (en
Inventor
于杨
梁祥严
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xi'an Wonderful Electronic Technology Co Ltd
Original Assignee
Xi'an Wonderful Electronic Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xi'an Wonderful Electronic Technology Co Ltd filed Critical Xi'an Wonderful Electronic Technology Co Ltd
Priority to CN201710591785.8A priority Critical patent/CN107196859B/en
Publication of CN107196859A publication Critical patent/CN107196859A/en
Application granted granted Critical
Publication of CN107196859B publication Critical patent/CN107196859B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • H04L45/023Delayed use of routing table updates
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/16Multipoint routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/20Hop count for routing purposes, e.g. TTL

Abstract

This application discloses a kind of message forwarding method, broadcasting method, acknowledgement messaging method and communication equipment.The message forwarding method includes:Obtain at least one to broadcast the message, the broadcast message includes including with the routing iinformation for broadcasting the message and associating, the routing iinformation:Hop count;A preset value is no more than at least responsive to the hop count, the hop count is increased by 1, and after the first predetermined delay, the broadcast message is forwarded by way of broadcast.During the method and communication equipment that the embodiment of the present application is provided are set up in path, message is set up to path by only limited communication node and carries out delayed broadcasting, follow-up all forwardings are enabled to all to correspond to this delay, it is to avoid speed is set up faster in path while radio is collided.

Description

Message forwarding method, broadcasting method, acknowledgement messaging method and communication equipment
Technical field
The application belongs to internet of things field, more particularly to a kind of message forwarding method, broadcasting method, acknowledgement messaging side Method and communication equipment.
Background technology
Technology of Internet of things is one of Internet technology for developing rapidly at present.At present with technology of Internet of things in intelligent family The fields such as residence, industrial production, building control, environmental monitoring, smart city are with most wide.And in the Internet of Things network in these fields The transmission of data is not only carried out, and to carry out data acquisition and fusion, the Collaborative Control of task.It is low cost, low-power consumption, many Function is increasingly becoming the essential characteristic in these fields.At present these fields with most communication protocol include WiFi, Bluetooth, purple honeybee (ZigBee).The frequency that takes is more when WiFi equipment communicates, power consumption is big so that most WiFi equipment is needed Want normal charge;Bluetooth technology transmission range is short, is only suitable for data communication closely, it is impossible to meet most of internet of things equipment Communication requirement;When ZigBee technology works under non-beacon pattern, only terminal child node can enter park mode, coordinate Device and routing node necessarily be in active state and carry out data message of the reception processing from terminal child node, greatly add net The overall power of network.
The content of the invention
The embodiment of the present application provides a kind of simple and quick MANET routing plan.
Include in a kind of possible embodiment there is provided a kind of message forwarding method, methods described:
Obtain at least one to broadcast the message, the broadcast message includes and the routing iinformation for broadcasting the message and associating, institute Stating routing iinformation includes:Hop count;
A preset value is no more than at least responsive to the hop count, the hop count is increased by 1, and it is predetermined first After delay, the broadcast message is forwarded by way of broadcast.
Alternatively, the preset value is zero.
Alternatively, the broadcast message is sent for a source node by way of broadcast to a destination node, and described Routing iinformation also includes:Source node address, destination node address and upper hop node address;
Methods described also includes:
Store and the routing iinformation for broadcasting the message and associating;
It is described to forward the broadcast message also to include by way of broadcast:
The upper hop node address is revised as after local node addresses, forwards the broadcast to disappear by way of broadcast Breath.
Alternatively, also include in the routing iinformation:First message for identifying the broadcast message is identified;
Methods described also includes:
Identified according to the first message, judge whether the forwarded over broadcast message;
In response to the forwarded over broadcast message, the broadcast message is abandoned.
Alternatively, methods described also includes:
It is identical with local node addresses in response to a corresponding destination node address of broadcast message, by way of broadcast to The corresponding source node that broadcasts the message sends response message;Wherein, the response message includes corresponding broadcast message Routing iinformation.
Alternatively, methods described also includes:
An at least response message is obtained, what the response message was sent for a destination node by way of broadcast, and institute Stating response message includes the routing iinformation of corresponding broadcast message;
According to the routing iinformation, the response message is forwarded.
Alternatively, the forwarding response message includes:
A preset value is no more than at least responsive to the hop count in the response message, by the jump in the response message Counting number increase by 1, after the second predetermined delay, forwards the response message.
Alternatively, the forwarding response message further comprises:
According to the source node address in the routing iinformation, determine the source node address to local upper hop node Location;
According to the upper hop node address, the response message is forwarded to the upper hop node.
Alternatively, methods described also includes:
In response to source node address in the routing iinformation be local node addresses, according to the response message it is corresponding on One hop node address, is sent to the confirmation message of the destination node;
Wherein, the communication path broadcast the message for setting up between the source node and the destination node, described Confirmation message is used to determine that the path associated with the upper hop node address is the communication path.
Alternatively, also include in the response message:Total hop count of the corresponding broadcast message;
The confirmation message for being sent to the destination node further comprises:
According at least to total hop count, the upper hop node address is determined.
Alternatively, the confirmation message for being sent to the destination node further comprises:
According at least to the time of an at least response message described in acquisition, the upper hop node address is determined.
Alternatively, in methods described, by local node, with the transmitting work(no more than the predetermined power of local node one Rate forwards or sent message.
In the another aspect of the embodiment of the present application, a kind of broadcasting method is also provided, methods described includes:
Sent and broadcast the message to a destination node by way of broadcast, the broadcast message includes disappearing with the broadcast The routing iinformation of association is ceased, the routing iinformation includes:Hop count;
At least response message in response to the broadcast message is obtained, the response message is that the destination node passes through What the mode of broadcast was sent, and the response message includes the routing iinformation of corresponding broadcast message;
According to the upper hop node address of an at least response message, the confirmation message of the destination node is sent to;
Wherein, the hop count is configured to the forward node modification by forwarding the broadcast message, and the hop count meter When number is no more than a preset value, the broadcast message is configured as being forwarded after the first predetermined delay by the forward node.
Alternatively, the preset value is zero.
Alternatively, the communication path broadcast the message for setting up between the source node and the destination node, institute State confirmation message be used for determine the path that is associated with the upper hop node address be the communication path.
Alternatively, the routing iinformation in the response message also includes:The corresponding broadcast message reaches corresponding mesh Node total hop count;
The confirmation message for being sent to the destination node further comprises:
According at least to total hop count, the upper hop node address is determined.
Alternatively, the confirmation message for being sent to the destination node further comprises:
According at least to the time of an at least response message described in acquisition, the upper hop node address is determined.
Alternatively, methods described also includes:
In response to not getting an at least response message in a preset time, again by the mode of broadcast to institute State destination node and send the broadcast message.
Alternatively, in methods described, by local node, with the transmitting work(no more than the predetermined power of local node one Rate sends message.
In the application in another possible embodiment, acknowledgement messaging method is also provided, including:
At least one is obtained to broadcast the message, what the broadcast message was sent for a source node by way of broadcast, and it is described Broadcast message includes including with the routing iinformation for broadcasting the message and associating, the routing iinformation:Source node address and purpose Node address;
It is identical with local node addresses in response to destination node address in the routing iinformation of the broadcast message, pass through broadcast Mode to the source node send response message;
Wherein, the response message includes the routing iinformation corresponding to the broadcast message, and the routing iinformation includes: Hop count;
Wherein, the hop count is configured to by forwarding the broadcast message and/or forwarding the forwarding of the response message Node is changed;When the hop count is no more than the first preset value, the broadcast message is configured as being existed by the forward node Forwarded after first predetermined delay;And/or the hop count be no more than the second preset value when, the response message be configured as by The forward node is forwarded after the second predetermined delay.
In the alternatively possible embodiment of the application, a kind of communication equipment is also provided, including:
Broadcast reception unit, broadcasts the message, the broadcast message includes and the broadcast message for obtaining at least one The routing iinformation of association, the routing iinformation includes:Hop count;
Retransmission unit is broadcasted, for being no more than a preset value at least responsive to the hop count, by the hop count Increase by 1, and after the first predetermined delay, the broadcast message is forwarded by way of broadcast.
Alternatively, the preset value is zero.
Alternatively, the broadcast message is sent for a source node by way of broadcast to a destination node, and described Routing iinformation also includes:Source node address, destination node address and upper hop node address;
The communication equipment also includes:
Memory cell, for storing and the routing iinformation for broadcasting the message and associating;
The broadcast retransmission unit also includes:Updating route information module, for the upper hop node address to be changed After local node addresses, then forward by way of broadcast the broadcast message.
Alternatively, also include in the routing iinformation:First message for identifying the broadcast message is identified;
The communication equipment also includes:
Message discriminating unit, for being identified according to the first message, judges whether the forwarded over broadcast message;
Discarding unit, in response to the forwarded over broadcast message, abandoning the broadcast message.
Alternatively, the communication equipment also includes:
Response unit, for identical with local node addresses in response to the corresponding destination node address of a broadcast message, leads to The mode for crossing broadcast sends response message to the corresponding source node of the broadcast message;
Wherein, the response message includes the routing iinformation of corresponding broadcast message.
Alternatively, the communication equipment also includes:
Response receiving unit, for obtaining an at least response message, the response message is that a destination node passes through broadcast Mode send, and the response message includes the routing iinformation of corresponding broadcast message;
Response retransmission unit, for according to the routing iinformation, forwarding the response message.
Alternatively, the response retransmission unit includes:
Answering delay module, will for being no more than a preset value at least responsive to the hop count in the response message Hop count increase by 1 in the response message, after the second predetermined delay, then forwards the response message.
Alternatively, the response retransmission unit also includes:
Upper hop determining module, according to the source node address in the routing iinformation, determines the source node address to originally The upper hop node address on ground;
Upper hop forwarding module, according to the upper hop node address, forwards the response to disappear to the upper hop node Breath.
Alternatively, the communication equipment also includes:
Response confirmation unit, for being local node addresses in response to source node address in the routing iinformation, according to institute The corresponding upper hop node address of response message is stated, the confirmation message of the destination node is sent to;
Wherein, the communication path broadcast the message for setting up between the source node and the destination node, described Confirmation message is used to determine that the path associated with the upper hop node address is the communication path.
Alternatively, also include in the response message:Total hop count of the corresponding broadcast message;
The confirmation unit includes:
Total hop count selecting module, for according at least to total hop count, determining the upper hop node address.
Alternatively, the confirmation unit includes:
Response time selecting module, for the time according at least to an at least response message described in acquisition, is determined on described One hop node address.
Alternatively, in methods described, by local node, with the transmitting work(no more than the predetermined power of local node one Rate forwards or sent message.
In the another further aspect of the embodiment of the present application, a kind of communication equipment is also provided, including:
Broadcast transmission unit, broadcasts the message for being sent by way of broadcast to a destination node, the broadcast message Include including with the routing iinformation for broadcasting the message and associating, the routing iinformation:Hop count;
Response acquiring unit, for obtaining at least response message in response to the broadcast message, the response message Sent for the destination node by way of broadcast, and the response message includes the route letter of corresponding broadcast message Breath;
Response confirmation unit, according to the upper hop node address of an at least response message, is sent to the purpose section The confirmation message of point;
Wherein, the hop count is configured to the forward node modification by forwarding the broadcast message, and the hop count meter When number is no more than a preset value, the broadcast message is configured as being forwarded after the first predetermined delay by the forward node.
Alternatively, the preset value is zero.
Alternatively, the communication path broadcast the message for setting up between the source node and the destination node, institute State confirmation message be used for determine the path that is associated with the upper hop node address be the communication path.
Alternatively, the routing iinformation in the response message also includes:The corresponding broadcast message reaches corresponding mesh Node total hop count;
The response confirmation unit includes:
Total hop count selecting module, for according at least to total hop count, determining the upper hop node address.
Alternatively, the response confirmation unit includes:
Response time selecting module, for the time according at least to an at least response message described in acquisition, is determined on described One hop node address.
Alternatively, the communication equipment also includes:
Unit is replayed, in response to not getting an at least response message in a preset time, again by The mode of broadcast sends the broadcast message to the destination node.
Alternatively, by local node, to send message no more than the transmission power of the predetermined power of local node one.
In the application in another possible embodiment, a kind of communication equipment is also provided, including:
Acquiring unit is broadcasted, is broadcast the message for obtaining at least one, the broadcast message passes through broadcast for a source node What mode was sent, and the broadcast message includes including with the routing iinformation that associates of broadcasting the message, the routing iinformation: Source node address and destination node address;
Response unit, for destination node address and local node addresses in the routing iinformation in response to the broadcast message It is identical, send response message to the source node by way of broadcast;
Wherein, the response message includes the routing iinformation corresponding to the broadcast message, and the routing iinformation includes: Hop count;
Wherein, the hop count is configured to by forwarding the broadcast message and/or forwarding the forwarding of the response message Node is changed;When the hop count is no more than the first preset value, the broadcast message is configured as being existed by the forward node Forwarded after first predetermined delay;And/or the hop count be no more than the second preset value when, the response message be configured as by The forward node is forwarded after the second predetermined delay.
There is provided a kind of communication node in alternatively possible embodiment, the communication node includes:
Memory, for depositing instruction;
Processor, the instruction for performing the memory storage, the instruction to walk below the computing device Suddenly:
Obtain at least one to broadcast the message, the broadcast message includes and the routing iinformation for broadcasting the message and associating, institute Stating routing iinformation includes:Hop count;
A preset value is no more than at least responsive to the hop count, the hop count is increased by 1, and it is predetermined first After delay, the broadcast message is forwarded by way of broadcast.
There is provided a kind of computer-readable medium in alternatively possible embodiment, wherein a plurality of instruction that is stored with, The instruction is applied to be loaded and performed by processor:
Sent and broadcast the message to a destination node by way of broadcast, the broadcast message includes disappearing with the broadcast The routing iinformation of association is ceased, the routing iinformation includes:Hop count;
At least response message in response to the broadcast message is obtained, the response message passes through wide for a destination node What the mode broadcast was sent, and the response message includes the routing iinformation of corresponding broadcast message and for identifying described answer Answer the second message identifier of message;
According to the upper hop node address of an at least response message, the confirmation message of the destination node is sent to;
Wherein, the hop count is configured to the forward node modification by forwarding the broadcast message, and the hop count meter When number is no more than a preset value, the broadcast message is configured as being forwarded after the first predetermined delay by forward node.
There is provided a kind of communication node in alternatively possible embodiment, the communication node includes:
Memory, for depositing instruction;
Processor, the instruction for performing the memory storage, the instruction to walk below the computing device Suddenly:
Sent and broadcast the message to a destination node by way of broadcast, the broadcast message includes disappearing with the broadcast The routing iinformation of association is ceased, the routing iinformation includes:Hop count;
At least response message in response to the broadcast message is obtained, the response message passes through wide for a destination node What the mode broadcast was sent, and the response message includes the routing iinformation of corresponding broadcast message and for identifying described answer Answer the second message identifier of message;
According to the upper hop node address of an at least response message, the confirmation message of the destination node is sent to;
Wherein, the hop count is configured to the forward node modification by forwarding the broadcast message, and the hop count meter When number is no more than a preset value, the broadcast message is configured as being forwarded after the first predetermined delay by forward node.
There is provided a kind of computer-readable medium in alternatively possible embodiment, wherein a plurality of instruction that is stored with, The instruction is applied to be loaded and performed by processor:
At least one is obtained to broadcast the message, what the broadcast message was sent for a source node by way of broadcast, and it is described Broadcast message includes including with the routing iinformation for broadcasting the message and associating, the routing iinformation:Hop count;
Response message is sent to the source node by way of broadcast, the response message includes corresponding broadcast and disappeared The routing iinformation of breath and the second message identifier for identifying the response message;
Wherein, the hop count is configured to the forward node modification by forwarding the broadcast message, and the hop count meter When number is no more than preset value, the broadcast message is configured as being forwarded after the first predetermined delay by forward node.
There is provided a kind of communication node in alternatively possible embodiment, the communication node includes:
Memory, for depositing instruction;
Processor, the instruction for performing the memory storage, the instruction to walk below the computing device Suddenly:
At least one is obtained to broadcast the message, what the broadcast message was sent for a source node by way of broadcast, and it is described Broadcast message includes including with the routing iinformation for broadcasting the message and associating, the routing iinformation:Hop count;
Response message is sent to the source node by way of broadcast, the response message includes corresponding broadcast and disappeared The routing iinformation of breath and the second message identifier for identifying the response message;
Wherein, the hop count is configured to the forward node modification by forwarding the broadcast message, and the hop count meter When number is no more than preset value, the broadcast message is configured as being forwarded after the first predetermined delay by forward node.
There is provided a kind of computer-readable medium in alternatively possible embodiment, wherein a plurality of instruction that is stored with, The instruction is applied to be loaded and performed by processor:
With the first predetermined power, the message associated with communication path foundation is sent;
In response to the foundation of communication path, communication data is sent with the second predetermined power;
Wherein, first predetermined power is less than second predetermined power.
There is provided a kind of communication node in alternatively possible embodiment, the communication node includes:
Memory, for depositing instruction;
Processor, the instruction for performing the memory storage, the instruction to walk below the computing device Suddenly:
With the first predetermined power, the message associated with communication path foundation is sent;
In response to the foundation of communication path, communication data is sent with the second predetermined power;
Wherein, first predetermined power is less than second predetermined power.
There is provided a kind of communication node in a kind of possible embodiment, the communication node includes:
Memory, for depositing instruction;
Processor, the instruction for performing the memory storage, the instruction to walk below the computing device Suddenly:
At least one is obtained to broadcast the message, what the broadcast message was sent for a source node by way of broadcast, and it is described Broadcast message includes including with the routing iinformation for broadcasting the message and associating, the routing iinformation:Hop count;
Forwarded and broadcast the message to a destination node by way of broadcast, the broadcast message includes disappearing with the broadcast The routing iinformation of association is ceased, the routing iinformation includes:Hop count;
At least response message in response to the broadcast message is intercepted, the response message sends for a destination node , and the response message include the routing iinformation of corresponding broadcast message and for identifying the response message second Message identifier;
At least confirmation message in response to the response message is intercepted, the confirmation message is used to determine and described upper one The path of hop node address information is the communication path.The destination address of the confirmation message is judged for other nodes, and is opened A dynamic timer;
In response to the timer expiry and do not listen in response to the confirmation message at least one confirm response letter Breath, to an at least confirmation message described in the destination address forwarding of the confirmation message.
In the application in another possible embodiment, a kind of communication equipment is also provided, including:
Memory and one or more processors;
Wherein, the memory is connected with one or more of processor communications, and being stored with the memory can quilt The instruction of one or more of computing devices, the instruction is by one or more of computing devices, so that described one Individual or multiple processors can realize method as described above.
During the method and communication node that the embodiment of the present application is provided are set up in path, pass through only limited communication node Message is set up to path and carries out delayed broadcasting, enables to follow-up all forwardings all to correspond to this delay, it is to avoid radio Speed is set up faster in path while collision.In addition to solve the problem of transmission power is not reciprocity, what the embodiment of the present application was provided Method and communication node use the transmission power smaller than the power that communication process kind sends data during being set up in path, so that Avoid following communication caused due to environmental change unstable.
Brief description of the drawings
, below will be to embodiment or existing in order to illustrate more clearly of the embodiment of the present application or technical scheme of the prior art There is the accompanying drawing used required in technology description to be briefly described, it should be apparent that, drawings in the following description are only this Some embodiments of application.
Fig. 1 is a kind of flow chart of example of the message forwarding method according to the embodiment of the present application;
Fig. 2 is a kind of flow chart of example of the broadcasting method according to the embodiment of the present application;
Fig. 3 is the flow chart of another example of the message forwarding method according to the embodiment of the present application;
Fig. 4 is the flow chart of another example of the broadcasting method according to the embodiment of the present application;
Fig. 5 sets up the process schematic of communication path for the broadcasting method according to the embodiment of the present application;
Fig. 6-9 is the structured flowchart of four kinds of examples of the communication node according to the embodiment of the present application.
Embodiment
To enable present invention purpose, feature, advantage more obvious and understandable, below in conjunction with the application Accompanying drawing in embodiment, the technical scheme in the embodiment of the present application is clearly and completely described, it is clear that described reality Apply example only some embodiments of the present application, and not all embodiments.Based on the embodiment in the application, people in the art The every other embodiment that member is obtained under the premise of creative work is not made, belongs to the scope of the application protection.
Set it will be understood by those skilled in the art that the term such as " first ", " second " in the application is only used for difference difference Standby, module or parameter etc., neither represent any particular technology implication, also do not indicate that the inevitable logical order between them.
The technical scheme of each embodiment of the application is applied to include any radio sensing network of multiple communication nodes, under In the description of text, the path for broadcasting the message to initiate to set up the communication path between source node and destination node, which is set up, to disappear Exemplified by breath, but the application not limited to this.According to the technical scheme of each embodiment of the application, each communication section in radio sensing network Point can carry out networking using the communication mechanism of a kind of non-stop layer, self-organizing, peer-to-peer, multi-hop and on-demand routing so that net Network deployment is simple and quick.
Fig. 1 is refer to, is a kind of flow chart of example of message forwarding method according to the embodiment of the present application, this method can Performed by any communication node in network.As indicated with 1, the method for the present embodiment may include step:
S120. obtain an at least broadcast message, the broadcast message be a source node by way of broadcast to a purpose What node was sent, and the routing iinformation that the broadcast message includes and the broadcast message is associated.
Exemplified by broadcasting the message and set up message for path, in the method for the embodiment of the present application, any communication is by the node phase (in the description of the present application, the communication node for initiating to set up in communication/path is referred to as source section when prestige communicates with another communication node Point, the terminal communication node in communication/path is referred to as destination node), if existing available communication path therebetween in network, The physical address of the next-hop node passed through during arrival destination node that then source node can be stored according to itself carries out data Point-to-point transmission, is continued to forward, until data are sent by next-hop node according to the physical address of the next-hop node again of storage To the destination node.Otherwise, source node will send broadcast message by way of broadcast, i.e., message is set up in path.Path is set up It may include routing iinformation associated with it in message, include but is not limited to:Source node address, destination node address and hop count Count, hop count is the number of times that broadcast message is forwarded in a network, the initial jump of message is set up in the path of source node broadcast Counting number is designated as zero.Communication node in the range of signal of source node, may all get the path and set up message.
S140. a preset value is no more than in response to the hop count, after the first predetermined delay, by way of broadcast The path is forwarded to set up message.
In a kind of possible implementation, the preset value is zero, gets free routing and sets up after message, if the message Current hop count is 0, and it is that path foundation disappears to represent local node (receiving the communication node that message is set up in the path) First hop node of breath, according to the method for the embodiment of the present application, 1 is increased by the hop count, and in certain time delay Set up message to the path again afterwards to be broadcasted again, now, hop count is 1.Hereafter receive the path and set up and disappear The communication node of breath can continue to broadcast (without delay) or abandon the path to set up message according to corresponding mechanism so that path Set up message to transmit in a network as conducting in neutral net, until the path sets up message and passes through any road in network Footpath reaches corresponding destination node.
Wherein, the first predetermined delay can be the time delay pre-set, for avoiding radio from colliding, thus avoid because This message caused can not be sent in a network.For any communication node, such time may be configured as a random number.
To sum up, during the method for the present embodiment is set up in path, path is set up by only limited communication node and disappeared Breath carries out delayed broadcasting, enables to follow-up all forwardings all to correspond to this delay, it is to avoid road while radio is collided Speed is set up faster in footpath.
In addition, in order to set up the communication path between source node and destination node, communication node also tackles the road received The routing iinformation that information is set up in footpath is recorded, and is effectively contacted with being set up with the communication node of surrounding, is contributed to communication path Structure, and need not be responsible for path storage, management and safeguard specialized node.The routing iinformation also includes:Upper hop Node address, for the first hop node, the upper hop node address is source node address.Specifically, the present embodiment Method also includes:
S130. the routing iinformation of message relating, including upper hop node address, source section are set up in storage with the path Dot address, destination node address.
In addition, changing the routing iinformation for the Route establishment message to be sent in step S140:By the upper hop node Address is revised as after local node addresses, then forwards the path to set up message by way of broadcast.
In order to prevent broadcast message frame is transmitted in a network from forming loop, it may also include in the routing iinformation:For marking Know the first message mark of the broadcast message.So, each receive the communication node of broadcast message can according to this first Message identifier judges whether to forward same message, and when being, abandons the message.In such realization side In formula, methods described also includes:
S112. identified according to the first message, judge whether the forwarded over broadcast message.
S114. in response to the forwarded over special message, the broadcast message is abandoned.
In addition, as described above, the method for the embodiment of the present application can be performed by any communication node in network, perform sheet The method communication node of embodiment is while the structure of one source node of participation to the communication path between destination node, Ke Nengqi The destination node of itself or another communication.Therefore, when receiving any broadcast message, communication node will be implemented according to the application The method of example, is judged according to the routing iinformation of the message, and when being the address of itself in destination node address, by wide The mode broadcast sends the response message to the broadcast message, and the response message may pass source node, source section back by mulitpath Point can search out the final communication path between source node accordingly, while excluding the not reciprocity message caused of wireless receiving and dispatching performance It can not return.In such implementation, the method for the embodiment of the present application also includes:
S150. it is identical with local node addresses in response to the corresponding destination node address of a broadcast message, pass through broadcast Mode sends response message to the corresponding source node of the broadcast message.Wherein, the response message includes corresponding broadcast The routing iinformation of message, in addition to:The second message identifier for identifying the response message.
It should be noted that for any communication node, it is likely to be received the same broadcast message from mulitpath, Therefore, the broadcast message for abandoning and repeating to receive also is identified according to first message.In addition, in order to avoid response message and purpose The signal conflict for the broadcast message not stopped also in the range of node signal, the broadcast to response message in step S150 can also prolong The slow regular hour.Specifically:
In step S150, the response message can be forwarded by way of broadcast after the second predetermined delay.Second is pre- Fixed delay or the time delay arbitrarily pre-set, for example, propagating information according to history, second predetermined delay is set For the time required for one-hop propagation.
The communication node for implementing the method for the embodiment of the present application is likely to be in any destination node range of signal, now, According to the method for the embodiment of the present application, the response message of destination node broadcast will be received.In the method for the embodiment of the present application In, the response message will be forwarded by point-to-point mode of unicast by receiving the communication node of such response message.Specifically, The method of the embodiment of the present application may also include:
S160. an at least response message is obtained, the response message is what a destination node was sent by way of broadcast, And the response message includes the routing iinformation of corresponding broadcast message, in addition to:For identifying the response message Two message identifiers.
S180. according to routing iinformation corresponding with the response message, the response message is forwarded.
For logical between the source node that has built up and/or participated in indicate in routing iinformation corresponding with response message The communication node of letter, the path before being multiplexed directly forwards the response message to the source node.So doing to reduce Each communication node needs the routing iinformation amount stored.If having stored routing iinformation before, new storage will not be wasted Space.
And for not storing the communication node of the communication path between corresponding source node, can disappear according to broadcast The record of association is ceased, according to corresponding upper hop node address, upper hop node forwards the path to set up response message.Specifically Ground:
Step S180 can further comprise:
S182. the source node address in the corresponding routing iinformation of the response message, determines corresponding broadcast message Upper hop node address;
S184. according to the upper hop node address, the response message is forwarded to the upper hop node.
Similarly, for response message, it be may also comprise to prevent from being formed in loop, the response message:For identifying Second message identifier of the response message.So, the communication node for each receiving response message can be according to second message Mark judges whether to forward same message, and when being, abandons the message.In such implementation In, methods described also includes:
S172. according to second message identifier, the forwarded over response message is judged whether;
S174. in response to the forwarded over response message, the response message is abandoned.
Similarly, the communication node for implementing the method for the embodiment of the present application is being built between a source node and a destination node Communication path while, itself may also be the corresponding source node of another broadcast message, receive any response message Afterwards, it is necessary to according to corresponding source node address, implement to judge.Also, in the method for the embodiment of the present application, because response disappears Breath is broadcast out from destination node, therefore, and response message may be by mulitpath and reach source node, and source node exists Select after final communication path, confirmation message is sent along the path to destination node, to complete the foundation of communication path.Phase Ying Di, the method for the embodiment of the present application may also include:
S190. the corresponding source node address of routing iinformation included in response to the response message is local node Location, according to the corresponding upper hop node address of the response message, is sent to the confirmation message of destination node.The confirmation message Path for determining to associate with the upper hop node address is final logical between the source node and the destination node Believe path.
In the method for application the present embodiment, it can be determined according to any appropriate principle between source node and destination node Final communication path.In a kind of possible implementation, the path, which is set up in response message, may also include:It is described corresponding Total hop count of message is set up in path.In such implementation, it can disappear in step S190 according at least to an at least response Total hop count of breath, determines the upper hop node address.For example, it may be determined that the corresponding path of the minimum response message of total hop count is Final communication path.In alternatively possible implementation, the time that source node can be reached according to response message determines finally Communication path, for example, the corresponding path of response message that selection reaches source node earliest is used as final communication path.Such In implementation, in step S190 can according at least to obtain described in an at least response message time, determine the upper hop section Dot address.
In addition, in the method for the embodiment of the present application, in order to prevent it is following due to the environmental factors such as weather cause it is wireless Performance difference, causes communication unstable, and the message transmission during all communication nodes are set up to path uses no more than one The transmission power of predetermined power is transmitted, including above-mentioned broadcast message, response message and confirmation message, and broadcast message, The transmission power of response message and confirmation message may be the same or different.The predetermined power may be, for example, the hair of user's setting The 80% of power is penetrated, and after communication path foundation, the transmission power of user's setting can be used in the transmission of communication data 100%.
To sum up, the method for the embodiment of the present application is by the way of non-stop layer, self-organizing, peer-to-peer, multi-hop and on-demand routing The communication path set up between source node and destination node, can not need path storage, management and the node safeguarded, Mei Getong Letter node is only saved in up to source node and reaches the neighbor information that destination node is passed through, and finally builds a source node With the bidirectional transmission path of destination node, communication between fast Node can be realized.Avoided the need for when carrying out secondary data transmission The searching and foundation in path are carried out, the information of each node storage of direct basis can complete the communication task between node.
Referring now to 2, be according to a kind of a kind of flow chart of example of the broadcasting method of implementation of the embodiment of the present application, This method can be by any communication node execution as source node.As indicated with 2, this method may include step:
S220. by way of broadcast to a destination node send broadcast the message, the broadcast message include with it is described Broadcast the message the routing iinformation associated, and the routing iinformation includes:Source node address, destination node address and hop count. As described in connection with fig. 1, when source node is expected to communicate with destination node, if existing available communication therebetween in network Path, the then physical address of the next-hop node passed through during arrival destination node that source node can be stored according to itself enters line number According to point-to-point transmission, continued to forward according to the physical address of the next-hop node again of storage by next-hop node, until data It is sent to the destination node.Otherwise, source node will send a broadcast message by way of broadcast, for setting up source node and mesh Node between communication path.The broadcast message includes the routing iinformation associated with the broadcast message, including but not It is limited to:Source node address, destination node address and hop count, the hop count are configured to by forwarding the path to build The forward node modification of vertical message, and the hop count, when being no more than preset value (for example, zero), the broadcast message is configured To be forwarded by forward node after the first predetermined delay.Forward node in the range of signal of source node, may all get The broadcast message, and assist to set up logical between source node and destination node according to the message forwarding method described by reference picture 1 Believe path.
S240. at least response message in response to the broadcast message is obtained, the response message is the purpose section What point was sent by way of broadcast, and the response message includes the routing iinformation of corresponding broadcast message and for marking Know the second message identifier of the response message.
S260. according to the upper hop node address of the response message, the confirmation message of destination node is sent to, for true The fixed path associated with the upper hop node address is the communication path between the source node and the destination node.
As described in connection with fig. 1, source node can be determined according to the response message received to the final logical of destination node Believe path, and confirmation message is sent to destination node., can be true according to any appropriate principle in the method for application the present embodiment Determine the final communication path between source node and destination node.In a kind of possible implementation, in the response message also It may include:Total hop count of the corresponding broadcast message., can be according at least to described in step S260 in such implementation Total hop count of an at least response message, determines the upper hop node address.For example, it may be determined that the minimum response message of total hop count Corresponding path is final communication path.In alternatively possible implementation, source node can be reached according to response message Time determines final communication path, for example, selection reaches the corresponding path of response message of source node as final communication earliest Path.In such implementation, in step S260 can according at least to obtain described in an at least response message time, it is determined that The upper hop node address.
Because the range of receiving of each communication node is limited, in order to realize the foundation of communication path as far as possible, the present embodiment Method is also provided with certain retransmission mechanism, and source node does not get the response from destination node in a preset time and disappeared Breath, then initiate path and set up, be i.e. broadcast message of the broadcast transmission to the destination node again again.Specifically, the present embodiment Method may also include:
S280. in response to not getting an at least response message in preset time, again by the mode of broadcast The broadcast message is sent to the destination node.
In addition, in order to avoid the collision being especially likely to occur in the case of larger network size as far as possible, can be pre- one Determine to resend broadcast message after time delay.Specifically, in step S280, in preset time not getting response disappears Breath, can re-broadcast the broadcast message after the 3rd predetermined delay.
It should be noted that in each embodiment of the application first, second and the 3rd predetermined delay can be according to need Any setting is wanted, and for the foundation of each communication path (with a pair of source nodes and destination node), it is contemplated that path is set up Fail and initiate again the possibility of communication path foundation, first, second, and/or the 3rd during each path foundation are predetermined Delay can be adjusted accordingly.
It is the stream of the example of message forwarding method according to another implementation of the embodiment of the present application referring now to Fig. 3 Cheng Tu, this method can be by any communication node execution as destination node.As indicated at 3, this method may include step:
S320. an at least broadcast message is obtained, the broadcast message is what a source node was sent by way of broadcast, and The broadcast message includes including with the routing iinformation for broadcasting the message and associating, the routing iinformation:Source node address, mesh Node address and hop count.
S340. response message is sent to the source node by way of broadcast, the response message includes corresponding The routing iinformation of broadcast message and the second message identifier for identifying the response message;
Wherein, the hop count is configured to the forward node modification by forwarding the broadcast message, and the hop count meter When number is no more than preset value, the broadcast message is configured as being forwarded after the first predetermined delay by forward node.
In order to avoid response message and the signal conflict for the broadcast message not stopped also in destination node range of signal, in step Also can be postponed the regular hour to the broadcast of response message in rapid S340.Specifically, in the second predetermined delay in step S340 Afterwards, the response message is forwarded by way of broadcast.
In addition, as described with reference to fig. 1, for any destination node, it is likely to be received from the same of mulitpath One broadcast message, accordingly, it would be desirable to abandon the broadcast message for repeating to receive according to the corresponding first message mark that broadcasts the message.Tool Body, the method for the embodiment of the present application may also include:
S332. identified according to the first message, judge whether to receive the broadcast message;
S334. in response to receiving the broadcast message, the broadcast message is abandoned.
It should be noted that in the description that reference picture 2 and Fig. 3 are done, to avoid repeating, pair with being done with reference to Fig. 1 The part recorded in description is identical or corresponding feature is not described, and such identical or corresponding technical characteristic can refer to The description that Fig. 1 is done.
As indicated at 4, the embodiment of the present application additionally provides a kind of communication means, and this method includes:
S420. with the first predetermined power, the message associated with communication path foundation is sent, such information is schemed as combined Broadcast message, response message and the confirmation message of 1-3 descriptions.
S440. in response to the foundation of communication path, communication data is sent with the second predetermined power, namely communication path is set up Afterwards, the data transmitted between source node and destination node along the path.
Wherein, first predetermined power is less than second predetermined power.In a kind of possible implementation, first Predetermined power is no more than the 80% of the predetermined power (for example, power of user's setting) of corresponding communication node, the second default work( Rate is the 100% of the predetermined power of communication node.
It will be understood by those skilled in the art that in the above method of the application embodiment, the sequence number of each step Size is not meant to the priority of execution sequence, and the execution sequence of each step should be determined with its function and internal logic, without answering Implementation process to the application embodiment constitutes any limit.
Accordingly, in embodiments herein a kind of communication is also provided simultaneously with the method in the various embodiments described above to set It is standby, including:
Broadcast reception unit, broadcasts the message, the broadcast message includes and the broadcast message for obtaining at least one The routing iinformation of association, the routing iinformation includes:Hop count;
Retransmission unit is broadcasted, for being no more than a preset value at least responsive to the hop count, by the hop count Increase by 1, and after the first predetermined delay, the broadcast message is forwarded by way of broadcast.
Alternatively, the preset value is zero.
Alternatively, the broadcast message is sent for a source node by way of broadcast to a destination node, and described Routing iinformation also includes:Source node address, destination node address and upper hop node address;
The communication equipment also includes:
Memory cell, for storing and the routing iinformation for broadcasting the message and associating;
The broadcast retransmission unit also includes:Updating route information module, for the upper hop node address to be changed After local node addresses, then forward by way of broadcast the broadcast message.
Alternatively, also include in the routing iinformation:First message for identifying the broadcast message is identified;
The communication equipment also includes:
Message discriminating unit, for being identified according to the first message, judges whether the forwarded over broadcast message;
Discarding unit, in response to the forwarded over broadcast message, abandoning the broadcast message.
Alternatively, the communication equipment also includes:
Response unit, for identical with local node addresses in response to the corresponding destination node address of a broadcast message, leads to The mode for crossing broadcast sends response message to the corresponding source node of the broadcast message;
Wherein, the response message includes the routing iinformation of corresponding broadcast message.
Alternatively, the communication equipment also includes:
Response receiving unit, for obtaining an at least response message, the response message is that a destination node passes through broadcast Mode send, and the response message includes the routing iinformation of corresponding broadcast message;
Response retransmission unit, for according to the routing iinformation, forwarding the response message.
Alternatively, the response retransmission unit includes:
Answering delay module, will for being no more than a preset value at least responsive to the hop count in the response message Hop count increase by 1 in the response message, after the second predetermined delay, then forwards the response message.
Alternatively, the response retransmission unit also includes:
Upper hop determining module, according to the source node address in the routing iinformation, determines the source node address to originally The upper hop node address on ground;
Upper hop forwarding module, according to the upper hop node address, forwards the response to disappear to the upper hop node Breath.
Alternatively, the communication equipment also includes:
Response confirmation unit, for being local node addresses in response to source node address in the routing iinformation, according to institute The corresponding upper hop node address of response message is stated, the confirmation message of the destination node is sent to;
Wherein, the communication path broadcast the message for setting up between the source node and the destination node, described Confirmation message is used to determine that the path associated with the upper hop node address is the communication path.
Alternatively, also include in the response message:Total hop count of the corresponding broadcast message;
The confirmation unit includes:
Total hop count selecting module, for according at least to total hop count, determining the upper hop node address.
Alternatively, the confirmation unit includes:
Response time selecting module, for the time according at least to an at least response message described in acquisition, is determined on described One hop node address.
Alternatively, in methods described, by local node, with the transmitting work(no more than the predetermined power of local node one Rate forwards or sent message.
In the another further aspect of the embodiment of the present application, a kind of communication equipment is also provided, including:
Broadcast transmission unit, broadcasts the message for being sent by way of broadcast to a destination node, the broadcast message Include including with the routing iinformation for broadcasting the message and associating, the routing iinformation:Hop count;
Response acquiring unit, for obtaining at least response message in response to the broadcast message, the response message Sent for the destination node by way of broadcast, and the response message includes the route letter of corresponding broadcast message Breath;
Response confirmation unit, according to the upper hop node address of an at least response message, is sent to the purpose section The confirmation message of point;
Wherein, the hop count is configured to the forward node modification by forwarding the broadcast message, and the hop count meter When number is no more than a preset value, the broadcast message is configured as being forwarded after the first predetermined delay by the forward node.
Alternatively, the preset value is zero.
Alternatively, the communication path broadcast the message for setting up between the source node and the destination node, institute State confirmation message be used for determine the path that is associated with the upper hop node address be the communication path.
Alternatively, the routing iinformation in the response message also includes:The corresponding broadcast message reaches corresponding mesh Node total hop count;
The response confirmation unit includes:
Total hop count selecting module, for according at least to total hop count, determining the upper hop node address.
Alternatively, the response confirmation unit includes:
Response time selecting module, for the time according at least to an at least response message described in acquisition, is determined on described One hop node address.
Alternatively, the communication equipment also includes:
Unit is replayed, in response to not getting an at least response message in a preset time, again by The mode of broadcast sends the broadcast message to the destination node.
Alternatively, by local node, to send message no more than the transmission power of the predetermined power of local node one.
In the application in another possible embodiment, a kind of communication equipment is also provided, including:
Acquiring unit is broadcasted, is broadcast the message for obtaining at least one, the broadcast message passes through broadcast for a source node What mode was sent, and the broadcast message includes including with the routing iinformation that associates of broadcasting the message, the routing iinformation: Source node address and destination node address;
Response unit, for destination node address and local node addresses in the routing iinformation in response to the broadcast message It is identical, send response message to the source node by way of broadcast;
Wherein, the response message includes the routing iinformation corresponding to the broadcast message, and the routing iinformation includes: Hop count;
Wherein, the hop count is configured to by forwarding the broadcast message and/or forwarding the forwarding of the response message Node is changed;When the hop count is no more than the first preset value, the broadcast message is configured as being existed by the forward node Forwarded after first predetermined delay;And/or the hop count be no more than the second preset value when, the response message be configured as by The forward node is forwarded after the second predetermined delay.
In addition, the embodiment of the present application additionally provides a kind of storage device, for example, computer-readable medium, is included in and is held The computer-readable instruction of following operation is carried out during row:Perform each step of method shown in above-mentioned Fig. 1 in embodiment Operation.
In addition, the embodiment of the present application additionally provides a kind of storage device, for example, computer-readable medium, is included in and is held The computer-readable instruction of following operation is carried out during row:Perform each step of method shown in above-mentioned Fig. 2 in embodiment Operation.
In addition, the embodiment of the present application additionally provides a kind of storage device, for example, computer-readable medium, is included in and is held The computer-readable instruction of following operation is carried out during row:Perform each step of method shown in above-mentioned Fig. 3 in embodiment Operation.
In addition, the embodiment of the present application additionally provides a kind of storage device, for example, computer-readable medium, is included in and is held The computer-readable instruction of following operation is carried out during row:Perform each step of method shown in above-mentioned Fig. 4 in embodiment Operation.
The technical scheme of each embodiment of the application is further illustrated below by specific example.
Reference picture 5, is to set up communication node (source node) A to communication node (purpose according to the method for each example of the application Node) S communication path process schematic.
As shown in figure 5, when node A expects to be communicated with node S, passing through if storing arrival node S in node A Next-hop node physical address, then show to have existed in a network communication path (such as Fig. 5 between node A and node S In A → C → I → J → S).Node A sends the data to node C according to the node C of storage physical address, node C according to The node I of storage physical address continues to send the data to node I, and until this data is transferred to node S, communication task is complete Into.
If there is no storage to reach the physical address for the next-hop that node S passes through in node A, respectively implement according to the application The technical scheme of example, sets up communication path as follows.
1st, node A is sent path by way of broadcast and sets up message, is included in the message:Message id (is distinguished each time Broadcast), source node address, destination address, hop count (being currently zero), the forward node address of upper hop.
2nd, assume that whole network interior joint B, C, D have received this path and set up message:
Each first node B, C, D record following routing iinformation:The message id of broadcast, upper hop node address, source node Location, destination node address.
Then, each random delay for a period of time, and path is set up the hop count included in message by each node B, C, D Plus 1, then secondary broadcast, the hop count that the path of secondary broadcast is set up in message is 1.
3rd, then, node E, F in network have received the broadcast from node D, and node G have received from node B's Broadcast.It is due to that node does not repeat to receive to same ID broadcast messages although node G can also receive the broadcast from node C, Broadcast before has carried out random delay when being forwarded by node B, C, D, therefore node C message reaches later, so being dropped (dotted arrow show the corresponding bang path of the message being dropped in Fig. 4).
Node E, F, the G for receiving message equally record following information:Path is with setting up request message ID, upper hop node Location, source node address, destination node address.Then, node E, F, G is no longer postponed, and will directly be included in broadcast message Hop count adds 1 again, then three broadcast (now hop count is 2).
4th, it is final, until message (message of the node S similarly for same ID is set up in the node S paths for receiving first broadcast Do not repeat to receive), posterior nodal point S delay one-hop propagations required for time, start optimal communication path and confirm process, to help Optimal path is found in node A, while excluding the not reciprocity message caused of wireless receiving and dispatching performance can not return.
Optimal communication path confirms that process is as follows:
1st, node S broadcasts footpath is set up in response request, the broadcast message and included:Path set up response request message ID, Request message ID, source node address are set up in path, destination node address, (node S receives corresponding path and sets up message total hop count When hop count), start inverse communication path discovery procedure.
2nd, assume that node N, J, Q have received this broadcast message.
Node N, J, Q first each inquires about the physical address for whether recording the upper hop node for reaching node A, if note Recorded, then can random delay for a period of time after, even higher level of node directly into record sends response messages of the S to A;
If not recording the upper hop address for going to node A after node N, J, Q inquiry, can one section of random delay when Between after, the upper hop node address set up according to path in the corresponding route messages of request message, upper hop node is sent to A Response message.
3rd, assume that upper hop node includes node L, K, I, H, node L, K, I, H are received after this point-to-point response message, Also according to above-mentioned steps, inquire about oneself whether recorded the upper hop address record for reaching A first, if it is not, continuing The response message that the corresponding upper hop node of request message is sent to A is set up to path.
4th, by that analogy, until node A receives the response message (being illustrated in Fig. 4 by block arrow) that node S is sent first, then Do not reprocess other nodes send response message (as in Fig. 4 as D to A and as shown in B to A thick dashed line arrow), and start Final path confirms.
5th, the upper hop node C transmissions that node A sets up response message to the path received go to node S path foundation really Recognize information, the upper hop address for going to node S and next address of blotter before are saved in the route of oneself by node C In table, then continue transmitting path to next node I and set up confirmation message, node I also carries out blotter before final Confirm to preserve, set up confirmation message until node S receives path, process completion is set up in whole path.
Illustrate, set up process in whole path and collect, the 80% of the transmission power that all nodes are set using user enters Row transmitting, the wireless performance difference for preventing future from being caused due to environmental factors such as weather, causes communication unstable.Node A is to section Point S, which sends path and sets up message and node S and carry out path to node A, to be set up response and node A and is built to node S transmitting pathes Vertical confirmation message, there is timeout mechanism, if can restart path without corresponding in the time of specifying and set up process.
After path is successfully established, when node A is to node S transmission data, a hop node sends data, node S directly down Confirmation response is carried out after receiving, to ensure that communication is reliable, if time-out does not receive response here, path discovery is restarted Process.
In some instances it is possible to which the both direction transmission power for inter-node communication occur is not reciprocity to cause routing failure Situation.Assuming that now with tetra- nodes of ABCD, when initiating route requests:The message that A is sent only B can be received, and what B was sent out only has C can be received, and the destination node D of C hairs is received.When returning to route requests:Due to power not to the problems such as, D send B and C all It has received, then message first can be issued A by B, this is that path has reformed into A → B → D when A carries out path confirmation, and actually B It can not be communicated to D, ultimately result in D and can not receive message, routing failure.To solve this problem, further side is employed Case.According to further scheme, in the above case said, when D, which sends broadcast, returns to route requests, B and C intercept the road that D is returned By asking, it is possible to do a record.When A sends route confirmation message, B is received when issue D, and it is true that C intercepts this Recognize message, and start a timer.Start after timer, C is listened to be confirmed accordingly in response at least the one of the confirmation message Information.The confirmation corresponding information is sent by destination node.If after timer expires, if not receive D corresponding to A confirmation by C Message, then C can send a confirmation message will route confirmation corresponding message to D, D, can first give C, then C continues to B, then to A.
Fig. 6 is the structural representation of another example of the communication node of the embodiment of the present application, the application specific embodiment Implementing for communication node is not limited.As shown in fig. 6, the communication node 600 can include:
Processor (processor) 610, communication interface (Communications Interface) 620, memory (memory) 630 and communication bus 640.Wherein:
Processor 610, communication interface 620 and memory 630 complete mutual communication by communication bus 640.
Communication interface 620, communicates for the network element with such as client etc..
Processor 610, for configuration processor 632, can specifically perform the correlation step in above method embodiment.
Specifically, program 632 can include program code, and described program code includes computer-managed instruction.
Processor 610 is probably a central processor CPU, or specific integrated circuit ASIC (Application Specific Integrated Circuit), or it is arranged to implement one or more integrated electricity of the embodiment of the present application Road.
Memory 630, for depositing program 632.Memory 630 may include high-speed RAM memory, it is also possible to also include Nonvolatile memory (non-volatile memory), for example, at least one magnetic disk storage.Program 632 can specifically be used Following steps are performed in causing the communication node 600:
Obtain at least one to broadcast the message, the broadcast message includes and the routing iinformation for broadcasting the message and associating, institute Stating routing iinformation includes:Hop count;
A preset value is no more than at least responsive to the hop count, the hop count is increased by 1, and it is predetermined first After delay, the broadcast message is forwarded by way of broadcast.
In program 632 each step implement it is corresponding in the corresponding steps and unit that may refer in above-described embodiment Description, will not be described here.It is apparent to those skilled in the art that, it is for convenience and simplicity of description, above-mentioned to retouch The equipment and the specific work process of module stated, may be referred to the corresponding process description in preceding method embodiment, herein no longer Repeat.
Fig. 7 is the structural representation of another example of the communication node of the embodiment of the present application, the application specific embodiment Implementing for communication node is not limited.As shown in fig. 7, the communication node 700 can include:
Processor (processor) 710, communication interface (Communications Interface) 720, memory (memory) 730 and communication bus 740.Wherein:
Processor 710, communication interface 720 and memory 730 complete mutual communication by communication bus 740.
Communication interface 720, communicates for the network element with such as client etc..
Processor 710, for configuration processor 732, can specifically perform the correlation step in above method embodiment.
Specifically, program 732 can include program code, and described program code includes computer-managed instruction.
Processor 710 is probably a central processor CPU, or specific integrated circuit ASIC (Application Specific Integrated Circuit), or it is arranged to implement one or more integrated electricity of the embodiment of the present application Road.
Memory 730, for depositing program 732.Memory 730 may include high-speed RAM memory, it is also possible to also include Nonvolatile memory (non-volatile memory), for example, at least one magnetic disk storage.Program 732 can specifically be used Following steps are performed in causing the communication node 700:
Sent and broadcast the message to a destination node by way of broadcast, the broadcast message includes disappearing with the broadcast The routing iinformation of association is ceased, the routing iinformation includes:Hop count;
At least response message in response to the broadcast message is obtained, the response message passes through wide for a destination node What the mode broadcast was sent, and the response message includes the routing iinformation of corresponding broadcast message and for identifying described answer Answer the second message identifier of message;
According to the upper hop node address of an at least response message, the confirmation message of the destination node is sent to;
Wherein, the hop count is configured to the forward node modification by forwarding the broadcast message, and the hop count meter When number is no more than a preset value, the broadcast message is configured as being forwarded after the first predetermined delay by forward node.
In program 732 each step implement it is corresponding in the corresponding steps and unit that may refer in above-described embodiment Description, will not be described here.It is apparent to those skilled in the art that, it is for convenience and simplicity of description, above-mentioned to retouch The equipment and the specific work process of module stated, may be referred to the corresponding process description in preceding method embodiment, herein no longer Repeat.
Fig. 8 is the structural representation of another example of the communication node of the embodiment of the present application, the application specific embodiment Implementing for communication node is not limited.As shown in figure 8, the communication node 800 can include:
Processor (processor) 810, communication interface (Communications Interface) 820, memory (memory) 830 and communication bus 840.Wherein:
Processor 810, communication interface 820 and memory 830 complete mutual communication by communication bus 840.
Communication interface 820, communicates for the network element with such as client etc..
Processor 810, for configuration processor 832, can specifically perform the correlation step in above method embodiment.
Specifically, program 832 can include program code, and described program code includes computer-managed instruction.
Processor 810 is probably a central processor CPU, or specific integrated circuit ASIC (Application Specific Integrated Circuit), or it is arranged to implement one or more integrated electricity of the embodiment of the present application Road.
Memory 830, for depositing program 832.Memory 830 may include high-speed RAM memory, it is also possible to also include Nonvolatile memory (non-volatile memory), for example, at least one magnetic disk storage.Program 832 can specifically be used Following steps are performed in causing the communication node 800:
At least one is obtained to broadcast the message, what the broadcast message was sent for a source node by way of broadcast, and it is described Broadcast message includes including with the routing iinformation for broadcasting the message and associating, the routing iinformation:Hop count;
Response message is sent to the source node by way of broadcast, the response message includes corresponding broadcast and disappeared The routing iinformation of breath and the second message identifier for identifying the response message;
Wherein, the hop count is configured to the forward node modification by forwarding the broadcast message, and the hop count meter When number is no more than preset value, the broadcast message is configured as being forwarded after the first predetermined delay by forward node.
In program 832 each step implement it is corresponding in the corresponding steps and unit that may refer in above-described embodiment Description, will not be described here.It is apparent to those skilled in the art that, it is for convenience and simplicity of description, above-mentioned to retouch The equipment and the specific work process of module stated, may be referred to the corresponding process description in preceding method embodiment, herein no longer Repeat.
Fig. 9 is the structural representation of another example of the communication node of the embodiment of the present application, the application specific embodiment Implementing for communication node is not limited.As shown in figure 9, the communication node 900 can include:
Processor (processor) 910, communication interface (Communications Interface) 920, memory (memory) 930 and communication bus 940.Wherein:
Processor 910, communication interface 920 and memory 930 complete mutual communication by communication bus 940.
Communication interface 920, communicates for the network element with such as client etc..
Processor 910, for configuration processor 932, can specifically perform the correlation step in above method embodiment.
Specifically, program 932 can include program code, and described program code includes computer-managed instruction.
Processor 910 is probably a central processor CPU, or specific integrated circuit ASIC (Application Specific Integrated Circuit), or it is arranged to implement one or more integrated electricity of the embodiment of the present application Road.
Memory 930, for depositing program 932.Memory 930 may include high-speed RAM memory, it is also possible to also include Nonvolatile memory (non-volatile memory), for example, at least one magnetic disk storage.Program 932 can specifically be used Following steps are performed in causing the communication node 900:
With the first predetermined power, the message associated with communication path foundation is sent;
In response to the foundation of communication path, communication data is sent with the second predetermined power;
Wherein, first predetermined power is less than second predetermined power.
In program 932 each step implement it is corresponding in the corresponding steps and unit that may refer in above-described embodiment Description, will not be described here.It is apparent to those skilled in the art that, it is for convenience and simplicity of description, above-mentioned to retouch The equipment and the specific work process of module stated, may be referred to the corresponding process description in preceding method embodiment, herein no longer Repeat.
It is apparent to those skilled in the art that, for convenience and simplicity of description, the equipment of foregoing description With the specific work process of module, the correspondence description in aforementioned means embodiment is may be referred to, be will not be repeated here.
Although subject matter described herein is held in the execution on the computer systems of binding operation system and application program There is provided in capable general context, but it will be appreciated by the appropriately skilled person that may also be combined with other kinds of program module To perform other realizations.In general, program module include perform particular task or realize particular abstract data type routine, Program, component, data structure and other kinds of structure.It will be understood by those skilled in the art that subject matter described herein can To be put into practice using other computer system configurations, including portable equipment, multicomputer system, based on microprocessor or it can compile Journey consumption electronic product, minicom, mainframe computer etc., it is possible to use task by communication network by being connected wherein In the DCE that remote processing devices are performed.In a distributed computing environment, program module can be located locally and far Journey memory storage device both in.
Those of ordinary skill in the art are it is to be appreciated that the list of each example described with reference to the embodiments described herein Member and method and step, can be realized with the combination of electronic hardware or computer software and electronic hardware.These functions are actually Performed with hardware or software mode, depending on the application-specific and design constraint of technical scheme.Professional and technical personnel Described function can be realized using distinct methods to each specific application, but this realization is it is not considered that exceed Scope of the present application.
If the function is realized using in the form of SFU software functional unit and is used as independent production marketing or in use, can be with It is stored in a computer read/write memory medium.Understood based on such, the technical scheme of the application is substantially in other words The part contributed to original technology or the part of the technical scheme can be embodied in the form of software product, the meter Calculation machine software product is stored in a storage medium, including some instructions are to cause a computer equipment (can be individual People's computer, server, or network equipment etc.) perform all or part of step of the application each embodiment methods described. And foregoing computer read/write memory medium include with store as computer-readable instruction, data structure, program module or its Any mode or technology of the information such as his data are come the physics volatibility realized and non-volatile, removable and can not be because of east Jie Matter.Computer read/write memory medium is specifically included, but is not limited to, USB flash disk, mobile hard disk, read-only storage (ROM, Read- Only Memory), random access memory (RAM, Random Access Memory), Erasable Programmable Read Only Memory EPROM (EPROM), EEPROM (EEPROM), flash memory or other solid-state memory technologies, CD-ROM, numeral are more Functional disc (DVD), HD-DVD, blue light (Blue-Ray) or other light storage devices, tape, disk storage or other magnetic storages Equipment can be used for any other medium for storing information needed and being accessed by computer.
Embodiment of above is merely to illustrate the present invention, and not limitation of the present invention, about the common of technical field Technical staff, without departing from the spirit and scope of the present invention, can also make a variety of changes and modification, therefore all Equivalent technical scheme falls within scope of the invention, and scope of patent protection of the invention should be defined by the claims.

Claims (10)

1. a kind of message forwarding method, it is characterised in that methods described includes:
Obtain at least one to broadcast the message, the broadcast message includes and the routing iinformation for broadcasting the message and associating, the road Included by information:Hop count;
A preset value is no more than at least responsive to the hop count, the hop count is increased by 1, and in the first predetermined delay Afterwards, the broadcast message is forwarded by way of broadcast.
2. according to the method described in claim 1, it is characterised in that methods described also includes:
Obtain an at least response message, the response message is that a destination node is sent by way of broadcast, and it is described should Answering message includes the routing iinformation of corresponding broadcast message;
According to the routing iinformation, the response message is forwarded.
3. method according to claim 2, it is characterised in that the forwarding response message includes:
A preset value is no more than at least responsive to the hop count in the response message, by the hop count meter in the response message Number increase by 1, after the second predetermined delay, forwards the response message.
4. according to the method in claim 2 or 3, it is characterised in that the forwarding response message further comprises:
According to the source node address in the routing iinformation, determine the source node address to local upper hop node address;
According to the upper hop node address, the response message is forwarded to the upper hop node.
5. a kind of broadcasting method, it is characterised in that methods described includes:
Sent and broadcast the message to a destination node by way of broadcast, the broadcast message includes closing with the broadcast message The routing iinformation of connection, the routing iinformation includes:Hop count;
At least response message in response to the broadcast message is obtained, the response message is that the destination node passes through broadcast Mode send, and the response message includes the routing iinformation of corresponding broadcast message;
According to the upper hop node address of an at least response message, the confirmation message of the destination node is sent to;
Wherein, the hop count is configured to the forward node modification by forwarding the broadcast message, and the hop count is not During more than a preset value, the broadcast message is configured as being forwarded after the first predetermined delay by the forward node.
6. a kind of acknowledgement messaging method, it is characterised in that methods described includes:
At least one is obtained to broadcast the message, what the broadcast message was sent for a source node by way of broadcast, and the broadcast Message includes including with the routing iinformation for broadcasting the message and associating, the routing iinformation:Source node address and destination node Address;
It is identical with local node addresses in response to destination node address in the routing iinformation of the broadcast message, pass through the side of broadcast Formula sends response message to the source node;
Wherein, the response message includes the routing iinformation corresponding to the broadcast message, and the routing iinformation includes:Hop count Count;
Wherein, the hop count is configured to by forwarding the broadcast message and/or forwarding the forward node of the response message Modification;When the hop count is no more than the first preset value, the broadcast message is configured as by the forward node first Forwarded after predetermined delay;And/or the hop count be no more than the second preset value when, the response message is configured as by described Forward node is forwarded after the second predetermined delay.
7. a kind of communication equipment, it is characterised in that including:
Broadcast reception unit, broadcasts the message for obtaining at least one, and the broadcast message includes associating with the broadcast message Routing iinformation, the routing iinformation includes:Hop count;
Retransmission unit is broadcasted, for being no more than a preset value at least responsive to the hop count, the hop count is increased 1, and after the first predetermined delay, the broadcast message is forwarded by way of broadcast.
8. a kind of communication equipment, it is characterised in that including:
Broadcast transmission unit, broadcasts the message for being sent by way of broadcast to a destination node, is wrapped in the broadcast message Include includes with the routing iinformation for broadcasting the message and associating, the routing iinformation:Hop count;
Response acquiring unit, for obtaining at least response message in response to the broadcast message, the response message is institute State what destination node was sent by way of broadcast, and the response message includes the routing iinformation of corresponding broadcast message;
Response confirmation unit, according to the upper hop node address of an at least response message, is sent to the destination node Confirmation message;
Wherein, the hop count is configured to the forward node modification by forwarding the broadcast message, and the hop count is not During more than a preset value, the broadcast message is configured as being forwarded after the first predetermined delay by the forward node.
9. a kind of communication equipment, it is characterised in that including:
Acquiring unit is broadcasted, is broadcast the message for obtaining at least one, the broadcast message is a source node by way of broadcast Send, and the broadcast message includes including with the routing iinformation for broadcasting the message and associating, the routing iinformation:Save in source Dot address and destination node address;
Response unit, for destination node address in the routing iinformation in response to the broadcast message and local node addresses phase Together, response message is sent to the source node by way of broadcast;
Wherein, the response message includes the routing iinformation corresponding to the broadcast message, and the routing iinformation includes:Hop count Count;
Wherein, the hop count is configured to by forwarding the broadcast message and/or forwarding the forward node of the response message Modification;When the hop count is no more than the first preset value, the broadcast message is configured as by the forward node first Forwarded after predetermined delay;And/or the hop count be no more than the second preset value when, the response message is configured as by described Forward node is forwarded after the second predetermined delay.
10. a kind of communication equipment, it is characterised in that including:
Memory and one or more processors;
Wherein, the memory is connected with one or more of processor communications, and being stored with the memory can be described The instruction that one or more processors are performed, the instruction by one or more of computing devices so that it is one or Multiple processors can realize the method as any one of claim 1-6.
CN201710591785.8A 2017-07-19 2017-07-19 Message forwarding method, broadcasting method, message response method and communication equipment Active CN107196859B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710591785.8A CN107196859B (en) 2017-07-19 2017-07-19 Message forwarding method, broadcasting method, message response method and communication equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710591785.8A CN107196859B (en) 2017-07-19 2017-07-19 Message forwarding method, broadcasting method, message response method and communication equipment

Publications (2)

Publication Number Publication Date
CN107196859A true CN107196859A (en) 2017-09-22
CN107196859B CN107196859B (en) 2020-11-06

Family

ID=59883282

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710591785.8A Active CN107196859B (en) 2017-07-19 2017-07-19 Message forwarding method, broadcasting method, message response method and communication equipment

Country Status (1)

Country Link
CN (1) CN107196859B (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108712737A (en) * 2018-05-04 2018-10-26 北京洛克家智能科技有限责任公司 A kind of method and system of information exchange
CN110830917A (en) * 2019-09-24 2020-02-21 中移(杭州)信息技术有限公司 User distribution display method, device, terminal and storage medium
CN111511013A (en) * 2020-03-27 2020-08-07 桃芯科技(苏州)有限公司 Method, electronic device, and computer storage medium for synchronizing control signals
CN111886848A (en) * 2018-03-23 2020-11-03 昕诺飞控股有限公司 Method and apparatus for querying address advertisement messages in a communication network
CN113938387A (en) * 2021-10-20 2022-01-14 杭州和利时自动化有限公司 Communication method, device and readable storage medium
CN114024786A (en) * 2022-01-04 2022-02-08 杭州趣链科技有限公司 Message broadcasting method and device, computer equipment and storage medium

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020137459A1 (en) * 2001-03-21 2002-09-26 Koichi Ebata Network and method for transmitting messages on a common wireless resource without causing broadcast storm
US20070097945A1 (en) * 2005-10-27 2007-05-03 Wang Guo Q Methods and systems for a wireless routing architecture and protocol
US20080117885A1 (en) * 2006-11-21 2008-05-22 Samsung Electronics Co., Ltd. Control message processing method in wireless mesh network and control message processing apparatus using the method
CN101212495A (en) * 2006-12-26 2008-07-02 株式会社Ntt都科摩 Locating method and device in wireless multi-hop network
CN101489276A (en) * 2009-01-06 2009-07-22 北京交通大学 Multicast routing method for Ad Hoc network
CN101626303A (en) * 2008-07-09 2010-01-13 华为技术有限公司 Method, system and device for sending data
CN101873273A (en) * 2010-07-08 2010-10-27 华为技术有限公司 Routing forwarding method, routing node and wireless communication network
CN102821437A (en) * 2012-08-13 2012-12-12 东南大学 Ad-hoc on-demand distance vector routing method
CN105681028A (en) * 2015-12-28 2016-06-15 华南师范大学 Multi-user network system for footballene structure and quantum key distribution method thereof

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020137459A1 (en) * 2001-03-21 2002-09-26 Koichi Ebata Network and method for transmitting messages on a common wireless resource without causing broadcast storm
US20070097945A1 (en) * 2005-10-27 2007-05-03 Wang Guo Q Methods and systems for a wireless routing architecture and protocol
US20080117885A1 (en) * 2006-11-21 2008-05-22 Samsung Electronics Co., Ltd. Control message processing method in wireless mesh network and control message processing apparatus using the method
CN101212495A (en) * 2006-12-26 2008-07-02 株式会社Ntt都科摩 Locating method and device in wireless multi-hop network
CN101626303A (en) * 2008-07-09 2010-01-13 华为技术有限公司 Method, system and device for sending data
CN101489276A (en) * 2009-01-06 2009-07-22 北京交通大学 Multicast routing method for Ad Hoc network
CN101873273A (en) * 2010-07-08 2010-10-27 华为技术有限公司 Routing forwarding method, routing node and wireless communication network
CN102821437A (en) * 2012-08-13 2012-12-12 东南大学 Ad-hoc on-demand distance vector routing method
CN105681028A (en) * 2015-12-28 2016-06-15 华南师范大学 Multi-user network system for footballene structure and quantum key distribution method thereof

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111886848A (en) * 2018-03-23 2020-11-03 昕诺飞控股有限公司 Method and apparatus for querying address advertisement messages in a communication network
CN108712737A (en) * 2018-05-04 2018-10-26 北京洛克家智能科技有限责任公司 A kind of method and system of information exchange
CN110830917A (en) * 2019-09-24 2020-02-21 中移(杭州)信息技术有限公司 User distribution display method, device, terminal and storage medium
CN111511013A (en) * 2020-03-27 2020-08-07 桃芯科技(苏州)有限公司 Method, electronic device, and computer storage medium for synchronizing control signals
CN111511013B (en) * 2020-03-27 2022-02-01 桃芯科技(苏州)有限公司 Method, electronic device, and computer storage medium for synchronizing control signals
CN113938387A (en) * 2021-10-20 2022-01-14 杭州和利时自动化有限公司 Communication method, device and readable storage medium
CN114024786A (en) * 2022-01-04 2022-02-08 杭州趣链科技有限公司 Message broadcasting method and device, computer equipment and storage medium
CN114024786B (en) * 2022-01-04 2022-04-08 杭州趣链科技有限公司 Message broadcasting method and device, computer equipment and storage medium

Also Published As

Publication number Publication date
CN107196859B (en) 2020-11-06

Similar Documents

Publication Publication Date Title
CN107196859A (en) Message forwarding method, broadcasting method, acknowledgement messaging method and communication equipment
CN107453996A (en) Acknowledgement messaging method, message forwarding method and communicator
Das et al. Adaptive and intelligent energy efficient routing for transparent heterogeneous ad-hoc network by fusion of game theory and linear programming
Labiod Wireless ad hoc and Sensor Networks
Goto et al. Data gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks
Kafhali et al. Effect of Mobility and Traffic Models on the energy consumption in MANET Routing Protocols
JP4203997B2 (en) Address assignment method in sensor network
Zhao et al. Approximation algorithms for broadcasting in duty cycled wireless sensor networks
Kundaliya et al. Routing algorithms for wireless sensor networks: Analysed and compared
Dezfouli et al. DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks
CN105072657A (en) Data naming-centered wireless sensor network asynchronous sleep scheduling method
Crepaldi et al. Quicksilver: Application-driven inter-and intra-cluster communication in vanets
Abid et al. A survey on recent contention-free MAC protocols for static and mobile wireless decentralized networks in IoT
Yang et al. SC-RPL: A social cognitive routing for communications in industrial Internet of Things
Fazio et al. IP address autoconfiguration in ad hoc networks: Design, implementation and measurements
Rambabu et al. Multipath cluster-based hybrid MAC protocol for wireless sensor networks
CN107248955A (en) Communication means and communicator
Gonçalves et al. A mobility solution for low power and lossy networks using the LOADng protocol
Friedman et al. A density-driven publish subscribe service for mobile ad-hoc networks
Lima et al. Broadcast cancellation in search mechanisms
Bellavista et al. The trap coverage area protocol for scalable vehicular target tracking
Kasraoui et al. Zbr-M: A New Zigbee Routing Protocol.
Iabbassen et al. Data dissemination protocols in wireless sensor networks client/server versus mobile agent paradigms
Farooq et al. Impact of route length on the performance of routing and flow admission control algorithms in wireless sensor networks
Rajesh et al. Energy Efficient Secured CH Clustered Routing (E 2SCR) in smart dust network

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant