CN105375974A - Low cost dynamic routing method for mobile satellite networks - Google Patents
Low cost dynamic routing method for mobile satellite networks Download PDFInfo
- Publication number
- CN105375974A CN105375974A CN201510667832.3A CN201510667832A CN105375974A CN 105375974 A CN105375974 A CN 105375974A CN 201510667832 A CN201510667832 A CN 201510667832A CN 105375974 A CN105375974 A CN 105375974A
- Authority
- CN
- China
- Prior art keywords
- network
- satellite network
- link
- change
- snapshot
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/18578—Satellite systems for providing broadband data service to individual earth stations
- H04B7/18584—Arrangements for data networking, i.e. for data packet routing, for congestion control
-
- 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/14—Routing performance; Theoretical aspects
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computing Systems (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- Aviation & Aerospace Engineering (AREA)
- General Physics & Mathematics (AREA)
- Radio Relay Systems (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a low cost dynamic routing method for mobile satellite networks. The method comprises steps of: S1, computing link connection relations of all snapshots in advance according to an operating law of a satellite network in order to obtain the link state update increment of each snapshot; S2, starting a protocol static portion to perform treatment when a predictable change is generated in the satellite network; S3, when a unpredictable change is generated in the satellite network, starting a protocol dynamic portion to detect a node and a link where the unpredictable change is generated, releasing the found node and the found link to all nodes in the satellite network, and enabling all nodes in the satellite network to update link state databases and compute a routing table. The low cost dynamic routing method has advantages of reducing system overhead, increasing satellite link utilization rate, and improving satellite network stability.
Description
Technical field
The present invention is mainly concerned with mobile satellite network field, refers in particular to a kind of low expense dynamic routing method towards mobile satellite network, and namely a kind of being used for processes the method for routing predicting change and non-precognition variation relation.
Background technology
Current, satellite network development is very fast, and every technology is more and more perfect, thus is well applied in daily life.Satellite network is widely used in the fields such as navigator fix, weather forecast, the condition of a disaster early warning, earth observation, resource exploration, communication broadcast, space research, Military Application, becomes the developing important component part of modern network.
Satellite network and ground network also exist much difference, for these difference, people are improving ground Routing Protocol or on the basis of theoretical research and innovation and experiment simulation, work out the Routing Protocol of many applicable satellite networks, make its can efficiently, stable, reliably run.Obtain the difference of routing iinformation mode according to node, satellite network can be divided into two kinds: static routing and dynamic routing.
Static routing operating mechanism is the predictability according to satellite motion, the network cycle of satellite network is divided into the timeslice that limited shorter, and thinks that the topology of network is indeclinable in each timeslice.The advantage of this routing mechanism is that overhead is little, the algorithmic statement time is short, efficiency is high.Shortcoming is that static routing itself cannot accomplish real-time update, can only accomplish to regulate within the specific limits.
Dynamic routing operating mechanism can be made adjustment in real time in change environmentally, and this adjustment realizes by analyzing the routing updates message received, to increase overhead for cost.The Typical Representative of dynamic algorithm is Shortest path routing.Shortest path first is divided into distance vector algorithms and link-state algorithm two class substantially.
Distance vector algorithms shortcoming is that overhead is large, restrains slower.In satellite network, change in topology is regular following, and can predict, if adopt distance vector algorithms, the rule of satellite network change in topology and predictability will be left in the basket, and cause larger overhead.
Link-state algorithm shortcoming is mainly manifested in two aspects: first, and link-state algorithm requires that in network, each node, periodically to the whole network broadcasting link state data packets (Link-StatePacket, LSP), causes a large amount of system transmission bandwidth expenses; Secondly, link-state algorithm requires that node preserves the topological network figure of the whole network, because satellite network change in topology is frequent, causes topology status figure to need to constantly update, thus the computing cost of network node is increased greatly.
In sum, the technical problem that above-mentioned traditional approach exists is summarized as follows:
If the change that 1, static routing is used in all generations is in the satellite network of precognition; then network can realize Fast Convergent; the network overhead simultaneously produced is also very little; but, often there will be various abnormal conditions because satellite runs in space, cause the route that calculates in advance and network state not to match; now; static routing can not play its advantage, and network needs to recalculate route, and just can make can proper communication between satellite.Static routing cannot accomplish real-time update for non-precognition change, can only accomplish to regulate within the specific limits, therefore, when network failure, the disconnection causing a large amount of network to connect, overall performance is significantly declined, even occurs whole network paralysis.
2, dynamic routing has very strong flexibility when tackling various change in network, can change environmentally make adjustment in real time, but this adjustment realizes by analyzing the routing updates message received, to increase overhead for cost.Precognition change and the change of non-precognition are not distinguished in dynamic routing, make routing convergence each time all spend a large amount of time, considerably increase the expense of system, this expense is for the satellite node of resource-constrained, be very large waste, bring great challenge to the design of satellite simultaneously.
Summary of the invention
The technical problem to be solved in the present invention is just: the technical problem existed for prior art, the invention provides a kind of low expense dynamic routing method towards mobile satellite network that can reduce overhead, improve satellite link utilance, improve satellite network stable.
For solving the problems of the technologies described above, the present invention by the following technical solutions:
Towards a low expense dynamic routing method for mobile satellite network, the steps include:
S1: according to the moving law of satellite network, precalculate the link annexation of all snapshots, obtain the link state update increment of each snapshot;
S2: when there is precognition change in satellite network, enabling agreement static part and processing;
S3: when there is the change of non-precognition in satellite network, enables non-precognition change occurs protocol dynamic part detection node and link, finds that all nodes of backward the whole network are issued, each node updates LSD of the whole network, and calculate routing table.
As a further improvement on the present invention: in above-mentioned steps, if the change of non-precognition does not occur the operation in the whole cycle, snapshot switches according to Snapshot time point, achieves the true(-)running of whole network.
As a further improvement on the present invention: before above-mentioned steps starts, also comprise pretreatment stage, first parameters, acquisition initial data, and configure satellite node, IP address, interface message; Then topology information, link control message, link state update increment is generated.
As a further improvement on the present invention: in above-mentioned steps S1, calculate the link annexation of all snapshots in advance, a rear snapshot is compared with the link annexation of last snapshot again, to obtain increase part in its link and deletion, thus obtains link state update increment.
As a further improvement on the present invention: in above-mentioned steps S2, enabling clock to calculate snapshot running time, when arriving snapshot switching point, calling the link state update increment of next snapshot.
As a further improvement on the present invention: described method is using ground station as processing center.
As a further improvement on the present invention: in described step S3, if when satellite network there occurs the change of non-foreseeability in running, namely topology there occurs unexpected change, will cause current routing table cannot true(-)running in a network, the change that detection occurs by the node now in network, the node detecting change will send relevant information to its all neighbours, and this information will flood at the whole network afterwards.
Compared with prior art, the invention has the advantages that:
1, the low expense dynamic routing method towards mobile satellite network of the present invention, can reduce the communication overhead of system, storage overhead, improves satellite link utilance, shortens network convergence time, thus makes satellite network more efficient, stable, reliable.
2, the low expense dynamic routing method towards mobile satellite network of the present invention, occurred non-precognition change can not be successfully managed for static routing to improve, use for reference the method for dynamic routing processing variation, introduce dynamic process part, the ability of agreement the is possessed various change of process.The present invention can realize the Fast Convergent of network, and it is also less that system produces expense, avoids because network failure causes overall performance to decline, or even paralysis, thus enhances network robustness.
3, the low expense dynamic routing method towards mobile satellite network of the present invention, has distinguished precognition change and the change of non-precognition.Precognition change can be known in advance according to the moving law of satellite, but not precognition change cannot extract precognition, it is at any time may because a certain cause specific occurs in satellite transit process, if two kinds of changes are not treated with a certain discrimination, many Given information effects will be caused to play, thus cause the significant wastage of valuable satellite resource.For this situation, by the advantage of Integrated Static route and dynamic routing, taking to predict change uses static routing and the change of non-precognition to use the mode of dynamic routing process, makes to have stronger adaptability and flexibility, thus drastically increases the adaptability to changes of system.
Accompanying drawing explanation
Fig. 1 is the schematic flow sheet of the inventive method in embody rule example.
Fig. 2 is the topological structure schematic diagram used after the inventive method in a particular application.
Embodiment
Below with reference to Figure of description and specific embodiment, the present invention is described in further details.
As shown in Figure 1, low expense dynamic routing method towards mobile satellite network of the present invention, can be applied to the low expense dynamic routing protocol (Lowcostdynamicroutingprotocolformobilesatellitenetworks) towards mobile satellite network, its concrete steps are:
S1: according to the moving law of satellite network, precalculate the link annexation of all snapshots, obtain the link state update increment of each snapshot; The moving law of described satellite network just can be known according to practical application in advance, and link annexation is also calculate in advance.
S2: when there is precognition change in satellite network, enabling agreement static part and processing.That is, if there is topology expection change, then the preset route of recent snapshot is called;
S3: when there is the change of non-precognition in satellite network, enables non-precognition change occurs protocol dynamic part detection node and link, finds that all nodes of backward the whole network are issued, each node updates LSD of the whole network, and calculate routing table.Namely, if when satellite network there occurs the change of non-foreseeability in running (topology there occurs unexpected change), will cause current routing table cannot true(-)running in a network, the change that detection occurs by the node now in network, the node detecting change will send relevant information to its all neighbours, and this information will flood at the whole network afterwards.In this process, by Link State declaration (LinkStateAdvertisement, LSA) send to all neighbor nodes, the change just received is forwarded after receiving the node updates LSD of LSA, circulation like this, until the LSD (LinkStateDataBase, LSDB) of all nodes reaches consistent in whole network.
In above-mentioned steps, if the change of non-precognition does not occur the operation in the whole cycle, snapshot will switch according to Snapshot time point, achieve the true(-)running of whole network.
Before above-mentioned steps starts, also comprise pretreatment stage, first parameters, acquisition initial data, and configure satellite node, IP address, interface message etc.; Then topology information, link control message, link state update increment is generated.
In above-mentioned steps S1, need the link annexation calculating all snapshots in advance, a rear snapshot is compared with the link annexation of last snapshot again, to obtain increase part in its link and deletion, thus obtain link state update increment.
In above-mentioned steps S2, needing to enable clock to calculate snapshot running time, when arriving snapshot switching point, calling the link state update increment of next snapshot.
In embody rule example, method of the present invention is mainly using ground station as processing center, and this ground station requires to possess very strong computing capability, to realize adaptability to changes fast.The each node requirements of satellite network has certain computing capability.
In an embody rule example, after adopting method of the present invention, the present invention is at LSR(LinkStateRouting) basis increases LSA preset module and change in topology processing module, thus achieve the differentiated treatment that precognition change and non-precognition are changed.
First the present invention uses the network operation of STK analog satellite, generate the satellite transit data needed for experiment, configure satellite node numbering, Route-id, interface IP address etc. simultaneously, generate all snapshots, Core link control documents and link state update increment that satellite network runs, wherein link state update increment comprises the more new increment of Router-LSA and Network-LSA.
Start Core platform and LCDRP agreement, the information generated before utilization controls Core scene.
LCDRP agreement internal event module starts timer, after arriving the precognition transformation period point of snapshot, control LSA preset module switches according to the order of snapshot the link state update increment precomputed, and obtains corresponding LSDB, calls SPF algoritic module generating snapshot routing table;
If there occurs the change of non-precognition, network interface management module detects discovery in time, and change in topology processing module catches the variable condition of network interface administration module in time, rapid renewal notes abnormalities the LSDB of node of change, simultaneously by LSA message repeating to other nodes on network, if receive the message of other nodes on automatic network, then also correspondingly revise LSDB, and the message received is forwarded to neighbours, finally reach each node LSDB in network consistent, thus achieve the convergence again of network.
Below be only the preferred embodiment of the present invention, protection scope of the present invention be not only confined to above-described embodiment, all technical schemes belonged under thinking of the present invention all belong to protection scope of the present invention.It should be pointed out that for those skilled in the art, some improvements and modifications without departing from the principles of the present invention, should be considered as protection scope of the present invention.
Claims (7)
1., towards a low expense dynamic routing method for mobile satellite network, it is characterized in that, step is:
S1: according to the moving law of satellite network, precalculate the link annexation of all snapshots, obtain the link state update increment of each snapshot;
S2: when there is precognition change in satellite network, enabling agreement static part and processing;
S3: when there is the change of non-precognition in satellite network, enables non-precognition change occurs protocol dynamic part detection node and link, finds that all nodes of backward the whole network are issued, each node updates LSD of the whole network, and calculate routing table.
2. the low expense dynamic routing method towards mobile satellite network according to claim 1, it is characterized in that, in above-mentioned steps, if the change of non-precognition does not occur the operation in the whole cycle, snapshot switches according to Snapshot time point, achieves the true(-)running of whole network.
3. the low expense dynamic routing method towards mobile satellite network according to claim 1, it is characterized in that, before above-mentioned steps starts, also comprise pretreatment stage, first parameters, acquisition initial data, and configure satellite node, IP address, interface message; Then topology information, link control message, link state update increment is generated.
4. according to the low expense dynamic routing method towards mobile satellite network in claims 1 to 3 described in any one, it is characterized in that, in above-mentioned steps S1, calculate the link annexation of all snapshots in advance, a rear snapshot is compared with the link annexation of last snapshot again, to obtain increase part in its link and deletion, thus obtain link state update increment.
5. according to the low expense dynamic routing method towards mobile satellite network in claims 1 to 3 described in any one, it is characterized in that, in above-mentioned steps S2, enable clock to calculate snapshot running time, when arriving snapshot switching point, call the link state update increment of next snapshot.
6., according to the low expense dynamic routing method towards mobile satellite network in claims 1 to 3 described in any one, it is characterized in that, described method is using ground station as processing center.
7. according to the low expense dynamic routing method towards mobile satellite network in claims 1 to 3 described in any one, it is characterized in that, in described step S3, if when satellite network there occurs the change of non-foreseeability in running, namely topology there occurs unexpected change, will cause current routing table cannot true(-)running in a network, the change that detection occurs by the node now in network, the node detecting change will send relevant information to its all neighbours, and this information will flood at the whole network afterwards.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510667832.3A CN105375974B (en) | 2015-10-16 | 2015-10-16 | Low overhead dynamic routing method towards mobile satellite network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510667832.3A CN105375974B (en) | 2015-10-16 | 2015-10-16 | Low overhead dynamic routing method towards mobile satellite network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105375974A true CN105375974A (en) | 2016-03-02 |
| CN105375974B CN105375974B (en) | 2019-03-01 |
Family
ID=55377817
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510667832.3A Active CN105375974B (en) | 2015-10-16 | 2015-10-16 | Low overhead dynamic routing method towards mobile satellite network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105375974B (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106357476A (en) * | 2016-09-20 | 2017-01-25 | 北京邮电大学 | Satellite network packet forwarding method and device |
| CN107276663A (en) * | 2017-07-31 | 2017-10-20 | 佛山市顺德区德雅军民融合创新研究院 | A kind of satellite network snapshot routing optimization method |
| CN107835128A (en) * | 2017-09-29 | 2018-03-23 | 北京空间飞行器总体设计部 | It is a kind of that OSPF method for routing is strengthened based on the spatial network for determining Link State |
| CN108881029A (en) * | 2018-06-07 | 2018-11-23 | 北京邮电大学 | The low-track satellite network addressing based on star decoupled and method for routing and system |
| CN109768928A (en) * | 2019-03-29 | 2019-05-17 | 中山大学 | Source routing method based on agreement unaware forwarding and virtual topology |
| CN111416657A (en) * | 2020-03-19 | 2020-07-14 | 西安电子科技大学 | Satellite network route updating maintenance system and maintenance method |
| CN111585638A (en) * | 2020-04-22 | 2020-08-25 | 浙江时空道宇科技有限公司 | Inter-satellite network communication method, communication satellite and system |
| CN112272142A (en) * | 2020-09-24 | 2021-01-26 | 中国空间技术研究院 | Improved OSPF routing method and device of satellite constellation network |
| CN114422418A (en) * | 2021-11-16 | 2022-04-29 | 网络通信与安全紫金山实验室 | SDN-based satellite network route switching method and device and storage medium |
| CN114978275A (en) * | 2022-04-07 | 2022-08-30 | 航天行云科技有限公司 | Low-orbit satellite route processing method and device for inter-satellite rabdosis interruption and satellite |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6108308A (en) * | 1996-09-17 | 2000-08-22 | International Business Machines Corporation | System and method for dynamic video routing |
| US20080151811A1 (en) * | 2006-12-20 | 2008-06-26 | Hersham El-Damhougy | Interplanetary communications network, interplanetary communications network backbone and method of managing interplanetary communications network |
| CN103905306A (en) * | 2014-04-02 | 2014-07-02 | 中国人民解放军西安通信学院 | Route exchange method suitable for GEO/LEO double layered constellation network |
| CN104506231A (en) * | 2015-01-19 | 2015-04-08 | 中国人民解放军国防科学技术大学 | Link redistribution method for polar orbit satellite network snapshots |
| CN104902515A (en) * | 2015-06-08 | 2015-09-09 | 西安电子科技大学 | Load aware-based multi-layer satellite network routing method |
-
2015
- 2015-10-16 CN CN201510667832.3A patent/CN105375974B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6108308A (en) * | 1996-09-17 | 2000-08-22 | International Business Machines Corporation | System and method for dynamic video routing |
| US20080151811A1 (en) * | 2006-12-20 | 2008-06-26 | Hersham El-Damhougy | Interplanetary communications network, interplanetary communications network backbone and method of managing interplanetary communications network |
| CN103905306A (en) * | 2014-04-02 | 2014-07-02 | 中国人民解放军西安通信学院 | Route exchange method suitable for GEO/LEO double layered constellation network |
| CN104506231A (en) * | 2015-01-19 | 2015-04-08 | 中国人民解放军国防科学技术大学 | Link redistribution method for polar orbit satellite network snapshots |
| CN104902515A (en) * | 2015-06-08 | 2015-09-09 | 西安电子科技大学 | Load aware-based multi-layer satellite network routing method |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106357476A (en) * | 2016-09-20 | 2017-01-25 | 北京邮电大学 | Satellite network packet forwarding method and device |
| CN106357476B (en) * | 2016-09-20 | 2019-04-19 | 北京邮电大学 | A kind of data packet forwarding method and device of satellite network |
| CN107276663B (en) * | 2017-07-31 | 2020-11-20 | 佛山市顺德区德雅军民融合创新研究院 | Satellite network snapshot route optimization method |
| CN107276663A (en) * | 2017-07-31 | 2017-10-20 | 佛山市顺德区德雅军民融合创新研究院 | A kind of satellite network snapshot routing optimization method |
| CN107835128A (en) * | 2017-09-29 | 2018-03-23 | 北京空间飞行器总体设计部 | It is a kind of that OSPF method for routing is strengthened based on the spatial network for determining Link State |
| CN108881029A (en) * | 2018-06-07 | 2018-11-23 | 北京邮电大学 | The low-track satellite network addressing based on star decoupled and method for routing and system |
| CN108881029B (en) * | 2018-06-07 | 2020-10-16 | 北京邮电大学 | Low-orbit satellite network addressing and routing method and system based on satellite-ground decoupling |
| CN109768928A (en) * | 2019-03-29 | 2019-05-17 | 中山大学 | Source routing method based on agreement unaware forwarding and virtual topology |
| CN111416657A (en) * | 2020-03-19 | 2020-07-14 | 西安电子科技大学 | Satellite network route updating maintenance system and maintenance method |
| CN111585638A (en) * | 2020-04-22 | 2020-08-25 | 浙江时空道宇科技有限公司 | Inter-satellite network communication method, communication satellite and system |
| CN111585638B (en) * | 2020-04-22 | 2022-04-15 | 浙江时空道宇科技有限公司 | Inter-satellite network communication method, communication satellite and system |
| CN112272142A (en) * | 2020-09-24 | 2021-01-26 | 中国空间技术研究院 | Improved OSPF routing method and device of satellite constellation network |
| CN114422418A (en) * | 2021-11-16 | 2022-04-29 | 网络通信与安全紫金山实验室 | SDN-based satellite network route switching method and device and storage medium |
| CN114422418B (en) * | 2021-11-16 | 2024-04-26 | 网络通信与安全紫金山实验室 | SDN-based satellite network route switching method, device and storage medium |
| CN114978275A (en) * | 2022-04-07 | 2022-08-30 | 航天行云科技有限公司 | Low-orbit satellite route processing method and device for inter-satellite rabdosis interruption and satellite |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105375974B (en) | 2019-03-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105375974A (en) | Low cost dynamic routing method for mobile satellite networks | |
| Baumann et al. | Parsimonious flooding in dynamic graphs | |
| CN106209615B (en) | A kind of Dynamic Route Control method and system calculating forward-path based on SPFA algorithm | |
| EP2951980A1 (en) | Accelerated mac address resolution for ipv6 traffic with is-is protocol | |
| CN104869057A (en) | OpeFlow switch graceful restart processing method, device and OpeFlow controller | |
| CN103200109B (en) | A kind of ospf neighbor relationship management method and equipment | |
| CN101572837B (en) | Method for updating route information for ASON batch path computation | |
| Oikonomou et al. | Scalable service migration in autonomic network environments | |
| EP3637688B1 (en) | Method and device for determining link state | |
| Perepelkin et al. | Fast rerouting algorithm in distributed computer networks based on subnet routing method | |
| Michail et al. | Causality, influence, and computation in possibly disconnected synchronous dynamic networks | |
| Nsaif et al. | RURT: A novel approach for removing the unnecessary redundant traffic in any HSR closed-loop network type | |
| CN101192956A (en) | A computing method for multicast tree of automatic switching optical network multicast service | |
| CN102594656B (en) | A kind of route iteration method and route exchange device | |
| CN104994464B (en) | Mobile social network data forwarding method based on hierarchical community structure | |
| CN108494595B (en) | High-efficiency new-generation big data network implementation method | |
| CN110912816A (en) | Link rerouting method, device and storage medium | |
| Dommety et al. | A route optimization algorithm and its application to mobile location management in ATM networks | |
| CN102438273B (en) | Method and relevant device for Internet protocol (IP) communication among cluster network elements as well as communication system | |
| CN109600431B (en) | Content increment transmission method facing mobile communication network and mobile communication system | |
| US20160105357A1 (en) | Method and network apparatus of establishing path | |
| Jin et al. | Prioritized data synchronization for disruption tolerant networks | |
| Young et al. | UCDS: Unifying connected dominating set with low message complexity, fault tolerance, and flexible dominating factor | |
| Homayounnejad et al. | AAA: Asynchronous Adaptive Algorithm to solve Max-Flow Problem in wireless sensor networks | |
| CN102790690A (en) | Distributed service network management method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |