WO2009131160A1 - 経路情報中継方法および無線端末 - Google Patents

経路情報中継方法および無線端末 Download PDF

Info

Publication number
WO2009131160A1
WO2009131160A1 PCT/JP2009/058024 JP2009058024W WO2009131160A1 WO 2009131160 A1 WO2009131160 A1 WO 2009131160A1 JP 2009058024 W JP2009058024 W JP 2009058024W WO 2009131160 A1 WO2009131160 A1 WO 2009131160A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
route information
information
route
packet
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/JP2009/058024
Other languages
English (en)
French (fr)
Japanese (ja)
Inventor
健太郎 池本
知善 竹林
園田　俊浩
井谷　茂寛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Fujitsu Ltd
Original Assignee
Fujitsu Ltd
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 Fujitsu Ltd filed Critical Fujitsu Ltd
Priority to EP09735806.3A priority Critical patent/EP2273822B1/en
Priority to CN200980114244.XA priority patent/CN102017716B/zh
Publication of WO2009131160A1 publication Critical patent/WO2009131160A1/ja
Priority to US12/926,031 priority patent/US9210647B2/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/30—Connectivity information management, e.g. connectivity discovery or connectivity update for proactive routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/26—Route discovery packet
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/34—Source routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/44—Distributed routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality

Definitions

  • the present invention relates to a route information relay method and a wireless terminal.
  • each wireless terminal connected to the ad hoc network performs path control before communicating with other wireless terminals.
  • a wireless terminal newly connected to the ad hoc network broadcasts presence information indicating that the terminal is present on the network to neighboring terminals. Then, the adjacent terminal generates route information based on the presence information and broadcasts the generated route information to the next adjacent terminal.
  • each wireless terminal measures the quality of the route between the terminal itself and the adjacent terminal, and relays only the adjacent terminal connected through the high-quality route when relaying the route information (for example, Patent Document 1). Further, for example, each wireless terminal broadcasts route information specifying a quality criterion to neighboring terminals, and the neighboring terminal does not relay the route information when the quality of the route does not satisfy the quality criterion (for example, Patent Document 2).
  • the above-described conventional technology has a problem in that the amount of communication for route control increases as the number of wireless terminals connected to the ad hoc network increases, which places a load on the network. That is, as described above, each wireless terminal connected to the ad hoc network broadcasts route information to adjacent terminals and receives response information. For this reason, as the number of wireless terminals connected to the ad hoc network increases, the number of route information and response information to be transmitted increases exponentially, and the amount of communication for route control increases.
  • the present invention has been made to solve the above-described problems of the prior art, and provides a route information relay method and a wireless terminal capable of reducing the amount of communication for route control. Objective.
  • each wireless terminal receives route information from a wireless terminal connected to itself.
  • each wireless terminal acquires quality information indicating the quality of the route indicated by the route information for the received route information.
  • Each of the wireless terminals determines, for each predetermined period, whether or not a plurality of pieces of route information having the same wireless terminal as the packet destination is received for the received route information. Subsequently, when each of the wireless terminals receives a plurality of route information having the same destination wireless terminal as a result of the determination, the wireless terminals compare the quality information for each of the plurality of received route information, As a result, route information corresponding to the quality information indicating the highest quality is selected. Thereafter, each wireless terminal relays the selected route information to wireless terminals other than the wireless terminal that transmitted the received route information, among the wireless terminals mutually connected to the own terminal.
  • FIG. 1 is a diagram for explaining the basic principle of the route information relay method according to the first embodiment.
  • FIG. 2 is a diagram illustrating an overall configuration of the ad hoc network according to the first embodiment.
  • FIG. 3 is a block diagram illustrating the configuration of the node in the first embodiment.
  • FIG. 4 is a diagram for explaining the routing table in the first embodiment.
  • FIG. 5 is a diagram for explaining the link table in the first embodiment.
  • FIG. 6 is a diagram for explaining the concept of link weight.
  • FIG. 7 is a diagram for explaining the periodic table according to the first embodiment.
  • FIG. 8 is a diagram for explaining the processing procedure (overall) of the node in the first embodiment.
  • FIG. 9 is a diagram for explaining an example of updating a table in the first embodiment.
  • FIG. 10 is a diagram for explaining an example of updating a table in the first embodiment.
  • FIG. 11 is a diagram for explaining an example of updating a table in the first embodiment.
  • FIG. 12 is a diagram for explaining an example of updating a table in the first embodiment.
  • FIG. 13 is a diagram for explaining an example of updating a table in the first embodiment.
  • FIG. 14 is a diagram for explaining an example of updating a table in the first embodiment.
  • FIG. 15 is a diagram for explaining an example of updating a table in the first embodiment.
  • FIG. 16 is a flowchart illustrating the link table update process according to the first embodiment.
  • FIG. 17A is a flowchart of the routing table update process according to the first embodiment.
  • FIG. 17-2 is a flowchart illustrating the routing table update process according to the first embodiment.
  • FIG. 18 is a flowchart illustrating an evaluation value calculation process according to the first embodiment.
  • FIG. 19 is a flowchart illustrating a transmission process according to the first embodiment.
  • FIG. 20 is a diagram for explaining the effect of the first embodiment.
  • FIG. 21 is a diagram for explaining a routing table in the second embodiment.
  • FIG. 22 is a flowchart illustrating a transmission process according to the second embodiment.
  • FIG. 23 is a block diagram illustrating a configuration of a node according to the third embodiment.
  • FIG. 24 is a diagram for explaining the data management table in the third embodiment.
  • FIG. 25 is a diagram for explaining a routing table in the third embodiment.
  • FIG. 26 is a diagram for explaining the processing procedure (entire) of the node in the third embodiment.
  • FIG. 27 is a flowchart illustrating data management table update processing according to the third embodiment.
  • FIG. 1 is a diagram for explaining the basic principle of the route information relay method according to the first embodiment.
  • FIG. 1 for convenience of explanation, only a part of the ad hoc network in the first embodiment is shown.
  • each of the nodes shown in FIG. 1 transmits / receives a packet to / from nodes other than adjacent nodes interconnected with the own node by a multi-hop method.
  • Each node exchanges route information according to a route search protocol.
  • each node uses a control packet called a HELLO packet.
  • the node “x” is a gateway node
  • the node “v” is a node connected to an external network.
  • the node “a” is newly connected to the ad hoc network, and presence information indicating that the node “a” exists on the network is used as the adjacent node “d” and the adjacent node. It is assumed that “e” is transmitted to each.
  • the presence information transmitted from the node “a” is received by the adjacent node “d”. Subsequently, the adjacent node “d” generates route information based on the received presence information, and relays the generated route information to the adjacent node “x”. Then, as shown in FIG. 1B, the node “x” receives the route information.
  • the route information indicates the correspondence between the node that is the destination of the packet and the node that relays the packet.
  • the route information includes contents such as “node“ x ” ⁇ node“ d ” ⁇ node“ a ”” (correspondence relationship between the node “a” that is the destination of the packet and the node “d” that relays the packet). Information.
  • each node in the first embodiment acquires quality information indicating the quality of the route for the received route information. For example, as illustrated in FIG. 1B, the node “x” acquires quality information “high” indicating the quality of the route “node“ x ” ⁇ node“ d ” ⁇ node“ a ””.
  • the received route information is transmitted to the adjacent node each time. That is, in the case of the node “x” in the prior art, the received route information “node“ x ” ⁇ node“ d ” ⁇ node“ a ”” is transmitted to the node “v” each time. However, each node in the first embodiment does not transmit the received route information to the adjacent node each time.
  • Each node in the first embodiment determines, for each predetermined cycle, whether or not a plurality of pieces of route information having the same destination node of the packet are received for the received route information.
  • the presence information transmitted from the node “a” is received by the adjacent node “e” while being received by the adjacent node “d”. Further, the node “e” generates route information based on the presence information, and relays the generated route information to the next adjacent node “f”. Then, the node “f” further relays the route information to the next adjacent node “x”. Then, as shown in FIG. 1C, the node “x” receives the route information.
  • the node “X” has “node“ x ” ⁇ node“ f ” ⁇ node“ e ” ⁇ node“ a ”” (node “a” that is the destination of the packet and node “f” that relays the packet) Route information having a content such as Further, for example, the node “x” acquires the quality information “low” indicating the quality of the route “node“ x ” ⁇ node“ f ” ⁇ node“ e ” ⁇ node“ a ””. For this reason, the node “x” is determined to be a case where a plurality of pieces of route information having the same destination node are received as a result of the determination for each predetermined period.
  • Each node in the first embodiment compares the quality information for each of the plurality of received route information, and selects the route information corresponding to the quality information indicating the highest quality as a result of the comparison.
  • the node “x” has route information “node“ x ” ⁇ node“ d ” ⁇ node“ a ”” and route information “node“ x ” ⁇ node“ f ” ⁇ node“ e ” ⁇ node“ a ””. Compare each quality information for each. As a result of the comparison, the node “x” selects the route information “node“ x ” ⁇ node“ d ” ⁇ node“ a ”” corresponding to the quality information “high” (dotted line in FIG. 1C). See).
  • Each node in the first embodiment relays the selected route information to nodes other than the node that is the source of the route information, among the nodes mutually connected to the own node. For example, as shown in FIG. 1C, the node “x” relays the selected route information “node“ x ” ⁇ node“ d ” ⁇ node“ a ”” to the node “v”. .
  • each node in the first embodiment can reduce the amount of communication for route control.
  • each node in the conventional technology receives the route information, and transmits the received route information to the adjacent node each time.
  • each node must transmit route information many times, and a control header portion is added for each HELLO packet, which requires a transmission waiting time for each HELLO packet. I was sorry.
  • the number of route information to be transmitted increases, the frequency of occurrence of collision also increases, and as a result, the number of times of retransmitting route information also increases. For this reason, if the conventional technique is applied to a large-scale ad hoc network, flooding due to packet excess occurs, and it is difficult to create a routing table for route search.
  • each node in the first embodiment receives the route information, it does not transmit the received route information to the adjacent node each time.
  • Each node determines, for each predetermined period, whether or not a plurality of route information having the same node as the packet destination is received, and compares the quality information with each other to correspond to the highest quality quality information. Select.
  • Each node relays only the selected route information to the adjacent node.
  • each node can reduce the number of times route information is transmitted, and at the same time, overhead is also reduced.
  • the frequency of occurrence of collision is also reduced, and consequently the number of times the route information is retransmitted is also reduced. For this reason, even if the technique of the first embodiment is applied to a large-scale ad hoc network, flooding due to packet excess does not occur, and it is not difficult to create a routing table for route search.
  • FIG. 2 is a diagram illustrating an overall configuration of the ad hoc network according to the first embodiment.
  • the node “x” is a gateway node
  • the nodes “v” and “z” are nodes connected to an external network.
  • the node “a” is newly connected to the ad hoc network, and presence information indicating that the node “a” exists on the network is sent to each of the adjacent node “d” and the adjacent node “e”. Assuming that it was transmitted, only the part related to the assumption is extracted and described.
  • FIG. 3 is a block diagram illustrating a configuration of a node in the first embodiment.
  • the node 10 according to the first embodiment particularly includes a communication unit 11, a storage unit 20, and a control unit 30.
  • the communication unit 11 is a wireless module and an antenna that can perform wireless communication.
  • the storage unit 20 stores data used for various processes performed by the control unit 30, and particularly includes a routing table unit 21, a link table unit 22, a periodic table unit 23, and a work table unit 24.
  • the routing table unit 21 stores route information.
  • the route information is information indicating a route when a packet is transmitted to a destination wireless terminal.
  • the route information indicates the correspondence between the node that is the destination of the packet and the node that relays the packet.
  • the routing table unit 21 stores a correspondence relationship between the route information and quality information indicating the quality of the route indicated by the route information.
  • the routing table unit 21 stores the route information by being updated by the routing table updating unit 33 described later when a HELLO packet is received by the route information receiving unit 31 described later.
  • the route information stored in the routing table unit 21 is used for processing by the route information transmitting unit 34 described later and processing by the packet transmitting / receiving unit 35 described later.
  • the routing table unit 21 stores route information as shown in FIG.
  • FIG. 4 is a diagram for explaining the routing table in the first embodiment.
  • FIG. 4 illustrates the routing table unit 21 of the node “x”.
  • the routing table unit 21 illustrated in FIG. 4 includes a destination node (“destination”) indicating a node serving as a packet destination, and an adjacent node (“ "Adjacent”) is stored in association. Further, the routing table unit 21 illustrated in FIG. 4 stores an evaluation value (“evaluation value”) indicating the quality of a route for transmitting and receiving packets with the destination node in association with each other.
  • the evaluation value is a route weight indicating the quality of the route between the destination node and the adjacent node (“route weight”) or the quality of the link between the adjacent node and the own node. This is a value calculated from a link weight indicating “link weight”. The calculation of the evaluation value will be described in detail when explaining the procedure of the routing table update process.
  • the routing table unit 21 stores route information of the destination node “d”, the adjacent node “d”, and the evaluation value “50”. That is, when the packet is transmitted to the node “d” as the destination, the routing table unit 21 has a route for transmitting the packet to the adjacent node “d”, and the quality of the route is the evaluation value “50”.
  • the routing table unit 21 stores route information of the destination node “e”, the adjacent node “f”, and the evaluation value “55”. That is, when the packet is transmitted to the node “e” as the destination, the routing table unit 21 has a route for transmitting the packet to the adjacent node “f”, and the quality of the route is the evaluation value “55”.
  • routing table unit 21 illustrated in FIG. 4 also stores a rank of route information (“rank”) and a transmission flag (“transmission flag”) indicating whether or not the route information has been transmitted.
  • rank a rank of route information
  • transmission flag a transmission flag indicating whether or not the route information has been transmitted. The order of the route information and the transmission flag will be described in detail when the transmission process is described.
  • the link table unit 22 stores link information.
  • the link information indicates a value obtained by evaluating the quality of the link between the own node and the adjacent node.
  • the link table unit 22 stores link information by being updated by a link table update unit 32 described later when a HELLO packet is received by a route information reception unit 31 described later.
  • the link information stored in the link table unit 22 is used for processing by the routing table update unit 33 described later.
  • the link table unit 22 stores link information as shown in FIG.
  • FIG. 5 is a diagram for explaining the link table in the first embodiment.
  • FIG. 5 illustrates the link table unit 22 of the node “x”.
  • the link table unit 22 illustrated in FIG. 5 includes an adjacent node (“adjacent”), a forward evaluation value that evaluates the quality of the forward path (“outward evaluation value”), and a return path evaluation value that evaluates the quality of the return path (“return path”).
  • Evaluation value ”) and link weight (“ link weight ”) are stored in association with each other.
  • the forward path evaluation value is a value obtained by evaluating the quality of the forward path for the adjacent node
  • the backward path evaluation value is a value obtained by evaluating the quality of the backward path for the adjacent node.
  • the link table unit 22 stores link information of the adjacent node “d”, the forward path evaluation value “30”, the return path evaluation value “20”, and the link weight “50”. That is, the link table unit 22 indicates that the link between the adjacent node “d” has a forward path quality value “30” for the adjacent node “d” and a return path quality for the adjacent node “d”. Is stored in the return path evaluation value “20”. Further, the link table unit 22 stores that the link with the adjacent node “d” has the link weight “50”.
  • FIG. 6 is a diagram for explaining the concept of link weight.
  • the node “d” evaluates the HELLO packet received from the node “a”, evaluates the quality of the forward path for the node “a”, and calculates the forward path evaluation value “wa”.
  • the node “d” cannot evaluate the quality of the return path for the node “a”. Therefore, as shown in FIG. 6, only the forward path evaluation value “wa” is stored in the link table of the node “d”, and the return path evaluation value is “null”.
  • the forward path for the node “d” is the return path for the node “a”
  • the forward path for the node “a” is the return path for the node “d”.
  • the forward path evaluation value “wd” calculated at the node “a” is a value to be stored as the return path evaluation value in the link table of the node “d”
  • the node “d” notifies the node “d” of the forward evaluation value “wd”, and the node “d” transmits the forward evaluation value “wa” to the node “a”. Notice.
  • the link weight indicating the link quality is a value obtained by adding the forward path evaluation value and the backward path evaluation value. Therefore, as shown in FIG. 6, the link weight “W” of the node “a” is “wd + wa”, and the link weight “W” of the node “d” is “wa + wd”.
  • FIG. 6 it has been described that the exchange of the forward evaluation value and the return evaluation value between the node “a” and the node “d” is performed simultaneously.
  • the node 10 in the first embodiment transmits / receives a HELLO packet to / from an adjacent node
  • the node 10 evaluates the quality of the link with the adjacent node and uses the link table as the latest information.
  • the exchange of the forward path evaluation value and the return path evaluation value is not limited to the case where they are performed simultaneously. Only the forward evaluation value is stored in the link table unit 22 as the latest information, and the link weight is updated based on the latest outgoing evaluation value. However, the return evaluation value may not be the latest information.
  • the cycle table unit 23 stores cycle information.
  • the period information indicates the period of a packet received from an adjacent node.
  • the cycle table unit 23 stores the cycle information by being updated by a link table update unit 32 (to be described later) when a HELLO packet is received by a route information receiving unit 31 (to be described later).
  • the period information stored in the period table unit 23 is used for processing by the link table update unit 32.
  • the cycle table unit 23 stores cycle information as shown in FIG.
  • FIG. 7 is a diagram for explaining the periodic table according to the first embodiment.
  • FIG. 7 illustrates the cycle table unit 23 of the node “x”.
  • the cycle table unit 23 illustrated in FIG. 7 includes, for each adjacent node that is a transmission source of the received packet, an ID (“ID”) that identifies the packet, a cycle (“cycle”) that received the packet, The received time (“reception time”) is stored in association with each other.
  • the period table unit 23 provides period information of ID “4”, period “0:02”, and reception time “0:05” for the packet received from the adjacent node “d”.
  • the period table unit 23 indicates that the packet with ID “4” is the packet received at time “0:05”, and the difference from the reception time of the packet with ID “3” (“0:05” ⁇ “0”). : 03]), the fact that the cycle is “0:02” is stored.
  • the work table unit 24 has the same structure as the routing table unit 21 and temporarily stores indeterminate route information before being stored in the routing table unit 21.
  • the work table unit 24 will be described in detail when the link table update process is described.
  • the control unit 30 controls the node 10 to execute various processes, and in particular, the route information receiving unit 31, the link table updating unit 32, the routing table updating unit 33, the route information transmitting unit 34, and the packet transmitting / receiving unit. 35.
  • the control unit 30 is executed on a memory included in the node 10.
  • the route information receiving unit 31 receives route information from adjacent nodes. Specifically, the route information receiving unit 31 receives a HELLO packet from an adjacent node. Further, the path information receiving unit 31 transmits the received HELLO packet to the link table updating unit 32 and the routing table updating unit 33.
  • the link table update unit 32 updates the link information stored in the link table unit 22. Specifically, when the HELLO packet is transmitted from the path information receiving unit 31, the link table updating unit 32 updates the link information stored in the link table unit 22 based on the transmitted HELLO packet. Moreover, the link table update part 32 updates the period information which the period table part 23 memorize
  • the routing table update unit 33 updates the route information stored in the routing table unit 21. Specifically, when the routing table update unit 33 receives the HELLO packet from the route information receiving unit 31, the routing table update unit 33 updates the route information stored in the routing table unit 21 based on the transmitted HELLO packet. Note that the processing by the routing table update unit 33 will be described in detail when the routing table update processing is described.
  • the route information transmission unit 34 transmits the route information to nodes other than the node that has transmitted the route information among the adjacent nodes. Specifically, the route information transmission unit 34 generates a HELLO packet from the route information stored in the routing table unit 21 updated by the routing table update unit 33, and transmits the generated HELLO packet to an adjacent node. The processing by the route information transmission unit 34 will be described in detail when the route information transmission processing is described.
  • the packet transmitting / receiving unit 35 receives a packet from an adjacent node. Specifically, when receiving a packet from an adjacent node, the packet transmitting / receiving unit 35 determines the destination of the received packet. The packet transmitting / receiving unit 35 transmits a packet to the adjacent node. Specifically, the packet transmitting / receiving unit 35 transmits the transmitted packet based on the route information stored in the routing table unit 21.
  • FIG. 8 is a diagram for explaining the processing procedure (overall) of the node in the first embodiment.
  • the route information receiving unit 31, the link table updating unit 32, the routing table updating unit 33, the route information transmitting unit 34, and the clock are provided. It is extracted and shown.
  • the node 10 in the first embodiment receives a HELLO packet in the route information receiving unit 31.
  • the link table updating unit 32 subsequently updates the link table, and the routing table updating unit 33 updates the routing table. That is, with the reception of the HELLO packet, the link table and the routing table are continuously updated.
  • the node 10 receives a HELLO packet from an adjacent node, and the reception timing is not controlled by the node 10. Therefore, as illustrated in FIG. 8, when the node 10 in the first embodiment receives the HELLO packet again in the route information receiving unit 31, the link table updating unit 32 updates the link table, and the routing table updating unit 33 performs routing. Update the table.
  • the node 10 includes a clock that measures a predetermined cycle, and the path information transmission unit 34 performs routing table unit 21 for each predetermined cycle measured by the clock (for each clock event).
  • a HELLO packet is generated from the path information stored in, and the HELLO packet is transmitted.
  • FIG. 9 and 10 are diagrams for explaining an example of updating a table in the first embodiment.
  • a part of the overall configuration of the ad hoc network shown in FIG. 2 is composed of node “a”, node “d”, node “e”, node “f”, and node “x”. Only route information and link information transmitted / received with respect to the network are illustrated. That is, in practice, each node should hold and transmit / receive path information and link information related to all nodes included in the overall configuration of the ad hoc network shown in FIG. Only the route information and link information of the part are illustrated.
  • the node “x” is a gateway node. Also, the quality of the link between the node “d” and the node “x”, the link between the node “e” and the node “f”, and the link between the node “f” and the node “x” is It is assumed that the values illustrated in FIG. Further, the link table and the routing table illustrated in FIG. 9 indicate values when it is assumed that the link quality has the values illustrated in FIG. In FIG. 9, “adjacent” indicates an adjacent node, “outward” indicates a forward evaluation value, “return” indicates a return evaluation value, and “re-duplication” indicates a link weight. In FIG. 9, “destination” indicates a destination node, “adjacent” indicates an adjacent node, “medium” indicates a route weight, “re-duplication” indicates a link weight, and “evaluation” indicates an evaluation value. Indicates.
  • the node “d” stores the node “x” as an adjacent node in the link table. Further, the node “d” stores “20” as the forward path evaluation value and “30” as the backward path evaluation value in the link table. At this time, the forward path evaluation value is a value obtained by evaluating the quality of the forward path for the node “x”, and the return path evaluation value is a value obtained by evaluating the quality of the backward path for the node “x”.
  • the link weight is a value obtained by adding the forward path evaluation value and the return path evaluation value. Therefore, as shown in FIG. 9, the node “d” stores “50” as the link weight in the link table.
  • the node “d” stores the node “x” as the destination node and the node “x” as the adjacent node in the routing table. That is, when the node “d” transmits a packet with the node “x” as the destination, the node “d” stores route information indicating that there is a route for transmitting the packet to the adjacent node “x”. At this time, the destination node “x” is an adjacent node to the node “d”. Therefore, the node “d” does not store the route weight in the routing table, but stores the link weight “50” acquired from the link table. Further, the node “d” stores the evaluation value “50” on the assumption that the link weight itself is the evaluation value of the route between the node “d” and the node “x”.
  • the node “e” stores the node “f” as an adjacent node in the link table. Further, the node “e” stores “10” as the forward evaluation value and “10” as the return evaluation value in the link table. Further, the node “e” stores “20” as the link weight in the link table.
  • the node “e” stores the node “f” as the destination node and the node “f” as the adjacent node in the routing table. Further, the node “e” stores the node “x” as the destination node and the node “f” as the adjacent node. That is, when the node “e” transmits a packet with the node “f” as the destination, the node “e” stores the route information indicating that there is a route for transmitting the packet to the adjacent node “f”. In addition, when the node “e” transmits a packet with the node “x” as the destination, the node “e” stores route information indicating that there is a route for transmitting the packet to the adjacent node “f”.
  • the route weight is a value indicating the quality of the route between the destination node and the adjacent node. That is, as shown in FIG. 9, this corresponds to a value indicating the quality of the path between the destination node “x” and the adjacent node “f”. For this reason, the route weight is “35”.
  • the evaluation value is a value indicating the quality of a route for transmitting / receiving a packet to / from the destination node. That is, as shown in FIG. 9, the quality of the link between the adjacent node “f” and the own node “e” is added to the value indicating the quality of the route between the destination node “x” and the adjacent node “f”. Is a value obtained by adding the values indicating. For this reason, the evaluation value is “55”.
  • the link table and the routing table are stored for the node “f” and the node “x”.
  • the node “a” is newly connected to the ad hoc network illustrated in FIG. 9 as illustrated in FIG. Further, it is assumed that the quality of the link between the node “a” and the node “d” and the quality of the link between the node “a” and the node “e” are values illustrated in FIG.
  • the node “d”, the node “e”, the node “f”, and the node “x” in the first embodiment each transmit / receive path information and link Update table and routing table. In the following, assuming the values illustrated in FIG. 9 and FIG.
  • FIGS. 11 to 15 are diagrams for explaining examples of updating the table in the first embodiment.
  • the node “a” is newly connected to the ad hoc network in the first embodiment.
  • the node “a” transmits presence information indicating that the own node exists on the network to each of the adjacent node “d” and the adjacent node “e”.
  • the node “a” broadcasts an empty HELLO packet to each of the nodes “d” and “e”.
  • the node “d” receives the HELLO packet, it first performs a link table update process. Specifically, the node “d” specifies the transmission source node of the HELLO packet. The transmission source node is the node “a”. Subsequently, the node “d” newly creates a cycle table of the transmission source node “a” and calculates the standard deviation of the cycle, thereby calculating the forward path evaluation value “20”. Then, as shown in FIG.
  • the node “d” newly creates a record of the node “a” in the link table, and stores the forward path evaluation value “20” in association with the node “a”. Furthermore, the node “d” determines whether or not the forward evaluation value is included in the HELLO packet, but determines that it is not included because it is an empty HELLO packet. Then, as shown in FIG. 11, the node “d” sets the forward path evaluation value “20” obtained by evaluating the empty HELLO packet as it is in the link table as the link weight “20”.
  • the node “d” performs a routing table update process. Specifically, the node “d” specifies the transmission source node of the HELLO packet. The transmission source node is the node “a”. Subsequently, the node “d” newly creates a record of the node “a” in the work table having the same structure as the routing table. Then, the transmission source node “a” is set as the destination node of the work table, and the transmission source node “a” is set as the adjacent node. Then, the node “d” searches the link table using the transmission source node “a”, and acquires the link weight “20” stored in association with the node “a”.
  • the node “d” stores the acquired link weight “20” as the link weight “20” in the records of the destination node “a” and the adjacent node “a” in the work table. Subsequently, the node “d” determines whether or not the same record exists in the routing table. If it is not, the record created in the work table is newly added to the routing table as shown in FIG. To do.
  • the node “d” determines whether or not information is included in the HELLO packet. Since it is an empty HELLO packet, it is determined that no information is included, and the node “d” calculates an evaluation value and stores it in the routing table. Specifically, the node “d” stores the link weight “20” itself as the evaluation value “20” because the destination node “a” is an adjacent node.
  • the clock has measured a predetermined period and a clock event has occurred. Then, the node “d” transmits a HELLO packet (note that the node “d” may transmit a HELLO packet in real time when an empty HELLO packet is received from the node “a”).
  • the node “d” creates a HELLO packet from the routing table and transmits it to each of the adjacent node “a” and the adjacent node “x”.
  • FIG. 11 for convenience of explanation, it is assumed that the node “d” transmits a HELLO packet including only path information regarding the node “a” only to the node “a”.
  • Node “d” searches the routing table and groups the records of destination node “a”. Since the destination node “a” has one record, the node “d” adds the record of the destination node “a” to the HELLO packet and transmits the HELLO packet to the adjacent node “a”. That is, as shown in FIG. 11, the node “d” acquires route information from the routing table that the destination node is “a”, the adjacent node is “a”, and the evaluation value is “20”. Then, a HELLO packet is created. Further, as shown in FIG. 11, the node “d” obtains link information that the forward path evaluation value is “20” from the link table, and creates a HELLO packet. These evaluation value and forward evaluation value are the latest values obtained by evaluating the HELLO packet received from the node “a”.
  • the node “a” when the node “a” receives the HELLO packet, first, the link table update processing is performed. Specifically, the node “a” specifies the transmission source node of the HELLO packet. The transmission source node is the node “d”. Subsequently, the node “a” newly creates a period table of the transmission source node “d” and calculates the standard deviation of the period, thereby calculating the forward path evaluation value “10”. Then, as shown in FIG. 11, the node “a” newly creates a record of the node “d” in the link table, and stores the forward evaluation value “10” in association with the node “d”.
  • the node “a” determines that the forward evaluation value “20” is included. Then, as shown in FIG. 11, the node “a” associates the forward path evaluation value “20” included in the received HELLO packet with the transmission source node “d” of the link table, and sets the return path evaluation value “20”. Store. Further, the node “a” adds the forward path evaluation value “10” and the return path evaluation value “20” to calculate the link weight “30” and sets it in the link table.
  • the node “a” performs a routing table update process. Specifically, the node “a” specifies the transmission source node of the HELLO packet. The transmission source node is the node “d”. Subsequently, the node “a” creates a new record of the node “d” in the work table having the same structure as the routing table. Then, the transmission source node “d” is set as the destination node of the work table, and the transmission source node “d” is set as the adjacent node. Then, the node “a” searches the link table using the transmission source node “d”, and acquires the link weight “30” stored in association with the node “d”.
  • the node “a” stores the acquired link weight “30” as the link weight “30” in the records of the destination node “d” and the adjacent node “d” in the work table. Subsequently, the node “a” determines whether or not the same record exists in the routing table. If it is not, the record created in the work table is newly added to the routing table as shown in FIG. To do.
  • the node “a” next determines whether or not information is included in the HELLO packet, and determines that the information is included.
  • the node “a” determines whether the destination node or the adjacent node is addressed to its own node “a”, and determines that it is addressed to its own node “a”. Subsequently, the node “a” determines whether there is unprocessed information in the received packet, and determines that there is no information. Thereafter, the node “a” calculates an evaluation value and stores it in the routing table. Specifically, the node “a” stores the link weight “30” itself as the evaluation value “30” because the destination node “d” is an adjacent node.
  • the clock has measured a predetermined period and a clock event has occurred. Then, the node “a” transmits a HELLO packet.
  • the node “a” creates a HELLO packet from the routing table and transmits it to the adjacent node “d”.
  • the node “a” searches the routing table and groups the records of the destination node “d”. Since the destination node “d” has one record, the node “a” adds the record of the destination node “d” to the HELLO packet and transmits the HELLO packet to the adjacent node “d”. That is, as shown in FIG.
  • the node “a” acquires route information from the routing table that the destination node is “d”, the adjacent node is “d”, and the evaluation value is “30”. Then, a HELLO packet is created. Further, as shown in FIG. 11, the node “a” obtains link information that the forward path evaluation value is “10” from the link table, and creates a HELLO packet. These evaluation value and forward evaluation value are the latest values obtained by evaluating the HELLO packet received from the node “d”.
  • FIG. 12 shows transmission / reception of the HELLO packet and update of the link table and the routing table performed between the node “a” and the node “e”.
  • the node “a” transmits a HELLO packet to each of the node “d” and the node “e”. These HELLO packets indicate the same HELLO packet as the HELLO packet (third) shown in FIGS.
  • the node “d” When the node “d” receives the HELLO packet, it first performs a link table update process. Specifically, the node “d” specifies the transmission source node of the HELLO packet. The transmission source node is the node “a”. Subsequently, the node “d” creates a new record at the top of the cycle table of the transmission source node “a” and calculates the standard deviation of the cycle, thereby calculating the forward path evaluation value “20”. Here, there is no change in the value, but it is the latest value. Then, as shown in FIG. 13, the node “d” identifies the existing record of the node “a” from the link table, and overwrites the forward evaluation value “20” in association with the node “a”.
  • the node “d” determines that the forward evaluation value “10” is included. Then, as shown in FIG. 13, the node “d” associates the forward path evaluation value “10” included in the received HELLO packet with the transmission source node “a” of the link table, and sets the return path evaluation value “10”. Store. Further, the node “d” adds the forward path evaluation value “20” and the return path evaluation value “10” to calculate the link weight “30” and sets it in the link table.
  • the node “d” performs a routing table update process. Specifically, the node “d” specifies the transmission source node of the HELLO packet. The transmission source node is the node “a”. Subsequently, the node “d” newly creates a record of the node “a” in the work table having the same structure as the routing table. Then, the transmission source node “a” is set as the destination node of the work table, and the transmission source node “a” is set as the adjacent node. Then, the node “d” searches the link table using the transmission source node “a”, and acquires the link weight “30” stored in association with the node “a”.
  • the node “d” stores the acquired link weight “30” as the link weight “30” in the records of the destination node “a” and the adjacent node “a” in the work table. Subsequently, the node “d” determines whether or not there is the same record in the routing table, and if so, overwrites the routing table with the record created in the work table as shown in FIG. .
  • the node “d” determines whether or not information is included in the HELLO packet, and determines that the information is included.
  • the node “d” determines whether the destination node or the adjacent node is addressed to its own node “d”, and determines that it is addressed to its own node “d”. Subsequently, the node “d” determines whether there is unprocessed information in the received packet, and determines that there is no information. Thereafter, the node “d” calculates an evaluation value and stores it in the routing table. Specifically, the node “d” stores the link weight “30” itself as the evaluation value “30” because the destination node “a” is an adjacent node.
  • the clock has measured a predetermined period and a clock event has occurred. Then, the node “d” transmits a HELLO packet.
  • the node “d” creates a HELLO packet from the routing table and transmits it to each of the adjacent node “a” and the adjacent node “x”. However, in FIG. 13, for convenience of explanation, it is assumed that the node “d” transmits a HELLO packet only to the node “x”.
  • Node “d” searches the routing table and groups the records of destination node “x” and destination node “a”. Since there is one record for each of the destination node “x” and the destination node “a”, the node “d” adds each of the records for the destination node “x” and the destination node “a” to the HELLO packet.
  • the packet is transmitted to the adjacent node “x”. That is, as shown in FIG. 13, the node “d” acquires route information from the routing table that the destination node is “x”, the adjacent node is “x”, and the evaluation value is “50”. Then, a HELLO packet is created. Further, as illustrated in FIG.
  • the node “d” acquires link information that the forward path evaluation value is “20” from the link table, and creates a HELLO packet.
  • the node “d” creates a HELLO packet by acquiring route information from the routing table that the destination node is “a”, the adjacent node is “a”, and the evaluation value is “30”. To do. Further, as illustrated in FIG. 13, the node “d” acquires link information that the forward path evaluation value is “20” from the link table, and creates a HELLO packet.
  • the node “a” transmits a HELLO packet to the node “e” in addition to the node “d”.
  • the lower part of FIG. 13 shows transmission / reception of the HELLO packet and update of the link table and routing table performed between the node “a” and the node “e”.
  • the node “e” transmits a HELLO packet to the node “f”.
  • the node “f” receives the HELLO packet, it first performs a link table update process. Specifically, the node “f” specifies the transmission source node of the HELLO packet. The transmission source node is the node “e”. Subsequently, the node “f” newly creates a record at the top of the cycle table of the transmission source node “e”, and calculates the forward path evaluation value “10” by calculating the standard deviation of the cycle. Here, there is no change in the value, but it is the latest value. Then, as shown in FIG.
  • the node “f” identifies the existing record of the node “e” from the link table, and overwrites the forward evaluation value “10” in association with the node “e”. Further, when determining whether or not the forward evaluation value is included in the HELLO packet, the node “f” determines that the forward evaluation value “10” is included because it is included. Then, as shown in FIG. 14, the node “f” associates the forward path evaluation value “10” included in the received HELLO packet with the transmission source node “e” of the link table, and sets it as the backward path evaluation value “10”. Store. Further, the node “f” adds the forward path evaluation value “10” and the return path evaluation value “10” to calculate the link weight “20” and sets it in the link table.
  • the node “f” performs a routing table update process. Specifically, the node “f” specifies the transmission source node of the HELLO packet. The transmission source node is the node “e”. Subsequently, the node “f” creates a new record of the node “e” in the work table having the same structure as the routing table. Then, the transmission source node “e” is set as the destination node of the work table, and the transmission source node “e” is set as the adjacent node. Then, the node “f” searches the link table using the transmission source node “e”, and acquires the link weight “20” stored in association with the node “e”.
  • the node “f” stores the acquired link weight “20” as the link weight “20” in the records of the destination node “e” and the adjacent node “e” in the work table. Subsequently, the node “f” determines whether or not there is the same record in the routing table, and if there is, it overwrites the routing table with the record created in the work table as shown in FIG. .
  • the node “f” next determines whether or not information is included in the HELLO packet, and determines that the information is included.
  • the node “f” determines whether the destination node or the adjacent node is addressed to its own node “f”, and determines that it is addressed to its own node “f”. Subsequently, the node “f” determines whether there is unprocessed information in the received packet, and determines that there is.
  • the node “f” determines whether the destination node or the adjacent node is addressed to the own node “f”, and determines that the adjacent node is the own node “f”. Subsequently, the node “f” determines whether there is unprocessed information in the received packet, and determines that there is.
  • the node “f” determines whether the destination node or the adjacent node is addressed to its own node “f”, and determines that it is not addressed to its own node “f”. Subsequently, the node “f” creates a new record of the node “a” in the work table having the same structure as the routing table. Then, the destination node “a” is set as the destination node of the work table, and the transmission source node “e” is set as the adjacent node. Then, the node “f” stores the evaluation value “40” included in the HELLO packet as the work table route weight “40”.
  • the node “f” determines whether there is a record of the destination node “a” and the adjacent node “e” in the routing table, and determines that there is no record. Then, as shown in FIG. 14, the node “f” newly adds the record created in the work table to the routing table.
  • the node “f” calculates an evaluation value and stores it in the routing table. Specifically, the node “f” stores the link weight “20” itself as the evaluation value “20” because the destination node “e” is an adjacent node. Further, since the node “f” is the adjacent node “x”, the link weight “35” itself is stored as the evaluation value “35”. Further, the node “f” searches for a record having the adjacent node “e” as the destination node and the adjacent node. Then, the node “f” acquires the link weight “20” of the retrieved record, the route weight “40” of the records of the destination node “a” and the adjacent node “e”, and the acquired link weight “20”. And is stored as an evaluation value “60”.
  • the clock has measured a predetermined period and a clock event has occurred. Then, the node “f” transmits a HELLO packet.
  • the node “f” creates a HELLO packet from the routing table and transmits it to each of the adjacent node “e” and the adjacent node “x”. However, in FIG. 14, for convenience of explanation, it is assumed that the node “f” transmits a HELLO packet only to the node “x”.
  • the node “f” searches the routing table and groups the records of the destination node “e”, the destination node “x”, and the destination node “a”. Since each of the destination node “e”, the destination node “x”, and the destination node “a” has one record, the node “f” is the destination node “e”, the destination node “x”, and the destination node “a”. Are added to the HELLO packet, and the HELLO packet is transmitted to the adjacent node “x”.
  • the node “d” transmits a HELLO packet to the node “x”
  • the node “f” transmits a HELLO packet to the node “x”. That is, in the first embodiment, it is assumed that the node “x” receives the HELLO packet from each of the node “d” and the node “f” during a predetermined period.
  • the node “x” first receives the HELLO packet from the node “d”. At this time, the node “x” updates the link table and the routing table in the same manner as the other nodes described so far. Subsequently, it is assumed that the node “x” receives the HELLO packet from the node “f”. At this time, the node “x” similarly updates the link table and the routing table.
  • the clock has measured a predetermined period and a clock event has occurred. Then, the node “x” transmits a HELLO packet.
  • the node “x” creates a HELLO packet from the routing table and transmits it to the adjacent node “d”, the adjacent node “f”, the adjacent node “v”, and the adjacent node “z”. However, in FIG. 15, for convenience of explanation, it is assumed that the node “x” transmits the HELLO packet only to the node “v” and the node “z”.
  • the node “x” searches the routing table and groups the records of the destination node “d”, the destination node “f”, the destination node “e”, and the destination node “a”. Since each of the destination node “d”, the destination node “f”, and the destination node “e” has one record, the node “x” is the destination node “d”, the destination node “f”, and the destination node “f”. Add each record of e ”to the HELLO packet.
  • the node “x” groups the records of the destination node “a”, compares the evaluation values within the group, and sets the first to third flags. Specifically, since the node “x” has two records that are grouped into the destination node “a”, and the evaluation value is “80” and the evaluation value “95”, the evaluation value is “80”. A first flag is set for a certain record, and a second flag is set for a record whose evaluation value is “95”. Then, the node “x” extracts the record in which the first flag is set and adds it to the HELLO packet. Specifically, only the records that are the destination node “a” and the adjacent node “d” are extracted and added to the HELLO packet. Thereafter, the node “x” transmits a HELLO packet.
  • FIG. 16 is a flowchart illustrating the link table update process according to the first embodiment.
  • the link table updating unit 32 of the node 10 in the first embodiment determines whether or not a HELLO packet has been received from an adjacent node (step S101). If it is determined that it has not been received (No at Step S101), the link table update unit 32 waits for reception of a HELLO packet.
  • the link table update unit 32 specifies “From Who” of the HELLO packet (Step S102). That is, the link table update unit 32 identifies the transmission source node that has transmitted the HELLO packet.
  • the link table update unit 32 determines whether or not the cycle table of the transmission source node specified in step S102 already exists in the cycle table unit 23 (step S103).
  • the link table updating unit 32 creates a new periodic table of the transmission source node and creates a new record with ID “1” (Step S104). Subsequently, the link table updating unit 32 sets the reception time at which the HELLO packet is received in the record of ID “1” (step S105). For example, the link table update unit 32 sets the reception time “0:00”. Further, the link table update unit 32 sets an initial value of the period in the record with ID “1” (step S106). For example, the link table update unit 32 sets the cycle “0:00”.
  • the link table update part 32 creates a new record at the top of a periodic table (step S107). Subsequently, the link table update unit 32 sets the reception time at which the HELLO packet is received in the newly created record (step S108). Then, the link table updating unit 32 calculates the difference between the reception time set in step S108 and the reception time set in the adjacent lower record, and sets the difference (step S109). Subsequently, the link table updating unit 32 calculates a standard deviation of the cycle (step S110).
  • the link table update unit 32 newly creates a record of the transmission source node in the link table (step S111). Alternatively, the link table update unit 32 identifies an existing record of the transmission source node from the link table (step S111).
  • the link table update unit 32 stores the forward path evaluation value obtained by evaluating the received HELLO packet (that is, the forward path evaluation value derived from the standard deviation calculated in step S110) in association with the transmission source node of the link table. (Step S112). Alternatively, the link table update unit 32 overwrites the existing record (step S112).
  • the link table update unit 32 determines whether or not the forward path evaluation value is included in the received HELLO packet (step S113). When it is determined that the received packet is not included (No at Step S113), the link table update unit 32 sets the forward path evaluation value obtained by evaluating the received packet in the link table as the link weight between the nodes (Step S114). Alternatively, the link table update unit 32 overwrites the existing record (step S114).
  • the link table update unit 32 associates the forward path evaluation value included in the received HELLO packet with the transmission source node of the link table, and performs the backward path evaluation. Stored as a value (step S115). Alternatively, the link table update unit 32 overwrites the existing record (step S115).
  • the link table update unit 32 calculates the link weight between the nodes by adding the forward path evaluation value and the return path evaluation value, and sets the link weight in the link table (step S116). Alternatively, the link table update unit 32 overwrites the existing record (step S116).
  • FIGS. 17A and 17B are flowcharts illustrating the routing table update process according to the first embodiment.
  • the routing table updating unit 33 of the node 10 in the first embodiment determines whether or not a HELLO packet has been received from an adjacent node (step S201). If it is determined that it has not been received (No at Step S201), the routing table update unit 33 waits for reception of a HELLO packet.
  • the routing table update unit 33 specifies “From Who” of the HELLO packet (Step S202). That is, the routing table update unit 33 identifies the transmission source node that has transmitted the HELLO packet.
  • the routing table update unit 33 creates a new record in the work table unit 24 (step S203). Then, the routing table updating unit 33 sets the transmission source node specified in step S202 to the destination node of the newly created record (step S204), and sets the transmission source node specified in step S202 to the adjacent node ( Step S205).
  • the routing table update unit 33 searches the link table unit 22 using the transmission source node, and acquires the link weight stored in association with the transmission source node (step S206).
  • the routing table update unit 33 stores the acquired link weight in the work table unit 24 as a link weight in the record of the transmission source node of the destination node and the adjacent node (step S207).
  • the routing table update unit 33 determines whether or not there is a record of the same destination node and adjacent node in the routing table unit 21 (step S208). If it is determined that there is not (No at Step S208), the routing table update unit 33 newly adds the record created in the work table unit 24 to the routing table unit 21 (Step S209). On the other hand, if it is determined that there is (Yes at Step S208), the routing table update unit 33 overwrites the routing table unit 21 (Step S210).
  • the routing table update unit 33 determines whether or not HELLO packet information is included (step S211). When it is determined that it is not included (No at Step S211), the routing table update unit 33 proceeds to a process of calculating an evaluation value (Step S222).
  • the routing table update unit 33 subsequently determines whether or not the destination node or the adjacent node is its own node (Step S212).
  • the routing table update unit 33 ignores this information and determines whether there is unprocessed information in the received HELLO packet. The process proceeds to the determination process (step S220).
  • the routing table update unit 33 creates a new record in the work table unit 24 (Step S213). Then, the routing table update unit 33 sets the destination node included in the information of the HELLO packet as the destination node of the newly created record (step S214), and sets the source node as the adjacent node (step S215).
  • the routing table update unit 33 stores the evaluation value included in the information of the HELLO packet as a route weight in the newly created record in the work table unit 24 (step S216).
  • the routing table update unit 33 determines whether or not there is a record of the same destination node and adjacent node in the routing table unit 21 (step S217). If it is determined that there is not (No at Step S217), the routing table update unit 33 newly adds the record created in the work table unit 24 to the routing table unit 21 (Step S218). On the other hand, when it is determined that there is (Yes at Step S217), the routing table update unit 33 overwrites the routing table unit 21 (Step S219).
  • the routing table updating unit 33 determines whether or not there is unprocessed information in the received HELLO packet (step S220). If there is (step S220 affirmative), the unprocessed information is acquired. (Step S221), the process returns to Step S212. On the other hand, if not (No at Step S220), the routing table update unit 33 calculates an evaluation value and stores it in the routing table unit 21 (Step S222).
  • FIG. 18 is a flowchart showing the evaluation value calculation process.
  • the routing table update unit 33 first determines whether or not the link weight is stored in the corresponding record of the routing table unit 21 (step S222-1). If it is determined that it is stored (Yes at Step S222-1), the routing table update unit 33 stores the stored link weight as the evaluation value of the corresponding record (Step S222-2).
  • the routing table update unit 33 searches for a record having the adjacent node of the corresponding record as the destination node and the adjacent node (step S222-1). S222-3).
  • the routing table update unit 33 acquires the link weight of the retrieved record (step S222-4), adds the route weight of the corresponding record and the link weight of the retrieved record, and stores it as the evaluation value of the corresponding record. (Step S222-5).
  • the routing table update unit 33 determines whether or not there is an unprocessed record (step S222-6), and if there is (Yes in step S222-6), acquires the unprocessed record (step S222-6). S222-7), the process returns to step S222-1. On the other hand, if not (No at Step S222-6), the routing table update unit 33 ends the process.
  • FIG. 19 is a flowchart illustrating a transmission process according to the first embodiment.
  • the path information transmitting unit 34 of the node 10 in the first embodiment determines whether or not there is a clock event (step S301). If it is determined that there is no clock event (No at step S301), the path information transmission unit 34 waits for a clock event.
  • the path information transmitting unit 34 determines whether there is a routing table (Step S302). When it is determined that there is no routing table (No at Step S302), the route information transmitting unit 34 transmits an empty HELLO packet (Step S307) and ends the process.
  • the route information transmission unit 34 searches the routing table unit 21 and performs grouping for each identical destination node (Step S303).
  • the route information transmitting unit 34 compares the evaluation values within the group, and ranks the top 1 to 3rd records in ascending order of evaluation value (in descending order of quality) (step S304).
  • the route information transmission unit 34 sets the first to third rank flags in the ranked records (step S305), extracts the record in which the first rank flag is set, and adds it to the HELLO packet header. (Step S306). Note that the path information transmission unit 34 in the first embodiment sets “transmission flag” to “Yes” for the record added to the HELLO packet header.
  • the route information transmitting unit 34 transmits a HELLO packet (step S307) and ends the process.
  • the first embodiment relays route information in an ad hoc network in which each node relays a packet based on route information (information indicating a route for transmitting a packet to a destination node).
  • route information information indicating a route for transmitting a packet to a destination node.
  • each node receives route information from a node (adjacent node) interconnected with its own terminal.
  • Each node acquires quality information (evaluation value) indicating the quality of the route indicated by the route information for the received route information.
  • each node determines whether or not a plurality of pieces of route information having the same node as the packet destination are received for each received route information (for each clock event).
  • each node compares the quality information (evaluation value) for each of the plurality of received route information. Route information corresponding to quality information (evaluation value) indicating high quality is selected. Each node relays the selected route information to nodes other than the node that transmitted the route information among nodes (adjacent nodes) interconnected with the terminal itself.
  • each node in the first embodiment can reduce the amount of communication for route control.
  • each node in the conventional technology receives the route information, and transmits the received route information to the adjacent node each time.
  • each node must transmit route information many times, and a control header portion is added for each HELLO packet, which requires a transmission waiting time for each HELLO packet. I was sorry.
  • the number of route information to be transmitted increases, the frequency of occurrence of collision also increases, and as a result, the number of times of retransmitting route information also increases. For this reason, if the conventional technique is applied to a large-scale ad hoc network, flooding due to packet excess occurs, and it is difficult to create a routing table for route search.
  • each node in the first embodiment receives the route information, it does not transmit the received route information to the adjacent node each time.
  • Each node determines, for each predetermined period, whether or not a plurality of route information having the same node as the packet destination is received, and compares the quality information with each other to correspond to the highest quality quality information. Select.
  • Each node relays only the selected route information to the adjacent node.
  • each node can reduce the number of times route information is transmitted, and at the same time, overhead is also reduced.
  • the frequency of occurrence of collision is also reduced, and consequently the number of times the route information is retransmitted is also reduced. For this reason, even if the technique of the first embodiment is applied to a large-scale ad hoc network, flooding due to packet excess does not occur, and it is not difficult to create a routing table for route search.
  • the method of the first embodiment has a traffic amount for route control as compared with OLSR (Optimized Link State Routing protocol) and AODV (Ad hoc On demand Distance Vector) methods. You can see that it is reduced. That is, when the number of nodes exceeds 100, the number of OLSR control packets exceeds the number of control packets in the system of the first embodiment. In addition, it can be seen that AODV increases the control packet at an accelerated rate.
  • OLSR Optimized Link State Routing protocol
  • AODV Ad hoc On demand Distance Vector
  • the node 10 is route information corresponding to the highest evaluation value (a record in which the first flag is set), all the information is transmitted to adjacent nodes.
  • the node 10 instead of transmitting all route information corresponding to the highest evaluation value, the node 10 compares the current evaluation value with the previous evaluation value, and the difference between the two values is determined. A method of transmitting on condition that the predetermined threshold value or more has been reached will be described.
  • FIG. 21 is a diagram for explaining a routing table in the second embodiment.
  • the routing table unit 21 in the second embodiment further stores an evaluation value (“previous transmission value”) when the route information transmission unit 34 transmits the previous route information.
  • the routing table unit 21 stores the evaluation value stored in the “evaluation value” by being stored by the route information transmission unit 34 when the route information transmission unit 34 transmits the route information. Store in “Last Send Value”.
  • the “previous transmission value” stored in the routing table unit 21 is used for processing by the route information transmission unit 34.
  • FIG. 22 is a flowchart illustrating a transmission process according to the second embodiment.
  • the path information transmission unit 34 in the second embodiment determines whether there is a clock event (step S ⁇ b> 401) as in the first embodiment, and determines whether there is a routing table (step S ⁇ b> 401). Step S402). If it is determined that there is a routing table (Yes at step S402), the route information transmission unit 34 searches the routing table unit 21 and performs grouping for each identical destination node, as in the first embodiment. (Step S403). Further, as in the first embodiment, the route information transmission unit 34 compares the evaluation values within the group, and ranks the top 1 to 3 rank records in ascending order of evaluation value (in descending order of quality) (step S1). S404). Subsequently, as in the first embodiment, the route information transmitting unit 34 sets the first to third rank flags in the ranked records (step S405).
  • the route information transmission unit 34 in the second embodiment compares the “evaluation value” and the “previous transmission value” in the routing table unit 21, and sets a transmission flag for a record with a large update width (step S406).
  • the route information transmitting unit 34 sets the transmission flag “YES” in a record whose update width is “10” or more.
  • the route information transmitting unit 34 extracts a record in which a transmission flag is set, and adds it to the HELLO packet header (step S407). Further, the route information transmitting unit 34 stores “evaluation value” in “previous transmission value” for the record in which the transmission flag is set (step S408).
  • the path information transmitting unit 34 transmits a HELLO packet as in the first embodiment (step S409), and the process is terminated.
  • each node stores a correspondence relationship between the received route information and the quality information (previous transmission value) when the route information was relayed last time in the routing table unit. Yes.
  • Each node searches the routing table part using the route information selected this time, and the quality information (previous transmission value) corresponding to the route information in the routing table part and the route information when the route information is selected. Compare this quality information (evaluation value).
  • Each node relays the selected route information on condition that the difference in quality indicated by each quality information is equal to or greater than a predetermined threshold (for example, “10” or greater).
  • each node is route information that has already been transmitted to an adjacent node, and the route information whose quality evaluation has not changed much from the previous time. Since it is removed from the relay target this time, it becomes possible to further reduce the traffic for route control.
  • the method of selecting a route when the node 10 transmits a packet does not reflect information on the data packet (packet that transmits and receives actual data). Therefore, in the third embodiment, a method will be described in which the node 10 corrects the route evaluation value based on the information on the data packet to reflect the information on the data packet in the selection of the route.
  • FIG. 23 is a block diagram illustrating a configuration of a node according to the third embodiment.
  • FIG. 24 is a diagram for explaining a data management table according to the third embodiment.
  • FIG. 25 is a diagram for explaining a routing table in the third embodiment.
  • the node 10 further includes a data management table unit 25 in the storage unit 20, as shown in FIG.
  • the data management table unit 25 stores information regarding the data packet transmitted by the packet transmitting / receiving unit 35. Specifically, when the data packet is transmitted by the packet transmitting / receiving unit 35, the data management table unit 25 transmits a packet transmission / reception time that is considered to be a successful reception time of a response packet (hereinafter referred to as data ACK). Stored by the unit 35. Information stored in the data management table unit 25 is used for processing by the packet transmitting / receiving unit 35.
  • the data management table unit 25 includes an ID (“ID”) for identifying a data packet, a destination node (“destination”), an adjacent node (“adjacent”), and a data ACK.
  • ID for identifying a data packet
  • destination node destination node
  • adjacent node adjacent node
  • data ACK data ACK
  • the time (“waiting time”) that is considered to be successful is stored as the reception time.
  • the node “x” transmits the data packet with the node “a” as the destination node
  • the route for transmitting the data packet to the adjacent node “d” and the data packet to the adjacent node “f” are transmitted. There is a route to do.
  • the data management table unit 25 according to the third embodiment stores information for any route, but FIG. 24 illustrates only the route for transmitting the data packet to the adjacent node “d”.
  • the node 10 transmits a data packet
  • the node 10 receives a data ACK for the transmitted data packet.
  • the node 10 can evaluate the quality of the path
  • the node 10 sets “waiting time” in the data management table unit 25.
  • the node 10 stores “success coefficient” in the routing table unit 21 as shown in FIG. Specifically, in the routing table unit 21, when a data ACK is received by the packet transmission / reception unit 35, the “success coefficient” is stored or the “evaluation value” is updated by the packet transmission / reception unit 35.
  • the “success coefficient” is a coefficient indicating whether or not the data ACK has been received by the time set in the “waiting time” of the data management table unit 25.
  • “success coefficient” indicates a value of “0” to “10”, for example.
  • the packet transmission / reception unit 35 updates the value of the “success coefficient” in the routing table unit 21 to be smaller (for example, “1”) if the data ACK is received before the time set as the “waiting time”. Subtract), and update the updated “success coefficient” to reflect the “evaluation value”. On the other hand, if the packet transmitting / receiving unit 35 does not receive the data ACK by the time set as the “waiting time”, the packet transmission / reception unit 35 greatly updates the value of the “success coefficient” in the routing table unit 21 (for example, adds “1”). ) Update the updated “success factor” to reflect the “evaluation value”.
  • FIG. 26 is a diagram for explaining the processing procedure (entire) of the node in the third embodiment.
  • FIG. 27 is a flowchart illustrating data management table update processing according to the third embodiment.
  • the node 10 in the third embodiment refers to the routing table unit 21 and selects a route when transmitting a data packet in the packet transmitting / receiving unit 35.
  • the packet transmitting / receiving unit 35 adds a record for managing the transmission history of the data packet to be transmitted to the data management table unit 25 and transmits the data packet.
  • the packet transmitting / receiving unit 35 sets the “waiting time” of the data ACK in the data management table unit 25.
  • the packet transmitting / receiving unit 35 receives a clock event at a specific interval from a clock that operates asynchronously with the transmission of the data packet, and the current time calculated from the timing and the “waiting time” set in the data management table unit 25. ”Is compared.
  • the packet transmitting / receiving unit 35 retransmits the data packet when the data ACK is not received by the “waiting time”. That is, as shown in FIG. 26, the packet transmitting / receiving unit 35 updates the routing table unit 21, selects a new route based on the updated routing table unit 21, and retransmits the data packet.
  • the packet transmitting / receiving unit 35 updates the data management table unit 25 (deletes the record) and updates the routing table unit 21.
  • the packet transmitting / receiving unit 35 determines whether a request for transmitting actual data (data packet) is received from the own node 10 or whether a data packet relayed from the adjacent node 10 is received (step). S501). When the transmission request is not accepted or the data packet to be relayed is not received (No at Step S501), the packet transmitting / receiving unit 35 waits for a transmission request or the like.
  • the packet transmitting / receiving unit 35 refers to the routing table unit 21 and sets the destination node 10 of the data packet as the destination. Are extracted with the first to third flags set (step S502).
  • a method of limiting not to all the records but limiting to the top three records is illustrated.
  • the packet transmitting / receiving unit 35 adds a transmission history record to the data management table unit 25 for the extracted three records (step S503). Then, the packet transmitting / receiving unit 35 sets “ID” for data management, sets the destination of the data packet to “destination” (step S504), and sets the “waiting time” of data ACK (step S505). Then, the packet transmitting / receiving unit 35 transmits a data packet (step S506).
  • the packet transmitting / receiving unit 35 determines whether or not the data ACK from the destination node has been received by the “waiting time” set in the data management table unit 25 (step S507). If not received (No at Step S507), the packet transmitting / receiving unit 35 updates the “success coefficient” of the routing table unit 25 (Step S511), updates the “evaluation value” of the routing table unit 25, and , “Rank” is updated (step S512). For example, the packet transmitting / receiving unit 35 updates the “success coefficient” of the routing table unit 25 from “7” to “8”, and updates the “evaluation value” from “57” to “58”.
  • the packet transmitting / receiving unit 35 returns to the process of step S502. That is, the packet transmitting / receiving unit 35 refers to the updated routing table unit 21 again, and extracts three records in which the first to third rank flags are set (step S502). If there is a change in the record in which the 1st to 3rd flags are set as compared with the routing table part 21 before the update, the packet transmitting / receiving unit 35 adds the quality information of the route acquired when the data packet is actually transmitted. Based on this, the route can be selected again.
  • the packet transmitting / receiving unit 35 deletes the target record from the data management table unit 25 (Step S508). Then, the packet transmitting / receiving unit 35 updates the “success coefficient” of the routing table unit 25 (step S509), updates the “evaluation value” of the routing table unit 25, and further updates the “rank” (step S510). .
  • each node stores the correspondence between the received route information and the acquired quality information (evaluation value) in the routing table unit.
  • Each node calculates the quality information of the selected route based on the reception status of the response packet when the packet is transmitted to the adjacent node or when the packet received from the adjacent node is relayed. .
  • Each node replaces the calculated quality information with the quality information stored in the routing table unit. Then, each node selects the route information by comparing each piece of quality information (quality information after replacement) stored in the routing table unit with respect to each of the plurality of pieces of route information received.
  • each node re-evaluates the quality of the route or selects a route again based on the route quality information acquired when the data packet is actually transmitted. It becomes possible to fix.
  • Embodiments 1 to 3 described above assume that the route information relay method according to the present invention is applied to the case where route control is performed in a routing table method.
  • the present invention is not limited to this.
  • the route information relay method according to the present invention can be similarly applied to the case where the route control is performed in an on-demand method or the hybrid method (a mixed method of a routing table method and an on-demand method). it can.
  • the present invention can be applied to any system in which path control is performed as long as each node relays path information.
  • each node selects each piece of route information for each of the plurality of nodes, and relays the selected pieces of route information together. May be. For example, when the node “x” makes a determination every predetermined period, in addition to a plurality of route information destined for the node “a”, a plurality of route information destined for the node “b”, a node “c” Is received (see FIG. 2).
  • the node “x” has the highest quality route information selected for the node “a”, the highest quality route information selected for the node “b”, and the highest quality route information selected for the node “c”. May be relayed together.
  • the method of relaying route information related to a plurality of nodes together can further reduce the amount of communication for route control, compared to the method of relaying route information related to nodes individually.
  • the route control method described in this embodiment can be realized by executing a program prepared in advance on a computer such as a personal computer or a workstation.
  • This program can be distributed via a network such as the Internet.
  • the program can also be executed by being recorded on a computer-readable recording medium such as a hard disk, a flexible disk (FD), a CD-ROM, an MO, and a DVD and being read from the recording medium by the computer.
  • a computer-readable recording medium such as a hard disk, a flexible disk (FD), a CD-ROM, an MO, and a DVD and being read from the recording medium by the computer.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
PCT/JP2009/058024 2008-04-22 2009-04-22 経路情報中継方法および無線端末 Ceased WO2009131160A1 (ja)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP09735806.3A EP2273822B1 (en) 2008-04-22 2009-04-22 Route information relay method and wireless terminal
CN200980114244.XA CN102017716B (zh) 2008-04-22 2009-04-22 路径信息中继方法以及无线终端
US12/926,031 US9210647B2 (en) 2008-04-22 2010-10-21 Route information relay method and wireless terminal

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2008111777A JP4941397B2 (ja) 2008-04-22 2008-04-22 経路情報中継方法および無線端末
JP2008-111777 2008-04-22

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US12/926,031 Continuation US9210647B2 (en) 2008-04-22 2010-10-21 Route information relay method and wireless terminal

Publications (1)

Publication Number Publication Date
WO2009131160A1 true WO2009131160A1 (ja) 2009-10-29

Family

ID=41216889

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2009/058024 Ceased WO2009131160A1 (ja) 2008-04-22 2009-04-22 経路情報中継方法および無線端末

Country Status (6)

Country Link
US (1) US9210647B2 (https=)
EP (1) EP2273822B1 (https=)
JP (1) JP4941397B2 (https=)
KR (1) KR101174579B1 (https=)
CN (1) CN102017716B (https=)
WO (1) WO2009131160A1 (https=)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2011114424A (ja) * 2009-11-25 2011-06-09 Mega Chips Corp 通信システムおよび通信装置

