CN110234147A - The static routing dispositions method of lighting control system network - Google Patents

The static routing dispositions method of lighting control system network Download PDF

Info

Publication number
CN110234147A
CN110234147A CN201910506797.5A CN201910506797A CN110234147A CN 110234147 A CN110234147 A CN 110234147A CN 201910506797 A CN201910506797 A CN 201910506797A CN 110234147 A CN110234147 A CN 110234147A
Authority
CN
China
Prior art keywords
node
address
routing
data frame
group
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
Application number
CN201910506797.5A
Other languages
Chinese (zh)
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.)
Nanjing Grandsberg Network Technology Co Ltd
Original Assignee
Nanjing Grandsberg Network Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanjing Grandsberg Network Technology Co Ltd filed Critical Nanjing Grandsberg Network Technology Co Ltd
Priority to CN201910506797.5A priority Critical patent/CN110234147A/en
Publication of CN110234147A publication Critical patent/CN110234147A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/14Routing performance; Theoretical aspects
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/46Cluster building
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/74Address processing for routing
    • H04L45/745Address table lookup; Address filtering
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/24Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/32Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The present invention relates to a kind of static routing dispositions methods of lighting control system network, belong to computer field.Method includes the following steps: the group different according to geographical region division, thus generates the network address of each node;Each group of setting one or more routing node between the nodes of difference group, finds path by routing node and is attached with being directly in communication with each other between group node;The data frame of different inter-node communications includes source address, destination address, next-hop node address and other control domains;Set static routing table includes destination address and next-hop node address in routing node;The static routing table of each routing node is wirelessly connected by configuration software and is configured during deployment;Static routing work.The present invention reduces because a large amount of network overheads caused by route maintenance obtain stable network performance with minimum resource consumption, meet the huge lighting control system demand of number of nodes very well.

Description

The static routing dispositions method of lighting control system network
Technical field
The invention belongs to computer fields, are related to the static routing dispositions method of lighting control system network.
Background technique
Lighting control system network is using the static Wireless MESH network disposed.Network node is routing node according to function distinguishing And terminal node.Routing node fixed deployment as needed, forms wireless multi-hop backbone network.
Routing node refers to the network node for being configured to route forwarding function.And terminal node refers to without routing forwarding Function, as the starting point of message or the node of terminal.
Since the transmission range of each node is limited, when source node sends data to destination node, it usually needs use Multi-hop mode.So-called multi-hop refers to the node in network, does not need to be transmitted directly to destination, but can pass through phase each other The node to connect forwards data, data is jumped to another node from a node, until reaching the destination.
After so-called forwarding refers to that routing node receives message, according to the destination address of message, assisted according to the routing of setting View, obtains the path of next-hop, transfers data to next node.That is the Routing Protocol run on each routing node It has guided in communication network and business datum is directed to the mechanism of destination node from source node.
The most common Routing Protocol of Wireless MESH network is all made of dynamic routing protocol at present, i.e. transmission path is transferred to completely Router is automatically generated according to channel information, and when network topology state changes, topological condition is transmitted to by interdependent node Adjacent node receives the node time update routing table of changing condition, completes route handoff, and again by the variation occurred before Get forwarded to next node.But the cost paid is bigger network resource overhead, and needs powerful node processing power.This Outside, the mode of dynamic routing, which is not ensured that, realizes networking fully according to deployment requirements.
Summary of the invention
In view of this, the purpose of the present invention is to provide a kind of static routing dispositions method of lighting control system network, for Disadvantages mentioned above realizes the routing function of lighting control system network using static routing technology, and compared to dynamic routing, it is not needed Router continually exchanges routing table, is not take up network bandwidth, will not generate more new flow, this lamp small to bandwidth, more than message It controls for grid, is very important.Meanwhile the information such as topological structure and network address will not be propagated in the sky, favorably In network security.And compared to Flood routing agreement, and the propagation of the invalid data in network can be greatly reduced, improving network has Imitate handling capacity.Each node is all made of fixed position and is disposed especially in lighting control system network, not will cause network and opens up The dynamic for flutterring state changes, and therefore, realizes that network is disposed by the way of static routing, will preferably meet the need of lighting control system It wants.
In order to achieve the above objectives, the invention provides the following technical scheme:
The static routing dispositions method of lighting control system network, comprising the following steps:
S1: according to the different group of geographical region division, the network address of each node is thus generated;
S2: each group setting one or more routing node, with being directly in communication with each other between group node, the sections of difference group Between point, path is found by routing node and is attached;
S3: the data frame of different inter-node communications includes source address, destination address, next-hop node address and other controls Domain processed;
S4: set static routing table includes destination address and next-hop node address in routing node;
S5: the static routing table of each routing node wirelessly connected during deployment, by configuration software into Row configuration;
S6: static routing workflow: after routing node receives data frame, judge whether destination address is this node Address, if so, otherwise the processing contained control information of data frame according to the control domain in data frame, judges whether routing node It is forwarded;If so, next-hop node address corresponding to destination address in data in queries static routing table, will be connect The data frame received is sent to checked in next-hop node address;It repeats the above process, until sending data to destination Location.
Further, this method specifically:
S11: according to region division at tetra- groups of G1, G2, G3, G4, each node distributes an address containing group number;
S12: setting node 11,21,31,41 is respectively routing node;
S23: static routing table is configured for each routing node;
Wherein, the static routing table of node 11 is table 1:
The static routing table of 1 node 11 of table
Destination address or group address Next hop address
2* 31
3* 31
4* 31
The static routing table of node 31 is table 2:
The static routing table of 2 node 31 of table
Destination address or group address Next hop address
1* 11
2* 21
4* 41
S14: the course of work:
1. terminal node 14 sends out control command to node 42, data frame first is sent to routing node, routing node receives To after data frame, 42 non-node address of destination address are judged;
2. judging that the data frame needs routing node to forward according to data frame control domain, then routing table 1 being searched, according to it Group address 4*, checking in next hop address is 31, forwarding data frame to node 31;
3. node 31 receives data frame, 42 non-node address of destination address are judged;
4. judging that the data frame needs routing node to forward according to data frame control domain, then routing table 2 being searched, according to it Group address 4*, checking in next hop address is 41, forwarding data frame to node 41;
5. node 41 receives data frame, 42 non-node address of destination address are judged, but be this group address, send data Frame is to node 42;
6. node 42 receives data frame, judge that destination address 42 for this node address, handles data frame information loaded.
A kind of computer installation, including memory, processor and storage can transport on a memory and on a processor Capable computer program, the processor are realized when executing the computer program according to the method.
A kind of computer readable storage medium, is stored thereon with computer program, and the computer program is held by processor It realizes when row according to the method.
The beneficial effects of the present invention are: the present invention is directed to the characteristics of lamp sky grid, using the deployment of static routing Method greatly reduces because of a large amount of network overheads caused by route maintenance.Routing table is built according to grouping simultaneously, is greatly reduced The size of static routing table obtains stable network performance with minimum resource consumption, meets the huge lamp of number of nodes very well Control system requirements.
Other advantages, target and feature of the invention will be illustrated in the following description to a certain extent, and And to a certain extent, based on will be apparent to those skilled in the art to investigating hereafter, Huo Zheke To be instructed from the practice of the present invention.Target of the invention and other advantages can be realized by following specification and It obtains.
Detailed description of the invention
To make the objectives, technical solutions, and advantages of the present invention clearer, the present invention is made below in conjunction with attached drawing excellent The detailed description of choosing, in which:
Fig. 1 is principle schematic diagram of the present invention.
Specific embodiment
Illustrate embodiments of the present invention below by way of specific specific example, those skilled in the art can be by this specification Other advantages and efficacy of the present invention can be easily understood for disclosed content.The present invention can also pass through in addition different specific realities The mode of applying is embodied or practiced, the various details in this specification can also based on different viewpoints and application, without departing from Various modifications or alterations are carried out under spirit of the invention.It should be noted that diagram provided in following embodiment is only to show Meaning mode illustrates basic conception of the invention, and in the absence of conflict, the feature in following embodiment and embodiment can phase Mutually combination.
Wherein, the drawings are for illustrative purposes only and are merely schematic diagrams, rather than pictorial diagram, should not be understood as to this The limitation of invention;Embodiment in order to better illustrate the present invention, the certain components of attached drawing have omission, zoom in or out, not Represent the size of actual product;It will be understood by those skilled in the art that certain known features and its explanation may be omitted and be in attached drawing It is understood that.
The same or similar label correspond to the same or similar components in the attached drawing of the embodiment of the present invention;It is retouched in of the invention In stating, it is to be understood that if there is the orientation or positional relationship of the instructions such as term " on ", "lower", "left", "right", "front", "rear" To be based on the orientation or positional relationship shown in the drawings, be merely for convenience of description of the present invention and simplification of the description, rather than indicate or It implies that signified device or element must have a particular orientation, be constructed and operated in a specific orientation, therefore is described in attached drawing The term of positional relationship only for illustration, is not considered as limiting the invention, for the ordinary skill of this field For personnel, the concrete meaning of above-mentioned term can be understood as the case may be.
Referring to Fig. 1, being a kind of static routing dispositions method of lighting control system network, comprising the following steps:
S1: according to the different group of geographical region division, the network address of each node is thus generated;
S2: each group setting one or more routing node, with being directly in communication with each other between group node, the sections of difference group Between point, path is found by routing node and is attached;
S3: the data frame of different inter-node communications includes source address, destination address, next-hop node address and other controls Domain processed.
S4: set static routing table contains destination address, next-hop node address in routing node;
S5: the static routing table of each routing node wirelessly connected during deployment, by configuration software into Row configuration;
S6: static routing workflow: after routing node receives data frame, judge whether destination address is this node Address, if so, otherwise the processing contained control information of data frame according to the control domain in data frame, judges whether routing node It is forwarded.If so, next-hop node address corresponding to destination address in data in queries static routing table, will be connect The data frame received is sent to checked in next-hop node address.It repeats the above process, until sending data to destination Location.
Embodiment:
1, according to region division at tetra- groups of G1, G2, G3, G4, each node distributes an address containing group number;
2, setting node 11,21,31,41 is respectively routing node;
3, static routing table is configured for each routing node.
Wherein, the static routing table of node 11 is table 1:
The static routing table of 1 node 11 of table
Destination address (or group address) Next hop address
2* 31
3* 31
4* 31
The static routing table of node 31 is table 2:
The static routing table of 2 node 31 of table
Destination address (or group address) Next hop address
1* 11
2* 21
4* 41
4, the course of work:
1. terminal node 14 sends out control command to node 42, data frame first is sent to routing node, routing node receives To after data frame, 42 non-node address of destination address are judged;
2. judging that the data frame needs routing node to forward according to data frame control domain, then routing table 1 being searched, according to it Group address 4*, checking in next hop address is 31, forwarding data frame to node 31;
3. node 31 receives data frame, 42 non-node address of destination address are judged;
4. judging that the data frame needs routing node to forward according to data frame control domain, then routing table 2 being searched, according to it Group address 4*, checking in next hop address is 41, forwarding data frame to node 41;
5. node 41 receives data frame, 42 non-node address of destination address are judged, but be this group address, send data Frame is to node 42;
6. node 42 receives data frame, judge that destination address 42 for this node address, handles data frame information loaded.
It should be appreciated that the embodiment of the present invention can be by computer hardware, the combination of hardware and software or by depositing The computer instruction in non-transitory computer-readable memory is stored up to be effected or carried out.Standard volume can be used in the method Journey technology-includes that the non-transitory computer-readable storage media configured with computer program is realized in computer program, In configured in this way storage medium computer is operated in a manner of specific and is predefined --- according in a particular embodiment The method and attached drawing of description.Each program can with the programming language of level process or object-oriented come realize with department of computer science System communication.However, if desired, the program can be realized with compilation or machine language.Under any circumstance, which can be volume The language translated or explained.In addition, the program can be run on the specific integrated circuit of programming for this purpose.
In addition, the operation of process described herein can be performed in any suitable order, unless herein in addition instruction or Otherwise significantly with contradicted by context.Process described herein (or modification and/or combination thereof) can be held being configured with It executes, and is can be used as jointly on the one or more processors under the control of one or more computer systems of row instruction The code (for example, executable instruction, one or more computer program or one or more application) of execution, by hardware or its group It closes to realize.The computer program includes the multiple instruction that can be performed by one or more processors.
Further, the method can be realized in being operably coupled to suitable any kind of computing platform, wrap Include but be not limited to PC, mini-computer, main frame, work station, network or distributed computing environment, individual or integrated Computer platform or communicated with charged particle tool or other imaging devices etc..Each aspect of the present invention can be to deposit The machine readable code on non-transitory storage medium or equipment is stored up to realize no matter be moveable or be integrated to calculating Platform, such as hard disk, optical reading and/or write-in storage medium, RAM, ROM, so that it can be read by programmable calculator, when Storage medium or equipment can be used for configuration and operation computer to execute process described herein when being read by computer.This Outside, machine readable code, or part thereof can be transmitted by wired or wireless network.When such media include combining microprocessor Or other data processors realize steps described above instruction or program when, invention as described herein including these and other not The non-transitory computer-readable storage media of same type.When the static routing portion of lighting control system network according to the present invention When arranging method and technology program, the invention also includes computers itself.
Computer program can be applied to input data to execute function as described herein, to convert input data with life At storing to the output data of nonvolatile memory.Output information can also be applied to one or more output equipments as shown Device.In the preferred embodiment of the invention, the data of conversion indicate physics and tangible object, including the object generated on display Reason and the particular visual of physical objects are described.
Finally, it is stated that the above examples are only used to illustrate the technical scheme of the present invention and are not limiting, although referring to compared with Good embodiment describes the invention in detail, those skilled in the art should understand that, it can be to skill of the invention Art scheme is modified or replaced equivalently, and without departing from the objective and range of the technical program, should all be covered in the present invention Scope of the claims in.

Claims (4)

1. the static routing dispositions method of lighting control system network, it is characterised in that: the following steps are included:
S1: according to the different group of geographical region division, the network address of each node is thus generated;
S2: each group setting one or more routing node, with being directly in communication with each other between group node, the nodes of difference group it Between, path is found by routing node and is attached;
S3: the data frame of different inter-node communications includes source address, destination address, next-hop node address and other controls Domain;
S4: set static routing table includes destination address and next-hop node address in routing node;
S5: the static routing table of each routing node is wirelessly connected by configuration software and is matched during deployment It sets;
S6: static routing workflow: when routing node receives data frame after, judge whether destination address is this node Location, if so, otherwise the processing contained control information of data frame according to the control domain in data frame, judges whether that routing node is wanted It is forwarded;If so, next-hop node address corresponding to destination address in data in queries static routing table, will be received To data frame be sent to checked in next-hop node address;It repeats the above process, until sending data to destination address.
2. the static routing dispositions method of lighting control system network according to claim 1, it is characterised in that: this method is specific Are as follows:
S11: according to region division at tetra- groups of G1, G2, G3, G4, each node distributes an address containing group number;
S12: setting node 11,21,31,41 is respectively routing node;
S23: static routing table is configured for each routing node;
Wherein, the static routing table of node 11 is table 1:
The static routing table of 1 node 11 of table
Destination address or group address Next hop address 2* 31 3* 31 4* 31
The static routing table of node 31 is table 2:
The static routing table of 2 node 31 of table
Destination address or group address Next hop address 1* 11 2* 21 4* 41
S14: the course of work:
1. terminal node 14 sends out control command to node 42, data frame first is sent to routing node, routing node receives number After frame, 42 non-node address of destination address are judged;
2. judging that the data frame needs routing node to forward according to data frame control domain, then searching routing table 1, according to its group ground Location 4*, checking in next hop address is 31, forwarding data frame to node 31;
3. node 31 receives data frame, 42 non-node address of destination address are judged;
4. judging that the data frame needs routing node to forward according to data frame control domain, then searching routing table 2, according to its group ground Location 4*, checking in next hop address is 41, forwarding data frame to node 41;
5. node 41 receives data frame, 42 non-node address of destination address are judged, but be this group address, send data frame extremely Node 42;
6. node 42 receives data frame, judge that destination address 42 for this node address, handles data frame information loaded.
3. a kind of computer installation, including memory, processor and storage can be run on a memory and on a processor Computer program, it is characterised in that: the processor is realized according to claim 1 or 2 institutes when executing the computer program The method stated.
4. a kind of computer readable storage medium, is stored thereon with computer program, it is characterised in that: the computer program quilt Processor realizes method according to claim 1 or 2 when executing.
CN201910506797.5A 2019-06-12 2019-06-12 The static routing dispositions method of lighting control system network Pending CN110234147A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910506797.5A CN110234147A (en) 2019-06-12 2019-06-12 The static routing dispositions method of lighting control system network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910506797.5A CN110234147A (en) 2019-06-12 2019-06-12 The static routing dispositions method of lighting control system network

