CN100536429C - Method and system for data transmission in wireless net-like network - Google Patents
Method and system for data transmission in wireless net-like network Download PDFInfo
- Publication number
- CN100536429C CN100536429C CNB2006100338935A CN200610033893A CN100536429C CN 100536429 C CN100536429 C CN 100536429C CN B2006100338935 A CNB2006100338935 A CN B2006100338935A CN 200610033893 A CN200610033893 A CN 200610033893A CN 100536429 C CN100536429 C CN 100536429C
- Authority
- CN
- China
- Prior art keywords
- node
- route
- data
- route requests
- path
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The method mainly includes: route decision mechanism for finding route based on multiple criteria; and transferring data according to mode of combining source route with data stream. The system includes nodes such as source nodes, intermediate nodes and destination nodes in wireless mesh network. Node includes modules: module for finding route of using route decision mechanism based on multiple criteria to find route to destination node; data transmission module in use for transferring data to destination node according to mode of combining source route with data stream. Sensing network collision, the method and system meets requirement for balancing load on WMN network so as to satisfy designing target of maximized throughput. The invention raises stability of network, raises adaptability of network to collision, and releases conflict between network scale and spending.
Description
Technical field
The present invention relates to a kind of method of transfer of data, the method for transfer of data in particular a kind of wireless mesh network.
Background technology
Based on wireless mesh network WMN (Wireless Mesh Network) is a kind of novel broadband wireless network structure, the distributed network of promptly a kind of high power capacity, two-forty, and it is different from traditional wireless network.The all users of traditional WLAN (Wireless Local Area Network) are linked in the internet by traditional wireless access point AP (Access Point), but WLAN only allows the user in AP single-hop scope to insert, and the coverage of single-hop networks is very limited, so number of users is very limited.For the coverage that can make network is expanded greatly, must adopt the multihop network structure, promptly data of sending from source node may could arrive destination node through the forwarding of several intermediate nodes, so the route of node and forwarding capability are essential.On network topology, the basic static state of the most of nodes of WMN network does not move, and as power, change in topology is less without battery; On single-hop inserted, WMN can regard a kind of special WLAN (wireless local area network) WLAN as.Because higher reliability, bigger retractility and lower cost of investment are arranged, WMN is as the new network structure of a kind of can the solution " last kilometer " bottleneck problem, be written in IEEE 802.16 (WiMax) wireless MAN (WMAN) standard, also begun to bring in the formulation of IEEE 802.11s standard at present.
WMN mainly concentrates on single channel by criterion and research that network size is supported to the research of route, as the improvement route based on DSR such as many radio frequency links quality source routing MR-LQSR (Multi-Radio Link-Quality Source Routing).DSR (Dynamic Source Routing) DSR is a kind of route as required, and it allows node dynamically to be found to the multi-hop route of destination node.So-called source routing is meant the tabulation that carries the node of the necessary processes of all groupings before the arrival destination node at the head of each packet, promptly contains the complete route of destination node in the grouping.This point in AODV, only comprises the address of next-hop node and destination node with distance vector AODV (Ad-Hoc On-Demand Distance-Vector) is different as required in the grouping.In DSR, need not periodically broadcast the route control information, so just can reduce network bandwidth expense, avoided large-scale routing update.
DSR mainly comprises route discovery and route maintenance two large divisions.
For realizing route discovery, source node sends route requests RREQ (Route Request) grouping that contains the source routing tabulation of oneself, at this moment, has only source node in the route list.The node of receiving this grouping continues to forward this request grouping, and the address of adding oneself in the route list that has write down source node, this process repeats always, receive the request grouping up to destination node, or certain intermediate node is received the active path that divides into groups and can be provided to the destination.If node is not a certain jumping in destination node or the route, it will go ahead and transmit the route requests grouping.
Each node all has the buffer area of the route requests that a preservation receives recently, to realize not repeating to transmit paid-in request grouping.Each node all can store acquired source routing list, can reduce routing cost like this.When node is received the request grouping, at first checking to have in the route memory does not have suitable route, if having, just no longer transmits, be grouped into source node but return a routing reply RREP (Route Reply), wherein comprised the route of source node to destination node.If the request grouping has been forwarded to destination node always, so, destination node just returns a routing reply, wherein also comprised the route from the source node to the destination node, because the node of process has added this grouping request to the address of oneself, so just finished the process of whole route finding on the way.
The route maintenance procedure of DSR is as follows:
Source node can detect the change of network topology by route maintenance mechanism, thereby whether the route of knowing destination node is unavailable.When a node in the route list shifts out radio transmission range or shut down, will cause route unavailable.When upstream node finds that by media access control MAC (Medium AccessControl) layer connection is unavailable, will comprise that source node sends a routing error RERR (Route Error) information to all nodes of the upstream of using this route.Source node will be deleted all and include the route of this invalid node after receiving this RERR from its route-caching.If desired, source node can be initiated the new route that route finding process is established to former destination node again.
Described DSR uses source routing, and intermediate node need not keep up-to-date route for transmitting grouping.In DSR, do not need periodic and the neighbors exchanging routing information yet, can reduce taking of network overhead and bandwidth like this, particularly when the mobility of node is very little; Because carry complete route in the data of DSR, a node can obtain certain a part of routing iinformation that needs in the whole complete route by the packet that scanning is received.As one from node A through the route of Node B to C, mean the A node in the route of knowing node C, also can know the route of node A to B.Simultaneously mean that also Node B can be known the route of node A and C, node C can know the route of node A and B.So just can reduce and find the required network overhead of route; Simultaneously DSR is for the symmetry no requirement (NR) of link, and faster than Link State or DV reaction.
But still there are a lot of defectives in the DSR route:
The DSR route uses single channel by criterion, promptly realizes as the route criterion with the shortest jumping figure.Studies show that in most of the cases, the performance of this route criterion is not optimum.Shortest path between two nodes is often because the influence of factors such as conflict, communication distance worsens link-quality.At this moment, indexs such as end-to-end throughput, the error rate non-constant that will become.Simultaneously, single route criterion is difficult to reflect that link-quality is to each performance indexes.
Because as transmitting foundation, this made this route discovery mechanisms can only find lesser amt, and the less path of delaying time with the packet number of the route requests of whether transmitting same source node the DSR route discovery stage in the past.This mechanism makes source node lose a lot of optimal paths based on other criterions.
In addition, owing to used the shortest jumping figure to make DSR can not walk around the battleground as the route criterion, thus this route does not possess the function of load balance.
Summary of the invention
The object of the present invention is to provide the method for transfer of data in a kind of wireless mesh network, be intended to select optimum route and best data transfer mode.
Technical scheme of the present invention comprises:
The invention provides the method for transfer of data in a kind of wireless mesh network, comprising:
A, source node are found to the route of destination node based on the routing decision mechanism of multiple criteria, and wherein, steps A also comprises:
A1, source node send the route requests that contains the route criterion, and the route criterion in the described route requests of initialization;
A2, subsequent node are carried out routing reply to described route requests, and wherein, subsequent node is a destination node, and steps A 2 comprises:
A21, intermediate node judge whether to ignore described route requests, if, ignore described route requests, otherwise, carry out steps A 22, steps A 21 comprises:
A211, judge whether described intermediate node once received the route requests to destination node that source node sends, if, carry out steps A 212, otherwise, carry out steps A 22;
The relation of the bag sequence number of A212, the bag sequence number of judging the route requests that described intermediate node was once received and described route requests, if the bag sequence number of the route requests that described intermediate node was once received is then ignored described route requests greater than the bag sequence number of described route requests; If the bag sequence number of the route requests that described intermediate node was once received, is then upgraded the bag sequence number of the route requests of described intermediate node storage less than the bag sequence number of described route requests, and carries out steps A 22; If the bag sequence number of the route requests that described intermediate node was once received equals the bag sequence number of described route requests, further judge that then whether entrained than the route requests of once receiving path, the entrained path of described route requests more excellent, if, carry out steps A 22, otherwise, ignore described route requests;
A22, intermediate node search whether exist the cache way that arrives destination node by, if do not exist, transmit described route requests; Otherwise, judge that the described cache way path more entrained than described route requests by whether is more excellent, if, reply described route requests, otherwise intermediate node is transmitted described route requests, wherein, the step that described intermediate node is transmitted described route requests comprises: if described intermediate node is transmitted described route requests, then described intermediate node also will be judged: whether the formation of this node is long; Whether the life cycle of described route requests expires; Whether the current various resources of this node do not allow to transmit described route requests; Whether described route requests address area does not have enough spaces to deposit the network address of described intermediate node; If above-mentioned judged result is then ignored described route requests for being, otherwise, transmit described route requests;
A3, source node receive described routing reply;
Node on B, the described route transmits data to destination node by the mode of source routing and data flow combination.
Steps A 2 also comprises:
A23, subsequent node are upgraded the route criterion in the described route requests;
A24, subsequent node are replied the described route requests that contains path and route criterion according to specified circuit by the mode of returning.
Steps A 3 also comprises:
Non-source node in the path of A31, described routing reply extracts available path;
A32, described source node receive the described routing reply that contains path and route criterion;
A33, described source node add the described routing reply that contains path and route criterion in the route-caching to.
Described step B also comprises:
B1, source node check in the data stream list whether have the data flow that arrives destination node, if do not exist, carry out step B2; Otherwise, carry out step B3;
B2, source node establish the data flow of time restriction, if arrived described time restriction, transmit data by the mode of data flow, otherwise, transmit data by the mode of source routing;
Whether the entrained path of B3, source node judgment data is more excellent than the path of data flow, if, transmit data by the mode of source routing, otherwise, transmit data by the mode of data flow.
Also comprise:
When C, node transmission data failure, carry out route maintenance.
Described route criterion comprises the peak load of node on minimum bandwidth, bag delivery rate and the path.
Judge the quality in path by the route judgement function.
Described method is by layer link-state information of sharing module collector node of striding between network layer and the data link layer.
Described method also comprises revises MAC layer data bag maximum retransmission.
The method of transfer of data in a kind of wireless mesh network provided by the invention, owing to used based on the routing decision mechanism of multiple criteria and found route, and adopt the mode of source routing and data flow combination to carry out transfer of data, satisfied throughput-maximized design object, any no matter be applied on the radio-frequency apparatus of class WMN, such as 802.11a/b/g, can both promote network capacity by the method for software, have very strong practicality.And this method is very responsive to network conflict, and the data flow of foundation can get around battleground (focus) automatically and carry out transfer of data, has satisfied the requirement of WMN NLB; Simultaneously, described method has been considered the influence of network load.On the one hand, described method will be selected the less path of network load; On the other hand, the node that network load is very big will not transmitted route requests for other nodes.When network load was big, network can be refused the access of new business adaptively, thereby has guaranteed the proper communication of existing connection, for the user who has inserted provides to a certain extent service guarantees.In addition, described method has been revised part MAC parameter, such as modification to MAC layer data bag maximum retransmission, can make network have good fault-tolerant ability, promoted the adaptability of network to conflict, by the mutual statistics of network intrinsic information is obtained the route criterion, saved valuable wireless bandwidth resource.
Described method has been used data flow transmission mechanism on original DSR basis, greatly reduced expense, has alleviated the contradiction between network size expansion and the expense increase to a certain extent.
Description of drawings
Fig. 1 is route finding process figure of the present invention;
Fig. 2 is a hierarchical chart of the present invention.
Embodiment
Also the present invention is described in further detail in conjunction with the accompanying drawings below by specific embodiment.
The present invention uses EDSR (Enhanced Dynamic Source Routing) increased dynamic source routing, and the scheme general idea is as follows: at first, carry out route discovery based on the routing decision mechanism of multiple criteria; Secondly, adopt the mode of source routing and data flow combination to carry out transfer of data.And when the node in the route when the transmission data failure takes place in neighbor node, so described node will be initiated route maintenance procedure.
The method of transfer of data specifically comprises in the wireless mesh network of the present invention:
Step S10, carry out route discovery based on the routing decision mechanism of multiple criteria;
When certain node A need obtain to arrive the route of certain destination node D, this node A will play the part of the role of source node in whole route finding process.The idiographic flow of route discovery as shown in Figure 1.As shown in Figure 1, source node A will obtain route by following steps:
Step S101, source node A send route requests, and described route requests comprises the information such as life cycle TTL (being generally the jumping figure restriction), bag sequence number and destination address of this broadcasting route requests.Route criterion structure is contained in the EDSR packet header of described route requests, is used to deposit the performance parameter in path.Source node A is responsible for initialization route criterion value when sending route requests;
Step S102, intermediate node judge whether this node should ignore described route requests, and the project of judgement is:
Whether this node once received the route requests to destination node that source node sends, if receive, the relation of the bag sequence number of the route requests that further this node of judgement was once received and the bag sequence number of described route requests, if the bag sequence number of the route requests that this node was once received is then ignored described route requests greater than the bag sequence number of described route requests; If the bag sequence number of the route requests that this node was once received, is then upgraded the bag sequence number of the route requests of this node storage less than the bag sequence number of described route requests, and carries out step S103; If the bag sequence number of the route requests that this node was once received equals the bag sequence number of described route requests, further judge that then whether entrained than the route requests of once receiving path, the entrained path of described route requests more excellent, if not, then ignore described route requests, otherwise carry out step S103;
Step S103, intermediate node are searched route-caching and whether are had the path that arrives destination node (be called cache way by), if do not exist, transmit described route requests; Otherwise, judge that the described cache way path more entrained than described route requests by whether is more excellent, if, reply described route requests, otherwise, transmit described route requests;
When transmitting described route requests, need also to judge whether the current various resources of this node allow this node to transmit operation, such as node remaining bandwidth situation with and upstream node arrive delivery rate situation of this node or the like.
When transmitting described route requests, need also to judge whether this node queue length is long, because this represents this node in the working condition of a period of time in future, if this node self has had very big burden, it will not transmit the route requests of other node.
When transmitting described route requests, also need the TTL that judges this route requests whether to expire, and judge whether this request address district has enough spaces to deposit this meshed network address.
By this a series of judgement, can guarantee that some route requests of carrying than shortest path can arrive destination node D smoothly on the one hand, limited on the other hand and transmitted the quantity of route requests, thereby reduced the expense of network.
If when ignoring described route requests, then intermediate node is searched route-caching to the result who judges, judges whether to find the path that arrives destination node D from route-caching, if find, then need judge whether utilize this path to return source node for non-.The foundation of judging has, and the path more entrained than described route requests, this path is more excellent.Route requests in the node forwarding, will keep these sequence nodes in by network, and claim this sequence node to be the entrained path of this route requests, also can be understood as the part in the fullpath here.If then return this path; Otherwise, abandon cache way by, and transmit described route requests.Here claim that this process is that buffer memory is replied filtering,, but provide possibility for searching out better route though this operation makes the speed of path finding slack-off.The scope of suitable selection filtering route can make network performance be greatly improved.
By above judgement, final decision is to transmit described route requests, perhaps replys source node A.No matter be to reply source node A or transmit described route requests, all need to upgrade the relevant route criterion information in the entrained path of described route requests.
If transmit described route requests, then carry out step S104; Then carry out step S105 if reply source node A;
After step S104, destination node D receive described route requests, also to upgrade route criterion information, and call correlated process and carry out routing reply.Need copy to the route criterion structure in the path of described route requests and path in the routing reply data in the time of routing reply, the criterion information in path (such as the least residue bandwidth, maximum delivery rate etc.) be taken back source node A by routing reply.Take to send by the mode of returning when sending described routing reply according to specified circuit.This route is the reverse path in the entrained path of described route requests.Carry out data by reverse path and send, can guarantee the diconnected in path;
Step S105, source node A receive described routing reply and promptly can acquire the path that reaches destination node D later on, and the route criterion information in this path.Source node A with this path with and route criterion information add in the route-caching, and check whether have data to need to send in the data buffering.If have, carry out step S11;
In the routing reply stage, other node on the path hear time reply message can be from the extracting data available path, and this routing information added in the route-caching of self.
Described route requests has been considered the collection of route criterion information on the one hand, when judging whether to transmit described route requests or whether from route-caching, replying described route requests, all increased the judgement of path quality newly on the one hand in addition, thereby realized finding route based on the routing decision mechanism of multiple criteria;
S11, transmit data by the mode of source routing and data flow combination;
DSR in the past carries out transfer of data in the source routing mode, and promptly the data mode that comprises the whole piece routing information is carried out transfer of data.Consider that from practical advance EDSR of the present invention supports the data transfer mode based on data flow with technology.Whether when source node A sends data, at first checking has the data flow that arrives destination node D to exist in the data stream list.If there is no arrive the data flow of destination node D, source node A will set up an interim data stream list so, and give time restriction of this list item, and this time restriction has arrived, represent that data flow is set up end to end, can carry out transfer of data according to the mode of data flow.If this time restriction does not arrive, set up the stream mapping though represent this node, other node on the path is not set up as yet, then still needs to transmit by source routing method.If exist to arrive the data flow of destination node D, then need the quality in the path of data flow in path that comparing data carries and the data stream list.When sending certain data, source node A will search the path from route-caching, and will add in the data, and the path that claims to be added to these data this moment is the path of data carry.
If the path that source node A carries is more excellent, source node A will replace legacy data stream with the path of data carry so, and rebulid data flow.At this moment, these data will be carried out transfer of data by the mode of source routing, make nodes all on the path can both create or rebulid data flow.If the path that source node A carries is than the pairing path difference of data flow in the data stream list or equate that source node A will remove the address part in the data so, and the data flow transmission sign is set.Intermediate node is searched next jumping in the path that arrives destination node D, and is forwarded according to the routing information of destination node D storage in its data stream table.
When certain Node B in the route to neighbor node C data transmission fails takes place, Node B will be initiated route maintenance procedure so.Promptly carry out step S12;
S12, route maintenance.
Route maintenance of the present invention specifically may further comprise the steps:
S121, Node B are deleted to the link of this node this neighbor node C from route-caching;
S122, Node B check that whether the route transmission mistake number of described data surpasses maximum route transmission improper value, then ignores this data if surpass.Otherwise, revise the route transmission mistake of described data, and carry out step S123;
Data will be revised original path by intermediate node because of link failure, utilize new route to transmit, and the modification of a transmission path is called a route transmission mistake.Such as moving in destination node when reacting greater than network, the routing information that obtains in the network is always outdated information, and the data that send to this node so will ceaselessly be transmitted in network.Operations such as the subsidiary new emphatically initiation route requests of the modification of route will be so will bring very big network overhead.It is not that the data of present networks interior nodes are recycled forwarding in network that this step prevents to send destination node, thereby causes network paralysis;
S123, Node B are searched the path that arrives destination node D from route-caching, if find, then use this path to send data; If not finding then needs to initiate again route requests, obtain to arrive the route of destination node D, and send data with this path;
S124, Node B check whether the data of using this link are arranged in the formation, then forward step S122 to if having;
S125, Node B are created the routing error of this link failure, and described routing error is sent to source node A, and described routing error is handled and transmitted to all upstream nodes on the path successively;
S126, source node A receive after the described routing error, and the link that lost efficacy is deleted from route-caching.
When sending described routing error, near the path node can listen to described routing error message, though the destination node of described routing error is not near the node in described path, near the node the described path still needs described routing error is handled.Thereby guaranteed the instantaneity of data in the node buffering area.
Source node A checks whether also have other paths that arrive destination node D in the route-caching when send data next time, if then do not need to initiate once more route finding process.
The present invention need integrate the route criterion in path when differentiating the path quality with a certain definite rule.By route discovery of the present invention, can obtain the route criterion information such as peak load of node on minimum bandwidth, bag delivery rate and the path.The route judgement function that EDSR selects for use is the weighted average of these 3 parameters:
Weight (Min_Bw, Max_Load, PDR)=α Min_Bw+ β Max_Load+ γ PDR wherein, Min_Bw is a node least residue bandwidth in the path, α is its weighted factor; Max_Load is a node peak load in the path, and β is its weighted factor; PDR is a path delivery rate, and γ is its weighted factor, and α, β and γ satisfy | α |+| β |+| γ |=1.It is pointed out that because the target of route is the path that will select network load little, so the value of β is for negative.In addition, the expression formula of path minimum bandwidth, peak load and delivery rate is as follows:
Min_Bw＝min(Bw1，Bw2，...，Bwi，...，Bwn-1)
Wherein, n is a path, and Bwi is the statistics remaining bandwidth of node i;
Max_Load＝max(Load1，Load2，...，Loadi，...，Loadn)
Wherein Loadi is the load of node i;
Wherein, pdri, i+1 represent the delivery rate of i to i+1.
EDSR particular location of the present invention as shown in Figure 3.
The present invention also provides the system of transfer of data in a kind of wireless mesh network, described system comprises the node in the wireless mesh network, specifically comprise source node, intermediate node and destination node, described source node transmits data to destination node by intermediate node, it is characterized in that described node comprises:
Route discovery module is found to the route of destination node based on the routing decision mechanism of multiple criteria;
Data transmission module transmits data to destination node by the mode of source routing and data flow combination.
Described node also comprises strides a layer sharing module, and the link-state information that is used for collector node is to obtain the route criterion.
Because EDSR is the expansion of IP, so belong to the part of network layer.EDSR strides layer design and obtains on the basis of DSR.EDSR needs the relevant information of image data link layer, strides a layer sharing module so increase one newly between EDSR and data link layer.This module is mainly finished following work:
Collect the various link-state informations of neighbor node, such as information such as remaining bandwidth and delivery rates to this node; And the access interface that various statistic is provided for network layer.
During specific implementation, stride a layer sharing module and be embedded in the link layer, as the part of link layer.Compare with original link layer interface, increased the access interface of various link performance parameters.
EDSR of the present invention has revised part MAC parameter, such as by the modification (as increasing to original 2 times) to MAC layer data bag maximum retransmission, finishes the MAC Parameter Optimization.MAC after the described optimization and EDSR binding energy make network have good fault-tolerant ability, have promoted the adaptability of network to conflict.
Should be understood that above-mentioned description at specific embodiment is comparatively detailed, can not therefore think the restriction to scope of patent protection of the present invention, scope of patent protection of the present invention should be as the criterion with claims; For those of ordinary skills,, may make various no creationary changes or replacement, and all these changes or replacement should belong within the protection range of claims of the present invention all according to technical conceive of the present invention and embodiment.
Claims (9)
1, the method for transfer of data in a kind of wireless mesh network is characterized in that, comprising:
A, source node are found to the route of destination node based on the routing decision mechanism of multiple criteria, and wherein, steps A also comprises:
A1, source node send the route requests that contains the route criterion, and the route criterion in the described route requests of initialization;
A2, subsequent node are carried out routing reply to described route requests, and wherein, subsequent node is a destination node, and steps A 2 comprises:
A21, intermediate node judge whether to ignore described route requests, if, ignore described route requests, otherwise, carry out steps A 22, steps A 21 comprises:
A211, judge whether described intermediate node once received the route requests to destination node that source node sends, if, carry out steps A 212, otherwise, carry out steps A 22;
The relation of the bag sequence number of A212, the bag sequence number of judging the route requests that described intermediate node was once received and described route requests, if the bag sequence number of the route requests that described intermediate node was once received is then ignored described route requests greater than the bag sequence number of described route requests; If the bag sequence number of the route requests that described intermediate node was once received, is then upgraded the bag sequence number of the route requests of described intermediate node storage less than the bag sequence number of described route requests, and carries out steps A 22; If the bag sequence number of the route requests that described intermediate node was once received equals the bag sequence number of described route requests, further judge that then whether entrained than the route requests of once receiving path, the entrained path of described route requests more excellent, if, carry out steps A 22, otherwise, ignore described route requests;
A22, intermediate node search whether exist the cache way that arrives destination node by, if do not exist, transmit described route requests; Otherwise, judge that the described cache way path more entrained than described route requests by whether is more excellent, if, reply described route requests, otherwise intermediate node is transmitted described route requests, wherein, the step that described intermediate node is transmitted described route requests comprises: if described intermediate node is transmitted described route requests, then described intermediate node also will be judged: whether the formation of this node is long; Whether the life cycle of described route requests expires; Whether the current various resources of this node do not allow to transmit described route requests; Whether described route requests address area does not have enough spaces to deposit the network address of described intermediate node; If above-mentioned judged result is then ignored described route requests for being, otherwise, transmit described route requests;
A3, source node receive described routing reply;
Node on B, the described route transmits data to destination node by the mode of source routing and data flow combination.
2, the method for transfer of data in a kind of wireless mesh network as claimed in claim 1 is characterized in that steps A 2 also comprises:
A23, subsequent node are upgraded the route criterion in the described route requests;
A24, subsequent node are replied the described route requests that contains path and route criterion according to specified circuit by the mode of returning.
3, the method for transfer of data in a kind of wireless mesh network as claimed in claim 1 is characterized in that steps A 3 also comprises:
Non-source node in the path of A31, described routing reply extracts available path;
A32, described source node receive the described routing reply that contains path and route criterion;
A33, described source node add the described routing reply that contains path and route criterion in the route-caching to.
4, the method for transfer of data in a kind of wireless mesh network as claimed in claim 1 is characterized in that described step B also comprises:
B1, source node check in the data stream list whether have the data flow that arrives destination node, if do not exist, carry out step B2; Otherwise, carry out step B3;
B2, source node establish the data flow of time restriction, if arrived described time restriction, transmit data by the mode of data flow, otherwise, transmit data by the mode of source routing;
Whether the entrained path of B3, source node judgment data is more excellent than the path of data flow, if, transmit data by the mode of source routing, otherwise, transmit data by the mode of data flow.
5, the method for transfer of data in a kind of wireless mesh network as claimed in claim 1 is characterized in that, also comprises:
When C, node transmission data failure, carry out route maintenance.
6, the method for transfer of data in a kind of wireless mesh network as claimed in claim 1 is characterized in that, described route criterion comprises the peak load of node on minimum bandwidth, bag delivery rate and the path.
7, as the method for transfer of data in claim 1 or the 4 described a kind of wireless mesh networks, it is characterized in that, judge the quality in path by the route judgement function.
8, the method for transfer of data in a kind of wireless mesh network as claimed in claim 1 is characterized in that, described method is by striding layer link-state information of sharing module collector node to obtain the route criterion between network layer and the data link layer.
9, the method for transfer of data in a kind of wireless mesh network as claimed in claim 1 is characterized in that, described method also comprises revises MAC layer data bag maximum retransmission.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100338935A CN100536429C (en) | 2006-02-20 | 2006-02-20 | Method and system for data transmission in wireless net-like network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100338935A CN100536429C (en) | 2006-02-20 | 2006-02-20 | Method and system for data transmission in wireless net-like network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1852256A CN1852256A (en) | 2006-10-25 |
| CN100536429C true CN100536429C (en) | 2009-09-02 |
Family
ID=37133725
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100338935A Expired - Fee Related CN100536429C (en) | 2006-02-20 | 2006-02-20 | Method and system for data transmission in wireless net-like network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100536429C (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101282279B (en) * | 2007-04-04 | 2010-12-01 | 同济大学 | Wireless self-organization network routing method based on available bandwidth measurement |
| CN101610559B (en) * | 2008-06-19 | 2012-03-28 | 中国移动通信集团公司 | Determination method of wireless routing and node device |
| CN101772068B (en) * | 2008-12-31 | 2014-02-26 | 安移通网络科技（中国）有限公司 | Wireless mesh network router control method and router device |
| CN101827421B (en) * | 2010-03-09 | 2013-05-15 | 北京交通大学 | DSR cooperative routing method based on channel state information and router |
| CN102480766B (en) * | 2010-11-25 | 2014-05-07 | 华为技术有限公司 | Bandwidth reservation method and device |
| CN103781145B (en) * | 2012-10-25 | 2017-09-08 | 上海交通大学 | The design method of multichannel opportunistic routing protocol in cognition wireless sensing network |
| CN104834283B (en) * | 2015-03-27 | 2017-08-25 | 上海新储集成电路有限公司 | A kind of astride hierarchy sends the Internet of things system and method for customizable data |
| CN112953651A (en) * | 2021-01-25 | 2021-06-11 | 博雅工道（北京）机器人科技有限公司 | Underwater wireless networking information transmission method |
-
2006
- 2006-02-20 CN CNB2006100338935A patent/CN100536429C/en not_active Expired - Fee Related
Non-Patent Citations (4)
| Title |
|---|
| 无线Mesh网络的跨层设计理论与关键技术. 方旭明，马忠建.西南交通大学学报，第2005年 第40卷第6期. 2005 |
| 无线Mesh网络的跨层设计理论与关键技术. 方旭明，马忠建.西南交通大学学报，第2005年第40卷第6期. 2005 * |
| 无线Mesh网络路由协议研究. 沈强，方旭明，宋文.数据通信，第2005年 第4期. 2005 |
| 无线Mesh网络路由协议研究. 沈强，方旭明，宋文.数据通信，第2005年第4期. 2005 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1852256A (en) | 2006-10-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100536429C (en) | Method and system for data transmission in wireless net-like network | |
| CN100442786C (en) | Tree structure based routing method | |
| CN1926835B (en) | Method, communication device and system for address resolution mapping in a wireless multihop self-organizing network | |
| Jayakumar et al. | Ad hoc mobile wireless networks routing protocols–a review | |
| EP1632044B1 (en) | Method to improve the overall performance of a wireless communication network | |
| CN101568164B (en) | Opportunistic routing algorithm of Ad hoc network | |
| CN101420379B (en) | Low consumption multi-path routing method for mobile ad hoc network | |
| CN108337166B (en) | Low-delay high-reliability routing method for aviation cluster network | |
| JP4072917B2 (en) | Packet relay method, communication path setting method, and communication path setting system | |
| KR20080081958A (en) | System and method for utilizing multiple radios to increase the capacity of a wireless communication network | |
| CN102170660B (en) | Multi-path route constructing method and system based on APDV (Ad Hoc On-demand Distance Vector) | |
| CN101102283A (en) | A method and device for optimizing unknown unicast forward at wireless access point | |
| CN102413542B (en) | Wireless mesh network routing method and wireless mesh network | |
| CN105577547A (en) | Multi-Qos based route selection method in mobile self-organizing network | |
| CN101374108A (en) | Routing method suitable for static state self-grouping formation | |
| CN101207537A (en) | Method for searching stabilizing path in wireless self-organizing network | |
| KR100927536B1 (en) | Location Information Based Routing Method and System | |
| CN103068002A (en) | Efficient routing method of high rate-wireless personal area network (HR-WPAN) mesh network | |
| CN1878134A (en) | Time-delay constrained multipath routing method for Ad hoc network | |
| CN103036783B (en) | A kind of based on DTN deep space sensor network multi-path method for routing | |
| CN101262449B (en) | A new wireless self-networking dual-frequency hierarchical routing method | |
| Chun et al. | Routing protocols overview and design issues for self-organized network | |
| CN101651619B (en) | Ad hoc network routing method based on label circular shift of MAC layer | |
| CN101005694B (en) | Mobility managing method and device for mobile self organized network | |
| JP2007221568A (en) | Transfer delay control method and radio terminal |
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: 20090902 Termination date: 20150220 |
|
| EXPY | Termination of patent right or utility model |