CN116156595A - Routing method and device of mobile ad hoc network based on geographic grid - Google Patents
Routing method and device of mobile ad hoc network based on geographic grid Download PDFInfo
- Publication number
- CN116156595A CN116156595A CN202111388994.5A CN202111388994A CN116156595A CN 116156595 A CN116156595 A CN 116156595A CN 202111388994 A CN202111388994 A CN 202111388994A CN 116156595 A CN116156595 A CN 116156595A
- Authority
- CN
- China
- Prior art keywords
- grid
- node
- target
- forwarding
- code
- 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
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- Y—GENERAL 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
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE 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/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
In the routing method, the routing device and the storage medium of the mobile ad hoc network based on the geographic grids, a position server of a grid where a source node is located can receive a data packet sent by the source node, determine a node identification code of a target node, acquire a target grid code where the target node is located through the node identification code of the target node, store adjacent grids with smaller distances from the current grid to the target grid according to the target grid code into a candidate forwarding grid set, determine the adjacent grid with the smallest distance from the candidate forwarding grid to the target grid as a next hop, and forward the data packet of the source node to any node in the next hop adjacent grids. Therefore, in the method provided by the disclosure, the node space is discretized based on the geographic grids, and the speed of updating and searching the position of the node is improved and the route forwarding delay is reduced through the algebraic coding calculation among the grids.
Description
Technical Field
The present disclosure relates to the field of mobile ad hoc networks, and in particular, to a method and apparatus for routing a mobile ad hoc network based on a geographic grid, and a storage medium.
Background
With the development of information technology and the internet, the need for mobile ad hoc networks is increasing. A mobile ad hoc network is a multi-hop wireless network that does not rely on any fixed infrastructure, with nodes having dual identities of routers and ordinary nodes. Thus, routing can be performed in the mobile ad hoc network based on the location information of the node.
However, in the related art, the routing protocol based on the location information is to select a route based on the latitude and longitude coordinates where the node is located, and because the latitude and longitude coordinates are complex, the speed of updating and searching the location of the node is slower, and the delay of forwarding the route is longer. And, when a node in the mobile ad hoc network fails or moves farther, the route needs to be re-planned, thereby generating larger routing overhead.
Disclosure of Invention
The application provides a routing method, a routing device and a storage medium of a mobile ad hoc network based on a geographic grid, which are used for at least solving the technical problems of slower speed of updating and searching the position of a node and longer routing forwarding delay in the related technology.
An embodiment of a first aspect of the present application provides a routing method for a mobile ad hoc network based on a geographic grid, wherein the mobile ad hoc network is constructed by using the geographic grid, a node is determined in each grid as a location server, and geographic identifiers of all nodes in the grid are stored in the location server, and the geographic identifiers include a grid code and a node identifier, and the routing method includes:
receiving a data packet sent by a source node, and determining a node identification code of a target node;
acquiring a target grid code of a target node through a node identification code of the target node;
according to the target grid code, storing adjacent grids with smaller distances from the current grid to the target grid into a candidate forwarding grid set;
determining the adjacent grid with the smallest distance to the target grid as the next hop;
and forwarding the data packet of the source node to any node in the next-hop adjacent grid.
An embodiment of a second aspect of the present application provides a routing device of a mobile ad hoc network based on a geographic grid, including:
the receiving module is used for receiving the data packet sent by the source node and determining the node identification code of the target node;
the acquisition module is used for acquiring a target grid code where the target node is located through the node identification code of the target node;
the selecting module is used for storing adjacent grids smaller than the distance from the current grid to the target grid into a candidate forwarding grid set according to the target grid code;
a determining module, configured to determine, as a next hop, a neighboring mesh with a minimum distance from the candidate forwarding mesh to the target mesh;
and the forwarding module is used for forwarding the data packet of the source node to any node in the next-hop grid.
The embodiment of the third aspect of the application provides a computer storage medium, wherein the computer storage medium stores computer executable instructions; the computer executable instructions, when executed by a processor, are capable of implementing the method as described in the first aspect above.
The computer device according to the fourth aspect of the present application includes a memory, a processor, and a computer program stored in the memory and capable of running on the processor, where the processor executes the program to implement the method according to the first aspect.
The technical scheme provided by the embodiment of the application at least brings the following beneficial effects:
in the routing method, the routing device and the storage medium of the mobile ad hoc network based on the geographic grids, a position server of a grid where a source node is located can receive a data packet sent by the source node, determine a node identification code of a target node, acquire a target grid code where the target node is located through the node identification code of the target node, store adjacent grids with smaller distances from a current grid to the target grid according to the target grid code into a candidate forwarding grid set, determine the adjacent grid with the smallest distance from the candidate forwarding grid to the target grid as a next hop, and forward the data packet of the source node to any node in the next hop adjacent grids. Therefore, in the method provided by the disclosure, the node space is discretized based on the geographic grid, and the position of the node is updated and searched faster through the algebraic calculation of the codes among the grids. Meanwhile, in the method provided by the disclosure, the position server can determine the grid with the minimum distance from the target grid as the next hop of the route, so that the route forwarding delay is reduced.
In addition, in the method provided by the disclosure, the topological relation between the nodes is converted into the connection mode between the grids, so that the grids are used as the basic unit of forwarding, and the probability of forwarding failure caused by the fact that a single node moves out of a broadcasting range in the forwarding process is reduced.
Additional aspects and advantages of the application will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the application.
Drawings
The foregoing and/or additional aspects and advantages of the present application will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings, in which:
fig. 1 is a flow chart of a method for routing a mobile ad hoc network based on a geographic grid according to an embodiment of the present application;
FIG. 2 is a schematic diagram of a mobile ad hoc network based on a geographic grid according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a routing device of a mobile ad hoc network based on a geographic grid according to an embodiment of the present application.
Detailed Description
Embodiments of the present application are described in detail below, examples of which are illustrated in the accompanying drawings, wherein the same or similar reference numerals refer to the same or similar elements or elements having the same or similar functions throughout. The embodiments described below by referring to the drawings are exemplary and intended for the purpose of explaining the present application and are not to be construed as limiting the present application.
In the routing method, the routing device and the storage medium of the mobile ad hoc network based on the geographic grids, a position server of a grid where a source node is located can receive a data packet sent by the source node, determine a node identification code of a target node, acquire a target grid code where the target node is located through the node identification code of the target node, store adjacent grids with smaller distances from a current grid to the target grid according to the target grid code into a candidate forwarding grid set, determine the adjacent grid with the smallest distance from the candidate forwarding grid to the target grid as a next hop, and forward the data packet of the source node to any node in the next hop adjacent grids. Therefore, in the method provided by the disclosure, the node space is discretized based on the geographic grid, and the position of the node is updated and searched faster through the algebraic calculation of the codes among the grids. Meanwhile, in the method provided by the disclosure, the position server can determine the grid with the minimum distance from the target grid as the next hop of the route, so that the route forwarding delay is reduced.
In addition, in the method provided by the disclosure, the topological relation between the nodes is converted into the connection mode between the grids, so that the grids are used as the basic unit of forwarding, and the probability of forwarding failure caused by the fact that a single node moves out of a broadcasting range in the forwarding process is reduced.
The following describes a method and an apparatus for routing a mobile ad hoc network based on a geographic grid according to an embodiment of the present application with reference to the accompanying drawings.
Example 1
Fig. 1 is a flow chart of a routing method of a mobile ad hoc network based on a geographic grid according to an embodiment of the present application, as shown in fig. 1, may include:
In the embodiment of the disclosure, a mobile ad hoc network is constructed by using geographic grids, each grid has a unique grid code, and the grid codes of all nodes in the same grid are the same. And, in the embodiments of the present disclosure, each node has its own node identification code, and the node identification code of each node is unique.
And, in an embodiment of the present disclosure, the geographic area is divided into a number of grids according to a geographic meshing method. Wherein the choice of mesh size may be determined by the transmission range of the node.
Specifically, in an embodiment of the present disclosure, the relationship between the mesh size and the transmission range may include: the transmission radius of the node is r, the grid side length is d, then
It is thereby ensured that a node in one grid can communicate with nodes in eight adjacent grids around, as shown in fig. 2.
Further, in an embodiment of the present disclosure, one node is determined as a location server in each grid, and geographic identifiers of all nodes in the grid are stored in the location server, where the geographic identifiers include a grid code and a node identification code.
In an embodiment of the present disclosure, a method for determining a location server in a grid may include: fixed nodes in the grid and/or nodes with more resource energy are selected.
It should be noted that, in the embodiment of the present disclosure, when a fixed node in a grid is selected as a location server, the location server may stably serve the node in the grid, so as to avoid overhead caused by updating information of all nodes in the grid due to movement or replacement of the location server. In the embodiment of the disclosure, the nodes with more resource energy in the grid are located at positions where more data information needs to be stored and accessed, so that the speed of updating and searching the positions of the nodes can be improved.
And, in embodiments of the present disclosure, a location server within the grid may issue information requests to nodes within the grid at regular intervals (e.g., 30 minutes) to update the geographic identity of the nodes within the grid at regular intervals.
Further, in the embodiment of the present disclosure, the location server in the grid may further send a data packet to the location server of the adjacent grid, so as to update the location information of the location server in real time, so as to select the adjacent grid forwarding the data packet subsequently.
Further, in the embodiment of the present disclosure, when the location server moves out of the original grid, the location server sends information to the root server where the original grid is located, and then the root server where the original grid is located selects a new location server and sends information to the location server in the adjacent grid, so that the location server in the adjacent grid updates the information.
In the embodiment of the disclosure, after the location server receives the data packet sent by the source node in the grid, the node identification code of the target node may be obtained according to the data packet.
In the embodiment of the disclosure, the location server may obtain, through the root server, the target grid code where the target node is located according to the node identifier of the target node.
And 103, storing adjacent grids smaller than the distance from the current grid to the target grid into a candidate forwarding grid set according to the target grid code.
In the embodiment of the disclosure, if the target mesh is within the communication range of the current mesh, the data packet of the source node is directly forwarded to the target node in the target mesh.
And in the embodiment of the disclosure, the location server acquires the network state of the adjacent grid and judges whether the adjacent grid is a hole grid. In the embodiment of the disclosure, if there are no nodes in the grid and the grid is outside the communication range of other nodes, no node can communicate with the grid, and the grid is a hole grid.
Further, in an embodiment of the present disclosure, the location server obtains a distance from an adjacent mesh, which is not a hole mesh, to a target mesh according to the target mesh code, and stores an adjacent mesh smaller than a distance from a current mesh to the target mesh in the candidate forwarding mesh set so as to pass through the adjacent mesh to the target mesh.
In an embodiment of the present disclosure, if the candidate forwarding grid set is empty, the method for determining the next-hop grid may include the following steps:
and a, constructing a plan according to node distribution in the current network.
And b, selecting the adjacent grid as the next hop in a counterclockwise direction by adopting a right-hand rule according to the plan view.
And, in embodiments of the present disclosure, the location server may identify a state of each grid (e.g., a hole grid) based on a division of the geographic grid, according to a distribution of nodes in the grid, forming a grid plan.
Further, in the embodiment of the present disclosure, according to the plan view, the right-hand rule is adopted to select the adjacent grid of the non-hole grid as the next hop in the counterclockwise direction.
In the embodiment of the present disclosure, after the location server forwards the data packet of the source node to any node in the next-hop adjacent grid, the location server of the next-hop adjacent grid repeats the steps 101 to 105 until the data packet is forwarded to the target node in the target grid.
And in the embodiment of the disclosure, the location server marks the grid of the forwarded data packet, so as to avoid a loop in the forwarding process of the data packet.
For example, in the embodiment of the present disclosure, when the location server performs the next-hop mesh selection, if the neighboring mesh has forwarded the current packet, the neighboring mesh is not selected into the candidate forwarding mesh set.
In the routing method of the mobile ad hoc network based on the geographic grid, a position server of a grid where a source node is located can receive a data packet sent by the source node, determine a node identification code of a target node, acquire a target grid code where the target node is located through the node identification code of the target node, store adjacent grids with smaller distances from the current grid to the target grid into a candidate forwarding grid set according to the target grid code, determine the adjacent grid with the smallest distance from the candidate forwarding grid set to the target grid as a next hop, and forward the data packet of the source node to any node in the next hop adjacent grids. Therefore, in the method provided by the disclosure, the node space is discretized based on the geographic grid, and the position of the node is updated and searched faster through the algebraic calculation of the codes among the grids. Meanwhile, in the method provided by the disclosure, the position server can determine the grid with the minimum distance from the target grid as the next hop of the route, so that the route forwarding delay is reduced.
In addition, in the method provided by the disclosure, the topological relation between the nodes is converted into the connection mode between the grids, so that the grids are used as the basic unit of forwarding, and the probability of forwarding failure caused by the fact that a single node moves out of a broadcasting range in the forwarding process is reduced.
Example two
Fig. 3 is a schematic structural diagram of a routing device of a mobile ad hoc network based on a geographic grid according to an embodiment of the present application, as shown in fig. 3, may include:
the receiving module 301 is configured to receive a data packet sent by a source node, and determine a node identifier of a target node.
And the acquiring module 302 is configured to acquire, by using the node identifier of the target node, the target trellis code in which the target node is located.
The selecting module 303 is configured to store, according to the target mesh code, an adjacent mesh that is smaller than a distance from the current mesh to the target mesh into the candidate forwarding mesh set.
A determining module 304, configured to determine, as a next hop, an adjacent mesh with a minimum distance from the candidate forwarding mesh to the target mesh.
A forwarding module 305, configured to forward the data packet of the source node to any node in the next-hop mesh.
In an embodiment of the present disclosure, the forwarding module is further configured to directly forward the data packet of the source node to the target mesh if the target mesh is within the communication range of the current mesh.
And, in an embodiment of the present disclosure, the determining module is further configured to:
if the candidate forwarding grid set is empty, constructing a plan according to node distribution in the current network;
according to the plan view, the right hand rule is adopted to select the adjacent grid as the next hop in a counterclockwise direction.
In the routing method, the routing device and the storage medium of the mobile ad hoc network based on the geographic grids, a position server of a grid where a source node is located can receive a data packet sent by the source node, determine a node identification code of a target node, acquire a target grid code where the target node is located through the node identification code of the target node, store adjacent grids with smaller distances from a current grid to the target grid according to the target grid code into a candidate forwarding grid set, determine the adjacent grid with the smallest distance from the candidate forwarding grid to the target grid as a next hop, and forward the data packet of the source node to any node in the next hop adjacent grids. Therefore, in the method provided by the disclosure, the node space is discretized based on the geographic grid, and the position of the node is updated and searched faster through the algebraic calculation of the codes among the grids. Meanwhile, in the method provided by the disclosure, the position server can determine the grid with the minimum distance from the target grid as the next hop of the route, so that the route forwarding delay is reduced.
In addition, in the method provided by the disclosure, the topological relation between the nodes is converted into the connection mode between the grids, so that the grids are used as the basic unit of forwarding, and the probability of forwarding failure caused by the fact that a single node moves out of a broadcasting range in the forwarding process is reduced.
In order to implement the above-described embodiments, the present disclosure also proposes a computer storage medium.
The computer storage medium provided by the embodiment of the disclosure stores an executable program; the executable program, when executed by a processor, is capable of implementing the method as shown in fig. 1.
In order to implement the above-mentioned embodiments, the present disclosure also proposes a computer device.
The embodiment of the disclosure provides a computer device comprising a memory, a processor and a computer program stored on the memory and capable of running on the processor; the processor, when executing the program, is capable of implementing the method as shown in fig. 1.
In the description of the present specification, a description referring to terms "one embodiment," "some embodiments," "examples," "specific examples," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present application. In this specification, schematic representations of the above terms are not necessarily directed to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, the different embodiments or examples described in this specification and the features of the different embodiments or examples may be combined and combined by those skilled in the art without contradiction.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and additional implementations are included within the scope of the preferred embodiment of the present application in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the embodiments of the present application.
Although embodiments of the present application have been shown and described above, it will be understood that the above embodiments are illustrative and not to be construed as limiting the application, and that variations, modifications, alternatives, and variations may be made to the above embodiments by one of ordinary skill in the art within the scope of the application.
Claims (10)
1. A routing method of a mobile ad hoc network based on a geographic grid, characterized in that the mobile ad hoc network is constructed by utilizing the geographic grid, a node is determined in each grid as a location server, geographic identifiers of all nodes in the grid are stored in the location server, wherein the geographic identifiers comprise grid codes and node identification codes, and the method comprises the following steps:
receiving a data packet sent by a source node, and determining a node identification code of a target node;
acquiring a target grid code of a target node through a node identification code of the target node;
according to the target grid code, storing adjacent grids smaller than the distance from the current grid to the target grid into a candidate forwarding grid set;
determining the adjacent grid with the smallest distance to the target grid as the next hop;
and forwarding the data packet of the source node to any node in the next-hop adjacent grid.
2. The routing method of claim 1, wherein the geographic identification of all nodes in the grid in which the location server resides comprises information that the location server updates nodes within the grid at regular intervals.
3. The routing method of claim 2, wherein when the location server moves out of an original grid, the original grid will select a new location server.
4. The routing method of claim 1, wherein the method further comprises:
if the target grid is within the communication range of the current grid, the data packet of the source node is directly forwarded to the target grid.
5. The routing method of claim 1, wherein the method further comprises:
if the candidate forwarding grid set is empty, constructing a plan according to node distribution in the current network;
and selecting the adjacent grid as the next hop in a counterclockwise direction by adopting a right-hand rule according to the plan view.
6. A routing apparatus for a mobile ad hoc network based on a geographical grid, the apparatus comprising:
the receiving module is used for receiving the data packet sent by the source node and determining the node identification code of the target node;
the acquisition module is used for acquiring a target grid code where the target node is located through the node identification code of the target node;
the selecting module is used for storing adjacent grids smaller than the distance from the current grid to the target grid into a candidate forwarding grid set according to the target grid code;
a determining module, configured to determine, as a next hop, a neighboring mesh with a minimum distance from the candidate forwarding mesh to the target mesh;
and the forwarding module is used for forwarding the data packet of the source node to any node in the next-hop grid.
7. The routing device of claim 6, wherein the forwarding module is further configured to forward the packet of the source node directly to the destination mesh if the destination mesh is within communication range of the current mesh.
8. The routing device of claim 6, wherein the determining module is further configured to:
if the candidate forwarding grid set is empty, constructing a plan according to node distribution in the current network;
and selecting the adjacent grid as the next hop in a counterclockwise direction by adopting a right-hand rule according to the plan view.
9. A computer storage medium, wherein the computer storage medium stores computer-executable instructions; the computer-executable instructions, when executed by a processor, are capable of implementing the method of claims 1-5.
10. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the method of any of claims 1-5 when the program is executed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111388994.5A CN116156595A (en) | 2021-11-22 | 2021-11-22 | Routing method and device of mobile ad hoc network based on geographic grid |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111388994.5A CN116156595A (en) | 2021-11-22 | 2021-11-22 | Routing method and device of mobile ad hoc network based on geographic grid |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116156595A true CN116156595A (en) | 2023-05-23 |
Family
ID=86354922
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111388994.5A Pending CN116156595A (en) | 2021-11-22 | 2021-11-22 | Routing method and device of mobile ad hoc network based on geographic grid |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116156595A (en) |
-
2021
- 2021-11-22 CN CN202111388994.5A patent/CN116156595A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Flury et al. | MLS: an efficient location service for mobile ad hoc networks | |
| Jain et al. | Geographical routing using partial information for wireless ad hoc networks | |
| Li et al. | A scalable location service for geographic ad hoc routing | |
| Maghsoudlou et al. | A survey on geographic routing protocols for mobile ad hoc networks | |
| KR101634585B1 (en) | Method for disseminating data based geographic location of drone in drone network | |
| CN1326068C (en) | Hierarchical mobile ad-hoc network and methods for performing reactive routing therein | |
| Acer et al. | Weak state routing for large scale dynamic networks | |
| Yu et al. | Scalable opportunistic VANET content routing with encounter information | |
| Arianmehr et al. | HybTGR: a hybrid routing protocol based on topological and geographical information in vehicular ad hoc networks | |
| Mahmood et al. | Position based and hybrid routing protocols for mobile ad hoc networks: a survey | |
| Alowish et al. | Performance Evaluation of a Cluster Based Routing Protocol for VANETs. | |
| EP3425861A1 (en) | Improved routing in an heterogeneous iot network | |
| Mao et al. | S4: Small state and small stretch compact routing protocol for large static wireless networks | |
| Pham et al. | Geographical awareness hybrid routing protocol in mobile ad hoc networks | |
| KR101288101B1 (en) | Method and mobile node for routing in mobile wireless network system | |
| Brahmi et al. | Routing in vehicular ad hoc networks: towards road-connectivity based routing | |
| CN116156595A (en) | Routing method and device of mobile ad hoc network based on geographic grid | |
| US20220417829A1 (en) | Multipath geographic routing protocol | |
| Widmer et al. | Position-based routing in ad hoc wireless networks | |
| Urquiza-Aguiar et al. | 2hGAR: 2-hops geographical anycast routing protocol for vehicle-to-infrastructure communications | |
| Brahmi et al. | An improved map-based location service for vehicular ad hoc networks | |
| Singh et al. | Energy efficient clearance routing in WSN | |
| KR101359860B1 (en) | Method for searching continuous nearest neighbor object in mobile ad-hoc based p2p network | |
| Dabideen et al. | Owl: Towards scalable routing in manets using depth-first search on demand | |
| Benbadis et al. | ELIP: Embedded location information protocol |
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 |