CN105847150B - It is a kind of wirelessly with the wired mixed logic dynamic selection method of power carrier - Google Patents
It is a kind of wirelessly with the wired mixed logic dynamic selection method of power carrier Download PDFInfo
- Publication number
- CN105847150B CN105847150B CN201610167854.8A CN201610167854A CN105847150B CN 105847150 B CN105847150 B CN 105847150B CN 201610167854 A CN201610167854 A CN 201610167854A CN 105847150 B CN105847150 B CN 105847150B
- Authority
- CN
- China
- Prior art keywords
- node
- path
- route
- rreq
- wirelessly
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/28—Connectivity information management, e.g. connectivity discovery or connectivity update for reactive routing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses one kind wirelessly with the wired mixed logic dynamic selection method of power carrier, it includes the following steps: (1) to establish routed path information using AOVDjr algorithm；Step 2, Route Selection；All routed path priority are calculated by formula；Step 3, selection reach destination node greatest priority path, send data using greatest priority path；It solves in the prior art using AODVjr algorithm, its single communication modes suitable for single node routes networking, there is no routing mechanism, " optimal path " and " shortest path " algorithm that routing algorithm uses under single communication modes can only calculate communication efficiency in a kind of communication modes；Therefore the technical problems such as the use of power line carrier communication and RF wireless telecommunications combination are not applied for.
Description
Technical field:
The invention belongs to technical field of electric power communication, more particularly to one kind wirelessly to select with the wired mixed logic dynamic of power carrier
Method.
Background technique:
In power line carrier communication and RF wireless communication technique, mainly using based on AODVjr routing algorithm.
AODVjr routing is a kind of Routing Protocol of distribution according to need, only receives network packet, and network number in routing node
It just will do it route finding process when according to the destination address of packet not in the routing table of node.That is, the content of routing table
It establishes as needed, and it may be only a part of whole network topological structure.
The advantages of AODVjr, is, for AODV Routing Protocol, it does not need periodic routing iinformation broadcast, section
Certain Internet resources have been saved, and have reduced network power consumption.The disadvantage is that just initiating path finding process when needing, it will increase data
Arrive at the destination the time of location；And AODVjr algorithm single communication modes suitable for single node route networking, do not route
Selection mechanism can only use single routing mode under single communication modes, when an only paths reach destination node the case where
Under, if a node goes wrong and will lead to one or more nodes and can not reach in path.2, road under single communication modes
Communication efficiency can only be calculated in a kind of communication modes by " optimal path " and " shortest path " algorithm that algorithm uses；Therefore not
The case where can be suitably used for power line carrier communication and RF wireless telecommunications combination.
Summary of the invention:
The technical problem to be solved in the present invention: provide it is a kind of wirelessly with the wired mixed logic dynamic selection method of power carrier, with
It solves to use AODVjr algorithm in the prior art, its single communication modes suitable for single node routes networking, does not route choosing
The system of selecting a good opportunity, " optimal path " and " shortest path " algorithm that routing algorithm uses under single communication modes can only be in a kind of communication side
Communication efficiency is calculated in formula；Therefore the technologies such as the use of power line carrier communication and RF wireless telecommunications combination are not applied for ask
Topic.
Technical solution of the present invention:
Wirelessly with the wired mixed logic dynamic selection method of power carrier, it includes: one kind
Step 1 establishes routed path information using AOVDjr algorithm；
Step 2, Route Selection；All routed path priority are calculated by following formula；
K=max [RoutePath (i)priority]
In formula: i=1,2 ..., DataLen indicate that node sends data length；LkRate (j) indicates j node physical connection
Link communication rate, RouteCnt are the total hop count of current routed path, and SendRatio (i) indicates that path i communicates success rate,
RoutePath(i)priorityIndicate path i priority, K indicates to take greatest priority path in all routed paths；
Step 3, selection reach destination node greatest priority path, send data using greatest priority path.
SendRatio is 1 in the initial state, and as log increases, this value can change with number, thus reach
Optimal communication modes are automatically selected to intelligence.
Routed path information is established using AOVDjr algorithm described in step 1, it includes: route finding process, reverse route
Establishment process and forward Route establishment process.
The route finding process, method are as follows: when thering is the node of routing capabilities to receive data frame request, and routing table
In without and when destination node corresponding entry, its initiation route finding process, source node creates a route requests data first
RREQ is wrapped, and is broadcasted using the mode of multicast Multi.Broadcast to surroundings nodes；And establish corresponding routing table item
Mesh and route discovery table clause, state are set as in route discovery, any one node receives from different neighbor nodes
The RREQ of broadcast, node are to receive RREQ message for the first time, and the destination address of message is not oneself, then node can retain this
Then this RREQ message is broadcasted by the information of a RREQ data packet for establishing reverse path；If connect before
This RREQ message was received, then node will abandon this information.
The reverse route establishment process, method are as follows: when RREQ message is forwarded to different purposes from a source node
When ground, the node passed through on the way establishes the reverse route for arriving source node automatically, that is, records the RREQ being currently received
Message is established by recording the neighbor address of the first RREQ message received reversed being forwarded by which node
Routing, when RREQ message eventually arrives at destination node, the destination address in node verification RREQ is purpose section behind the address of oneself
Point will generate RREP message, as the response to RREQ message, take the mode of unicast RREP messaging to source node.
The forward Route establishment process, method are as follows: during RREP is forwarded back to source node with mode of unicast, edge
Each node on this paths the routing to destination node can be established according to the information of RREP, then the neighbours be saved
In point write-in routing table, until RREP is transmitted to source node.
Beneficial effects of the present invention:
The invention patent increases route selection algorithm on the basis of AODVjr Route establishment, comprehensive by identifying connection type
It closes and considers that connection communication rate, hop count, connection type receive the factors such as data length and calculate routed path priority, according to excellent
First rank height selection data transfer path；The present invention calculates communication efficiency by a variety of communication selection modes；According to routing road
Diameter selects optimal communication modes, increases under single node communication, and choosing is routed in power carrier and wireless communication networks
The system of selecting a good opportunity.Solves the problems, such as AODVjr algorithm Route Selection in power carrier and wireless communication networks；It is obvious more advanced
Reliably；It solves in the prior art using AODVjr algorithm, its single communication modes suitable for single node routes networking, do not have
Routing mechanism, " optimal path " and " shortest path " algorithm that routing algorithm uses under single communication modes can only be in one kind
Communication efficiency is calculated in communication modes；Therefore the skills such as the use of power line carrier communication and RF wireless telecommunications combination are not applied for
Art problem.
Specific embodiment:
Wirelessly with the wired mixed logic dynamic selection method of power carrier, it includes: one kind
Step 1 establishes routed path information using AOVDjr algorithm；
Routed path information is established using AOVDjr algorithm described in step 1, it includes: route finding process, reverse route
Establishment process and forward Route establishment process.
The route finding process, for a node with routing capabilities, when receiving one from network layer more
The request for the transmission data frame that height issues, and in routing table when no and destination node corresponding entry, it will initiate routing hair
Existing process.Source node creates a route request packet (RREQ) first, and uses the side of multicast (Multi.Broadcast)
Formula is broadcasted to surroundings nodes.
As soon as it should establish corresponding routing table entry and route discovery if a node has initiated route finding process
Table clause, state are set as in route discovery.Any one node all may receive broadcast from different neighbor nodes
RREQ.If it is receiving RREQ message for the first time, and the destination address of message is not oneself, then node can retain this RREQ
Then this RREQ message is broadcasted by the information of data packet for establishing reverse path.If before received mistake this
A RREQ message shows do not have to route establishment process this is because multiple nodes frequently broadcast the superfluous message of generation in network
There is any effect, then node will abandon this information.
The reverse route establishment process, when RREQ message is forwarded to different destinations from a source node, on the way
The node passed through will establish the reverse route of source node automatically.Namely record the RREQ message being currently received be by
Which node forwarding, reverse route is established by recording the neighbor address of the first RREQ message received, this
A little reverse routes will maintain certain time, this time enough RREQ message forwarding and generation RREP message in net return
Source node.
When RREQ message eventually arrives at destination node, the destination address in node verification RREQ is mesh behind the address of oneself
Node will generate RREP message, as a response to RREQ message.It is specific reversed due to having been set up before
Routing, therefore RREP only according to the guidance of reverse route, need to take the mode of unicast can be RREP message without being broadcasted
Send source node to.
The forward Route establishment process, during RREP is forwarded back to source node with mode of unicast, along this road
Each node on diameter can establish the routing for arriving destination node according to knowing for RREP, that is to say, that determine and arrive destination address
Next of node.Method be exactly record RREP be from which node propagate, then by the neighbor node write-in routing
In table, until RREP is transmitted to source node.So far, a route establishment process finishes.It can between source node and destination node
To start to transmit data.
As can be seen that AODVjr drives on demand, realized using RREQ, RREP control, the road of unicast after first broadcasting
By establishment process.
Step 2, Route Selection；All routed path priority are calculated by following formula；
K=max [RoutePath (i)priority]
In formula: i=1,2 ..., DataLen indicate that node sends data length；LkRate (j) indicates j node physical connection
Link communication rate, RouteCnt are the total hop count of current routed path, and SendRatio indicates that path i communicates success rate,
RoutePath(i)priorityIndicate path i priority, K indicates to take greatest priority path in all routed paths；
Step 3, selection reach destination node greatest priority path, send data using greatest priority path.
After being successfully established routed path information by AODVjr routing algorithm, all routing roads are calculated by above-mentioned formula
Diameter priority, selection reach destination node greatest priority path.Then data are sent using greatest priority path.
It is 1 that success rate SendRatio is communicated under original state, and as log increases, this value can change with number
Become, thus reaches intelligence and automatically select optimal communication modes.
Invention introduces SendRatio to communicate success rate concept, with common route selection method the difference lies in that common
Route selection algorithm can only be communicated on a single device by a kind of single communication modes.This routing algorithm can prop up
It holds in single device while supporting wired and wireless telecommunications, and by communication record data, communication success rate is obtained, finally in equipment
On select optimal communication modes.
Claims (6)
1. it is a kind of wirelessly with the wired mixed logic dynamic selection method of power carrier, it is characterised in that: it includes:
Step 1 establishes routed path information using AOVDjr algorithm；
Step 2, Route Selection；All routed path priority are calculated by following formula；
K=max [RoutePath (i)priority]
In formula: i=1,2 ..., DataLen indicate that node sends data length；LkRate (j) indicates j node physical connection link
Communication speed, RouteCnt are the total hop count of current routed path, and SendRatio (i) indicates that path i communicates success rate,
RoutePath(i)priorityIndicate path i priority, K indicates to take greatest priority path in all routed paths；
Step 3, selection reach destination node greatest priority path, send data using greatest priority path.
2. it is according to claim 1 it is a kind of wirelessly with the wired mixed logic dynamic selection method of power carrier, it is characterised in that: institute
It is 1 that SendRatio, which is stated, in original state, and with increasing for log, the value of SendRatio is changed correspondingly.
3. it is according to claim 1 it is a kind of wirelessly with the wired mixed logic dynamic selection method of power carrier, it is characterised in that: step
Rapid 1 it is described establish routed path information using AOVDjr algorithm, it include: route finding process, reverse route establishment process and
Forward Route establishment process.
4. it is according to claim 3 it is a kind of wirelessly with the wired mixed logic dynamic selection method of power carrier, it is characterised in that: institute
State route finding process, method are as follows: when thering is the node of routing capabilities to receive data frame request, and no and mesh in routing table
Node corresponding entry when, it initiate route finding process, source node creates a route request packet RREQ first, and makes
It is broadcasted with the mode of multicast Multi.Broadcast to surroundings nodes；And establish corresponding routing table entry and routing hair
Existing table clause, state are set as in route discovery, any one node receives the RREQ of broadcast from different neighbor nodes,
Node is to receive RREQ message for the first time, and the destination address of message is not oneself, then node can retain this RREQ data
Then this RREQ message is broadcasted by the information of packet for establishing reverse path；If before received mistake this
RREQ message, then node will abandon this information.
5. it is according to claim 3 it is a kind of wirelessly with the wired mixed logic dynamic selection method of power carrier, it is characterised in that: institute
State reverse route establishment process, method are as follows: when RREQ message is forwarded to different destinations from a source node, institute on the way
The node of process establishes the reverse route for arriving source node automatically, that is, recording the RREQ message being currently received is by which
A node forwarding, reverse route is established by recording the neighbor address of the first RREQ message received, works as RREQ
Message eventually arrives at destination node, and behind address of the destination address in node verification RREQ for oneself, destination node will be generated
RREP message takes the mode of unicast RREP messaging to source node as the response to RREQ message.
6. it is according to claim 3 it is a kind of wirelessly with the wired mixed logic dynamic selection method of power carrier, it is characterised in that: institute
State forward Route establishment process, method are as follows: during RREP is forwarded back to source node with mode of unicast, along this paths
On each node can according to the information of RREP establish to destination node routing, then by the neighbor node be written route
In table, until RREP is transmitted to source node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610167854.8A CN105847150B (en) | 2016-03-23 | 2016-03-23 | It is a kind of wirelessly with the wired mixed logic dynamic selection method of power carrier |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610167854.8A CN105847150B (en) | 2016-03-23 | 2016-03-23 | It is a kind of wirelessly with the wired mixed logic dynamic selection method of power carrier |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105847150A CN105847150A (en) | 2016-08-10 |
| CN105847150B true CN105847150B (en) | 2019-03-12 |
Family
ID=56582973
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610167854.8A Active CN105847150B (en) | 2016-03-23 | 2016-03-23 | It is a kind of wirelessly with the wired mixed logic dynamic selection method of power carrier |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105847150B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109039905B (en) * | 2018-08-07 | 2021-04-06 | 国网四川省电力公司技能培训中心 | PLC and wireless heterogeneous networking system and method based on link perception |
| CN109039383A (en) * | 2018-09-27 | 2018-12-18 | 深圳友讯达科技股份有限公司 | heterogeneous network communication transmission method and device |
| TWI739049B (en) * | 2018-12-10 | 2021-09-11 | 大陸商貴州濎通芯物聯技術有限公司 | Device and method of establishing hybrid mesh network for multi-link |
| CN110619741B (en) * | 2019-10-22 | 2020-09-29 | 国家电网有限公司 | Concentrator separation dual-channel local communication module and networking method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103781144A (en) * | 2014-02-28 | 2014-05-07 | 东南大学 | Zigbee network tree-shaped routing method for neighbor table mode interaction |
| CN105208622A (en) * | 2015-08-26 | 2015-12-30 | 江苏林洋电子股份有限公司 | High-efficiency dynamic automatic-maintenance routing list structure and routing list management method |
-
2016
- 2016-03-23 CN CN201610167854.8A patent/CN105847150B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103781144A (en) * | 2014-02-28 | 2014-05-07 | 东南大学 | Zigbee network tree-shaped routing method for neighbor table mode interaction |
| CN105208622A (en) * | 2015-08-26 | 2015-12-30 | 江苏林洋电子股份有限公司 | High-efficiency dynamic automatic-maintenance routing list structure and routing list management method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105847150A (en) | 2016-08-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4532564B2 (en) | System and method for supporting multicast routing in large scale wireless mesh networks | |
| KR101086111B1 (en) | Routing protocol for multicast in a meshed network | |
| CN101489276B (en) | Multicast routing method for Ad Hoc network | |
| JP5448211B2 (en) | Wireless communication apparatus, wireless network system, data transfer method, and program | |
| US9014051B2 (en) | Updating multicast group information of a client device of a wireless mesh network | |
| CN105847150B (en) | It is a kind of wirelessly with the wired mixed logic dynamic selection method of power carrier | |
| CN107623630B (en) | Bit index explicit copy information transfer method and device | |
| EP3200404B1 (en) | Content-centric network on-demand distance vector route method | |
| CN101102283A (en) | A method and device for optimizing unknown unicast forward at wireless access point | |
| TW201116099A (en) | Methods and apparatus for forming, maintaining and/or using overlapping networks | |
| CN103607352A (en) | Multicast routing method based on network topology | |
| CN106789649B (en) | Layer two multi-path fast routing method based on labels | |
| CN103023773A (en) | Method, device and system for forwarding message in multi-topology network | |
| Wang et al. | A multi-path QoS multicast routing protocol with slot assignment for mobile ad hoc networks | |
| CN101013948A (en) | Forming equal cost multipath multicast distribution structures | |
| CN106850436A (en) | Mine hybrid wireless mesh network routing protocols based on virtual potential energy field | |
| CN104539545A (en) | Multicast message forwarding method and device of TRILL network | |
| CN104754649A (en) | Data transfer method and wireless Mesh node | |
| CN111294271B (en) | Device and method for establishing hybrid mesh network applied to multiple links | |
| CN103200106A (en) | Message transmitting method and message transmitting equipment | |
| CN108234311B (en) | Bit index explicit copy information transfer method and device | |
| Li et al. | Research on the improvement of multicast Ad Hoc On-demand Distance Vector in MANETS | |
| JPWO2008114327A1 (en) | Address resolution method | |
| Midha et al. | Performance Analysis of AODV & OLSR for MANET | |
| Mitra et al. | A Modified Algorithmic Approach of DSDV Routing Protocol for Wireless Ad Hoc Network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |