JP2008245242A - Communication equipment, communication program and mobile ad-hoc network system - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a node which, when a plurality of traffics within an ad-hoc network contend, controls the contention. <P>SOLUTION: A mobile node 101 includes: a memory section 17 for storing requested quality and priority requested to a communication path which is a communication path using the mobile node 101 itself as an intermediate node and is already set ; a radio communication section 11 for receiving RREQQ containing requested quality and priority requested to a new communication path, the RREQQ being a request from another node, to set a new communication path using the mobile node 101 itself as an intermediate node; and a processing section which judges whether both requested quality for the new communication path indicated in RREQQ and the requested quality requested to the set communication path being stored in the memory section 17 can be satisfied by its own resources and allocates its own resources to a communication path of higher priority between the priority of the set communication path and the priority of the new communication path indicated in RREQQ when judging that the requested quality are not satisfied. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

  The present invention relates to a system that performs communication through a mobile ad hoc network, and more particularly to a system that performs routing control according to traffic priority.

  In recent years, mobile ad hoc networks (MANET: Mobile Ad-hoc Network) in which mobile nodes directly communicate with each other wirelessly without using a fixed infrastructure have been developed with downsizing and high functionality of mobile nodes. Ad hoc networks can be deployed even in environments where fixed communication infrastructure cannot be used, such as disaster sites. In an ad hoc network, a network is composed of only mobile nodes, so resources are limited. Assuming use at disaster sites, it is important to ensure that important messages arrive faster than other messages. Therefore, quality of service (QoS) routing that effectively uses limited resources is of interest.

In the ad hoc network described in Patent Document 1, the required quality of service is at least one of available bandwidth, error rate, end-to-end delay, delay variation, hop count, expected durability, and priority. Specify as a QoS parameter to include. Each specified parameter may be ranked. The QoS metrics of nodes and links held by each mobile node correspond to QoS parameters. Based on QoS parameters, when a route between a source node and a target node is discovered, a route that can select a sum of QoS metrics obtained by multiplying the QoS metric by a weighting factor according to the rank of the QoS parameter and further multiplying the weighting factor. By generating for each of these, a route that satisfies the required service quality is selected.
JP 2004-56787 A

  In the route selection based on the QoS parameter of Patent Document 1 described above, a route that satisfies the service quality is selected from a plurality of available routes in consideration of the QoS parameter including priority. However, in the above-described Patent Document 1, when a plurality of traffics exist in the ad hoc network, traffic control based on priority with respect to link or node contention with other traffic is not performed.

  The present invention has been made in view of the above, and in the case where a plurality of traffics having priorities indicated in an ad hoc network are mixed and contention of traffics having different priorities occurs, the higher priority traffic is selected. An object is to provide a technique for providing an optimal route and rerouting low priority traffic.

The communication device of the present invention
In the communication device serving as the intermediate node in the mobile ad hoc network system capable of dynamically setting the communication path from the source node to the target node via the intermediate node,
A storage unit that stores required quality and priority required for a communication path that is already set as a communication path with the communication device that is self as the intermediate node;
Request quality and priority required for a new communication path, which is a request for setting a new communication path from the other nodes constituting the mobile ad hoc network system, with the communication device being the intermediate node as the intermediate node. An intermediate communication unit that receives a request including
Both the required quality of the new communication path indicated by the request received by the intermediate side communication unit and the required quality required for the already set communication path stored in the storage unit It is determined whether or not it can be satisfied by resources of a certain communication device, and if it is determined that it cannot be satisfied, the priority of the communication path that has already been set and the priority of the new communication path indicated by the request And an intermediate processing unit that allocates the resource of the communication device that is the self to the communication path with the higher priority.

  According to the present invention, when a plurality of traffics having priorities indicated in the mobile ad hoc network are mixed and contention of traffic having different priorities occurs, the contention can be controlled.

Embodiment 1 FIG.
FIG. 1 is a hardware configuration diagram of the mobile node 101 according to the first embodiment. In FIG. 1, the mobile node 101 includes a CPU 810 (also referred to as a central processing unit, a processing unit, an arithmetic unit, a microprocessor, a microcomputer, or a processor) that executes a program. The CPU 810 is connected to a ROM (Read Only Memory) 812, a RAM (Random Access Memory) 813, a communication unit 814, and a flash memory 820 via the bus 811 and controls these hardware devices. Instead of the flash memory 820, a magnetic disk device may be used.

  The RAM 813 is an example of a volatile memory. Storage media such as the ROM 812 and the flash memory 820 are examples of nonvolatile memories. These are examples of a storage device, a storage unit, or a storage unit. The communication unit 814 is an example of an input unit and an input device. The communication unit 814 is an example of an output unit and an output device.

  The flash memory 820 stores an operating system 821 (OS), a program group 823, and a file group 824. The programs in the program group 823 are executed by the CPU 810 and the operating system 821.

  The program group 823 stores a program for executing a function described as “unit” in the description of the mobile node according to the embodiment described below. The program is read and executed by the CPU 810.

  The file group 824 includes “determination result”, “calculation result”, “extraction result”, “generation result”, and “processing result” in the description of the embodiment described below. Information, data, signal values, variable values, parameters, and the like are stored as items of “˜file” and “˜database”. The “˜file” and “˜database” are stored in a recording medium such as a disk or a memory. Information, data, signal values, variable values, and parameters stored in a storage medium such as a disk or memory are read out to the main memory or cache memory by the CPU 810 via a read / write circuit, and extracted, searched, referenced, compared, and calculated. • Used for CPU operations such as calculation, processing, output, and display. Information, data, signal values, variable values, and parameters are temporarily stored in the main memory, cache memory, and buffer memory during the CPU operation of extraction, search, reference, comparison, calculation, calculation, processing, output, and display. Is done.

  In the description of the embodiment described below, data and signal values are recorded on a recording medium such as a memory of RAM 813 or a flash memory.

  In the description of the mobile node described below, what is described as “to part” may be “to circuit”, “to device”, “to device”, “means”, and “to step”. , “˜procedure”, and “˜processing”. That is, what is described as “˜unit” may be realized by firmware stored in the ROM 812. Alternatively, it may be implemented only by software, or only by hardware such as elements, devices, substrates, and wirings, by a combination of software and hardware, or by a combination of firmware. Firmware and software are stored in the recording medium of the ROM 812 and the flash memory 820 as programs. The program is read by the CPU 810 and executed by the CPU 810. That is, the program causes the computer to function as “to part” described below. Alternatively, the procedure or method of “to part” described below is executed by a computer.

  Next, referring to FIG. 2 to FIG. 15, in the mobile ad hoc network system 1000 in which a plurality of traffics are mixed, when a route satisfying the quality of service in consideration of the QoS parameters is found and determined, the links or nodes of the plurality of traffics A method for rerouting low priority traffic when contention occurs will be described.

  The mobile ad hoc network system 1000 in FIG. 2 includes mobile nodes 101 to 112 (hereinafter, the mobile node may be referred to as a node). Each mobile node can be connected to each other by a wireless communication link.

  As shown in FIG. 2, it is assumed that there is traffic 201a in which the mobile node 101 is a source node, the nodes 106 and 107 are intermediate nodes, and the node 112 is a target node.

  Embodiment 1 below relates to traffic control that competes for intermediate nodes 106 and 107 when new traffic 202 is formed when traffic 201a exists.

