CN101039279B - Wireless base station and packet transmission path optimization method - Google Patents
Wireless base station and packet transmission path optimization method Download PDFInfo
- Publication number
- CN101039279B CN101039279B CN2007100958025A CN200710095802A CN101039279B CN 101039279 B CN101039279 B CN 101039279B CN 2007100958025 A CN2007100958025 A CN 2007100958025A CN 200710095802 A CN200710095802 A CN 200710095802A CN 101039279 B CN101039279 B CN 101039279B
- Authority
- CN
- China
- Prior art keywords
- grouping
- base station
- wireless base
- mentioned
- tree
- 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
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
In a wireless packet transmission system that includes multiple wireless basestations and one or more wireless terminals belonging to one of the wireless basestations, transmission trees extending from two or more wireless basestations as root stations are used. Each of the wireless basestations has a tree table configured to record the root stations in association with the ID information about the transmission trees. When receiving a packet, each of the wireless basestations determines the transmission tree to be used for the packet transmission, and transmits the packet to a next node alongthe determined transmission tree.
Description
The present invention is based on the 42nd proposition of patent law of china detailed rules for the implementation, is to be that February 18, application number in 2005 are that 200510008516.1 name is called the dividing an application of patent application of " packet delivery system, wireless base station and packet transfer route optimization method " applying date.
Technical field
The present invention relates to realize the grouping tranmission techniques of the wireless packet communications between a plurality of network segmentations, be specifically related in network, to construct the tree-like transfer path of being stood as root (Root) in a plurality of wireless base stations and keep in the path optimization, the path optimization when preventing packet delivery system and the wireless base station that localised load is concentrated and dividing into groups transmission.
Background technology
Have a kind ofly by being connected a plurality of terminals by wireless channel and make terminal self have the grouping transmitting function to set up interconnective network between terminal, such network is called as wireless self-networking or wireless multi-hop networks.In this network, need not specific control station, terminal self independently constitutes local area network (LAN) dispersedly.In wireless self-networking, even between can not the terminal of direct communication, also can carry out packet relay by making the 3rd therebetween terminal, under the condition of the transmitted power that does not improve each wireless communication terminal, enlarge communication range.As the internet standard of wireless self-networking, some agreements (for example, with reference to non-patent of invention document 1) that the path when having formulated the grouping transmission is controlled.
On the other hand, in cable network, use bridge to divide into groups to transmit.Known (for example have a kind of grouping load mode, with reference to non-patent of invention document 2), this mode is by becoming a specific bridge or base station sets root (Root) to stand, utilize the tree connection protocol to form tree-like transfer path, like this, not only can avoid the formation of loop, and can improve the ability of bearing fault.This method generates the tree-like transfer path of non-loop from the bridge 1 that becomes the root station as shown in Figure 1, and the transmission destination of a plurality of interfaces and grouping is signed in in the learning table mutually accordingly.
Transmit for the grouping of using above-mentioned wired bridge being transmitted the grouping that is applied to radio block network, need have the wave point that each transmits destination-address.Yet, if make it have a plurality of interfaces, need antenna and modulation-demodulation circuit respectively, can increase cost thus.
Therefore, (for example, with reference to patent of invention document 1), proposed a kind of by the communication counterpart address is considered as imaginary interface, and hypothesis has a plurality of wave points, being essentially one wave point, the expansion of cable network tree transfer approach is applied to the method that the grouping of radio block network transmits.In the method, each wireless base station has the other side's destination-address and transmits the destination and constitutes mutual corresponding address table, receives the wireless base station of grouping, with reference to address table, transmits grouping to the transmission destination of corresponding the other side's destination-address.
And, in order to eliminate invalid transfer path, (for example, with reference to patent of invention document 2), a kind of like this method has been proposed, even this method utilization self be not under the situation of communication counterpart, as long as in communication range, also can receive a kind of so wireless feature of grouping, to on tree-shaped transfer path, monitoring towards the grouping that direction transmitted near our station, generate constituting the table of mutual correspondence, shorten the path in the way thus by the represented wireless terminal of the transmission source address of this grouping with by the represented wireless base station of transmitter station address.
And, (for example, with reference to patent of invention document 3), also proposed a kind of when forming tree-like transfer path, judgement whether more than or equal to threshold value, under the low situation of the incoming level of signal, realizes the raising of communication quality from the incoming level of the signal of wireless base station by extended channel not.
In addition, in wireless self-networking, when dividing into groups to transmit, and under the situation of using tree-like transfer path, form when setting, need retrieve optimal path at short notice.Compare with wired communication path, use wireless its network condition of communication path to change easily, for optimal path is selected in the variation of considering wireless conditions, (for example, with reference to patent of invention document 4), known have a kind of the error rate and the transfer rate between contiguous wireless terminal (wireless base station) to be set at weighted value.This method is when carrying out route search, and the weighted value addition successively by the link between corresponding wireless terminal is set decides optimal path.
[non-patent of invention document 1] S.Corson, J.Macker, " Mobile Ad hocNetworking (MANET): Routing Protocol Performance Issues and EvaluationConsiderations " Internet standard RFC2501, January 1999
[non-patent of invention document 2] ISO/IEC 10038, ANSI/IEEE Std802.ID, " Information technology-Telecommunications and information exchangebetween systems-Local area networks-Media access control (MAC) bridges ", 1993
[patent of invention document 1] spy opens the 2000-69046 communique
[patent of invention document 2] spy opens the 2000-78147 communique
[patent of invention document 3] spy opens the 2003-188811 communique
[patent of invention document 4] spy opens the 2003-152786 communique
In non-patent of invention document 1 disclosed communication mode, all terminals that add network must possess the grouping transmitting function.Say it on the contrary, the terminal of function difference can not add network, therefore, in order to increase function, will cause the increase of equipment and the increase of cost.
Wired packet transmission method of non-patent of invention document 2 is applied to the method for the patent of invention document 1 of radio block network, can only has a tree-like transfer path in one network.Therefore, as shown in Figure 2, dividing into groups from wireless terminal (Station) S under the situation that wireless terminal (Station) D transmits,, divide into groups according to the order transmission of bridge x7, bridge x8, bridge a, bridge x3, bridge x4 along the path of Bridge (bridge) a as the dotted line at root station.Like this, not only produce invalid transfer path, and load concentrates on the part of the root (Root) of tree.
Though patent of invention document 2 disclosed packet transmission methods can monitor by the approaching grouping of subtend our station, simplify path in the way, yet this method exists load too and concentrates on the single wireless base station that becomes root (Root) problem of the inefficiency of network integral body.
In patent of invention document 3 disclosed packet transmission methods, be to be benchmark with received power from this wireless base station, judge between the wireless base station whether carry out channel expansion, however wireless environment change easily, and also need to possess the wave point that changes communication speed according to environment automatically.In addition, also exist and to calculate the link cost that communication speed is all taken into account, the low problem of efficiency of transmission connectivity low, network of network integral body.
Though patent of invention document 4 disclosed path searching methods have been considered wireless environment, yet reckon without the length of pay(useful) load of corresponding grouping and the additive decrementation that changes to data transfer time.
Like this, in utilizing the 3rd layer transfer approach in the past, the terminal installation that does not possess transmitting function can not add network, on the other hand, utilize MAC (Media Access Control: the medium access control) transfer approach of layer bridge, also prematurity of application in wireless, the load to the part that can not avoid causing by using single tree-like transfer path is concentrated.
Summary of the invention
Therefore, the objective of the invention is, in the autonomous wireless network that disperses, no matter the function of wireless terminal height by divide into groups to send scatteredload with optimal path, improves the efficient of network integral body.
In order to achieve the above object, avoid the load in wireless self-networking to concentrate, realize the optimization that grouping transmits, in packet delivery system, construct and use tree-like transfer path more than 2 or 2.And, when carrying out route search, except considering network radio environment, consider that also the pay(useful) load length of dividing into groups realizes the optimization of packet transfer route.
In the former method, 2 in the wireless network or 2 above wireless bridges are stood as root (Root), constitute a plurality of tree-like transfer paths simultaneously, at each node, each grouping to being transmitted can determine and should use which tree to transmit.Come the optimization and the load dispersing of realizing route thus.
The function of wireless terminal in the case, has the grouping transmitting function, and the low terminal of function is connected with nearest wireless base station, no matter how, can both add network by making wireless base station as the wireless bridge functionating.Also can make wireless terminal add network, make himself as wireless bridge and functionating with grouping transmitting function.
In the latter's method, no matter having or not and quantity of tree-like transfer path, when grouping transmits and/or tree-like transfer path when forming, be reflected on the cost of communication link the corresponding optimal path of grouping transmission of decision and reality by the pay(useful) load length that makes grouping.
Specifically, in the 1st side of the present invention, provide a kind of wireless base station that uses in cordless communication network, it is characterized in that this wireless base station has: receiving and transmitting part is used for sending and receiving grouping; The big or small judging part that divides into groups is judged the grouping size of the above-mentioned grouping that receives; Cost calculation portion, it considers that at each big or small benchmark that divides into groups the transfer rate of channel is calculated link cost; A plurality of routing tables, it is and generates according to above-mentioned link cost accordingly with the relevant a plurality of different benchmark of grouping size that each routing table is described destination information and packet transfer route explicitly; Above-mentioned receiving and transmitting part is according to above-mentioned grouping size, and with reference in above-mentioned a plurality of routing tables one is sent to next node to the above-mentioned grouping that receives.
In the 2nd side of the present invention, packet transfer route optimization method in a kind of wireless network is characterized in that, this wireless network comprises a plurality of wireless base stations, said method may further comprise the steps: at each big or small benchmark that divides into groups, consider that the transfer rate of channel is calculated link cost; A plurality of routing tables are set, and each routing table is recording destination information and transfer path explicitly, and this routing table is to state the relevant a plurality of different benchmark of grouping size and generate according to above-mentioned link cost accordingly with catching up with; The grouping size of this grouping when receiving grouping, is judged in a wireless base station in above-mentioned a plurality of wireless base stations; According to above-mentioned judged result, according in above-mentioned a plurality of routing tables one is sent to next node to above-mentioned grouping.
According to this method, in the wireless environment that always changes, owing to not only consider the transfer rate of link, but also consider that block length decides the path, thereby can divide into groups with the optimal path that has reduced additive decrementation to transmit.
And, can be when using the tree-like transfer path of being stood as root (Root) in a plurality of stations to keep the optimality in path, preventing to load concentrates on the part of network, can construct the network of autonomous dispersion.
And, owing in the calculating of link cost, considered the pay(useful) load length of wireless channel state and grouping, can realize considering the optimization in the path of network environment and grouping size.
In this article, term " tree-like transfer path " (transmission tree) comprises routing table, generates tree (spanning tree) and any suitable Route Selection means.
Description of drawings
Fig. 1 is the figure that the grouping of the tree-like transfer path of non-loop in the expression use cable network in the past transmits.
Fig. 2 is the figure that the grouping of the tree-like transfer path at single station in the expression use wireless network in the past transmits.
Fig. 3 is the figure of summary of the packet delivery system of expression the present invention the 1st execution mode, be used for to a plurality of wireless base stations as root station, the figure that uses the grouping transmission of a plurality of tree-like transfer paths to describe.
Fig. 4 is the figure of the configuration example of the tree table that keeps of expression each wireless base station on the network.
Fig. 5 is the figure of form example that is illustrated in the address part of the grouping of using in the network of Fig. 3.
Fig. 6 is illustrated in the 1st execution mode the figure of a plurality of stations as the configuration example of the tree-like transfer path at root station.
Fig. 7 is used for transmitting the figure that the 1st method of the tree-like transfer path that uses describes to differentiating in grouping, is the figure of the configuration example of the navigation watch that has of each wireless base station of expression.
Fig. 8 is the figure of the generation example of the learning table in each wireless base station of expression.
Fig. 9 is used for transmitting the figure that the 2nd method of the tree-like transfer path that uses describes to differentiating in grouping, is the figure of the configuration example of appending field of the header portion of expression grouping.
Figure 10 is the figure that is illustrated in the cost detail of the link that uses in the generation of tree-like transfer path.
Figure 11 is the figure that the tree-like transfer path of expression forms an example of step.
Figure 12 is the figure of configuration example of the wireless base station of expression the 1st execution mode.
Figure 13 is used for the figure that the packet transfer route optimization method to the present invention's the 2nd execution mode describes, and is the figure of the configuration example of expression radio frames.
Figure 14 is used for the figure that the relation to pay(useful) load length and optimal path describes.
Figure 15 is the figure of configuration example of the wireless base station of expression the 2nd execution mode.
Figure 16 is the flow chart of the path control corresponding with block length of expression the 2nd execution mode.
Figure 17 is the figure that expression is applied to the network configuration example of the 2nd execution mode.
Figure 18 (a) is the figure of transfer path one example of the short grouping of expression, and Figure 18 (b) is the figure of transfer path one example of the long grouping of expression.
Figure 19 is an example that has write down the routing table of all via nodes, and Figure 19 (a) is the figure of the short grouping sheet of expression, and Figure 19 (b) is the figure of the long grouping sheet of expression.
Figure 20 is an example that has only write down the routing table of next jumping, and Figure 20 (a) is the figure of the short grouping sheet of expression, and Figure 20 (b) is the figure of the long grouping sheet of expression.
Figure 21 is the figure of the cost calculation example of expression the 2nd execution mode.
Among the figure: 10A, 10B, 50 ... the wireless base station; 11,51 ... signal receiving and sending; 12 ... the tree table; 13A, 13B ... the tree judegment part; 16 ... navigation watch; 20,60 ... cost calculation portion; 56 ... the block length judegment part; 57 ... short grouping sheet (routing table); 58 ... long grouping sheet (routing table)
Embodiment
With reference to Fig. 3～Figure 11, the packet delivery system of the present invention's the 1st execution mode is described.In the 1st execution mode,, in system, construct tree-like transfer path more than 2 or 2 for the optimization that realizes dividing into groups to transmit.
Fig. 3 is used for the figure that the summary to the packet delivery system of the present invention's the 1st execution mode describes.In the 1st execution mode, have the tree-like transfer path of a plurality of wireless base stations by making network as the root station, improve the efficiency of transmission of network integral body, realize the shortening of transfer path.In addition, as execution mode, be that example describes with the situation of the WLAN that the present invention is applied to the IEEE802.11 standard.
In Fig. 3, Bridge (bridge) a～f represents the wireless base station, transmits packet radio between each bridge mutually.Station A～E represents wireless terminal.No matter wireless bridge (base station) is movable type or fixedly all can.Each wireless base station can have one or more wireless terminals in its lower section, and no matter following wireless terminal and the connection between the wireless bridge are wired or wirelessly all can.In the 1st execution mode, 2 in the wireless base station that constitutes network or 2 above wireless base stations as the root station, form a plurality of tree-like transfer paths, yet in the example of Fig. 3, all wireless base stations are generated the non-loop tree-like transfer path of our station as the root station.But, consider the size and the additive decrementation of network, also can eliminate useless tree-like transfer path.
Each wireless base station (bridge) on the network has: the wireless base station that becomes the root station; And the tree table, make this wireless base station as the ID of the tree-like transfer path at root station and storing of setting in abutting connection with the bridge correspondence.
The tree table that the bridge d of Fig. 4 presentation graphs 3 keeps is as an example of tree table.To each the root station on the network, the ID of the tree-like transfer path that record is corresponding and the address of the wireless base station (set out in advance to make arrangements and station) down of adjacency on this tree.
Using on the network under the situation of a plurality of tree-like transfer paths, when receiving grouping, needing to differentiate the relaying that uses which tree-like transfer path to divide into groups in each wireless base station.Wherein, following 2 kinds of methods have for example been considered.
(1) the 1st method is to make each wireless base station have the method for navigation watch, and this navigation watch makes the wireless base station on the network corresponding with the wireless terminal that is positioned at subordinate separately.Each wireless base station (bridge) is according to the address of the transmission source terminal that writes in grouping or become the address of the terminal of destination, with reference to navigation watch, specifies the wireless base station under the wireless terminal of the wireless terminal in transmission source or destination.Then, from the tree table, specify,, grouping is sent to next wireless base station according to this tree the tree of specified wireless base station as the root station.
(2) the 2nd methods are, make the wireless terminal in transmission source or first receive the wireless base station of grouping from the wireless terminal that sends the source, write use the information of which wireless base station as the tree-like transfer path at root station in grouping.In grouping, can write tree-like transfer path ID, also can write the address of the wireless base station that becomes the root of this tree-like transfer path station.
The detailed content of these methods will be explained below, and according to the 1st or the 2nd method, when differentiating the tree-like transfer path that should use in each wireless base station, according to the tree table, can be sent to next relay address to grouping.By on network, using a plurality of tree-like transfer paths, can more effectively carry out the optimization in path, the shortening of realizing route.And can avoid loads focuses on the periphery of specific wireless base station, can improve the efficient of network integral body.
Fig. 5 is the figure of form one example that is illustrated in the address part of the grouping of receiving and dispatching on the network of Fig. 3.The epimere of Fig. 5 is the form example that sends to the grouping of wireless base station (Bridge) from wireless terminal (Station), the stage casing is the form example of the grouping of transmission between wireless base station (Bridge), and hypomere is the form example that (Bridge) sends to the grouping of wireless terminal (Station) from the wireless base station.
Transmission source address is the ID that has represented to generate at first and send the address of the Wireless Telecom Equipment that divides into groups.Destination-address is the ID of address of the Wireless Telecom Equipment of the expression final destination that becomes grouping.Transmitter station address is in order to send the address ID of the Wireless Telecom Equipment of this grouping in the tree grouping being carried out then.The destination address is when in the tree relaying is carried out in grouping, receives the address ID of the Wireless Telecom Equipment of this grouping.
" DS " represents Wireless Telecom Equipment, and " To " represents receiver side, and " From " represents transmitter side.When the value of " To DS " was 0, the expression wireless terminal was a receiver side, and when being 1, the expression wireless base station is a receiver side.When the value of " From DS " was 0, the expression wireless terminal was a transmitter side, and when being 1, the expression wireless base station is a transmitter side.When " To DS " is 1 and " From DS " when being 1, expression is grouped between the wireless base station and is transmitted.By " To DS " field and " From DS " field are inserted in the grouping, can differentiate grouping and whether between the wireless base station, carry out in the relaying.
For example, send under the situation of the grouping of mailing to wireless terminal (Station) E from wireless terminal (Station) A in formation according to Fig. 3, grouping from wireless terminal (Station) A transmission, shown in the epimere of Fig. 5, comprise following as address information, that is: as the address of the wireless terminal A of transmission source address, as the address of the wireless terminal E of destination-address, and as the wireless terminal A of destination address the address of the bridge a under current.
This grouping is carried out the bridge b of relaying from bridge a, shown in the stage casing of Fig. 5, transmission also is inserted with as the own address of transmitter station address and as the grouping of the address of the bridge c of next relay address of destination address except transmission source address and destination-address.
Fig. 6 is the figure that expression is applied to the present invention the example of the network topology identical with the tree-like transfer path of the Fig. 2 that generates according to conventional art.Under the situation that transmits grouping from wireless terminal (Station) S to wireless terminal (Station) D, shown in dotted arrow, owing to can use bridge b is transmitted grouping as the tree-like transfer path at root station, thereby with shown in Figure 2, only compared as the situation at root station in a station, significantly shorten in the path.In the example of Fig. 6, for convenience of explanation, bridge a and these 2 wireless base stations of bridge b are generated tree-like transfer path as the root station, yet, can use tree-like transfer path more than 3 according to the network size, arrange tree more to high-density.
Below, be example with the network of Fig. 6,2 examples of differentiating the tree-like transfer path that uses in grouping transmits are described, that is: (1) makes each wireless base station have the method for navigation watch, and this navigation watch makes wireless base station on the network and subordinate's wireless terminal corresponding; And (2) are written to the 2nd interior method of grouping to the information relevant with tree-like transfer path.
Fig. 7 is expressed as the figure that realizes above-mentioned the 1st method and be set in the configuration example of the navigation watch in each wireless base station.Each wireless base station on the network exchanges the information of the wireless terminal that current our station subordinate exists, and generates navigation watch.In the example of Fig. 7, in each wireless base station, the address A of bridge a is corresponding with the wireless terminal P that its subordinate exists, and the address B of bridge b is corresponding with O with the wireless terminal S that its subordinate exists, and the address C of bridge c is corresponding with the wireless terminal D that its subordinate exists.Although diagram is omitted, yet for other wireless base stations, the wireless terminal that its subordinate is existed is corresponding to come record.By having this navigation watch, the subordinate which wireless base station current which wireless terminal is positioned at can be held in all wireless base stations.
Considered on the network of Fig. 6, grouping to be sent to from wireless terminal S the situation of wireless terminal D.Wireless terminal S becomes transmission source address to own address setting, and the address setting of wireless terminal D is become partner address, and the address B of affiliated bridge b is set for the destination address, sends grouping.
Bridge b according to the tree-like transfer path of our station as the root station, sends to next relay address to grouping when receiving grouping.Any bridge in the relaying way is checked the address part of grouping, and the transmission source of identifying this grouping is wireless terminal S.Then, according to navigation watch, under the wireless terminal S in assurance transmission source is current is bridge b.Therefore, from the tree table, derive, grouping is sent to next node (relay address) according to this tree-like transfer path the tree-like transfer path of bridge b as the root station.
When bridge b receives grouping at the wireless terminal S from the subordinate, grouping is sent to bridge x7, x8, x9 according to tree-like transfer path.Bridge x7 derives the tree-like transfer path of bridge b as the root station according to the address information of navigation watch and grouping, grouping is sent to relay address x4, the x6 of back.Equally, bridge x8 also differentiates tree-like transfer path, does not have next relay address yet identify on the tree-like transfer path of being differentiated, discarded this grouping.Carry out the processing identical at bridge x9 with bridge x7.By carrying out this processing in turn according to tree, grouping arrives bridge c, finally arrives wireless terminal D.
When using the wireless base station of transmitter side as the tree-like transfer path at root station, at the breakout of tree, 2 or 2 above bridges divide into groups to be sent to.Under the situation of the broadcast transmission of named place of destination not, this also can, yet under the situation of particular wireless station as the clean culture of destination, grouping is sent to the wireless terminal bridge that it doesn't matter with the final destination, wastes.In order to reduce this waste, expectation be at least one that adopts in the formation proposed below.
(a) have under the situation of clean culture of partner address in appointment, use the tree-like transfer path of the affiliated wireless base station of the wireless terminal of destination as the root station.
(2) generate learning table, transmit, with learning table and be used for transmitting grouping for the 2nd later grouping.
The employing of (a) the formation of the other side's wireless base station as the tree-like transfer path at root station in, in the example of Fig. 6, in order to transmit the grouping of mailing to wireless terminal (Station) P, the tree-like transfer path of the bridge a under the wireless terminal P on application target ground from wireless terminal (Station) S.Each wireless base station in the relaying way is according to the destination-address and the navigation watch of the grouping that receives, and differentiates that (bridge is a) as the tree-like transfer path at root station the affiliated wireless base station of wireless terminal P.By using the tree-like transfer path of the wireless base station of the other side's side as the root station, each wireless base station can fall to review tree, and grouping only is sent to single relay address.In this embodiment, bridge b has saved at bridge x7 and x8 the waste of relaying has been carried out in grouping, and grouping only is sent to bridge x9.
Like this, by the wireless base station under the wireless terminal of destination as the root station, can alleviate network load.On the other hand, under the situation of the not broadcasting of named place of destination, perhaps under the affiliated situation that address unknown of the wireless terminal of destination,, can make grouping arrive the final address that sends by using the tree-like transfer path of the wireless base station under the wireless terminal in the source of transmission as the root station.
In addition, for the bridge that is positioned at network end-point, also considered not have the situation of our station as the tree-like transfer path at root station.For example, the bridge c of Fig. 6 comes to this.In the case, each wireless base station is at first preferentially with reference to destination-address (Station D), under not the situation of the wireless base station under the wireless terminal of destination, can adopt the formation of the tree-like transfer path of the wireless base station that uses transmitter side as the tree-like transfer path at root station.
Then, for the formation (b) with learning table and usefulness, in each wireless base station, the grouping that the wireless terminal of representing from transmission source address is sent is recorded in the learning table from the situation which wireless base station sends.For the generation of learning table, can adopt known method.
Fig. 8 is the figure of expression learning table one example.On the network of Fig. 6, under the situation that sends the grouping of mailing to wireless terminal D from wireless terminal S, grouping at first is sent to bridge b (arrow (1)) from wireless terminal S, according to the tree-like transfer path of bridge b as the root station, is sent to bridge x4 (arrow (2)) via bridge x7.At bridge x4, according to the transmission source address of grouping, know it is the grouping that sends from wireless terminal S, and according to transmitter station address, know that this grouping sends from bridge x7.Therefore, this information is written to (symbol (3)) in the learning table.That is, in the Station hurdle of learning table, charge to address or the ID of the wireless terminal S in transmission source, in the Bridge hurdle, charge to address or the ID of previous bridge x7.Grouping arrives the wireless terminal D of destination via bridge c from bridge x4.
Wireless terminal D replys (arrow (4)) in response to the grouping that receives to wireless terminal S.Reply grouping and be sent to bridge x4 (arrow (5)) from bridge c.Bridge x4 is according to the address information of grouping, and identifying the transmission source is wireless terminal D, and this grouping sends from bridge c, and this situation is logged in the learning table (symbol (6)).
Grouping further is sent to bridge b (arrow (7)) from bridge x4 via bridge x7.At bridge b, bridge x7 is received this situation of grouping that sends from wireless terminal D record (symbol (8)) in the learning table, transport the packet to wireless terminal S.
Although omit explanation, yet in last example,, when receiving grouping, all record in the learning table at bridge x7 and bridge c.And, before study under the initial situation that transmits grouping,, thereby, record in the learning table too at the bridge (x3, x8 etc.) of branch address because in the branch place, grouping is sent to branch address separately.
Bridge b knows the direction of wireless terminal D at bridge x7 from the record of learning table under the situation that receives the grouping of mailing to wireless terminal D subsequently.Therefore, this grouping only is sent to bridge x7, and is not sent to bridge x8 and other branch address.Equally, at bridge x4, under the situation that receives the grouping of mailing to wireless base station D subsequently, grouping only is sent to bridge c, and is not sent to other branch address.Like this, even under using, also can cut down useless grouping the situation of the wireless base station of transmitter side as the tree-like transfer path at root station.
In addition, using according to the 1st method under the situation of navigation watch, when new wireless terminal belongs to each wireless base station, perhaps when wireless terminal moves and belongs to other wireless base station, the wireless base station is according to tree-like transfer path, and broadcast transmission is carried out in the grouping that the notice wireless terminal is belonged to our station.Each wireless base station that receives notice packet signs in to new affiliated relation in the navigation watch.At this moment, each wireless base station can adopt following formation, that is: the wireless base station in the transmission source of notice packet is written in the learning table with the address of the previous wireless base station that sends this notice packet is corresponding.
When wireless terminal belongs to any wireless base station,,, can more effectively carry out the Path selection on the tree-like transfer path by also signing in in the learning table with the renewal while of navigation watch.
Below, with reference to Fig. 9 the 2nd method of differentiating tree-like transfer path is described.In the 2nd method, make the grouping that is transmitted comprise use the information of which wireless base station as the tree-like transfer path at root station.
Fig. 9 (a) is the configuration example of the grouping under the situation of the tree-like transfer path at the root station of using transmitter side, and Fig. 9 (b) is the configuration example of the grouping under the situation of the tree-like transfer path at the root station of application target ground side.The grouping of Fig. 9 (a) is formed under the situation of independent employing the 2nd method and uses, and the grouping of Fig. 9 (b) is formed in and combines under the situation about using with the 1st method (navigation watch) is effective.
In the network of Fig. 6, considered grouping is sent to from the subordinate's that is positioned at bridge b wireless terminal S the situation of the subordinate's who is positioned at bridge c wireless terminal D.In the case, different with the 1st method, each wireless base station on the network can not know which wireless base station is which terminal belong to.Therefore, the ID of the tree-like transfer path of use or become the address information of the wireless base station at root station in transmitter side is embedded in grouping.The tree-like transfer path that should use is differentiated according to the information that is comprised in the grouping in each wireless base station (bridge) in the relaying way, with reference to the tree table grouping is sent to next relay address.
In the example of Fig. 9 (a), the bridge b that receives grouping from wireless terminal S at first specifies the tree-like transfer path of our station as the root station.The appending and write this station address in the field of grouping, perhaps write our station as the tree-like transfer path ID at root station as setting id information as root station information.In addition, can when sending grouping, wireless terminal S carry out to appending writing of field.In the case, in appending field, write the address of the wireless base station (bridge b) under self as root station information.
The bridge x7 in path identifies and uses the tree-like transfer path of bridge b as the root station according to the root station information (perhaps tree-like transfer path information) that writes in the field of appending in grouping in the way.Then, the address as the bridge x4 of next relay address on the tree-like transfer path is written in the address field 1 as the destination address, this station address is written in the address field 2 as transmitter station address.
Be positioned in the wireless base station under the situation of breakout of tree, grouping be sent to each branch address according to the tree table.Therefore, in the 2nd method, with learning table shown in Figure 8 and usefulness.Make wireless terminal according to the specified transmission source of transmission source address of grouping with corresponding, store in the learning table according to the specified previous bridge in destination address.As mentioned above, in radio communication, owing to general wireless terminal from the destination receives the confirmation of receipt response and replys data, thereby when mailing to the grouping arrival of identical destination subsequently, can not carry out multicast, but only transmit grouping towards the direction at the wireless terminal place of destination from breakout.
In the example of Fig. 9 (b), in the address of appending the wireless base station under the wireless terminal that writes the destination in the field of grouping as root station information.In the case, prerequisite is that each wireless base station has navigation watch.From wireless base station that wireless terminal receives grouping at first with reference to navigation watch, the wireless base station under the wireless terminal of named place of destination.The ID of the tree-like transfer path of the address of specified wireless base station or correspondence is written to appending in the field of grouping,, grouping is sent to next relay address falling to review on the path of specified tree-like transfer path.Wireless base station in the relaying way is with reference to navigation watch, but can be sent to next relay address to grouping with reference to the tree table according to the address information of grouping.
Below, with reference to Figure 10 and Figure 11 the generation method of tree-like transfer path is described.In embodiments of the present invention, generate tree-like transfer path according to the cost calculation of having considered wireless environment.
Figure 10 (a) is illustrated in the cost guide look example of each bridge that uses when tree-like transfer path forms, and Figure 10 (b) is illustrated in the communication speed of IEEE802.1t regulation and the framework of link cost.In the past, in cable network, when generating tree-like transfer path, generated tree-like transfer path according to link cost only based on the fixed communication speed shown in jumping figure or Figure 10 (b).Yet in radio block network, owing to the situation of modulation system according to wireless channel changes, the generation of grouping mistake is also many, thereby practical communication speed is not steady state value.And, different with the wired bridge that does not disturb, for wireless, can not necessarily only decide cost according to jumping figure.
Therefore, when generating tree-like transfer path,, generate the tree-like transfer path that is suitable for situation by changing link cost according to the situation of the wireless channel between wave point and the congested conditions of network traffic.
As the example in the 1st execution mode, in cost calculation, use from the power level and the error rate of the signal that receives near bridge.In the cost guide look of Figure 10 (a), " Bridge " hurdle is the ID at the bridge of the approximated position of the bridge that will have in mind." Signal " hurdle is represented from the received power level near bridge." Queue size " hurdle is illustrated in and is notified to the size that tree generates the transmit queue of grouping when tree generates, and the rate that takes defeat (error rate) of dividing into groups is represented on " Error Rate " hurdle.According to the received power of grouping, judge the modulation system of on the link between this interface, using, be reflected on the link cost thereby can obtain communication speed.
During at the bridge that uses these parameters to carry out will to have in mind with near the cost calculation between the bridge, can use with each parameter cost calculation with aspect normalized value α, β, γ, represent by following formula.
cost＝α×(Signal)+β×(Queue?size)+γ×(Error?Rate)
Figure 11 is the figure that the tree-like transfer path of expression forms an example.In Figure 11, but dotted portion is represented the link between the bridge of physical communication.For example, become the root station and generate under the situation of tree at bridge a, bridge a generates the grouping broadcast transmission to tree near base station (arrow (1)).Have the field of charging to cost in grouping, the cost of the grouping that sends from the root station is zero.
The bridge b that receives grouping is according to the cost guide look of Figure 10 (a) as an example expression, calculate the cost " ab " between bridge a and the bridge b, the cost that is written into tree generation grouping is charged in the field, sends near bridge (perhaps node) (arrow (2)).
Equally, receive bridge c from the grouping of bridge a and also calculate cost " ac " between bridge a and the bridge c, be written into the cost that tree generates grouping and charge in the field, send near node (arrow (3)).
Receive from the tree of bridge b generate the root station that the bridge c of grouping has oneself (be in the case bridge a) before cost " ac " and the cost " ab+bc " of the grouping that receives compare, cast out the high path of cost.For example, under the situation of ac＜ab+bc, do not use bridge a as the path under the situation at root station from bridge b to bridge c.By making bridge b (arrow (4)), bridge d (arrow (5)), bridge f (arrow (6)) couple together and carry out above-mentioned action, can generate the tree that does not have loop shown in the solid line of Figure 11.
The generation of this tree-like transfer path at regular intervals, perhaps adds network and as the situation of wireless bridge functionating etc. down, dynamically updates and generate according to situation at the mobile radio terminal with transmitting function.The information relevant with the institute tree-like transfer path that upgrades or generates is supplied to each wireless base station on the network, and each wireless base station upgrades to set to be shown.By wireless channel state is reflected on the cost of communication link, can constitute the tree-like transfer path of the present situation that is adapted to network topology, message volume etc.
Figure 12 is the summary pie graph according to the wireless base station of the 1st execution mode.Figure 12 (a) is to use the configuration example of the situation of navigation watch, and Figure 12 (b) is a configuration example of utilizing the situation of the tree-like transfer path id information that is comprised in the grouping.In any example, wireless base station 10A, 10B have: tree table 12 makes the information relevant with tree-like transfer path more than 2 or 2 be associated with the root station of setting separately and stores; Receiving and transmitting part 11, the transmitting-receiving of dividing into groups; And tree judegment part 13A, 13B, according to the employed tree-like transfer path of the group-discriminate that receives.Receiving and transmitting part 11 is sent to grouping the next node on the tree-like transfer path of being differentiated with reference to setting table 12.
In the example of Figure 12 (a), tree judegment part 13A has fractional analysis portion 15 and navigation watch 16, and according to transmission source address or the destination-address and the navigation watch 16 of grouping, decision should become the wireless base station at root station, differentiates the tree-like transfer path corresponding with this root station.In the case, receiving and transmitting part 11 is specified next transfer address by reviewing tree-like transfer path forward or backwards, transmits grouping.
In the example of Figure 12 (b), tree judegment part 13B has fractional analysis portion 15, takes out the tree-like transfer path ID that is comprised in the grouping, the tree-like transfer path that differentiation should be used.
In addition, in Figure 12, for simplicity of illustration, depict single interface and single receiving and transmitting part 11 as, yet can have the key system of between wireless bridge (wireless base station), receiving and dispatching separately and the interface of the connecting system received and dispatched with subordinate's terminal (Station).
More than, be that example is described the 1st execution mode with the wireless network that carries out wireless connections comprehensively, wiredly carry out being connected of wireless base station (bridge) and terminal installation etc., make the part comprise wired wireless network to constitute yet can adopt.And, also can pack into as wireless base station (bridge) the portable terminal with transmitting function is suitable.Added under the situation of network as wireless bridge at portable terminal, owing to dynamically generate the tree-like transfer path of the radio channel state that has reflected this moment, thus can use tree-like transfer path more than 2 or 2 more effectively realizing route optimization and prevent to load concentrated.
And, be that example is described with the WLAN of IEEE802.11 standard, yet be not limited thereto, also can be applied to the wireless network of WCDMA and next generation wireless communication mode.And, have interface and protocol conversion function by making each wireless base station, even be mixed with the radio block network of the network of different communication mode, also can use the method for the 1st execution mode.
Also part or all of a plurality of tree-like transfer paths of using in the network can be concentrated into one, alleviate the load that tree keeps.In the case, as the information in field and the tree table of appending that is written to grouping, can use the tree ID that is concentrated.
Below, with reference to Figure 13～Figure 21 the packet transfer route optimization method of the present invention's the 2nd execution mode is described.In the 2nd execution mode,, when link cost calculates, except the value of transfer rate, also add block length (more particularly, the pay(useful) load length of grouping) in order in wireless network, to determine optimal path.
Figure 13 is the figure that the radio frames among the expression IEEE802.11a constitutes.In many wireless systems, grouping is made of the head of regular length and the pay(useful) load of variable-length.Negotiation time when grouping sends and the transmitting time of head part become the additive decrementation at the real data delivery time.This additive decrementation changes according to transfer rate and pay(useful) load length, it is desirable to, and additive decrementation is few when grouping transmits.
In the example of Figure 13, when sending a frame, be called as SIFS (Short Inter FrameSpacing: after the short stand-by period short interFrameGap), receive as the Ack frame of confirming response, through being used to select during the CW (Contention Window :) of make-up time, send next frame.Now, make that pay(useful) load is the x byte, data rate is kMbps, about 20 μ s of the header delivery time in the frame then, the delivery time of pay(useful) load is 8x/k[μ s], the about 16 μ s of SIFS, the Ack delivery time is about (16+134/k) μ s, is about 101.5 μ s during the CW.That is, the needed delivery time of 1 frame is about [(20+16+16+101.5)+(8x+134)/k] μ s.
The value of the k (megabit) of expression data transfer rate according to according to the modulation system that the electric wave environment adopted between wireless base station (access point) with encoding rate and different.For example, under the strong situation of electric wave, the bit rate height, when a little less than the electric wave, bit rate is low.In the example of Figure 13, set the transfer rate of 6Mbps and 27Mbps according to wireless environment.For ease of explanation, only use 2 kinds of transfer rates, yet also can set transfer rate more than 3 kinds certainly.
Pay(useful) load in grouping is under the situation of 1000 bytes (x=1000), and according to the aforementioned calculation formula, the grouping when the 6M pattern transmits the about 1510 μ s of required time, about 454 μ s when the 27M pattern.
Pay(useful) load in grouping is under the situation of 100 bytes (x=100), about 310 μ s of the grouping delivery time when the 6M pattern, about 189 μ s when the 27M pattern.
As shown in figure 14, according to the wireless conditions between wireless base station (access point), considered to carry out the situation that single-hop transmits, and carried out the situation that double bounce transmits with the data rate of 27Mbps with the data rate of 6Mbps.
When effective load was 1000 bytes, when carrying out the single-hop transmission on the transfer path at 6Mbps, 1 frame transmitted the about 1510 μ s * single-hops=1510 μ s that take time.It is converted into data rate, about 5.3Mbps.
When on the transfer path at 27Mbps the pay(useful) load of identical 1000 bytes being carried out double bounce when transmitting, 1 frame transmits the about 454 μ s * double bounces of required time=908 μ s, is converted into data rate, about 8.6Mbps.That is, the grouping that pay(useful) load length is big (long grouping), even jumping figure is many, it also is favourable selecting to send the high path of bit rate.
On the other hand, when effective load was 100 bytes, when carrying out the single-hop transmission in the 6M pattern, 1 frame transmitted the about 310 μ s * single-hops=310 μ s that take time, and is converted into data rate, about 2.6Mbps.When carrying out the double bounce transmission in the 27M pattern, 1 frame transmits the about 189 μ s * double bounces of required time=378 μ s, is converted into data rate, about 1.9Mbps.
That is, the grouping that pay(useful) load length is little (short grouping) because the ratio height of the first-class required additive decrementation of transmission, even thereby low bitrate, the path that jumping figure is few also is favourable.
Like this, carry out in wireless network under the situation of adaptive modulation and coding, optimal path is according to the pay(useful) load length of the grouping that is transmitted and difference.Therefore, in the 2nd execution mode, a plurality of routing tables that make the wireless base station that constitutes wireless network have the block length judegment part and describe the optimal path corresponding with block length are as the Path selection benchmark, except transfer rate, also add block length.
Figure 15 is the general block diagram according to the wireless base station of the 2nd execution mode.Wireless base station 50 has: receiving and transmitting part 51, transmitting-receiving grouping; Block length judging part 56 when receiving relay for packets, is judged block length or pay(useful) load length; Short grouping sheet 57, related setting up smaller or equal to path under the situation of stipulated standard and destination in block length, store; And long grouping sheet 58, related setting up greater than path under the situation of stipulated standard and destination in block length, store.Receiving and transmitting part 51 is according to the block length of block length judgement section judges, and either party in grouping sheet 57 or the long grouping sheet 58 lacked in reference, and relay for packets is sent to next node.
In Figure 15, as the example of a plurality of routing tables, represented short grouping sheet 57 and long grouping sheet 58, however can be according to distinguish the table that has more than 2 or 2 by block length.In addition, these routing tables are example or parts of the multiple tree-like transfer path that uses in the packet delivery system.
This wireless base station 50 is identical with the 1st execution mode, no matter is that mobile radio station or fixed station can.
Figure 16 is the flow chart of action of the wireless base station of expression the 2nd execution mode.The wireless base station judges in fractional analysis portion 55 whether the grouping that receives is this node address (step S1002) when receiving grouping (step S1001).Be to mail under the situation of grouping of this node (is "Yes" at step S1002), owing to not have necessity of transmission, thereby handle (step S1004) in this wireless base station.In the destination of grouping is under the situation of another node (is "No" at step S1002), and whether grouping judging part 56 judges block length or pay(useful) load length smaller or equal to the stipulated standard value, for example 100 bytes (step S1003).Under the situation smaller or equal to the stipulated standard value (is "Yes" at step S1003), the wireless base station is with reference to short grouping sheet 57, and the path that selection is associated with the destination is sent to next node (step S1005) to grouping.Surpass under the situation of stipulated standard value (is "No" at step S1003) in block length or pay(useful) load length, the wireless base station is with reference to long grouping sheet 58, and the path that selection is associated with the destination is sent to next node (step S1006) to grouping.
Figure 17 represents to adopt the network configuration example of the packet transfer route optimization method of the 2nd execution mode.Network comprises wireless base station A～F, can communicate between 2 nodes that connected by dotted line.Wireless base station A～F has the function of carrying out packet relay and transmission as wireless bridge.In addition, although do not illustrate, yet the terminal installation with relay function is connected.
Figure 18 (a) is illustrated in the network of Figure 17, the figure of wireless base station E as the transfer path example of the short grouping of destination.As mentioned above, the transmission of short grouping, because the ratio height of first-class additive decrementation that transmission is spent, thereby the few path of transmission number of times (jumping figure) is favourable.Under the situation that transmits grouping, can on the path of A → F → E, suppress jumping figure lessly from wireless base station A to E.Under the situation that transmits grouping from wireless base station B to E, adopt B → C → E, reduce jumping figure and transmit.Directly transmit to the E of conduct from D near node.
Figure 18 (b) is illustrated in the network of Figure 17, the figure of wireless base station E as the transfer path example of the long grouping of destination.Under the situation of long grouping because little at the additive decrementation ratio of data transmitting time, even thereby jumping figure increase, it also is favourable selecting to send the high path of bit rate.Grouping is being sent under the situation of E from wireless base station A, is selecting to send the high interval of bit rate, selecting the path of the A → B → C → D → E of total transmitting time minimum.Being sent to from wireless base station F under the situation of E, in the example of Figure 18 (b), select the path of F → E.But, according to wireless conditions, for example under the situation of the delivery time in the path of F → D → E short (being the bit rate height), select the latter's path.
Figure 19 is an example of the routing table that has of wireless base station A.The example of the short grouping sheet of Figure 19 (a) expression, the example of the long grouping sheet of Figure 19 (b) expression.Corresponding with destination-address separately, destination all via nodes have before been described.
Figure 20 is another example of the routing table that has of wireless base station A.The short grouping sheet of Figure 20 (a) expression, Figure 20 (b) represents long grouping sheet, and is corresponding with destination-address separately, described the next node that should transmit.
Figure 21 is the figure that expression is used to generate the link cost calculated example of Figure 19 and routing table shown in Figure 20.According to current wireless conditions, the transfer rate of 6Mbps or 27Mbps is arranged at each internodal link setting.
Grouping is being sent under the situation of E from wireless base station A, and wireless base station A sends to for example route search grouping near node.Node F and Node B RX path retrieves packet at short grouping and the long both sides' that divide into groups the cost of situation calculating from last node A to our station, are written to result of calculation in the grouping separately.At node F, according to the current transfer rate between AF, for short grouping, cost calculation is 310 μ s, and for long grouping, cost calculation is 1510 μ s, and this value is written in the route search grouping.Equally,,,, be calculated as 189 μ s,, be calculated as 454 μ s, these values are written in the route search grouping for long grouping for short grouping according to the transfer rate between AB in Node B.
Receive node E from the grouping of the route search of node F at short grouping and these 2 kinds costs that calculate between FE of long grouping, and and AF between the cost addition.Equally, receive node C from the grouping of the route search of Node B at short grouping and these 2 kinds costs that calculate between BC of long grouping, and and AB between the cost addition.Repeat this process in turn, for grouping is sent to E from A, for example desirable following path: path 1:A → F → E; Path 2:A → B → C → E; Path 3:A → B → C → D → E.In the moment of route search grouping arrival E, at above-mentioned each path, the total cost when total cost when calculating short grouping the and long the grouping.Under the situation of short grouping, cost 1 is the cheapest, is 620 μ s, and transfer rate is low and path 1 that jumping figure is few is selected as optimal path.Under the situation of long grouping, cost 3 is the cheapest, is 1816 μ s, and jumping figure is many and the high path 3 of transfer rate is selected as optimal path.
The selected optimal path of each side to short grouping and long grouping is notified to all nodes, at short grouping sheet of each node updates and long grouping sheet.Afterwards, when wireless base station A sends packet, under the situation that sends short grouping,, be sent to the node F that in table, is described to next node with reference to short grouping sheet.Under the situation that sends long grouping,, be sent to the Node B that is described to next node with reference to long grouping sheet.
In Figure 21, example to the link cost used at route search grouping compute best paths is described, yet as the 1st execution mode, in network, use the formation of tree-like transfer path more than 1 or 2 or 2 also can adopt the determining method of the optimal path of the 2nd execution mode.In the case, the tree that the both sides of the link cost of the link cost of short grouping usefulness and long grouping usefulness are written to from the root station generates in the grouping, tree is generated grouping be sent near node, and the final tree-like transfer path of selected non-loop is notified to each node.Each node (wireless base station) has at the tree-like transfer path table of short grouping with at the long tree-like transfer path table that divides into groups.
Being example with the IEEE802.11a standard is described the packet transfer route optimization method of the 2nd execution mode, yet be not limited thereto, in the system of any-mode, also can adopt same procedure to calculate link cost, can determine to have considered the best packet transfer path of transfer rate and block length.And, can block length (pay(useful) load length) be categorized into 3 stages with on carry out link and calculate.
According to the 2nd execution mode, in the wireless self-networking that network topology and wireless conditions changed according to position and time, select the best packet transfer path according to the block length of being received and dispatched.
Claims (5)
1. a wireless base station that uses in cordless communication network is characterized in that, this wireless base station has:
Receiving and transmitting part is used for sending and receiving grouping;
The big or small judging part that divides into groups is judged the grouping size of the above-mentioned grouping that receives;
Cost calculation portion, it considers that at each big or small benchmark that divides into groups the transfer rate of channel is calculated link cost;
A plurality of routing tables, it is to state the relevant a plurality of different benchmark of grouping size and generate according to above-mentioned link cost accordingly with catching up with, each routing table is described destination information and packet transfer route explicitly;
Above-mentioned receiving and transmitting part is according to above-mentioned grouping size, and with reference in above-mentioned a plurality of routing tables one is sent to next node to the above-mentioned grouping that receives.
2. wireless base station according to claim 1 is characterized in that,
Above-mentioned routing table comprises:
Short grouping sheet at the short grouping with the grouping size below the stipulated standard, is described destination information and packet transfer route explicitly;
Long grouping sheet at the long grouping that has above the grouping size of stipulated standard, is described destination information and packet transfer route explicitly;
In above-mentioned receiving and transmitting part above-mentioned short grouping sheet of reference and the long grouping sheet any one is sent to next node to the above-mentioned grouping that receives.
3. wireless base station according to claim 1, it is characterized in that, above-mentioned cost calculation portion is when receiving cost calculation request grouping, at based on above-mentioned each big or small benchmark that divides into groups, calculate the link cost of the channel between previous node and the above-mentioned wireless base station, result of calculation is written in the above-mentioned cost calculation request grouping;
Above-mentioned receiving and transmitting part sends to adjacent node to the cost calculation request grouping that writes the aforementioned calculation result.
4. the packet transfer route optimization method in the wireless network is characterized in that this wireless network comprises a plurality of wireless base stations, and said method may further comprise the steps:
At each big or small benchmark that divides into groups, consider that the transfer rate of channel is calculated link cost;
A plurality of routing tables are set, and each routing table is recording destination information and transfer path explicitly, and this routing table is to state the relevant a plurality of different benchmark of grouping size and generate according to above-mentioned link cost accordingly with catching up with;
The grouping size of this grouping when receiving grouping, is judged in a wireless base station in above-mentioned a plurality of wireless base stations;
According to above-mentioned judged result, according in above-mentioned a plurality of routing tables one is sent to next node to above-mentioned grouping.
5. packet transfer route optimization method according to claim 4 is characterized in that, and is further comprising the steps of:
When receiving cost calculation request grouping in one of above-mentioned wireless base station, at above-mentioned each big or small benchmark that divides into groups, the transfer rate of consideration link is calculated the link cost between a last node and the above-mentioned wireless base station;
The aforementioned calculation result is written in the above-mentioned cost calculation request grouping, and sends it to contiguous wireless base station;
At above-mentioned each big or small benchmark that divides into groups, select the path of the minimum arrival destination of link cost; And
According to above-mentioned selected path, upgrade each routing table of above-mentioned each wireless base station.
Applications Claiming Priority (6)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP2004-041604 | 2004-02-18 | ||
| JP2004041604 | 2004-02-18 | ||
| JP2004041604 | 2004-02-18 | ||
| JP2004277495 | 2004-09-24 | ||
| JP2004-277495 | 2004-09-24 | ||
| JP2004277495 | 2004-09-24 |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100085161A Division CN100413271C (en) | 2004-02-18 | 2005-02-18 | Packet transfer system, radio base station, and packet transfer route optimization method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101039279A CN101039279A (en) | 2007-09-19 |
| CN101039279B true CN101039279B (en) | 2010-05-26 |
Family
ID=37779381
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2005800053864A Expired - Fee Related CN1922832B (en) | 2004-02-18 | 2005-02-17 | Packet transmission system, wireless base station, and route optimization method for packet transmission |
| CN2007100958025A Expired - Fee Related CN101039279B (en) | 2004-02-18 | 2005-02-18 | Wireless base station and packet transmission path optimization method |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2005800053864A Expired - Fee Related CN1922832B (en) | 2004-02-18 | 2005-02-17 | Packet transmission system, wireless base station, and route optimization method for packet transmission |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN1922832B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1922832B (en) * | 2004-02-18 | 2011-08-17 | 株式会社Ntt都科摩 | Packet transmission system, wireless base station, and route optimization method for packet transmission |
| WO2011048693A1 (en) | 2009-10-23 | 2011-04-28 | 富士通株式会社 | Communication system |
| CN104025658A (en) * | 2012-01-25 | 2014-09-03 | 株式会社日立制作所 | Wireless communication system, control apparatus, and wireless communication method |
| KR102207987B1 (en) * | 2013-07-10 | 2021-01-26 | 주식회사 케이티 | Method for transmitting data in wireless local area network system and apparatus therefor |
| US11665590B2 (en) * | 2018-04-04 | 2023-05-30 | Mitsubishi Electric Corporation | Data communication method, hub station, and earth station |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0849974A2 (en) * | 1996-12-20 | 1998-06-24 | Nokia Mobile Phones Ltd. | Method for flexible use of a tree topology in a wireless ATM system |
| US5872773A (en) * | 1996-05-17 | 1999-02-16 | Lucent Technologies Inc. | Virtual trees routing protocol for an ATM-based mobile network |
| JP2000261499A (en) * | 1999-03-05 | 2000-09-22 | Ntt Data Corp | Traffic distribution method and communication system |
| JP2001313656A (en) * | 2000-04-28 | 2001-11-09 | Sony Corp | Base station device, terminal device, and system and method for radio communication |
| CN1922832A (en) * | 2004-02-18 | 2007-02-28 | 株式会社Ntt都科摩 | Packet transmission system, wireless base station, and route optimization method for packet transmission |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6810259B1 (en) * | 1999-12-16 | 2004-10-26 | Utstarcom Inc. | Location update protocol |
-
2005
- 2005-02-17 CN CN2005800053864A patent/CN1922832B/en not_active Expired - Fee Related
- 2005-02-18 CN CN2007100958025A patent/CN101039279B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5872773A (en) * | 1996-05-17 | 1999-02-16 | Lucent Technologies Inc. | Virtual trees routing protocol for an ATM-based mobile network |
| EP0849974A2 (en) * | 1996-12-20 | 1998-06-24 | Nokia Mobile Phones Ltd. | Method for flexible use of a tree topology in a wireless ATM system |
| JP2000261499A (en) * | 1999-03-05 | 2000-09-22 | Ntt Data Corp | Traffic distribution method and communication system |
| JP2001313656A (en) * | 2000-04-28 | 2001-11-09 | Sony Corp | Base station device, terminal device, and system and method for radio communication |
| CN1922832A (en) * | 2004-02-18 | 2007-02-28 | 株式会社Ntt都科摩 | Packet transmission system, wireless base station, and route optimization method for packet transmission |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101039279A (en) | 2007-09-19 |
| CN1922832A (en) | 2007-02-28 |
| CN1922832B (en) | 2011-08-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100413271C (en) | Packet transfer system, radio base station, and packet transfer route optimization method | |
| CN100366016C (en) | Wireless communications apparatus and routing control and packet transmission technique in wireless network | |
| CN100446493C (en) | Controller apparatus, mobile terminal, and communication control method | |
| EP2127423A1 (en) | A method and apparatus for selecting an access point or relay node in a multi-hop wireless network | |
| US20050169206A1 (en) | Relay apparatus, communication system and relay method | |
| CN1679359A (en) | Multi-channel mobile ad hoc network | |
| JP2011514117A5 (en) | ||
| CN102017780A (en) | Apparatus and methods for transmitting data over a wireless mesh network | |
| CN101686203A (en) | Method of managing a network having a plurality of nodes | |
| MX2014006020A (en) | Non-intrusive in-band link cost estimation in multihop networks. | |
| CN101039279B (en) | Wireless base station and packet transmission path optimization method | |
| CN110167100A (en) | The selection method of relay node in a kind of Internet of Things | |
| KR20190087218A (en) | Communication system via the satellite communications network | |
| CN108307411B (en) | Mobile self-organizing network self-adaptive gateway selection method based on biological elicitation | |
| JP2013141270A (en) | Joint association, routing and rate allocation in wireless multi-hop mesh networks | |
| JP4754463B2 (en) | Communication route selection control device, wireless device, and communication route selection method | |
| JP5431416B2 (en) | Wireless communication system and wireless communication method | |
| CN110267317A (en) | A kind of Wireless MESH network control method and controller | |
| CN116249176B (en) | Route establishment method, node and system of variable channel bandwidth wireless ad hoc network | |
| Nori et al. | Backflip: Backpressure routing in ipv6-based wireless sensor networks | |
| KR20090077594A (en) | Qos mesh data frame format and qos control method for transmitting the mesh data frame | |
| CN115802440A (en) | Topology discovery and route issuing method combining wireless ad hoc network and SDN | |
| Frías González | Analysis of interworking functions in heterogeneous networks |
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: 20100526 Termination date: 20200218 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |