Nothing Special   »   [go: up one dir, main page]

CN102149161A - Hierarchical and regular mesh network routing method - Google Patents

Hierarchical and regular mesh network routing method Download PDF

Info

Publication number
CN102149161A
CN102149161A CN2011100252846A CN201110025284A CN102149161A CN 102149161 A CN102149161 A CN 102149161A CN 2011100252846 A CN2011100252846 A CN 2011100252846A CN 201110025284 A CN201110025284 A CN 201110025284A CN 102149161 A CN102149161 A CN 102149161A
Authority
CN
China
Prior art keywords
cell
network
mesh network
node
hierarchical
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.)
Pending
Application number
CN2011100252846A
Other languages
Chinese (zh)
Inventor
胡致远
刘云宏
李宁
姜建伦
柏崧
王晓翔
黄东
王景
袁研根
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing University
Original Assignee
Chongqing University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Chongqing University filed Critical Chongqing University
Priority to CN2011100252846A priority Critical patent/CN102149161A/en
Publication of CN102149161A publication Critical patent/CN102149161A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本发明提供一种应用于通信技术领域的层次规则化mesh网络路由方法,该方法通过构建一种层次化的规则的网络拓扑结构,实现了对mesh网络的路由;层次规则化拓扑结构由金字塔拓扑的网络实际节点所构成,网络实际节点首先形成平面结构的mesh网络,然后通过有效的拓扑控制策略形成规则的虚拟小区拓扑,虚拟小区由实际的网络实体构成;在该层次规则化拓扑结构下,采用综合的链路质量评价指标,描述网络中虚拟小区之间以及实际节点之间链路的链路质量;mesh网络路由采用基于地理位置以及链路状态的路由协议,实现QoS需求与协议以及路径质量的适配;本发明的显著效果是:提高了对mesh网络路由对信道和业务的适配能力,以及mesh网络的容错、负载均衡和业务的QoS性能。

Figure 201110025284

The invention provides a hierarchical regularized mesh network routing method applied in the field of communication technology. The method realizes the routing of the mesh network by constructing a hierarchical regular network topology structure; the hierarchical regularized topology structure consists of a pyramid topology The actual nodes of the network first form a mesh network with a planar structure, and then form a regular virtual cell topology through an effective topology control strategy. The virtual cell is composed of actual network entities; under this layered regular topology structure, Using comprehensive link quality evaluation indicators to describe the link quality of links between virtual cells and actual nodes in the network; mesh network routing uses routing protocols based on geographic location and link status to realize QoS requirements, protocols and paths Adaptation of quality; the remarkable effect of the present invention is: the ability to adapt mesh network routing to channels and services, and the fault tolerance, load balancing and QoS performance of services of the mesh network are improved.

Figure 201110025284

Description

A kind of level regularization mesh network route method
Technical field
The present invention relates to communication technical field, particularly relate to the wireless mesh network routing mechanism.
Background technology
Radio communication possesses fast network and launches, supports advantages such as mobile or nomadic aspect networking.Yet with respect to wire message way, the maximum characteristics of wireless (moving) channel are exactly that its channel becomes when being, and wire message way is relatively stable.Because factors such as the time variation of the mobility of radio node and wireless channel and interference, make big and reliability Radio Link of the change in topology of wireless network be lower than wire link.The wireless mesh network Routing Protocol has been used for reference in recent years the achievement in research to Ad hoc network route, but the target of Adhoc network routing protocol generally is in order to adapt to fast-changing many topologys, with the criterion the most of criterion such as short jumping figure.As: DSR, AODV etc. use the shortest jumping figure as the Path selection foundation.ABR etc. adopt path length effective time as the routing standard when selecting the path.These single yardsticks can not reflect the quality condition of Radio Link fully, and especially in the multichannel environment, the route that single criterion is selected is not necessarily optimum.
Secondly, the Routing Protocol of existing wireless mesh network mostly is single footpath route agreement greatly, and the multipath route is the focus in the current research.In the mesh network, use single footpath route agreement not only to take place congested or link can not be reselected suitable path when disconnecting well, nor can when underloading, make full use of resource at network.From the angle of business, dissimilar service needed takies different bandwidth, and the QoS differences such as time delay that require, and the path of different link-qualities need be provided for different business.The packet of different kinds of business sends on same paths all if destination node is identical, when certain bar link congestion or disconnection, all data that send by this link just all must be sent by new path, just caused the instability at networking, and Business Stream is not assigned on the available resources rationally and effectively, cause that the subnetwork resource excessively uses, and other parts are used fully.Obviously, single footpath route agreement can not make full use of Internet resources, avoids congestion link, reach NLB, and can't satisfy the QoS demand of different kinds of business.
On the other hand, link-state routing protocol based on topology information can be by the evaluation to link-quality, provide and have the path that QoS ensures, but route maintenance can need constantly be carried out because of the inefficacy of one or several node in the path, mobile often interruption in the path end to end of its foundation.For Routing Protocol based on geographical location information, changes of topology structure is less to the influence of route, but compare routing mechanism based on part or global Topological Structure information, can only transmit packet according to positional information that close on or destination node based on the geographical position routing mechanism, and can't describe the path that it is set up with cost, thereby can't provide QoS to ensure business.
In sum: the Routing Protocol of existing wireless mesh network adopts single evaluation index to weigh the link-quality of a link, and still unresolved effective network source is distributed and utilized, and the QoS performance.
Summary of the invention
Technical problem to be solved by this invention is: overcome the problem of the link-quality that single link-quality evaluation index can't a link of thoroughly evaluating, solve the problem that the single path agreement can not rationally be utilized Internet resources; Solve the path failure of link-state routing protocol and the professional adaptive problem of different QoS requirements.
The present invention solves the problems of the technologies described above the technical scheme that is adopted to be: the network topology structure of the rule by making up a kind of stratification, and under this topological structure, adopt comprehensive link-quality evaluation index, calculate many paths that arrive the purpose sub-district of different link-qualities, and introduce fault-tolerant Routing Protocol, thereby the business of realization different QoS requirements and agreement and path is adaptive based on geographical location information; It is characterized in that: by by effective topological control strategy, and constitute a kind of method for routing of level regularization mesh network, may further comprise the steps based on Link State and geographical location information:
A, the effective topological control strategy of employing make the virtual stratification topological structure of wireless mesh network formation rule.
B, based on the virtual stratification wireless mesh network of A step, adopt comprehensive link-quality evaluation index to estimate the quality of link, obtain the LSD of the whole network unanimity by hello packet, present node obtains to arrive the multipath of the different link-qualities of purpose sub-district on this basis.
C, under the regular virtual topology of A step, obtain the geographical location information of network others node by hello packet, employing selects next redirect to send out the sub-district based on the fault-tolerant Routing Protocol of geographical location information according to a kind of mechanism based on angle, up to packet being sent to the purpose sub-district.
In the described steps A, the wireless mesh network method that forms original planar structure is: any node is by periodically sending explore frame detects whether there is the constructed network of other node in its frequency coverage, if any then directly adding this network, do not have and then it is set up a new network as start node, wait for that then other node inserts this network; After all nodes all add this network, just formed the wireless mesh network of original planar structure, and the transmission of beginning Business Stream, its flow process is as shown in Figure 1.
In the described steps A, in the transmission course of Business Stream, form this network all nodes by to the source address self study of Business Stream, set up one and be used for transmitting of primary data forwarding, form a plurality of virtual subdistricts by effective topological control strategy on this basis then, and comprise a plurality of actual nodes in each virtual subdistrict again, as shown in Figure 2.
In the described steps A, adopting the virtual topological structure of the rule of effective topological control strategy formation, is that the node division that its geographical position is close becomes the sub-district, and all nodes in the sub-district are formed a virtual subdistrict, and the virtual subdistrict structure as shown in Figure 3.The direct communication mutually of the node of each virtual subdistrict inside, and realize multi-hop communication between the interior nodes of different virtual sub-district, in this process, node will be by the source address self study process to Business Stream, sets up second and is used for transmitting of data forwarding in the sub-district.
Among the described step B, the reliability of the port by weighing single link and the bandwidth of link, the quality that factors such as the error rate, data burst rate, packet number of retransmissions, security of system, routing stability, energy are come this link-quality of overall merit.
Among the described step B, the all-network node by obtain each adjacent node send carry and these neighbours between the hello packet of information such as link-quality index, adjacent node ID and adjacent node place virtual subdistrict ID of link, at the whole network intercycle inundation.
Among the described step B, for making LSD reach the synchronous of the whole network, the LSD of node has two kinds of update modes, and the one, periodically send hello packet by node, upgrade and the maintenance link slip condition database; The 2nd, when node deviated from network or link failure were arranged in network, node sent hello packet immediately, and the state change information of topology is sent to other node in the network.Hello packet inundation process as shown in Figure 4.
Among the described step B, solve cell-of-origin S multipath finding method in the D of purpose sub-district and be: at first obtain by cell-of-origin S to the shortest path information of purpose sub-district D and that this information is deposited into multipath is concentrated by the dijkstra method.Other all nodes except that source node and destination node in the set of this multipath of deletion in the virtual topology figure of the whole network then obtain upgrading shortest path information under the topological structure condition by the dijkstra method again, and this information is concentrated to multipath.Repeat above-mentioned steps, up to all independent pathway information of acquisition.
Among the described step B, node obtains comprising information such as purpose sub-district ID, next jumping sub-district ID, cost by obtaining the multipath information that arrives the purpose sub-district, form the routing table that is used for the multi-hop cell communication of node, and then can obtain to be used for the route forwarding table that next-hop node is transmitted by this routing table.
Among the described step C, node obtains geographical coordinate information such as its present located longitude and latitude by the GPS positioner, and will carry in the hello packet of this information at the whole network inundation.
Among the described step C, calculate current area and purpose sub-district and and other adjacent cell between formed angle theta (as shown in Figure 5), the neighbor cell of θ angle minimum is sent out sub-district (as shown in Figure 6) as next redirect.
Among the described step C, when node runs into maximum non-concave erea when (as shown in Figure 7) in the process of forwarding data, node at first selects dextrorotation (as shown in Figure 8) to walk around this maximum non-concave erea, jump the sub-district if can find next smoothly, then Business Stream is passed to this sub-district, when can not find next jumping sub-district on the dextrorotation direction, selects left hand direction to select next to jump sub-district, if can find next to jump the sub-district smoothly, then Business Stream is passed to this sub-district.When node all can not find next when jumping sub-district in left-handed and dextrorotation direction, will give this packet rollback last one to jump the sub-district, then go up one and jump other next jumping sub-district of cell selecting and transmit.When the life span field of packet reduces to 0, abandon this packet.
Beneficial effect of the present invention is: the method for routing that has proposed a kind of level regularization mesh network, by wireless mesh network being carried out effectively topology control, the virtual hierarchical structure of formation rule, and the Routing Protocol of fusion position-based and Link State, improved channel in the wireless network and professional adaptation ability, effectively raised fault-tolerant, the load balancing and the professional QoS performance of wireless me sh network.
Description of drawings
Fig. 1 is the formation flow chart of mesh network
Fig. 2 is virtual stratification topological structure
Fig. 3 is the virtual subdistrict schematic diagram
Fig. 4 is a node inundation hello packet schematic diagram
Fig. 5 is by become θ angle schematic diagram with neighbor cell
Fig. 6 jumps the cell selecting schematic diagram for next
Fig. 7 is maximum non-concave erea schematic diagram
Next jumps cell selecting schematic diagram to Fig. 8 when running into maximum non-concave erea
Fig. 9 is the whole network node inundation hello packet schematic diagram
Figure 10 is for forming the virtual topology schematic diagram
Figure 11 obtains to arrive the schematic diagram of purpose sub-district multipath for node
Embodiment
With embodiment the present invention is described in further detail with reference to the accompanying drawings below:
Basic ideas of the present invention are as follows: the wireless mesh network that node is formed is through the virtual hierarchical structure of effective topological control strategy formation rule, select the Routing Protocol of position-based or Link State then according to the QoS demand of different kinds of business, packet is sent to destination node.
1. the Routing Protocol of Link State
As shown in Figure 9, all nodes of the whole network periodically send hello packet, and hello packet is inundation in the scope of the whole network.When node b receives the hello packet that node on every side starts, and when comprising the node ID of oneself in the message, will set up neighborhood, this node is joined in the neighbor table with this node.Afterwards, will carry the information relevant in the hello packet that starts by node b with these neighbours.
Node b sets up LSD by the hello packet that other node of reception the whole network is sent, and this database upgrades by the cycle and triggers the hello packet that upgrades transmission and reaches the synchronous of the whole network.
On the basis of LSD, node b will obtain the cum rights virtual topology figure (as shown in figure 10) of the whole network, constructing with own sub-district of living in by multiple dijkstra algorithm is the mulitpath (as shown in figure 11) of the arrival destination node place virtual subdistrict 3 in source, just obtain the multipath routing table then, comprised the path of many different link-qualities that arrive same purpose sub-district in this table.
At this moment, when node b has the business of certain QoS demand such as speech to produce, will search the multipath routing table, select to meet the path (promptly in routing table, having found corresponding next to jump sub-district) of QoS demand.
2. based on the Routing Protocol in geographical position
(a) as shown in Figure 5, certain actual node in the virtual subdistrict S has broadcasting etc. lower or do not require that the business of types such as QoS guarantee will send to purpose sub-district D to qos requirement, and then at first whether testing goal sub-district D is the neighbor cell of sub-district S.
(b) when finding that purpose sub-district D is not its neighbor cell, with regard to calculation plot S and purpose sub-district D and and other neighbor cell between formed angle theta, as shown in Figure 6, the neighbor cell a of selection θ angle minimum sends out the sub-district as next redirect.
(c) as shown in Figure 8, when dummy node a sends packet, send when running into maximum non-concave erea, preferentially select the sub-district that the purpose direction takes over (if do not have, the sub-district of the direction of then selecting to take back, selected the sub-district b that takes among Fig. 8), packet is sent to this sub-district.
(d) other nodes will repeat above-mentioned steps then, know packet is sent to the purpose sub-district.After arriving the purpose sub-district, packet will directly be jumped communication by one in the sub-district and will be sent to destination node.
In addition, except adaptation does not have the business demand of QoS guarantee, when the multipath routing table of node lost efficacy, also will directly initiate Routing Protocol based on the geographical position.
The invention provides a kind of method for routing of level regularization mesh network, by controlling to wireless mesh network is effectively topological, the virtual hierarchical structure of formation rule, and the Routing Protocol of fusion position-based and Link State, realize channel in the wireless network and professional adaptive, realize fault-tolerant, the load balancing and the raising QoS performance of wireless mesh network.

Claims (12)

1.本发明通过构建一种层次化的规则的网络拓扑结构,并在该拓扑结构下,采用综合的链路质量评价指标,计算出不同链路质量的多条到达目的小区的路径,且引入基于地理位置信息的容错路由协议,从而实现不同QoS需求的业务与协议以及路径的适配;其特征在于:由通过有效的拓扑控制策略,以及基于链路状态和地理位置信息所构成一种层次规则化mesh网络的路由方法,包括以下步骤:1. The present invention is by constructing a kind of network topological structure of hierarchical rule, and under this topological structure, adopts comprehensive link quality evaluation index, calculates a plurality of paths of different link qualities to reach the destination cell, and introduces A fault-tolerant routing protocol based on geographical location information, so as to realize the adaptation of services and protocols and paths with different QoS requirements; it is characterized in that: a layer is formed by effective topology control strategies and based on link status and geographical location information A routing method for a regularized mesh network, comprising the following steps: A、采用有效的拓扑控制策略使无线mesh网络形成规则的虚拟层次化拓扑结构。A. Adopt an effective topology control strategy to make the wireless mesh network form a regular virtual hierarchical topology structure. B、基于A步骤的虚拟层次化无线mesh网络,采用综合的链路质量评价指标评价链路的质量,通过hello报文获得全网一致的链路状态数据库,当前节点在此基础上获得到达目的小区的不同链路质量的多路径。B. Based on the virtual hierarchical wireless mesh network in step A, the comprehensive link quality evaluation index is used to evaluate the quality of the link, and the consistent link state database of the entire network is obtained through the hello message. On this basis, the current node obtains the destination Multiple paths of different link qualities for a cell. C、在A步骤的规则虚拟拓扑下,通过hello报文获取网络其它节点的地理位置信息,采用基于地理位置信息的容错路由协议,根据一种基于角度的机制选择下一跳转发小区,直到将数据包发送到目的小区。C. Under the regular virtual topology in step A, obtain the geographic location information of other nodes in the network through the hello message, adopt a fault-tolerant routing protocol based on geographic location information, and select the next hop forwarding cell according to an angle-based mechanism, until Send the data packet to the destination cell. 2.根据权利要求1所述的层次规则化mesh网络路由方法,其特征在于:所述步骤A中,形成原始的平面结构的无线mesh网络方法为:任意一节点通过周期性发送探测帧检测其频率覆盖范围内是否存在其它节点所构建的网络,如有则直接加入该网络,无则将其做为起始节点建立一个新的网络,然后等待其它节点接入该网络;当所有节点都加入该网络后,就形成了原始的平面结构的无线mesh网络,并开始业务流的传输。2. The hierarchical regularization mesh network routing method according to claim 1, characterized in that: in the step A, the wireless mesh network method of forming the original planar structure is: any node detects its Whether there is a network built by other nodes within the frequency coverage, if there is, join the network directly, if not, use it as the starting node to build a new network, and then wait for other nodes to access the network; when all nodes join After the network is established, the original planar wireless mesh network is formed, and the transmission of business flows begins. 3.根据权利要求1所述的层次规则化mesh网络路由方法,其特征在于:所述步骤A中,在业务流的传输过程中,组成该网络的的所有节点通过对业务流的源地址自学习,建立一个用于初始数据转发的转发表,然后在此基础上通过有效的拓扑控制策略形成多个虚拟小区,并且每个虚拟小区内又包含多个实际节点。3. The hierarchical regularization mesh network routing method according to claim 1, characterized in that: in the step A, in the transmission process of the service flow, all nodes forming the network automatically pass the source address of the service flow Learning, establish a forwarding table for initial data forwarding, and then form multiple virtual cells through effective topology control strategies on this basis, and each virtual cell contains multiple actual nodes. 4.根据权利要求1所述的层次规则化mesh网络路由方法,其特征在于:所述步骤A中,所述步骤A中,采用有效的拓扑控制策略形成的规则的虚拟拓扑结构,是将其地理位置相近的节点划分成小区,小区内的所有节点组成一个虚拟小区。每个虚拟小区内部的节点可以相互直接通信,且不同虚拟小区内节点间实现多跳通信,在此过程中,节点将通过对业务流的源地址自学习过程,建立第二个用于小区内数据转发的转发表。4. the hierarchical regularization mesh network routing method according to claim 1, is characterized in that: in the described step A, in the described step A, adopt the virtual topological structure of the rule that effective topology control strategy forms, be its Nodes with similar geographical locations are divided into cells, and all nodes in the cell form a virtual cell. Nodes inside each virtual cell can communicate directly with each other, and multi-hop communication is realized between nodes in different virtual cells. The forwarding table for data forwarding. 5.根据权利要求1所述的层次规则化mesh网络路由方法,其特征在于:所述步骤B中,通过衡量单条链路的端口的可靠性以及链路的带宽,误码率、数据突发率、数据包重传次数、系统安全性、路由稳定性、能量等因素来综合评价该链路质量的好坏。5. The hierarchical regularization mesh network routing method according to claim 1, characterized in that: in the step B, by measuring the reliability of the port of a single link and the bandwidth of the link, bit error rate, data burst The quality of the link is comprehensively evaluated based on factors such as rate, number of data packet retransmissions, system security, routing stability, and energy. 6.根据权利要求1所述的层次规则化mesh网络路由方法,其特征在于:所述步骤B中,所有网络节点通过获取各相邻节点发送携带与该邻居之间链路的链路质量指标、邻近节点ID以及邻近节点所在虚拟小区ID等信息的hello报文,在全网内周期性洪泛。6. The hierarchical regularized mesh network routing method according to claim 1, characterized in that: in the step B, all network nodes transmit the link quality index carrying the link with the neighbor by obtaining each adjacent node , neighboring node IDs, and virtual cell IDs where neighboring nodes are located, the hello packets are periodically flooded in the entire network. 7.根据权利要求1所述的层次规则化mesh网络路由方法,其特征在于:所述步骤B中,为使得链路状态数据库达到全网的同步,节点的链路状态数据库有两种更新方式,一是通过节点周期性发送hello报文,来更新和维护链路状态数据库;二是在网络中有节点离开网络、或链路失效时,节点立即发送hello报文,将拓扑的状态变化信息发送给网络中的其它节点。7. The hierarchical regularization mesh network routing method according to claim 1, characterized in that: in the step B, in order to make the link state database reach the synchronization of the whole network, the link state database of the node has two kinds of update modes , one is to update and maintain the link state database through nodes periodically sending hello messages; the other is to send hello messages immediately when a node in the network leaves the network or the link fails sent to other nodes in the network. 8.根据权利要求1所述的层次规则化mesh网络路由方法,其特征在于:所述步骤B中,解决源小区S到目的小区D中多路径寻找方法为:首先通过dijkstra方法得到由源小区S到目的小区D的最短路径信息并把此信息存入到多路径集中。然后在全网的虚拟拓扑图中删除此多路径集合中除源节点和目的节点外的其它所有节点,再通过dijkstra方法得到更新拓扑结构条件下的最短路径信息,将此信息到多路径集中。重复上述步骤,直到获得所有独立路径信息。8. The hierarchical regularized mesh network routing method according to claim 1, characterized in that: in the step B, the solution to the multi-path search method from the source cell S to the destination cell D is: first obtain the source cell by the dijkstra method The shortest path information from S to the destination cell D and store this information in the multipath set. Then delete all nodes in the multipath set except the source node and destination node in the virtual topology graph of the whole network, and then obtain the shortest path information under the condition of updating the topology through the dijkstra method, and put this information into the multipath set. Repeat the above steps until all independent path information is obtained. 9.根据权利要求1所述的层次规则化mesh网络路由方法,其特征在于:所述步骤B中,节点通过获取到达目的小区的多路径信息得到包括目的小区ID、下一跳小区ID、代价等信息,形成节点的用于多跳小区通信的路由表,进而可通过该路由表获得用于下一跳节点转发的路由转发表。9. The hierarchical regularized mesh network routing method according to claim 1, characterized in that: in the step B, the node obtains the multipath information including the destination cell ID, the next hop cell ID, the cost and other information to form a node's routing table for multi-hop cell communication, and then the routing table for next-hop node forwarding can be obtained through the routing table. 10.根据权利要求1所述的层次规则化mesh网络路由方法,其特征在于:所述步骤C中,节点通过GPS定位装置获其当前所处的经纬度等地理坐标信息,并将携带该信息的hello报文中在全网洪泛。10. The hierarchical regularized mesh network routing method according to claim 1, characterized in that: in the step C, the node obtains geographic coordinate information such as its current latitude and longitude through a GPS positioning device, and sends the information carrying the information The hello packets are flooded throughout the network. 11.根据权利要求1所述的层次规则化mesh网络路由方法,其特征在于:所述步骤C中,计算当前小区与目的小区以及与其它邻近小区之间所形成的夹角θ,将θ角最小的邻居小区作为下一跳转发小区。11. The hierarchical regularized mesh network routing method according to claim 1, characterized in that: in the step C, calculate the angle θ formed between the current cell and the target cell and other adjacent cells, and use the θ angle The smallest neighbor cell is used as the next hop forwarding cell. 12.根据权利要求1所述的层次规则化mesh网络路由方法,其特征在于:所述步骤C中,当节点在转发数据的过程中遇到最大非凹区时,节点首先选择右旋以绕过该最大非凹区,若能顺利找到下一跳小区,则业务流被传递至该小区,当在右旋方向上找不到下一跳小区时,选择左旋方向选择下一跳小区,若能顺利找到下一跳小区,则业务流被传递至该小区。当节点在左旋和右旋方向都找不到下一跳小区时,将会把该数据包回退给上一跳小区,则上一跳小区选择其它的下一跳小区进行转发。当数据包的生存时间字段减少到0时,丢弃该数据包。12. The hierarchical regularized mesh network routing method according to claim 1, characterized in that: in the step C, when the node encounters the largest non-concave area in the process of forwarding data, the node first chooses right-handed to go around After the largest non-concave area, if the next hop cell can be successfully found, the service flow will be delivered to this cell. When the next hop cell cannot be found in the right-hand direction, choose the left-hand direction to select the next hop cell. If If the next hop cell can be successfully found, the service flow is delivered to the cell. When the node cannot find the next hop cell in both left-hand and right-hand directions, it will return the data packet to the previous hop cell, and the previous hop cell will select another next hop cell for forwarding. When the time-to-live field of a packet decreases to 0, the packet is discarded.
CN2011100252846A 2011-01-24 2011-01-24 Hierarchical and regular mesh network routing method Pending CN102149161A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2011100252846A CN102149161A (en) 2011-01-24 2011-01-24 Hierarchical and regular mesh network routing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2011100252846A CN102149161A (en) 2011-01-24 2011-01-24 Hierarchical and regular mesh network routing method

Publications (1)

Publication Number Publication Date
CN102149161A true CN102149161A (en) 2011-08-10

Family

ID=44423089

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2011100252846A Pending CN102149161A (en) 2011-01-24 2011-01-24 Hierarchical and regular mesh network routing method

Country Status (1)

Country Link
CN (1) CN102149161A (en)

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102548034A (en) * 2011-12-26 2012-07-04 哈尔滨工业大学 Wireless automatic-energy-concentration corrosion monitoring sensor network for heavy and large reinforced concrete structure
US20140362700A1 (en) * 2013-06-05 2014-12-11 Futurewei Technologies, Inc. System and Method for Managing a Wireless Network
US9210047B2 (en) 2012-01-11 2015-12-08 Huawei Technologies Co., Ltd. Method and apparatus for presenting network path
CN105450524A (en) * 2015-12-08 2016-03-30 北京飞讯数码科技有限公司 Media forwarding routing optimization algorithm
CN105722181A (en) * 2016-04-12 2016-06-29 江苏中科羿链通信技术有限公司 Method for obtaining neighbor node information in wireless chained multi-hop network
CN107204919A (en) * 2017-07-06 2017-09-26 中国科学技术大学 A kind of edge through street based on POF by with caching system and method
CN109089219A (en) * 2018-06-08 2018-12-25 国网河北省电力有限公司石家庄供电分公司 The automobile-used inspection communication means of high-tension cable inspection
CN109379739A (en) * 2018-09-28 2019-02-22 嘉兴学院 A Trusted Collaborative Service Method for Maritime Wireless Mesh Networks
CN111479305A (en) * 2020-04-16 2020-07-31 西安交通大学 TDMA mobile self-organizing network MAC layer routing method based on intelligent antenna
CN114338513A (en) * 2021-12-24 2022-04-12 南京邮电大学 Method and system for fast decision-making of wireless multi-hop routing based on cross-layer information perception
CN116419364A (en) * 2023-06-09 2023-07-11 杭州粒合信息科技有限公司 Wi-SUN network and extension method through wired virtual radio frequency transmission

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
PHAM NGOC THAI等: "HIERARCHICAL ROUTING IN WIRELESS MESH NETWORK", 《ADVANCED COMMUNICATION TECHNOLOGY,THE 9TH INTERNATIONAL CONFERENCE》 *
胡致远等: "无线Mesh网络规则拓扑规则结构与容量研究", 《计算机应用研究》 *
胡致远等: "虚拟层次化无线mesh网络信道分配策略", 《北京航空航天大学学报》 *

Cited By (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102548034A (en) * 2011-12-26 2012-07-04 哈尔滨工业大学 Wireless automatic-energy-concentration corrosion monitoring sensor network for heavy and large reinforced concrete structure
CN102548034B (en) * 2011-12-26 2015-04-08 哈尔滨工业大学 Wireless automatic-energy-concentration corrosion monitoring sensor network for heavy and large reinforced concrete structure
US9210047B2 (en) 2012-01-11 2015-12-08 Huawei Technologies Co., Ltd. Method and apparatus for presenting network path
US20140362700A1 (en) * 2013-06-05 2014-12-11 Futurewei Technologies, Inc. System and Method for Managing a Wireless Network
US9532266B2 (en) * 2013-06-05 2016-12-27 Huawei Technologies Co., Ltd. Systems and methods for managing a wireless network
US10506612B2 (en) 2013-06-05 2019-12-10 Huawei Technologies Co., Ltd. Methods and device for authorization between a customer device and connectivity manager
CN105450524A (en) * 2015-12-08 2016-03-30 北京飞讯数码科技有限公司 Media forwarding routing optimization algorithm
CN105450524B (en) * 2015-12-08 2020-06-09 北京飞讯数码科技有限公司 Method for optimizing and calculating media forwarding route
CN105722181B (en) * 2016-04-12 2019-03-29 江苏中科羿链通信技术有限公司 The method of information of neighbor nodes is obtained in wireless chain multihop network
CN105722181A (en) * 2016-04-12 2016-06-29 江苏中科羿链通信技术有限公司 Method for obtaining neighbor node information in wireless chained multi-hop network
CN107204919A (en) * 2017-07-06 2017-09-26 中国科学技术大学 A kind of edge through street based on POF by with caching system and method
CN107204919B (en) * 2017-07-06 2020-01-03 中国科学技术大学 POF-based edge fast routing and caching system and method
CN109089219A (en) * 2018-06-08 2018-12-25 国网河北省电力有限公司石家庄供电分公司 The automobile-used inspection communication means of high-tension cable inspection
CN109089219B (en) * 2018-06-08 2020-07-28 国网河北省电力有限公司石家庄供电分公司 Inspection communication method for high-voltage cable inspection vehicle
CN109379739A (en) * 2018-09-28 2019-02-22 嘉兴学院 A Trusted Collaborative Service Method for Maritime Wireless Mesh Networks
CN111479305A (en) * 2020-04-16 2020-07-31 西安交通大学 TDMA mobile self-organizing network MAC layer routing method based on intelligent antenna
CN114338513A (en) * 2021-12-24 2022-04-12 南京邮电大学 Method and system for fast decision-making of wireless multi-hop routing based on cross-layer information perception
CN114338513B (en) * 2021-12-24 2024-07-23 南京邮电大学 Wireless multi-hop routing fast decision method and system based on cross-layer information perception
CN116419364A (en) * 2023-06-09 2023-07-11 杭州粒合信息科技有限公司 Wi-SUN network and extension method through wired virtual radio frequency transmission
CN116419364B (en) * 2023-06-09 2023-08-29 杭州粒合信息科技有限公司 Wi-SUN network and extension method through wired virtual radio frequency transmission

Similar Documents

Publication Publication Date Title
CN102149161A (en) Hierarchical and regular mesh network routing method
Wang et al. CORMAN: A novel cooperative opportunistic routing scheme in mobile ad hoc networks
US8064377B2 (en) Method for enhancement of multicasting forwarding protocol in a wireless network
JP5812917B2 (en) Method for discovering multiple routes in a multi-hop network and node for searching for multiple routes
CN101415248A (en) Method for establishing layer-striding dynamic source route protocol based on load balance
Asokan A review of Quality of Service (QoS) routing protocols for mobile Ad hoc networks
CN110995333B (en) A Clustering QoS Routing Design Method
Gulati et al. A review of qos routing protocols in manets
Gorbil et al. Supporting QoS traffic at the network layer in multi-hop wireless mobile networks
So et al. Routing and channel assignment in multi-channel multi-hop wireless networks with single network interface
CN105516000A (en) Stable and efficient adaptive routing strategy used in wireless mobile Mesh network
Srinivasan et al. Stability and energy aware multipath routing for mobile ad hoc networks
Malviya et al. New load balanced multi-path dynamic source routing protocol for mobile ad-hoc network
Rao et al. Performance analysis of manet routing protocols DSDV, DSR, AODV, AOMDV using NS-2
Bitam et al. MQBM: an autonomic QoS multicast routing protocol for mobile ad hoc networks
Kunz Routing solutions for hierarchical MANETs
King et al. A DSDV-based multipath routing protocol for mobile ad-hoc networks
Bravo-Torres et al. An efficient combination of topological and geographical routing for VANETs on top of a virtualization layer
Bargaoui et al. Hybrid QoS based routing for IEEE 802.16 j mesh infrastructure
Bedi et al. Study Of Routing Protocols: Single And Multipath For WMN
Zhu et al. A congestion and interference aware routing metric for Wireless Mesh networks
Sakeena et al. QoS aware routing protocol to improve route maintenance in Mobile Ad-Hoc Networks
JP2003219472A (en) Communication system and communication method
Kaafar et al. A topology-aware overlay multicast approach for Mobile Ad-Hoc Networks
Bharghavan CEDAR: a Core-Extraction Distributed Ad hoc Routing algorithm

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20110810