FIG. 3 is a block diagram showing the configuration of the mobile node 101. The configuration of the other mobile nodes 102 to 112 is the same as that of the mobile node 101. The mobile node 101 will be described with reference to FIG. The mobile node 101 includes a radio communication unit 11 (communication unit), a service quality route request RREQQ processing unit 12, a service quality route response RREPQ processing unit 13, a service quality route confirmation CONFQ processing unit 14, a service quality error RERRRQ processing unit 15, and a control. Unit 16 and memory unit 17 (storage unit). The RREQQ processing unit 12 to the control unit 16 constitute a processing unit.
(1) Here, “RREQQ” indicates a service quality route request.
(2) “RREPQ” which is a service quality route response is a response from the target node to “RREQQ”.
(3) “CONFQ”, which is service quality route determination, is information that the source node that has received “RREPQ” transmits to the target node.
(4) “RERRQ”, which is a message indicating a quality of service error, means that an intermediate node that has switched the traffic to be relayed from existing traffic to new traffic with higher priority than existing traffic is the source of the existing traffic. This is an error message sent to the node.
(5) These “RREQQ”, “RREPQ”, “CONFQ”, and “RERRQ” are the same as those in Japanese Patent Application Laid-Open No. 2004-56787 shown as the prior art.

  The mobile ad hoc network system 1000 in FIG. 2 can dynamically set a communication path from a source node to a target node via an intermediate node. The memory unit 17 in FIG. 3 stores required quality and priority required for a communication path that is a communication path having the mobile node as an intermediate node as an intermediate node. In addition, the wireless communication unit 11 is a request for setting a new communication path with another mobile node constituting the mobile ad hoc network system 1000 having the mobile node as an intermediate node as a new communication path. “RREQQ” which is a request including the required quality and priority is received. In addition, the processing unit composed of the RREQQ processing unit 12 to the control unit 16 has already been set and the memory unit 17 stores the required quality of the new communication path indicated by “RREQQ” received by the wireless communication unit 11. It is determined whether both of the required quality required for the communication path can be satisfied by the resource of the mobile node that is its own, and if it is determined that it cannot be satisfied, the priority of the communication path already set and “RREQQ” Among the priorities of the new communication path indicated by “”, the resource of the mobile node that is its own is allocated to the communication path with the higher priority. And when this processing unit allocates the resource of its own mobile node to the new communication path indicated by “RREQQ”, the message that can be transmitted to the source node via the already set communication path Then, “RERRQ” which is an error message notifying the occurrence of an error is generated. The wireless communication unit 11 transmits “RERQ” generated by the processing unit toward the source node of the set communication path.

  The wireless communication unit 11 performs data communication with other nodes in the mobile ad hoc network system 1000 by wireless communication.

  The RREQQ processing unit 12 performs processing when the node receives “RREQQ”, and generates “RREQQ” when the node is the source node. The reception processing of “RREQQ” by the RREQQ processing unit 12 is shown in FIG.

  The RREPQ processing unit 13 performs processing when the node receives “RREPQ”, and generates “RREPQ” when the node is the target node. The reception process of “RREPQ” by the RREPQ processing unit 13 is shown in FIG.

  The CONFQ processing unit 14 performs processing when the node receives “CONFQ”, and generates “CONFQ” when the node is the source node. The reception process of “CONFQ” by the CONFQ processing unit 14 is shown in FIG.

  The ERRRQ processing unit 15 performs processing when the node receives “RERRQ”, and generates “RERRQ” in the case of the corresponding node. The reception processing of “RERQ” by the ERRRQ processing unit 15 is shown in FIG.

  The memory unit 17 stores the routing message received by the node. In addition, the control unit 16 controls the radio communication unit 11, RREQQ processing unit 12, RREPQ processing unit 13, CONFQ processing unit 14, RERRRQ processing unit 15, and memory unit 17 as mobile nodes.

(System operation overview)
FIG. 4 is a flowchart showing an operation outline of the mobile ad hoc network system 1000. The operation outline of the mobile ad hoc network system 1000 will be described with reference to FIG. 4 and FIG. 2 described above. FIG. 4 is a processing flow in the mobile ad hoc network system 1000 for performing a procedure for transmitting traffic 202 with the node 109 as a source node and the node 104 as a target node as shown in FIG.

The source node 109 broadcasts “RREQQ”, which is a quality of service route request, to a neighboring node in order to find a route that satisfies the quality of service to the target node 104 based on the QoS parameters (step S102).
“RREQQ” includes “QoS parameter” (including required quality and priority), “source node address”, “target node address”, and the like.
“RREQQ” is a request for setting a new communication path with the mobile node as an intermediate node, and includes the required quality and priority required for the new communication path.
In the “QoS parameter”, any one or more of required qualities such as available bandwidth, error rate, transmission delay, delay fluctuation, and durability can be set. Further, the “QoS parameter” can include the priority of traffic forwarding. If no priority is specified, traffic is treated as no priority. The traffic includes a flow ID for identifying the traffic flow.

  The node that has received “RREQQ” from its own wireless communication unit 11 performs RREQQ transfer reception processing (step S103) in the RREQQ processing unit 12. Upon receiving “RREQQ”, the target node 104 generates “RREPQ” as a response to “RREQQ” and returns it (step S104). The node that has received “RREPQ” performs “RREPQ transfer reception processing (step S105) in the RREPQ processing unit 13. The source node 109 that has received“ RREPQ ”generates and transmits“ CONFQ ”. The node that has received “CONFQ” performs a CONFQ transfer reception process in the CONFQ processing unit 14 (S106).

(Propagation of “RREQQ”)
FIG. 5 is a diagram showing how “RREQQ” generated by the source node 109 propagates. FIG. 6 shows the flow processing (details of S103) of the node that has received “RREQQ”. The propagation of FIG. 5 is based on the flowchart of FIG.

  As shown in FIG. 6, the node (S202) that has received “RREQQ” generated and broadcast by the source node 109 by its own wireless communication unit 11 determines whether its own node is the target node or not by the RREQQ processing unit 12. (Step S203). If it is not “RREQQ” addressed to the own node (NO in S203), the RREQQ processing unit 12 determines whether QoS can be supported by the resources of the entire own node (step S204). Here, “resource” means a “capability” of the node corresponding to the required quality, and includes, for example, a bandwidth resource, a CPU resource, a storage resource, and the like. When it is determined that support is not possible even if all of its own resources are allocated (in FIG. 5, the case where the mobile nodes 105, 110, and 102 correspond) (NO in S204), the RREQQ processing unit 12 As shown in FIG. 5, “RREQQ” is discarded without being transferred (step S209). The node that can support QoS (Yes in S204), the RREQQ processing unit 12 determines the presence or absence of existing traffic (step S205). A node that can support QoS and has no existing traffic (node 103 corresponds) (NO in S205), the RREQQ processing unit 12 transfers "RREQQ" via the wireless communication unit 11, and is the node that is itself Are temporarily reserved (step S208). When the node is transferring / receiving the existing traffic like the mobile nodes 106 and 107 (YES in S205), the RREQQ processing unit 12 compares the priorities of the existing traffic and the new traffic (step S206). If the priority of the new traffic is higher than that of the existing traffic, the RREQQ processing unit 12 transfers “RREQQ” to the adjacent node via the wireless communication unit 11, and temporarily reserves the resource of the node (step S208). When the priority of the new traffic is lower than or equal to the existing traffic, the RREQQ processing unit 12 determines whether the existing traffic and the new traffic can be supported simultaneously (step S207). If it can be supported at the same time, the RREQQ processing unit 12 transfers “RREQQ” to the adjacent node via the wireless communication unit 11, and temporarily reserves its own resources (step S208). When a plurality of traffics cannot be supported simultaneously, the RREQQ processing unit 12 discards the “RREQQ” without transferring it (step S209). When the target node 104 receives “RREQQ”, the RREPQ processing unit 13 generates “RREPQ” that is a service quality route response for all the available routes and sends it back through the wireless communication unit 11, and performs QoS. A route that may be satisfied is reported (step S210).

(Propagation of “RREPQ”)
FIG. 7 is a diagram illustrating a state in which “RREPQ” generated by the target node 104 is propagated. FIG. 8 shows a flow process of the node that has received “RREPQ”. The propagation of FIG. 7 is based on the flowchart of FIG. As shown in FIG. 7, “RREPQ” returns the route of “RREQQ”.

  This will be described with reference to FIG. In the node that receives “RREPQ” via the wireless communication unit 11 (S302), the RREPQ processing unit 13 determines whether the received “RREPQ” is a message addressed to the own node (step S303). In the case of FIG. 7, since the nodes 103, 107, and 106 of the intermediate node are not “RREPQ” addressed to the own node, the RREPQ processing unit 13 of each node transfers “RREPQ” to the source node 109 ( NO in S303 → S306). In the source node 109 that has received “RREPQ”, the CONFQ processing unit 14 selects an optimum route from a single route or a plurality of routes that satisfy QoS (step S304), and “CONFQ” is information indicating service quality route determination. ”And transmits the generated“ CONFQ ”to the target node 104 via the wireless communication unit 11 along the selected route (step S305).

(Propagation of “CONFQ”)
FIG. 9 is a diagram illustrating how the “CONFQ” generated by the source node 109 propagates. FIG. 10 shows a flow process of the node that has received “CONFQ”. The propagation of FIG. 9 is based on the flowchart of FIG. As shown in FIG. 9, “CONFQ” propagates the path selected by the CONFQ processing unit 14 of the source node.

  As shown in FIG. 9, the mobile nodes 106, 107, 104 that have received “CONFQ” via the wireless communication unit 11 determine whether the existing traffic and the new traffic can be simultaneously supported by the CONFQ processing unit 14 (steps). S403). If it is simultaneously supportable or single traffic, the CONFQ processing unit 14 allocates node resources to the new traffic, and if it is an intermediate node, transfers “CONFQ” to the next node (step S405). If it cannot be supported at the same time, the CONFQ processing unit 14 allocates resources to the high priority traffic, transfers “CONFQ” to the next node (step S406), and the RERRRQ processing unit 15 transfers to the source node 101 of the low priority traffic. Then, “RERRQ”, which is a route error message indicating that the route cannot be used, is transmitted along the route of the low-priority traffic via the wireless communication unit 11 (step S407).

  FIG. 11 shows a processing flow of the node that has received “RERRQ”. This will be described with reference to FIG. The node that has received “RERQ” determines whether it is “RERQ” addressed to itself by the RERRRQ processing unit 15 (step S503). If it is determined in FIG. 9 that it is not addressed to the own node (NO in S503), the intermediate node 106 (received from the node 107) that has received “RERQ” has already received the same “RERQ” by the RRRQ processing unit 15. Is determined (step S504). If “RERRQ” is received for the first time, the RRRQ processing unit 15 releases the resource of the node reserved for traffic, and transfers “RERRQ” to the source node 101 (step S506). If it has already been transferred / transmitted, the RERRRQ processing unit 15 may discard “RERQ” without transferring it (step S507). This prevents the source node 101 from receiving “RERQ” redundantly. The source node 101 that has received “RERRQ” uses the prepared alternative route or sends “RREQQ” to perform routing again, and selects a route that does not cause contention between the high-priority traffic and the link or node. A discovery procedure is performed (step S505).

  By the above procedure, a route for transmitting the traffic 202 having higher priority than the existing traffic 201a is secured.

  FIG. 12 shows a state of propagation of “RREQQ” transmitted again by the node 101 for routing (S505). This “RREQQ” is generated by the RREQQ processing unit of the node 101. The node that has received “RREQQ” is processed according to the flow of FIG. In FIG. 12, the nodes 102, 105, 110, and 111 determine that the QoS can be supported and transfer “RREQQ”, and the node 103 determines that the support is not possible and discards it. In the nodes 106 and 107, the received “RREQQ” has a lower priority than the traffic 202, and it is determined that QoS cannot be simultaneously supported and is discarded. The destination node 112 that has received “RREQQ” returns “RREPQ” to the source node 101 and reports a selectable route.

  FIG. 13 shows the propagation of “RREPQ” for routing again. The intermediate nodes 111, 110, and 105 that have received “RREPQ” transfer “RREPQ” to the source node 101 in accordance with the processing of FIG. 8. The source node 101 that has received “RREPQ” selects an optimum route from a single route or a plurality of routes that satisfy QoS (step S304), and follows the route for which “CONFQ” that is information for service quality route determination is selected. The data is transmitted to the target node 104 (step S305).

  FIG. 14 shows the propagation of “CONFQ” for routing again. The mobile nodes 105, 110, 111, and 112 that have received “CONFQ” allocate resources for traffic 1 and transfer “CONFQ” because there is no existing traffic.

  According to the above procedure, as shown in FIG. 15, the traffic 201b having a lower priority than the traffic 202 is routed again, and a route that does not conflict with the traffic 202 is secured.

  The intermediate nodes 105, 106, 107, 110, and 111 and the destination nodes 104 and 112 of each traffic may always detect whether the node can support each service quality (step S107 in FIG. 4). If it is determined that service quality cannot be supported during traffic transfer or reception, a route error “RERRQ” is transmitted to the traffic source node (step S109 in FIG. 4). Further, it may be detected whether the traffic being transferred or received continues (step S108 in FIG. 4). If the traffic is not transferred for a certain period, it is determined that the traffic has ended, and the resources allocated to the traffic are released (step S111 in FIG. 4).

  In this mobile ad hoc network system, a reactive routing protocol such as Dynamic Source Routing (DSR) or Ad-Hoc On-Demand Distance Vector (AODV), or a hybrid proactive / proactive such as Zone Routing Protocol (ZRP) is used. It can also be applied to reactive protocols.

  In the first embodiment described above, the mobile node as the communication device has been described. However, the communication that causes the computer to execute the operation (processing) of the mobile node (communication device) by regarding the operation of each component of the mobile node as a process. It is also possible to grasp as a program.

  If multiple traffics with priorities are mixed in the mobile ad hoc network system according to the above procedure and link or node contention with other traffic with different priorities occurs, low-priority traffic is routed again. By doing so, it is possible to avoid contention and provide a more optimal route to high priority traffic.

  In the first embodiment described above, in a system that performs communication between a source node and a target node based on a plurality of QoS (quality of service) parameters in a mobile ad hoc network having a plurality of intermediate nodes between the source node and the target node. When a new communication path is set from a state in which several communication paths are already set, a function for comparing with a QoS metric indicating whether or not QoS is guaranteed in each node and each link is provided. A node with means for ranking priority traffic has been described.

  In the first embodiment described above, when the communication path that has already been set becomes non-priority traffic and QoS cannot be guaranteed, a message instructing interruption of traffic transmission is transmitted to the source node of non-priority traffic. A node with means to do was described.

  In the first embodiment described above, a message for requesting a communication path is transferred to an adjacent node only when a new communication path becomes priority traffic or when non-priority traffic does not affect the QoS guarantee of priority traffic. A node with means to do was described.

  In the first embodiment described above, a message for determining a communication path is sent to the next node only when a new communication path becomes priority traffic or when non-priority traffic does not affect the QoS guarantee of priority traffic. A node with means for forwarding has been described.

Embodiment 2. FIG.
The second embodiment will be described with reference to FIGS.

  In the first embodiment, when a plurality of traffics with priorities are mixed in an ad hoc network and a link or node contention with other traffic having different priorities occurs, low priority traffic is rerouted. This is a method of avoiding contention and providing a more optimal route to high priority traffic.

  In the traffic contention avoidance method of the first embodiment, there is a possibility that a route that can be avoided by high priority traffic cannot be established for rerouting of low priority traffic. As a result, the source node with low priority traffic may frequently generate reroute request messages and squeeze the network.

  Therefore, in the second embodiment, in the mobile ad hoc network system 1000 in which a plurality of traffics are mixed, when a route satisfying the service quality considering the QoS parameters is found and determined, a link or node contention due to the plurality of traffics occurs. When re-routing of low-priority traffic is attempted, but when a route for avoiding contention cannot be found due to high-priority traffic, the transfer of low-priority traffic is temporarily suspended or terminated depending on the application. A method of immediately restarting traffic transmission will be described.

  The dynamic routing determination method according to the first to third embodiments is based on, for example, DSR (Dynamic Source Routing). In addition, as described in the first embodiment, “RREQQ” includes “QoS parameter” (including required quality and priority), “source node address”, “target node address”, and the like. Further, the intermediate node that relayed the RREQQ records the history of relaying the RREQQ. Therefore, the target node that has received the RREQQ can know the route through which the received RREQQ is relayed. The RREPQ generated and transmitted by the target node is generated including the priority included in “RREQQ”. Further, the target node replies by designating the route from the target node that is itself to the source node to RREPQ based on the route history included in “RREQQ”.

  Mobile ad hoc network system 1000 in FIG. 16 includes mobile nodes 101-110. Each mobile node can be connected to each other by a wireless communication link.

  As shown in FIG. 16, it is assumed that there is low-priority traffic 201 in which the mobile node 101 is the source node, the nodes 105 and 106 are intermediate nodes, and the node 110 is the target node.

  Embodiment 2 below relates to the re-routing of traffic 201 with low priority traffic in order to avoid contention for intermediate nodes 105, 106 where traffic 201 exists and new traffic 202 is formed. is there.

  The mobile ad hoc network system 1000 in FIG. 16 can dynamically set a communication path from a source node to a target node via an intermediate node. The memory unit 17 in FIG. 3 stores a communication path having a mobile node as an intermediate node as a traffic list. The traffic list is stored, for example, at the start of communication after the communication path is established. Alternatively, it may be at the time of receiving CONFQ. Further, the memory unit 17 stores required quality and priority required for the communication path that has already been set.

  The wireless communication unit 11 performs data communication with other nodes in the mobile ad hoc network system 1000 by wireless communication.

  The RREQQ processing unit 12 performs processing when the node receives “RREQQ”, and generates “RREQQ” when the node is the source node. The reception processing of “RREQQ” by the RREQQ processing unit 12 is shown in FIG. 19 and FIG.

  The RREPQ processing unit 13 performs processing when the node receives “RREPQ”, and generates “RREPQ” when the node is the target node. The reception process of “RREPQ” by the RREPQ processing unit 13 is shown in FIG. Further, as shown in the third embodiment, the RREPQ processing unit 13 performs an “RREPQ” Overload process (intercept process). This will be described later with reference to FIG.

  The CONFQ processing unit 14 performs processing when the node receives “CONFQ”, and generates “CONFQ” when the node is the source node. The process for receiving “CONFQ” by the CONFQ processing unit 14 is shown in FIG.

  The ERRRQ processing unit 15 performs processing when the node receives “RERRQ”, and generates “RERRQ” in the case of the corresponding node. The reception process of “RERQ” by the ERRRQ processing unit 15 is shown in FIG.

  The memory unit 17 stores the routing message received by the node. Further, the control unit 16 controls the wireless communication unit 11, the RREQQ processing unit 12, the RREPQ processing unit 13, the CONFQ processing unit 14, the RERQ processing unit 15, and the memory unit 17.

(Outline of system rerouting operation)
FIG. 17 is a flowchart showing an operation outline of the mobile ad hoc network system 1000. The operation outline of the mobile ad hoc network system 1000 will be described with reference to FIG. 17 and FIG. 16 described above. FIG. 17 is a processing flow in the mobile ad hoc network system 1000 for performing a procedure for rerouting the traffic 201 having the node 101 as a source node and the node 110 as a target node as shown in FIG. That is, in FIG. 16, the traffic 201 disappeared because the high-priority traffic 202 was formed after the low-priority traffic 201 was formed, and the source node 101 rerouted to the destination node 110. This is a case where processing is performed.

The RREQQ processing unit 12 of the source node 101 determines that it is a contention-avoidance routing to “RREQQ” which is a service quality route request in order to find again a route satisfying the service quality to the target node 110 based on the QoS parameter. The R (Reroute) flag shown is added and broadcasted to neighboring nodes (step S102b).
“RREQQ” includes “QoS parameter” (including required quality and priority), “source node address”, “target node address”, and the like.

  As illustrated in FIG. 17, the node that has received “RREQQ” from its own wireless communication unit 11 performs RREQQ transfer reception processing (step S103b) in the RREQQ processing unit 12. The target node 110 that has received “RREQQ” generates and returns “RREPQ” by the RREPQ processing unit 13 as a response to “RREQQ” (step S104b). The node that has received “RREPQ” performs “RREPQ transfer reception processing (step S105b)” in the RREPQ processing unit 13. The source node 101 that has received “RREPQ” generates and transmits “CONFQ”. The node that has received “CONFQ” performs a CONFQ transfer reception process in the CONFQ processing unit 14 (S106b).

(Propagation of “RREQQ” with R flag)
FIG. 18 is a diagram illustrating a state in which “RREQQ” with an R flag (Reroute flag) generated by the source node 101 propagates. The R flag is a flag indicating reroute processing. FIG. 19 shows the processing of the node that receives “RREQQ” with the R flag (details of S103b). The propagation in FIG. 18 is based on the flowchart in FIG.

  As shown in FIG. 19, the node (S202b) that has received “RREQQ” with the R flag generated and broadcast by the source node 101 by its own wireless communication unit 11 determines whether or not its own node is the target node by the RREQQ processing unit 12. Is determined (step S203b). If it is not “RREQQ” addressed to the own node (NO in S203b), the RREQQ processing unit 12 determines whether QoS can be supported by the resources of the entire own node (step S204b). Here, the “resource” means a “capability” of the node corresponding to the required quality, and includes, for example, a bandwidth resource, a CPU resource, a storage resource, and the like. If it is determined that support is not possible even if all of its own resources are allocated (NO in S204b), the RREQQ processing unit 12 discards "RREQQ" without transferring it (step S211b). The node that can support QoS (Yes in S204b), the RREQQ processing unit 12 determines whether there is existing traffic (step S205b). A node capable of supporting QoS and having no existing traffic (assuming that the nodes 102 and 103 correspond) (NO in S205b), the RREQQ processing unit 12 transfers “RREQQ” via the wireless communication unit 11, A resource of a certain node is temporarily reserved (step S208b). When the node is transferring / receiving the existing traffic like the mobile nodes 105 and 106 (YES in S205b), the RREQQ processing unit 12 compares the priorities of the existing traffic and the reroute traffic (step S206b). If the reroute traffic has a higher priority than the existing traffic, the RREQQ processing unit 12 transfers “RREQQ” to the adjacent node via the wireless communication unit 11, and temporarily reserves the resource of the node (step S208b). If the priority of the reroute traffic is lower or the same as that of the existing traffic, the RREQQ processing unit 12 determines whether the existing traffic and the reroute traffic can be supported simultaneously (step S207b). If it can be supported at the same time, the RREQQ processing unit 12 transfers “RREQQ” to the adjacent node via the wireless communication unit 11, and temporarily reserves its own resources (step S208b). If a plurality of traffics cannot be supported simultaneously, the RREQQ processing unit 12 checks whether or not there is an R flag in “RREQQ” (step 209b). In the case of “RREQQ” with an R flag (YES in step S209b), the RREQQ processing unit 12 transfers “RREQQ” to the neighboring nodes via the wireless communication unit 11. If it is not “RREQQ” with the R flag (NO in step S209b), the RREQQ processing unit 12 discards the “RREQQ” without transferring it (step S211b).

  Upon receiving “RREQQ”, the target node 110 generates “RREPQ” that is a quality of service route response for all the routes that can be used by the RREPQ processing unit 13 (step S212b), and the R flag is set in “RREQQ”. It is determined whether or not there is (step S213b). If “RREQQ” has an R flag (YES in step S213b), the R flag is set in “RREPQ” (reply with a corresponding flag) (step S214b). When the target node 110 generates “RREPQ”, the RREPQ processing unit 13 replies to all available routes via the wireless communication unit 11 and reports the routes (step S215b).

(Propagation of “RREPQ”)
FIG. 20 is a diagram showing how “RREPQ” generated by the target node 110 propagates. FIG. 21 shows a flow process of the node that has received “RREPQ”. The propagation in FIG. 20 is based on the flowchart in FIG.

  This will be described with reference to FIG. In the node that has received “RREPQ” via the wireless communication unit 11 (S302b), the RREPQ processing unit 13 determines whether the received “RREPQ” is a message addressed to its own node (step S303b). When the message is not addressed to the own node (NO in step S303b), it is determined whether or not the R flag is set in “RREPQ” (step S304b). When the R flag is not set in “RREPQ” (NO in step S304b), the RREPQ processing unit 13 of each node transfers “RREPQ” to the source node 101 (step S307b). When the R flag is set in “RREPQ” (YES in step S304b), it is determined whether the own node is transferring high priority traffic (step S305b). In this case, “RREPQ” includes priority, and the node stores the information of traffic transferred by itself as a traffic list (including priority) in the memory unit 17 and can be determined. When the own node is not transmitting the high priority traffic (NO in step S305b), the RREPQ processing unit 13 of each node transfers “RREPQ” to the source node 101 (step S307b). When the own node is transmitting high-priority traffic (YES in step S305b), the RREPQ processing unit 13 sets a W (Wait) flag (standby flag) to “RREPQ” (step S306b), and the source node 101 “RREPQ” is forwarded (step S307b).

  In the source node 101 that has received “RREPQ”, the RREPQ processing unit 13 determines whether or not the W flag is set in “RREPQ” (step S308b). When the W flag is not set in “RREPQ” (NO in step S308b), the CONFQ processing unit 14 selects an optimal route from a single route or a plurality of routes satisfying the QoS (step S310b), and the service quality “CONFQ”, which is information indicating route confirmation, is generated, and the generated “CONFQ” is transmitted to the target node 104 via the wireless communication unit 11 along the selected route (step S311b).

  If the W flag is set in “RREPQ” (YES in step S308b), the RREPQ processing unit 13 of the source node determines that a route that avoids the conflict has not been found, interrupts its own node traffic transfer, The ERRRQ reception waiting state is set, or the traffic transfer is terminated (step S309b).

The traffic 201 is suspended or interrupted by temporarily stopping or interrupting the rerouting of the traffic 201 by the above procedure.

  The intermediate nodes 105 and 106 and the destination node 104 of each traffic may always detect whether the node can support each quality of service (step S107b in FIG. 17). If it is determined that service quality cannot be supported during traffic transfer or reception, a route error “RERRQ” is transmitted to the traffic source node (step S109b in FIG. 17). Further, it may be detected whether the traffic being transferred or received continues (step S108b in FIG. 17). If the traffic is not transferred for a certain period, it is determined that the traffic has ended, and the resources allocated to the traffic are released (step S111b in FIG. 17).

  In addition, the node that has released the resources allocated to the traffic until then has transmitted “RERRQ” for avoiding the contention, and transmits the “RREPQ” for the rerouting message of the contention traffic by setting the W flag. If the intermediate node 105 determines that the node is a corresponding node (step S112b in FIG. 17), the intermediate node 105 indicates that the resource has been released to the source node 101, as shown in FIG. A restart instruction signal) is transmitted to notify that routing is performed again (step S109b in FIG. 17).

  FIG. 22 shows a state of propagation of “RERRQ” for resuming traffic transmitted from the node 105 so as to perform routing again to the node 101. The propagation in FIG. 22 follows the flow shown in FIG.

  FIG. 23 shows a processing flow of the node that has received “RERRQ”. The node that has received “RERQ” determines whether it is “RERQ” addressed to itself by the RERRRQ processing unit 15 (step S503b). When it is determined that the node is not addressed to itself (NO in S503b), the intermediate node that has received “RERQ” determines whether the same “RERQ” has already been received by the RERRRQ processing unit 15 (step S504b). If “RERRQ” is received for the first time, the RERRQ processing unit 15 releases the resource of the node reserved for traffic and transfers “RERRQ” to the source node 101 (step S506b). If it has already been transferred / transmitted, the RERRRQ processing unit 15 may discard “RERQ” without transferring it (step S507b). This prevents the source node 101 from receiving “RERQ” redundantly. The source node 101 that has received “RERRQ” uses the prepared alternative route or sends “RREQQ” to perform routing again, and selects a route that does not cause contention between the high-priority traffic and the link or node. A discovery procedure is performed (step S505b).

  By restarting the routing of the traffic 201 by the above procedure, the transmission of the traffic 201 is resumed.

  With the above procedure, multiple traffics with priorities indicated in a mobile ad hoc network system are mixed, causing link or node contention with other traffic with different priorities, and trying to reroute low priority traffic. When a route for avoiding contention cannot be found due to high-priority traffic, the transfer of the low-priority traffic can be temporarily suspended or terminated, and when the high-priority traffic is terminated, transmission of the low-priority traffic can be resumed immediately.

Embodiment 3 FIG.
Next, Embodiment 3 will be described with reference to FIGS. In the above-described second embodiment, when rerouting for avoiding traffic contention cannot find a route that avoids traffic, suspension or suspension and transmission from suspension are resumed. In the third embodiment, when a highly urgent message related to human life at the time of a disaster is transmitted, the route is quickly routed by stopping the transfer of existing traffic regardless of whether there is a node or link contention. An embodiment for establishing

  A mobile ad hoc network system 1001 in FIG. 24 includes mobile nodes 301 to 320. Each mobile node can be connected to each other by a wireless communication link.

  As shown in FIG. 24, low-priority traffic 203 and mobile node 303 with the mobile node 301 as the source node, nodes 307, 313 and 314 as the intermediate node, and the node 320 as the target node, the mobile node 303 as the source node, and the node 304 as the intermediate node, It is assumed that there is low priority traffic 204 with the node 305 as the target node. New traffic is generated with the mobile node 317 as the source node and the node 310 as the destination node.

  In the following third embodiment, when traffic 203 and traffic 204 exist, control for quickly establishing a route to destination node 310 for traffic 205 in routing for transmitting new traffic 205 is provided. It is about.

(Propagation of “RREQQ” with E flag)
FIG. 25 is a diagram illustrating a state in which the mobile node 317 that transmits an urgent message adds an E (Emergency) flag (emergency flag) to “RREQQ” and propagates it. FIG. 26 shows a flow process in which “RREQQ” with the E flag is received. The propagation in FIG. 25 is based on the flowchart in FIG.

  This will be described with reference to FIGS. As shown in FIG. 25, the node (S602b) that has received “RREQQ” with the E flag generated and broadcast by the source node 317 by its own wireless communication unit 11 determines whether or not the node is the target node by the RREQQ processing unit 12. Is determined (step S603b). If it is not “RREQQ” addressed to the own node (NO in 603b), the RREQQ processing unit 12 determines whether QoS can be supported by the resources of the entire own node (step S604b). Here, the “resource” means a “capability” of the node corresponding to the required quality, and includes, for example, a bandwidth resource, a CPU resource, a storage resource, and the like. When it is determined that support is not possible even if all of its own resources are allocated as in the node 318 of FIG. 25 (NO in S604b), the RREQQ processing unit 12 discards the “RREQQ” without transferring it (step S611b). . The node that can support QoS (Yes in S604b), the RREQQ processing unit 12 determines the presence or absence of existing traffic (step S605b). A node that can support QoS and can support QoS without existing traffic (no node 103 is applicable) (NO in S605b), the RREQQ processing unit 12 transmits “RREQQ via the wireless communication unit 11”. ”Is transmitted (broadcast), and the resource of the node that is itself is provisionally reserved (step S608b). When the node transmits and forwards the existing traffic like the mobile nodes 301, 303, 304, 307, 313, and 314 (YES in S605b), the RREQQ processing unit 12 sets the E flag to “RREQQ”. It is determined whether or not there is (step S606b). When the E flag is set in “RREQQ” (YES in S606b), transmission of the existing traffic is stopped (Step S607b), and the RREQQ processing unit 12 sends “RREQQ” to the adjacent node via the wireless communication unit 11. Transfer and temporarily reserve own resources (step S612b). When the E flag is not set in “RREQQ” (NO in step S606b), the process is the same as “S206b NO” in FIG. That is, the RREQQ processing unit 12 compares priorities of existing traffic and new traffic (step S608b). If the new traffic has a higher priority than the existing traffic, the RREQQ processing unit 12 transfers “RREQQ” to the adjacent node via the wireless communication unit 11, and temporarily reserves the resource of the node (step S612b). If the priority of the new traffic is lower than or equal to the existing traffic, the RREQQ processing unit 12 determines whether the existing traffic and the new traffic can be supported simultaneously (step S609b). If it can be supported at the same time, the RREQQ processing unit 12 transfers “RREQQ” to the adjacent node via the wireless communication unit 11, and temporarily reserves its own resources (step S612b). When a plurality of traffics cannot be supported simultaneously, the RREQQ processing unit 12 checks whether or not there is an R flag in “RREQQ” (step S610b). In the case of “RREQQ” with an R flag (YES in step S610b), the RREQQ processing unit 12 transfers “RREQQ” to the neighboring node via the wireless communication unit 11. If it is not “RREQQ” with the R flag (NO in step S610b), the RREQQ processing unit 12 discards the “RREQQ” without transferring it (step S613b).

  When the target node 110 receives “RREQQ” (YES in step S603b), the RREPQ processing unit 13 generates “RREPQ” that is a service quality route response for all available routes (step S614b). It is determined whether there is an R flag in “RREQQ” (step S615b). If “RREQQ” has an R flag (YES in step S615b), the R flag is set in “RREPQ” (step S616b). When the target node 110 generates “RREPQ”, the RREPQ processing unit 13 replies to all available routes via the wireless communication unit 11 and reports the routes (step S617b).

  In FIG. 27, “RREPQ” (emergency flag response reply) generated by the destination node 310 that has received “RREQQ” with the E flag set is sent from the destination node 310 to the nodes 309, 313 or nodes 314, 313, the state of being transmitted to the source node 317, and that “RREPQ” transmitted by each node can be overloaded if it is an adjacent node other than the designated node. FIG. FIG. 28 illustrates processing of a node that has overloaded “RREPQ”. Here, “overload” means that a node not indicated as a return path in “RREPQ” receives “RREPQ” and executes a predetermined process. Nodes are programmed that way.

(Propagation of “RREPQ”)
As illustrated in FIG. 27, the mobile nodes 309, 314, 313, and 317 that have received “RREPQ” via the wireless communication unit 11 perform processing according to the flow illustrated in FIG. 21 by the RREPQ processing unit 13.

(Overload of “RREPQ”)
As shown in FIG. 27, the nodes 303, 304, 305, 308, 310, and 314 that are adjacent to the node 309 overload the “RREPQ” transmitted from the node 309 to the next node 313 via the wireless communication unit 11. (Step S702b). The node overloading “RREPQ” determines whether or not the traffic is stopped by “RREQQ” with the E flag by the RREPQ processing unit 13 (step S703b). Note that, when the node stops the traffic due to “RREQQ” with the E flag, the node stores that fact. When the traffic is stopped as in the node 303 (YES in step S703b), the route indicated by “RREPQ” is compared with the route of the stopped traffic 204a to determine whether or not a node / route conflict occurs (step). S704b). If a conflict occurs (YES in step S704b), the process ends without doing anything (step S706b). If no contention occurs (NO in step S704b), transmission of the traffic 204 stopped at the node 303 is resumed (step S705b).

  FIG. 29 illustrates the propagation of “CONFQ” for highly urgent traffic. FIG. 30 illustrates processing of a node that has received “CONFQ” for highly urgent traffic.

  As shown in FIG. 29, the intermediate nodes 313, 314, 310 receive the “CONFQ” via the wireless communication unit 11 (step S402b), and the CONFQ processing unit 14 confirms the existence of the existing traffic list ( Step S403b). If there is an existing traffic list (YES in step S402b), it is determined whether QoS can be supported simultaneously (step S404b). If it is determined that QoS cannot be supported at the same time (NO in step S404b), the CONFQ processing unit 14 compares the existing traffic list with the route indicated by “CONFQ” to determine whether or not it is the first node in which contention occurs (step). S408b). This prevents the same “RERRQ” from being transmitted from a plurality of nodes. If it is the first node in which traffic contention occurs (YES in step S408b), the RERR processing unit 15 sets “RRRQ”, which is a route error message indicating that the route cannot be used, to the low priority via the wireless communication unit 11. Transmission is performed along the traffic route (step S409b). If it is not the first node in which traffic contention occurs (NO in step S408b), or if “REERQ” is transmitted (step S409b), resources are allocated to high priority traffic and “CONFQ” is transferred to the next node ( Step S410b). The ERRRQ processing unit 15 transmits the low priority traffic to the source node 301. The CONFQ processing unit 14 deletes the low priority traffic from the existing traffic list (step S411b). If there is no existing traffic list (NO in step S403b), or if QoS can be supported simultaneously (YES in step S404b), the CONFQ processing unit 14 allocates node resources to the new traffic, and if it is an intermediate node “CONFQ” is transferred to the next node (step S406b), and the CONFQ processing unit 14 adds the route indicated by “CONFQ” to the existing traffic list (step S407b).

  The node 307 that has received “RERQ” transfers “RERQ” to the source node 301 in accordance with the processing of FIG. The source node 301 that has received “RERQ” selects an alternative route or broadcasts “RREQQ” to perform routing again, as shown in FIG.

  When sending a highly urgent message related to human life in the event of a disaster, the route can be quickly routed by stopping the transfer of existing traffic regardless of whether there is a node or link contention. Establish.

  In the above embodiment, in a mobile ad hoc network having a plurality of intermediate nodes between a source node and a destination node, the QoS of priority traffic between the source node and the destination node based on a plurality of QoS (quality of service) parameters. In a system that changes the transmission path of non-priority traffic, the new communication path becomes priority traffic, and the non-priority traffic requests the transmission path again to discover the transmission path again. Explained how to forward the requested message.

  In the above embodiment, a method for transmitting to the source node that the request message transmitted to discover the transmission path again has not found a communication path that guarantees QoS to the target node by the transmission path of the priority traffic. Explained.

  In the above embodiment, since the request message transmitted to discover the transmission route again cannot find the communication route that guarantees the QoS to the target node by the transmission route of the priority traffic, the transmission of the non-priority traffic is interrupted. -Explained how to stop.

  In the above embodiment, the method of resuming transmission of non-priority traffic when transmission of priority traffic that caused non-priority traffic to stop has been described.

  In the above embodiment, the method of discovering the communication path to the target node regardless of the presence or absence of existing traffic when discovering a new communication path of traffic has been described.

  In the above embodiment, a method for requesting the source node to change the transmission path only when it is determined that it is the first node that affects QoS guarantee by storing the transmission path of each traffic. Explained.

FIG. 2 is a hardware configuration diagram of a mobile node in the first embodiment. FIG. 3 shows traffic 201a in the first embodiment. FIG. 3 is a block diagram of a mobile node in the first embodiment. 3 is a flowchart showing an operation outline of the mobile ad hoc network system in the first embodiment. FIG. 6 is a diagram showing a route of a service quality route request RREQQ in the first embodiment. 3 is a flowchart showing processing of a mobile node that has received RREQQ in the first embodiment. The figure which shows the path | route of the service quality route request | requirement RREPQ in Embodiment 1. FIG. 4 is a flowchart showing processing of a mobile node that has received a service quality route request RREPQ in the first embodiment. FIG. 5 is a diagram showing a route of a service quality route request CONFQ in the first embodiment. 3 is a flowchart showing processing of a mobile node that has received a service quality route request CONFQ in the first embodiment. FIG. 6 is a diagram showing a rerouting RREQQ in the first embodiment. 3 is a flowchart showing processing of a mobile node that has received a service quality error in the first embodiment. FIG. 6 is a diagram showing a rerouting RREPQ in the first embodiment. FIG. 6 is a diagram showing CONFQ for rerouting in the first embodiment. FIG. 3 is a diagram showing a rerouting route in the first embodiment. FIG. 9 shows traffic in the second embodiment. 9 is a flowchart showing an operation outline of a mobile ad hoc network system according to a second embodiment. The figure which shows propagation of RREQQ with R flag in Embodiment 2. FIG. 9 is a flowchart showing RREQQ reception / transfer processing in the second embodiment. FIG. 11 shows RREPQ propagation in the second embodiment. 9 is a flowchart showing RREPQ reception / transfer processing in the second embodiment. FIG. 10 is a diagram illustrating propagation of REERQ in the second embodiment. 9 is a flowchart illustrating REERQ reception / transfer processing according to the second embodiment. FIG. 10 shows traffic in the third embodiment. FIG. 10 is a diagram illustrating propagation of RREQQ with an E flag in the third embodiment. 10 is a flowchart showing RREQQ reception / transfer processing in the third embodiment. FIG. 10 shows RREPQ propagation in the third embodiment. 10 is a flowchart showing RREPQ reception / transfer processing in the third embodiment. FIG. 10 is a diagram illustrating a CONFQ path according to the third embodiment. 10 is a flowchart illustrating CONFQ reception / transfer processing according to the third embodiment. FIG. 10 is a diagram illustrating propagation of REERQ in the third embodiment.

