CN109450800A - A kind of dynamic adjustment star cluster Ad Hoc by interaction cycle method and system - Google Patents

A kind of dynamic adjustment star cluster Ad Hoc by interaction cycle method and system Download PDF

Info

Publication number
CN109450800A
CN109450800A CN201811543804.0A CN201811543804A CN109450800A CN 109450800 A CN109450800 A CN 109450800A CN 201811543804 A CN201811543804 A CN 201811543804A CN 109450800 A CN109450800 A CN 109450800A
Authority
CN
China
Prior art keywords
routing
node
interaction cycle
original
routing table
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
CN201811543804.0A
Other languages
Chinese (zh)
Other versions
CN109450800B (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.)
Xian Institute of Space Radio Technology
Original Assignee
Xian Institute of Space Radio Technology
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 Xian Institute of Space Radio Technology filed Critical Xian Institute of Space Radio Technology
Priority to CN201811543804.0A priority Critical patent/CN109450800B/en
Publication of CN109450800A publication Critical patent/CN109450800A/en
Application granted granted Critical
Publication of CN109450800B publication Critical patent/CN109450800B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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/02Topology update or discovery
    • H04L45/028Dynamic adaptation of the update intervals, e.g. event-triggered updates
    • 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/248Connectivity information update

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Small-Scale Networks (AREA)

Abstract

The invention discloses a kind of dynamic adjustment star cluster Ad Hocs by the method and system of interaction cycle, wherein this method comprises the following steps: step 1: initialization routing interaction cycle is T after specified node bootingoriginal, and with ToriginalPeriodic broadcast routing packets;Step 2: the routing packets that specified node receives other nodes establish the local routing table comprising network whole nodal information;Step 3: specified node periodic test local routing table, if do not increased or decreased in sufficiently long time internal routing table entry, adjusting routing interaction cycle is Tsteady, and press periodic broadcasting routing packets adjusted;It is T that routing interaction cycle is adjusted if the variation for detecting routing entryoriginal, and press periodic broadcasting routing packets adjusted.The present invention solves the higher link transmission overhead issues of traditional Table Driven agreement, while meeting star cluster ad hoc network fast route convergence and simple and practical requirement that slow dynamics change.

Description

A kind of dynamic adjustment star cluster Ad Hoc by interaction cycle method and system
Technical field
The invention belongs to satellite communication fields more particularly to a kind of dynamic to adjust star cluster Ad Hoc by the side of interaction cycle Method and system, the star cluster ad-hoc network suitable for slow dynamics variation.
Background technique
Star cluster network can promote satellite service ability to the maximum extent, expand satellite service range, effectively make up list Star existing various deficiencies in orbit, thus the Simulation spatial service system that one perfect in shape and function, performance of building are stable.Due to star cluster The topology configuration of network is uncertain, and there are multi-hop transmissions between star, it is therefore necessary to solve the intersatellite routing issue of multi-hop with reality High efficient and reliable communication in existing star cluster net.
The performance of Routing Protocol and network topology and type of service, transmission requirement etc. are closely related, and existing terrestrial wireless is certainly Tissue network has proposed a variety of Routing Protocols, but is for designed by ground ad hoc network reapective features: such as wireless sensing Device network, mobile Ad Hoc network, vehicular ad hoc network etc., the research of routing algorithm are concentrated on based on link state, geographical position Confidence breath, load balancing, power control and cross layer design etc. optimize Routing Protocol to adapt to network transmission scene, cannot directly answer It is slow for network topology change, transmission rate is low, plant maintenance is inconvenient, resource is limited on star and space electromagnetic environment is complicated It is fast to ring star cluster network.And the research of satellite network Routing Protocol is mostly based on LEO or multilayer Satellite Constellation Networks, network topology Continue high dynamic variation and path it is expected that different from the topological scene of distributed star cluster network, cannot directly bring application.
By the analysis to star cluster network topology change feature and data transfer demands, the conduct of Table Driven agreement is chosen The Routing Protocol of star cluster ad hoc network, but Table Driven agreement needs periodically interaction routing packets, occupies suitable one The link overhead divided, if the longer of interaction cycle setting can reduce link overhead but it cannot be guaranteed that routing to a certain extent Fast convergence.
Summary of the invention
Technical problem solved by the present invention is having overcome the deficiencies of the prior art and provide a kind of dynamic adjusts star cluster from group Network solves the higher link transmission overhead issues of traditional Table Driven agreement, together by the method and system of interaction cycle When meet slow dynamics variation star cluster ad hoc network fast route convergence and simple and practical requirement.
The object of the invention is achieved by the following technical programs: according to an aspect of the present invention, having been passed through a kind of dynamic State adjusts star cluster Ad Hoc by the method for interaction cycle, and described method includes following steps: step 1: after specified node booting Initialization routing interaction cycle is Toriginal, and with ToriginalPeriodic broadcast routing packets;Step 2: specified node receives it The routing packets of his node establish the local routing table comprising network whole nodal information;Step 3: specified node periodic test Local routing table, if do not increased or decreased in sufficiently long time internal routing table entry, adjusting routing interaction cycle is Tsteady, and press periodic broadcasting routing packets adjusted;Routing interaction cycle is adjusted if the variation for detecting routing entry For Toriginal, and press periodic broadcasting routing packets adjusted.
Above-mentioned dynamic adjustment star cluster Ad Hoc is by the method for interaction cycle, in step 2, specified node receives other It includes: when synchronizing network is established or is newly entered that the routing packets of node, which establish the local routing table comprising network whole nodal information, After the node of net enters synchronous regime, node is just with ToriginalPeriodic broadcast routing packets receive the node handle of routing packets Corresponding routing iinformation is added in local routing table, the update to local routing table is completed, then with cycle ToriginalBroadcast packet Routing packets containing new routing table, each periodic broadcast of node are grouped, and each node in final network establishes one A routing table comprising overall network topology.
Above-mentioned dynamic adjustment star cluster Ad Hoc is by the method for interaction cycle, in step 3, if when sufficiently long Between internal routing table entry do not increase or decrease, then adjust routing interaction cycle be TsteadyIt include: when continuous n times check locally When routing table does not have routing entry variation, routing interaction cycle is just adjusted to Tsteady, posterior nodal point with TsteadyIt is wide for the period Broadcast routing update grouping.
Above-mentioned dynamic adjustment star cluster Ad Hoc is by the method for interaction cycle, N=3.
Above-mentioned dynamic adjustment star cluster Ad Hoc is by the method for interaction cycle, interaction cycle is adjusted to Tsteady=M* Toriginal, wherein M=5.
According to another aspect of the present invention, additionally providing a kind of dynamic adjustment star cluster Ad Hoc by interaction cycle is System, comprising: the first module is T for initialization routing interaction cycle after specifying node to be switched onoriginal, and with ToriginalPeriod Property broadcast grouping;Second module, the routing packets foundation for specifying node to receive other nodes are local complete comprising network The routing table of portion's nodal information;Third module, for specifying node periodic test local routing table, if when sufficiently long Between internal routing table entry do not increase or decrease, then adjust routing interaction cycle be Tsteady, and press periodic broadcasting road adjusted By being grouped;It is T that routing interaction cycle is adjusted if the variation for detecting routing entryoriginal, and it is wide by the period adjusted Broadcast routing packets.
Above-mentioned dynamic adjustment star cluster Ad Hoc is by the second module, specifying node to receive in the system of interaction cycle The routing packets of other nodes establish the local routing table comprising network whole nodal information include: when synchronizing network is established or After the node newly to network enters synchronous regime, node is just with ToriginalPeriodic broadcast routing packets receive the section of routing packets Point is added to corresponding routing iinformation in local routing table, the update to local routing table is completed, then with cycle ToriginalExtensively The routing packets comprising new routing table are broadcast, each periodic broadcast of node is grouped, and each node in final network is built A vertical routing table comprising overall network topology.
Above-mentioned dynamic adjustment star cluster Ad Hoc is by the system of interaction cycle, in third module, if sufficiently long Time internal routing table entry do not increase or decrease, then adjust routing interaction cycle be TsteadyIt include: when continuous n times inspection When local routing table does not have routing entry variation, routing interaction cycle is just adjusted to Tsteady, posterior nodal point with TsteadyFor week Phase broadcast updates grouping.
Above-mentioned dynamic adjustment star cluster Ad Hoc is by the system of interaction cycle, N=3.
Above-mentioned dynamic adjustment star cluster Ad Hoc is by the system of interaction cycle, interaction cycle is adjusted to Tsteady=M* Toriginal, wherein M=5.
According to another aspect of the invention, one or more machine readable medias are additionally provided, instruction is stored thereon with, when When being performed by one or more processors, so that the method that equipment executes an invention of the invention.
According to another aspect of the invention, a kind of processor is additionally provided, the processor is for running program, wherein Described program executes an invention of the invention method when running.
Compared with prior art, the present invention has the following advantages:
Whether the present invention is according to the variation of local routing table, adjustment routing interaction cycle is reducing network operation expense It ensure that routing convergence time simultaneously, meet the route request of star cluster low speed net.
Detailed description of the invention
By reading the following detailed description of the preferred embodiment, various other advantages and benefits are common for this field Technical staff will become clear.The drawings are only for the purpose of illustrating a preferred embodiment, and is not considered as to the present invention Limitation.And throughout the drawings, the same reference numbers will be used to refer to the same parts.In the accompanying drawings:
Fig. 1 is dynamic provided in an embodiment of the present invention adjustment star cluster Ad Hoc by the flow chart of the method for interaction cycle;
Fig. 2 is the schematic diagram of routing packets format provided in an embodiment of the present invention;
Fig. 3 is to show the block diagram for the calculating equipment that can be used to practice embodiments of the present invention.
Specific embodiment
Exemplary embodiments of the present disclosure are described in more detail below with reference to accompanying drawings.Although showing the disclosure in attached drawing Exemplary embodiment, it being understood, however, that may be realized in various forms the disclosure without should be by embodiments set forth here It is limited.On the contrary, these embodiments are provided to facilitate a more thoroughly understanding of the present invention, and can be by the scope of the present disclosure It is fully disclosed to those skilled in the art.It should be noted that in the absence of conflict, embodiment in the present invention and Feature in embodiment can be combined with each other.The present invention will be described in detail below with reference to the accompanying drawings and embodiments.
Fig. 1 is dynamic provided in an embodiment of the present invention adjustment star cluster Ad Hoc by the flow chart of the method for interaction cycle. As shown in Figure 1, this method comprises the following steps:
Step 1: initialization routing interaction cycle is T after specified node bootingoriginal, and with ToriginalPeriodic broadcast Routing packets;
Step 2: the routing packets that specified node receives other nodes establish the local road comprising network whole nodal information By table;
Step 3: specified node periodic test local routing table, if do not had in sufficiently long time internal routing table entry It increases or decreases, then adjusting routing interaction cycle is Tsteady, and press periodic broadcasting routing packets adjusted;If detected It is T that the variation of routing entry, which then adjusts routing interaction cycle,original, and press periodic broadcasting routing packets adjusted.
Further, other nodes in addition to specified node are executed according to step 1 to step 3.
In step 2, the routing packets that specified node receives other nodes are established local comprising network whole nodal information Routing table include: after synchronizing network is established or newly the node that networks enters synchronous regime, node is just with ToriginalPeriod Property broadcast grouping.The node for receiving routing packets is added to corresponding routing iinformation in local routing table, completes to local The update of routing table, then with cycle ToriginalBroadcast includes the routing packets of new routing table.Each node periodically broadcasts road By being grouped, after such a period of time, each node in network just establishes the routing table comprising overall network topology.
In step 3: when continuous N (N=3 can be arranged according to network actual conditions) secondary inspection local routing table does not have road When being changed by entry, routing interaction cycle is just adjusted to Tsteady, posterior nodal point with TsteadyFor periodic broadcasting routing update point Group (wherein Tsteady=M*Toriginal, M=5 can be arranged according to network actual conditions).Since star cluster ad-hoc network is very long by one The topology link that will not change is relatively stable in the section time, and has the exception monitoring disconnected to link in TDMA communication system, Therefore route reliability will not be had an impact by increasing routing interaction cycle;Stablize in network topology, nets interior each node with Tsteady When periodic broadcasting routing update is grouped, if there is the feelings such as network or net interior nodes exception are added in network topological change, new node When condition occurs, first it is detected that the node of local routing table clause variation (routing entry increases or routing entry is reduced) adjusts this Node-routing interaction cycle is Toriginal, then with ToriginalPeriodic broadcasting routing packets.
(1) foundation of routing table
The broadcast cycle of routing packets is initialized as Toriginal, ToriginalIt requires to set according to network size and system task It sets, meets convergent cycle requirement.After synchronizing network is established or newly the node that networks enters synchronous regime, node just with ToriginalPeriodic broadcast routing packets.The node for receiving routing packets is added to corresponding routing iinformation in local routing table, The update to local routing table is completed, then with cycle ToriginalBroadcast includes the routing packets of new routing table.Each node period Property broadcast grouping, after such a period of time, each node in network just establishes one and opens up comprising overall network The routing table flutterred.
The local routing table that this patent uses is as follows, wherein " time-out count " indicates that route table items do not update super When the time, be used for link or node abnormality detection.
The router-table structure of 1 local maintenance of table is illustrated
Purpose Next-hop Metric Sequence number Renewal time Time-out count
A A 0 A-600 Time_Cnt1 0
B B 1 B-480 Time_Cnt2 0
C C 1 C-870 Time_Cnt3 0
D C 2 D-112 Time_Cnt4 0
The format of routing packets is as shown in Figure 2.
Route table items sum: showing there are several route table items in the routing packets, and value is 1~3.(it is limited to physical layer Link rate, routing packets maximum are no more than 14 bytes, therefore 1 routing packets at most loads 3 route table items, in frame format Dark part is not essential according to the quantity of route table items sum);
Destination node: the route table items are finally reached node;
Next-hop: the next-hop node of destination node is reached;
Metric: the route entry is transmitted packets to up to the hop count passed through needed for destination node;
Sequence number: destination node sequence number, the sequence number are generated by the destination node in route entry, each node in network The generation that routing table should make the sequence number maintain latest value to avoid routine cycling.
(2) adjustment of interaction cycle is routed
1) extension of interaction cycle is routed
When continuous N (N=3 can be arranged according to network actual conditions) secondary inspection local routing table does not have routing entry variation When, routing interaction cycle is just adjusted to Tsteady, posterior nodal point with Tsteady(wherein for periodic broadcasting routing update grouping Tsteady=M*Toriginal, M=5 can be arranged according to network actual conditions).Since star cluster ad-hoc network is within a very long time The topology link that will not change is relatively stable, and has the exception monitoring disconnected to link in TDMA communication system, therefore increases Routing interaction cycle will not have an impact route reliability;Simultaneously because extending routing interaction cycle, each section is reduced Point sends the quantity of routing update grouping to reduce the link bandwidth expense of maintenance the whole network routing.
2) shortening of interaction cycle is routed
Stablize in network topology, nets interior each node with TsteadyWhen periodic broadcasting routing update is grouped, if there is network topology When situations such as change, abnormal new node addition network or net interior nodes occurs, first it is detected that local routing table clause changes It is T that the node of (routing entry increases or routing entry is reduced), which adjusts this node-routing interaction cycle,original, then with ToriginalPeriodic broadcasting routing packets shorten since routing update is grouped to send to be spaced, accelerate other nodal tests in network To the time of routing variation, detect that routing interaction cycle is successively adjusted to T by the node of routing variationoriginal, therefore shorten The whole network routing convergence time, it is ensured that routing table follows network topology change closely and changes.
The present embodiment additionally provides a kind of dynamic adjustment star cluster Ad Hoc by the system of interaction cycle, comprising: the first mould Block is T for initialization routing interaction cycle after specifying node to be switched onoriginal, and with ToriginalPeriodic broadcast routing point Group;Second module locally includes network whole nodal information for specifying node to receive the routing packets foundation of other nodes Routing table;Third module, for specifying node periodic test local routing table, if in sufficiently long time internal routing table item Mesh does not increase or decrease, then adjusting routing interaction cycle is Tsteady, and press periodic broadcasting routing packets adjusted;If Detecting that the variation of routing entry then adjusts routing interaction cycle is Toriginal, and press periodic broadcasting routing packets adjusted.
In above-described embodiment, in the second module, the routing packets that specified node receives other nodes, which are established, locally includes The routing table of network whole nodal information includes:: after the node that synchronizing network is established or newly networked enters synchronous regime, section Point is just with ToriginalCorresponding routing iinformation is added to local routing by periodic broadcast routing packets, the node for receiving routing packets In table, the update to local routing table is completed, then with cycle ToriginalBroadcast includes the routing packets of new routing table, each node Periodic broadcast is grouped, and each node in final network establishes the routing table comprising overall network topology.
In above-described embodiment, in third module, add deduct if do not increased in sufficiently long time internal routing table entry Few, then adjusting routing interaction cycle is TsteadyIt include: when continuous n times check that local routing table does not have routing entry variation, just Routing interaction cycle is adjusted to Tsteady, posterior nodal point with Tsteady(wherein T is grouped for periodic broadcasting routing updatesteady=M* Toriginal, M=5 can be arranged according to network actual conditions).Since topology will not within a very long time for star cluster ad-hoc network The link that changes is relatively stable, and has the exception monitoring disconnected to link in TDMA communication system, therefore increases routing interaction Period will not have an impact route reliability;Stablize in network topology, nets interior each node with TsteadyPeriodic broadcasting routing update When grouping, if there is being detected when situations such as network or net interior nodes are abnormal, which is added, in network topological change, new node occurs first Node to local routing table clause variation (routing entry increases or routing entry is reduced) adjusts this node-routing interaction cycle For Toriginal, then with ToriginalPeriodic broadcasting routing packets.
The present embodiment additionally provides one or more machine readable medias, instruction is stored thereon with, when by one or more When processor executes, so that equipment executes the intelligent updating method based on image block characteristics.
The present embodiment additionally provides a kind of processor, and the processor is for running program, wherein the program executes when running Intelligent updating method based on image block characteristics.
Fig. 3 shows the structural block diagram that can be used to practice the exemplary computer device of embodiment of the present invention.It can manage It solves, client, agency and/or the server recorded in present disclosure can use calculating equipment shown in Fig. 3 to realize.Such as Shown in Fig. 3, calculating equipment may include: CPU (central processing unit) 401, RAM (random access memory) 402, ROM (read-only Memory) 403, system bus 404, hard disk controller 405, keyboard controller 406, serial interface controller 407, parallel interface Controller 408, display controller 409, hard disk 410, keyboard 411, serial peripheral equipment 412, concurrent peripheral equipment 413 and aobvious Show device 414.In these components, what is coupled with system bus 404 has CPU 401, RAM 402, ROM403, hard disk controller 405, keyboard controller 406, serial interface controller 407, parallel interface controller 408 and display controller 409.Hard disk 410 couple with hard disk controller 405, and keyboard 411 is coupled with keyboard controller 406, serial peripheral equipment 412 and serial line interface control Device 407 processed couples, and concurrent peripheral equipment 413 is coupled with parallel interface controller 408, and display 414 and display control Device 409 couples.
Several embodiments of the invention are described by way of example above.Above-mentioned different masses, operation with And at least part of technology can be performed, by using hardware, processor executes firmware instructions, and processor executes software and refers to It enables, or and any combination thereof.When being executed using the processor for executing firmware and software instruction, software or firmware instructions can To be stored in any computer-readable storage, such as disk, CD perhaps other storage mediums in a RAM or ROM Or flash memory, processor, hard disk, CD, disk etc..Similarly, software and firmware instructions can be transferred to use Family perhaps system by any known perhaps desired transmission mode include for example, computer readable diskette or other just It takes formula computer storage system or passes through telecommunication media.Telecommunication media typically specifically talks about computer-readable instruction, data knot Structure, program module or other data such as carrier wave or other transmission mechanisms in modulated message signal.By example, It not limits, communication media includes wired medium such as cable network or single line connection and wireless medium, such as sound, nothing Line frequency, infrared and other wireless mediums.To which software and firmware instructions can be transferred to user or system, pass through Communication channel, such as telephone wire, DSL line, cable TV line, fiber optic cable, wireless channel, internet, etc. is (by portable Storage medium provides such software, is counted as identical or interchangeable).Software or firmware instructions may include And its readable instruction causes processor to execute different movements when being executed by a processor.
It should be noted that embodiments of the present invention can be realized by the combination of software, hardware or software and hardware. Hardware components can use special logic to realize;Software section can store in memory, by instruction execution system appropriate System, such as microprocessor or special designs hardware execute.It will be understood by those skilled in the art that above-mentioned method With system and computer executable instructions can be used and/or be included in the processor control code realize, such as such as Disk, the mounting medium of CD or DVD-ROM, the programmable memory of such as read-only memory (firmware) or such as optics or Such code is provided in the data medium of electrical signal carrier.The equipment and its module of present embodiment can be by such as surpassing The semiconductor or such as field-programmable gate array of large scale integrated circuit or gate array, logic chip, transistor etc. The hardware circuit realization of the programmable hardware device of column, programmable logic device etc., can also be with by various types of processors The software realization of execution can also be realized by the combination such as firmware of above-mentioned hardware circuit and software.
The communication network referred in specification may include disparate networks, including but not limited to local area network (" LAN "), wide area Net (" WAN "), network (for example, internet) and ad-hoc network (for example, ad hoc peer-to-peer network) based on IP agreement.
In addition, although describing the operation of the method for the present invention in the accompanying drawings with particular order, this do not require that or Hint must execute these operations in this particular order, or have to carry out shown in whole operation be just able to achieve it is desired As a result.On the contrary, step described in flow chart can change the sequence of execution.It is additional or it is alternatively possible to omit certain steps Suddenly, multiple steps are merged into a step, or a step is decomposed into multiple steps.
Although detailed description of the preferred embodimentsthe present invention has been described by reference to several, it should be appreciated that, the present invention is not limited to Disclosed specific embodiment.The present invention is directed to cover various modifications included in spirit and scope of the appended claims And equivalent arrangements.Scope of the following claims is to be accorded the broadest interpretation, to include all such modifications and equivalent knot Structure and function.

Claims (10)

1. a kind of dynamic adjustment star cluster Ad Hoc is by the method for interaction cycle, which is characterized in that the method includes walking as follows It is rapid:
Step 1: initialization routing interaction cycle is T after specified node bootingoriginal, and with ToriginalPeriodic broadcast routing point Group;
Step 2: the routing packets that specified node receives other nodes establish the local routing table comprising network whole nodal information;
Step 3: specified node periodic test local routing table, if do not increased in sufficiently long time internal routing table entry Or reduce, then adjusting routing interaction cycle is Tsteady, and press periodic broadcasting routing packets adjusted;
It is T that routing interaction cycle is adjusted if the variation for detecting routing entryoriginal, and press periodic broadcasting road adjusted By being grouped.
2. dynamic adjustment star cluster Ad Hoc according to claim 1 is by the method for interaction cycle, it is characterised in that: in step In rapid 2, the routing packets that specified node receives other nodes establish the local routing table comprising network whole nodal information and include: After the node that synchronizing network is established or newly networked enters synchronous regime, node is just with ToriginalPeriodic broadcast routing point Group, the node for receiving routing packets are added to corresponding routing iinformation in local routing table, complete the update to local routing table, Then with cycle ToriginalBroadcast includes the routing packets of new routing table, each periodic broadcast grouping of node, final net Each node in network establishes the routing table comprising overall network topology.
3. dynamic adjustment star cluster Ad Hoc according to claim 1 is by the method for interaction cycle, it is characterised in that: in step In rapid 3, if do not increased or decreased in sufficiently long time internal routing table entry, adjusting routing interaction cycle is Tsteady It include: that routing interaction cycle is just adjusted to T when continuous n times check that local routing table does not have routing entry variationsteady, it Posterior nodal point is with TsteadyFor periodic broadcasting routing update grouping.
4. dynamic adjustment star cluster Ad Hoc according to claim 1 is by the method for interaction cycle, it is characterised in that: N= 3。
5. dynamic adjustment star cluster Ad Hoc according to claim 1 is by the method for interaction cycle, it is characterised in that: interaction Period modulation is Tsteady=M*Toriginal, wherein M=5.
6. a kind of dynamic adjustment star cluster Ad Hoc is by the system of interaction cycle, characterized by comprising:
First module is T for initialization routing interaction cycle after specifying node to be switched onoriginal, and with ToriginalIt is periodically wide Broadcast routing packets;
Second module locally includes network whole nodal information for specifying node to receive the routing packets foundation of other nodes Routing table;
Third module, for specifying node periodic test local routing table, if in sufficiently long time internal routing table entry It does not increase or decrease, then adjusting routing interaction cycle is Tsteady, and press periodic broadcasting routing packets adjusted;
It is T that routing interaction cycle is adjusted if the variation for detecting routing entryoriginal, and press periodic broadcasting road adjusted By being grouped.
7. dynamic according to claim 6 adjustment star cluster Ad Hoc is by the system of interaction cycle, it is characterised in that: the In two modules, the routing packets that specified node receives other nodes establish the local routing table packet comprising network whole nodal information It includes:: after the node that synchronizing network is established or newly networked enters synchronous regime, node is just with ToriginalPeriodic broadcast routing Grouping, the node for receiving routing packets are added to corresponding routing iinformation in local routing table, complete to local routing table more Newly, then with cycle ToriginalBroadcast includes the routing packets of new routing table, each periodic broadcast grouping of node, finally Each node in network establishes the routing table comprising overall network topology.
8. dynamic according to claim 6 adjustment star cluster Ad Hoc is by the system of interaction cycle, it is characterised in that: the In three modules, if do not increased or decreased in sufficiently long time internal routing table entry, adjusting routing interaction cycle is TsteadyIt include: just to be adjusted to routing interaction cycle when continuous n times check that local routing table does not have routing entry variation Tsteady, posterior nodal point with TsteadyFor periodic broadcasting routing update grouping.
9. dynamic adjustment star cluster Ad Hoc according to claim 8 is by the system of interaction cycle, it is characterised in that: N= 3。
10. dynamic adjustment star cluster Ad Hoc according to claim 8 is by the system of interaction cycle, it is characterised in that: hand over Mutual period modulation is Tsteady=M*Toriginal, wherein M=5.
CN201811543804.0A 2018-12-17 2018-12-17 Method and system for dynamically adjusting route interaction period of cluster ad hoc network Active CN109450800B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811543804.0A CN109450800B (en) 2018-12-17 2018-12-17 Method and system for dynamically adjusting route interaction period of cluster ad hoc network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811543804.0A CN109450800B (en) 2018-12-17 2018-12-17 Method and system for dynamically adjusting route interaction period of cluster ad hoc network

Publications (2)

Publication Number Publication Date
CN109450800A true CN109450800A (en) 2019-03-08
CN109450800B CN109450800B (en) 2021-12-07

Family

ID=65559997

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811543804.0A Active CN109450800B (en) 2018-12-17 2018-12-17 Method and system for dynamically adjusting route interaction period of cluster ad hoc network

Country Status (1)

Country Link
CN (1) CN109450800B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109951887A (en) * 2019-04-04 2019-06-28 苏州博联科技有限公司 The dynamic adjusting method of wireless sensor network topology update cycle
CN113301511A (en) * 2021-07-26 2021-08-24 广州慧睿思通科技股份有限公司 Node joining method, interphone, system and storage medium
CN114615216A (en) * 2022-03-11 2022-06-10 深圳市风云实业有限公司 Routing table dynamic adjustment method based on switching chip

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101330298A (en) * 2007-08-21 2008-12-24 刘西钉 Method for processing inertness of frequency-hopping FHSS wireless network facing to multi-interference circumstance application
CN101710866A (en) * 2009-12-01 2010-05-19 北京邮电大学 Method for selecting and setting super node of network
US20100222089A1 (en) * 2009-02-09 2010-09-02 Nick Russell Method and apparatus for message delivery
CN102547899A (en) * 2011-12-19 2012-07-04 中国科学院上海微系统与信息技术研究所 Self-adapting routing selection method applied to wireless sensing network
CN102857897A (en) * 2011-07-01 2013-01-02 华为终端有限公司 Method, device and system for managing MTC (machine type communication) devices
CN104426776A (en) * 2013-08-26 2015-03-18 西北工业技术研究院 Routing method of air-to-ground large-scale self-organizing network
CN104618945A (en) * 2015-01-06 2015-05-13 刘乃安 Link quality updating based route failure recovery method in wireless local area network (WLAN)
WO2017198007A1 (en) * 2016-05-17 2017-11-23 华为技术有限公司 Method and apparatus for determining routing policy
CN107454647A (en) * 2016-05-31 2017-12-08 北京信威通信技术股份有限公司 The sending method and device of periodicity routing iinformation

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101330298A (en) * 2007-08-21 2008-12-24 刘西钉 Method for processing inertness of frequency-hopping FHSS wireless network facing to multi-interference circumstance application
US20100222089A1 (en) * 2009-02-09 2010-09-02 Nick Russell Method and apparatus for message delivery
CN101710866A (en) * 2009-12-01 2010-05-19 北京邮电大学 Method for selecting and setting super node of network
CN102857897A (en) * 2011-07-01 2013-01-02 华为终端有限公司 Method, device and system for managing MTC (machine type communication) devices
CN102547899A (en) * 2011-12-19 2012-07-04 中国科学院上海微系统与信息技术研究所 Self-adapting routing selection method applied to wireless sensing network
CN104426776A (en) * 2013-08-26 2015-03-18 西北工业技术研究院 Routing method of air-to-ground large-scale self-organizing network
CN104618945A (en) * 2015-01-06 2015-05-13 刘乃安 Link quality updating based route failure recovery method in wireless local area network (WLAN)
WO2017198007A1 (en) * 2016-05-17 2017-11-23 华为技术有限公司 Method and apparatus for determining routing policy
CN107454647A (en) * 2016-05-31 2017-12-08 北京信威通信技术股份有限公司 The sending method and device of periodicity routing iinformation

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
JANG-PING SHEU等: ""Power-aware routing for energy conserving and balance in ad hoc networks"", 《IEEE》 *
左研: ""自集能传感网中路由环路避免机制研究"", 《中国优秀博硕士学位论文全文数据库(硕士)信息科技辑 I136-103》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109951887A (en) * 2019-04-04 2019-06-28 苏州博联科技有限公司 The dynamic adjusting method of wireless sensor network topology update cycle
CN113301511A (en) * 2021-07-26 2021-08-24 广州慧睿思通科技股份有限公司 Node joining method, interphone, system and storage medium
WO2023005128A1 (en) * 2021-07-26 2023-02-02 广州慧睿思通科技股份有限公司 Node adding method, walkie talkie, system, and storage medium
CN114615216A (en) * 2022-03-11 2022-06-10 深圳市风云实业有限公司 Routing table dynamic adjustment method based on switching chip
CN114615216B (en) * 2022-03-11 2023-07-21 深圳市风云实业有限公司 Routing table dynamic adjustment method based on switching chip

