WO2023164789A1 - Procédé de protocole de routage, réseau mobile ad hoc, station et support de stockage - Google Patents

Procédé de protocole de routage, réseau mobile ad hoc, station et support de stockage Download PDF

Info

Publication number
WO2023164789A1
WO2023164789A1 PCT/CN2022/078529 CN2022078529W WO2023164789A1 WO 2023164789 A1 WO2023164789 A1 WO 2023164789A1 CN 2022078529 W CN2022078529 W CN 2022078529W WO 2023164789 A1 WO2023164789 A1 WO 2023164789A1
Authority
WO
WIPO (PCT)
Prior art keywords
site
routing information
station
network
routing
Prior art date
Application number
PCT/CN2022/078529
Other languages
English (en)
Chinese (zh)
Inventor
张东东
Original Assignee
海能达通信股份有限公司
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 海能达通信股份有限公司 filed Critical 海能达通信股份有限公司
Priority to PCT/CN2022/078529 priority Critical patent/WO2023164789A1/fr
Publication of WO2023164789A1 publication Critical patent/WO2023164789A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]

Definitions

  • the present application relates to the technical field of communication, and more specifically, relates to a routing protocol method, a mobile ad hoc network, a station and a storage medium.
  • Mobile ad hoc network (Mobile Ad Hoc Network, MANET) is a special wireless mobile communication network, it does not depend on any network infrastructure, has a strong self-organization, robustness and invulnerability, in the military, It has broad application prospects in the field of emergency rescue, disaster relief and emergency communication. Any node in the mobile ad-hoc network can take on the role of terminal and router at the same time. Even if some nodes in the network fail, thanks to the strong anti-damage and self-healing capabilities of the network structure, it can still be maintained to a large extent. The normal communication of the entire network avoids the occurrence of network paralysis.
  • the stations in the mobile ad hoc network cannot obtain the routing information of the whole network, and the intelligence of the network is low.
  • the purpose of this application is to provide a routing protocol method, mobile ad hoc network, site and storage medium, including the following technical solutions:
  • a routing protocol method for a mobile ad hoc network comprising:
  • the first site periodically broadcasts the first routing information throughout the network; wherein, the first routing information includes: the identification of the first site and the identification of the neighboring sites of the first site; the first site is the Any station in the mobile ad hoc network;
  • the first site After receiving the routing information broadcast by each non-first site, the first site updates the network-wide routing information maintained by the first site based on the routing information broadcast by each site, and the network-wide routing information includes: identities, and the identities of neighboring sites of each site.
  • the first routing information further includes: a counting parameter, and a first initial value of the counting parameter, and the counting parameter is used to determine that the first routing information arrives from the first site The number of hops experienced by the non-first site;
  • the method further includes: after receiving the first routing information, the first transit station adds 1 to the count parameter in the first routing information and then forwards; the first transit station is the mobile ad hoc network Any one of the stations forwarding the first routing information;
  • the network-wide routing information further includes: corresponding to each non-first site, the minimum number of hops from the non-first site to the first site.
  • the first routing information further includes: a message handle of the first site; the message handle is used to identify a version of the first routing information;
  • the updating of the network-wide routing information maintained by the first site based on the routing information broadcast by each site includes:
  • the network-wide routing information maintained by the first site is updated based on the latest version of routing information broadcast by each site.
  • the first routing information further includes at least one of the following:
  • the positioning information of the first station The positioning information of the first station, the field strength value of the first station, the transmission power of the first station, and the remaining power of the first station.
  • different stations broadcast routing information on the whole network in different time slices of the same period.
  • each period includes a routing time window, a routing redundancy time window and a service time window;
  • the routing redundancy time window is used for broadcasting routing information when the broadcast time slot of the first site is occupied by the transfer of business data or the first site cannot accurately estimate its time slot position in the routing time window ;
  • the service time window is used for transfer of service data.
  • the length of the time slice is determined in the following manner:
  • the minimum hop count corresponding to each site pair represents the minimum hop count from one site in the site pair to another site in the site pair;
  • the length of the time slice is determined according to the maximum value N and the delay and frame consumption time of forwarding routing information by a single station.
  • the stations in the mobile ad hoc network include a main station and several common stations;
  • routing time window, routing redundancy time window and service time window are determined by the primary site and broadcast to the several common sites throughout the network within the service time window.
  • the above method preferably, also includes:
  • the whole network broadcasts a site online message;
  • the site online message includes: the identity of the second site;
  • the non-second site After receiving the site online message, the non-second site adds information about the second site to the network-wide routing information maintained by the non-second site;
  • the primary site also returns an online response message to the second site, so that the second site obtains the identification of each site in the mobile ad hoc network; the The online response message includes: the identification of each station in the mobile ad hoc network.
  • the above method preferably, also includes:
  • the main site regularly broadcasts the heartbeat information of the main site throughout the network;
  • the entire network broadcasts the primary site heartbeat information to declare it as the new primary site.
  • the above method preferably, also includes:
  • the first common site broadcasts the primary site heartbeat information and receives the primary site heartbeat information broadcast by the second common site, determining the priorities of the first common site and the second common site;
  • the first common site broadcasts the heartbeat information of the main site in the whole network again; otherwise, the first common site no longer broadcasts the main site Heartbeat information.
  • the above method preferably, also includes:
  • the master site broadcasts a master site designation message throughout the network;
  • the master site designation message includes an identifier of a designated new master site;
  • the designated new primary site After the designated new primary site receives the primary site designation message, if it is determined that this site can be the primary site, the whole network broadcasts the heartbeat information of the primary site.
  • the above method preferably, also includes:
  • the first site If the first site has not received the routing information broadcast or forwarded by the first neighbor site of the first site for M consecutive periods, send neighbor query information to the first neighbor site; the first neighbor site is Any one of the neighboring stations of the first station; if no response message from the first neighboring station is received, the first station deletes the information of the first neighboring station in the routing information maintained by the first station.
  • the above method preferably, also includes:
  • the first site does not receive routing information broadcast by a non-first site for K consecutive periods, and deletes information about all neighboring sites of the first site in the routing information maintained by the site.
  • a mobile ad hoc network comprising several stations, wherein,
  • the first site is used to periodically broadcast first routing information across the entire network, where the first routing information includes: an identifier of the first site and an identifier of a neighboring site of the first site; the first site is Any station in the mobile ad hoc network;
  • the first site is further configured to update the entire network routing information maintained by the first site based on the routing information broadcast by each site after receiving the routing information broadcast by each non-first site, and the entire network routing information includes: The identification of each site, and the identification of the adjacent sites of each site.
  • a kind of station is used for mobile ad hoc network, is characterized in that, described station comprises:
  • a processor configured to call and execute the program in the memory, and implement the steps of the routing protocol method described in any one of the preceding items by executing the program.
  • a computer-readable storage medium, on which a computer program is stored, is characterized in that, when the computer program is executed by a processor, each step of the routing protocol method described in any one of the above items is realized.
  • a site for a mobile ad hoc network characterized in that the site is a first site, and the first site includes:
  • the broadcast module is used to periodically broadcast the first routing information throughout the network; wherein, the first routing information includes: the identification of the first site and the identification of the neighboring sites of the first site; the first site is Any station in the mobile ad hoc network;
  • the processing module is configured to update the network-wide routing information maintained by the first site based on the routing information broadcast by each site after receiving the routing information broadcast by each site other than the first site, and the network-wide routing information includes: each site's identities, and the identities of neighboring sites of each site.
  • the first routing information periodically broadcast by the first site (any site in the mobile ad hoc network) across the entire network Including: the identification of the first site and the identification of the neighboring sites of the first site; after receiving the routing information broadcast by each non-first site, the first site updates the network-wide routing information maintained by the first site based on the routing information broadcast by each site , the network-wide routing information includes: the identifier of each site, and the IDs of neighboring sites of each site.
  • each site in the mobile ad hoc network broadcasts the relevant information of the site and its neighbors, so that each site can obtain the identification of each site and the identification of each site's neighbors , so that each site can topology the network connection of the entire network, that is, each site can obtain the routing information of the entire network, thereby improving the intelligence of the mobile ad hoc network.
  • Fig. 1 is a kind of implementation flowchart of the routing protocol method that the embodiment of the present application provides;
  • FIG. 2a is a schematic diagram of a mobile ad hoc network provided by an embodiment of the present application.
  • FIG. 2b is another schematic diagram of the mobile ad hoc network provided by the embodiment of the present application.
  • FIG. 2c is another schematic diagram of the mobile ad hoc network provided by the embodiment of the present application.
  • FIG. 3 is an example diagram of an allocation of time windows within a broadcast period provided by an embodiment of the present application
  • FIG. 4 is another schematic diagram of the mobile ad hoc network provided by the embodiment of the present application.
  • FIG. 5 is a schematic structural diagram of a site provided by an embodiment of the present application.
  • FIG. 6 is another schematic structural diagram of a site provided by an embodiment of the present application.
  • Existing routing protocol methods mainly include AODV (Ad hoc On-demand Distance Vector Routing, on-demand plane distance vector routing protocol) protocol and DSDV (Destination Sequenced Distance Vector Routing, destination node sequence distance vector routing protocol) protocol; wherein,
  • the basic principle of the AODV protocol is that when a node needs to transmit information to other nodes in the network, if there is no route to the target node, it must first send a RREQ (routing request) message in the form of multicast.
  • the network layer addresses of the originating node and the target node are recorded in the RREQ message.
  • the adjacent node receives the RREQ, it first judges whether the target node is itself. If yes, then send RREP (route response) to the initiating node; if not, first look up whether there is a route to the target node in the routing table, if so, then unicast RREP to the source node, otherwise continue to forward RREQ to search.
  • this routing protocol cannot enable nodes to determine the routing information of the entire network, and this routing protocol method sends a RREQ message before initiating a request, and needs to receive RREP to determine the routing direction before initiating a service. There is a problem that the service initiation is not immediate.
  • the basic principle of the DSDV protocol is that each node maintains the shortest path routing table information from this node to other nodes.
  • the basic elements of routing table information include: the number of hops from this node to other nodes, the next hop node and node sequence from this node to other nodes.
  • the protocol periodically broadcasts the routing table information between adjacent nodes to update the shortest communication path between each node.
  • the DSDV protocol method has at least the following problems: 1. All routing information (i.e. routing table information) maintained by periodic broadcast nodes between adjacent nodes, along with the increase of the number of nodes in the network, the information broadcast between adjacent nodes increases exponentially, The requirements for network bandwidth are high, and it is not suitable for the network environment of private network with narrow bandwidth and low bandwidth. 2.
  • the routing table information maintained by each node only maintains the hop count and the next hop node id information of the path to the destination node. According to the routing table information, the network connection status of the entire network cannot be topologically, but in the private network industry, real-time Monitoring the network environment is very important.
  • periodic broadcasts between adjacent nodes cause lag and disorder in broadcasting routing information between nodes. Since there are not many available channel resources in a narrowband environment, periodic but disorderly broadcasts by each node are prone to collisions, which may cause collisions with ordinary services. The probability of collision is also high, which is not suitable for private network narrowband environment.
  • an implementation flow chart of the routing protocol method provided by the embodiment of the present application may include:
  • Step S101 The first site periodically broadcasts routing information (referred to as first routing information) across the entire network.
  • the first routing information includes: the identifier of the first site and the identifiers of neighboring sites of the first site.
  • the first site is any site in the mobile ad hoc network, that is to say, each site in the mobile ad hoc network periodically broadcasts routing information throughout the network, and the routing information periodically broadcast by each site includes The identity of this site and the identities of neighboring sites of this site.
  • each site in the mobile ad hoc network when each site in the mobile ad hoc network periodically broadcasts routing information throughout the network, it only broadcasts information about its own site and its neighbors, and does not broadcast information about other sites.
  • the identifier of the first site may refer to a unique identification code of the first site.
  • the site's unique identifier may be pre-assigned and stored in the site. It can also be calculated in real time according to the information in the site.
  • the specific implementation manner is not specifically limited.
  • the identifier of the first site may be the MAC address of the first site, or may be a hash value calculated according to the MAC address of the first site.
  • Neighboring sites of the first site are non-first sites whose minimum hop count to the first site is 1 among the non-first sites.
  • Step S102 After receiving the routing information broadcast by each non-first site, the first site updates the network-wide routing information maintained by the first site based on the routing information broadcast by each site.
  • the network-wide routing information includes: the identification of each site, each The id of the site's neighbors.
  • the first site Since each site periodically broadcasts routing information throughout the network, the first site will receive routing information broadcast by other sites (i.e. not the first site) in the mobile ad hoc network except the first site, and every What the first station broadcasts is the information of the station itself and the information of the neighboring stations of the station. Therefore, the first station can know which stations are in the entire mobile ad-hoc network and what are the neighboring stations of each station, so that the topology of the entire network can be obtained. Topology.
  • each site in the mobile ad hoc network periodically broadcasts the relevant information of this site and its neighbor sites throughout the network, so that each site can obtain the identification of each site, And the identification of the adjacent sites of each site, so that each site can topology the network connection of the entire network, that is, each site can obtain the routing information of the entire network, which is convenient for real-time monitoring of the network environment, thus improving the mobility of the mobile ad hoc network intelligence.
  • each site does not broadcast the information of other sites except this site and neighboring sites.
  • the amount of broadcast data is less, which is suitable for the network environment of private network with narrow band and low bandwidth.
  • the first routing information broadcast by the first site may also include: a count parameter (which may be denoted as the first count parameter), and an initial value of the first count parameter (denoted as the first initial value ), the first count parameter is used to determine the number of hops experienced by the first routing information from the first site to the non-first site.
  • a count parameter which may be denoted as the first count parameter
  • an initial value of the first count parameter denoted as the first initial value
  • the first initial value of the first count parameter may be 1, and the first initial value represents the number of hops experienced by the first routing information to reach the neighbor site of the first site.
  • the first initial value of the first count parameter may also be 0, and the first initial value represents the number of hops experienced by the first routing information to reach the first site.
  • routing protocol method provided in the embodiment of the present application may also include:
  • the first transit site After receiving the first routing information, the first transit site adds 1 to the first count parameter in the first routing information before forwarding.
  • the first transit site is any site in the mobile ad hoc network that forwards the first routing information.
  • Forwarding information (for example, routing information, service information or other information, etc.) broadcast throughout the network is a feature of the mobile ad hoc network. Specifically which sites will forward information is not the focus of this application, and will not be described in detail here.
  • the network-wide routing information may further include: corresponding to each non-first site, the minimum number of hops from the non-first site to the first site.
  • the value of the first count parameter in the first routing information is the value from the non-first site The number of hops to the first site.
  • adding 1 to the value of the first count parameter in the first routing information means The number of hops from one site to the first site.
  • the value of the first counting parameter in the first routing information when the first transit site forwards the first routing information is the first The number of hops for routing information from the first site to the first transit site, corresponding to the site that receives the first routing information without forwarding the first routing information, needs to set the value of the first count parameter in the received first routing information to Add 1 to the value to obtain the number of hops from the first site to the site that receives the first routing information without forwarding the first routing information.
  • any non-first site there may be multiple paths from the non-first site to the first site, wherein the hops from the non-first site to the first site in different paths
  • the numbers may be the same or different.
  • the first site only records the minimum number of hops from the non-first site to the first site.
  • each non-first site by recording the minimum number of hops from the non-first site to the first site, when the first site needs to send information to the target non-first site, according to the number of hops from the target non-first site to the second site
  • the minimum number of hops of a site selects the path from the first site to the target non-first site (denoted as the target path), and the hops from the first site to the target non-first site in the target path are from the target non-first site to The minimum hop count for the first site.
  • the routing information broadcast by the first site on the entire network may also include extended information, and the extended information may include at least one of the following items: a message handle of the first site, and the message handle is used to identify the first The version of the routing information; the positioning information of the first site, such as GPS (Global Positioning System, Global Positioning System) information; the field strength value of the first site, the transmission power of the first site, the remaining power of the first site, etc.
  • GPS Global Positioning System, Global Positioning System
  • an implementation of updating the network-wide routing information maintained by the first site based on the routing information broadcast by each site may be as follows:
  • the network-wide routing information maintained by the first site is updated based on the latest version of routing information broadcast by each site.
  • the first site will update the network-wide routing information maintained by the first site only when the version of the routing information broadcast by at least one site in the entire network is updated.
  • the network-wide routing information maintained by each site can also include Positioning information of each site, field strength value, transmit power and remaining power, etc.
  • Each station can also communicate with the network management system. Based on this, each station can send the positioning information, field strength value, transmission power and remaining power in the network-wide routing letter maintained by the station to the network management system. According to the positioning information of each station, the location of each station can be shown on the map, and the field strength value, transmission power and remaining power of the station can be associated with the location of each station, making user management, communication and maintenance work more efficient .
  • the network management system may be an enhanced network management system (Extended Network Management System, XNMS).
  • XNMS Extended Network Management System
  • the extended information may also include a GPS lock status, where the GPS lock status is GPS locked or GPS unlocked. If the first station locks the GPS, the first station can determine the positioning information of the first station, and can also perform timing alignment through the GPS pulse per second signal (Pulse Per Second, 1PPS).
  • GPS pulse per Second 1PPS
  • FIG. 2a it is a topological diagram of the mobile ad hoc network provided by the embodiment of the present application.
  • the site S3 maintains An example of routing information is shown in Table 1:
  • DestSiteid represents the site identification
  • Adjecentid represents the adjacent site identification
  • Adjecentid-SeqHandle represents the adjacent site identification and the message handle of the adjacent site
  • Adjecentid-SeqHandle-Rssi indicates the identification of the adjacent site
  • HopCount is a counting parameter, which is used to determine the minimum number of hops from site S3 to DestSiteid
  • GPS_Lock indicates the GPS lock status
  • SeqHandle in the last column indicates the message handle of the site corresponding to DestSiteid.
  • the neighbors of the station S2 are S1, S3, and S4, where S1-003-77dBm represents the neighbors of the station S2
  • the message handle of station S1 is 003, the Rssi of station S1 is 77dBm, S3-002-69dBm means that the message handle of station S3 adjacent to station S2 is 002, the Rssi of station S3 is 69dBm, and S4-005-85dBm means the neighbor of station S2
  • the message handle of station S4 is 005, and the Rssi of station S4 is 85dBm.
  • the number 1 in the column "HopCount" indicates that the minimum hop count from station S3 to station S2 is 1.
  • Table 1 is just an example of the network-wide routing information maintained in station S3, and it may also contain other information, such as the transmit power of the station, the power consumption, the number of neighboring stations of each station, and the like.
  • Table 2 shows the network-wide routing information maintained by station S6 in FIG. 2a.
  • the network-wide routing information maintained by site S6 is updated to the information shown in Table 4:
  • each site If the time of routing information broadcast by each site is out of order, then the probability of collision between the routing information broadcast by different sites is high. In order to reduce the probability of collision, in this application, different sites are fully The network broadcasts routing information, and the length of each time slice is the same, and there is no overlapping area between different time slices, that is, each time slice is independent of each other.
  • the transmission link of the mobile ad hoc network is divided into three time windows according to the time period: service time window, routing time window and routing redundancy time window. That is, each cycle includes a service time window, a routing time window and a routing redundancy time window.
  • the business time window is mainly used for the transfer of business data; the business time window can also be used for other data transmissions with a small amount of information, see the following content for details.
  • the routing time window is a time window specially set up for each site to periodically broadcast routing information, that is, different sites broadcast routing information on the entire network in different time slices in the routing time window of the same cycle.
  • the business time window for transmitting business data is set, in practical applications, there may be cases where the routing time window is occupied by normal business (such as emergency business data, etc.). In order to reduce the impact of this situation on routing information transfer, set Routing redundancy time window. In other cases, the site may not be able to estimate its time slice position in the routing time window. In this case, the site will not broadcast routing information on the entire network. Redundant routing time windows can also reduce the inability of the site to estimate its own routing time window. The impact of the time slice position on routing information transfer.
  • the routing redundancy time window is to prevent some stations from occupying the channel due to normal services in the time slice of the routing time window, or the station cannot accurately estimate its time slice position in the routing time window, resulting in
  • a redundant time window is specially set up to broadcast routing information, that is to say, the time slice of routing redundant time window used for broadcasting routing information of the site is used by business
  • the routing information is broadcast when the transfer of data takes up or cannot determine its own time slice position in the routing time window.
  • the length of the routing redundancy time window is usually 2-3 time slices.
  • the routing redundancy time window may also be occupied by normal services. In this case, the normal services are transferred first, and the routing information can only be broadcast when the channel is idle.
  • any two adjacent stations in the broadcast order (denoted as station 1 and station 2, where the broadcast time of station 1 is earlier than the broadcast time of station 2), station 2 needs to receive Site 2 can broadcast the routing information only after site 1 broadcasts the routing information. Based on,
  • the length of a time slice can be determined in the following manner:
  • any two sites in the mobile ad hoc network can form a site pair, and the minimum hop count corresponding to each site pair represents the number of hops from the site pair. The minimum number of hops from one of the sites to the other site in the pair.
  • the maximum value is determined from the minimum number of hops corresponding to each site pair, and the maximum value is recorded as N here.
  • the length of the time slice is determined according to the maximum value N and the delay and frame consumption time of a single station forwarding routing information.
  • the length of the time slice can be the sum of the frame consumption time and N delays, which can be expressed as:
  • L represents the length of the time slice
  • Tp represents the frame consumption time of a single site
  • Td represents the delay of forwarding routing information of a single site.
  • each site can determine the length of the time slice according to the above method.
  • time slices can be allocated to each site according to the unique identification codes of each site. For example, according to the order of the unique identification codes from small to large, the time slices are allocated to the sites in the order of starting time from early to late, that is The smaller the identification code of the station, the earlier the start time of the corresponding time slice. Alternatively, the time slices are assigned to the stations in the order of starting time from early to late according to the order of the unique identification codes from large to small, that is, the greater the identification code of the station, the earlier the start time of the corresponding time slice. That is to say, two stations corresponding to adjacent time slices are adjacent stations.
  • the station that has not locked the GPS can confirm that it can enter its own broadcast time slice to broadcast routing information on the entire network. To avoid conflicts, You can back off for a certain period of time (such as 60ms) and then broadcast the routing information on the entire network.
  • the interval period of the periodic broadcast is 5 minutes
  • the mobile ad hoc network includes 5 sites
  • the redundant time window as 1200ms as an example, an example diagram of an allocation of time windows in the broadcast cycle provided by the embodiment of the present application is shown in Figure 3.
  • the starting time of the routing time window is the earliest
  • the redundant routing time window is located after the routing time window
  • the service time window is located after the redundant routing time window.
  • the above-mentioned time slice determination method and allocation method are not a big problem when the number of stations in the mobile ad hoc network is small.
  • Two sites corresponding to adjacent time slices are adjacent sites, or, two sites corresponding to adjacent time slices are two adjacent sites of the same site.
  • the network topology becomes the structure shown in Figure 2c
  • the routing information is broadcast in the order of S1->S2->S3->S4->S5->S6->S7
  • the adjacent The maximum value of the minimum number of hops on the network topology between two sites is 3 (that is, the number of hops from S2 to S3)
  • routing information is broadcast in the order of S1->S2->S4->S5->S6->S3->S7
  • the maximum number of minimum hops between two adjacent sites in the broadcast order on the network topology is 2 (that is, the number of hops from S5 to S6)
  • the sites in the mobile ad hoc network in the embodiment of the present application are divided into two categories: primary sites and common sites, wherein there is only one primary site, and other sites are common sites, that is, there are several common sites indivual.
  • routing time window routing redundancy time window, and service time window, as well as the time slice within the routing time window can all be determined by the main site and then broadcast to common sites throughout the network.
  • the determination of the above information by the primary site can reduce the power consumption of common sites, so that common nodes can better perform data transmission of normal services.
  • the main site can determine each time window and time slice in the cycle according to the aforementioned method.
  • the primary site can update each time window and time slice in the cycle according to the aforementioned method when the routing information maintained by the master site changes.
  • any site in the topology diagram starting from any site in the topology diagram, according to the network-wide routing information maintained by itself, identify the neighboring sites of each site in turn until all sites are identified, and assign broadcast time slices to each site in the order of identification, The earlier a station is identified, the earlier the allocated time slice starts.
  • the primary site can periodically broadcast time window information (i.e., the start time and length of the routing time window, the start time and length of the routing redundancy time window, the number of sites, and the broadcast time slice of each site) in the idle state within the business time window, so that Each common station obtains time window information.
  • the broadcast period of the broadcast time window information may be pre-configured, for example, through programmable programming software (CPS).
  • Each common site determines its own broadcast time slot according to the received time window information and its own identification, so that within the routing time window, each site is divided into independent broadcast time slots to broadcast the routing information of the site.
  • the main site can broadcast time window information between the business time window and the routing time window.
  • the time window information can also include whether to immediately After entering the routing time window identifier, after receiving the time window information, the common site that loses the lock determines whether to enter the routing time window according to "whether to immediately enter the routing time window identifier".
  • the "whether to immediately enter the routing time window identifier" includes two values: 1, a value representing the immediate entry into the routing time window, and 2, a value representing the specific time of entering the routing time window.
  • the common site can maintain time synchronization with the main site.
  • the main site can use the GPS second pulse signal 1PPS and UTC time that it locked, and the minimum path hops from the main site to each common site.
  • the number of jumps, the maximum hops Jmax of the minimum path from the main site to each common site, and the delay delay when a single site forwards routing information determine the time for each site to enter the routing time window.
  • the main site goes to the i-th common site
  • the hop count of the minimum path of the site is jump_i
  • the time when the i-th ordinary site receives the time window information broadcast by the main site is t
  • the time for the i-th ordinary site to enter the routing time window is: t+(Jmax-jump_i)* delay.
  • the station When the station locks the GPS, the station can accurately determine the UTC time. Therefore, according to the received time window information, it can accurately determine the time to enter the routing time window. Based on this, when the station locks the GPS, no matter whether "enter the routing immediately What is the "time window logo”? Ordinary sites that lock GPS do not need to pay attention to this logo, and can determine whether to enter the routing time window by themselves.
  • the main site needs to be locked by GPS and aligned with 1PPS signal timing.
  • the site with the smallest unique identification code can be used as the main site, or the site that is powered on first can be used as the main site, etc. Which method is specifically used for designation is not specifically limited in this application.
  • the station configured by programming frequency programming software can be determined as the master station.
  • a site online message is broadcast throughout the network; the site online message includes: the identification of the second site.
  • the non-second site After the non-second site receives the site online message, it adds the information of the second site to the network-wide routing information maintained by the non-second site.
  • the primary site also replies with an online response message to the second site, so that the second site obtains the identification of each site in the mobile ad hoc network;
  • the online response message includes: the online response message of each site in the mobile ad hoc network logo.
  • the main site may receive the site online message of the second site forwarded/sent by multiple sites, but the main site only needs to reply based on the earliest received site online message of the second site.
  • the site online message may also include: a count parameter (which may be denoted as a second count parameter), and an initial value of the second count parameter (denoted as a second initial value), the second count parameter It is used to determine the number of hops for the site online message to reach the non-second site from the second site.
  • a count parameter which may be denoted as a second count parameter
  • an initial value of the second count parameter denoted as a second initial value
  • the second initial value of the second count parameter may be 1, and the second initial value represents the number of hops experienced by the site online message to reach the neighbor site of the second site.
  • the second initial value of the second count parameter may be 0, and the second initial value represents the number of hops experienced by the site online message reaching the second site.
  • the second transit station also adds 1 to the second count parameter in the station online message and forwards it.
  • the online response message returned by the main site may also include: a count parameter (which may be recorded as the third count parameter), and an initial value of the third count parameter (referred to as the third initial value), the third count parameter is used It is used to determine the number of hops taken by the online response message from the primary site to the normal site.
  • a count parameter which may be recorded as the third count parameter
  • an initial value of the third count parameter referred to as the third initial value
  • the third initial value of the third count parameter may be 1, and the third initial value represents the number of hops experienced by the online response message to reach the neighboring site of the primary site.
  • the third initial value of the third count parameter may be 0, and the third initial value represents the number of hops experienced by the online response message to reach the primary site.
  • FIG. 4 it is a schematic diagram of the mobile ad hoc network provided by the embodiment of the present application, wherein the stations S1 , S2 , S3 , and S4 are online stations, and the station S1 is the main station. And the station S5 is a newly started station. Then the process of site S5 broadcasting the site online information, and the main site S1 replying the online response message can be as follows:
  • Step 1 Start the station S5, complete the startup initialization, GPS lock and complete timing alignment according to the 1pps signal, broadcast the site online message, the site online message carries the site S5 logo, the hop count HopCount (initialized to 1), and the message handle Seq_Handle (initialized to a random value) and GPS lock information;
  • Step 2 After receiving the site online message broadcast by S5, site S2 updates the network-wide routing information maintained by this site, that is, adds the routing information of the newly added site S5, including the site ID of S5, and the S5 ⁇ ->S2 relay The hop count, the GPS lock information of the station S5, the message handle of the station S5, etc.; the station S2 adds 1 to the hop count HopCount in the station online message and forwards it.
  • Step 3 S1, as the main site, receives the online message of S5 forwarded by S2 (namely, the site online message), updates the routing information of the entire network maintained by site S1, and adds the routing information of newly added site S5, including the identity of site S5, S5 ⁇ -> S1 relay hop count, GPS lock information of site S5, message handle, etc.; at the same time reply online response message, the response message carries the identity of the main site S1, the GPS lock information of the main site S1, and other site identifications and GPS in the network lock information;
  • Step 4 After receiving the online information of S5 forwarded by S2, the sites S3 and S4 update the routing information of the entire network maintained by the site, and add the routing information of the newly added site S5, including the identification of the site S5, S5 ⁇ ->S3/S4 Relay hop count, GPS lock information of station S5, message handle of station S5, etc.;
  • Step 5 the station S2 receives and relays the online response message of S1, and adds 1 to the update hop count HopCount in the online response message when forwarding (the hop count here is used for the station S5 to know the S1 ⁇ ->S5 relay hop count);
  • Step 6 Site S5 receives the online response information sent by S1 forwarded by site S2, updates the network-wide routing information maintained by site S5, and adds the primary site routing information, including the identity of site S1, the hop count of S1 ⁇ ->S5 relays, GPS lock information of station S1, message handle of station S1. Update other site identification and GPS lock information.
  • the primary site S1 will calculate the time slices of each site based on the network topology of the five sites S1, S2, S3, S4, and S5, and then determine the routing time window, redundant routing time window, and service time window, and set All time window information is broadcast to the four stations S2, S3, S4, and S5.
  • the above-mentioned newly started site broadcasts the site online information, and the process of the main node site replying the online response message can be completed within the business time window.
  • the primary site periodically broadcasts a primary site heartbeat message throughout the network.
  • the primary site can broadcast primary site heartbeat messages within the business time window.
  • any ordinary site does not receive the heartbeat message of the main site within a preset period of time (for example, 3 consecutive periods)
  • the whole network broadcasts the heartbeat message of the main site to declare itself as the new primary site.
  • the common station determining that the present station can be the new master station may include: the common station locks the GPS and performs 1pps signal timing alignment.
  • the priorities of the first common site and the second common site are determined.
  • the first normal site is any common site
  • the second normal site is any common site different from the first normal site.
  • the priority of the station may be determined according to the identification code of the station, for example, the smaller the identification code, the higher the priority. or,
  • the priority of the station can be determined according to the start time of the station, for example, the earlier the start time, the higher the priority.
  • the first common site broadcasts the heartbeat information of the main site again in the whole network to declare itself as the main site; otherwise, the first common site no longer broadcasts the heartbeat of the main site Information that I do not host the site.
  • the process for an ordinary site to declare itself as the primary site can be completed within the business time window.
  • a new main site can be designated before the shutdown.
  • the specific implementation method can be as follows:
  • the master site broadcasts a master site designation message throughout the network; the master site designation message includes an identifier of the designated new master site.
  • the primary site can designate a site with a unique identification code larger than itself but the smallest as the new primary site, or it can specify a site whose startup time is later than itself but the earliest as the new primary site.
  • the designated new primary site After the designated new primary site receives the primary site designation message, if it is determined that this site can be the primary site, the heartbeat information of the primary site will be broadcast throughout the network.
  • this site is locked to GPS and has undergone 1pps signal timing alignment, it is determined that this site can be the primary site.
  • the master site can broadcast the master site designated message during the business time window.
  • a shutdown message can also be broadcast throughout the network.
  • the first site may broadcast a shutdown message within the business time window.
  • the shutdown message may include the identifier of the first station and a GPS locking message.
  • other information may also be included, such as note information and the like.
  • the first station sends the neighbor query information to the first neighbor station; the first neighbor station is any neighbor station of the first station; the first station sends the neighbor station query information to the first neighbor station in a business time window.
  • the first station deletes the information of the first neighbor station in the network-wide routing information maintained by the first station.
  • the neighbor station query process ends.
  • any station if any station has not received the routing information broadcast or forwarded by one of its neighbors for M consecutive periods, it can send a neighbor query message to the neighbor to determine whether the neighbor is still online.
  • the first site can be a common site or a primary site.
  • the first site does not receive any routing information broadcast by other sites for K consecutive times, it means that the first site is out of contact, and the information of all the neighboring sites of the first site in the network-wide routing information maintained by this site can be deleted.
  • each site can communicate with the network management or dispatching system.
  • the site determines that it is out of contact, it can delete and synchronize the information of all the neighboring sites of the site in the routing information maintained by the site.
  • the network management or dispatching system can output prompt information to indicate that the site is out of contact, and the management personnel can deal with it after obtaining the prompt information.
  • the embodiment of the present application also provides a mobile ad hoc network, the mobile ad hoc network includes several stations, wherein,
  • the first site is used to periodically broadcast first routing information across the entire network, where the first routing information includes: an identifier of the first site and an identifier of a neighboring site of the first site; the first site is Any station in the mobile ad hoc network;
  • the first site is further configured to update the entire network routing information maintained by the first site based on the routing information broadcast by each site after receiving the routing information broadcast by each non-first site, and the entire network routing information includes: The identification of each site, and the identification of the adjacent sites of each site.
  • each site in the mobile ad hoc network broadcasts information about the site and its neighbors, so that each site can obtain the identity of each site, and each site The identification of neighboring sites, so that each site can topology the network connection of the entire network, that is, each site can obtain the routing information of the entire network, thereby improving the intelligence of the mobile ad hoc network.
  • this embodiment of the present application also provides a site, which may be a first site.
  • a site which may be a first site.
  • a schematic structural diagram of the first site is shown in Figure 5, which may include:
  • the broadcast module 501 is used to periodically broadcast the first routing information across the entire network; wherein, the first routing information includes: the identification of the first site and the identification of the neighboring sites of the first site; the first site is Any station in the mobile ad hoc network;
  • the processing module 502 is configured to update the network-wide routing information maintained by the first site based on the routing information broadcast by each site after receiving the routing information broadcast by each site other than the first site, and the network-wide routing information includes: identities, and the identities of neighboring sites of each site.
  • the site can also be a transit site, a main site or a common site.
  • the embodiment of the present application also provides a station, the station may be a first station, a schematic structural diagram of the first station is shown in FIG. 6 , and may include: at least one processor 1 , at least one communication interface 2, at least one memory 3 and at least one communication bus 4.
  • processor 1 there are at least one processor 1 , communication interface 2 , memory 3 , and communication bus 4 , and the processor 1 , communication interface 2 , and memory 3 communicate with each other through the communication bus 4 .
  • the processor 1 may be a central processing unit CPU, or an ASIC (Application Specific Integrated Circuit), or one or more integrated circuits configured to implement the embodiments of the present application.
  • CPU central processing unit
  • ASIC Application Specific Integrated Circuit
  • the memory 3 may include a high-speed RAM memory, and may also include a non-volatile memory (non-volatile memory), such as at least one disk memory.
  • the memory 3 stores a program
  • the processor 1 can call the program stored in the memory 3, and the program is used for:
  • the first site periodically broadcasts first routing information across the entire network; wherein, the first routing information includes: an identifier of the first site and an identifier of a neighboring site of the first site; the first site is Any station in the mobile ad hoc network;
  • the first site After receiving the routing information broadcast by each non-first site, the first site updates the network-wide routing information maintained by the first site based on the routing information broadcast by each site, and the network-wide routing information includes: identities, and the identities of neighboring sites of each site.
  • the site can also be a transit site, a main site or an ordinary site;
  • the embodiments of the present application also provide a storage medium, which can store a program suitable for execution by a processor, and the program is used for:
  • the first site periodically broadcasts the first routing information throughout the network; wherein, the first routing information includes: the identification of the first site and the identification of the neighboring sites of the first site; the first site is the Any station in the mobile ad hoc network;
  • the first site After receiving the routing information broadcast by each non-first site, the first site updates the network-wide routing information maintained by the first site based on the routing information broadcast by each site, and the network-wide routing information includes: identities, and the identities of neighboring sites of each site.
  • each site only broadcasts information about its own site and its neighbors, and does not broadcast information other than its own site and its neighbors.
  • the information of other sites other than the adjacent site makes the amount of broadcast data less, which is suitable for the network environment of private network narrowband and low bandwidth
  • the routing information maintained by each site is the identification of each site, the identification of each site's neighbors, and all The minimum number of hops from the first site to each non-first site is described, so that each site can topologically display the network connection status of the entire network, which is convenient for real-time monitoring of the network environment.
  • the routing information broadcast by each node can also include information such as GPS locking information, site power, transmit power, field strength signals between sites, abnormal status, etc. These information can intuitively display the connection status and self- attributes, making the management and post-maintenance of the mobile ad hoc network easier.
  • the concept of main site is proposed innovatively, and the main site manages the routing time window, routing redundancy time window and site broadcast time slice in a unified manner, standardizes and manages site broadcasting, and minimizes the duty cycle of site periodic broadcasting , to minimize the congestion of normal services due to routing broadcasts.
  • the routing information is broadcast in the order of the node topology status, so that the routing broadcast time of the entire network is less, and it is more suitable for narrowband and low-bandwidth networks, preventing normal business conditions from being blocked by routing broadcasts.
  • the network management or dispatching system can identify overlapping coverage areas according to the locations of each station, as well as the power of the stations or the field strength information between stations. Identify the overlapping coverage of the current network, and reduce the same-frequency interference in the overlapping coverage area to a certain extent by avoiding the transmission of one or more devices in the overlapping coverage area and adjusting the power.
  • the units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place, or may be distributed to multiple network units. Part or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.
  • each functional unit in each embodiment of the present application may be integrated into one processing unit, each unit may exist separately physically, or two or more units may be integrated into one unit.
  • the functions described above are realized in the form of software function units and sold or used as independent products, they can be stored in a computer-readable storage medium.
  • the technical solution of the present application is essentially or the part that contributes to the prior art or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including Several instructions are used to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in the various embodiments of the present application.
  • the aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic disk or optical disc, etc., which can store program codes. .

Abstract

La présente demande concerne un procédé de protocole de routage, un réseau mobile ad hoc, une station et un support de stockage. Des premières informations de routage diffusées périodiquement par une première station (n'importe quelle station dans un réseau mobile ad hoc) dans tout le réseau comprennent : un identificateur de la première station et un identificateur d'une station adjacente de la première station ; lors de la réception des informations de routage diffusées par chaque non-première station, la mise à jour, par la première station, sur la base des informations de routage diffusées par chaque station, des informations de routage de réseau entier gérées par la première station, les informations de routage de réseau entier comprenant des identificateurs de stations et des identificateurs de stations adjacentes des stations. Sur la base de la solution de la présente demande, chaque station dans le réseau mobile ad hoc diffuse les informations associées de la station et les informations associées d'une station adjacente de la station, de telle sorte que chaque station peut obtenir des identificateurs de stations et des identificateurs de stations adjacentes des stations, et ainsi chaque station peut obtenir topologiquement l'état de connexion de réseau du réseau entier, et l'intelligence du réseau mobile ad hoc est améliorée.
PCT/CN2022/078529 2022-03-01 2022-03-01 Procédé de protocole de routage, réseau mobile ad hoc, station et support de stockage WO2023164789A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2022/078529 WO2023164789A1 (fr) 2022-03-01 2022-03-01 Procédé de protocole de routage, réseau mobile ad hoc, station et support de stockage

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2022/078529 WO2023164789A1 (fr) 2022-03-01 2022-03-01 Procédé de protocole de routage, réseau mobile ad hoc, station et support de stockage

Publications (1)

Publication Number Publication Date
WO2023164789A1 true WO2023164789A1 (fr) 2023-09-07

Family

ID=87882743

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/078529 WO2023164789A1 (fr) 2022-03-01 2022-03-01 Procédé de protocole de routage, réseau mobile ad hoc, station et support de stockage

Country Status (1)

Country Link
WO (1) WO2023164789A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002078272A1 (fr) * 2001-03-23 2002-10-03 Kent Ridge Digital Labs Procede et systeme de fourniture de reseaux speciaux mobiles pontes
CN101478807A (zh) * 2009-01-09 2009-07-08 重庆金美通信有限责任公司 基于超短波电台的路由算法
CN103476081A (zh) * 2013-09-11 2013-12-25 北京交通大学 一种无线传感器网络中路由的方法
CN106131919A (zh) * 2016-07-15 2016-11-16 中国电子科技集团公司第五十四研究所 一种无中心自组织网络拓扑的同步方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002078272A1 (fr) * 2001-03-23 2002-10-03 Kent Ridge Digital Labs Procede et systeme de fourniture de reseaux speciaux mobiles pontes
CN101478807A (zh) * 2009-01-09 2009-07-08 重庆金美通信有限责任公司 基于超短波电台的路由算法
CN103476081A (zh) * 2013-09-11 2013-12-25 北京交通大学 一种无线传感器网络中路由的方法
CN106131919A (zh) * 2016-07-15 2016-11-16 中国电子科技集团公司第五十四研究所 一种无中心自组织网络拓扑的同步方法

Similar Documents

Publication Publication Date Title
US8050196B2 (en) Method and apparatus for controlling packet transmissions within wireless networks to enhance network formation
EP2283585B1 (fr) Procédés pour une organisation efficace de groupes d'homologues véhiculaires et communications v2r efficaces
US20040018839A1 (en) Protocol and structure for mobile nodes in a self-organizing communication network
US20020167960A1 (en) System and method for transmission scheduling using network membership information and neighborhood information
US20130301471A1 (en) Method and system for global topology discovery in multi-hop ad hoc networks
US20050041676A1 (en) Systems and methods for forming an adjacency graph for exchanging network routing data
Wang et al. A deterministic distributed TDMA scheduling algorithm for wireless sensor networks
Hwang et al. A novel efficient power‐saving MAC protocol for multi‐hop MANETs
AU2014252152B2 (en) SMF-type communication method for a manet network, network node and mobile network which implement this communication method
Sheng et al. Relative degree adaptive flooding broadcast algorithm for ad hoc networks
Bhatia et al. RD-TDMA: A randomized distributed TDMA scheduling for correlated contention in WSNs
Nguyen et al. A distributed TDMA scheduling algorithm using topological ordering for wireless sensor networks
CN109510769B (zh) 一种适合于宽窄结合网络的融合路由系统及其方法
CN105072586B (zh) 嵌入式无线自组织网络中对广播消息的转发的管理方法
ES2264473T3 (es) Sistema y metodo para planificar transmisiones, utilizando informaciones de pertenencia a una red y de proximidad.
KR20090060931A (ko) 무선 센서 네트워크에서의 크로스 레이어 라우팅 방법
WO2023164789A1 (fr) Procédé de protocole de routage, réseau mobile ad hoc, station et support de stockage
Cheng et al. Collision-free dynamic convergecast in low-duty-cycle wireless sensor networks
Shanti et al. Treefp: A tdma-based reliable and energy efficient flooding protocol for wsns
CN114585041A (zh) 路由协议方法、移动自组织网络、站点及存储介质
Asgharian et al. Adaptive and distributed TDMA scheduling protocol for mobile ad hoc networks (MANET)
Sivrikaya et al. Minimum delay routing for wireless networks with STDMA
Lipman et al. Optimized flooding algorithms for ad hoc networks
Haddad et al. A distributed strict strong coloring algorithm for broadcast applications in ad hoc networks
Huang et al. Distributed Energy-Aware Reliable Routing and TDMA Link Scheduling in Wireless Sensor Networks

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 22929243

Country of ref document: EP

Kind code of ref document: A1