Explanation of symbols

  101 mobile node, 11 radio communication unit, 12 RREQQ processing unit, 13 RREPQ processing unit, 14 CONFQ processing unit, 15 ERRRQ processing unit, 16 control unit, 17 memory unit, 201a, 201b, 202 traffic, 810 CPU, 811 bus, 812 ROM, 813 RAM, 814 communication unit, 820 flash memory, 821 OS, 823 program group, 824 file group, 1000 mobile ad hoc network system.

Claims (8)

In the communication device serving as the intermediate node in the mobile ad hoc network system capable of dynamically setting the communication path from the source node to the target node via the intermediate node,
A storage unit that stores required quality and priority required for a communication path that is already set as a communication path with the communication device that is self as the intermediate node;
Request quality and priority required for a new communication path, which is a request for setting a new communication path from the other nodes constituting the mobile ad hoc network system, with the communication device being the intermediate node as the intermediate node. An intermediate communication unit that receives a request including
Both the required quality of the new communication path indicated by the request received by the intermediate side communication unit and the required quality required for the already set communication path stored in the storage unit It is determined whether or not it can be satisfied by resources of a certain communication device, and if it is determined that it cannot be satisfied, the priority of the communication path that has already been set and the priority of the new communication path indicated by the request And an intermediate processing unit for allocating the resource of the communication device that is self to the communication path with the higher priority. The intermediate processing unit is
If the resource of the communication device that is self is assigned to the new communication path indicated by the request, it is a message that can be transmitted to the source node via the communication path that has already been set, and an error Generate an error message to notify the occurrence of
The intermediate communication unit is
The communication apparatus according to claim 1, wherein the error message generated by the intermediate processing unit is transmitted to a source node of the communication path that has already been set. A communication program that causes a communication device, which is a computer serving as the intermediate node in a mobile ad hoc network system capable of dynamically setting a communication path from the source node to the target node, to execute the following processing (1) self (2) Processing for storing required quality and priority required for a communication path that is the communication path having the communication apparatus as the intermediate node and that has already been set (2) Other that constitutes the mobile ad hoc network system Processing for receiving from the node a request for setting a new communication path that uses the communication apparatus that is its own as the intermediate node, and including a request quality and priority required for the new communication path (3) The requested quality of the new communication path indicated by the received request and the already set stored quality It is determined whether both of the required quality required for the communication path can be satisfied by the resource of the communication device that is self, and if it is determined that it cannot be satisfied, the priority of the communication path that has already been set A process of allocating the resource of the communication device that is its own to the communication path with the higher priority of the priority and the priority of the new communication path indicated by the request In a mobile ad hoc network system capable of dynamically setting a communication path from a source node as a communication device to a target node as a communication device via an intermediate node as a communication device,
The intermediate node, which is a communication device,
A storage unit that stores required quality and priority required for a communication path that is already set as a communication path with the communication device that is self as the intermediate node;
Request quality and priority required for a new communication path, which is a request for setting a new communication path from the other nodes constituting the mobile ad hoc network system, with the communication device being the intermediate node as the intermediate node. An intermediate communication unit that receives a request including
Both the required quality of the new communication path indicated by the request received by the intermediate side communication unit and the required quality required for the already set communication path stored in the storage unit It is determined whether or not it can be satisfied by resources of a certain communication device, and if it is determined that it cannot be satisfied, the priority of the communication path that has already been set and the priority of the new communication path indicated by the request And the resource of the communication device that is self is assigned to the communication path with the higher priority, and the resource of the communication device that is self is assigned to the new communication path indicated by the request. Is a message that can be transmitted to the source node through the communication path that has already been set, and that is an error message notifying the occurrence of an error. Together and an intermediate side processing unit for generating over-di,
The intermediate communication unit is
Sending the error message generated by the intermediate processing unit toward the source node of the communication path that has already been set,
The source node of the communication path that has already been set is
A source-side communication unit that receives the error message;
When the source side communication unit receives the error message, the source side processing unit includes a source side processing unit that starts a process of establishing a new communication path to a target node of the communication path that has already been set. Mobile ad hoc network system. The source node is
As the process for establishing a new communication path, a request with a reroute flag including the priority and quality of the new communication path and a flag indicating a reroute process that is a process for establishing the new communication path is added. Generate, broadcast the generated reroute flagged request,
The relay node is
When the broadcast request with the reroute flag is received, it is determined whether or not the quality included in the request with the reroute flag can be satisfied with its own resources, and when the request is satisfied, the received reroute is received. Add your relay history to the flagged request and broadcast it,
The destination node is
Upon receipt of the request with the reroute flag broadcast by the relay node, the reply corresponding to the received request with the reroute flag includes the priority included in the request with the reroute flag and includes the priority in the reroute flag. A reply with a corresponding flag to which a corresponding flag is added is generated, and a route from the source node to which the request with the reroute flag is transmitted to the generated reply with the corresponding flag as a transmission path of the reply with the corresponding flag Send the reply with the corresponding flag including the specified routing,
The relay node is
When the reply with the corresponding flag is received, it is determined whether or not the traffic having higher priority than the priority included in the reply with the corresponding flag is transferred. Send a reply flag with a response flag with a standby flag indicating standby,
The source node is
5. The mobile ad hoc network system according to claim 4, wherein the reply with the corresponding flag to which the standby flag is added is received. The source node is
6. The mobile ad hoc network system according to claim 5, wherein when the reply with the corresponding flag to which the standby flag is added is received, the processing for establishing the new communication path is stopped. The intermediate node is
When the own resource is allocated to the existing traffic, when the allocated resource is released, it is determined whether the waiting flag has been set and the reply with the corresponding flag has been transmitted. If it is determined that there is, generate a restart instruction signal for instructing the source node to resume the process of establishing the new communication path, and transmit the generated restart instruction signal to the source node,
The source node is
The mobile ad hoc network system according to claim 6, wherein when the restart instruction signal is received from the intermediate node, the process of establishing a new communication path is restarted. The source node is
Generate a request with an emergency flag including the quality required for the new communication path and add an emergency flag indicating an emergency, broadcast the generated request with the emergency flag,
The intermediate node is
When the request with the urgent flag is received, it is determined whether or not the quality included in the request with the urgent flag can be satisfied with its own resource, and when it is determined that the request can be satisfied, the existing traffic relayed by itself When it is determined that there is, the relay of the existing traffic is stopped, and the relayed request is added to the received request with the urgent flag and broadcasted,
The destination node is
Upon receiving the request with the emergency flag broadcast by the intermediate node, an emergency flag response reply corresponding to the received request with the emergency flag is generated, and the request with the emergency flag is generated in the generated emergency flag response reply. Sending the route from the source node to itself including the route designation that designates the route as the transmission route of the emergency flag corresponding reply,
The intermediate node is
When the emergency flag response reply is received, it is determined whether or not the relay of the existing traffic is canceled when the request with the emergency flag is received. The relay of the existing traffic that was stopped when the request with the urgent flag is received is restarted if it is determined whether or not it is included. The mobile ad hoc network system according to the above.

Images