CN102231896B - Load-balance-based satellite network on-demand routing method - Google Patents
Load-balance-based satellite network on-demand routing method Download PDFInfo
- Publication number
- CN102231896B CN102231896B CN 201110206215 CN201110206215A CN102231896B CN 102231896 B CN102231896 B CN 102231896B CN 201110206215 CN201110206215 CN 201110206215 CN 201110206215 A CN201110206215 A CN 201110206215A CN 102231896 B CN102231896 B CN 102231896B
- Authority
- CN
- China
- Prior art keywords
- node
- load
- rreq
- grouping
- satellite network
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The invention discloses a load-balance-based satellite network on-demand routing method, which mainly solve the problem of unbalanced traffic load in the conventional satellite network. The load-balance-based satellite network on-demand routing method comprises the following steps that: when a source node sends data, the minimum rectangular region of a routing request is limited according to orientations of the source node and a target node; the source node sends a routing request (RREQ) packet to an intermediate node in the minimum rectangular region; when receiving the RREQ packet for the first time, the intermediate node starts a node load judgment mechanism and selectively forwards the RREQ packet according to a judgment result; when the intermediate node forwards the RREQ packet, theRREQ packet is forwarded to a node with the consistent direction with the target node; the target node replies a routing response (RREP) packet to a route with the minimum load value from the received RREQ packet in a delayed response mode; and after receiving the RREP packet, the source node starts to send data so as to complete the route discovery process. Compared with a method employing the conventional routing protocol, the load-balance-based satellite network on-demand routing method has the advantages that: the accurate traffic load balance of the satellite network can be realized; andthe cost of a network route is reduced.
Description
Technical field
The invention belongs to communication technical field, relate to method for routing, can be used for solving in the procotol the unbalanced problem of flow load in the satellite network.
Background technology
Satellite communication network has wide coverage, is not subjected to the innate advantages such as geographical conditions restriction, is subject to people's attention in the process of Communication Development always.Satellite network is made of with the inter satellite link ISL that is connected satellite the satellite node of some.The satellite network that major part has an ISL all adopts pole orbit constellation as shown in Figure 1.Take the Iridium system as example, the satellite on two adjacent orbit faces of reverse seam both sides, every satellite is all kept 4 ISL, interconnects respectively with two neighbours' satellites on two the neighbours' satellites in front and back and the left and right sides adjacent orbit face on the orbital plane.Every satellite all determines by virtual coordinates (x, y) is unique, and wherein x and y represent that respectively satellite orbit sits label and satellite orbit internal coordinate number.
Because region and time zone difference, constellation running and earth rotation, satellite network carry the skewness weighing apparatus and have the flow load of time-varying characteristics.Single satellite both may cover underpopulated zone, such as zone, polar region and ocean, also may cover zone densely populated and that data volume is intensive, such as the main cities of developed country.The load imbalance meeting is so that some path occupancy is too high, cause congested and packet loss, therefore the routing algorithm that proposes should be able to support flow load balance to avoid occurring network congestion, perhaps can eliminate timely and effectively the congested adverse effect of bringing when appearance is congested.
At present more existing scholars have proposed various satellite network Load Balance Routing Algorithms.
Document (Hui Li, Xuemai Gu, Adaptive ATM Routing in Walker Delta Satellite Communication Networks, 1st International Symposium on Systems and Control in Aerospace and Astronautics, 2006, pp.368-373.) propose to be fit to connection-oriented Satellite ATM Network, the minimum routing policy that blocks of dynamic self-adapting.This agreement adopts the service area dividing mode that is fit to satellite constellation under the worldwide traffic statistical model, according to the flow load assessment of scenario offered load state of every link, select the optimal path of blocking probability minimum.This method is according to the periodicity of satellite and the certainty of locus, and the path between calculated in advance any time two satellite nodes is formulated to the routing table in this moment with these routing iinformations, in order to upgrading.The method can be carried out the comparison of whole path performance, realize global optimization, but this algorithm is based on pre-determined statistical model, for the high service traffics shortage adaptability of burst, this algorithm is only applicable to Walker delta constellation satellite network in addition, and is portable low.
Document (Yan He, Susanna Pelagatti, CRT:an Adaptive Routing Protocol for LEO Satellite Networks, Information and Communication Technologies, 2006.2nd, pp.2496-2501.) with a small amount of control information critic network load, dynamically adjust the path, balancing flow load in the whole network, avoid congestion.The simple control information of the method utilization is for network topology is set up a directed graph, with the congestion state of current constellation in the congested matrix description directed graph.Congested matrix periodically upgrades.Dynamically adjust the path according to congested matrix.In this algorithm, each network node state variation all will be broadcasted at the whole network, so the network control expense is larger, needs the information of collection too much, might in time reflect the network state of high speed dynamic change.
Document (Tarik Taleb, Daisuke Mashimo, Abbas Jamalipour, Kazuo Hashimoto, Yoshiaki Nemoto, and Nei Kato, ELB:An Explicit Load Balancing Routing Protocol for Multi-HopNGEO Satellite Constellations, IEEE Globecom 2006, pp 2776-2780) having proposed explicit Load Balance Routing Algorithms, is that a kind of explicitly is closing on the Routing Protocol that exchanges congestion condition information between the satellite.In this Routing Protocol, the transmission congestion condition of adjacent two satellite explicitlies exchange formation seizure condition information to represent that it is present.Represent that when the satellite queue occupancy surpasses predetermined threshold value this satellite is about to face congested, be avoid congestion and the packet loss brought thus, the satellite of high capacity initiatively requires it to close on satellite to reduce data retransmission speed.As response, close on satellite and reduce data transfer rates to being about to congested satellite, and seek other the alternative route that does not comprise this satellite, thereby guarantee the load balancing of localized network, avoid congestion occurs.This algorithm is easily realized, expense is low and can realize that partial load is balanced, but because threshold value is predefined, when the load state acute variation, therefore load condition when this predetermined threshold value can't guarantee the effecting reaction network implementation is difficult to realize accurate load balancing.
Summary of the invention
The object of the invention is to overcome the deficiency of above-mentioned prior art, propose a kind of satellite network routing method on demand based on load balancing, calculate route to utilize the real-time load condition of satellite network, reduce the network control expense, improve the load balancing accuracy.
The present invention is achieved in that
One. know-why
The present invention is at document (Tarik Taleb, Daisuke Mashimo, Abbas Jamalipour, Kazuo Hashimoto, Yoshiaki Nemoto, and Nei Kato, ELB:An Explicit Load Balancing Routing Protocol for Multi-Hop NGEO Satellite Constellations, IEEE Globecom 2006, pp 2776-2780) on the basis, introduces dynamic threshold and assist location concept, the route requests process is limited in the rectangular area, in route finding process, use dynamic threshold to reflect in real time the mean state of offered load, each intermediate node compares self load value with dynamic threshold, if self load value is greater than dynamic threshold, illustrate that then this intermediate node load is heavier, abandon the request grouping; Otherwise, illustrate that this intermediate node still has the load of surplus energy commitment external flux, then transmit this request grouping.When Forward-reques divides into groups, only will ask packet propagation to those inter satellite links consistent with the destination node direction, namely obtain directive guidance, thereby reduce the blindness of route discovery, intermediate node is not replied the route replies grouping simultaneously, to guarantee using all the time up-to-date load information in the routing process; Destination node selects relative underload path to reply the route replies grouping by the mode of delayed response from the several route requests groupings that receive, thereby has realized that under less network control expense precise load is balanced.
Two. performing step:
(1) when source node has data to send, start restriction route requests regional process, according to the virtual coordinates positional information of source node and destination node, limit the minimum rectangular area of route requests;
(2) source node sends route requests grouping RREQ to intermediate node in minimum rectangular area;
(3) intermediate node is received RREQ grouping, number judges whether to receive and should request divide into groups according to the broadcasting in the RREQ grouping, divides into groups if receive this RREQ, then abandons, otherwise changes step (4) over to;
(4) intermediate node starter node load decision mechanism compares the load value of node self and the dynamic threshold Γ of reflection network average load value, if greater than dynamic threshold Γ, this node load node of attaching most importance to then, abandon grouping, otherwise, normal Forward-reques grouping RREQ;
When (5) intermediate node is transmitted the RREQ grouping, by comparing the virtual coordinates of each node, determine guide path, give those satellites consistent with the destination node direction with the RREQ forwarding of packets, and return step (3);
(6) destination node selects the path of load value minimum to reply the RREP grouping to source node from the several RREQ groupings that receive by the mode of delayed response;
(7) after source node is received the RREP grouping of destination node answer, begin to send data, so far, route finding process finishes.
The present invention compares with existing routing protocol and has the following advantages:
1) the present invention adopts constraint route request region method, and route finding process is carried out in pre-determined localized area, has limited the broadcasting area of route requests grouping, thereby has reduced the network routing cost.
2) the present invention introduces intermediate node load decision mechanism, dynamic threshold reflects the mean value of offered load in real time, if the load of intermediate node is greater than dynamic threshold Γ, then this intermediate node just abandons this route requests grouping, has avoided further increasing the weight of of this node load; If the load of intermediate node is less than dynamic threshold Γ, then node is just accepted this route requests, has increased the traffic carrying capacity of node self.By this mechanism nodes roughly the same traffic carrying capacity is arranged, realized that satellite network flow precise load is balanced.
3) the present invention is in route requests forwarding of packets process, by comparing the virtual coordinates of each node, determine guide path, make present node only will ask forwarding of packets on those nodes consistent with the destination node direction, reduced the blindness of route requests forwarding of packets, reduce the required request transmitted in packets quantity of Route establishment, and then reduced the network routing cost.
Description of drawings
Fig. 1 is existing typical pole orbit constellation illustraton of model;
Fig. 2 is workflow diagram of the present invention;
Fig. 3 is the route requests area schematic among the present invention.
Embodiment
Suppose that the network model that adopts is the pole orbit constellation, source node and destination node location positioning, its implementation step is described below with reference to Fig. 2:
When source node has data to send, start restriction route requests regional process, according to the virtual coordinates positional information of source node and destination node, limit as follows the minimum rectangular area of route requests:
(1a) under the prerequisite that knows source node, destination node virtual coordinates position, suppose that the source node coordinate is (i, j), the destination node coordinate is (k, l), according to formula x
Min=min{i, k} calculates the minimum edge dividing value x on the x direction
Min, according to formula x
Max=max{i, k} calculates the maximum boundary value x on the x direction
Max
(1b) according to formula y
Min=min{j, l}-1 calculates the minimum edge dividing value y on the y direction
Min, according to formula y
Max=max{j, l}+1 calculates the maximum boundary value y on the y direction
Max
(1c) press boundary value x
Min, x
Max, y
MinAnd y
MaxDetermine that the rectangular area is the Minimum Area of route requests, such as Fig. 3, the reason of relaxing the restriction at the y coordinate direction among Fig. 3 is when the formation time delay is considered standard as link cost, shortest path may be in Minimal routing request zone, reduce this possibility, then take suitable loose region limits namely to relax the restriction at the y coordinate direction.
Step 2, source node send the RREQ grouping.
Source node searches whether there is the route table items that arrives destination node in routing table, if this route table items exists and effectively, then send data according to the path in the route table items; If corresponding route table items does not exist or route table items exists but expired, then source node starts route finding process, and namely source node sends route requests grouping RREQ to intermediate node in the determined minimum rectangular area of step 1.
Step 3, intermediate node are transmitted the RREQ grouping.
(3.1) intermediate node is received RREQ grouping, at first number judges whether to receive and should request divide into groups according to the broadcasting in the RREQ grouping; If receive the RREQ grouping with identical broadcasts number, illustrate and received this RREQ grouping, then abandon, otherwise, illustrate and do not receive that this RREQ divides into groups, and then changed (3.2) over to;
(3.2) intermediate node starter node load decision mechanism, the load of node self is compared with the dynamic threshold Γ that reflects network average load value, if greater than dynamic threshold Γ, this node load node of attaching most importance to is described, abandon grouping, otherwise illustrate and have the ability to process the flow business that arrives, normal Forward-reques grouping RREQ;
Dynamic threshold Γ passes through following formula calculative determination:
Wherein: n
iBe the neighbor node number of present node i, Q
iBe the flow load value of present node i, Q
jBe the flow load of the neighbor node j of present node i, L
AveThe path load information of carrying in the RREQ grouping;
Intermediate node and threshold ratio after, this subthreshold Γ is updated to the L of RREQ grouping
AveRear continuation is transmitted, and can dynamically reflect the average situation of offered load through the threshold value after processing like this;
When (3.3) intermediate node is transmitted the RREQ grouping, by comparing the virtual coordinates of each node, determine guide path: if destination node orbit coordinate number greater than present node orbit coordinate number, then present node is transmitted the RREQ grouping to orbit coordinate number greater than the next-hop node of present node orbit coordinate number; If destination node orbit coordinate number is less than present node orbit coordinate number, then present node is transmitted the RREQ grouping to orbit coordinate number less than the next-hop node of present node orbit coordinate number, and returns (3.1).
Step 4, destination node are replied the RREP grouping.
Destination node receives several RREQ groupings, when the route requests grouping RREQ that for the first time receives from source node, start timer and begin countdown, at the time-delay loitering phase, more several load values that divide into groups from the RREQ of same source node, when timer is kept to 0, immediately the RREP grouping is replied in the path of load value minimum.
Step 5, source node are received the RREP grouping.
Receive the RREP grouping of destination node transmission when source node after, begin to send data, so far, route finding process finishes.
More than describing only is example of the present invention; obviously for those skilled in the art; after having understood content of the present invention and principle; all may be in the situation that does not deviate from the principle of the invention, structure; carry out various corrections and change on form and the details, but these are based on the correction of inventive concept with change still within claim protection range of the present invention.
Claims (4)
1. the satellite network routing method on demand based on load balancing comprises the steps:
(1) when source node has data to send, start restriction route requests regional process, according to the virtual coordinates positional information of source node and destination node, limit the minimum rectangular area of route requests;
(2) source node sends route requests grouping RREQ to intermediate node in minimum rectangular area;
(3) intermediate node is received RREQ grouping, number judges whether to receive and should request divide into groups according to the broadcasting in the RREQ grouping, divides into groups if receive this RREQ, then abandons, otherwise changes step (4) over to;
(4) intermediate node starter node load decision mechanism compares the load value of node self and the dynamic threshold Γ of reflection network average load value, if greater than dynamic threshold Γ, this node load node of attaching most importance to then, abandon grouping, otherwise, normal Forward-reques grouping RREQ;
When (5) intermediate node is transmitted the RREQ grouping, by comparing the virtual coordinates of each node, determine guide path, give those satellites consistent with the destination node direction with the RREQ forwarding of packets, and return step (3);
The described relatively virtual coordinates of each node that passes through is determined guide path, is to determine according to the following rules:
If destination node orbit coordinate number is greater than present node orbit coordinate number, then present node is transmitted the RREQ grouping to orbit coordinate number greater than the next-hop node of present node orbit coordinate number;
If destination node orbit coordinate number is less than present node orbit coordinate number, then present node is transmitted the RREQ grouping to orbit coordinate number less than the next-hop node of present node orbit coordinate number;
(6) destination node selects the path of load value minimum to reply the RREP grouping to source node from the several RREQ groupings that receive by delayed response mechanism;
(7) after source node is received the RREP grouping of destination node answer, begin to send data, so far, route finding process finishes.
2. the satellite network routing method on demand based on load balancing according to claim 1, the minimum rectangular area of the described restriction route requests of step (1) wherein, carry out in accordance with the following steps:
(1a) under the prerequisite that knows source node, destination node virtual coordinates position, suppose that the source node coordinate is (i, j), the destination node coordinate is (k, l), according to formula x
Min=min{i, k} calculates the minimum edge dividing value x on the x direction
Min, according to formula x
Max=max{i, k} calculates the maximum boundary value x on the x direction
Max
(1b) according to formula y
Min=min{j, l}-1 calculates the minimum edge dividing value y on the y direction
Min, according to formula y
Max=max{j, l}+1 calculates the maximum boundary value y on the y direction
Max
(1c) use boundary value x
Min, x
Max, y
MinAnd y
MaxDetermine that the rectangular area is the Minimum Area of route requests.
3. the satellite network routing method on demand based on load balancing according to claim 1, the described dynamic threshold Γ of step (4) wherein, by following formula calculative determination:
Wherein: n
iBe the neighbor node number of present node i, Q
iBe the flow load value of present node i, Q
jBe the flow load of the neighbor node j of present node i, L
AveThe path load information of carrying in the RREQ grouping.
4. the satellite network routing method on demand based on load balancing according to claim 1, wherein the described destination node of step (6) selects the path of load value minimum to return the RREP grouping to source node by delayed response mechanism, when the route requests of for the first time receiving from source node, start timer and begin countdown, at the time-delay loitering phase, more several load values that divide into groups from the RREQ of same source node, when timer is kept to 0, immediately the RREP grouping is replied in the path of load value minimum.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110206215 CN102231896B (en) | 2011-07-21 | 2011-07-21 | Load-balance-based satellite network on-demand routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110206215 CN102231896B (en) | 2011-07-21 | 2011-07-21 | Load-balance-based satellite network on-demand routing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102231896A CN102231896A (en) | 2011-11-02 |
| CN102231896B true CN102231896B (en) | 2013-10-16 |
Family
ID=44844420
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110206215 Expired - Fee Related CN102231896B (en) | 2011-07-21 | 2011-07-21 | Load-balance-based satellite network on-demand routing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102231896B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104185164B (en) * | 2014-09-10 | 2017-11-24 | 西安电子科技大学宁波信息技术研究院 | Method for routing based on content integrity and geographical crossing in vehicle self-organizing network |
| CN104184829B (en) * | 2014-09-10 | 2017-09-22 | 西安电子科技大学宁波信息技术研究院 | Method for routing based on content integrity and positional information in vehicle self-organizing network |
| CN105119838B (en) * | 2015-07-15 | 2018-05-15 | 中国人民解放军理工大学 | A kind of nongeostationary satellite networks flow equalization control method |
| CN107592150A (en) * | 2016-07-06 | 2018-01-16 | 北京信威通信技术股份有限公司 | A kind of method and device based on LEO mobile satellite communication system |
| CN109039896B (en) * | 2018-07-10 | 2021-04-23 | 北京航空航天大学 | Routing method and device suitable for spatial information network |
| CN112865852B (en) * | 2019-11-28 | 2022-04-01 | 清华大学 | Routing method and routing equipment for network layer addressing based on spatial position information |
| CN113067625B (en) * | 2021-03-17 | 2022-03-04 | 西安电子科技大学 | Satellite network multi-service QoS routing method based on region division |
| CN113872875B (en) * | 2021-07-27 | 2023-07-11 | 广西电网有限责任公司桂林供电局 | Self-adaptive intelligent gateway discovery method based on load balancing |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101447946B (en) * | 2008-12-24 | 2011-04-27 | 南京邮电大学 | Dynamic route service quality protection method for safe agent-based satellite network |
| CN101552933B (en) * | 2009-05-04 | 2012-11-07 | 中国人民解放军空军工程大学 | Optical network self-adapting route system for low/middle orbit double-layer satellite and calculating method of agent route |
-
2011
- 2011-07-21 CN CN 201110206215 patent/CN102231896B/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN102231896A (en) | 2011-11-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102231896B (en) | Load-balance-based satellite network on-demand routing method | |
| Song et al. | TLR: A traffic-light-based intelligent routing strategy for NGEO satellite IP networks | |
| CN106656302B (en) | Distributed node adaptive routing algorithm towards LEO satellite network | |
| CN104683016B (en) | Based on the optimal service distribution method for routing of multilayer satellite network for minimizing time delay | |
| CN104079496B (en) | Double-deck satellite load balancing method based on link cost conversion | |
| Chen et al. | Satellite grouping and routing protocol for LEO/MEO satellite IP networks | |
| CN107453801A (en) | A kind of Layered Multipath method for routing towards satellite network | |
| CN108989223A (en) | A kind of satellite routing algorithm under strong link constraints | |
| Dong et al. | Load balancing routing algorithm based on extended link states in LEO constellation network | |
| CN112566142B (en) | QoS guarantee-based LEO satellite network reliability routing method | |
| CN111294108B (en) | Efficient routing method for orthogonal circular orbit configuration satellite constellation | |
| CN105791118A (en) | LEO/GEO-double-layer-satellite-network-oriented routing policy | |
| CN110391983A (en) | Distributed congestion avoidance routing algorithm for satellite-ground integrated network | |
| Deng et al. | An ant colony optimization-based routing algorithm for load balancing in leo satellite networks | |
| Deng et al. | Distance-based back-pressure routing for load-balancing leo satellite networks | |
| CN101984712B (en) | Real-time communication routing method for wireless sensor network | |
| CN107302396A (en) | Network route planning method between dynamic star based on mixed strategy | |
| CN112020117B (en) | Routing method based on transmission speed and node capacity in low-earth-orbit satellite communication network | |
| Li et al. | Queue state based dynamical routing for non-geostationary satellite networks | |
| Rao et al. | Agent-based multi-service routing for polar-orbit LEO broadband satellite networks | |
| Ji et al. | A-star algorithm based on-demand routing protocol for hierarchical LEO/MEO satellite networks | |
| CN107241268A (en) | Local multipath method for routing and device based on satellite-based ADS B message satellite networks | |
| Wang et al. | A flooding-based routing algorithm for ADS-B packets transmission in LEO satellite network | |
| Liu et al. | An improved multi-path routing algorithm for hybrid LEO-MEO satellite networks | |
| Yi et al. | Route strategy of satellite network in GNSS based on topology evolution law |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20131016 Termination date: 20200721 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |