CN105704027A - Routing method based on path-first selection strategy - Google Patents
Routing method based on path-first selection strategy Download PDFInfo
- Publication number
- CN105704027A CN105704027A CN201610178693.2A CN201610178693A CN105704027A CN 105704027 A CN105704027 A CN 105704027A CN 201610178693 A CN201610178693 A CN 201610178693A CN 105704027 A CN105704027 A CN 105704027A
- Authority
- CN
- China
- Prior art keywords
- node
- broadcast
- path
- message
- osrc
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/16—Multipoint routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/30—Routing of multiclass traffic
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention relates to a routing method based on a path-first selection strategy. When a node which is marked as OSRC in a network initiates communication with another node that is marked as FDST, a current node requires determining of one path. The routing method comprises the following steps of (1), initiating a whole-network broadcast by the OSRC node, wherein the broadcast is called as a path restoring broadcast and carries information of the FDST node, other nodes in the network forward the broadcast, and each node only forwards the message of the broadcast once; and (2) after the FDST node receives the path restoring broadcast, organizing a routing restoring frame and transmitting the routing restoring frame to the OSRC node in a unicast frame manner. According to the routing method, information which is carried in neighboring list broadcast with node periodicity is sufficiently utilized. In the network with periodic neighboring broadcast, the routing method can be used for quickly establishing a communication path between two random nodes. Furthermore the routing method has high robustness in a relatively complicated communication environment.
Description
Technical field
The present invention relates to a kind of method for routing based on heat source selection strategy, belong to low-voltage powerline carrier communication field。
Background technology
In low-voltage network, load often changes, and network exists various noise and impulse disturbances, causes that low-tension network presents transmission characteristic a kind of time-varying, asymmetrical, so low-voltage power line communication success rate is low at present, reliability is not strong。Paid close attention to raising point-to-point communication in the past and received sending probability, from the reliability that the aspect raisings such as the characteristic of channel and model, modulating and demodulating signal and suppression noise communicate。But, when network size is relatively big and noise jamming is comparatively serious, correlational study technology will be unable to ensure the reliable connected of communication network。Therefore, research power line communication network networking and route technology are practical application institute urgent needss。
Conventional low power line network is generally centralized network, Centroid be responsible for other ordinary node of network, and the route that network service uses organizes the study of the whole network node, training to be formed by Centroid；Meanwhile, existing application occurs in that the flooding communication mode not taking concrete routing policy。
For power line communication environment, ITUG.9903 proposes the LOAD agreement routing plan as network system。LOAD agreement be a kind of peer-to-peer network for immediately finding the communication path between any two communication nodes, the routing plan of LOAD protocol realization is without by historical information。The basic procedure of LOAD agreement correspondence routing plan is: when node is when sending unicast message, determine that the route arriving final purpose node is missing or invalid, present node initiates the broadcast of RREQ the whole network, final purpose node is scanned for, and the node of each RREQ of forwarding is by record and the link information received, forwarding RREQ is relevant。When receiving this RREQ broadcast, final purpose node sends routing reply message RREP (unicast message) by selecting a good opportunity according to the information of record, the node of middle each forwarding RREP message is determined sending the next-hop node of RREP also according to the information of broadcast phase record, meanwhile, node can build the route reaching RREQ source node, RREP source node。
For the routing plan leading with Centroid, its target is exactly set up Centroid to arrive path and the ordinary node arrival Centroid path of ordinary node, and along with the raising that the variation of communication is required by intelligent grid, this scheme is difficult to meet needs substantially；And the type scheme path learning is consuming time general longer, hardly consistent with the real-time communication day by day improved。
For the system using flooding as communication mode, its communication concurrency is seriously restricted, and meanwhile, the conflict between adjacent networks will be more prominent。
The scene that LOAD agreement is suitable for is intended to: between node, communication has symmetry, communication environment is stablized and without substantially interfering with。China's power grid environment is complicated, some interference signals that many electrical equipment bands being linked in electrical network produce due to self make there is multiple interference on power line communication channel, and the electrical equipment accessed causes the change of load, impedance etc., power line communication channel is made to produce frequency selective fading, power line communication is brought greater impact, and therefore LOAD agreement lacks practicality。
Summary of the invention
It is an object of the invention to provide a kind of method for routing based on heat source selection strategy, in the network with periodic neighbor broadcast, the method can set up rapidly the communication path between any two nodes, simultaneously, under relatively complex communication environment, there is good vigorousness。
To achieve these goals, technical scheme is as follows。
A kind of method for routing based on heat source selection strategy, the each node being arranged in communication network can directly listen to the communication message that surroundings nodes sends, therefore, the message that certain node sends directly can be listened to by present node, this node is known as the neighbor node of present node, and wherein, node A can receive the message of node B, C, D, E, F, G, therefore, node B, C, D, E, F, G is the neighbor node of node A。
For the network that the present invention describes, each node therein has the neighbor list carrying all neighbor informations, and, each node will carry out spot broadcasting according to the fixed cycle, the type broadcast carries the neighbor list of present node, therefore, this kind of broadcast being called, neighbor list is broadcasted；If adjacent two neighbor lists broadcast that can receive the other side each other, it is possible to being known as by above-mentioned two node can intercommunication。
When the node that in network is labeled as OSRC initiates communication to another node being labeled as FDST, present node is it needs to be determined that a paths, and detailed process is as follows:
(1) OSRC node initiates the whole network broadcast, and the type broadcast is called that path recovery is broadcasted, and the information of FDST node is carried in broadcast, and other nodes in network are by this broadcast of forwarding, and each node only forwards once this broadcasting packet；In this process, intermediate forwarding nodes needs the forwarding rule observed as follows:
A) for intermediate forwarding nodes, if receiving the broadcast that OSRC node sends, the historical information broadcasted according to neighbor list is determined and the whether intercommunication of OSRC node by this node, if intercommunication, this node can send after the broadcasting packet to forward is carried out labelling, and this labelling is called that path preferably indicates；
B) for intermediate forwarding nodes, if only receiving the forwarding broadcasting packet of other intermediate nodes, message will be carried out analysis judgment by this node, if message carrying path preferably indicate, can determine that whether the sending node of present node and this message has intercommunity according to historical information simultaneously, if having intercommunity, when present node sending this message, carrying path equally and preferably indicating；Other situations, message will not carry path and preferably indicate。
For path from node OSRC to node A, then to node B, then to node C, then to node FDST, if adjacent node all has intercommunity, node A to receive the OSRC broadcasting packet sent, when A forwards this broadcasting packet, path preferably mark will be carried and forward；Equally, B receives the A broadcasting packet sent, and B E-Packets and also will carry path and preferably indicate；C node is also such。
(2) FDST node is after receiving route repair broadcast, and tissue is routed back to multi-frame, transmits to OSRC node with the form of unicast frame。Node is when forwarding is routed back to multi-frame, broadcast message according to record, selecting the node preferably indicated with path to propagate node as the down hop being routed back to multi-frame, wherein, the node preferably indicated with path is this section point and receives the sending node carrying the message that path preferably indicates。
This beneficial effect of the invention is in that: the inventive method fully employs the information that node periodic neighbor list broadcast is entrained, in the network with periodic neighbor broadcast, the method can set up rapidly the communication path between any two nodes, simultaneously, under relatively complex communication environment, there is good vigorousness。
Accompanying drawing explanation
Fig. 1 is neighbor node schematic diagram in the embodiment of the present invention。
Fig. 2 is path recovery broadcast schematic diagram in the embodiment of the present invention。
Fig. 3 is that in the embodiment of the present invention, schematic diagram is replied in path。
Detailed description of the invention
Below in conjunction with accompanying drawing, the specific embodiment of the present invention is described, in order to be better understood from the present invention。
Embodiment
The each node being arranged in communication network can directly listen to the communication message that surroundings nodes sends, therefore, the message that certain node sends directly can be listened to by present node, this node is known as the neighbor node of present node, wherein, as it is shown in figure 1, node A can receive the message of node B, C, D, E, F, G, therefore, node B, C, D, E, F, G is the neighbor node of node A。
For the network that the present invention describes, each node therein has the neighbor list carrying all neighbor informations (mark including at least neighbor node), and, each node will carry out spot broadcasting according to the fixed cycle, the type broadcast carries the neighbor list of present node, therefore, this kind of broadcast is called that neighbor list is broadcasted。If adjacent two neighbor lists broadcast that can receive the other side each other, it is possible to being known as by above-mentioned two node can intercommunication。
When the node (being labeled as OSRC) in network initiates communication to another node (FDST), present node is it needs to be determined that a paths, and detailed process is as follows:
(1) OSRC node initiates the whole network broadcast, and the type broadcast is called that path recovery is broadcasted, and the information of FDST node is carried in broadcast, and other nodes in network are by this broadcast of forwarding, and each node only forwards once this broadcasting packet, as shown in Figure 2。In this process, intermediate forwarding nodes needs the forwarding rule observed as follows:
A) for intermediate forwarding nodes, if receiving the broadcast that OSRC node sends, the historical information broadcasted according to neighbor list is determined and the whether intercommunication of OSRC node by this node, if intercommunication, this node can send after the broadcasting packet to forward is carried out labelling, and this labelling is called that path preferably indicates；
B) for intermediate forwarding nodes, if only receiving the forwarding broadcasting packet of other intermediate nodes, message will be carried out analysis judgment by this node, if message carrying path preferably indicate, can determine that whether the sending node of present node and this message has intercommunity according to historical information simultaneously, if having intercommunity, when present node sending this message, carrying path equally and preferably indicating；Other situations, message will not carry path and preferably indicate。
As in figure 2 it is shown, for path OSRC-> A-> B-> C-> FDST, if adjacent node all has intercommunity, node A to receive the OSRC broadcasting packet sent, when A forwards this broadcasting packet, path preferably mark will be carried and will forward；Equally, B receives the A broadcasting packet sent, and B E-Packets and also will carry path and preferably indicate；C node is also such。
(2) FDST node is after receiving route repair broadcast, and tissue is routed back to multi-frame, transmits to OSRC node with the form of unicast frame。Node is when forwarding is routed back to multi-frame, broadcast message according to record, selecting the node preferably indicated with path to propagate node as the down hop being routed back to multi-frame, wherein, the node preferably indicated with path is this section point and receives the sending node carrying the message that path preferably indicates。
As shown in Figure 3, for Sample Scenario proposed in step 1, the propagation trajectories for being routed back to multi-frame of dotted line instruction, the FDST node information according to record, it may be determined that node C has path and preferably marks, therefore, FDST will be routed back to multi-frame and be sent to C node, similar, C node will be sent to B, and last A node is sent to OSRC node。
By said process, OSRC node arrives by obtaining in the trusted path of FDST node。This mechanism fully employs the information that node periodic neighbor list broadcast is entrained。
The above is the preferred embodiment of the present invention; it should be pointed out that, for those skilled in the art, under the premise without departing from the principles of the invention; can also making some improvements and modifications, these improvements and modifications are also considered as protection scope of the present invention。
Claims (1)
1. the method for routing based on heat source selection strategy, it is characterized in that: each node being arranged in communication network can directly listen to the communication message that surroundings nodes sends, therefore, the message that certain node sends directly can be listened to by present node, this node is known as the neighbor node of present node, and wherein, node A can receive the message of node B, C, D, E, F, G, therefore, node B, C, D, E, F, G is the neighbor node of node A；
For the network that the present invention describes, each node therein has the neighbor list carrying all neighbor informations, and, each node will carry out spot broadcasting according to the fixed cycle, the type broadcast carries the neighbor list of present node, therefore, this kind of broadcast being called, neighbor list is broadcasted；If adjacent two neighbor lists broadcast that can receive the other side each other, it is possible to being known as by above-mentioned two node can intercommunication；
When the node that in network is labeled as OSRC initiates communication to another node being labeled as FDST, present node is it needs to be determined that a paths, and detailed process is as follows:
(1) OSRC node initiates the whole network broadcast, and the type broadcast is called that path recovery is broadcasted, and the information of FDST node is carried in broadcast, and other nodes in network are by this broadcast of forwarding, and each node only forwards once this broadcasting packet；In this process, intermediate forwarding nodes needs the forwarding rule observed as follows:
A) for intermediate forwarding nodes, if receiving the broadcast that OSRC node sends, the historical information broadcasted according to neighbor list is determined and the whether intercommunication of OSRC node by this node, if intercommunication, this node can send after the broadcasting packet to forward is carried out labelling, and this labelling is called that path preferably indicates；
B) for intermediate forwarding nodes, if only receiving the forwarding broadcasting packet of other intermediate nodes, message will be carried out analysis judgment by this node, if message carrying path preferably indicate, can determine that whether the sending node of present node and this message has intercommunity according to historical information simultaneously, if having intercommunity, when present node sending this message, carrying path equally and preferably indicating；Other situations, message will not carry path and preferably indicate；
For path from node OSRC to node A, then to node B, then to node C, then to node FDST, if adjacent node all has intercommunity, node A to receive the OSRC broadcasting packet sent, when A forwards this broadcasting packet, path preferably mark will be carried and forward；Equally, B receives the A broadcasting packet sent, and B E-Packets and also will carry path and preferably indicate；C node is also such；
(2) FDST node is after receiving route repair broadcast, and tissue is routed back to multi-frame, transmits to OSRC node with the form of unicast frame；Node is when forwarding is routed back to multi-frame, broadcast message according to record, selecting the node preferably indicated with path to propagate node as the down hop being routed back to multi-frame, wherein, the node preferably indicated with path is this section point and receives the sending node carrying the message that path preferably indicates。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610178693.2A CN105704027A (en) | 2016-03-25 | 2016-03-25 | Routing method based on path-first selection strategy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610178693.2A CN105704027A (en) | 2016-03-25 | 2016-03-25 | Routing method based on path-first selection strategy |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105704027A true CN105704027A (en) | 2016-06-22 |
Family
ID=56232829
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610178693.2A Pending CN105704027A (en) | 2016-03-25 | 2016-03-25 | Routing method based on path-first selection strategy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105704027A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102916876A (en) * | 2012-10-24 | 2013-02-06 | 浙江大学 | Routing method for one-way link environment of principal and subordinative construction network |
| WO2014167549A1 (en) * | 2013-04-12 | 2014-10-16 | Selex Es S.P.A. | Smf-type communication method for a manet network, network node and mobile network which implement this communication method |
| CN104717238A (en) * | 2013-12-12 | 2015-06-17 | 上海财经大学 | Ant colony algorithm-based distributed service composition method in mobile ad hoc network |
-
2016
- 2016-03-25 CN CN201610178693.2A patent/CN105704027A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102916876A (en) * | 2012-10-24 | 2013-02-06 | 浙江大学 | Routing method for one-way link environment of principal and subordinative construction network |
| WO2014167549A1 (en) * | 2013-04-12 | 2014-10-16 | Selex Es S.P.A. | Smf-type communication method for a manet network, network node and mobile network which implement this communication method |
| CN104717238A (en) * | 2013-12-12 | 2015-06-17 | 上海财经大学 | Ant colony algorithm-based distributed service composition method in mobile ad hoc network |
Non-Patent Citations (1)
| Title |
|---|
| 邱兵: "基于 WAVE 协议栈的信息多跳转发策略设计与实现", 《万方数据知识服务平台》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Saputro et al. | A survey of routing protocols for smart grid communications | |
| CN106686659B (en) | AOMDV-based energy perception node disjoint multipath routing algorithm | |
| EP2083535B1 (en) | Method for enhancement of multicasting forwarding protocol in a wireless network | |
| CN102695220B (en) | IPv6-based mobile ad hoc network mobile handover realizing method | |
| US20090175208A1 (en) | Automatic Clustering of Wireless Network Nodes Toward Selected Mesh Access Points | |
| CN104735743B (en) | The routing optimization method of embedded radio self-organizing network | |
| JP5812917B2 (en) | Method for discovering multiple routes in a multi-hop network and node for searching for multiple routes | |
| CN106454984A (en) | Route method and apparatus | |
| Sreesha et al. | Cognitive radio based wireless sensor network architecture for smart grid utility | |
| CN104754688A (en) | Routing method for entangled state based wireless Mesh quantum communication network | |
| WO2011140877A1 (en) | Routing forwarding method, routing node and wireless communication network | |
| US10448310B2 (en) | Method of mapping optimal communication routes through a mesh network | |
| Biagi et al. | Geo-routing algorithms and protocols for power line communications in smart grids | |
| CN105099902A (en) | Routing method for quantum Mesh network | |
| CN105072034A (en) | Powerline communications (PLC) network routing method and system | |
| CN103036785A (en) | Routing method of city vehicle-mounted net | |
| CN109819496A (en) | A kind of marine more mobile heterogeneous platform short-distance networking methods | |
| Chen et al. | Local leader election, signal strength aware flooding, and routeless routing | |
| CN105847150A (en) | Method for selecting hybrid route of wireless communication and electric power carrier wave wired communication | |
| Wang et al. | Reliable and efficient packet forwarding by utilizing path diversity in wireless ad hoc networks | |
| CN109803342A (en) | A kind of unmanned plane method for self-organizing network routing towards balancing energy highly-reliable transmission | |
| Razazian et al. | Enhanced 6LoWPAN ad hoc routing for G3-PLC | |
| RU2006138217A (en) | METHOD FOR COMMUNICATION IN A WIRELESS LOCAL NETWORK WITH A GROUP CONSISTING OF RETRANTERS AND NODES OF RADIO ACCESS | |
| CN109688557B (en) | Cooperative node selection method and device | |
| Aguilar et al. | A cross-layer design based on geographic information for cooperative wireless networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20170221 Address after: 266000 Shandong province Qingdao Shibei supernatant Road No. 16 A Applicant after: Qingdao Eastsoft Communication Technology Co., Ltd. Applicant after: China Electric Power Research Institute Applicant after: State Grid Metering Center Address before: 266000 Shandong province Qingdao Shibei supernatant Road No. 16 A Applicant before: Qingdao Eastsoft Communication Technology Co., Ltd. |
|
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160622 |
|
| RJ01 | Rejection of invention patent application after publication |