Publications (1)

Publication Number Publication Date
CN110234147A true CN110234147A (en) 2019-09-13

Family

ID=67859029

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910506797.5A Pending CN110234147A (en) 2019-06-12 2019-06-12 The static routing dispositions method of lighting control system network

Country Status (1)

Country Link
CN (1) CN110234147A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11665658B1 (en) 2021-04-16 2023-05-30 Rockwell Collins, Inc. System and method for application of doppler corrections for time synchronized transmitter and receiver
US11726162B2 (en) 2021-04-16 2023-08-15 Rockwell Collins, Inc. System and method for neighbor direction and relative velocity determination via doppler nulling techniques
US11737121B2 (en) 2021-08-20 2023-08-22 Rockwell Collins, Inc. System and method to compile and distribute spatial awareness information for network
US11977173B2 (en) 2019-11-27 2024-05-07 Rockwell Collins, Inc. Spoofing and denial of service detection and protection with doppler nulling (spatial awareness)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120185563A1 (en) * 2010-08-31 2012-07-19 Springsoft K.K. Network system, virtual private connection forming method, static nat forming device, reverse proxy server and virtual connection control device
CN109413709A (en) * 2018-11-21 2019-03-01 上海事凡物联网科技有限公司 Ad hoc network static routing method, apparatus, communication node and storage medium

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120185563A1 (en) * 2010-08-31 2012-07-19 Springsoft K.K. Network system, virtual private connection forming method, static nat forming device, reverse proxy server and virtual connection control device
CN109413709A (en) * 2018-11-21 2019-03-01 上海事凡物联网科技有限公司 Ad hoc network static routing method, apparatus, communication node and storage medium

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11977173B2 (en) 2019-11-27 2024-05-07 Rockwell Collins, Inc. Spoofing and denial of service detection and protection with doppler nulling (spatial awareness)
US11665658B1 (en) 2021-04-16 2023-05-30 Rockwell Collins, Inc. System and method for application of doppler corrections for time synchronized transmitter and receiver
US11726162B2 (en) 2021-04-16 2023-08-15 Rockwell Collins, Inc. System and method for neighbor direction and relative velocity determination via doppler nulling techniques
US11737121B2 (en) 2021-08-20 2023-08-22 Rockwell Collins, Inc. System and method to compile and distribute spatial awareness information for network