Also Published As

Publication number Publication date
CN109450800B (en) 2021-12-07

Similar Documents

Publication Publication Date Title
Mann et al. Energy-efficient hierarchical routing for wireless sensor networks: a swarm intelligence approach
US10581932B2 (en) Network-based dynamic data management
Qureshi et al. A distributed software defined networking model to improve the scalability and quality of services for flexible green energy internet for smart grid systems
Ahmadi et al. An efficient routing algorithm to preserve k-coverage in wireless sensor networks
AU2018374839B2 (en) Limiting forwarding of multicast communications
Frank et al. Algorithms for generic role assignment in wireless sensor networks
CN109450800A (en) A kind of dynamic adjustment star cluster Ad Hoc by interaction cycle method and system
US11290295B2 (en) Multi-network operation with member node for multicast groups
US10419231B2 (en) Multi-network operation for multicast groups
US20130208583A1 (en) Avoiding Broken Links in Smart Meter Networks for Loop-Free Routing of Packets
JP2018523442A (en) Software defined topology for user plane (SDT)
CN103023928A (en) P2P (peer-to-peer) node matching system and method
Nakamura et al. A reactive role assignment for data routing in event-based wireless sensor networks
He et al. PUAR: Performance and usage aware routing algorithm for long and linear wireless sensor networks
WO2021159314A1 (en) Service processing method, device and system
WO2018175781A1 (en) System and method for mesh network streaming
Staglianò et al. D-MQTT: design and implementation of a pub/sub broker for distributed environments
JPWO2014057709A1 (en) Data distribution system, distribution device, terminal device, and data distribution method
Dimitriou et al. Sensenet: a wireless sensor network testbed
Dinh et al. Enabling large-scale federated learning over wireless edge networks
CN102845042A (en) System and method for aggregating bandwidth of multiple active physical interfaces on application layer
CN103068000B (en) Based on the self-organizing network method and system of moonlet
Shih et al. Data alignment for multiple temporal data streams without synchronized clocks on iot fusion gateway
Prajapati et al. A theoretical aspect on fault-tolerant data dissemination in iot enabled systems
Raj et al. Routing protocol for low power and lossy network using energy efficient priority based routing

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
GR01 Patent grant
GR01 Patent grant