Families Citing this family (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012073312A1 (ja) 2010-11-29 2012-06-07 富士通株式会社 無線通信装置および無線ネットワークにおける経路決定方法
WO2012131960A1 (ja) * 2011-03-30 2012-10-04 富士通株式会社 通信装置、経路探索方法および経路探索プログラム
JP5664768B2 (ja) * 2011-03-31 2015-02-04 富士通株式会社 ノード、リンク形成方法およびリンク形成プログラム
US9736045B2 (en) 2011-09-16 2017-08-15 Qualcomm Incorporated Systems and methods for network quality estimation, connectivity detection, and load management
US20130083674A1 (en) * 2011-09-29 2013-04-04 Robert Bosch Gmbh Methods for robust wireless communication for nodes located in vehicles
WO2013059990A1 (zh) * 2011-10-25 2013-05-02 中兴通讯股份有限公司 一种中继路径选择方法及系统
JP5939262B2 (ja) 2011-12-12 2016-06-22 富士通株式会社 送信制御方法、ノードおよび送信制御プログラム
JP5594789B2 (ja) * 2012-03-02 2014-09-24 Ｎｅｃアクセステクニカ株式会社 無線通信装置、無線通信システム、無線通信方法および無線通信プログラム
GB2500648B (en) 2012-03-28 2014-06-25 Toshiba Res Europ Ltd Wireless communication methods and apparatus
JP6036841B2 (ja) 2012-10-31 2016-11-30 富士通株式会社 通信制御方法、ネットワークシステム、および通信装置
JP5994589B2 (ja) * 2012-11-14 2016-09-21 富士通株式会社 光伝送システムおよびノード装置
JP6016646B2 (ja) * 2013-01-15 2016-10-26 三菱電機株式会社 ノード
US9668196B2 (en) * 2013-01-29 2017-05-30 Cooper Technologies Company Network administrator interface systems and methods for monitoring industrial wireless, self-organizing mesh communication networks
WO2014147826A1 (ja) 2013-03-22 2014-09-25 富士通株式会社 無線端末、代替経路数生成方法
EP2797267B1 (en) * 2013-04-26 2016-07-27 Airbus Defence and Space Limited Routing data within a communications network
JP6237770B2 (ja) 2013-05-31 2017-11-29 富士通株式会社 無線端末、重要度生成方法及び無線通信システム
JP5913209B2 (ja) * 2013-06-18 2016-04-27 大井電気株式会社 経路制御装置、センサノードネットワークシステム及びプログラム
JP6265689B2 (ja) * 2013-11-06 2018-01-24 関西電力株式会社 通信装置、無線ネットワークシステム、無線ネットワーク制御方法、及び、無線ネットワーク制御プログラム
JP6171868B2 (ja) * 2013-11-11 2017-08-02 富士通株式会社 ノード装置、経路入れ替え方法、及び、プログラム
US10015720B2 (en) 2014-03-14 2018-07-03 GoTenna, Inc. System and method for digital communication between computing devices
US10810806B2 (en) 2017-03-13 2020-10-20 Renovo Motors, Inc. Systems and methods for processing vehicle sensor data
US11082324B2 (en) 2018-07-27 2021-08-03 goTenna Inc. Vine: zero-control routing using data packet inspection for wireless mesh networks
CN110581804B (zh) * 2019-08-09 2021-05-11 睿魔智能科技（深圳）有限公司 异构链路数据转译和分发方法、系统、设备和存储介质
JP7629887B2 (ja) 2022-03-31 2025-02-14 株式会社チノー 無線メッシュネットワークシステム
KR20250110568A (ko) 2024-01-12 2025-07-21 동의대학교 산학협력단 인접 노드 패킷 중계를 통한 전력의 거래 및 전달 시스템 및 방법

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2003152786A (ja) 2001-11-15 2003-05-23 Nec Corp 無線端末
JP2006279660A (ja) * 2005-03-30 2006-10-12 Sanyo Electric Co Ltd 通信方法ならびにそれを利用した無線装置および通信システム
JP2007129542A (ja) 2005-11-04 2007-05-24 Sony Corp 無線通信システム、無線通信装置及び無線通信方法、並びにコンピュータ・プログラム
JP2007288259A (ja) * 2006-04-12 2007-11-01 Sharp Corp アドホック機能付き携帯端末

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE60134534D1 (de) * 2000-02-23 2008-08-07 Microsoft Corp Dienstqualität über wege mit einer drahtlosen verbindung
JP2003078530A (ja) * 2001-08-30 2003-03-14 Matsushita Electric Ind Co Ltd 無線通信システム
EP1629677B1 (en) * 2003-06-05 2014-12-31 Meshnetworks, Inc. Optimal routing in ad hoc wireless communication network
JP2005303827A (ja) * 2004-04-14 2005-10-27 Ntt Docomo Inc 無線基地局、通信経路制御方法およびパケット転送方法
FR2878674A1 (fr) * 2004-12-01 2006-06-02 France Telecom Procede et systeme d'adaptation dynamique de metrique de qualite de service dans un reseau ad hoc
MX2007010937A (es) * 2005-03-10 2008-02-20 Thomson Licensing Protocolo de enrutamiento de malla hibrida.
PT1952588E (pt) * 2005-11-09 2011-08-25 Thomson Licensing Selecção de percurso em redes sem-fios

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2003152786A (ja) 2001-11-15 2003-05-23 Nec Corp 無線端末
JP2006279660A (ja) * 2005-03-30 2006-10-12 Sanyo Electric Co Ltd 通信方法ならびにそれを利用した無線装置および通信システム
JP2007129542A (ja) 2005-11-04 2007-05-24 Sony Corp 無線通信システム、無線通信装置及び無線通信方法、並びにコンピュータ・プログラム
JP2007288259A (ja) * 2006-04-12 2007-11-01 Sharp Corp アドホック機能付き携帯端末

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2011114424A (ja) * 2009-11-25 2011-06-09 Mega Chips Corp 通信システムおよび通信装置

Also Published As

Publication number Publication date
US20110038274A1 (en) 2011-02-17
EP2273822B1 (en) 2018-11-21
JP2009267532A (ja) 2009-11-12
KR101174579B1 (ko) 2012-08-16
JP4941397B2 (ja) 2012-05-30
CN102017716B (zh) 2014-06-11
EP2273822A4 (en) 2014-10-22
EP2273822A1 (en) 2011-01-12
CN102017716A (zh) 2011-04-13
US9210647B2 (en) 2015-12-08
KR20100137541A (ko) 2010-12-30

Similar Documents

Publication Publication Date Title
JP4941397B2 (ja) 経路情報中継方法および無線端末
JP4569328B2 (ja) 無線通信装置および経路探索方法
US6704283B1 (en) Traffic routing in small wireless data networks
JP4871393B2 (ja) 中継ネットワークにおける成功／失敗標示（ａｃｋ＿ｂｉｔｍａｐ）の送信
US20120099585A1 (en) Path notification
US9768917B2 (en) Communication control method, network system, and communication device
US7813309B2 (en) Radio multi-hop network, node, multicast route control method, and program thereof
JP4720794B2 (ja) マルチホップ通信ネットワークにおける隣接ノード確認方法、マルチホップ通信ネットワークのノード
JP2015015585A (ja) 無線通信装置、無線通信方法、無線通信プログラムおよび無線通信システム
US20110249612A1 (en) Wireless communication system preventing traffic from being relayed concentratively onto a specific node
JP5036602B2 (ja) 無線アドホック端末およびアドホック・ネットワーク・システム
JP5720793B2 (ja) データ転送方法およびそれを用いるノード装置
EP2375656A1 (en) Wireless communication apparatus and data relay method
EP3391683B1 (en) Method for managing a neighbor table and communication apparatus configured for managing a neighbor table
KR20120071953A (ko) 무선 네트워크에서 라우팅 정보 전송 방법 및 이를 지원하는 라우팅 장치
JP4193678B2 (ja) 通信端末および通信ネットワーク
JP4708111B2 (ja) アドホック・ネットワーク・システムおよびそのノード装置
Gruber et al. Ad hoc routing for cellular coverage extension
KR101062317B1 (ko) Ｏｌｓｒ 프로토콜에서 데이터의 효율적인 전송을 위한 멀티포인트 릴레이 이동 단말 선정 방법
JP4385926B2 (ja) 無線通信システム
KR101223054B1 (ko) 멀티포인트 릴레이 후보 단말 선정 방법
JP4687292B2 (ja) 通信装置及びネットワーク内で不要な無線リンクの切断方法
JP2008301446A (ja) マルチホップ通信ネットワークにおけるルート評価方法、マルチホップ通信ネットワークのノード
Siomina et al. Managing a broadcast infrastructure in ad hoc networks in presence of mobility: A new algorithmic framework
Preshiya et al. Data Delivery Predictability in Intermittently connected MANETs

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 200980114244.X

Country of ref document: CN

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

Ref document number: 09735806

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2009735806

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 20107023708

Country of ref document: KR

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE