CN112532514A - Organization method of wireless network based on OLSR routing protocol - Google Patents
Organization method of wireless network based on OLSR routing protocol Download PDFInfo
- Publication number
- CN112532514A CN112532514A CN202011307557.1A CN202011307557A CN112532514A CN 112532514 A CN112532514 A CN 112532514A CN 202011307557 A CN202011307557 A CN 202011307557A CN 112532514 A CN112532514 A CN 112532514A
- Authority
- CN
- China
- Prior art keywords
- routing
- network
- area
- wireless network
- overhead
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/24—Multipath
- H04L45/245—Link aggregation, e.g. trunking
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides an organizing method based on an OLSR routing protocol wireless network, wherein the wireless network comprises a plurality of routing switching nodes, and a single routing switching node comprises a plurality of interfaces, which is characterized in that: the organizing method comprises the following steps: firstly), dividing a plurality of interfaces in a wireless network into a plurality of area networks according to areas, then allocating area ID numbers to the area networks, and then allocating respective aggregation network segments to the area networks; secondly), carrying out routing information interaction on a plurality of area networks according to the first method; and thirdly) calculating a routing table. The wireless network organization method can improve the expandability, stability and high efficiency of the wireless network based on the OLSR routing protocol.
Description
Technical Field
The invention relates to the technical field of wireless network communication, in particular to an organization method of a wireless network based on an OLSR routing protocol.
Background
The OLSR routing protocol is an optimized link state routing protocol of a table-driven working manner proposed by IETF MANET (mobile Ad Hoc network) working group for wireless mobile Ad Hoc networks. The protocol has undergone a number of improvements, refinements and enhancements since its release in month 10 of 2003. However, with the rapid development and large-scale use of narrow-band wireless networks, especially ultrashort wave radio station technologies, the OLSR routing protocol is unable to support, resulting in limited network scale and affecting its full application.
Therefore, the wireless network based on the OLSR routing protocol has limited scale, poor expandability, insufficient convergence efficiency and low stability, and is a problem to be solved at present.
Disclosure of Invention
Aiming at the problems of the background art, the invention provides an organization method of a wireless network based on an OLSR (on-line analytical processing) routing protocol, which aims to solve the problems of limited scale, poor expandability, low convergence efficiency and insufficient stability of the wireless network based on the OLSR routing protocol in the prior art.
In order to achieve the object of the present invention, the present invention provides an organizing method based on an OLSR routing protocol wireless network, where the wireless network includes a plurality of routing switch nodes, and a single routing switch node includes a plurality of interfaces, and the organizing method is characterized in that: the organizing method comprises the following steps:
firstly), dividing a plurality of interfaces in a wireless network into a plurality of area networks according to areas, then allocating area ID numbers to the area networks, and then allocating respective aggregation network segments to the area networks;
secondly), carrying out routing information interaction on a plurality of area networks according to the first method;
thirdly), calculating a routing table;
the first method comprises the following steps:
the inside of a single area network carries out routing information interaction according to an OLSR routing protocol, and a plurality of area networks carry out routing information interaction in a routing access mode; the route access mode is as follows: the routing exchange node corresponding to the interface governed by a single region assembles HNA messages according to the region, and diffuses and synchronizes the assembled HNA messages in the whole wireless network;
the HNA message is assembled according to the following modes: if the aggregation network segment is successfully allocated in the region, filling the aggregation network segment information and network segment routing information which does not fall into the aggregation network segment in an HNA message, wherein the network segment routing information which falls into the aggregation network segment is not additionally assembled in the HNA message; if the aggregation network segment is not successfully allocated in the area, filling all network segment routing information in the area into the HNA message;
as optimization, in the third step), when calculating the comprehensive routing cost of the routing table, each area network calculates the area network cost of each route in the area network according to the OLSR routing protocol, and also needs to calculate the access routing cost obtained by the routing cost of a non-area network; the comprehensive routing overhead is the sum of the access routing overhead and the lowest overhead in the area network.
The principle of the invention is as follows:
the wireless network based on the OLSR routing protocol is divided into a plurality of regional networks, network routing information interaction is carried out in a single regional network according to the original OLSR protocol, and the regional networks are interacted in a routing access mode, namely, the routing information interaction is carried out in a mode of an aggregation network segment (aggregation routing information or comprehensive superposed routing information). The wireless network organization mode of the divided area network greatly saves protocol overhead, greatly improves the convergence rate of the whole network, greatly shortens the time for obtaining a routing table, ensures that the whole wireless network is more stable, and has higher transmission speed.
Therefore, the invention has the following beneficial effects: by adopting the organizing method based on the OLSR routing protocol wireless network, the expandability, the stability and the high efficiency of the wireless network can be improved.
Drawings
The drawings of the present invention are described below.
Figure 1 is a schematic diagram of the network topology of the present invention.
In the figure: 1. a routing switching node 1; 2. a routing switching node 2; 3. a routing switching node 3; 4. a routing switching node 4; 5. a routing switching node 5; a1, area network 1; a2, area network 2; a3, area network 3.
Detailed Description
The present invention will be further described with reference to the following examples.
The wireless network topology diagram based on the OLSR routing protocol as shown in fig. 1 includes a routing switching node 1 to a routing switching node 5, a single routing switching node includes multiple interfaces, and an organization method for the wireless network includes:
one) a plurality of interfaces in a wireless network are divided into a plurality of area networks according to areas, in this embodiment, 3 area networks from an area network 1 to an area network 3 are divided, the area network 1 includes interfaces of a route switching node 1, a route switching node 3 and a route switching node 5, the area network 2 includes interfaces of both the route switching node 1 and the route switching node 2, and the area network 3 includes interfaces of both the route switching node 3 and the route switching node 4; then distributing area ID numbers for each area network, in the embodiment, the area ID numbers of the area network 1, the area network 2 and the area network 3 are respectively 1, 2 and 3, then distributing respective aggregation network segments for each area network, wherein a single aggregation network segment is in the same area network, and a plurality of network segments with longer subnet mask bit numbers are aggregated into a network segment with shorter subnet mask bit numbers, namely a plurality of pieces of routing information are superposed to form comprehensive routing information;
secondly), carrying out routing information interaction on a plurality of area networks according to the first method;
the first method comprises the following steps:
and the inside of the single area network carries out routing information interaction according to an OLSR routing protocol: each routing switching node corresponding to an interface belonging to the same area network periodically sends a HELLO message to a 1-hop neighbor routing switching node in the area to maintain the neighbor relation, and the HELLO message only assembles neighbor link information in the area network; each routing switching node related to a single regional area network carries out MPR election in the regional area network, and an election result is assembled into a TC message and broadcast and spread in the region; the routing information in the region is interacted according to the OLSR routing protocol in the prior art;
carrying out routing information interaction among a plurality of area networks in a routing access mode; the route access mode is as follows: the routing exchange node corresponding to the interface governed by a single region assembles HNA messages according to the region, and diffuses and synchronizes the assembled HNA messages in the whole wireless network; the following table one and table two are respectively the OLSR routing protocol header format and HNA message format related to the improved area network:
the first table is as follows:
the second table is:
the number of the experienced area networks in the table two is the number of the area networks experienced by routing information transmission except the origin area network and the current area network;
the HNA message is assembled according to the following modes: if the aggregation network segment is successfully allocated in the region, filling the aggregation network segment information and network segment routing information which does not fall into the aggregation network segment in an HNA message, wherein the network segment routing information which falls into the aggregation network segment is not additionally assembled in the HNA message; if the aggregation network segment is not successfully allocated in the area, filling all network segment routing information in the area into the HNA message;
thirdly), calculating a routing table;
in the third step), when calculating the comprehensive routing overhead of the routing table, each area network not only calculates the area network overhead of each route in the area network according to the OLSR routing protocol, but also calculates the access routing overhead obtained by the routing overhead of the non-area network; the comprehensive routing overhead is the sum of the access routing overhead and the lowest overhead in the area network.
Taking the routing switching node 1 in fig. 1 as an example, the routing switching node 1 includes a plurality of interfaces belonging to the area network 1 and a plurality of interfaces belonging to the area network 2;
the area ID numbers of all message headers sent from the area network 2 to the area network 1 through the routing switching node 1 are 1, and HNA messages sent from the area network 2 to the area network 1 are assembled in the following mode: if the regional network 2 is allocated with the aggregation network segment, the aggregation network segment of the regional network 2 is filled in the HNA message, and routing information which does not fall in the aggregation network segment of the regional network 2 is also required to be filled in the HNA message, and the routing information which falls in the aggregation network segment of the regional network 2 is not additionally filled in the HNA message; if the regional network 2 is not allocated with the aggregation network segment, all the routing information in the regional network 2 is filled in the HNA message. Meanwhile, the ID number of the origin area in the HNA message is 2, and the number of the experienced area networks is 0.
The area IDs of all headers sent from the area network 1 and the area network 3 to the area network 2 are 2. When the routing information of the local area network 1 and the routing information of the local area network 3 acquired through the local area network 1 are sent to the local area network 2, the HNA message is assembled in the following mode: if the regional network 1 is allocated with the aggregation network segment, the aggregation network segment of the regional network 1 is filled in the HNA message, and routing information (including routing information of the regional network 1 and the regional network 3) which does not fall into the aggregation network segment of the regional network 1 is also required to be filled in the HNA message, and the routing information which falls into the aggregation network segment of the regional network 1 is not additionally filled in the HNA message; and if the regional network 1 is not allocated with the aggregation network segment, completely filling the routing information of all the regional networks 1 and 3 in the HNA message. Wherein the origin area ID of the area network 1 is 1, and the number of the experienced area networks is 0; the source area ID of the area network 3 is 3, and the experience area is 1.
The calculation of the composite routing cost of each route is as follows (see fig. 1):
the first embodiment is as follows: setting a certain route (hereinafter referred to as route one) to access the area network 2 through the route switching node 2, and to diffuse to the area network 1 through the route switching node 1, and calculating the comprehensive route overhead of the route one as follows:
an access interface of a route-access area network 2 is set as an X interface of a route switching node 2 (the X interface belongs to the area network 2), and the cost of the route-access route at the X interface is set as k11Let k be the lowest overhead in the area network 2 from the routing node 2 to the routing node 112Then the composite route cost K of route one1＝k11+k12(ii) a Wherein k is11、k12All can be calculated according to the method of the OLSR routing protocol in the prior art.
Example two: setting a certain route (hereinafter referred to as a second route) to access the area network 3 through a route switching node 4, wherein the second route passes through the area network 1 and then is diffused to the area network 2 through the route switching node 1, and calculating the comprehensive route overhead of the second route according to the following mode:
an access interface of a routing two access area network 3 is set as a Y interface of a routing switching node 4 (the Y interface belongs to the area network 3), and the access routing overhead of the routing two at the Y interface is set as k21The lowest overhead in the area network 3 from the route switching node 4 to the route switching node 3 is set to k22The lowest overhead in the area network from the route switching node 3 to the route switching node 1 in the area network 1 is set to k23Then the comprehensive routing overhead K of route two2＝k21+k22+k23Wherein k is21、k22、k23All can be calculated according to the method of the OLSR routing protocol in the prior art.
Claims (2)
1. An organizing method based on an OLSR routing protocol wireless network, the wireless network comprising a plurality of routing switch nodes, a single routing switch node comprising a plurality of interfaces, characterized in that: the organizing method comprises the following steps:
firstly), dividing a plurality of interfaces in a wireless network into a plurality of area networks according to areas, then allocating area ID numbers to the area networks, and then allocating respective aggregation network segments to the area networks;
secondly), carrying out routing information interaction on a plurality of area networks according to the first method;
thirdly), calculating a routing table;
the first method comprises the following steps:
the inside of a single area network carries out routing information interaction according to an OLSR routing protocol, and a plurality of area networks carry out routing information interaction in a routing access mode; the route access mode is as follows: the routing exchange node corresponding to the interface governed by a single region assembles HNA messages according to the region, and diffuses and synchronizes the assembled HNA messages in the whole wireless network;
the HNA message is assembled according to the following modes: if the aggregation network segment is successfully allocated in the region, filling the aggregation network segment information and network segment routing information which does not fall into the aggregation network segment in an HNA message, wherein the network segment routing information which falls into the aggregation network segment is not additionally assembled in the HNA message; and if the aggregation network segment is not successfully allocated in the area, filling all network segment routing information in the area into the HNA message.
2. The OLSR routing protocol wireless network based organization method of claim 1, wherein: in the third step), when calculating the comprehensive routing overhead of the routing table, each area network not only calculates the area network overhead of each route in the area network according to the OLSR routing protocol, but also calculates the access routing overhead obtained by the routing overhead of the non-area network; the comprehensive routing overhead is the sum of the access routing overhead and the lowest overhead in the area network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011307557.1A CN112532514B (en) | 2020-11-20 | 2020-11-20 | Organization method of wireless network based on OLSR routing protocol |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011307557.1A CN112532514B (en) | 2020-11-20 | 2020-11-20 | Organization method of wireless network based on OLSR routing protocol |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112532514A true CN112532514A (en) | 2021-03-19 |
| CN112532514B CN112532514B (en) | 2022-02-18 |
Family
ID=74981901
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011307557.1A Active CN112532514B (en) | 2020-11-20 | 2020-11-20 | Organization method of wireless network based on OLSR routing protocol |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112532514B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120307825A1 (en) * | 2011-06-01 | 2012-12-06 | Cisco Technology, Inc. | Maintained message delivery during routing domain migration |
| US20130034031A1 (en) * | 2011-08-03 | 2013-02-07 | Harris Corporation, Corporation Of The State Of Delaware | Ad hoc wireless communications network with node role information routing and associated methods |
| CN109104366A (en) * | 2018-08-29 | 2018-12-28 | 重庆大学 | A kind of link duration calculation method, MPR node selecting method and Routing Protocol |
-
2020
- 2020-11-20 CN CN202011307557.1A patent/CN112532514B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120307825A1 (en) * | 2011-06-01 | 2012-12-06 | Cisco Technology, Inc. | Maintained message delivery during routing domain migration |
| US20130034031A1 (en) * | 2011-08-03 | 2013-02-07 | Harris Corporation, Corporation Of The State Of Delaware | Ad hoc wireless communications network with node role information routing and associated methods |
| CN109104366A (en) * | 2018-08-29 | 2018-12-28 | 重庆大学 | A kind of link duration calculation method, MPR node selecting method and Routing Protocol |
Non-Patent Citations (2)
| Title |
|---|
| 王忠等: "无线自组织网络中OLSRv2协议", 《兰州大学学报(自然科学版)》 * |
| 黄松华等: "对抗环境下机间自组织网络服务质量保障方法", 《指挥与控制学报》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112532514B (en) | 2022-02-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1806012B1 (en) | System and method to support multicast routing in large scale wireless mesh networks | |
| US10491411B2 (en) | Limiting forwarding of multicast communications | |
| US11290295B2 (en) | Multi-network operation with member node for multicast groups | |
| CN104125617B (en) | A kind of system and method for mobile terminal ad hoc network | |
| US20190165961A1 (en) | Multi-network operation for multicast groups | |
| JP2005503721A (en) | Network with several sub-networks | |
| CN104158867B (en) | Information multi-hop forwarding method based on WAVE (wireless access in vehicular environments) protocol | |
| Gao et al. | Throughput and delay scaling in supportive two-tier networks | |
| CN105187529A (en) | Internet of vehicles implementation method based on positioning information | |
| Chapnevis et al. | Traffic shifting based resource optimization in aggregated IoT communication | |
| CN105007570B (en) | A kind of mobile ad-hoc network jamming control method based on OLSR agreement | |
| CN105119828A (en) | Fast wireless network routing achievement method | |
| WO2022228162A1 (en) | Communication method, apparatus, and system | |
| Lin et al. | A dynamic slot assignment algorithm of TDMA for the distribution class protocol using node neighborhood information | |
| Ahmed | A novel multi-hop routing protocol for D2D communications in 5G | |
| CN105049347A (en) | Routing method of DTN (Delay Tolerant Network) based on social network task distribution model | |
| CN104869601A (en) | Communication realization method of next-generation internet of vehicle | |
| Ahmed | A Low-Overhead Multi-Hop Routing Protocol for D2D Communications in 5G. | |
| CN111770516B (en) | Transmission method for ad hoc network communication | |
| CN109510769A (en) | A kind of fusion route system being suitable for width combination network and its method | |
| CN112532514B (en) | Organization method of wireless network based on OLSR routing protocol | |
| An et al. | A mobility-based hybrid multicast routing in mobile ad-hoc wireless networks | |
| Hsu et al. | QoS Routing in multihop packet radio environment | |
| Li et al. | Design and analysis of low signaling overhead multiple access protocol for wireless ad hoc networks | |
| CN110418409A (en) | Channel resource coordinated allocation method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |