CN105847150A - Method for selecting hybrid route of wireless communication and electric power carrier wave wired communication - Google Patents

Method for selecting hybrid route of wireless communication and electric power carrier wave wired communication Download PDF

Info

Publication number
CN105847150A
CN105847150A CN201610167854.8A CN201610167854A CN105847150A CN 105847150 A CN105847150 A CN 105847150A CN 201610167854 A CN201610167854 A CN 201610167854A CN 105847150 A CN105847150 A CN 105847150A
Authority
CN
China
Prior art keywords
route
node
path
rreq
message
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201610167854.8A
Other languages
Chinese (zh)
Other versions
CN105847150B (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.)
Electric Power Research Institute of Guizhou Power Grid Co Ltd
Original Assignee
Electric Power Research Institute of Guizhou Power Grid 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 Electric Power Research Institute of Guizhou Power Grid Co Ltd filed Critical Electric Power Research Institute of Guizhou Power Grid Co Ltd
Priority to CN201610167854.8A priority Critical patent/CN105847150B/en
Publication of CN105847150A publication Critical patent/CN105847150A/en
Application granted granted Critical
Publication of CN105847150B publication Critical patent/CN105847150B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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 a method for selecting a hybrid route of wireless communication and electric power carrier wave wired communication. The method comprises following steps: step 1.establishing route path information by means of the AOVDjr algorithm; 2. selecting a route and calculating the priority of all route paths by a formula; 3. selecting a path which has a maximum priority to a target node and sending data through the path with the maximum priority. The method solves the problems that in the prior art, the AODVjr algorithm is adopted which is suitable for single communication mode route networking of a single node and does not have route selection mechanisms, wherein communication efficiency can only be calculated in one of route algorithms under the signal communication mode adopting the optimal path algorithm and the shortest path algorithm, and therefore the present technology is not suitable for combined usage of electric power carrier wave communication and RF wireless communication.

Description

A kind of wireless and power carrier wired mixed logic dynamic system of selection
Technical field:
The invention belongs to technical field of electric power communication, particularly relate to a kind of wireless and power carrier Wired mixed logic dynamic system of selection.
Background technology:
In power line carrier communication and RF wireless communication technique, mainly use based on AODVjr routing algorithm.AODVjr route is a kind of demand assigned Routing Protocol, only Receive network packet at routing node, and the destination address of network packet is not at joint Route finding process just can be carried out time in the routing table of point.It is to say, the content of routing table Set up on demand, and it may be only a part for whole network topology structure.
The advantage of AODVjr is, for AODV Routing Protocol, it need not week The routing iinformation broadcast of phase property, saves certain Internet resources, and reduces network power consumption. When shortcoming is to need just initiate path finding process, can increase data arrive at location time Between；And the single communication modes route networking be applicable to single node of AODVjr algorithm, do not have There is routing mechanism, single routing mode under single communication modes, can only be used, when only One paths arrives in the case of destination node, if in path node go wrong by One or more node is caused to arrive.2, routing algorithm employing under single communication modes " optimal path " can only calculate communication with " shortest path " algorithm in a kind of communication modes Efficiency；Therefore power line carrier communication and the situation of RF wireless telecommunications combination it are not applied for.
Summary of the invention:
The technical problem to be solved in the present invention: provide a kind of and wireless wired with power carrier mix Route selection method, to solve to use in prior art AODVjr algorithm, it is applicable to list In node, the networking of single communication modes route, does not has routing mechanism, single communication modes " optimal path " and " shortest path " algorithm that lower routing algorithm uses can only lead in one News mode calculates communication efficiency；Therefore it is not applied for power line carrier communication and RF is wireless The technical problems such as the use that communication combines.
Technical solution of the present invention:
One is wireless and power carrier wired mixed logic dynamic system of selection, and it includes:
Step 1, AOVDjr algorithm is utilized to set up routed path information；
Step 2, Route Selection；All routed path priority are calculated by following formula；
R o u t e P a t h ( i ) p r i o r i t y = 1 [ D a t a L e n Σ j = 1 R o u t e C n t L k R a t e ( j ) ÷ R o u t e C n t ] * S e n d R a t i o ( i )
K=max [RoutePath (i)priority]
In formula: i=1,2 ..., DataLen represents that node sends data length；LkRate (j) represents j joint Point physical connection link communication speed, RouteCnt is the total jumping figure of current routed path, SendRatio (i) represents path i communication success rate, RoutePath (i)priorityRepresent path i Priority, K represents and takes greatest priority path in all routed paths；
Step 3, selection arrive destination node greatest priority path, use greatest priority path to send out Send data.
SendRatio is 1 in an initial condition, and along with log increases, this value can be along with number of times And change, thus reach intelligence and automatically select optimum communication modes.
Utilizing AOVDjr algorithm to set up routed path information described in step 1, it includes: road By discovery procedure, reverse Route establishment process and forward Route establishment process.
Described route finding process, its method is: have the node of routing capabilities to receive data During frame request, and when not having entry corresponding with destination node in routing table, it is initiated route and sends out Existing process, first source node creates route request packet RREQ, and uses multicast The mode of Multi.Broadcast is broadcasted to surroundings nodes；And set up corresponding routing table Entry and route discovery table clause, state is set in route discovery, any one node from Receiving the RREQ of broadcast at different neighbor nodes, node is to receive RREQ for the first time Message, and the destination address of message is not oneself, then node can retain this RREQ data The information of bag is used for setting up reverse path, then this RREQ message is broadcasted；As Received this RREQ message before Guo, then node will abandon this information.
Described reverse Route establishment process, its method is: when RREQ message saves from a source Point is when being forwarded to different destinatioies, on the way the node of process the most automatically sets up and arrives source node Reverse route, namely record which node is the RREQ message being currently received be by Forwarding and come, the neighbor address of first the RREQ message received by record set up Reversely route, when RREQ message eventually arrives at destination node, in node verification RREQ After destination address is the address of oneself, destination node will produce RREP message, as right The response of RREQ message, takes the mode of clean culture that RREP message is sent to source node.
Described forward Route establishment process, its method is: forward with mode of unicast at RREP During returning source node, can be according to RREP along each node on this paths Information set up the route of destination node, then by this neighbor node write routing table, Until RREP is sent to source node.
Beneficial effects of the present invention:
Patent of the present invention, on the basis of AODVjr Route establishment, increases route selection algorithm, By identifying connection type, consider connection traffic rate, jumping figure, connection type reception The factors such as data length calculate routed path priority, select number according to priority level height According to transmission path；The present invention calculates communication efficiency by multiple communication selection mode；According to road By Path selection optimum communication modes, increasing under single node communication, electric power carries Routing mechanism in ripple and wireless communication networks.Solve AODVjr algorithm to carry at electric power The problem of Route Selection in ripple and wireless communication networks；Substantially the most advanced reliably；Solve Using AODVjr algorithm in prior art, it is single communication modes road be applicable to single node By networking, there is no routing mechanism, under single communication modes routing algorithm use " Good path " communication efficiency can only be calculated in a kind of communication modes with " shortest path " algorithm； Therefore the technology such as the use that power line carrier communication and RF wireless telecommunications combine it are not applied for Problem.
Detailed description of the invention:
One is wireless and power carrier wired mixed logic dynamic system of selection, and it includes:
Step 1, AOVDjr algorithm is utilized to set up routed path information；
Utilizing AOVDjr algorithm to set up routed path information described in step 1, it includes: route is sent out Existing process, reverse Route establishment process and forward Route establishment process.
Described route finding process, for a node with routing capabilities, when receiving One request sending Frame sent from Internet higher, and in routing table not and During destination node correspondence entry, it will initiate route finding process.First source node creates One route request packet (RREQ), and use the side of multicast (Multi.Broadcast) Formula is broadcasted to surroundings nodes.
If a node has initiated route finding process, it just should set up corresponding route Table clause and route discovery table clause, state is set in route discovery.Any one node All may receive the RREQ of broadcast at different neighbor nodes.If connecing for the first time Receive RREQ message, and the destination address of message is not oneself, then node can retain this The information of RREQ packet is used for setting up reverse path, then by wide for this RREQ message Broadcast is gone.If having received this RREQ message, show that this is due to network Interior multiple nodes frequently broadcast the superfluous message of generation, and Route establishment process is not had any work With, then node will abandon this information.
Described reverse Route establishment process, when RREQ message is forwarded to not from a source node With destination time, on the way the node of process will automatically set up the reverse road of source node By.Namely recording the RREQ message being currently received is by which node to be forwarded , the neighbor address of first the RREQ message received by record sets up reversely route, These reversely route will maintain certain time, and this section of time enough RREQ message is in net Forward and produce RREP message and return source node.
When RREQ message eventually arrives at destination node, the destination in node verification RREQ After location is the address of oneself, destination node will produce RREP message, right as one The response of RREQ message.Owing to having been set up clear and definite reverse route before, therefore RREP, without broadcasting, only need to take the mode of clean culture i.e. according to the guidance of reversely route RREP message can be sent to source node.
Described forward Route establishment process, is forwarded back to source node at RREP with mode of unicast During, foundation can be known according to RREP along each node on this paths Route to destination node, say, that determine next of destination address node.Method It is exactly to record which node propagation RREP is from, then this neighbor node is write In routing table, until RREP is sent to source node.So far, a Route establishment process Complete.Can start between source node and destination node to transmit data.
It can be seen that AODVjr is on-demand driving, RREQ, RREP is used to control real Existing, the first Route establishment process of clean culture after broadcast.
Step 2, Route Selection；All routed path priority are calculated by following formula；
R o u t e P a t h ( i ) p r i o r i t y = 1 [ D a t a L e n Σ j = 1 R o u t e C n t L k R a t e ( j ) ÷ R o u t e C n t ] * S e n d R a t i o ( i )
K=max [RoutePath (i)priority]
In formula: i=1,2 ..., DataLen represents that node sends data length；LkRate (j) represents j joint Point physical connection link communication speed, RouteCnt is the total jumping figure of current routed path, SendRatio represents path i communication success rate, RoutePath (i)priorityRepresent that path i is preferential Level, K represents and takes greatest priority path in all routed paths；
Step 3, selection arrive destination node greatest priority path, use greatest priority path to send out Send data.
After being successfully established routed path information by AODVjr routing algorithm, by above-mentioned Formula calculates all routed path priority, selects to arrive destination node greatest priority path. Then greatest priority path is used to send data.
Under original state, communication success rate SendRatio is 1, along with log increases, and this value meeting Change along with number of times, thus reach intelligence and automatically select optimum communication modes.
Invention introduces SendRatio communication success rate concept, different from common route selection method Point is, common route selection algorithm, can only be led to by single one on a single device News mode carries out communication.This routing algorithm can be supported to set up and support wired and nothing for upper simultaneously Line communication, and by communication record data, draw communication success rate, finally select on equipment Go out optimum communication modes.

Claims (6)

1. wireless and power carrier wired mixed logic dynamic system of selection, it is characterised in that: its bag Include:
Step 1, AOVDjr algorithm is utilized to set up routed path information；
Step 2, Route Selection；All routed path priority are calculated by following formula；
R o u t e P a t h ( i ) p r i o r i t y = 1 [ D a t a L e n Σ j = 1 R o u t e C n t L k R a t e ( j ) ÷ R o u t e C n t ] * S e n d R a t i o ( i )
K=max [RoutePath (i)priority]
In formula: i=1,2 ..., DataLen represents that node sends data length；LkRate (j) represents j joint Point physical connection link communication speed, RouteCnt is the total jumping figure of current routed path, SendRatio (i) represents path i communication success rate, RoutePath (i)priorityRepresent path i Priority, K represents and takes greatest priority path in all routed paths；
Step 3, selection arrive destination node greatest priority path, use greatest priority path to send out Send data.
One the most according to claim 1 is wireless and power carrier wired mixed logic dynamic selecting party Method, it is characterised in that: described SendRatio is 1 in original state, along with communication is remembered Increasing of record, the value of SendRatio changes therewith.
One the most according to claim 1 is wireless and power carrier wired mixed logic dynamic selecting party Method, it is characterised in that: utilize AOVDjr algorithm to set up routed path letter described in step 1 Ceasing, it includes: route finding process, reverse Route establishment process and forward Route establishment Process.
One the most according to claim 3 is wireless and power carrier wired mixed logic dynamic selecting party Method, it is characterised in that: described route finding process, its method is: have routing capabilities When node receives Frame request, and not entry corresponding with destination node in routing table Time, it initiates route finding process, and first source node creates a route request packet RREQ, and use the mode of multicast Multi.Broadcast to broadcast to surroundings nodes； And set up corresponding routing table entry and route discovery table clause, state is set to route and sends out In Xian, any one node receives the RREQ of broadcast at 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 the information of this RREQ packet and is used for setting up reverse path, then This RREQ message is broadcasted；If having received this RREQ Message, then node will abandon this information.
One the most according to claim 3 is wireless and power carrier wired mixed logic dynamic selecting party Method, it is characterised in that: described reverse Route establishment process, its method is: work as RREQ Message when a source node is forwarded to different destinatioies, on the way the node of process equal Automatically set up the reverse route of source node, namely record the RREQ being currently received Message by which node is forwarded, first RREQ received by record The neighbor address of message sets up reversely route, when RREQ message eventually arrives at purpose joint Point, after the destination address in node verification RREQ is the address of oneself, destination node is just RREP message can be produced, as the response to RREQ message, take the mode of clean culture RREP message is sent to source node.
One the most according to claim 3 is wireless and power carrier wired mixed logic dynamic selecting party Method, it is characterised in that: described forward Route establishment process, its method is: at RREP During being forwarded back to source node with mode of unicast, along each joint on this paths Point all can set up the route of destination node according to the information of RREP, then by these neighbours In node write routing table, until RREP is sent to source node.
CN201610167854.8A 2016-03-23 2016-03-23 It is a kind of wirelessly with the wired mixed logic dynamic selection method of power carrier Active CN105847150B (en)

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 true CN105847150A (en) 2016-08-10
CN105847150B 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)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109039905A (en) * 2018-08-07 2018-12-18 国网四川省电力公司技能培训中心 PLC and wireless isomer group network system and method based on link-aware
CN109039383A (en) * 2018-09-27 2018-12-18 深圳友讯达科技股份有限公司 heterogeneous network communication transmission method and device
CN110619741A (en) * 2019-10-22 2019-12-27 国家电网有限公司 Concentrator separation dual-channel local communication module and networking method
CN111294271A (en) * 2018-12-10 2020-06-16 贵州濎通芯物联技术有限公司 Device and method for establishing hybrid mesh network applied to multiple links

Citations (2)

* Cited by examiner, † Cited by third party
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

Patent Citations (2)

* Cited by examiner, † Cited by third party
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

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109039905A (en) * 2018-08-07 2018-12-18 国网四川省电力公司技能培训中心 PLC and wireless isomer group network system and method based on link-aware
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
CN111294271A (en) * 2018-12-10 2020-06-16 贵州濎通芯物联技术有限公司 Device and method for establishing hybrid mesh network applied to multiple links
CN110619741A (en) * 2019-10-22 2019-12-27 国家电网有限公司 Concentrator separation dual-channel local communication module and networking method
CN110619741B (en) * 2019-10-22 2020-09-29 国家电网有限公司 Concentrator separation dual-channel local communication module and networking method

Also Published As

Publication number Publication date
CN105847150B (en) 2019-03-12

Similar Documents

Publication Publication Date Title
JP4532564B2 (en) System and method for supporting multicast routing in large scale wireless mesh networks
EP1856853B1 (en) Hybrid routing protocol for a network with mesh topology
EP1982201B1 (en) System and method for multihop packet forwarding
CN101047651B (en) Method, system and equipment for setting IP priority level
CN106454984A (en) Route method and apparatus
CN105847150A (en) Method for selecting hybrid route of wireless communication and electric power carrier wave wired communication
CN104754688A (en) Routing method for entangled state based wireless Mesh quantum communication network
EP2022280A2 (en) System and method for distributing proxying error information in wireless networks
CN102281533B (en) Method, system and router for establishing LSP based on RT
CN110831006B (en) Ad hoc network system and data transmission method thereof
CN104883304A (en) Method for routing part entangled quantum pair bridging communication network
JP2009273140A (en) Hybrid type mesh routing protocol
JP2009260720A (en) Route control method, communication system and communication apparatus
CN110996266B (en) Multicast group data transmission method of ad hoc network system
Lu et al. High definition map distribution in named data networking based VANETs
CN109982403A (en) A kind of multi-node collaboration packet transmission plan based on multihop network
CN111294271B (en) Device and method for establishing hybrid mesh network applied to multiple links
CN105553854B (en) A kind of system and its multicast route method based on mobile ad-hoc network
Pandey et al. Enhancing ADOV routing protocol for vehicular ad hoc networks
Biradar et al. An improved quality of service using R-AODV protocol in MANETs
Hauge et al. Multicast-service distribution on a cellular network assisted by local ad hoc networks
Mirza et al. Reliable multipath multi-channel route migration over multi link-failure in wireless ad hoc networks
KR100929436B1 (en) A recording medium on which an ad hoc communication method using an MANAT identifier, an ad hoc terminal, and a program for executing the method are recorded.
Li et al. Improved MAODV link repair technique for group team communication in MANET
CN116155799A (en) Ad hoc network communication system, message communication method thereof and readable storage medium

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