Similar Documents

Publication Publication Date Title
CN110234147A (en) The static routing dispositions method of lighting control system network
US10547563B2 (en) Efficient message forwarding for distributed resource orchestration
CN112751826B (en) Method and device for forwarding flow of computing force application
US20190028378A1 (en) Information processing apparatus, method and non-transitory computer-readable storage medium
US10230661B2 (en) Distributed virtual network embedding
JP5956006B2 (en) Reducing message and computational overhead in the network
US8000267B2 (en) Network routing with path identifiers
CN105553680A (en) System and method for creating virtual interfaces based on network characteristics
EP3682597B1 (en) Modeling access networks as trees in software-defined network controllers
US20180302324A1 (en) Packet forwarding mechanism
CN104426815A (en) Flow table issuing method and system in software-defined network, open flow controller and open flow switch
CN102362470B (en) Path setting server and path setting method
CN105659529A (en) AD-HOC on-demand routing through central control
US20160192211A1 (en) Cross-layer framework in wireless mesh network using bio-inspired algorithm and operation method thereof
CN106161237A (en) Centralized method for routing, device and system
CN111382114A (en) Data transmission method and device for network on chip and electronic equipment
WO2018054159A1 (en) System and method for data transmission in uplink ran
CN107800627A (en) The wiring method and device of three-state content addressing memory TCAM tables
CN104363173A (en) Forwarding router information generation method, controller and software-defined networking system
CN105530185A (en) Overlay routing network, routing method based on overlay routing network, and router
US10536368B2 (en) Network-aware routing in information centric networking
US7848240B2 (en) Method and apparatus for forwarding data in a data communications network
CN107026878A (en) Subscribe to the dissemination method and device of message
US20110128962A1 (en) Method for routing of messages within a data network
US8792503B2 (en) Path selection method, information processor, network system, and path selection program

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20190913