CN105491638A - Routing method of intelligent anti-slide system - Google Patents
Routing method of intelligent anti-slide system Download PDFInfo
- Publication number
- CN105491638A CN105491638A CN201510915873.XA CN201510915873A CN105491638A CN 105491638 A CN105491638 A CN 105491638A CN 201510915873 A CN201510915873 A CN 201510915873A CN 105491638 A CN105491638 A CN 105491638A
- Authority
- CN
- China
- Prior art keywords
- node
- routing
- turn
- rreq
- judge
- 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
- 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
-
- 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/20—Hop count for routing purposes, e.g. TTL
-
- 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/32—Flooding
-
- 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/74—Address processing for routing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a routing method of an intelligent anti-slide system. The intelligent anti-slide system comprises an upper machine monitoring system, a coordinator, a plurality of routing device and a plurality of iron shoes; the upper machine monitoring system is connected to every routing device through the coordinator; every routing device are mutually connected; every routing device is respectively connected with a plurality of iron shoes; the routing devices comprise main controllers, wireless receiving and sending modules, power supply management modules and man-machine interactive interfaces; according to the controllers, Zigbee protocol stacks are optimized by using a routing modifying algorithm and an association table state information updating method, and the routing communication stability of the intelligent anti-slide system is improved. According to the invention, the Zigbee net structure AODVjr routing algorithm is modified; the forwarding direction of the routing request RREQ is controlled; the RREQ is prevented from flooding in the direction opposite to the target node; therefore network congestion is avoided; the information of the invalid nodes in the association table is periodically checked and eliminated; the number of the valid nodes is increased; therefore the coverage area of the wireless network is expanded.
Description
Technical field
The present invention relates to railway transportation runaway monitoring field, be specifically related to a kind of method for routing of intelligent anti-running system.
Technical background
Along with railway transportation is towards quick, safe and efficient future development, have higher requirement to the fail safe of railway operation, the operation of intermediate station vehicle anti-skid is the very important link of railway security operation, and wherein placing skate is anti-slip mode main.
Existing station adopts the intelligent anti-running system based on Zigbee wireless network at present, and system is generally made up of Intelligent iron shoe, router and telegon.Wherein, router is that guarantee system can realize one of important step of stable wireless telecommunications.
Router distribution is wide, the many and unattended operation of quantity.Conventional Zigbee mesh routing algorithm AODVjr finds in Intelligent iron shoe practical application, when system routing nodes quantity increases, route communication stability can decline thereupon, especially when routing node quantity reaches more than 20, just there will be obvious communicating interrupt phenomenon; In addition, also occur the frequent child node changing router, contingency table interior joint information automatically cannot upgrade and cause the difficult phenomenon that networks, and have impact on the stability of system.
Summary of the invention
For solving prior art Problems existing, the invention provides a kind of method for routing of intelligent anti-running system, to improve the stability of route work.
The present invention is achieved through the following technical solutions: a kind of method for routing of intelligent anti-running system, described intelligent anti-running system comprises Monitor Computer Control System, telegon, several route devices and several skates, Monitor Computer Control System is connected with each route device by telegon, be interconnected between each route device, each route device connects some skates respectively;
Described route device comprises master controller, radio receiving transmitting module, power management module and Man Machine Interface; Master controller have employed improved routing algorithm and upgrades the method optimization Zigbee protocol stack of contingency table state information, improves the stability of route communication in intelligent anti-running system;
Described improved routing algorithm refers to: improve Zigbee network structure AODVjr routing algorithm, control route requests RREQ routing direction, prevent RREQ edge and destination node rightabout inundation, thus avoid network congestion; Described renewal contingency table state information refers to: the information making regular check on, remove invalid node in contingency table, increases effective number of nodes, thus expands the coverage of wireless network.
As a kind of route requests scheme, concrete workflow is as follows:
A) when the routing node in network receives RREQ, first judge whether to coincide with Self address: if so, send answer signal; Otherwise, turn to step b;
B) judge whether the current network segment quantity passed through is greater than lifetime value TTL: if so, abandon RREQ; Otherwise, turn to step c;
C) value of judgement symbol position Flag: if Flag=1, turn to step f; Otherwise, turn to steps d;
D) judge that whether present node is the father node of previous dive node: if so, abandon RREQ; Otherwise, turn to step e;
E) judge that whether destination node is the child node of present node: if so, turn to step h; Otherwise Flag puts 1, turn to step h;
F) judge that whether present node is the child node of previous dive node: if so, abandon RREQ; Otherwise, turn to step g;
G) judge that whether destination node is the child node of present node: if so, Flag sets to 0, and turns to step h; Otherwise, turn to step h;
H) RREQ is forwarded.
The program effectively controls route requests RREQ routing direction, prevents route requests RREQ edge and destination node rightabout inundation, avoids network congestion phenomenon.
Make regular check on as a kind of the scheme removing contingency table, concrete workflow is as follows:
A) start timer one, judge whether that timing was by 5 minutes; If so, step b is turned to; Otherwise, continue to wait for;
B) according to the information of contingency table interior joint, send confirmation signal and start timer two, turning to step c;
C) judge, in 0.5 second, whether to receive the answer signal from node: if so, timeing closing device two, turns to step e; Otherwise, turn to steps d;
D) again send the confirmation signal of this node, judge the answer signal whether received in 0.5 second from node: if so, timeing closing device two, turns to step e; Otherwise, remove the nodal information of correspondence position in association and turn to step e;
E) judge whether last nodal information to be detected: if so, timeing closing device one, turns to step a; Otherwise, turn to step b.The program removes invalid node in contingency table in time, adds effective number of nodes in contingency table, expands the coverage of wireless network.
Beneficial effect of the present invention:
The present invention be directed to train runaway in railway transportation and the method for routing of a kind of intelligent anti-running system proposed and device, this invention is by improving AODVjr routing algorithm, control route requests RREQ routing direction, prevent RREQ edge and destination node rightabout inundation, avoid network congestion; By making regular check on, removing the information of invalid node in contingency table, increase effective number of nodes, expand the coverage of wireless network, improve the stability of intelligent anti-running system, ensure that the fail safe in the anti-slip process of railway transportation.
Accompanying drawing explanation
Fig. 1 is the structural representation of the anti-system of sauntering of intelligence
Fig. 2 is routing algorithm flow chart
Fig. 3 is that route detects removing contingency table flow chart
Fig. 4 is the hardware module figure of route device
Specific implementation process
Below in conjunction with accompanying drawing, the specific embodiment of the present invention is described further.The present embodiment is implemented premised on technical solution of the present invention, but protection scope of the present invention is not limited to following embodiment.
As shown in Figure 1, the anti-system of sauntering of intelligence is made up of skate, route device, telegon and Monitor Computer Control System, and route device, as the bridge in wireless telecommunications process, plays forwarding data, increases the key effect of wireless communication distance.
As shown in Figure 2, the flow process improving AODVjr routing algorithm is as follows:
A) when the routing node in network receives RREQ, first judge whether to coincide with Self address: if so, send answer signal; Otherwise, turn to step b;
B) judge whether the current network segment quantity passed through is greater than lifetime value TTL: if so, abandon RREQ; Otherwise, turn to step c;
C) value of judgement symbol position Flag: if Flag=1, turn to step f; Otherwise, turn to steps d;
D) judge that whether present node is the father node of previous dive node: if so, abandon RREQ; Otherwise, turn to step e;
E) judge that whether destination node is the child node of present node: if so, turn to step h; Otherwise Flag puts 1, turn to step h;
F) judge that whether present node is the child node of previous dive node: if so, abandon RREQ; Otherwise, turn to step g;
G) judge that whether destination node is the child node of present node: if so, Flag sets to 0, and turns to step h; Otherwise, turn to step h;
H) RREQ is forwarded.
As shown in Figure 3, make regular check on, to remove invalid information flow process in contingency table as follows:
A) start timer one, judge whether that timing was by 5 minutes; If so, step b is turned to; Otherwise, continue to wait for;
B) according to the information of contingency table interior joint, send confirmation signal and start timer two, turning to step c;
C) judge, in 0.5 second, whether to receive the answer signal from node: if so, timeing closing device two, turns to step e; Otherwise, turn to steps d;
D) again send the confirmation signal of this node, judge the answer signal whether received in 0.5 second from node: if so, timeing closing device two, turns to step e; Otherwise, remove the nodal information of correspondence position in association and turn to step e;
E) judge whether last nodal information to be detected: if so, timeing closing device one, turns to step a; Otherwise, turn to step b.
As shown in Figure 4, route device hardware circuit comprises master controller, radio receiving transmitting module, power management module and Man Machine Interface.Power module provides driving voltage for each module, and Man Machine Interface is used for download program and debugging.
In sum, the present invention, by improving AODVjr routing algorithm, controls route requests RREQ routing direction, prevents RREQ edge and destination node rightabout inundation, avoids network congestion; By making regular check on, removing the information of invalid node in contingency table, increase effective number of nodes, expand the coverage of wireless network, thus ensure that the stability of whole system.
The present invention illustrates clear by above-described embodiment and accompanying drawing thereof; without departing from the spirit and substance of the case in the present invention; those skilled in the art can make respective change and correction according to the present invention, and these changes and correction all belong to the protection range of the claims in the present invention.
The present invention does not relate to the method prior art that maybe can adopt all same as the prior art and is realized.
Claims (3)
1. the method for routing of an intelligent anti-running system, it is characterized in that, described intelligent anti-running system comprises Monitor Computer Control System, telegon, several route devices and several skates, Monitor Computer Control System is connected with each route device by telegon, be interconnected between each route device, each route device connects some skates respectively;
Described route device comprises master controller, radio receiving transmitting module, power management module and Man Machine Interface; Master controller have employed improved routing algorithm and upgrades the method optimization Zigbee protocol stack of contingency table state information, improves the stability of route communication in intelligent anti-running system;
Described improved routing algorithm refers to: improve Zigbee network structure AODVjr routing algorithm, control route requests RREQ routing direction, prevent RREQ edge and destination node rightabout inundation; Described renewal contingency table state information refers to: the information making regular check on, remove invalid node in contingency table, increases effective number of nodes.
2. the method for routing of a kind of intelligent anti-running system according to claim 1, described AODVjr routing algorithm comprises the steps:
A) when the routing node in network receives RREQ, first judge whether to coincide with Self address: if so, send answer signal; Otherwise, turn to step b;
B) judge whether the current network segment quantity passed through is greater than lifetime value TTL: if so, abandon RREQ and terminate; Otherwise, turn to step c;
C) value of judgement symbol position Flag: if Flag=0, turn to steps d; Otherwise, turn to step f;
D) judge that whether present node is the father node of previous dive node: if so, abandon RREQ and terminate; Otherwise, turn to step e;
E) judge that whether destination node is the child node of present node: if so, turn to step h; Otherwise Flag puts 1, turn to step h;
F) judge that whether present node is the child node of previous dive node: if so, abandon RREQ and terminate; Otherwise, turn to step g;
G) judge that whether destination node is the child node of present node: if so, Flag sets to 0, and turns to step h; Otherwise, turn to step h;
H) forward RREQ and terminate.
3. the method for routing of a kind of intelligent anti-running system according to claim 1, described renewal contingency table state information comprises the steps:
A) start timer one, judge whether that timing was by 5 minutes; If so, step b is turned to; Otherwise, continue to wait for;
B) according to the information of contingency table interior joint, send confirmation signal and start timer two, turning to step c;
C) judge, in 0.5 second, whether to receive the answer signal from node: if so, timeing closing device two, turns to step e; Otherwise, turn to steps d;
D) again send the confirmation signal of this node, judge the answer signal whether received in 0.5 second from node: if so, timeing closing device two, turns to step e; Otherwise, remove the nodal information of correspondence position in association and turn to step e;
E) judge whether last nodal information to be detected: if so, timeing closing device terminates in the lump, turns to step a; Otherwise, turn to step b.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510915873.XA CN105491638A (en) | 2015-12-10 | 2015-12-10 | Routing method of intelligent anti-slide system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510915873.XA CN105491638A (en) | 2015-12-10 | 2015-12-10 | Routing method of intelligent anti-slide system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105491638A true CN105491638A (en) | 2016-04-13 |
Family
ID=55678262
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510915873.XA Pending CN105491638A (en) | 2015-12-10 | 2015-12-10 | Routing method of intelligent anti-slide system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105491638A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107942810A (en) * | 2017-12-11 | 2018-04-20 | 南京富岛信息工程有限公司 | A kind of anti running system coordinator and its data processing method based on Zigbee communication data buffering |
| CN110111551A (en) * | 2019-05-07 | 2019-08-09 | 南京富岛信息工程有限公司 | Multichannel intelligent anti-running system, data communications method and communication data frame format |
| CN112265568A (en) * | 2020-10-26 | 2021-01-26 | 南京富岛信息工程有限公司 | Intelligent iron shoe slip alarm system |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101494591A (en) * | 2008-01-23 | 2009-07-29 | 华为技术有限公司 | End-to-end routing method, device and system |
| CN101835099A (en) * | 2010-04-23 | 2010-09-15 | 西安电子科技大学 | Large-scale sensor network routing method based on cluster and RREP broadcast |
| CN101969396A (en) * | 2010-09-02 | 2011-02-09 | 北京邮电大学 | Time delay and bandwidth resource-based relay selection method |
| CN102802230A (en) * | 2012-07-05 | 2012-11-28 | 江南大学 | Energy-efficient wireless sensor network routing algorithm |
| CN203933692U (en) * | 2014-08-07 | 2014-11-05 | 南京富岛信息工程有限公司 | The anti-slip system of a kind of rail truck intelligent parking |
| CN104240477A (en) * | 2014-09-18 | 2014-12-24 | 南京富岛信息工程有限公司 | Intelligent anti-sliding system and method for stopping of railway vehicles |
-
2015
- 2015-12-10 CN CN201510915873.XA patent/CN105491638A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101494591A (en) * | 2008-01-23 | 2009-07-29 | 华为技术有限公司 | End-to-end routing method, device and system |
| CN101835099A (en) * | 2010-04-23 | 2010-09-15 | 西安电子科技大学 | Large-scale sensor network routing method based on cluster and RREP broadcast |
| CN101969396A (en) * | 2010-09-02 | 2011-02-09 | 北京邮电大学 | Time delay and bandwidth resource-based relay selection method |
| CN102802230A (en) * | 2012-07-05 | 2012-11-28 | 江南大学 | Energy-efficient wireless sensor network routing algorithm |
| CN203933692U (en) * | 2014-08-07 | 2014-11-05 | 南京富岛信息工程有限公司 | The anti-slip system of a kind of rail truck intelligent parking |
| CN104240477A (en) * | 2014-09-18 | 2014-12-24 | 南京富岛信息工程有限公司 | Intelligent anti-sliding system and method for stopping of railway vehicles |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107942810A (en) * | 2017-12-11 | 2018-04-20 | 南京富岛信息工程有限公司 | A kind of anti running system coordinator and its data processing method based on Zigbee communication data buffering |
| CN107942810B (en) * | 2017-12-11 | 2020-05-26 | 南京富岛信息工程有限公司 | Anti-slip system coordinator based on Zigbee communication data buffering and data processing method thereof |
| CN110111551A (en) * | 2019-05-07 | 2019-08-09 | 南京富岛信息工程有限公司 | Multichannel intelligent anti-running system, data communications method and communication data frame format |
| CN110111551B (en) * | 2019-05-07 | 2020-12-15 | 南京富岛信息工程有限公司 | Multichannel intelligent anti-slip system, data communication method and communication data frame format |
| CN112265568A (en) * | 2020-10-26 | 2021-01-26 | 南京富岛信息工程有限公司 | Intelligent iron shoe slip alarm system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103905306B (en) | A kind of route exchanging method suitable for GEO/LEO bilayer Constellation Networks | |
| CN104639552B (en) | The chain network wireless high-speed means of communication | |
| CN103491590B (en) | A kind of implementation method of wireless sensor network route of future generation | |
| CN103701702A (en) | Dynamic routing algorithm in power line carrier communication | |
| CN103001879B (en) | Reduce the method and apparatus of LSA inundation number of times | |
| CN104754688A (en) | Routing method for entangled state based wireless Mesh quantum communication network | |
| CN204795616U (en) | ZIGBEE network access control device | |
| CN105491638A (en) | Routing method of intelligent anti-slide system | |
| CN103079287B (en) | Based on the perception of express highway intelligent vehicle and the method for controlling street lamps of wireless multihop ad hoc networks | |
| KR101110111B1 (en) | Method for mesh networking of street lamp and apparatus thereof | |
| CN103260211A (en) | Improved AOMDV routing method | |
| KR102686798B1 (en) | Parent node device, terminal device for wireless network and data transmission method thereof | |
| CN103139865B (en) | Networking and the method communicated in a kind of electric power Internet of Things | |
| CN112838669A (en) | Master-slave power distribution network protection and control system ad hoc network method based on 5G | |
| CN115002863A (en) | Wireless network routing method and storage medium suitable for large-scale network | |
| CN105634964B (en) | A kind of mobile ad-hoc network and its multicast route method | |
| US9686099B2 (en) | Updating virtual network maps | |
| CN104753703A (en) | Method and system for controlling network topology | |
| CN103260206A (en) | Mixing dynamic wireless router effective search convergence method based on influence degree factors | |
| Abdulrazzak et al. | Minimizing energy consumption in roadside unit of zigzag distribution based on RS-LS technique | |
| CN103929789A (en) | Automatic selection method for MANET network master control node based on active routing algorithm | |
| CN102420766B (en) | Routing determination method and routing device | |
| CN102752200B (en) | Network energy-saving method and device | |
| CN103595631B (en) | The method and apparatus that a kind of path is set up | |
| CN102316029A (en) | Fast rerouting method and routing equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160413 |
|
| RJ01 | Rejection of invention patent application after publication |