CN103220806B - For the connection set up in multihop network quick/opportunistic distributed resource redistributes - Google Patents
For the connection set up in multihop network quick/opportunistic distributed resource redistributes Download PDFInfo
- Publication number
- CN103220806B CN103220806B CN201210576605.6A CN201210576605A CN103220806B CN 103220806 B CN103220806 B CN 103220806B CN 201210576605 A CN201210576605 A CN 201210576605A CN 103220806 B CN103220806 B CN 103220806B
- Authority
- CN
- China
- Prior art keywords
- node
- connection
- multihop network
- network
- change
- 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
Abstract
The multihop network (100,400) implementing reaction formula routing agreement and node (102a-102q and A-G) are described herein, topology change in a distributed manner/opportunistic mode that this agreement enables the resource of multihop network (100,400) respond in multihop network (100,400) adjusts with continuing, with the performance of connection optimized between source node (102a, A) and object node (102m, E). The type of adjustable resource comprises such as: (1) route; (2) channel; And/or (3) physical layer parameter. And, it is possible to the dissimilar topology change of generation comprises such as: the movement of (1) node (102a-102q and A-G); (2) quality change of channel between source node (102a, A) and object node (102m, E); (3) change of business model in multihop network (100,400); (4) change of emission mode in multihop network (100,400) (such as power, wave beam forming direction); And the change of resources allocation in (5) multihop network (100,400).
Description
Background of invention
Invention field
The present invention relates generally to a kind of multihop network implementing reaction formula routing agreement, node uses this agreement to continue the resource of adjustment multihop network to the topology change responding in multihop network, with the performance of connection optimized between source node and object node.
Description of Related Art
The intrinsic problem of multihop network (wireless self-organization network) is that they have the topology changed in time, because node is mobile, this may cause the disconnecting between for two nodes of specific connection relaying business. Other reasons causing topology to change in time some are also had except mobile node. Such as, topology change may occur in when even not having node motion, the change of the change that the mobile object such as reflected thereon by radiowave causes or communication media. These topology changes comprise such as, and (and/or interference channel) channel variation own, business model change, emission mode changes and resources allocation change. Changing to adapt to these topologys, multihop network can adopt proactive routing protocol or reaction formula routing agreement. In the multihop network adopting proactive routing protocol, usually adjust topology by lasting the routing path upgraded between node and change. And, in the multihop network adopting reaction formula routing agreement, in the process being commonly referred to the route discovery stage, first set up the routing path between node. Once path has been set up, then forward the route maintenance stage to. When topology changes, this stage be responsible for maintenance activity source/destination between path, such as, when causing disconnecting when two nodes on the path towards object node have been removed too far, then call route repair process (part of route maintenance stage) and operate the connection attempted and repair between node as recovery. If this recovery operation is unsuccessful, then the path performing a new round is needed to find. The example of reaction formula routing agreement be included in IETFMANET working group exploitation AODV (self-organization demand distance vector) and DSR (dynamic source routing), they are had description by following document:
" self-organization demand distance vector routing " (C.Perkins, E.M.Royer and S.R.Das, " AdHocOn-demandDistanceVectorRouting ", RFC3561,2003 July).
" the dynamic source routing in ad hoc deployed wireless networks " (D.Johnson and D.Maltz, " DynamicSourceRoutinginAdHocWirelessNetworks ", draft-ietf-manet-dsr-09.txt, in April, 2003).
The content of these documents is thus incorporated into herein by reference.
Although these routing agreements are generally done well, but they still have shortcoming, they cannot accomplish the performance of the connection being enough between optimization two nodes. The multihop network of the new reaction formula routing agreement of the performance of the connection between optimization two nodes is implemented consequently, it is desirable to a kind of. This demand and other demands is met by the multihop network of the present invention, node and method.
Invention general introduction
The present invention comprises a kind of multihop network implementing reaction formula routing agreement, topology change in a distributed manner/opportunistic mode that this agreement enables node respond in multihop network continues adjustment network resource, with the performance of connection optimized between source node and object node. The type of adjustable resource comprises such as: (1) route; (2) channel; And/or (3) physical layer parameter. And, it is possible to the dissimilar topology change of generation comprises such as: the movement of (1) node; (2) quality change of channel between source node and object node; (3) change of business model in multihop network; (4) change of emission mode in multihop network (such as power, wave beam forming direction); And the change of resources allocation in (5) multihop network (100,400).
Brief Description Of Drawings
More complete understanding of the invention can be obtained by reference to the accompanying drawings, in figure with reference to following detailed explanation simultaneously:
Fig. 1 is the block diagram that the exemplary multihop network according to the present invention with the node implementing reaction formula routing agreement is described;
Fig. 2 illustrates according to the present invention for implementing the schema of the step of the preferred method of reaction formula routing agreement in the multihop network of Fig. 1;
Fig. 3 is the block diagram of the demonstration beacon can launched from the movable node in the multihop network of Fig. 1 according to the step 202 in the method for Fig. 2; And
Fig. 4 A-4D illustrates the block diagram that reaction formula routing agreement can be used to the different modes of the route that adjusts in the multihop network of Fig. 1 between source node and object node.
The detailed explanation of accompanying drawing
With reference to figure 1, the block diagram of a kind of exemplary multihop network 100 is disclosed, it have implement the reaction formula routing agreement according to the method 200 of the present invention node 102a, 102b ..., 102q (illustrating 17). As shown in the figure, multihop network 100 have multiple in wireless media operation node 102a, 102b ..., 102q, wherein between two node (such as) 102a and 102m send business be called stream 104 (illustrating 1). Transmission of starting is called source node 102a at the node of the data flowed in 104, and the node of terminated data is called object node 102m. Instantaneous at each, multihop network 100 can have zero, one or more stream 104 any between two node 102a, 102b ..., 102q. Each stream 104 is connecting carrying in 106, the only connection 106 between 102a and the 102m of node shown in it. Should be realized that multiple stream 104 can be multiplexed into connect in 106, and for each source node 102a and multiple connection 106 can be set up for each object node 102m. In addition, identical source node 102a can have with object node 102m and multiple is connected 106 and multiple stream 104. Limit each connection 106 by path 108 (route) and to characterize by following item: the identity of (1) movable node (such as) 102a, 102f, 102h, 102k, 102k and 102m; (2) channel; And (3) are along the link parameter in path 108. In alternative embodiments of the present invention, connect 106 to characterize by following item: (1) path 108; (2) link parameter; And (3) transmitting example. The connection 106 of a rear type is associated with non-slotted transmissions in the time domain, and the connection 106 of former type is more towards TDMA (time division multiple access), FDMA (frequency division multiple access) and OFDMA (the many locations of orthogonal frequency).
As shown in the figure, path 108 by forming the adjacent active nodes 102a that connects 106, relatively short chain road between 102f, 102h, 102k, 102k and 102m forms. The parameter of the link being associated with the transmitting of the stream 104 along path 108 is characterized by such as following item: (1) transmitted power; (2) modulate; (3) direction; And (4) MIMO (multiple-input and multiple-output) parameter. And, the parameter of link being associated with the reception of the stream 104 along path 108 can comprise such as tuning information about antenna array, and prerequisite is that these parameters are used. Each connects 106 and usually has upper data rate limit, and stream 104 can use part or all of bandwidth of available data speed. Node 102a in reach each other, 102b ..., 102q are called adjacent node. Term " in reach " has some definition. Such as, as long as no matter when when when sending node uses maximum permission transmitted power and there is not interfering nodes a node when receiving, there is the average SNR (signal/noise ratio) exceeding predetermined level, these nodes can at " in reach " each other. Finally, it should be appreciated that the communication in multihop network 100 is on separate channels which are typically orthogonal, therefore should be unable to be interfering with each other. And, to one other channel, node 102a, 102b ..., 102q are called that channel switches from a channel-changing.
According to the present invention, each node in node 102a in multihop network 100,102b ..., 102q implements significantly improved reaction formula routing agreement (method 200) on aforementioned popular response formula routing agreement. Equally, the shortcoming of the performance of connection that cannot accomplish to be enough to optimize between two nodes is had as the popular response formula routing agreement of AODV and DSR. By implementing, a kind of new reaction formula routing agreement (method 200) solves this needs to the multihop network 100 of the present invention, in this new reaction formula routing protocol responses multihop network 100 topology change adjustment multihop network 100 in one or more resource, with optimize between source node 102a and object node 102m connect 106 performance. The type of adjustable resource comprises such as: (1) route; (2) channel; And/or (3) physical layer parameter. And, it is possible to the dissimilar topology change of generation comprises such as: the movement of (1) node 102a, 102b ..., 102q; (2) quality change (be not necessarily only limitted to the link of connection forwarding data for considering, and the link of use can be substituted in addition) of channel between source node 102a and object node 102m; (3) change of business model in multihop network 100; (4) change of emission mode in multihop network 100 (such as power, wave beam forming direction); And the change of resources allocation in (5) multihop network 100. There is provided about the different aspect of reaction formula routing agreement (method 200) and being described in more detail of feature below with reference to Fig. 2-4.
With reference to figure 2, there is the schema of the step that the preferred method 200 for implementing reaction formula routing agreement in multihop network 100 is described. Start from step 202, be positioned at connect 106 movable node (such as) 102a, 102f, 102h, 102i, 1021 and 102m launch containing the beacon 302 (see Fig. 3) of one or more performance measurement connecting 106. In an embodiment, it is possible to a frame 304 once generates beacon 302, beacon comprises control part 306 and TDMA data carrying portion 308. Beacon 302 can be specified mini timeslot 310, so as it can not with the beacon 302 (not shown) conflict launched from adjacent node. Beacon 302 can be launched with certain power level and data speed so that when select this power level have with beacon 302 when data speed equally far away with other message sent by node 102a, 102f, 102h, 102k, 102l and 102m or than farther reaching.
Beacon 302 also comprises general broadcast part 312 and connects specific part 314. In general broadcast part 312, the power of instruction beacon 302. This makes any node 102a of " in reach ", 102b ..., 102q can determine open loop path loss. Also indicate the ID of transmitting node (such as) 102a, 102f, 102h, 102i, 102k or 102m. Connecting in specific part 314, it is possible to instruction connection ID, connection speed, transmitting/receiving ID and/or transmitted power/CIR (carrier-in-interference ratio). In addition, the performance measurement that specific part 314 indicates each to connect 106 is connected. Performance measurement can be the cumulative cost of whole connection 106. Each time gap or the maximum allowable power P of Equivalent conjunctionmaxIt it is another performance measurement. PmaxReflection transmitting node 102a, 102f, 102h, 102k, 102k or 102m power capability maybe can use and can not the peak power that be connected 106 interfere ongoing with other.
In step 204, adjacent node (such as) 102b, 102d, 102e, 102g, 102i, 102j, 102q, 102p and/or 102o receive from one or more beacon 302 that movable node 102a, 102f, 102h, 102k, 102k and 102m launch. Movable node 102a, 102f, 102h, 102k, 102k or 102m also receive the beacon 302 launched from other movable node 102a, 102f, 102h, 102k, 102l or 102m. Such as, movable node 102f and 102k receives beacon 302 from movable node 102h.
In step 206, each adjacent node 102b, 102d, 102e, 102g, 102i, 102j, 102q, 102p and/or 102o calculate cost function based on the performance measurement in each beacon 302 received and other information (optionally). Similarly, each movable node 102a, 102f, 102h, 102k, 102k and/or 102m calculate cost function based on the performance measurement in each beacon 302 received and other information (optionally).
In step 208, each adjacent node 102b, 102d, 102e, 102g, 102i, 102j, 102q, 102p and/or 102o and movable node 102a, 102f, 102h, 102k, 102k or 102m determine whether the cost function of the connection 106 that can improve between source node 102a and object node 102m by least one resource (such as route, channel and/or physical layer parameter) in adjustment multihop network 100. If the answer in step 208 is "Yes", then by adjacent node (such as) 102g being correlated with or movable node (such as) 102f to perform step 210, adjust at least one resource to improve between source node 102a and object node 102m connect 106 cost function. Usually, adjacent node (such as) 102g can as adjusted route resource below with reference to Fig. 4 A, 4B and 4D in greater detail. And, movable node (such as) 102f can as adjusted route resource, channel resource or physical layer parameter resource with reference to figure 4C in greater detail. In an embodiment, when the average behaviour such as average path loss using topology to change determines whether to improve the cost function being connected 106 between source node 102a with object node 102m, relevant adjacent node (such as) 102g or movable node (such as) 102f can adjust in a distributed way quickly or redistribute resource. In another embodiment, when the performance measurement using the instantaneous or real-time topology such as instantaneous CIR to change determines whether to improve the cost function being connected 106 between source node 102a with object node 102m, relevant adjacent node (such as) 102g or movable node (such as) 102f can adjust in opportunistic mode or redistribute resource. In any one embodiment, relevant adjacent node (such as) 102g or movable node (such as) 102f be allowed to when adjust can not another connects in negative impact multihop network 100 performance adjustresources. If the answer in step 208 is "No", then performing step 212, wherein adjacent node 102b, 102d, 102e, 102g, 102i, 102j, 102q, 102p and/or 102o or movable node 102a, 102f, 102h, 102k, 102k or 102m are the resource connected in 106 between maintenance source node 102a and object node 102m.
There is provided about using method 200 and reaction formula routing agreement being described in more detail of some different modes of the route between source node and object node can be adjusted below with reference to Fig. 4 A-4D. In order to describe some features of the present invention better, the multihop network 400 below used has and more simply configures than multihop network 100. , it should be noted that the quantity of the node illustrated in multihop network 100 and 400 is selected for simplified illustration, certainly and the quantity of node and their configuration should not be limitation of the present invention.
With reference to figure 4A4D, about the route that how can adjust the connection between source node A and object node E according to the step 210 of method 200, four kinds of basic conditions are shown. In the first situation shown in Fig. 4 A, node F is at time t0Monitor beacon 302 (not shown) sent by movable node (such as) B and D. Then at time t1, oneself is inserted this connection by node F, and is got rid of from the connection between source node A and object node E by node C, and prerequisite is the step 206 according to method 200,208 and 210 optimization aim cost functions. It should be noted that in other examples of this situation and reaction formula routing agreement the following stated of adjustresources in a distributed way, then preferably once occur an event to avoid concurrent adjustment.
In the 2nd shown in Fig. 4 B kind situation, node F is at time t0Monitor beacon 302 (not shown) sent by movable node (such as) A, B, C, D and E. Then at time t1, oneself is inserted this connection by node F, and multiple Node B, C and D is got rid of from the connection between source node A and object node E, and prerequisite is the step 206 according to method 200,208 and 210 optimization aim cost functions.
In the third situation shown in Fig. 4 C, movable node C is at time t0Monitor beacon 302 (not shown) sent by movable node (such as) B and D. Then at time t1, node C notices that it provides time shortest path and starts path changing, and wherein oneself is got rid of by it from the connection between source node �� and object node E, and prerequisite is the step 206 according to method 200,208 and 210 optimization aim cost functions. As appears, movable node C can step 204,206,208 and 210 in manner of execution 200 in this case.
Relevant how can implement this three kinds of situations according to method 200, there is some modes. In one example in which, a good selection utilizes along the cumulative cost (performance measurement) of path profile and statement in beacon 3 () 2. Then can by the cost along path and by listen for beacons 302 and check that whether it should insert/get rid of the determined cost compare of node of oneself in the connection between source node A and object node E.
In another example, it is possible to use transmitted power (performance measurement) is as cost metric. Such as, it is contemplated that estimate the node j of the cost of node j+1 based on the real cost from node j-1. The cost produced from node j-1 to j and from node j to j+1 represents with �� C and relevant index. Overall estimate cost at node j+1 is then:
If the cost estimated is lower than old existing cost, then consider new route, as follows:
De Erta cost �� C with meet SNR target ��0Minimum power needed for (desired rate for considering) is relevant. For node j-1 to j, it is possible to be calculated as follows minimum power P:
Wherein DJ-1, jIt is the path gain from node j-1 to j, andIt is receiver noise and the interference power of node j. , it is also possible to guarantee that any node (in the present example for node j-2) is not allowed to be strong enough to the power emission that the CIR of other existing connections is reduced to their respective below target CIR, in addition as follows:
When can be each, gap (and being thus that each connects) determines the P of nodemax, and distribute P with beacon 302max. For each channel preferably performs this process, thus make node j it may also be determined that preferred channels. Except above-mentioned power minimization criteria and CIR ensure criterion, it is also possible to comprise other criterions. The example of this type of criterion can comprise the condition of the filtering (such as time average) of cost, delayed (to avoid (ping-pong) effect of rattling) and time correlation.
Is that only oneself is inserted the connection 406 between source node A and object node E by a node F shown in Fig. 4 A-4B. But, it is also possible in a similar manner by providing the connection (see Fig. 4 D) between the chain insertion source node A and object node E of node F and G minimized for cost function path. Specifically, node F and G is at time t0Monitor beacon 302 (not shown) sent by movable node (such as) A, B, C, D and E. Then at time t1, they oneself are inserted this connection by node F and G, and are got rid of from the connection between source node A and object node E by multiple node C and D, and prerequisite is the step 206 according to method 200,208 and 210 optimization aim cost functions.
Enabling node F and G insert a kind of mode of connection, a kind of mode as shown in fig.4d builds along connecting and draws (reasonably growing) shortest path tree from each node A, B, C, D and E. When with existing be connected path compare time, through node F and G so that the shortest path through the downstream of existing connection assessment whether improve by any shortest path tree offer cost. Similar to first and second kinds of situations shown in Fig. 4 A with 4B, node F and G is not a part for existing connection, but belonging to and take root one or more shortest path tree in one or more node along this connection, they can initiatively insert they oneself under the prerequisite finding the path improved. In order to limit the complicacy of the present embodiment, the jump of limited quantity can be allowed for shortest path tree.
In order to implement the situation shown in Fig. 4 D, objective cost function can also in conjunction with fringe cost factor Cextr, it guarantees to become near by any adjustment of step 210 to the direction using shortest path to connect source node A and object node E. This additional cost factor can be determined as follows, wherein each node use (such as) Bel graceful-Ford (BellmanFord) algorithm generates shortest path tree (performance measurement) by slow active routing. Then each node i have from it oneself to the cost of each other node j. This cost table is illustrated as Cij. Then node i as follows can become originally to determine this additional cost according to it to any two node S and D (not shown):
Cextra=f (CiS, CiD)
Wherein this function can be addition or multiplication. This guarantees that this additional cost increases further from source node and object node with node i. Then together with also by simple addition or other computings this cost being included in the basic cost determination result in step 208.
Refer again to the set-up procedure 210 in method 200, should be realized that the topology change that reaction formula routing agreement can enable the resource of multihop network 100 and 400 respond in multihop network 100 and 400 adjusts with " distributed way ", with the performance of connection optimized between source node and object node. For the distributed operation done very well, namely avoid the time contest between control signal to cause poor efficiency optimization (or potential deadlock), it may be necessary to control signal is implemented special scheduling potentially. This scheduling is arranged in such a way: an event in this area and resource optimization preferably once only occur. This kind of feature, we represent for local atomicity (locallyatomic). In order to guarantee the local atomicity of multihop network 100 and 400 for service control, wherein once only there is an event, multihop network 100 and 400 can use any distributed multiple access protocol with required feature, such as the agreement described in document " SEEDEX: the MAC protocol of self-organizing network " (" SEEDEX:AMACprotocolforadhocnetworks " Mobilhoc2001proceedings) of the people such as R.Rozovsky, its content is incorporated into herein. Except when using when redistributing resource outside multiple access protocol, it is also possible to use when specifying the launch time of beacon 302.
According to above, those skilled in the art will readily recognize that, the present invention provide a kind of help the connection between optimization source node and object node performance or the multihop network of quality, node and reaction formula routing agreement. As disclosed, the present invention's operation continues the resource of adjustment multihop network to respond the topology change of multihop network, with the performance of connection optimized between source and object node. When responding topology and change adjustment connection, it is possible to jointly and lastingly adjust route, channel and physics (such as power) layer parameter. In another embodiment, resource adjustment can enough soon to occur in the time scale (timescale) of the transient channel fluctuation and traffic fluctuations of following the transient channel fluctuation such as caused by channel fading, this such resource adjustment solid can have the opportunistic feature of the peak value utilizing channel device meeting.
It is some additional features of the multihop network of the present invention, node and reaction formula routing agreement, advantage and application as follows:
Can being associated with self-organizing network by multihop network, its interior joint great majority are mobile and there is not Central co-ordination Infrastructure. Node in this kind of network can be laptop computer, mobile telephone and/or personal digital assistant (PDA). But, when node is fixing, it is possible to application multihop network. A this kind of occasion by target of rural area Internet access and uses the stationary nodes being connected to roof, lamppost etc.
One advantage of the present invention is that when be approximately or be greater than the resource assignation time of response the relevant time occur channel fluctuation time, then the channel assignment in multihop network will be opportunistic.
Yet another advantage of the present invention is that, jointly and lastingly optimize multilayer function, this ensures the performance improved in multihop network.
Although it is shown in the drawings and in aforesaid detailed explanation, describe some embodiments of the present invention, however, it should be understood that the present invention is not limited to the disclosed embodiments, but can carry out under the prerequisite of spirit of the present invention set forth by following claim book and limit multiple rearranging, revise and replacing not deviating from.
Claims (16)
1. the method (200) of the performance of connection (106) for optimizing in multihop network (100,400) between source node (102a, A) and object node (102m, E), described multihop network (100,400) comprises described source node (102a, A), at least one adjacent node (102b, 102d, 102e, 102g, 102i, 102j, 102p, 102o, F and G), at least one movable node (102f, 102h, 102k, 102l, B, C and D), and described object node (102m, E)
Wherein, described adjacent node (102b, 102d, 102e, 102g, 102i, 102j, 102p, 102o, F and G) is in the reach of described source node (102a, A), at least one movable node (102f, 102h, 102k, 102l, B, C and D) described and described object node (102m, E);
Wherein, described multihop network (100,400) has topology;
Wherein, in the connection (106) of described movable node (102f, 102h, 102k, 102l, B, C and D) between described source node and described object node;
Wherein, described method comprises:
At described movable node, receiving from another movable node and launch the beacon of (202) performance measurement containing the described connection (106) between described source node and described object node to adjacent node, the described performance measurement being included in described beacon changes relevant with the topology of described multihop network (100,400);
Wherein, described topology change comprise following in one or more:
The movement of one of node;
The quality change of the channel between described source node (102a, A) and described object node (102m, E), described quality change comprises channel fading;
The change of the pattern of data service in described multihop network (100,400);
The change of the emission mode of data service in described multihop network (100,400); Or
The change of the distribution of network resource in described multihop network (100,400);
Based on the performance measurement being included in described beacon, determine that described topology changes at described movable node or described adjacent node; It is characterized in that
Described node realizes reaction formula routing agreement; And wherein said method comprises further:
Change in response to the described topology in described multihop network, the network resource of described multihop network are adjusted in a distributed way, to optimize the performance of the connection (106) between described source node (102a, A) and described object node (102m, E) by described adjacent node or described movable node;
Described distributed way once provides a resource adjustment;
Wherein, described network resource comprise following in one or more:
Route (108);
Channel; Or
Physical layer parameter; And
Wherein, described connection between described source node and described object node is defined by described route (108) and described channel.
2. the method for claim 1, wherein, described multihop network is wireless multi-hop network; And wherein said method comprises further:
Described data service is launched between described source node (102a, A) and described object node (102m, E).
3. the method for claim 1, wherein, described adjacent node or described movable node respond the instantaneous topology in described multihop network and change, and adjust described resource in opportunistic mode.
4. the method for claim 1, the adjustment of the described distributed way wherein undertaken by described adjacent node or described movable node comprises further:
At least one adjacent node (F, G) is inserted the connection between described source node and described object node; And
At least one movable node (C, D) is removed, and described distributed way once provides a resource adjustment from the connection between described source node and described object node.
5. the method for claim 1, the adjustment of the described distributed way wherein undertaken by described adjacent node or described movable node comprises further:
At least one in described movable node (C, D) is removed, and described distributed way once provides a resource adjustment from the connection between described source node and described object node.
6. method as claimed in claim 2, wherein, described movable node performs the following step:
The beacon (302) of the performance measurement of transmitting (202) containing the described connection between described source node and described object node; And wherein, described being associated described connection between at least one adjacent node (102b, 102d, 102e, 102g, 102i, 102j, 102p, 102o, F and G) with described source node and described object node, wherein, described adjacent node performs the following step: receive the beacon that (204) launch; (206) cost function is calculated based on the performance measurement in the beacon received;
If for the described connection between described source node and described object node, it is possible to relative to signal/noise ratio, power, carrier-in-interference than improving cost function, then adjust the network resource in (210) described wireless multi-hop network.
7. method as claimed in claim 6, wherein, described beacon comprises general broadcast part part relevant with the connection containing performance measurement, and described performance measurement comprises:
The cumulative cost of the connection between described source node and described object node; Or
The maximum allowable power of launch activities node.
8. a multihop network (100,400), comprising:
Source node (102a, A);
At least one adjacent node (102b, 102d, 102e, 102g, 102i, 102j, 102p, 102o, F and G);
At least one movable node (102f, 102h, 102k, 102l, B, C and D); And
Object node (102m, E),
Wherein, described adjacent node (102b, 102d, 102e, 102g, 102i, 102j, 102p, 102o, F and G) is in the reach of described source node (102a, A), at least one movable node (102f, 102h, 102k, 102l, B, C and D) described and described object node (102m, E);
Wherein, described multihop network (100,400) has topology;
Wherein, described movable node (102f, 102h, 102k, 102l, B, C and D) it is positioned at described source node (102a, and described object node (102m A), E) in the connection (106) between, and can receive from another movable node and launch (202) containing described source node (102a to adjacent node, and described object node (102m A), the beacon of the performance measurement of the described connection (106) between E), the described performance measurement being included in described beacon and described multihop network (100, 400) topology change is relevant,
Wherein, described topology change comprise following in one or more:
The movement of one of node;
The quality change of the channel between described source node (102a, A) and described object node (102m, E), described quality change comprises channel fading;
The change of the pattern of data service in described multihop network (100,400);
The change of the emission mode of data service in described multihop network (100,400); Or
The change of the distribution of network resource in described multihop network (100,400);
It is characterized in that
Described node realizes reaction formula routing agreement, wherein: change in response to the described topology in described multihop network (100,400), the network resource of described multihop network (100,400) are adjusted in a distributed way by described adjacent node or described movable node, to optimize the performance of the connection (106) between described source node (102a, A) and described object node (102m, E), determine that described topology changes based on the described performance measurement being included in described beacon and occur;
Described distributed way once provides a resource adjustment;
Wherein, described network resource comprise following in one or more:
Route (108);
Channel; Or
Physical layer parameter; And
Wherein, described connection (106) between described source node (102a, A) and described object node (102m, E) is defined by described route (108) and described channel.
9. multihop network as claimed in claim 8, wherein said multihop network is wireless multi-hop network; And wherein said data service is launched between described source node (102a, A) and described object node (102m, E).
10. multihop network as claimed in claim 8, wherein, described adjacent node or described movable node respond the instantaneous topology in described multihop network (100,400) and change, and adjust described resource in opportunistic mode.
11. multihop networks as claimed in claim 8, wherein said adjacent node or the described movable node described resource of adjustment in a distributed way, wherein inserts the connection between described source node and described object node by least one adjacent node (F, G); And remove at least one movable node (C, D) from the connection between described source node and described object node, and described distributed way once provides a resource adjustment.
12. multihop networks as claimed in claim 8, wherein, described adjacent node or the described movable node described resource of adjustment in a distributed way, from the connection between described source node and described object node, wherein remove at least one in described movable node (C, D), and described distributed way once provides a resource adjustment.
13. multihop networks as claimed in claim 9, wherein, described movable node performs the following step:
The beacon (302) of the performance measurement of transmitting (202) containing the described connection between described source node and described object node; And wherein, described being associated described connection between at least one adjacent node (102b, 102d, 102e, 102g, 102i, 102j, 102p, 102o, F and G) with described source node and described object node, wherein, described adjacent node performs the following step: receive the beacon that (204) launch; (206) cost function is calculated based on the performance measurement in the beacon received;
If for the described connection between described source node and described object node, it is possible to relative to signal/noise ratio, power, carrier-in-interference than improving cost function, then adjust the network resource in (210) described wireless multi-hop network.
14. multihop networks as claimed in claim 13, wherein said beacon comprises general broadcast part part relevant with the connection containing performance measurement, and described performance measurement comprises:
The cumulative cost of the connection between described source node and described object node; Or
The maximum allowable power of launch activities node.
15. 1 kinds of nodes (102b, 102d-l, 102p-o, B-D, F, G) of the performance of connection (106) for optimizing in multihop network (100,400) between source node (102a, A) and object node (102m, E)
Wherein, described node is in the reach of described source node (102a, A) and described object node (102m, E);
Wherein, described multihop network (100,400) has topology;
Wherein, described node (102f, 102h, 102k, 102l, B, C and D) can receive and launch the beacon of (202) performance measurement containing the described connection (106) between described source node (102a, A) and described object node (102m, E), and the topology change of the described performance measurement being included in described beacon and described multihop network (100,400) is relevant;
Wherein, described topology change comprise following in one or more:
The movement of one of node;
The quality change of the channel between described source node (102a, A) and described object node (102m, E), described quality change comprises channel fading;
The change of the pattern of data service in described multihop network (100,400);
The change of the emission mode of data service in described multihop network (100,400); Or
The change of the distribution of network resource in described multihop network (100,400);
It is characterized in that
Described node realizes reaction formula routing agreement, wherein: change in response to the described topology in described multihop network (100,400), the network resource of described multihop network (100,400) are adjusted in a distributed way by described node, to optimize the performance of the connection (106) between described source node (102a, A) and described object node (102m, E), determine that described topology changes based on the described performance measurement being included in described beacon and occur;
Described distributed way once provides a resource adjustment;
Wherein, described network resource comprise following in one or more:
Route (108);
Channel; Or
Physical layer parameter; And
Wherein, described connection (106) between described source node (102a, A) and described object node (102m, E) is defined by described route (108) and described channel.
16. nodes (102b, 102d-l, 102p-o, B-D, F, G) as claimed in claim 15, wherein, described node is movable node (102f, 102h, 102k, 102l, B, C and D) or adjacent node (102b, 102d, 102e, 102g, 102i, 102j, 102p, 102o, F and G), in the connection (106) of described movable node between described source node and described object node, and described adjacent node is in the reach of described source node, described movable node and described object node.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2003801108691A CN1886937A (en) | 2003-12-19 | 2003-12-19 | Fast/opportunistic distributed resource reallocation for established connections in a multihop network |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2003801108691A Division CN1886937A (en) | 2003-12-19 | 2003-12-19 | Fast/opportunistic distributed resource reallocation for established connections in a multihop network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103220806A CN103220806A (en) | 2013-07-24 |
| CN103220806B true CN103220806B (en) | 2016-06-01 |
Family
ID=48818112
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210576605.6A Expired - Fee Related CN103220806B (en) | 2003-12-19 | 2003-12-19 | For the connection set up in multihop network quick/opportunistic distributed resource redistributes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103220806B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106231633B (en) * | 2016-10-10 | 2019-12-06 | 广东工业大学 | Ad hoc communication network optimization method and system |
| CN106792972B (en) * | 2016-11-30 | 2019-06-18 | 暨南大学 | A kind of slot allocation method meeting real time data bandwidth demand |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1350730A (en) * | 1999-03-15 | 2002-05-22 | 艾利森电话股份有限公司 | Adaptive power control in a radio communications system |
-
2003
- 2003-12-19 CN CN201210576605.6A patent/CN103220806B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1350730A (en) * | 1999-03-15 | 2002-05-22 | 艾利森电话股份有限公司 | Adaptive power control in a radio communications system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103220806A (en) | 2013-07-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1698106B1 (en) | Fast/opportunistic distributed resource reallocation for established connections in a multihop network | |
| US7693119B2 (en) | Transmission power control over a wireless ad-hoc network | |
| Islam et al. | Integrated access backhaul in millimeter wave networks | |
| TWI363538B (en) | Method and system for wireless communication networks using cooperative relaying | |
| JP3811491B2 (en) | Mobile communication system, transmitting station, receiving station, relay station, and communication path determination method | |
| KR101059662B1 (en) | Methods and apparatus related to power control and/or interference management in a mixed wireless communications system supporting wan signaling and peer to peer signaling | |
| CN101517980B (en) | Architecture, protocols and frame formats for wireless multi-hop relay networks | |
| Du et al. | Interference-controlled D2D routing aided by knowledge extraction at cellular infrastructure towards ubiquitous CPS | |
| Moghaddam et al. | A device-to-device communication-based disaster response network | |
| Xia et al. | Relay selection strategy for device to device communication | |
| KR20050104409A (en) | Method and base station for the transmission of information in a cellular radio communication system extended by means of ad-hoc connections | |
| Song et al. | Optimized relaying and scheduling in cooperative Free Space Optical fronthaul/backhaul of 5G | |
| CN103220806B (en) | For the connection set up in multihop network quick/opportunistic distributed resource redistributes | |
| US8923163B2 (en) | Fast opportunistic distributed resource reallocation for established connections in a multihop network | |
| Kaufman et al. | Interference aware link discovery for device to device communication | |
| Nandiraju et al. | Adaptive state-based multi-radio multi-channel multi-path routing in wireless mesh networks | |
| KR20110008703A (en) | Partner node selecting method in the next generation mobile communication system | |
| Xin et al. | Gateway selection scheme for throughput optimization in multi-radio multi-channel wireless mesh networks | |
| Al-Hemyari et al. | Centralized scheduling, routing tree in WiMAX mesh networks | |
| Salameh et al. | Effective peer-to-peer routing in heterogeneous half-duplex and full-duplex multi-hop cognitive radio networks | |
| Laurindo et al. | Multi-criteria Analysis to Select Relay Nodes in the ORST Technique | |
| Xu | A distributed mode selection scheme for Device-to-Device communications | |
| CN102640537B (en) | Method and device for establishing service route | |
| Pyun et al. | Resource allocation scheme for multihop cellular networks using directional transmission | |
| Syed et al. | Impact of multiple frequency channels usage on the performance of TDMA-based broadband fixed cellular multihop 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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160601 Termination date: 20191219 |