CN102006577B - Multi-antenna multi-sector based neighborhood node information discovery and maintenance method of wireless MESH network - Google Patents
Multi-antenna multi-sector based neighborhood node information discovery and maintenance method of wireless MESH network Download PDFInfo
- Publication number
- CN102006577B CN102006577B CN 201010549084 CN201010549084A CN102006577B CN 102006577 B CN102006577 B CN 102006577B CN 201010549084 CN201010549084 CN 201010549084 CN 201010549084 A CN201010549084 A CN 201010549084A CN 102006577 B CN102006577 B CN 102006577B
- Authority
- CN
- China
- Prior art keywords
- node
- neighbor
- message
- information
- nld
- 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.)
- Active
Links
Images
Abstract
The invention discloses a multi-antenna multi-sector based neighborhood node discovery and maintenance method of a wireless MESH network. The method is characterized by comprising the following steps of: acquiring the related topological and scheduling information of other neighborhood nodes within a two-hop range of a node through the two-time interaction of a neighborhood detection message and a neighborhood detection response message, wherein the neighborhood detection message broadcasts the sector information of the node, and the neighborhood detection response message broadcasts the related topological and scheduling information of the node and a local one-hop neighborhood node. The multi-antenna multi-sector based neighborhood node position information discovery and maintenance method acquires the topological and scheduling information of the neighborhood nodes within the two-hop range through the two-time message interaction on the basis of scheduling and can take fully advantages of sectored antennae in data communication and provide the basis for the conflict-free data sending of the node.
Description
Technical field
The information of neighbor nodes that the present invention relates in a kind of Wireless MESH network media access control system is found and maintaining method.
Background technology
MESH is a kind of broadband network pattern that can provide high-speed radio to insert in the metropolitan area scope, in IEEE802.16WirelessMAN, has just defined two kinds of patterns: PMP pattern and MESH pattern.Compare with the PMP pattern, it is big that the MESH pattern has coverage, and area of coverage path loss is little, MESH overlay area and robustness are the index improvement with user's increase, and user throughput is than advantages such as PMP pattern are big under multi-hop environment, and therefore, research MESH network has great importance.
Current proposition be applied to that the neighbor discovering method based on directional antenna is divided into two classes substantially in the MESH network: completely random transmitting-receiving algorithm (CRA:completely random algorithms) and orderly scanning algorithm (SBA:Scan-Based Algorithms).The characteristics of completely random transmitting-receiving algorithm are node in own residing transmission of certain time slot completely random selection or accepting state, and select a direction at random, in this algorithm, and not cooperation between the node in the network, the probability that clashes is bigger; For orderly scanning algorithm, node is selected own residing transmission or accepting state according to the result of orderly scanning, in this algorithm, does not solve mutual competitions and conflicts.
The information of neighbor nodes that the present invention proposes find and maintaining method to be scheduling to the basis, by twice handshake mechanism, effectively avoided conflict, and can make each node in the MESH network in time obtain the relevant information of two-hop neighbor node in the collision domain.When carrying out data communication, can select corresponding interface, sector communicate according to local information of neighbor nodes, for channel allocation provides foundation, the whole network resource is obtained an equitable breakdown and use, improve the throughput of system of whole M ESH network.
Summary of the invention
The invention belongs to the mobile communication technology field, purpose provides a kind of broadband wireless MAN that is applied to, Wireless MESH network information of neighbor nodes based on the many sectors of many antennas is found and maintaining method, by the positional information that comprises in the interaction message, for the user provides a kind of method of obtaining other neighbor node relevant topology information in the double bounce collision domain.
The present invention is based on the TDD mode under the MESH network, each node structure is identical in the network, has an omnidirectional antenna and a multi-sector antenna; Local information of neighbor nodes table of node maintenance, relevant entries is a hop neighbor node table and two-hop neighbor node table according to connecting respectively with the jumping figure relation of local node in the information of neighbor nodes table; It is relevant with two kinds of control messages with maintenance that neighbor information is found, be respectively NLD message (Neighbor Location Detect, neighbor node position sensing message) and NLD_ACK message (neighbours' positional information response detected message), interdependent node list item structure and message structure are as follows respectively:
Stuct?NbrNode
The concrete reciprocal process of node location information is as follows among the present invention: suppose A, B two nodes neighbor node each other, 1) node A obtained to send the TO of NLD message by scheduling, when this TO reaches, node A directive sending NLD message in turn on its each sector; 2) neighbor node B receives the NLD message of A node, by the relativeness (Node B is under which sector of node A covers) of resolving this node of acquisition and node A, and is kept in the local neighbor information table; 3) Node B by omnidirectional antenna broadcasting NLD_ACK message, embeds a local hop neighbor relevant information in the NLD_ACK message when the NLD_ACK that obtains sends TO arrival; 4) after node A received the NLD_ACK message of Node B, by resolving the relative position relation that obtains Node B and this node, so far, node A and Node B had all obtained the relativeness (Node B is under which sector of node A covers) of Node B and node A; 5) Node B sends NLD message on each fan antenna when the NLD that obtains sends TO arrival; 6) after node A receives the NLD of Node B,, obtain the relative position relation (node A is under which sector of Node B covers) of this node and Node B by parsing to NLD message; 7) node A gives Node B by NLD_ACK with this information broadcast, Node B is by sending out the parsing of NLD_ACK message to node A, obtain the relative position relation (node A is under which sector of Node B covers) of node A and this node, so far, A and B obtain full location information each other respectively.
Nodal information is safeguarded with the nodal information discovery procedure similar substantially among the present invention, in the node discovery procedure, constantly mutual by NLD and NLD_ACK message, and the TTL of each list item changes in the local neighbor information table, timely sensing network change in topology, and make a response.
Useful technique effect of the present invention is: based on the neighbor node positional information of the many sectors of many antennas find and maintaining method to be scheduling to the basis, by neighbor node topology and the schedule information in twice interacting message acquisition double bounce scope, this method can be given full play to the advantage of fan antenna in data communication, and provides foundation for node does not have the colliding data transmission.
Description of drawings
Fig. 1 is the neighbor information tabulation
Fig. 2 is neighbours' positional information reciprocal process schematic diagram
Fig. 3 is a NLD message sink flow process
Fig. 4 is a NLD_ACK message sink flow process
Embodiment
At the deficiencies in the prior art of describing in the background technology, the invention discloses a kind of Wireless MESH network neighbor node based on the many sectors of many antennas finds and maintaining method, it is characterized in that, twice by neighbours' probe message and neighbours' response detected message of this method is mutual, obtains the relevant topology and the schedule information of other neighbor node in this node double bounce scope.Specific embodiment described herein is only in order to explaining the present invention, and is not used in qualification the present invention.
A kind of information of neighbor nodes discovery and the maintaining method based on many sectors of many antennas Wireless MESH network that the present invention relates to is mutual by the periodicity of NLD between neighbor node and NLD_ACK message, finish obtaining and updating maintenance of network topology, for the later stage is adopted the fan antenna data communication, finish no conflict scheduling, important information is provided.Below in conjunction with drawings and Examples, introduce a kind of information of neighbor nodes based on many sectors of many antennas Wireless MESH network of the present invention in detail and find and safeguard implementation method for reaching above-mentioned target.
Please refer to shown in Figure 1ly, this is the local information of neighbor nodes list structure of node maintenance among the present invention; Local information of neighbor nodes table of each node maintenance among the present invention, relevant entries is a hop neighbor node table and two-hop neighbor node table according to connecting respectively with the jumping figure relation of local node in the information of neighbor nodes table; Can obtain all jumping and a two-hop neighbor node relevant topology and schedule informations of local node by this to this table node.
Please refer to Fig. 2, this finds and the maintenance process schematic diagram for information of neighbor nodes among the present invention.Here suppose that node A obtains neighbours' position sensing message send opportunity earlier, then described information of neighbor nodes discovery and maintenance process are as follows:
Node A obtains individual continuous transmission opportunity (TO) of K (supposing that node fan antenna number is K), and when sending TO arrival, node sends NLD message successively on K sector;
Node B is garrisoned on omnidirectional antenna, after receiving the NLD message of node A, upgrade the local node information table according to message content, obtain the relative position relation between this node and the node A, Node B under node A sector 1 covers, (the send_ant field of node A list item is updated to 1 in the Node B local information table);
Node B obtains the transmission TO of NLD_ACK, and relevant information of neighbor nodes in the local information of neighbor nodes table is put into NLD_ACK message with Nbr_phy_ie version, and sends by omnidirectional antenna when transmission arrives opportunity;
Node A receives the NLD_ACK message that Node B sends by omnidirectional antenna, obtain Node B and the relative position information (the rec_ant field of Node B list item is updated to 1 in the node A local information table, and the next_NLD_to of Node B and next_NLD_ACK_to field value are updated to 5 and 11) of node A and other neighbor node relevant information of Node B by resolving NLD_ACK message;
When Node B is obtaining NLD and is sending TO, be used in the identical mode of node A and send NLD message, by the NLD message sink processing of node A and the answer of NLD_ACK message, finish neighbours between Node B and node A and find (send_ant of node A is 3 in the Node B local information list item, and upgrades next_NLD_to and next_NLD_ACK_to is 13 and 20);
So far, A and B two nodes have obtained the relevant location information of neighbor node in this node double bounce collision domain respectively.
Please refer to Fig. 3, this receives process chart after the NLD message for node among the present invention.Receive the NLD message of neighbor node transmission when node after, obtain this neighbor node relevant information by following operation, and put into local information of neighbor nodes table, message processing procedure may further comprise the steps:
Step S3.1: after node is received NLD message, check local information of neighbor nodes table;
Step S3.2:NLD sender of the message is a local hop neighbor, enters step S3.3; Be local two-hop neighbor node, enter step S3.7; This node in local neighbor information table, does not enter step S3.10;
Step S3.3: whether this NLD message is first NLD message of this node of receiving in this frame; Be to illustrate that then node A is a broadcasting NLD message in the new NLD transmission cycle, enters step S3.4, otherwise enters step S3.5;
Step S3.4: the receive_antenna (this neighbor node sends the employed antenna of message to this node) that upgrades in this list item is the information of the send_antenna (promptly upgrade this node and be in which the sector covering of this neighbor node down) in the NLD message, the cinr that upgrades this list item in the information of neighbor nodes table is the cinr value in the NLD message, and the report_flag of this neighbor node list item in the local information table is changed to 1, go to step S3.12;
Step S3.5: relatively whether the message cinr value of carrying greater than the cinr value of this locality preservation, greater than illustrating that then this NLD message is effective, enters step S3.4; Otherwise go to step S3.6;
The cinr value of carrying in the step S3.6:NLD message is not more than local cinr value of preserving, and illustrates that this NLD message is invalid, abandons this frame, goes to step S3.13;
Step S3.7: this node list item is removed from the two-hop neighbors table;
Step S3.8: upgrade Receive_antenna in the above-mentioned list item and be the send_antenna in the NLD message, upgrade cinr value in the information of neighbor nodes table and be the cinr value in the NLD message, report_flag is changed to 1, hop_num is changed to 1;
Step S3.9 is added into this list item in the one hop neighbor information table; Enter step S3.12;
Step S3.10: create new list item, fill in receive_antenna, cinr field value in the list item, and reprot_flag and hop_num field are changed to 1 according to NLD message respective field;
Step S3.11: this list item is inserted hop neighbor tabulation;
Step S3.12: this list item TTL is set to default maximum;
Step S3.13:NLD Message Processing is finished.
Please refer to Fig. 4, this receives process chart after the NLD_ACK message for node among the present invention.Receive the NLD_ACK message of neighbor node transmission when node after, obtain other hop neighbor node relevant information of this neighbor node and these neighbours by following operation, and put into local information of neighbor nodes table, message processing procedure may further comprise the steps:
Step S4.1: handle NLD_ACK sender of the message's relevant information, NLD_ACK sender of the message relevant information is put into local information of neighbor nodes table.
Step S4.1 can further be subdivided into again:
Step S4.1.1: search NLD_ACK sender of the message list item according to node_id in local information of neighbor nodes table, this node is a hop neighbor, enters step S4.1.2; This node is a two-hop neighbors, enters step S4.1.3; This node in local information of neighbor nodes table, does not enter step S4.1.5;
Step S4.1.2: according to Next_NLD_to and the Next_NLD_ACK_to field information that message is carried, upgrade the Next_NLD_to and the Next_NLD_ACK_to field of this node in the local information of neighbor nodes table, enter step S4.1.7;
Step S4.1.3: upgrade Next_NLD_to and Next_NLD_ACK_to field in this node list item, the Hop_num field is updated to 1;
Step S4.1.4: this list item is shifted out from the two-hop neighbors tabulation, insert in the hop neighbor tabulation, enter step S4.1.7;
Step S4.1.5: create new node list item, and fill Next_NLD_to and Next_NLD_ACK_to field, the Hop_num field is filled to 1;
Step S4.1.6: this list item is inserted hop neighbor tabulation;
Step S4.1.7: this list item TTL is set to default maximum;
Step S4.2: judging whether Nbr_node_num is 0, is that 0 this message of explanation is not carried other information of neighbor nodes, goes to step S4.12; Be not that 0 this message of expression has been carried Nbr_node_num information of neighbor nodes, enter step S4.3;
Step S4.3: resolve the information of neighbor nodes that Nbr_phy_ie comprises in the NLD_ACK message: this neighbor node is a receiving node itself, enters step S4.4; This node is a hop neighbor in the local neighbor information table else if, enters step S4.6; If this node is a two-hop neighbors in the local information table, enter step S4.7; If this node in local neighbor information table, does not enter step S4.8;
Step S4.4: in local information of neighbor nodes table, search the corresponding list item of NLD_ACK sender;
Step S4.5: send_antenna in this list item (this neighbor node is under which sector of this node covers) is updated to corresponding Nbr_Xmt_Antenna among the Nbr_phy_ie, the report_flag field is changed to 1, enter step S4.10;
Step S4.6: the report_flag of this list item is changed to 1, does not do other any processing (thinking that the information of neighbor nodes in the local jumping scope is up-to-date), enter step S4.10;
Step S4.7: this node then upgrades the Next_NLD_to and the Next_NLD_ACK_to field of this neighbor node in the two-hop neighbors tabulation of local neighbor list.Enter step S4.10;
Step S4.8: this kind situation illustrates that this node has just entered in the collision domain of this node, creates new list item, upgrades Next_NLD_to and Next_NLD_ACK_to field value in the local neighbor information table according to the relevant field of Nbr_phy_ie, and Hop_num is changed to 2;
Step S4.9: this list item is added in the local two-hop neighbors tabulation;
Step S4.10: this list item TTL is set to default maximum;
Step S4.11: Nbr_node_num is subtracted 1; Enter step S4.2;
Step S4.12: travel through local neighbor information table successively, and relatively with each list item TTL-1 and 0, if less than 0, then (TTL does not obtain this information of neighbor nodes in a long time less than 0 explanation with this list item deletion in local neighbor information table, can think that this node has moved out this node collision domain or off-grid, so can delete this neighbor node relevant information).
Step S4.13:NLD_ACK message processing procedure is finished.
The information of neighbor nodes discovery procedure of the foregoing description introduction has also comprised the maintenance of information process.
Claims (5)
1. the Wireless MESH network information of neighbor nodes based on the many sectors of many antennas is found and maintaining method, it is characterized in that this method may further comprise the steps, and supposes A, B neighbor node each other:
Step 1: node A sends neighbours' position sensing message after obtaining transmission opportunity of neighbours' position sensing message by scheduling in turn on each sector of its fan antenna;
Step 2: neighbor node B is by neighbours' position sensing message of omnidirectional antenna receiving node A: after receiving neighbours' probe message of node A, by message parse, obtain the relative position information of this node and node A, and be kept in the local neighbor information table;
Step 3: neighbor node B sends neighbours' position sensing response message: obtaining the transmission of neighbours' position sensing response message during opportunity, the information of neighbor nodes of preserving in the local neighbor information table is embedded in neighbours' position sensing response message, and broadcast by omnidirectional antenna;
Step 4: node A receives neighbours' position sensing response message of neighbor node B, after receiving neighbours' response detected message of neighbor node B, from the information of neighbor nodes that neighbor node B carries, obtain the relative position relation information of Node B and this node, obtain other hop neighbor relevant information of neighbor node B simultaneously, upgrade and preserve local neighbor information table;
Step 5: the neighbor discovery process of neighbor node B is identical with node A, and promptly neighbor node B uses fan antenna to send neighbours' position sensing message, and node A uses omnidirectional antenna to send neighbours' position sensing response message, and the neighbours that finish Node B find;
By the neighbor discovery process of node A and Node B, two nodes obtain full location information each other respectively;
Wherein, described Wireless MESH network node, antenna comprise at least one omnidirectional antenna and a fan antenna; Neighbours' probe message sends by fan antenna, and omnidirectional antenna receives; Neighbours' response detected message sends by omnidirectional antenna, and omnidirectional antenna receives;
Neighbours' position sensing message wherein, the present invention's Chinese and English full name is Neighbor Location Detect, is called for short NLD message; This message comprises node number node_id, sends sector number send_antenna and three fields of signal to noise ratio information cinr; Wherein the cinr field is not filled when sending, and is reserved field, intercepts signal to noise ratio information and filling by the receiving node physical layer;
Neighbours' position sensing response message wherein, the present invention's Chinese and English full name is Neighbor Location Detect ACKnowledge, be called for short NLD_ACK message: message comprises this node numbering, this node sends the opportunity of position sensing response message next time, send the opportunity of position sensing message, the hop neighbor nodal information that this node need be broadcasted next time;
Wherein said local information table is a hop neighbor node table and two-hop neighbor node table with the neighbor node relevant entries according to connecting respectively with the jumping figure relation of local node, and the node list item mainly comprises following field in the information table:
The local neighbor information that wherein said neighbours' response detected message is carried, when selecting entrained information of neighbor nodes broadcasting, need follow two principles:
(1) only broadcasting report_flag in the information of neighbor nodes table is 1 node, and this category node is the node that information changes, and needs announcement to carry out neighbor information for other node and upgrades;
(2) the broadcast node number is influenced by message-length, if the message-length restriction can not be broadcasted away local all nodal informations that need broadcast, then preferential broadcast transmission sends nearer node apart from this opportunity, to reduce transmission conflict on opportunity.
2. find and maintaining method by the described a kind of Wireless MESH network information of neighbor nodes of claim 1 based on the many sectors of many antennas, it is characterized in that, in the described step 2, Node B receives the NLD message that node A sends, by correct parsing, obtain the relative position relation of Node B and node A, NLD message parse step is as follows:
Step 201: whether in local neighbor information table have node A relevant entries, if node A enters step 202 at a local hop neighbor if checking; If be local two-hop neighbors, enter step 205; If do not have this node relevant entries in the local neighbor information table, then go to step 207;
Step 202: judge first NLD message of the node A whether this message received in this frame, if then enter step 203; Otherwise go to step 204;
Step 203: the reception antenna Receive_antenna field of upgrading node A in the local information of neighbor nodes table is the send_antenna field value in the NLD message, report_flag is changed to 1 with broadcast flag, upgrading this list item cinr field is cinr field value in the message, this list item ttl field value is reset to default maximum, enter step 208;
Step 204: whether the information of node A of judging this reception according to the cinr value is credible, if cinr value goes to step 203 greater than this locality preservation cinr value in the message; If the cinr value is preserved the cinr value less than this locality in the message, abandon this message, change step 208 over to;
Step 205: this list item is removed from the two-hop neighbors tabulation;
Step 206: the reception antenna Receive_antenna field of upgrading above-mentioned list item is the send_antenna field value in the NLD message, broadcast flag report_flag is changed to 1, jumping figure Hop_num is updated to a hop neighbor, the ttl field value is changed to default maximum in the list item, and this list item is inserted in the hop neighbor information table again, enter step 208;
Step 207: create new list item, neighbor node field in the list item is filled to node_id field in the NLD message, the Receive_antenna field of list item is filled to send_antenna field value in the NLD message, report_flag is changed to 1, Hop_num is updated to a hop neighbor, this list item ttl field value is reset to default maximum, and this list item is inserted a hop neighbor information table;
Step 208:NLD message parse finishes.
3. find and maintaining method by the described a kind of Wireless MESH network information of neighbor nodes of claim 1 based on the many sectors of many antennas, it is characterized in that, in the described step 4, after node A receives the NLD_ACK message of Node B transmission, by the relative position relation between correct parsing acquisition A and the B node, and this information write in the local neighbor information table, other information of neighbor nodes according to the Node B that comprises among the NLD_ACK upgrade a jumping or the corresponding list item of two-hop neighbors in the local information of neighbor nodes table simultaneously, and NLD_ACK message parse step is as follows:
Step 301: handle the relevant information of the Node B that sends NLD_ACK message, the relevant information of Node B is put into local information of neighbor nodes table;
Step 302: judge whether NLD_ACK message has carried other information of neighbor nodes, is then to enter step 303, otherwise go to step 309;
Step 303: resolve other information of neighbor nodes of this node that comprises in the NLD_ACK message, whether this neighbor node receiving node itself, is then to enter step 304; This node is a hop neighbor in the local neighbor information table else if, goes to step 306; If this node is a two-hop neighbors in the local information table, enter step 307; If this node in local neighbor information table, does not enter step 308;
Step 304: find NLD_ACK sender list item in the local information of neighbor nodes table, send_antenna in this list item is updated to corresponding neighbours' transmitting antenna field in this neighbor information, report_flag is changed to 1, and TTL is updated to default maximum with this list item;
Step 305: whether also have other neighbor node to need to resolve, have then to enter step 303, otherwise go to step 309;
Step 306: the report_flag of this list item is changed to 1, thinks that the information of neighbor nodes in the local jumping scope is up-to-date other any processing of not doing, and goes to step 305 this moment;
Step 307: this node is in the two-hop neighbors tabulation of local neighbor list, and next NLD message transmission Next_NLD_to on opportunity and next NLD_ACK message of then upgrading this neighbor node send Next_NLD_ACK_to field on opportunity
And the TTL of this list item is updated to default maximum; Go to step 305;
Step 308: this kind situation illustrates that this node has just entered in the collision domain of this node, create new list item, upgrade value in the local neighbor information table according to this neighbor node relevant information, this list item is added in the local two-hop neighbors tabulation, TTL is set to default maximum; Go to step 305;
Step 309: travel through local neighbor information table successively, each list item life span is subtracted 1 back to be compared with 0, if less than 0, then explanation does not obtain this information of neighbor nodes in a long time, can think that this node has moved out this node collision domain or off-grid, then in local neighbor information table with this list item deletion;
Step 310:NLD_ACK message parse process finishes.
By in the information of neighbor nodes reciprocal process of the described Wireless MESH network of claim 3 to the resolving of NLD_ACK message, it is characterized in that, in the described step 301, the relevant information of NLD_ACK sender of the message B node handled further may further comprise the steps again:
Step C1: search NLD_ACK sender of the message B node list item according to node number in local information of neighbor nodes table, this node is a hop neighbor, enters step C2; This node is a two-hop neighbors, enters step C3; This node in local information of neighbor nodes table, does not enter step C5;
Step C2: according to the field information that message is carried, upgrade the respective field of this node in the local information of neighbor nodes table, and this list item TTL is reset to default maximum, finish;
Step C3: this node is removed from the two-hop neighbors tabulation;
Step C4: carry field according to message and upgrade this list item respective field, this list item TTL is set to default maximum
And this list item added in the hop neighbor tabulation again, finish;
Step C5: create new list item, carry field according to message and fill this list item, this list item TTL is set to default maximum; And this list item added in the hop neighbor tabulation, finish.
5. find and maintaining method by the described a kind of Wireless MESH network information of neighbor nodes of claim 1 based on the many sectors of many antennas, it is characterized in that, described information of neighbor nodes discovery and maintenance process relate to the transmission and the reception of NLD message and NLD_ACK message, the transmission of two kinds of control messages is relevant with the MESH frame structure, the MESH frame structure is divided into control subframe and data burst, the control subframe is divided into a plurality of transmission Transmission on opportunity Opportunity again, be called for short TO, two kinds of message are obtained the control subframe by scheduling and are sent TO accordingly, and when corresponding TO arrived, transmitting control message, it was mutual to carry out neighbours' relative position information; Because NLD message will be broadcasted on each sector successively, so obtaining when NLD sends opportunity, node once obtains k continuous T O, k is the fan antenna sector number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010549084 CN102006577B (en) | 2010-11-18 | 2010-11-18 | Multi-antenna multi-sector based neighborhood node information discovery and maintenance method of wireless MESH network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010549084 CN102006577B (en) | 2010-11-18 | 2010-11-18 | Multi-antenna multi-sector based neighborhood node information discovery and maintenance method of wireless MESH network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102006577A CN102006577A (en) | 2011-04-06 |
| CN102006577B true CN102006577B (en) | 2013-07-24 |
Family
ID=43813565
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201010549084 Active CN102006577B (en) | 2010-11-18 | 2010-11-18 | Multi-antenna multi-sector based neighborhood node information discovery and maintenance method of wireless MESH network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102006577B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102970233B (en) * | 2012-11-22 | 2016-03-30 | 华为技术有限公司 | Obtain the method for route, device, equipment, concentrator and system |
| CN104754663B (en) * | 2015-03-12 | 2018-04-17 | 西安电子科技大学 | Neighbors rapid discovery method based on pure directional aerial |
| CN106131868A (en) * | 2016-06-08 | 2016-11-16 | 中国科学院重庆绿色智能技术研究院 | A kind of auto-adaptive parameter collocation method of Wireless Telecom Equipment |
| US10499320B2 (en) * | 2017-08-14 | 2019-12-03 | Sony Corporation | Mesh assisted node discovery |
| CN107623604A (en) * | 2017-10-24 | 2018-01-23 | 北京艾恩斯网络科技有限公司 | mesh network backbone node equipment and data transmission method, mesh network system |
| CN109982356B (en) * | 2019-03-20 | 2021-03-30 | 电子科技大学 | Directional antenna sector switching sequence generation method suitable for neighbor discovery |
| CN115665777B (en) * | 2022-12-13 | 2023-03-07 | 天地信息网络研究院(安徽)有限公司 | Subnet fusion method of directed ad hoc network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101296180A (en) * | 2008-06-19 | 2008-10-29 | 上海交通大学 | Wireless Mesh network self-adapting routing method based on throughput performance |
| CN101299707A (en) * | 2007-09-20 | 2008-11-05 | 上海寰创通信科技有限公司 | Method for diffusing route |
| CN101431784A (en) * | 2008-12-05 | 2009-05-13 | 天津大学 | Optimized data transmission method based on geographical position in vehicle-mounted network |
| CN101517932A (en) * | 2006-09-19 | 2009-08-26 | 发尔泰公司 | A multi-channel assignment method for multi-radio multi-hop wireless mesh networks |
-
2010
- 2010-11-18 CN CN 201010549084 patent/CN102006577B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101517932A (en) * | 2006-09-19 | 2009-08-26 | 发尔泰公司 | A multi-channel assignment method for multi-radio multi-hop wireless mesh networks |
| CN101299707A (en) * | 2007-09-20 | 2008-11-05 | 上海寰创通信科技有限公司 | Method for diffusing route |
| CN101296180A (en) * | 2008-06-19 | 2008-10-29 | 上海交通大学 | Wireless Mesh network self-adapting routing method based on throughput performance |
| CN101431784A (en) * | 2008-12-05 | 2009-05-13 | 天津大学 | Optimized data transmission method based on geographical position in vehicle-mounted network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102006577A (en) | 2011-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102006577B (en) | Multi-antenna multi-sector based neighborhood node information discovery and maintenance method of wireless MESH network | |
| CN102484845B (en) | Channel scanning method in wireless local area network (WLAN) system | |
| CN104025691B (en) | Dynamic channel reuse in multi-access communication systems | |
| US8830930B2 (en) | Device in wireless network, device resource management apparatus, gateway and network server, and control method of the network server | |
| JP4806307B2 (en) | Wireless communication method, wireless base station, wireless communication terminal, and base station control device | |
| CN102257862B (en) | Using synchronization frames for mesh networking with piconets | |
| EP1881635B1 (en) | Hierarchical networks utilizing frame transmissions pipelining | |
| US20060046730A1 (en) | Support for multiple access point switched beam antennas | |
| US20110223915A1 (en) | Apparatus and method for allowing femto base station to efficiently perform beaconing in wireless communication system | |
| CN102111200A (en) | Native medium access control support for beamforming | |
| CN1996786A (en) | Novel wireless communication networking method based on the relay technology | |
| CN109716704A (en) | Dynamic Time Division duplex | |
| JP2013153488A (en) | Apparatus and methods for intercell interference cancellation via rnti | |
| CN103916929A (en) | Neighbor finding method for directional Ad Hoc network | |
| CN101529756B (en) | Framework to design new MAC message exchange procedure related to mobile station (ms) handover in multi-hop relay broadband wireless access network | |
| CN105191451A (en) | Methods, wireless communication stations, and system for synchronizing devices and neighbor area networking (NAN) configuration | |
| CN106465232A (en) | Cluster-based beacon signal transmission | |
| CN102917448A (en) | System, device and method for transmitting cell information | |
| CN101971565A (en) | Discovering neighbors in wireless personal area networks | |
| CN101998441B (en) | Method and system for dynamic coordination and data exchange equipment | |
| CN102547994A (en) | Method and system for eliminating inter-cell interference | |
| CN104380784A (en) | Method for configuration of a wireless network | |
| CN104885509A (en) | Method and apparatus for a hybrid node in a cellular wireless communication system | |
| US20220272716A1 (en) | Method and apparatus of multi-link communication for vehicle in communication system | |
| US10638329B2 (en) | Method for implementing antenna cloud node communication in indoor high-density network and system thereof |
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 |